Kra´skiewicz-Pragacz modules and some positivity properties of Schubert polynomials
Masaki Watanabe
Graduate School of Mathematical Sciences, the University of Tokyo
December 9, 2015
Schubert Polynomials
w: permutation Sw ∈Z[x1,x2, . . .]
(Swsi =∂iSw = Sxw−siSw
i−xi+1 (`(wsi)< `(w))
Sw0=x1n−1x2n−2· · ·xn−1 for the longest elementw0∈Sn
{Sw} ↔Schubert classes in the cohomology rings of flag varieties.
w: grassmannian i.e.
∃i,w(1)<· · ·<w(i),w(i+ 1)<w(i+ 2)<· · ·
=⇒ Sw = (a Schur polynomial in x1, . . . ,xi).
Examples for w ∈S3:
S123 = 1 S132 =x1+x2 S213 =x1 S231 =x1x2
Kra´skiewicz-Pragacz modules
w: permutation Sw ∈Z[x1,x2, . . .]
(Swsi =∂iSw = Sxw−siSw
i−xi+1 (`(wsi)< `(w))
Sw0=x1n−1x2n−2· · ·xn−1 for the longest elementw0∈Sn
{Sw} ↔Schubert classes in the cohomology rings of flag varieties.
w: grassmannian i.e.
∃i,w(1)<· · ·<w(i),w(i+ 1)<w(i+ 2)<· · ·
=⇒ Sw = (a Schur polynomial in x1, . . . ,xi).
Schur polynomials: characters of irreducible representations ofgln(C).
Schubert polynomials: characters ofKra´skiewicz-Pragacz modules.
Kra´skiewicz-Pragacz modules: Definition
K: field with characteristic 0
b=bn= Lie algebra ofn×n upper triangular matrices Kn=L
1≤i≤nKui: vector representation of b
D(w): Rothe diagramof a permutation w Sw: KP module Example: w = 3142
3 1 4 2
Kra´skiewicz-Pragacz modules: Definition
K: field with characteristic 0
b=bn= Lie algebra ofn×n upper triangular matrices Kn=L
1≤i≤nKui: vector representation of b
D(w): Rothe diagramof a permutation w Sw: KP module Example: w = 3142
3 1 4 2 D(w) ={(i,w(j)) :i <j,w(i)>w(j)}
={(1,1),(1,2),(3,2)}
Kra´skiewicz-Pragacz modules: Definition
K: field with characteristic 0
b=bn= Lie algebra ofn×n upper triangular matrices Kn=L
1≤i≤nKui: vector representation of b
D(w): Rothe diagramof a permutation w Sw: KP module Example: w = 3142
3 1 4 2
Kra´skiewicz-Pragacz modules: Property
For λ∈Zn,Mλ ={m∈M :hm=P
iλihi (∀h =diag(h1, . . . ,hn)∈b)}.
ch(M) =P
λdimMλxλ: characterof M (we only consider weight b-modules: i.e. finite dimensional modules having weight-space decompositions with respect to the subalgebra of diagonal matrices).
Theorem (Kra´skiewicz-Pragacz) ch(Sw) =Sw.
eg.
S3142 =hu1⊗(u1∧u3),u1⊗(u1∧u2)i ch(S3142) =x12x3+x12x2=S3142.
Kra´skiewicz-Pragacz modules: Examples
w =si: simple transposition
usi =ui
Ssi =Ku1⊕ · · · ⊕Kui ch(Ssi) =x1+· · ·+xi =Ssi
Kra´skiewicz-Pragacz modules: Examples
w: grassmannian i.e. w(1)<· · ·<w(i),w(i + 1)<w(i+ 2)<· · · eg. w = 13524
uw = a lowest vector in an irreducible representation of gli(C) Sw = an irreducible representation of gli(C)
ch(Sw) = (a Schur polynomial inx1, . . . ,xi) =Sw Remark: the examples we have seen are all special cases of Demazure modules, but in general they are different(equal only for 2143-avoidingw).
Filtrations by Kra´skiewicz-Pragacz modules
A KP filtrationof a (weight) b-module M is a filtration
M =Mr ⊃Mr−1 ⊃ · · · ⊃M0 = 0 such that each Mi/Mi−1 is isomorphic to KP modules.
Question
What kind ofb-modules M have KP filtrations?
Question
Why such question?
Motivation: Schubert positivity.
Filtrations by Kra´skiewicz-Pragacz modules
A KP filtrationof a (weight) b-module M is a filtration
M =Mr ⊃Mr−1 ⊃ · · · ⊃M0 = 0 such that each Mi/Mi−1 is isomorphic to KP modules.
Question
What kind ofb-modules M have KP filtrations?
Question
Why such question?
Motivation: Schubert positivity.
Filtrations by Kra´skiewicz-Pragacz modules
A KP filtrationof a (weight) b-module M is a filtration
M =Mr ⊃Mr−1 ⊃ · · · ⊃M0 = 0 such that each Mi/Mi−1 is isomorphic to KP modules.
Question
What kind ofb-modules M have KP filtrations?
Question
Why such question?
Motivation: Schubert positivity.
Schubert positivity
The productSwSv of Schubert polynomials is always
Schubert-positive, i.e. a positive sum of Schubert polynomials.
Classically proved geometrically: by interpreting the coefficients in SwSv =P
ucwvu Su as the number of intersections of certain subvarieties in a flag variety.
Combinatorists seek for some combinatorial objects which “counts” the coefficientscwvu (like eg. Littlewood-Richardson tableaux for products of Schur functions). Or at least combinatorial proofs for the positivity.
Representation-theoretic way?
Theplethysm of a symmetric functionf with a polynomial (or a power series)g =xα+xβ+· · · is defined asf[g] =f(xα,xβ, . . .).
Classical fact: the plethysmsλ[sµ] of Schur functions is Schur-positive. sλ[Sw]: Schubert-positive?
Schubert positivity
The productSwSv of Schubert polynomials is always
Schubert-positive, i.e. a positive sum of Schubert polynomials.
Classically proved geometrically: by interpreting the coefficients in SwSv =P
ucwvu Su as the number of intersections of certain subvarieties in a flag variety.
Combinatorists seek for some combinatorial objects which “counts” the coefficientscwvu (like eg. Littlewood-Richardson tableaux for products of Schur functions). Or at least combinatorial proofs for the positivity.
Representation-theoretic way?
Theplethysm of a symmetric functionf with a polynomial (or a power series)g =xα+xβ+· · · is defined asf[g] =f(xα,xβ, . . .).
Classical fact: the plethysmsλ[sµ] of Schur functions is Schur-positive.
s [S ]: Schubert-positive?
Schubert positivity and KP modules
IfM has a KP filtration M =Mr ⊃Mr−1 ⊃ · · · ⊃M0 = 0 with Mi/Mi−1 ∼=Swi thench(M) =Pch(Swi) =P
Swi is Schubert-positive.
So:
Question
Does the tensor product module Sw ⊗ Sv have a KP filtration for any w and v?
Question
Does the Schur-functor image sλ(Sw) of a KP module have a KP filtration for anyλand w?
Question
What kind ofb-modules M have KP filtrations?
Schubert positivity and KP modules
IfM has a KP filtration M =Mr ⊃Mr−1 ⊃ · · · ⊃M0 = 0 with Mi/Mi−1 ∼=Swi thench(M) =Pch(Swi) =P
Swi is Schubert-positive.
So:
Question
Does the tensor product module Sw ⊗ Sv have a KP filtration for any w and v?
Question
Does the Schur-functor image sλ(Sw) of a KP module have a KP filtration for anyλand w?
Theorem (W.)
A weight b-module M with weights⊂Zn≥0 has a KP filtration if and only if Exti(M,Sw∗ ⊗K(k,k−1,...,k−n+1)) = 0 for anyw, any k ∈Zand any i ≥1 (Kλ denotes the one-dimensional b-module with weightλ).
Highest weight category structure onb-modules such that
standard objects = KP modules (cf. Polo, van der Kallen, . . . for Demazure modules).
Highest weight structure needs an ordering on the set of weights (roughly, we want an order≤such thatSw becomes a projective cover of Kcode(w) in the category of b-modules with weights≤code(w)): Example of our ordering:
(1,3,0,1,0)
|| code(25143)
≤(0,3,2,0,0)
|| code(15423)
since 25143−1≥
lex
15423−1.
Theorem (W.)
A weight b-module M with weights⊂Zn≥0 has a KP filtration if and only if Exti(M,Sw∗ ⊗K(k,k−1,...,k−n+1)) = 0 for anyw, any k ∈Zand any i ≥1 (Kλ denotes the one-dimensional b-module with weightλ).
Highest weight category structure onb-modules such that
standard objects = KP modules (cf. Polo, van der Kallen, . . . for Demazure modules).
Highest weight structure needs an ordering on the set of weights (roughly, we want an order≤such thatSw becomes a projective cover of Kcode(w) in the category of b-modules with weights≤code(w)):
Example of our ordering: (1,3,0,1,0)
|| code(25143)
≤(0,3,2,0,0)
|| code(15423)
since 25143−1≥
lex
15423−1.
Theorem (W.)
A weight b-module M with weights⊂Zn≥0 has a KP filtration if and only if Exti(M,Sw∗ ⊗K(k,k−1,...,k−n+1)) = 0 for anyw, any k ∈Zand any i ≥1 (Kλ denotes the one-dimensional b-module with weightλ).
Highest weight category structure onb-modules such that
standard objects = KP modules (cf. Polo, van der Kallen, . . . for Demazure modules).
Highest weight structure needs an ordering on the set of weights (roughly, we want an order≤such thatSw becomes a projective cover of Kcode(w) in the category of b-modules with weights≤code(w)):
Example of our ordering:
(1,3,0,1,0)
||
code(25143)
≤(0,3,2,0,0)
||
code(15423)
since 25143−1≥
lex
15423−1.
Theorem (W.)
A weight b-module M with weights⊂Zn≥0 has a KP filtration if and only if Exti(M,Sw∗ ⊗K(k,k−1,...,k−n+1)) = 0 (∀w,k,∀i ≥1).
Corollary
IfM has a KP filtration then so does its direct summands.
If 0→L→M →N →0 is exact andM,N have KP filtrations then so doesL.
So:
Plethysm question can be reduced to Tensor product question since sλ(Sw) is a direct summand ofSw⊗|λ|.
Tensor product question can also be reduced to simplest caseSsi⊗ Sw (corresponding to Monk’s formula) which can be checked directly. Theorem (W.)
Sw⊗ Sv has a KP filtration for any w,v.
S-positivity ofSwSv
sλ(Sw) has a KP filtration for anyw, λ.
S-positivity ofsλ[Sw]
Theorem (W.)
A weight b-module M with weights⊂Zn≥0 has a KP filtration if and only if Exti(M,Sw∗ ⊗K(k,k−1,...,k−n+1)) = 0 (∀w,k,∀i ≥1).
Corollary
IfM has a KP filtration then so does its direct summands.
If 0→L→M →N →0 is exact andM,N have KP filtrations then so doesL.
So:
Plethysm question can be reduced to Tensor product question since sλ(Sw) is a direct summand ofSw⊗|λ|.
Tensor product question can also be reduced to simplest caseSsi⊗ Sw (corresponding to Monk’s formula) which can be checked directly.
Theorem (W.)
Sw⊗ Sv has a KP filtration for any w,v.
S-positivity ofSwSv
sλ(Sw) has a KP filtration for anyw, λ.
S-positivity ofsλ[Sw]
Theorem (W.)
A weight b-module M with weights⊂Zn≥0 has a KP filtration if and only if Exti(M,Sw∗ ⊗K(k,k−1,...,k−n+1)) = 0 (∀w,k,∀i ≥1).
Corollary
IfM has a KP filtration then so does its direct summands.
If 0→L→M →N →0 is exact andM,N have KP filtrations then so doesL.
So:
Plethysm question can be reduced to Tensor product question since sλ(Sw) is a direct summand ofSw⊗|λ|.
Tensor product question can also be reduced to simplest caseSsi⊗ Sw (corresponding to Monk’s formula) which can be checked directly.
Theorem (W.)
S-positivity of SwSv S-positivity ofsλ[Sw]
Theorem (W.)
A weight b-module M with weights⊂Zn≥0 has a KP filtration if and only if Exti(M,Sw∗ ⊗K(k,k−1,...,k−n+1)) = 0 (∀w,k,∀i ≥1).
Corollary
IfM has a KP filtration then so does its direct summands.
If 0→L→M →N →0 is exact andM,N have KP filtrations then so doesL.
So:
Plethysm question can be reduced to Tensor product question since sλ(Sw) is a direct summand ofSw⊗|λ|.
Tensor product question can also be reduced to simplest caseSsi⊗ Sw (corresponding to Monk’s formula) which can be checked directly.
Theorem (W.)
Sw⊗ Sv has a KP filtration for any w,v. S-positivity of SwSv sλ(Sw) has a KP filtration for anyw, λ. S-positivity ofsλ[Sw]
Sketch of S
si⊗ S
wcase = ⇒ general case
Corollary
(1) IfM has a KP filtration then so does its direct summands.
(2) If 0→L→M →N →0 is exact andM,N have KP filtrations then so doesL.
Repeated use of Monk case Ssi⊗ Ssj⊗ · · · ⊗ Ssk has a KP filtration.
Then so does its direct summandN
i
Vli(Ssi) =:T by (1).
Character calculation (T :Sw) = 1 and every other constituentSu satisfyu−1 >
lexw−1 (for suitable li).
Ext1(Sw,Su) = 0 for such u (a consequence of highest weight structure, in fact shown along the proof of highest weight structure)
0→ Sw →T →(mod. with filtr. bySu (u−1 >
lexw−1))→0. 0→ Sw⊗ Sv →T ⊗ Sv →(mod. with filtr. bySu⊗ Sv)→0. induction proceeds by (2).
Sketch of S
si⊗ S
wcase = ⇒ general case
Corollary
(1) IfM has a KP filtration then so does its direct summands.
(2) If 0→L→M →N →0 is exact andM,N have KP filtrations then so doesL.
Repeated use of Monk case Ssi⊗ Ssj⊗ · · · ⊗ Ssk has a KP filtration.
Then so does its direct summandN
i
Vli(Ssi) =:T by (1).
Character calculation (T :Sw) = 1 and every other constituentSu satisfyu−1 >
lexw−1 (for suitable li).
Ext1(Sw,Su) = 0 for such u (a consequence of highest weight structure, in fact shown along the proof of highest weight structure)
0→ Sw →T →(mod. with filtr. bySu (u−1 >
lexw−1))→0. 0→ Sw⊗ Sv →T ⊗ Sv →(mod. with filtr. bySu⊗ Sv)→0. induction proceeds by (2).
Sketch of S
si⊗ S
wcase = ⇒ general case
Corollary
(1) IfM has a KP filtration then so does its direct summands.
(2) If 0→L→M →N →0 is exact andM,N have KP filtrations then so doesL.
Repeated use of Monk case Ssi⊗ Ssj⊗ · · · ⊗ Ssk has a KP filtration.
Then so does its direct summandN
i
Vli(Ssi) =:T by (1).
Character calculation (T :Sw) = 1 and every other constituentSu satisfyu−1 >
lexw−1 (for suitable li).
Ext1(Sw,Su) = 0 for such u (a consequence of highest weight structure, in fact shown along the proof of highest weight structure)
0→ Sw →T →(mod. with filtr. bySu (u−1 >w−1))→0.
Highest weight structure & explicit filtrations
Highest weight stucture for KP modules also turns out to be useful in constructing explicit KP filtrations of some modules:
eg. M=Sw⊗Sd(Ki) (character expansion known as Pieri rule) Basic strategy: if ch(M) =Sw1+· · ·+Swr, find v1, . . . ,vr ∈M and suitable b-homs φ1, . . . , φr so thatφi(vi) =uwi,φi(vj) = 0 (j <i) hv1, . . . ,vii/hv1, . . . ,vi−1iSwi simple dimension-counting argument shows that 0⊂ hv1i ⊂ hv1,v2i ⊂ · · · gives a desired filration.
Main difficulty: we only knoww1, . . . ,wr up to their indexing. Highest weight structure: Ext1(Sw,Su) = 0 ifu−1 >
lexw−1 so we can always take w1−1 ≤
lex
w2−1≤
lex
· · · (if we takev andφ correctly). Theorem (W.)
Explicit construction of KP filtrations for Sw⊗Sd(Ki) andSw⊗Vd(Ki). (remark: Pieri rule for KP modules another proof for the h.w. structure)
Highest weight structure & explicit filtrations
Highest weight stucture for KP modules also turns out to be useful in constructing explicit KP filtrations of some modules:
eg. M=Sw⊗Sd(Ki) (character expansion known as Pieri rule) Basic strategy: if ch(M) =Sw1+· · ·+Swr, find v1, . . . ,vr ∈M and suitable b-homs φ1, . . . , φr so thatφi(vi) =uwi,φi(vj) = 0 (j <i) hv1, . . . ,vii/hv1, . . . ,vi−1iSwi simple dimension-counting argument shows that 0⊂ hv1i ⊂ hv1,v2i ⊂ · · · gives a desired filration.
Main difficulty: we only knoww1, . . . ,wr up to their indexing.
Highest weight structure: Ext1(Sw,Su) = 0 ifu−1 >
lexw−1 so we can always take w1−1 ≤
lex
w2−1≤
lex
· · · (if we takev andφ correctly). Theorem (W.)
Explicit construction of KP filtrations for Sw⊗Sd(Ki) andSw⊗Vd(Ki). (remark: Pieri rule for KP modules another proof for the h.w. structure)
Highest weight structure & explicit filtrations
Highest weight stucture for KP modules also turns out to be useful in constructing explicit KP filtrations of some modules:
eg. M=Sw⊗Sd(Ki) (character expansion known as Pieri rule) Basic strategy: if ch(M) =Sw1+· · ·+Swr, find v1, . . . ,vr ∈M and suitable b-homs φ1, . . . , φr so thatφi(vi) =uwi,φi(vj) = 0 (j <i) hv1, . . . ,vii/hv1, . . . ,vi−1iSwi simple dimension-counting argument shows that 0⊂ hv1i ⊂ hv1,v2i ⊂ · · · gives a desired filration.
Main difficulty: we only knoww1, . . . ,wr up to their indexing.
Highest weight structure: Ext1(Sw,Su) = 0 ifu−1 >
lexw−1 so we can always take w1−1 ≤
lex
w2−1≤
lex
· · · (if we takev andφ correctly).
Theorem (W.)
Explicit construction of KP filtrations for Sw⊗Sd(Ki) andSw⊗Vd(Ki). (remark: Pieri rule for KP modules another proof for the h.w. structure)
Highest weight structure & explicit filtrations
Highest weight stucture for KP modules also turns out to be useful in constructing explicit KP filtrations of some modules:
eg. M=Sw⊗Sd(Ki) (character expansion known as Pieri rule) Basic strategy: if ch(M) =Sw1+· · ·+Swr, find v1, . . . ,vr ∈M and suitable b-homs φ1, . . . , φr so thatφi(vi) =uwi,φi(vj) = 0 (j <i) hv1, . . . ,vii/hv1, . . . ,vi−1iSwi simple dimension-counting argument shows that 0⊂ hv1i ⊂ hv1,v2i ⊂ · · · gives a desired filration.
Main difficulty: we only knoww1, . . . ,wr up to their indexing.
Highest weight structure: Ext1(Sw,Su) = 0 ifu−1 >
lexw−1 so we can always take w1−1 ≤
lex
w2−1≤
lex
· · · (if we takev andφ correctly).
Theorem (W.)