This paper develops K-theory formulas for orbit closures under orthogonal and symplectic groups, introducing polynomials that generalize Grothendieck polynomials and connect to Schur Q-functions.
Contribution
It introduces new polynomials representing K-theory classes of orbit closures, characterizes them uniquely, and provides explicit formulas including Pfaffian and degeneracy locus expressions.
Explicit Pfaffian formulas derived for special cases.
03
Limit recovers K-theoretic Schur Q-functions.
Abstract
The complex orthogonal and symplectic groups both act on the complete flag variety with finitely many orbits. We study two families of polynomials introduced by Wyser and Yong representing the K-theory classes of the closures of these orbits. Our polynomials are analogous to the Grothendieck polynomials representing K-classes of Schubert varieties, and we show that like Grothendieck polynomials, they are uniquely characterized among all polynomials representing the relevant classes by a certain stability property. We show that the same polynomials represent the equivariant K-classes of symmetric and skew-symmetric analogues of Knutson and Miller's matrix Schubert varieties. We derive explicit expressions for these polynomials in special cases, including a Pfaffian formula relying on a more general degeneracy locus formula of Anderson. Finally, we show that taking an appropriate…
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Full text
K-theory formulas for orthogonal and symplectic orbit closures
The complex orthogonal and symplectic groups both act on the complete flag variety with finitely many orbits. We study two families of polynomials
introduced by Wyser and Yong representing the K-theory classes of the closures of these orbits. Our polynomials are analogous to the Grothendieck polynomials representing K-classes of Schubert varieties, and we show that like Grothendieck polynomials, they are uniquely characterized among all polynomials representing the relevant classes by a certain stability property. We show that the same polynomials represent the equivariant K-classes of symmetric and skew-symmetric analogues of Knutson and Miller’s matrix Schubert varieties. We derive explicit expressions for these polynomials in special cases, including a Pfaffian formula relying on a more general degeneracy locus formula of Anderson. Finally, we show that taking an appropriate limit of our representatives recovers the K-theoretic Schur Q-functions of Ikeda and Naruse.
1 Introduction
Our results in this paper concern two families of polynomials
representing K-theory classes of orbit closures in the complete flag variety,
which we call orthogonal and symplectic Grothendieck polynomials.
For motivation, we start by reviewing
the classical story of Grothendieck polynomials, which
represent the K-theory classes of type A Schubert varieties.
Let n be a positive integer
and write GLn=GLn(C) for the general linear group of
invertible n×n complex matrices. Define B⊆GLn
to be the Borel subgroup of invertible lower triangular matrices.
Suppose X is a smooth complex algebraic variety.
Let K(X) denote
the Grothendieck group of coherent sheaves on X equipped with a ring structure induced by the (derived) tensor product. This the usual K-theory ring of X.
We write CK(X) for the
connective K-theory ring of X introduced by Cai [8].
This is a certain graded algebra over the coefficient ring Z[β],
which can be interpreted as the connective K-theory ring of
a point. For any closed equidimensional subscheme Y⊆X,
there is an associated K-theory class [Y]K∈K(X), namely the class of the structure sheaf of Y, and an associated
connective K-theory class [Y]CK∈CK(X).
We define
the complete flag varietyFln:=B\GLn
to be the set of right cosets of B in GLn.
The ordinary K-theory ring of Fln can be realized as
[TABLE]
and the connective K-theory ring as
[TABLE]
where β,x1,x2,… are commuting indeterminates and IΛn⊆Z[x1,x2,…,xn] is the ideal
generated by symmetric polynomials without constant term in the variables x1,x2,…,xn; see §2.2.
Let Sn denote the symmetric group of permutations of [n]:={1,2,…,n}
and identify w∈Sn with the permutation matrix in GLn with
1 in position (i,w(i)).
It follows by elementary linear algebra that
the opposite Borel subgroup B+ of upper triangular matrices in GLn acts on Fln on the right with n!=∣Sn∣ distinct orbits.
The orbit closures Xw:=BwB+ for w∈Sn
are the Schubert varieties in Fln
and one is interested in describing the classes [Xw]∈CK(Fln).
For v∈Sn and w∈Sm, let v×w∈Sn+m be the permutation with i↦v(i) for i∈[n] and n+i↦n+w(i) for i∈[m]. We also write wm for the m-fold product w×w×⋯×w, so that 1m is the identity in Sm. Many different polynomials correspond to each class [Xw]∈CK(Fln) under the isomorphism (1.2), but if one also requires a certain compatibility condition with respect to the maps w↦w×1m,
then there is a unique family of such polynomials:
Theorem 1.1**.**
There are unique polynomials
Gw∈Z[β][x1,x2,…] for n∈P and w∈Sn
such that
Gw+IΛn[β]=[Xw]∈CK(Fln)
and Gw=Gw×1.
This statement combines several known results reviewed in Section 2.2.
The polynomials Gw are the (generalized) Grothendieck polynomials introduced in [13].
The Schubert polynomials (see [33, Chapter 2])
are the special case of these functions with β=0.
Setting β=−1 and replacing each variable xi by 1−xi,
alternatively, recovers Lascoux and Schützenberger’s original definition of Grothendieck polynomials
in [30, 31].
It is a remarkable observation of Fomin and Kirillov [13] that the sequence of polynomials G1m×w converges as m→∞ to a symmetric function:
There are unique symmetric functions
Gw for each n∈P and w∈Sn
such that
Gw(x1,…,xn)=G1N×w(x1,…,xn)
for all N≥n.
Following established practice,
we refer to the symmetric functions Gw as stable Grothendieck polynomials.
These power series have a number of other interesting properties and are studied in [6, 7, 13].
The preceding results have interesting counterparts for the
orbit closures of the orthogonal and symplectic groups acting on Fln.
These actions are particularly natural to consider:
they both have finitely many orbits,
and correspond to two of the three families of type A symmetric varieties [42].
(The third family comes from the action of GLp×GLn−p on Fln;
K-theory representatives for the relevant orbit closures are
studied in [45].)
Fix nondegenerate symmetric and skew-symmetric bilinear forms on Cn.
We define the orthogonal groupOn and the symplectic groupSpn as
the subgroups of GLn preserving these forms. Note that n must be even in the skew-symmetric case. As explained in [42, §10], the On-orbits on Fln are in bijection with the set of involutions
[TABLE]
while the Spn-orbits are in bijection with the set of fixed-point-free involutions
[TABLE]
We write {XzO:z∈In} and {XzSp:z∈InFPF} for the respective families of Kn-orbit closures, where K is one of the symbols O or Sp; see §2.3 for explicit descriptions of these varieties.
We can now state symplectic and orthogonal analogues of Theorem 1.1:
such that
GzSp+IΛn[β]=[XzSp]∈CK(Fln)
and GzSp=Gz×21Sp.
The derivation of this statement from the results in [46],
which is not entirely trivial, is explained in Section 3.3.
The following theorem is new:
Theorem 1.4**.**
There are unique polynomials
[TABLE]
such that
GzO+IΛn[β]=[XzO]∈CK(Fln)
and GzO=Gz×1O.
We refer to
GzSp and GzO as symplectic and orthogonal Grothendieck polynomials.
Setting β=0 transforms these functions to the (fixed-point-free) involution Schubert polynomialsS^zFPF and S^z studied in [17, 19, 21, 46].
The latter represent the cohomology classes of the orbit closures XzSp and XzO.
Wyser and Yong
[46] give a recursive method for computing GzSp involving divided difference operators; see Theorem 3.10.
By contrast, no simple algebraic formulas for computing GzO are known for general z∈In.
This notably differs from the situation for the involution Schubert polynomials S^z,
which can again be characterized using divided differences [46].
We prove Theorems 1.3 and 1.4 in a uniform way
in Section 3.1
by adapting an idea of Knutson and Miller [28]. The B+-orbits on B\GLn=Fln are naturally in bijection with the B×B+-orbits on GLn. The closures Mw of the latter orbits in the space Matn of n×n matrices are known as matrix Schubert varieties.
Let T denote the torus of invertible diagonal matrices in GLn.
Knutson and Miller prove that the class [Mw]T in the T-equivariant K-theory ring KT(Matn)≅Z[x1,x2,…,xn]
is the polynomial obtained from Gw by setting β=−1.
Using this fact, one can show that Gw+IΛn[β]=[Xw]∈CK(Fln).
The Kn-orbits on Fln are in bijection with the B-orbits on GLn/Kn. Embedding GLn/Kn as an open dense subset of the space of symmetric matrices MatnO or skew-symmetric matrices MatnSp, as appropriate, and taking the closures of these B-orbits gives a family of (skew-)symmetric matrix Schubert varietiesMXzK; see Definition 2.15.
The following is a consequence of our results in Section 2.4:
Theorem 1.5**.**
Fix K∈{O,Sp} and let z∈In.
Assume n is even and z∈InFPF if K=Sp. The T-equivariant class [MXzK]T∈KT(MatnK)≅Z[x1,x2,…,xn] is then the polynomial
obtained from GzK by setting β=−1.
We now turn to analogues of Theorem 1.2.
The next result follows from Theorem 1.2 and Corollary 4.6:
Theorem 1.6**.**
There are unique symmetric functions
GPzSp for each n∈2P and z∈InFPF
such that
GPzSp(x1,…,xn)=G(21)N×zSp(x1,…,xn)
for all N≥n.
In the orthogonal case, we have only succeeded in proving a partial analogue of Theorem 1.2. A permutation is vexillary if it avoids the pattern 2143.
The following is a corollary of Theorem 4.11:
Theorem 1.7**.**
There are unique symmetric functions
GQzO for each n∈P and vexillary z∈In
such that
GQzO(x1,…,xn)=G1N×zO(x1,…,xn)
for all N≥n.
Our proof of Theorem 1.7 relies on an explicit Pfaffian formula for GzO when z is vexillary, which we derive by realizing XzO as a type C Grassmannian degeneracy locus and applying a formula of Anderson [2] for the K-theory classes of such loci.
The main result of [35] shows that GPzSp is an N[β]-linear combination of the K-theoretic Schur P-functionsGPλ of Ikeda and Naruse [26]. When z is vexillary, we prove that GQzO is likewise a K-theoretic Schur Q-functionGQλ, also introduced in [26].
The degeneracy locus formulas in [2] are very complicated
and we find it amazing that the expressions we derive for GQzO in the vexillary case
coincide exactly with symmetric functions already considered in the literature.
We expect that Theorem 1.7 holds for all involutions z∈In, and that the resulting power series GQzO are N[β]-linear combinations of the GQλ functions.
Section 5 discusses several other related open problems.
Acknowledgements
The first author was supported by Hong Kong RGC Grant ECS 26305218.
We are grateful to Dave Anderson, Bill Fulton, Zach Hamaker, Hiroshi Naruse, and Alex Yong
for many helpful comments.
2 Preliminaries on connective K-theory
This section provides
an expository overview of
connective K-theory
and then describes a general method of constructing polynomial K-theory
representatives for orbit closures in the complete flag variety.
Throughout, the symbols β, a1, a2, …, x1, x2, … denote commuting indeterminates.
We write N={0,1,2,…} and P={1,2,3,…} for the sets of nonnegative and positive integers,
and define [n]:={i∈P:i≤n} for n∈N.
Given n∈P,
let Sn denote the usual symmetric group of bijections [n]→[n].
The length of a permutation w is
ℓ(w):=∣{(i,j):i<j and w(i)>w(j)}∣.
2.1 Connective K-theory
Let X be a smooth complex variety.
Recall that the ordinary K-theory ring of X
is
the Grothendieck group K(X) of coherent sheaves on X, equipped with a ring structure induced by the derived tensor product.
The structure sheaf of any closed subscheme Z⊆X
has a class in K(X) which we denote by
[Z]K.
Let K(X,c) be the Grothendieck group of coherent sheaves whose support has codimension at least c∈Z, so that K(X,c)=K(X) whenever c≤0 and K(X,c)=0 whenever c>dim(X).
The derived tensor product leads to a ring structure on K(X,c).
The next definition
originates in [8] but our notation follows [2, 24].
Definition 2.1** (See [2, Appendix A] or [24, §2.1]).**
The connective K-theory ring of X is the graded Z[β]-algebra
[TABLE]
in which CKc(X) is the image of
the natural map K(X,c)→K(X,c−1), so that CKc(X)=K(X) whenever c≤0.
The maps K(X,c)→K(X,c−1) induce maps CKc(X)→CKc−1(X), and the Z[β]-algebra structure on CK(X) is defined by letting CKc(X)→CKc−1(X) be multiplication by −β.
Example 2.2**.**
A coherent sheaf on X=pt is a map pt→{V} for some finite-dimensional
complex vector space V. The Grothendieck group K(pt)=Z is generated by
the sheaf pt→{C}. All sheaves on pt have
codimension zero so K(pt,c)=Z for c≤0 and K(pt,c)=0 for c>0.
Identifying CKc(pt)≅Z for c≤0 with the free abelian group
Z-span{(−β)−c} lets us write CK(pt)=Z[β].
Suppose Z⊆X is a closed subscheme; its structure sheaf OZ has support Z, so
there is a corresponding class in K(X,codim(Z)),
whose image under the natural map K(X,codim(Z))→K(X) is [Z]K.
The connective K-class of Z is the image of the former class under the natural
map K(X,codim(Z))→CKcodim(Z)(X), which we denote by [Z]CK.
We drop the subscripts from [Z]K or [Z]CK when these are clear from context.
These classes are related as follows:
Proposition 2.3**.**
There is a Z[β]-algebra morphism
[TABLE]
with
ψ([Z]K)=(−β)codim(Z)[Z]CK for any closed subscheme Z⊆X.
Proof.
The map ψ is induced from the identity map K(X)→CK0(X). By definition, the image of [Z]CK∈CKcodim(Z)(X) in CK0(X) is (−β)codim(Z)[Z]CK, and this element of CK0(X)=K(X) is just [Z]K.
∎
2.2 Grothendieck polynomials for Schubert varieties
Fix a positive integer n.
As in the introduction, write GLn for the complex general linear group and
B for the Borel subgroup of lower triangular matrices in GLn.
We are primarily interested in the preceding definitions applied to
the complete flag varietyFln:=B\GLn.
For this choice of X, one can realize K(X) and CK(X) as quotients of a polynomial ring.
For each i∈[n], there is a natural line bundle Li on Fln,
whose fiber over an orbit Bg∈Fln
is the quotient Fi/Fi−1,
where Fi is the subspace of Cn spanned by the first i rows of g∈GLn.
Let IΛn denote the ideal in Z[x1,x2,…,xn]
generated by the symmetric polynomials without constant term.
mapping the first Chern class c1(Li∨) of the line bundle dual to Li to xi.
From now on, we identify the rings
K(Fln)=Z[x1,x2,…,xn]/IΛn
and
CK(Fln)=Z[β][x1,x2,…,xn]/IΛn[β]
via the preceding theorem.
For a closed subscheme Z⊆Fln,
it is then natural to ask for a polynomial
whose image in these quotient rings gives [Z]K or [Z]CK.
This question is well-understood for the Schubert varietiesXw.
Recall that these varieties are the closures of the
double cosets BwB+⊆Fln, where B+⊆GLn is the subgroup of upper triangular matrices and w ranges over the symmetric group
Sn, viewed as the subgroup of permutation matrices in GLn.
Let si=(i,i+1)∈Sn for each i∈[n−1].
Given f∈Z[β][x1,…,xn],
let sif be the polynomial formed from f by interchanging xi and xi+1,
and define
[TABLE]
We refer to ∂i and ∂i(β) as divided difference operators.
Write w1w2⋯wn for the permutation in Sn with the formula i↦wi.
The Grothendieck polynomials{Gw}w∈Sn are the unique family
in Z[β][x1,…,xn] with
Gn⋯321=x1n−1x2n−2⋯xn−11
and ∂i(β)Gw=Gwsi for all w∈Sn and i∈[n−1] such that w(i)>w(i+1).
It follows from the last property that ∂i(β)Gw=−βGw if w(i)<w(i+1).
It is also not hard to check that Gw=Gw×1 for all w∈Sn,
where w×1 denotes the permutation in Sn+1
with i↦w(i) for i∈[n] and n+1↦n+1.
Less obviously, one always has Gw∈N[β][x1,x2,…,xn]
[13, Theorem 2.3].
Example 2.6**.**
The Grothendieck polynomials for w∈S3 are
[TABLE]
Work of Hudson, extending earlier results of Fulton and Lascoux, shows
that
the polynomials Gw represent the Schubert classes
[Xw] in connective K-theory.
Specifically, the following
is the special case of [23, Theorem 1.2]
obtained
by taking V to be a trivial vector bundle of rank n over X=pt:
We typically suppress the parameter β in our notation,
but for the moment write Gw(β)=Gw for w∈Sn.
The Schubert polynomialSw of a permutation w∈Sn (see [33, Chapter 2])
is then Gw(0). It follows that {Gw}w∈Sn are linearly independent by [33, Proposition 2.5.3].
Some references use the term “Grothendieck polynomial” to refer to the polynomials Gw(−1).
One loses no generality in setting β=−1 since one can show by downward induction on permutation length that
[TABLE]
This lets us translate any formulas in Gw(−1) to formulas
in Gw=Gw(β).
The specialization β=−1 is natural since it corresponds to ordinary K-theory:
We can now describe the map in Proposition 2.3
for X=Fln.
Corollary 2.9**.**
If X=Fln then the map ψ:K(Fln)[β,β−1]→CK(Fln)[β−1] in Proposition 2.3
is the ring homomorphism sending xi↦−βxi for i∈[n].
Proof.
Since codim(Xw)=ℓ(w), it follows from Theorems 2.7 and 2.8 that
ψ(Gw(−1)+IΛn)=(−β)ℓ(w)Gw(β)+IΛn[β].
By (2.2), this agrees with the ring homomorphism Z[x1,…,xn]/IΛn→Z[β][x1,…,xn]/IΛn[β] sending xi↦−βxi for i∈[n].
As {Gw(−1)+IΛn:w∈Sn} is a basis for K(Fln) by
[33, Proposition 2.5.3 and Corollary 2.5.6], we conclude that ψ is equal to the latter map.
∎
2.3 Matrix Schubert varieties
For the remainder of this section, K denotes one of the symbols O or Sp.
Fix n∈P and write In and InFPF for the respective sets of involutions and fixed-point-free involutions
in the finite symmetric group Sn. If n is odd then
InFPF=∅.
If V1,V2 are complex vector spaces and α:V1×V2→C is a bilinear form, then we let rank(α) denote the rank of the map V2→V1∗ given by v↦α(⋅,v).
Let αnO be a fixed symmetric nondegenerate bilinear form on Cn.
When n is even, let αnSp be a fixed skew-symmetric nondegenerate bilinear form on Cn.
Define On to be the subgroup of GLn preserving αnO and Spn the subgroup preserving αnSp. Write A[i][j] for the upper-left i×j corner of a matrix A.
Given E=Bg∈Fln and i∈[n], define Ei⊆Cn to be the subspace spanned by the first i rows of g∈GLn;
these spaces do not depend on the choice of g.
Definition 2.10**.**
Given K∈{O,Sp} and z∈In, let
[TABLE]
where we identify z with its permutation matrix.
Each XzK is a closed subvariety of Fln.
The correspondence z↦XzO
is a bijection from In to the set of closures of the On-orbits on Fln;
when n is even, z↦XzSp is likewise a bijection
from InFPF to the set of closures of the Spn-orbits on Fln [44].
Although
we are primarily interested in XzSp in the case when z is fixed-point-free,
we have defined XzSp for any involution z∈In
and this flexibility will occasionally be convenient.
Many of the rank conditions in Definition 2.10 are redundant. The essential rank conditions can be read off from the following diagrams.
Definition 2.11**.**
Let z∈In. The orthogonal Rothe diagram of z is
[TABLE]
The symplectic Rothe diagram of z is
[TABLE]
The diagrams DO(z) and DSp(z) are the subsets of positions in the usual Rothe diagramD(z):=\{(i,z(j)):\text{(i,j)\in[n]\times[n],z(i)>z(j),andi<j}\}
that are weakly and strictly below the main diagonal, respectively.
where elements of DO(z) are drawn with ∘, points (i,z(i)) with ×, and the diagram is shown in matrix coordinates with (1,1) at the upper left. We have Ess(DO(z))={(2,1)} and rank(z[2][1])=0, so
[TABLE]
Let MatnO (respectively, MatnSp) be the set of complex n×n matrices that are symmetric (respectively, skew-symmetric).
The space MatnK contains a family of varieties closely related to XzK:
Definition 2.15**.**
Given K∈{O,Sp} and z∈In, let
[TABLE]
We call the closed subvariety MXzO (respectively, MXzSp) a symmetric matrix Schubert variety
(respectively, skew-symmetric matrix Schubert variety). If one allows arbitrary z∈Sn and arbitrary matrices in Definition 2.15, then one
recovers Knutson and Miller’s notion of a matrix Schubert variety from [28].
The variety MXzK is also an orbit closure,
but now for the Borel subgroup B⊆GLn,
which acts on A∈MatnK by b:A↦bAbT. The
maps z↦MXzO and z↦MXzSp
are bijections from In and InFPF to the closures of the B-orbits in MatnO and MatnSp,
respectively; see [3, 9].
There is an analogue of Proposition 2.13:
Proposition 2.16**.**
Let K∈{O,Sp} and z∈In. Then
[TABLE]
Moreover, if n is even and z∈InFPF then
[TABLE]
Proof.
One can almost repeat the proof of [17, Proposition 3.16] verbatim;
the argument in [17] goes through after
replacing “y” by “z” and redefining “Cij” to be the set of symmetric (when K=O) or skew-symmetric
(when K=Sp and z∈InFPF) n×n matrices A with rank(A[i][j])≤rank(z[i][j]).
∎
2.4 Grothendieck polynomials for orbit closures
The orthogonal and symplectic matrix Schubert varieties have
canonical polynomial representatives in equivariant K-theory.
Here, we use these polynomials to give a uniform definition
of the Grothendieck polynomials GzO and GzSp
described in the introduction.
Suppose G is a linear algebraic group acting on a smooth complex variety X. The G-equivariant K-theory ringKG(X) is the Grothendieck group of G-equivariant vector bundles on X with tensor product as multiplication, or equivalently the Grothendieck group of G-equivariant coherent sheaves on X (now with the derived tensor product as multiplication).
If Z⊆X is a G-invariant subscheme, then we write [Z]∈KG(X) for the class of its structure
sheaf.
A G-equivariant vector bundle over a point is just a representation of G, so KG(pt) is the Grothendieck ring R(G) of finite-dimensional complex rational representations of G. If T≅(C×)n is a torus then KT(pt) can be identified with
the ring Z[a1±1,a2±1…,an±1]; the one-dimensional representation on which (t1,t2…,tn)∈T acts as multiplication by t1m1t2m2⋯tnmn has class a1m1a2m2⋯anmn, and every T-representation is a direct sum of such one-dimensional representations.
We summarize a few other properties we will need from [11, §5.2]:
•
A G-equivariant map f:X→Y between smooth complex varieties defines a pullback f∗:KG(Y)→KG(X), and this assignment is functorial. The pullback of X→pt makes the ring KG(X) into an algebra over KG(pt)≅R(G). The pullbacks f∗ are R(G)-algebra homomorphisms.
•
If f:X→Y is a flat morphism (e.g., the projection of a fiber bundle or inclusion of an open subset), then f∗([Z])=[f−1(Z)] for any G-invariant subscheme Z. Here, f−1(Z) is the scheme-theoretic inverse image, but if Z and the fibers of f are reduced, then the flatness of f implies f−1(Z) reduced [15, Proposition 11.3.13]. This will always be the case for us, so we can take f−1(Z) to be the set-theoretic inverse image.
•
If V is a finite-dimensional linear representation of G, then
there are isomorphisms KG(V)≅KG(pt)≅R(G) [11, Corollary 5.4.21].
•
Given a group homomorphism ϕ:H→G, there is a ring homomorphism KG(X)→KH(X) sending [Z] to [Z], since one can view a G-equivariant vector bundle as H-equivariant via ϕ. In particular, taking H to be the trivial subgroup of G, there is such a map KG(X)→K(X).
•
If G acts freely on X, then the pullback of the quotient X→X/G defines an isomorphism K(X/G)∼KG(X).
For each symbol K∈{O,Sp},
fix an n×n matrix ΩnK with αnK(v,w)=vTΩnKw for all v,w∈Cn.
Define T to be the torus of invertible diagonal matrices in GLn. Each t∈T acts on GLn by left multiplication and on A∈MatnK by t:A↦tAt.
Let σnK:GLn→MatnK be the T-equivariant map with σnK(g):=gΩnKgT
and write
[TABLE]
for its pullback.
If S⊆Fln=B\GLn, then we let B⋅S:={g∈GLn:Bg∈S}.
The pullback of the quotient GLn→T\GLn is an isomorphism
K(T\GLn)∼KT(GLn) since T acts freely on GLn.
The forgetful map
KB(GLn)→KT(GLn)
is also an isomorphism [11, §5.2.18].
Composing these maps
gives an isomorphism
[TABLE]
sending [Z] to [B⋅Z].
Let ϕ:KT(GLn)∼K(Fln) be the inverse of this map.
Theorem 2.17**.**
Choose a symbol K∈{O,Sp} and assume n is even if K=Sp.
The composition
KT(MatnK)(σnK)∗KT(GLn)ϕK(Fln)
maps [MXzK]↦[XzK]
for each z∈In.
Proof.
We just need to show that (σnK)∗ maps [MXzK]↦[B⋅XzK] for any z∈In.
Write Kn for the group On or Spn corresponding to the symbol K.
The map σnK factors as the quotient map GLn→GLn/Kn followed by the map GLn/Kn→MatnK sending gKn↦gΩnKgT, which is an isomorphism from GLn/Kn onto the open subset of invertible matrices in MatnK. This implies that σnK is a flat morphism, because it is the composition of two flat morphisms: the projection of a fiber bundle and the inclusion of an open subset.
It now suffices to show that (σnK)−1(MXzK)=B⋅XzK. Indeed, we have
g∈B⋅XzK if and only if the rows g1,g2,…,gn of g are such that the matrix A=[αnK(gp,gq)]p,q∈[n] has rank(A[i][j])≤rank(z[i][j]) for any i,j∈[n]. But A=σnK(g), so this condition is equivalent to σnK(g)∈MXzK.
∎
One way to realize the
isomorphism K(Fln)≅Z[x1,x2,…,xn]/IΛn
in Theorem 2.4
is as follows.
Let Matn denote the algebra of complex n×n matrices.
Since Matn is a finite-dimensional representation of T
under the action t:A↦tA,
the equivariant K-theory ring KT(Matn) is the representation ring R(T)≅Z[a1±1,a2±1…,an±1], and the following diagram commutes:
[TABLE]
Here, the vertical map on the left is the pullback of the inclusion ι:GLn↪Matn. Sending ai↦1−xi gives an isomorphism from the ring in the lower right to Z[x1,x2,…,xn]/IΛn. This change of variables reflects a general relationship between K(X) and the Chow ring of X.
Now suppose Y⊆Matn and Z⊆Fln are closed subschemes
such that ι∗[Y]:=[ι−1(Y)]=[Z]∈K(Fln).
The class [Y]∈KT(Matn)
may be canonically identified with a Laurent polynomial in Z[a1±1,…,an±1]
via the diagram above, and it can be shown that this element is actually a polynomial in a1,…,an
[11, §6.6].
After applying the change of variables ai↦1−xi,
this polynomial becomes a representative for [Z] in
the quotient Z[x1,…,xn]/IΛn≅K(Fln).
If V is any finite-dimensional linear representation of T
and σ:Matn→V is a T-equivariant map,
then composing the pullback σ∗:KT(V)→KT(Matn) with the isomorphism
KT(Matn)≅R(T) coincides with the canonical isomorphism KT(V)≅R(T)
described by [11, Corollary 5.4.21].
Therefore, taking σ to be the map Matn→MatnK with g↦gΩnKgT,
we can repeat everything in the previous paragraph for
closed subschemes Y⊆MatnK.
In particular, to obtain “canonical” polynomial representatives for
the varieties Z=XzK, we
can apply the preceding construction with Y=MXzK:
Definition 2.18**.**
For each K∈{O,Sp} and z∈In, let
[TABLE]
be the polynomial
obtained from
[MXzK]∈KT(MatnK)≅Z[a1±1,…,an±1]
by substituting ai↦1+βxi for i∈[n] and then dividing by (−β)codim(MXzK).
After the substitution ai↦1+βxi, the lowest degree of a monomial appearing in [MXzK] is codim(MXzK) by [37, Claim 8.54], so GzK is in fact completely determined by [MXzK]. These codimensions can also be computed combinatorially: if y∈In and z∈InFPF then
codim(MXyO)=∣DO(y)∣ and codim(MXzSp)=∣DSp(z)∣ [39, Lemma 5.4].
A method for computing codim(MXzSp) for z∈In∖InFPF is
implicit in the proof of
[39, Theorem 6.11], though this is slightly nontrivial.
We refer to GzO and GzSp as orthogonal and symplectic Grothendieck polynomials.
The polynomials GzK can actually be defined without inverting β:
Theorem 2.19**.**
For each K∈{O,Sp} and z∈In, it holds that
[TABLE]
Proof.
By the preceding discussion and Theorem 2.17,
applying the change of variables ai↦1−xi to
[MXzK]∈KT(MatnK)≅Z[a1±1,…,an±1]
gives a polynomial in Z[x1,…,xn] whose image in
K(Fln)=Z[x1,…,xn]/IΛn
is [XzK].
Since one obtains (−β)codim(MXzK)GzK from this polynomial by
substituting xi↦−βxi by Corollary 2.9,
Proposition 2.3
implies
that we have
GzK+IΛn[β,β−1]=[XzK]∈CK(Fln)[β−1].
To finish the proof,
it is enough to show that
after substituting ai↦1−xi, the polynomial [MXzK] has no
terms of degree less than codim(MXzK) in the xi variables.
However, as will be explained in more detail in Section 3.2,
this polynomial can be computed in terms of multigraded Hilbert series,
and from this perspective the needed degree property is exactly [37, Claim 8.54].
∎
Example 2.20**.**
The symplectic Grothendieck polynomials for z∈I4FPF are
[TABLE]
The smallest example of GzSp where z is not Sp-dominant
(see Theorem 3.8)
is
[TABLE]
We have computed these examples using Theorem 3.10.
Example 2.21**.**
The orthogonal Grothendieck polynomials for z∈I3 are
[TABLE]
We have computed these examples using Theorem 3.6 and Macaulay2.
3 More on Grothendieck polynomials
Continue to let n be a fixed positive integer.
Our goal in this section is to outline the notable properties of
the orthogonal and symplectic
Grothendieck polynomials
GzO and GzSp.
The results here will also explain more direct methods
of computing these polynomials.
3.1 Stability
To start, we prove that the polynomials GzK for K∈{O,Sp} are
stable under the natural inclusions In↪In+1 and InFPF↪In+2FPF (applied to the indices z).
In the K=Sp case, this corresponds to [46, Theorem 4].
Define a map p:Matn+1K↠MatnK by p(A)=A[n][n].
To distinguish between the tori in GLn and GLn+1, write Tn=T
for the subgroup of invertible diagonal matrices in GLn.
Letting the last factor of Tn+1 act on MatnK trivially, the map p is then Tn+1-equivariant,
and the projection
Tn+1→Tn induces a ring homomorphism
KTn(MatnK)→KTn+1(MatnK) with [Z]↦[Z].
Lemma 3.1**.**
Choose a symbol K∈{O,Sp}.
The composition
[TABLE]
maps [MXzK]↦[MXz×1K] for each z∈In.
Proof.
Since Ess(DK(z))=Ess(DK(z×1)),
it follows in view of Proposition 2.16 that p−1(MXzK)=MXz×1K, which suffices as p∗[MXzK]=[p−1(MXzK)].
∎
Recall that if w∈Sn then we write w×21 for the permutation
in Sn+2 that maps i↦w(i) for i∈[n], n+1↦n+2, and n+2↦n+1.
Theorem 3.2**.**
For each K∈{O,Sp} and z∈In it holds that Gz×1K=GzK.
Moreover, if n is even and z∈InFPF then Gz×21Sp=GzSp.
where the first arrow is the linear map that sends each representation π:Tn→GL(V) to π∘p:Tn+1→GL(V); the second arrow must be the identity map since this is the unique R(Tn+1)-algebra morphism
R(Tn+1)→R(Tn+1).
After identifying R(Tn) with Z[a1±1,…,an±1], (3.2) becomes the inclusion
[TABLE]
so the first claim in the theorem follows from Lemma 3.1.
For the second claim, assume n is even and z∈InFPF. If u=z×21 and v=z×12,
then we have rank(u[n+1][n+1])+1=rank(v[n+1][n+1])=n+1
while
rank(u[i][j])=rank(v[i][j]) for all (n+1,n+1)=(i,j)∈[n+2]×[n+2].
Since rank(A[n+1][n+1]) is necessarily even
if A is skew-symmetric,
it follows by Definition 2.15 that
MXz×21Sp=MXz×12Sp, so Gz×21Sp=Gz×12Sp=Gz×1Sp=GzSp.
∎
As an application, we can now prove Theorems 1.3 and 1.4.
We require one lemma.
Recall that IΛn is the ideal in Z[x1,x2,…,xn] generated by the elements
that are symmetric in x1,x2,…,xn and have zero constant term.
Lemma 3.3**.**
Suppose n1,n2,n3,… is a sequence of positive integers with limi→∞ni=∞.
Then ⋂i=1∞IΛni=0.
The following argument is similar to the proof of [39, Lemma 2.11].
Write {Sw}w∈Sn for the usual family of Schubert polynomials
(see [33, Chapter 2]).
Proof.
Suppose f is a nonzero polynomial. Then f is a nontrivial linear combination of elements of {Sw:w∈SN}
for some N=ni [33, Proposition 2.5.4]. As {Sw+IΛN:w∈SN} is a Z-basis for Z[x1,…,xN]/IΛN
[33, Proposition 2.5.3 and Corollary 2.5.6], f is therefore nonzero in this ring.
∎
The existence assertions in these results
are Theorems 2.19 and 3.2.
The uniqueness of GzO and GzSp
follows from Lemma 3.3,
which
implies that
⋂i=1∞IΛn+i[β]=⋂i=1∞IΛn+2i[β]=0
for any n∈P.
∎
3.2 Dominant formulas
Continue to let
T=Tn be the torus of invertible diagonal matrices in GLn.
When V is a rational representation of T and Z⊆V is a T-invariant subscheme, there is a useful algebraic method for computing the polynomial [Z]∈KT(V),
which we will use to derive an explicit product formula for certain instances of the polynomials GzK.
Let X(T)=Hom(T,C×) be the character group of T. For λ∈X(T), let
[TABLE]
be the λ-weight space of V. Choosing coordinates on T uniquely identifies integers m1,…,mn with λ(t)=t1m1⋯tnmn for all t=(t1,…,tn)∈T. Accordingly, we identify λ with (m1,…,mn), and write aλ for the monomial a1m1⋯anmn.
Definition 3.4**.**
Suppose V is a rational representation of T such that each weight space Vλ is finite-dimensional. The Hilbert series of V is then
[TABLE]
When the variables are clear from context, we write H(V) in place of H(V,a).
Example 3.5**.**
Let t∈Tn act on C[z1,…,zn] as the algebra morphism sending zi to tizi. Consider first the case n=1. The nonzero weight spaces in C[z1] are C[z1](i) for i≥0, each of which is one-dimensional, so
the Hilbert series is defined and equal to
[TABLE]
If V and W are representations of Tm and Tn, then the Hilbert series of V⊗CW as a Tm×Tn-module is H(V,a1,…,am)H(W,am+1,…,am+n). In particular,
[TABLE]
Let Cλ be the one-dimensional representation of T on which t∈T acts as multiplication by λ(t). The weights of V are the elements of the unique multiset {λ1,…,λd} such that V≅⨁iCλi as a T-module. Let I(Z) be the ideal of Z in the coordinate ring C[V]:=Sym(V∗). The decomposition of V into one-dimensional weight spaces determines (up to scalars) an isomorphism C[V]≅C[z1,…,zd] with zi∈Vλi. The T-action on V defines a T-action on C[V], and since Z is T-invariant, so is the ideal I(Z).
Suppose that [math] is not a nontrivial nonnegative linear combination of the weights of V. Let Z⊆V be a T-invariant subscheme. Then
the quotient H(C[V]/I(Z))/H(C[V]) is a well-defined polynomial, which corresponds to the class [Z]∈KT(V) under the isomorphism KT(V)≅R(T)≅Z[a1,…,an].
The denominator H(C[V]) is easily computed: as in Example 3.5, it is the product ∏i=1d1/(1−aλi) where λ1,…,λd are the weights of V.
Example 3.7**.**
Take V=MatnO with T-action t:A↦tAt as above. If eij is the matrix with 1 in entry (i,j) and [math] in all other entries, then
[TABLE]
decomposes MatnO into one-dimensional weight spaces. Therefore the monomials aμ as μ varies over all weights are aiaj for 1≤i≤j≤n.
Let Z be the variety of matrices A∈MatnO with A11=A21=A12=0. Let zij:MatnO→C be the map A↦Aij, so that
C[MatnO]=C[zij:1≤i≤j≤n]. Then I(Z)=(z11,z12), so
[TABLE]
and hence
[TABLE]
Note that Z is the symmetric matrix Schubert variety XzO for z=321∈In. The preceding calculation shows that G321O=(2x1+βx12)(x1+x2+βx1x2).
For any polynomials x and y, let
[TABLE]
We say that z∈In is O-dominant
if it holds that
[TABLE]
for a strict partition μ=(μ1>μ2>⋯>μk>0).
Similarly, we define an involution z to be Sp-dominant if z∈InFPF and
[TABLE]
for a strict partition μ=(μ1>μ2>⋯>μk>0).
One can show that an involution is O-dominant if and only if
it is dominant in the classical sense of being a 132-avoiding permutation [17, Proposition 3.25].
Theorem 3.8**.**
Let K∈{O,Sp}
and suppose z∈In is K-dominant. Then
[TABLE]
Proof.
Assume that z∈InFPF if K=Sp.
It then follows from Proposition 2.16 and the fact that (i,z(i))∈/DK(z) for all i∈[n]
that
MXzK is just the set of matrices A∈MatnK with Aij=0 for all (i,j)∈DK(z). Thus, I(MXzK)=⟨zij:(i,j)∈DK(z)⟩ so codim(MXzK)=∣DK(z)∣. Exactly as in Example 3.7, this implies that
[MXzK]=∏(i,j)∈DK(z)(1−aiaj)∈KT(MatnK), which becomes
∏(i,j)∈DK(z)xi⊕xj
on making the transformations in
Definition 2.18.
∎
Remark**.**
We believe that when K=O, Theorem 3.8 holds if and only if z is O-dominant, and that when K=Sp and z∈InFPF, Theorem 3.8 holds if and only if z is Sp-dominant. However, Theorem 3.8 can also hold for GzSp with z∈In∖InFPF. We do not know a nice description of the set of such involutions z, but one can show that it includes all the O-dominant involutions.
As a special case, we recover two formulas of Wyser and Yong.
This follows by calculating DO(n⋯321) and DSp(n⋯321).
∎
3.3 Symplectic Grothendieck polynomials
Throughout this section, we assume that n∈2P is even.
Here, we investigate some properties of the polynomials
GzSp that are particular to the symplectic case.
Results of Wyser and Yong [46]
show that
the family {GzSp}z∈InFPF
can be completely characterized in terms of divided difference operators:
Let ai=1−xi and Di=∂i(−1) for i∈P.
Wyser and Yong [46, Theorem 4]
prove that there exists a unique family of polynomials
{ΥzSp}z∈InFPF⊆Z[x1,x2,…,xn]
with Υn⋯321Sp=∏1≤i<j≤n−i(1−aiaj)
and DiΥzSp=ΥsizsiSp for all i∈[n−1]
with i+1=z(i)>z(i+1)=i.
(In [46], the variable ai is written as xi.)
It is straightforward to check that the elements
[TABLE]
belong to Z[β][x1,x2,…,xn] and make up the unique family with the properties described in
Theorem 3.10.
It remains to show that these polynomials
are the same as the ones in Definition 2.18.
In view of Theorem 1.3 and Proposition 2.3,
it suffices to verify that
{ΥzSp}z∈InFPF
represent the classes
of the structure sheaves of {XzSp}z∈InFPF in ordinary K-theory
and that ΥzSp=Υz×21Sp.
This is [46, Theorems 3 and 4].
∎
We can describe the action of any ∂i(β) on GzSp.
Proposition 3.11**.**
Let z∈InFPF and i∈[n−1]. Then
[TABLE]
Proof.
Let y=sizsi.
We have ∂i(β)GzSp=GySp if i+1=z(i)>z(i+1)=i
by Theorem 3.10.
If z(i)<z(i+1) then
GzSp=∂i(β)GySp so ∂i(β)GzSp=−βGzSp since ∂i(β)∂i(β)=−β∂i(β).
Now suppose i+1=z(i)>z(i+1)=i. To show that ∂i(β)GzSp=−βGzSp,
it suffices by (3.6)
to check that siΥzSp=ΥzSp.
To show this, we resort to a geometric argument.
The action of Sn on Z[x1,x2,…,xn]
descends to an action on K(Fln)≅Z[x1,x2,…,xn]/IΛn.
Since ΥzSp=[XzSp]∈K(Fln) [46, Theorem 3],
it follows by Lemma 3.3
that we can just show that si[XzSp]=[XzSp]∈K(Fln).
Let q:T\GLn→B\GLn=:Fln be the quotient map. The left action of Sn on GLn which permutes rows descends to T\GLn and induces an Sn-action on K(T\GLn).
As noted in (2.3), the pullback q∗:K(Fln)→K(T\GLn) is an isomorphism; pulling back the Sn-action on K(T\GLn) gives the action of Sn on K(Fln) described in the previous paragraph
(see [40, §6]).
It is enough to show that q∗[XzSp]=[q−1(XzSp)] is si-invariant. We prove this by showing that the variety q−1(XzSp) itself is si-invariant.
Recall that Spn is defined as the subgroup of GLn preserving the fixed skew-symmetric
nondegenerate bilinear form αnK:Cn×Cn→C.
Proposition 2.13 implies that
if g∈GLn has rows g1,g2,…,gn, then
Tg∈q−1(XzSp) if and only if
the matrix A=[αnSp(gp,gq)]p,q∈[n] has rank(A[i][j])≤rank(z[i][j]) for any (i,j)∈Ess(DSp(z)).
These rank conditions are invariant under permuting rows i and i+1 of g so long as
row i of Ess(DSp(z)) is empty. The latter holds since if (i,j)∈DSp(z) then
we have j<z(i)=i+1 and j<i<z(j), and therefore also j<z(i+1)=i and j<i+1<z(j), so (i+1,j)∈DSp(z). Thus q∗[XzSp] is si-invariant,
and we conclude that ∂i(β)GzSp=−βGzSp. ∎
Any element of Z[β][[x1,x2,…]] whose homogeneous terms are polynomials
(treating β as
a scalar of degree zero)
can be uniquely expressed as a possibly infinite Z[β]-linear combination of ordinary Grothendieck polynomials.
Our next main result shows that the symplectic Grothendieck polynomials have a stronger property:
each GzSp
is actually a finite linear combination of the polynomials Gw with coefficients in {1,β,β2,…}.
In principle, this could also be deduced from general results of Brion [5, Theorem 4].
One advantage to our approach is that it will let us identify the summands appearing in the expansion
of GzSp in terms of Gw somewhat
explicitly.
Let Un denote the free Z-module with a basis given by the symbols
Uw for w∈Sn. Set Ui:=Usi for i∈P.
The abelian group Un
has a unique ring structure
with multiplication satisfying
[TABLE]
This is
the usual Iwahori-Hecke algebra of Sn
with q=0; see [25, Chapter 7].
Let Nn be the free Z-module with basis {Nz:z∈InFPF}.
Results of Rains and Vazirani (namely, [41, Theorems 4.6 and 7.1] with q=0)
imply that Nn has a unique structure as a right Un-module with
[TABLE]
It is shown in [34] that (the undegenerated form of) Nn
has a “quasi-parabolic Kazhdan-Lusztig basis”; it would be interesting to relate this basis
to the polynomials S^zFPF:=GzSp∣β=0 and GzSp, in analogy with results in [4, 43].
For z∈InFPF,
define
BFPF(z)={w∈Sn:N1FPFUw=Nz}
where we again let 1FPF=s1s3s5⋯sn−1.
This set is nonempty and
ℓFPF(z)≤ℓ(w) for all w∈BFPF(z). Define
AFPF(z)={w∈BFPF(z):ℓFPF(z)=ℓ(w)}.
We refer to the elements of AFPF(z) and BFPF(z) as atoms and Hecke atoms for z, respectively.
The set AFPF(z) consists of
the w∈Sn of minimal length
with z=w−1⋅1FPF⋅w.
Theorem 3.12**.**
If z∈InFPF then
GzSp=∑w∈BFPF(z)βℓ(w)−ℓFPF(z)Gw.
This result makes it clear that the family {GzSp}z∈InFPF is linearly independent.
Proof.
Define Σz:=∑w∈BFPF(z)βℓ(w)−ℓFPF(z)Gw for z∈InFPF.
We claim that
[TABLE]
for all z∈InFPF and i∈[n−1].
To show this, fix z∈InFPF and i∈[n−1]
and let y=sizsi∈InFPF.
There are three cases to consider.
First assume i+1=z(i)>z(i+1)=i.
If w∈BFPF(z) and w(i)>w(i+1),
then wsi∈BFPF(x) for some x∈InFPF
and Nz=N1FPFUw=N1FPFUwsUi=NxUi,
so x∈{y,z} and wsi∈BFPF(y)⊔BFPF(z).
Alternatively,
if v∈BFPF(y) then
N1FPFUvUi=NyUi=Nz, so
UvUi=Uv and v(i)<v(i+1) and vsi∈BFPF(z).
We conclude that
{w∈BFPF(z):w(i)>w(i+1)}
is the disjoint union
[TABLE]
Now, since ∂i(β)Gw=−βGw if w(i)<w(i+1), we have
[TABLE]
Since ℓFPF(z)=ℓFPF(y)+1, it follows that the first sum on the right is
[TABLE]
Substituting this into the previous equation gives ∂i(β)Σz=Σy.
If z(i)<z(i+1) then i+1=y(i)>y(i+1)=i, so
the previous paragraph
implies that Σz=∂i(β)Σy and ∂i(β)Σz=−βΣz as ∂i(β)∂i(β)=−β∂i(β).
Finally assume that i+1=z(i)>z(i+1)=i+1. If w∈BFPF(z) has w(i)>w(i+1),
then wsi∈BFPF(x) for some x∈InFPF and
Nz=N1FPFUw=N1FPFUwsUi=NxUi,
which implies the contradiction 0=NzUi=NxUi2=NxUi=Nz.
Thus every w∈BFPF(z) has w(i)<w(i+1),
so ∂i(β)Σz=−βΣz.
Thus (3.7) holds.
We argue by contradiction that GzSp=Σz for all z∈InFPF.
Let Δz:=GzSp−Σz and suppose z∈InFPF is of minimal length ℓFPF(z)
such that Δz=0.
We cannot have z=s1s3s5⋯sn−1 since then GzSp=Σz=1.
The set of indices I:={i∈[n−1]:i+1=z(i)>z(i+1)=i}
is therefore nonempty.
By Proposition 3.11, (3.7), and induction,
we have ∂i(β)Δz=0 for all i∈I and ∂i(β)Δz=−βΔz for all i∈/I.
This means that for each i∈[n−1], either Δz or (1+βxi+1)Δz
is symmetric in xi and xi+1.
The homogeneous term of Δz of lowest degree (with deg(xi):=1 and deg(β):=0) must therefore be symmetric in x1,x2,…,xn.
Since Δz=Δz×21, it follows that Δz
must actually be symmetric in all the xi-variables for i∈P.
Since Δz
is a polynomial, this can only occur if Δz has a nonzero constant term.
But it is easy to show by induction that both GzSp and Σz have no homogeneous terms of degree less than ℓFPF(z)≥1, so we reach a contradiction.
Hence no such z can exist, so GzSp=Σz for all z∈InFPF.
∎
Given w∈Sn,
write H(w) for the set of finite integer sequences i1i2⋯il
with Uw=Ui1Ui2⋯Uil.
Define HSp(z)=⨆w∈BFPF(z)H(w) for z∈InFPF.
We refer to the elements of H(w) (respectively, HSp(z)) as (symplectic) Hecke words.
One has i1i2⋯il∈HSp(z) if and only if Nz=N1FPFUi1Ui2⋯Uil.
Corollary 3.13**.**
Given a subset S={(a1,b1),(a2,b2),…,(al,bl)}⊆P×P
with a1≤a2≤⋯≤al and bk>bk+1 whenever ak=ak+1,
define
[TABLE]
If z∈InFPF then
GzSp=S⊆[n]×[n]δ(S)∈HSp(z)∑β∣S∣−ℓFPF(z)xS.
Proof.
The formula Gw=∑S⊆[n]×[n],δ(S)∈H(w)β∣S∣−ℓ(w)xS for w∈Sn
is [13, Theorem 2.3] (cf. [27, Corollary 5.4]),
so this follows from Theorem 3.12.
∎
The summands S appearing in Gw=∑S⊆[n]×[n],δ(S)∈H(w)β∣S∣−ℓ(w)xS
are K-theoretic versions of what are usually called RC-graphs or pipe dreams.
Corollary 3.14**.**
If z∈InFPF then GzSp∈N[β][x1,x2,…,xn].
Proof.
This holds as Gw∈N[β][x1,…,xn] for all w∈Sn [13, Theorem 2.3].
∎
We can describe BFPF(z) more concretely.
Fix an involution z∈InFPF and
suppose a1<a2<⋯ are the integers a∈[n] such that a<z(a),
arranged in increasing order.
Let bi=z(ai) for each i and define
[TABLE]
Write wi=w(i) for w∈Sn and i∈[n−1].
Let ≈FPF be the strongest equivalence relation on S∞
with v−1≈FPFw−1 whenever there is
an even index i∈2N and
integers a<b<c<d such that
vi+1vi+2vi+3vi+4 and wi+1wi+2wi+3wi+4
both belong to
{adbc,bcad,bdac}
and vj=wj for all j∈/{i+1,i+2,i+3,i+4}.
There is a complementary result for AFPF(z).
Let ≺FPF be the transitive closure of the relation on Sn
with v−1≺FPFw−1 whenever there is
an even index i∈2N and
integers a<b<c<d such that
vi+1vi+2vi+3vi+4=adbc
and
wi+1wi+2wi+3wi+4=bcad
and vj=wj for all j∈/{i+1,i+2,i+3,i+4}.
We have ℓFPF(4321)=ℓ(1342)=ℓ(3124)=ℓ(3142)−1=2 and
[TABLE]
Comparing with Example 2.20 shows that G4321Sp=G1342+G3124+βG3142.
3.4 Degeneracy locus formulas
In contrast to the symplectic case,
the polynomials GzO do not have an inductive description
in terms of divided difference operators, and it is an open problem to
find a general formula for GzO that improves on Theorem 3.6.
We will give a partial solution to this problem in Section 3.5.
As preparation,
we review some more general formulas from [2, 24] in this section.
Let X be a smooth complex variety.
Each vector bundle V over X
has Chern classescd(V)∈CKd(X) for d∈N and a Chern polynomial
[TABLE]
with the following properties
(see [2, Appendix A]):
(a)
It holds that c0(V)=1 and cd(V)=0 for d>rank(V).
2. (b)
We have c(V,t)=c(U,t)c(W,t) if 0→U→V→W→0 is a short exact sequence of vector bundles over X.
3. (c)
If rank(V)=1, then c1(V∗)=1+βc1(V)−c1(V).
4. (d)
If f:Y→X is a morphism, then c(f∗V,t)=f∗c(V,t)∈CK(Y)[t].
Since CKd(X)=0 for d>dim(X),
property (a)
implies that c(V,t) is invertible in CK(X)[t],
and any vector bundle V over X=pt must have c(V,t)=1.
It follows from property (d),
with the morphism Y→X replaced by X→pt,
that if V is a trivial vector bundle over X then c(V,t)=1.
Although the difference “V−W” for two vector bundles V and W over X is not defined,
we set
[TABLE]
We regard “−” defined in this way as a formal inverse of “⊕,”
which makes sense as property (b) implies that c((V⊕U)−(W⊕U),t)=c(V−W,t)
for any vector bundle U over X.
Let c0,c1,c2,… be indeterminates.
The raising operatorT associated to such a sequence is the linear operator on the space of arbitrary linear combinations of the ci variables that sends ci↦ci+1 for each i,
and
∑i∈Naici↦∑i∈Naici+1
for arbitrary coefficients ai.
We adopt the following conventions to make it easier to work with complicated expressions involving these operators:
•
If f(x) is a function with a Laurent expansion ∑m∈Zamxm at x=0,
then we take f(T) to mean ∑m∈ZamTm. For instance,
[TABLE]
•
We write T−1 for the operator sending
∑i∈Naici↦∑i∈Nai+1ci, so that
T−1(ci)=ci−1 for i>0 and T−1(c0)=0.
The composition T−1T is the identity operator while TT−1 sends ci↦ci for i>0 and c0↦0.
•
Given a finite collection of sequences of indeterminates c0(i),c1(i),c2(i),… for i∈[n],
we write T(i) for the raising operators that act on monomials by
[TABLE]
In other words, T(i) acts as zero on each monomial that does not involve any
of c0(i),c1(i),c2(i),….
On sums of monomials, T(i) acts linearly in the usual way.
For example, (T(1))−1(c2(1)c1(2)+c0(1)c3(2)+c1(2)c2(3))=c1(1)c1(2). This does not define the action of T(i) on a monomial divisible by a product cd(j)ced(j), but such monomials will never appear in the cases we consider.
•
To declutter our notation, we sometimes write 1/T(i) in place of (T(i))−1.
Later we will apply the raising operators T to expressions involving ci which already have some assigned meaning: in such expressions, we treat the ci as indeterminates, apply the raising operators, and then replace the symbols ci with their assigned values.
Continue to let X denote a smooth complex variety.
Fix n∈P and
let π:V→X be a vector bundle of even rank 2n over X. For x∈X, write Vx=π−1(x) for the fiber of V over x. Assume V is equipped with a nondegenerate skew-symmetric bilinear form, meaning that we have fixed a section of the bundle Λ2V∗ which is nondegenerate on each fiber of V.
A subbundle F⊆V is isotropic with respect to this form if F⊆F⊥,
where F⊥ is the vector bundle whose fiber over x∈X is the orthogonal complement of Vx
under the associated form.
Assume Fn⊆⋯⊆F1⊆V
is an isotropic flag of subbundles, where rank(Fi)=n−i+1,
and let G⊆V
be a maximal isotropic subbundle G⊆V, necessarily of rank n.
Definition 3.18**.**
For a strict partition λ with λ1≤n, with V, G, F∙ as above,
define the
associated Lagrangian Grassmannian degeneracy locus
to be
[TABLE]
Among the components of F∙,
only the bundles Fλi play a role in the definition of
ΩλLG(V,G,F∙). Moreover, as we will discuss in
Remark 3.21,
many of the rank conditions dim(Gx∩Fxλi)=i in (3.8) turn out to be superfluous.
Anderson [2] and Hudson, Ikeda, Matsumura, and Naruse [24] give explicit formulas for the
classes [ΩλLG(V,G,F∙)]∈CK(X)
in terms of Chern classes.
Notation**.**
In the next theorem, we define certain power series c(i)∈CK(X)[[t]]
in the variable t. Let cd(i)∈CK(X)
be such that c(i)=∑d≥0cd(i)td,
and write T(i)
for the raising operator acting on cd(i).
For i<j, we also define
[TABLE]
This operator should be expanded in T(i) as
[TABLE]
Finally, denote the Pfaffian of a skew-symmetric matrix A=(Aij)i,j∈[r] by
[TABLE]
One has det(A)=pf(A)2.
If n is odd then pf(A)=0 since InFPF is empty.
Suppose λ is a strict partition and V, G, and F∙ are given such that ΩλLG(V,G,F∙) is a Lagrangian Grassmannian degeneracy locus in a smooth complex variety X
with codim(ΩλLG(V,G,F∙))=∣λ∣.
Let r be the smallest even integer with ℓ(λ)≤r.
Let S be a subset of [r] containing
[TABLE]
For i∈[ℓ(λ)], define
c(i)=c(V−G−Fλs,t)
where s∈S is minimal with i≤s,
and let c(r)=1 and λr=0 if r=ℓ(λ)+1. Then
[ΩλLG(V,G,F∙)]∈CK(X)
is the Pfaffian of the r×r skew-symmetric matrix whose (i,j) entry for i<j is
[TABLE]
The exponents r−i−λi and r−j−λj in (3.10)
may be negative.
Since our statement is slightly different from the one in [1],
we sketch a proof below.
Remark 3.20**.**
In the preceding theorem and the proof which follows,
we are citing the arXiv version [1]
of Anderson’s paper rather than the published version [2].
At the time of writing, there is an error in the statement of [2, Theorem 2] which has been corrected
in [1, Theorem 2].
Proof.
When ℓ(λ) is even, this is the special case of [1, Theorem 2]
with s=∣S∣ and
S={k1<k2<⋯<ks}, with
pi=1 and qi=λki for i∈[s],
and with
Epi=G and Fqi=Fqi for i∈[s].
When ℓ(λ) is odd, our matrix is different from the matrix in [1, Theorem 2], but we
claim that it has the same Pfaffian. To see this, for any l∈P define
P(l):=∏1≤i<j≤lR(i,j)∏i=1l(1−βT(i))l−i−λicλi(i) where we set c(i)=1 and λi=0 if i>ℓ(λ). If l≥ℓ(λ), then
[TABLE]
and therefore
[TABLE]
It is shown in the proof of [1, Theorem 2] that P(ℓ(λ))=[ΩλLG(V,F,G∙)], and that if l is even then P(l) is the Pfaffian of the l×l skew-symmetric matrix with entries (3.10). In particular, if ℓ(λ) is odd then P(ℓ(λ)+1) is the Pfaffian in the statement of the theorem, and P(ℓ(λ)+1)=P(ℓ(λ))=[ΩλLG(V,F,G∙)].
∎
Remark 3.21**.**
The statement of Theorem 3.19
would be simpler if we fixed S=[r]. It is useful to allow some
flexibility in our choice of S, however, since not all of the rank conditions in (3.8) are necessary: restricting i to be an element of S⊆[r] defines the same locus ΩλLG(V,G,F∙) whenever C(λ)⊆S.
Theorem 3.19
gives a formula for
[ΩλLG(V,G,F∙)] that does not involve
the bundles Fλi for i∈/S that are irrelevant to the definition of ΩλLG(V,G,F∙).
3.5 Orthogonal Grothendieck polynomials
Here, we use
Theorem 3.19
to derive a formula for
the polynomials
GzO indexed by involutions z∈In that are vexillary
in the sense of being 2143-avoiding.
These permutations have a useful alternate characterization;
recall the definitions of Ess(D) and DO(z) from
Section 2.3.
An involution z∈In is vexillary if and only if the essential set Ess(DO(z))) is a chain
under
the partial order ⪯ on Z×Z with (a,b)⪯(i,j)
if and only if i≤a and b≤j.
Write Cn∗ for the dual space of C-linear maps Cn→C.
We represent elements of the direct sum Cn⊕Cn∗ as pairs (v,ω) where v∈Cn and ω∈Cn∗.
Define ⟨⋅,⋅⟩− to be the skew-symmetric bilinear form
on Cn⊕Cn∗ with
[TABLE]
Let LG2n be the Lagrangian Grassmannian with respect to this form, so that
[TABLE]
The graph of a bilinear form α:Cn×Cn→C is
[TABLE]
Such a form α is symmetric if and only if Γ(α)∈LG2n.
Recall from Section 2.3 that αnO is a fixed
symmetric nondegenerate bilinear form on Cn, and that we define
On to be the subgroup of GLn preserving αnO.
As explained in [46, §2.2],
geometric obstructions prevent us from being able to completely characterize
the family {GzO}z∈In using
divided difference operators as we did for {GzSp}z∈InFPF in Theorem 3.10.
We mention in passing one special situation where the operators ∂i(β)
do act on GzO as one would expect.
Proposition 3.23**.**
Let z∈In and i∈[n−1] be such that z(i)>z(i+1).
Assume z=sizsi are both vexillary. Then ∂i(β)GzO=GsizsiO.
Proof.
The operators ∂1(β),∂2(β),…,∂n−1(β) preserve IΛn[β] so descend to operators on CK(Fln)=Z[β][x1,…,xn]/IΛn[β].
It is enough to prove ∂i(β)[XzO]=[XsizsiO]∈CK(Fln),
since then Theorems 2.19 and 3.2
imply that ∂i(β)GzO−GsizsiO∈IΛN[β] for all N≥n,
which is only possible if ∂i(β)GzO=GsizsiO
by Lemma 3.3.
As explained in [46, §2.2],
to prove that
∂i(β)[XzO]=[XsizsiO]∈CK(Fln)
it suffices to show that XzO and XsizsiO have rational singularities.
Following our earlier convention,
given an orbit E=Bg∈Fln where g∈GLn, let Ei be the subspace of Cn spanned by the first i rows of g.
For a subspace V⊆Cn, write V⊥ for the subspace of linear maps in Cn∗ that vanish on V.
Define XzO to be the closure in LG2n×Fln of the set of pairs (U,E)∈LG2n×Fln satisfying
[TABLE]
Since z is vexillary, the elements of Ess(DO(z)) form a chain (i1,j1),…,(is,js) in the order ⪯ from Lemma 3.22.
If E∈Fln then
[TABLE]
is an isotropic flag in Cn⊕Cn∗.
This makes it clear than
the fiber over E∈Fln of the obvious projection XzO→Fln is isomorphic to a Schubert variety in LG2n. Schubert varieties have rational singularities [29, §8.2.2], so the same is true of XzO by [12, Théorème 2].
Let ι:Fln↪LG2n×Fln be the inclusion E↦(Γ(αnO),E). We claim that XzO is the scheme-theoretic fiber ι−1(XzO). It follows from Lemma 3.24 that ι−1(XzO) and XzO agree as sets, so it suffices to show that ι−1(XzO) is reduced. Let π:XzO→LG2n be projection onto the first factor. Then ι is an isomorphism ι−1(XzO)→π−1(Γ(αnO)), and the fiber π−1(Γ(αnO)) is reduced because π is a fiber bundle over an open subset of LG2n containing Γ(αnO) [39, Lemma 5.3]. This establishes the claim, so XzO has rational singularities by [12, Théorème 3] and the fact that XzO has rational singularities.
The same argument applied to sizsi shows that XsizsiO also has rational singularities, so we have ∂i(β)[XzO]=[XsizsiO]∈CK(Fln)
by the discussion in [46, §2.2].
∎
The orthogonal code of z∈In is the sequence cO(z)=(c1,c2,…,cn)
where ci is the number of positions
in the ith row of DO(z).
The orthogonal shapeλO(z) of z∈In is the transpose of the partition
sorting cO(z).
These objects are denoted c^(z) and μ(z) in [20, §4.3].
If z=n⋯321∈In,
for example,
then we have
λO(z)=(n−1,n−3,n−5,…).
where ⪯ is the order in Lemma 3.22.
Let λ, V, G, and F∙ be given as follows:
(i)
Define λ=λO(z).
(ii)
Define V to be the trivial bundle Cn⊕Cn∗ over Fln equipped with the skew-symmetric form ⟨⋅,⋅⟩−.
(iii)
Define G to be the trivial bundle Γ(αnO) over Fln.
(iv)
Let F∙ denote the flag Ej1⊕Ei1⊥⊆⋯⊆Ejs⊕Eis⊥, where Ei for i∈[n] is the tautological bundle of Fln
whose fiber over an orbit Bg∈Fln for g∈GLn is the subspace of Cn spanned by the first i
rows of g.
Then, in the notation of Definition 3.18 (with the ambient variety given by Fln), we have XzO=ΩλLG(V,G,F∙).
Proof.
It suffices to show that the rank conditions defining XzO
(given in terms of z) are equivalent to the rank conditions defining ΩλLG(V,G,F∙) (given in terms of λ),
and this follows from [39, Lemmas 5.5 and 5.6].
∎
Let xˉ:=0⊖x=1+βx−x
where ⊖ is as in (3.3).
For each z∈In, let
[TABLE]
Lemma 3.25**.**
Assume z∈In is vexillary. The following properties hold:
(a)
∣S(z)∣=∣Ess(DO(z))∣.
2. (b)
S(z) contains the set C(λO(z)) defined in Theorem 3.19.
Proof.
For part (a), we observe that the Rothe diagram D(z) is formed by removing from [n]×[n] all positions
(i+j,z(i)) and (i,z(i)+j) for i∈[n] and j≥0,
and DO(z) is the subset of positions (p,q)∈D(z) with p≥q.
Suppose (p1,q1),(p2,q2)∈Ess(DO(z)) are distinct.
By Lemma 3.22, we may assume that p1≥p2 and q1≤q2.
It suffices to show that rank(z[p2][q2])−rank(z[p1][q1])<q2−q1.
If q1=q2 then clearly rank(z[p2][q2])−rank(z[p1][q1])≤0
and we cannot have equality since this would imply that
(i,q1)=(i,q2)∈DO(z) for all p2≤i≤p1, contradicting (p2,q2)∈Ess(DO(z)).
If q1<q2 then rank(z[p2][q2])−rank(z[p1][q1]) is bounded above by the number of pairs (i,z(i)) with 1≤i≤p2 and q1<z(i)≤q2,
which is at most q2−q1−1 since no such pair has z(i)=q2 as (p2,q2)∈DO(z).
For part (b), write DO(z)={(i1,j1)≺⋯≺(is,js)} where ≺ is the order defined in Lemma 3.22. Also let S(z)={k1<⋯<ks}. Then ks=ℓ(λO(z)) and for any k≤ℓ(λO(z)), we have λO(z)k=ip−jp+1+kp−k where p is such that kp−1<k≤kp [39, Lemma 4.23]. This implies that if k∈/S(z), then λO(z)k=λO(z)k+1+1.
∎
Theorem 3.26**.**
Suppose z∈In is a vexillary involution with shape λ=λO(z).
Let r be the smallest even integer with ℓ(λ)≤r.
For each i∈[ℓ(λ)], let
[TABLE]
where
(p,q)∈Ess(DO(z)) is such that q−rank(z[p][q])=min{s∈S(z):i≤s}. If r=ℓ(λ)+1 then also let c(r)=1.
The polynomial GzO is then the Pfaffian of the r×r skew-symmetric matrix whose (i,j) entry for i<j is
[TABLE]
where T(i)
is the raising operator acting on cd(i)
and R(i,j) is defined by (3.9).
Proof.
Since codim(XzO)=∣λO(z)∣ (see [42, Theorem 4.6]),
Theorem 3.19 and Lemma 3.24 imply that [XzO]∈CK(Fln) is the Pfaffian of the r×r skew-symmetric matrix M with entries (3.10) where λ=λO(z),
S=S(z), and
c(i):=c(V−G−(Eq⊕Ep⊥),t),
where p and q are such that
(p,q)∈Ess(DO(z)) and q−rank(z[p][q])=min{s∈S(z):i≤s}. Using the triviality of V and G, the canonical isomorphism Ei⊥≅(Cn/Ei)∗, and the basic properties of Chern classes presented in Section 3.4, we deduce that
[TABLE]
Thus c(i) is as in (3.13), so
M is the skew-symmetric matrix with entries (3.14),
and we have pf(M)=[XzO]∈CK(Fln).
Let IΛn′ denote the ideal in Z[[x1,…,xn]]
generated by the symmetric formal power series,
so that IΛn=IΛn′∩Z[x1,…,xn].
The entries of M, and therefore also pf(M),
belong to the ring of formal power series Z[β][[x1,…,xn]],
and the assertion pf(M)=[XzO]∈CK(Fln)
means that pf(M)∈GzO+IΛn′[β].
We claim that in fact pf(M)=GzO as polynomials.
Theorem 3.2 and Lemma 3.3 imply that GzO is the unique polynomial with GzO+IΛN[β]=[XzO]∈CK(FlN) for all N≥n. In fact,
it follows that GzO is unique among
formal power series in Z[β][[x1,x2,…]]
that are polynomials in each fixed degree such that
GzO+IΛN′[β] coincides with the image of [XzO]
under the inclusion Z[β][x1,…,xN]/IΛN[β]↪Z[β][[x1,…,xN]]/IΛN′[β] for all N≥n.
But pf(M) also has this property, since
M does not change if we replace z by z×1.
We must therefore have pf(M)=GzO.
∎
Example 3.27**.**
Let z=21∈I2
so λ=(1), r=2, and Ess(DO(z))={(1,1)}. Then
c(1)=1+xˉ1t1+x1t
and
c(2)=1
and G21O=pf[0−ff0]=f:=R(1,2)c1(1)c0(2).
Since 1/T(2) annihilates c1(1)c0(2) and since c0(2)=1, we have
[TABLE]
This gives G21O=2x1+βx12 which agrees with Example 2.21.
Example 3.27 required a little algebra to simplify the infinite sums resulting from Theorem 3.26 to polynomials. We now describe a change of variable which handles these simplifications in general.
We have been working with certain expressions cm(i) that we often view as formal indeterminates.
Let D1,D2,D3… be another sequence of commuting indeterminates, and
if f is a linear combination of monomials cm1(1)⋯cmℓ(ℓ), then
define Φ(f) to be the formal sum obtained by replacing each cmi(i) by Dimi/mi!.
Then Φ((1/T(i))f)=∂Di∂Φ(f) and
[TABLE]
For example, we have
[TABLE]
For integers r∈P and a∈Z, define
[TABLE]
where (∂D∂)−1f(D):=∫0Df(u)du and (∂D∂)−m:=((∂D∂)−1)m for m>0. We also set F0,a(D)=Da/a!.
Proposition 3.28**.**
For any integers r,s∈P and a,b∈Z, the expression
[TABLE]
is equal to
[TABLE]
Proof.
Using the fact that (1−βx)−r=∑k=0∞(r−1r+k−1)βkxk
it is routine to verify Φ((1−βT(i))−rca)=Fr,a(D). Set
M:=(1−βT(1))−r(1−βT(2))−sca(1)cb(2) so that Φ(M)=Fr,a(D1)Fs,b(D2), and define
[TABLE]
Now let G(D1,D2) be the expression in (3.16). We have
[TABLE]
The rational function in T(1) and T(2) appearing inside Φ in (3.16) only involves nonnegative powers of T(1) when expanded as a Laurent series in T(1), so we have G(0,D2)=0. Thus, if we define G~(u):=G(u,u+D2−D1), then G~(0)=0. By the multivariate chain rule and
our expression for (∂D1∂+∂D2∂−β)G(D1,D2) derived above,
we deduce that
[TABLE]
Therefore G~(u) is the unique solution to the initial value problem ∂u∂G~−βG~=Θ(u,u+D2−D1) and G~(0)=0, which one checks to be
[TABLE]
As G(D1,D2)=G~(D1), the result follows.
∎
The next proposition gives an algorithm for computing the inverse map Φ−1.
Proposition 3.29**.**
Suppose G is a formal infinite linear combination of monomials in the Di with coefficients in Q[β]. The
following properties then hold:
(a)
Interpreting Di as \frac{\partial}{\partial t_{i}}\big{|}_{t_{i}=0}, we have Φ−1(G)=G(c(1)(t1)⋯c(l)(tl)).
2. (b)
Interpreting Di as \frac{\partial}{\partial t}\big{|}_{t=0}, we have
\Phi^{-1}(D_{i}^{m}e^{\beta D_{i}})=\frac{\partial^{m}}{\partial t^{m}}c^{(i)}\big{|}_{t=\beta}.
Proof.
For part (a), observe that \Phi^{-1}(D_{i}^{m}/m!)=c_{m}^{(i)}=\frac{1}{m!}\frac{d^{m}}{dt^{m}}c^{(i)}\big{|}_{t=0}. Part (b)
holds since we have
D_{i}^{m}e^{\beta D_{i}}c^{(i)}=\sum_{d\geq 0}\tfrac{\beta^{d}}{d!}\tfrac{\partial^{m+d}}{\partial t^{m+d}}c^{(i)}\big{|}_{t=0}=\tfrac{\partial^{m}}{\partial t^{m}}c^{(i)}\big{|}_{t=\beta}.
∎
Example 3.30**.**
Let us compute GzO for z=3412=(1,3)(2,4). We have
[TABLE]
so Ess(DO(z))={(2,2)} and λO(z)=(2,1). Theorem 3.26
implies that
[TABLE]
where
c(1)=c(2)=1+xˉ1t1+x1t1+xˉ2t1+x2t.
Following Proposition 3.28, we have
and Ess(DO(z))={(6,3),(3,3)} and λO(z)=(4,2,1). In the notation of Theorem 3.26,
one has r=4, S={1,3}, c(4)=1,
[TABLE]
Theorem 3.26 tells us that GzO=pf(M) where M is the 4×4 skew-symmetric matrix with entries
[TABLE]
Calculating as in Example 3.30, we
find that
G4571263O∈N[β][x1,x2,…,x6] is a polynomial with 865 terms
which begins as
[TABLE]
This polynomial has only 35 distinct nonzero coefficients, given by
[TABLE]
The entries of M are not all polynomials, although pf(M) is a polynomial.
4 Stable Grothendieck polynomials
The limit of a sequence of polynomials or formal power series is defined to converge
if the sequence of coefficients of any fixed monomial is eventually constant.
Let n∈P and w∈Sn.
Given m∈N, define 1m×w∈Sm+n
to be the permutation that maps i↦i for i≤m and i+m↦w(i)+m
for i∈P.
The stable Grothendieck polynomial of w is then
[TABLE]
Remarkably, this limit always converges and the resulting power series
is a symmetric function in the xi variables with many notable properties [6, §2].
In this section, we study the
natural analogues of (4.1) for
orthogonal and symplectic Grothendieck polynomials.
4.1 K-theoretic symmetric functions
To begin, we review some properties of Gw and related symmetric functions.
If λ=(λ1≥λ2≥⋯≥λk>0) is an integer partition, then a set-valued tableau of shape λ
is a map T:(i,j)↦Tij from the Young diagram
[TABLE]
to the set of finite, nonempty subsets of P.
For such a map T, define
[TABLE]
A set-valued tableau T is semistandard if one has max(Tij)≤min(Ti,j+1)
and max(Tij)<min(Ti+1,j) for all relevant (i,j)∈Dλ.
Let SetSSYT(λ) denote the set of semistandard set-valued tableaux of shape λ.
Definition 4.1**.**
The stable Grothendieck polynomial of a partition λ is
[TABLE]
This definition sometimes appears in the literature with the parameter β
set to ±1.
This specialization is immaterial to most results since
if we write Gλ(β)=Gλ then
(−β)∣λ∣Gλ(β)=Gλ(−1)(−βx1,−βx2,…).
Setting β=0 transforms Gλ to the usual Schur function sλ.
The symmetric functions Gλ are related to
Gw for w∈Sn by the following theorems.
Given a partition λ=(λ1≥λ2≥⋯≥λk>0)
with k+λ1≤n,
define wλ∈Sn to be the unique permutation
with wλ(i)=i+λk+1−i for i∈[k] and wλ(i)<wλ(i+1)
for all k<i≤n.
Write P for the set of all partitions.
Buch [6] also derives a Littlewood-Richardson rule for
the stable Grothendieck polynomials Gλ,
which shows that the product GλGμ is always a finite
N[β]-linear combination of the functions Gν.
There are shifted analogues of Gλ that will be
related in a similar way to our orthogonal and symplectic analogues of (4.1).
Define the marked alphabet to be totally ordered set
M:={1′<1<2′<2<…},
and write
∣i′∣:=∣i∣=i for i∈P.
If λ=(λ1>λ2>⋯>λk>0) is a strict partition, then a shifted set-valued tableau of shape λ
is a map T:(i,j)↦Tij from the shifted diagram
[TABLE]
to the set of finite, nonempty subsets of M.
Given such a map, define
[TABLE]
A shifted set-valued tableau T is semistandard if
for all relevant (i,j)∈\SSλ:
(a)
max(Tij)≤min(Ti,j+1) and Tij∩Ti,j+1⊆{1,2,3,…}.
(b)
max(Tij)≤min(Ti+1,j) and Tij∩Ti+1,j⊆{1′,2′,3′,…}.
In such tableaux, an unprimed number can appear at most once in a column, while a primed number
can appear at most once in a row.
Let SetSSMT(λ) denote the set of semistandard shifted set-valued tableaux of shape λ.
Definition 4.4**.**
The K-theoretic Schur P-function and K-theoretic Schur Q-function
of a strict partition λ are the formal power series
[TABLE]
The summation defining GPλ is over shifted set-valued tableaux with no primed numbers in any position on the main diagonal.
These definitions are due to Ikeda and Naruse [26], who
also show that
GPλ and GQλ are symmetric in the xi variables
[26, Theorem 9.1].
Setting β=0 transforms GPλ and GQλ
to the Schur P- and Q-functionsPλ and Qλ.
Example 4.5**.**
We have GP(1)=G(1)=s(1)+βs(1,1)+β2s(1,1,1)+… while
Clifford, Thomas, and Yong prove a Littlewood-Richardson rule for the
GPλ functions in [10],
which shows that each product GPλGPμ is a finite N[β]-linear combination
of GPν terms with positive coefficients; see the discussion in [16, §1].
A general Littlewood-Richardson rule for the K-theoretic Schur Q-functions GQλ is not yet known.
Each product GQλGQμ is a linear combination of GQν terms
[26, Proposition 3.5],
but it is an open problem to
determine if these combinations are always finite [26, Conjecture 3.2].
4.2 Orthogonal and symplectic variants
Assume n is even and let z∈InFPF
be a fixed-point-free involution in Sn.
Given m∈N, let
(21)m×z=21×21×⋯×21×z∈In+2mFPF
denote the involution
that maps i↦i−(−1)i for i≤2m and i+2m↦z(i)+2m for i∈P.
We define the symplectic stable Grothendieck polynomials
of z to be the limit
[TABLE]
These limits are always defined and have the following formula:
Corollary 4.6**.**
If z∈InFPF then GPzSp=∑w∈BFPF(z)βℓ(w)−ℓFPF(z)Gw.
Proof.
Proposition 3.15 implies that
BFPF((21)m×z)={12m×w:w∈BFPF(z)}
for all z∈InFPF
and m∈P,
so this follows from Theorem 3.12.
∎
Let Pstrict denote the set of all strict partitions.
The symmetric functions GPzSp were studied in [35],
which proves the following analogue of Theorem 4.3:
There is also a symplectic analogue of Theorem 4.2,
which shows that every K-theoretic Schur P-function occurs
as GPzSp for some n∈2P and z∈InFPF; see [36].
We mention one corollary of [35, Theorem 1.9 and Corollary 3.27]:
For the rest of this section let n∈P be arbitrary and suppose z∈In.
We wish to define the orthogonal stable Grothendieck polynomial of z by
[TABLE]
Unlike (4.2),
it is not clear
that this limit exists for an arbitrary involution,
though we expect that this is always the case.
By Theorem 3.26,
we at least know that GQzO is a well-defined power series when z∈I∞
is vexillary,
since then 1m×z is also vexillary with
[TABLE]
for all m∈N, so the corresponding sequence of Pfaffian
formulas for G1m×zO obviously converges.
Since the matrix entries (3.14) are symmetric when p,q→∞,
the power series GQzO is also symmetric when z is vexillary.
Our last main result will show
that in this case GQzO is actually a single K-theoretic Schur Q-function.
For this, we require the following theorem of
Nakagawa and Naruse [38, Theorem 5.2.4].
Write pf[aij]1≤i<j≤m for the Pfaffian of the m×m
skew symmetric matrix A whose entries satisfy
Aij=−Aji=aij for i<j.
Define
Let λ=(λ1>λ2>⋯>λr≥0) be a strict partition with r∈2P parts,
the last of which may be zero. Then
[TABLE]
In the next two results,
let c(i)(u)=∏j=1∞1+xˉju1+xju for i∈P where xˉ:=1+βx−x,
and define R(i,j) for i,j∈P as in (3.9).
Lemma 4.10**.**
If a,b∈N then
[TABLE]
Proof.
Abbreviate by setting T:=T(1) and c(u)=∑j≥0cjuj:=c(i)(u), and note that we
then have
Π(u,v)=1+βv1⋅c(u+β). We compute
[TABLE]
From this, it follows that if i∈Z then
[TABLE]
Since cm+i=Ticm if m≥max{0,−i},
we deduce that
[TABLE]
for all i∈Z and m≤0.
One can check that substituting u↦1−βT(1)T(1) and v↦1−βT(2)T(2) transforms
[TABLE]
Fix a,b∈N.
Since GQ(a,b) is the coefficient of u−av−b in
[TABLE]
it follows from (4.5)
that GQ(a,b) is also the coefficient of u−av−b in
[TABLE]
The result is now clear after using (4.4)
to rewrite this last expression as
∑m,n≥0R(1,2)(1−βT(1))−m+1(1−βT(2))−ncm(1)cn(2)u−mv−n.
∎
We may now state our final theorem.
Theorem 4.11**.**
If z∈In is vexillary then
GQzO=GQλO(z).
Proof.
Fix a vexillary involution z∈In.
Let λ=λO(z) and
define r to be the smallest even integer with r≥ℓ(λ).
As noted at the beginning of this section,
Theorem 3.26 implies
that GQzO is
the Pfaffian of the r×r skew-symmetric matrix whose (i,j) entry for i<j is
[TABLE]
Thus, it suffices to show that GQλ is given by the same Pfaffian.
It follows from Theorem 4.9
and Lemma 4.10 that
GQλ is the Pfaffian of the r×r skew-symmetric matrix whose (i,j) entry for i<j is
[TABLE]
But we have
[TABLE]
and similarly
[TABLE]
Thus (4.6) is equal to
R(i,j)(1−βT(i))r−i−λi(1−βT(j))r−j−λjcλi(i)cλj(j)
which suffices to prove the theorem.
∎
Corollary 4.12**.**
If n∈P then GQn⋯321O=GQ(n−1,n−3,n−5,…).
Proof.
It suffices to observe that λO(n⋯321)=(n−1,n−3,n−5,…).
∎
Following [20], we say that an involution z∈In is I-Grassmannian
if there are integers r∈N and 1≤ϕ1<ϕ2<⋯<ϕr≤n
such that
[TABLE]
The case n=r=0 corresponds to z=1.
Computing λO(z) gives the following:
Corollary 4.13**.**
If z∈In is I-Grassmannian of the form (4.7),
then
[TABLE]
Thus, every K-theoretic Schur Q-function occurs
as GQzO for some z,
since for any strict partition λ there is an I-Grassmannian involution
of shape λ.
5 Open problems
We conclude with a list of related open problems.
Each GzSp is a finite
linear combination of the polynomials Gw; the summands are described by Proposition 3.15.
It remains find analogous results for GzO:
Problem 5.1**.**
Describe the set of summands expanding GzO as a Z[β]-linear combination of the polynomials Gw.
Are the coefficients in this expansion all nonnegative?
Lenart [32] proves a “transition formula”
which expands (1+βxj)Gw
as a finite, N[β]-linear combination of the polynomials Gv.
The sequel to this paper [36] describes an analogous formula
involving the symplectic Grothendieck polynomials GzSp.
Problem 5.2**.**
Is there a transition formula in the sense of [32, 36] for GzO?
It remains to show that GQzO is well-defined with z∈In is not vexillary.
Problem 5.3**.**
Show that GQzO:=limm→∞G1m×zO
converges for all z∈In.
Recall that P and Pstrict denote the sets of arbitrary and strict partitions.
Problem 5.4**.**
Does it always hold that GQzO∈⨁λ∈PstrictN[β]GQλ?
It is known that if λ,μ∈Pstrict then
GQλGQμ∈∑ν∈PstrictZ[β]GQν,
where the sum could involve
infinitely many terms GQν.
The following problem, asserting that the sum is always finite, is
[26, Conjecture 3.2].
Problem 5.5**.**
Show that if λ,μ∈Pstrict then
GQλGQμ∈⨁ν∈PstrictN[β]GQν.
If λ∈Pstrict then GQλ∈∑μ∈PZ[β]Gμ
since this is true with GQλ replaced by any power series in Z[β][[x1,x2,…]]
that is symmetric in the xi variables.
This expansion could be an infinite sum, but we expect that it is also finite:
Problem 5.6**.**
Show that if λ is a strict partition then GQλ∈⨁μ∈PN[β]Gμ.
Bibliography46
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1] D. Anderson, K 𝐾 K -theoretic Chern class formulas for vexillary degeneracy loci, preprint (2017), ar Xiv:1701.00126 v 3 .
2[2] D. Anderson, K 𝐾 K -theoretic Chern class formulas for vexillary degeneracy loci, Adv. Math. 350 (2019), 440–485.
3[3] E. Bagno and Y. Cherniavsky, Congruence B 𝐵 B -orbits and the Bruhat poset of involutions of the symmetric group, Discrete Math. 312 (2012), 1289–1299.
4[4] S. C. Billey and G. S. Warrington, Kazhdan-Lusztig polynomials for 321-hexagon-avoiding permutations, J. Algebr. Comb. 13 (2001), 111–136.
5[5] M. Brion, On orbit closures of spherical subgroups in flag varieties, Comment. Math. Helv. 76 (2001), no. 2, 263–299.
6[6] A. S. Buch, A Littlewood-Richardson rule for the K 𝐾 K -theory of Grassmannians, Acta Math. 189 (2002), no. 1, 37–78.
7[7] A. S. Buch, A. Kresch, M. Shimozono, H. Tamvakis, and A. Yong, Stable Grothendieck polynomials and K 𝐾 K -theoretic factor sequences, Math. Ann. 340 (2) (2008), 359–382.
8[8] S. Cai, Algebraic connective K 𝐾 K -theory and the niveau filtration, J. Pure Appl. Alg. 212 (7) (2008), 1695–1715.