This paper proves that the totally nonnegative parts of partial flag varieties are regular CW complexes, confirming conjectures about their topological structure and the homeomorphism of positroid cell closures to balls.
Contribution
It establishes the regular CW complex structure of totally nonnegative flag varieties, confirming conjectures by Williams and Postnikov about their topology.
Findings
01
Totally nonnegative flag varieties are regular CW complexes.
02
Closure of each positroid cell is homeomorphic to a ball.
03
Confirms conjectures of Williams and Postnikov.
Abstract
We show that the totally nonnegative part of a partial flag variety G/P (in the sense of Lusztig) is a regular CW complex, confirming a conjecture of Williams. In particular, the closure of each positroid cell inside the totally nonnegative Grassmannian is homeomorphic to a ball, confirming a conjecture of Postnikov.
Equations417
Starg≥0:=h⪰g⨆Πh>0.
Starg≥0:=h⪰g⨆Πh>0.
νˉg:Starg≥0∼Πg>0×Cone(Lkg≥0),
νˉg:Starg≥0∼Πg>0×Cone(Lkg≥0),
νˉg:Og∼(\accentset∘Yg∩Og)×Zg
νˉg:Og∼(\accentset∘Yg∩Og)×Zg
Cg~∼\accentset∘Xg~×\accentset∘Xg~,which restricts to(Cg~∩\accentset∘Rh~f~)∼\accentset∘Rg~f~×\accentset∘Rh~g~for all h~≤g~≤f~.
Cg~∼\accentset∘Xg~×\accentset∘Xg~,which restricts to(Cg~∩\accentset∘Rh~f~)∼\accentset∘Rg~f~×\accentset∘Rh~g~for all h~≤g~≤f~.
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.
We show that the totally nonnegative part of a partial flag variety G/P (in the sense of Lusztig) is a regular CW complex, confirming a conjecture of Williams. In particular, the closure of each positroid cell inside the totally nonnegative Grassmannian is homeomorphic to a ball, confirming a conjecture of Postnikov.
Key words and phrases:
Total positivity, algebraic group, partial flag variety, Richardson variety, totally nonnegative Grassmannian, positroid cell, affine Kac–Moody group.
2020 Mathematics Subject Classification:
Primary: 14M15. Secondary:
05E45, 15B48, 20G20.
P.G. was supported by an Alfred P. Sloan Research Fellowship and by the National Science Foundation under Grants No. DMS-1954121 and No. DMS-2046915. S.N.K. was supported by the Natural Sciences and Engineering Research Council of Canada under a Postdoctoral Fellowship. T.L. was supported by a von Neumann Fellowship from the Institute for Advanced Study and by the National Science Foundation under Grants No. DMS-1464693 and No. DMS-1953852.
Let G be a semisimple algebraic group, split over R, and let P⊂G be a parabolic subgroup. Lusztig [Lus94] introduced the totally nonnegative part of the partial flag variety G/P, denoted (G/P)≥0, which he called a “remarkable polyhedral subspace”. He conjectured and Rietsch proved [Rie99] that (G/P)≥0 has a decomposition into open cells. We prove the following conjecture of Williams [Wil07]:
Theorem 1.1**.**
The cell decomposition of (G/P)≥0 forms a regular CW complex. Thus the closure
of each cell is homeomorphic to a closed ball.
A special case of particular interest is when G/P is the Grassmannian Gr(k,n) of k-dimensional linear subspaces of Rn. In this case, (G/P)≥0 becomes the totally nonnegative GrassmannianGr≥0(k,n), introduced by Postnikov [Pos07] as the subset of Gr(k,n) where all Plücker coordinates are nonnegative. He gave a stratification of Gr≥0(k,n) into positroid cells according to which Plücker coordinates are zero and which are strictly positive, and conjectured that the closure of each positroid cell is homeomorphic to a closed ball. Postnikov’s conjecture follows as a special case of Theorem 1.1:
Corollary 1.2**.**
The decomposition of Gr≥0(k,n) into positroid cells forms a regular CW complex. Thus the closure of each positroid cell is homeomorphic to a closed ball.
When k=1, Gr≥0(1,n) is the standard (n−1)-dimensional simplex Δn−1⊂Pn−1. Simplices, and more generally convex polytopes, are prototypical examples of regular CW complexes. While the spaces (G/P)≥0 and Gr≥0(k,n) are not themselves homeomorphic to polytopes, our results confirm that they have the simplest possible topology.
1.1. History and motivation
A matrix is called totally nonnegative if all its minors are nonnegative. The theory of such matrices originated in the 1930’s [Sch30, GK37]. Later, Lusztig [Lus94] was motivated by a question of Kostant to consider connections between totally nonnegative matrices and his theory of canonical bases for quantum groups [Lus90]. This led him to introduce the totally nonnegative part G≥0 of a split semisimple G. Inspired by a result of Whitney [Whi52], he defined G≥0 to be generated by exponentiated Chevalley generators with positive real parameters, and generalized many classical results for G=SLn to this setting. He introduced the totally nonnegative part (G/P)≥0 of a partial flag variety G/P, and showed [Lus98b, Section 4] that G≥0 and (G/P)≥0 are contractible.
Fomin and Shapiro [FS00] realized that Lusztig’s work may be used to address a longstanding problem in poset topology. Namely, the Bruhat order of the Weyl group W of G had been shown to be shellable by Björner and Wachs [BW82], and by general results of Björner [Bjö84] it followed that there exists a “synthetic” regular CW complex whose face poset coincides with (W,≤). The motivation of [FS00] was to answer a natural question due to Bernstein and Björner of whether such a regular CW complex exists “in nature”. Let U⊂G be the unipotent radical of the standard Borel subgroup, and let U≥0:=U∩G≥0 be its totally nonnegative part. For G=SLn, U≥0 is the semigroup of upper-triangular unipotent matrices with all minors nonnegative. The work of Lusztig [Lus94] implies that U≥0 has a cell decomposition whose face poset is (W,≤). The space U≥0 is not compact, but Fomin and Shapiro [FS00] conjectured that taking the link of the identity element in U≥0, which also has (W,≤) as its face poset, gives the desired regular CW complex. Their conjecture was confirmed by Hersh [Her14b]. Hersh’s theorem also follows as a corollary to our proof of Theorem 1.1; see Remark 3.13.
Meanwhile, Postnikov [Pos07] defined the totally nonnegative Grassmannian Gr≥0(k,n), decomposed it into positroid cells, and showed that each positroid cell is homeomorphic to an open ball. Motivated by work of Fomin and Zelevinsky [FZ99] on double Bruhat cells, he conjectured [Pos07, Conjecture 3.6] that this decomposition forms a regular CW complex. It was later realized (see (9.16)) that the space Gr≥0(k,n) and its cell decomposition coincide with the one studied by Lusztig and Rietsch in the special case that G/P=Gr(k,n). Williams [Wil07, Section 7] extended Postnikov’s conjecture from Gr≥0(k,n) to (G/P)≥0.
There has been much progress towards proving these conjectures. Williams [Wil07] showed that the face poset of (G/P)≥0 (and hence of Gr≥0(k,n)) is graded, thin, and shellable, and therefore by [Bjö84] is the face poset of some regular CW complex. Postnikov, Speyer, and Williams [PSW09] showed that Gr≥0(k,n) is a CW complex, and their result was generalized to (G/P)≥0 by Rietsch and Williams [RW08]. Rietsch and Williams [RW10] also showed that the closure of each cell in (G/P)≥0 is contractible.
In previous work [GKL17, GKL19], we showed that the spaces Gr≥0(k,n) and (G/P)≥0 are homeomorphic to closed balls, which is the special case of Theorem 1.1 for the top-dimensional cell of (G/P)≥0. We remark that our proof of Theorem 1.1 uses different methods than those employed in [GKL17, GKL19], in which we relied on the existence of a vector field on G/P contracting (G/P)≥0 to a point in its interior. Singularities of lower-dimensional positroid cells give obstructions to the existence of a continuous vector field with analogous properties.
The topology of a regular CW complex is completely determined by the combinatorial structure of its associated cell closure poset, as observed by Björner [Bjö84]. Therefore one may regard spaces such as U≥0 and Gr≥0(k,n) as canonical topological realizations of natural posets arising in combinatorics. We expect this phenomenon to hold more broadly for other spaces appearing in total positivity, as we discuss in Section 10.
Totally positive spaces have also attracted a lot of interest due to their appearances in other contexts such as cluster algebras [FZ02] and the physics of scattering amplitudes [AHBC*+*16]. Our original motivation for studying the topology of spaces arising in total positivity was to better understand the amplituhedra of Arkani-Hamed and Trnka [AHT14], and more generally the Grassmann polytopes of the third author [Lam16]. Faces of these geometric objects are linear projections of closures of positroid cells, and we expect that Corollary 1.2 will play an essential role in developing a theory of Grassmann polytopes.
1.2. Stars, links, and the Fomin–Shapiro atlas
Rietsch [Rie99, Rie06] defined a certain poset (QJ,⪯), and established the decomposition (G/P)≥0=⨆g∈QJΠg>0 into open balls Πg>0 indexed by g∈QJ. She showed that for h∈QJ, the closure Πh≥0 of Πh>0 is given by Πh≥0=⨆g⪯hΠh>0. When (G/P)≥0 is the totally nonnegative Grassmannian Gr≥0(k,n), this is the positroid cell decomposition of [Pos07].
Given g∈QJ, define the star of g in (G/P)≥0 by
[TABLE]
In Section 3.1, we define another space Lkg≥0 (the link of g) stratified as Lkg≥0=⨆h≻gLkg,h>0. We later show in Theorem 3.12 that Lkg≥0 is a regular CW complex homeomorphic to a closed ball.
At the core of our approach is a collection of (stratification-preserving) homeomorphisms
[TABLE]
one for each g∈QJ. Here Cone(A):=(A×R≥0)/(A×{0}) denotes the open cone over A. The homeomorphisms {νˉg∣g∈QJ} are part of the data of what we call a Fomin–Shapiro atlas; cf. Definition 2.3. Our construction is inspired by similar maps introduced in [FS00] for the unipotent radical U≥0.
Example 1.4**.**
When G=SLn and P=B is the standard Borel subgroup, G/B is the complete flag variety consisting of flags in Rn, and the Weyl group W is the group Sn of permutations of n elements. The face poset QJ of (G/B)≥0 is the set {(v,w)∈Sn×Sn∣v≤w} of Bruhat intervals in Sn, and the cell Π(v,w)>0⊂(G/B)≥0 indexed by (v,w)∈QJ has dimension ℓ(w)−ℓ(v). For example, when n=3, this gives a cell decomposition of a 3-dimensional ball; see Figure 1 (left). For g:=(s1,s2s1), Πg>0 is an open line segment, and Starg≥0 consists of 4 cells: a line segment Πg>0=Π(s1,s2s1)>0, two open square faces Π(s1,w0)>0 and Π(id,s2s1)>0, and an open 3-dimensional ball Π(id,w0)>0. This union is indeed homeomorphic to Πg>0×Cone(Lkg≥0) shown in Figure 1 (right). Here Lkg≥0 is a closed line segment whose endpoints are Lkg,(s1,w0)>0 and Lkg,(id,s2s1)>0, and whose interior is Lkg,(id,w0)>0.
In Definition 2.1, we introduce the abstract notion of a (shellable) totally nonnegative space, which captures several known combinatorial and geometric properties of (G/P)≥0 used in our proof. This includes the shellability of QJ due to Williams [Wil07], and some topological results [Rie06, KLS14] on Richardson varieties.
In Section 3, we prove (Theorem 2.4) that every shellable totally nonnegative space that admits a Fomin–Shapiro atlas is a regular CW complex. Our argument proceeds by induction on the dimension of Lkg,h>0, and depends on a delicate interplay between objects in smooth and topological categories. We use crucially that the maps (1.2) in a Fomin–Shapiro atlas are restrictions of smooth maps. On the topological level, we rely on the generalized Poincaré conjecture [Sma61, Fre82, Per02] combined with some general results on poset topology.
The bulk of the paper is devoted to the construction of the Fomin–Shapiro atlas. For each g∈QJ we give an isomorphism φˉu between an open dense subset Og⊂G/P and a certain subset of the affine flag varietyG/B of the loop group G associated to G. The map φˉu, which we call an affine Bruhat atlas, sends the projected Richardson stratification [KLS14] of G/P to the affine Richardson stratification of its image inside G/B. The hardest part of the proof consists of showing that the subset Og⊂G/P contains Starg≥0. See Section 2.2 for a more in-depth overview of the construction of φˉu.
Remark 1.5**.**
The map φˉu generalizes the map of Snider [Sni10] from Gr(k,n) to all G/P; see Remark 9.9. A different approach to give such a generalization is due to He, Knutson, and Lu [HKL], which led them to the notion of a Bruhat atlas. See [Ele16] for the definition. We call our map φˉu an affine Bruhat atlas since its target space is always an affine flag variety, while the Bruhat atlases of [HKL] necessarily involve more general Kac–Moody flag varieties. A similar map has been independently constructed by Huang [Hua19].
Remark 1.6**.**
The method of link induction that we use in Section 3.3 has appeared before in e.g. [GLMS08, Her14a]. When applied to the problem at hand, this method immediately runs into the difficulty of showing that the closure of each cell is a topological manifold. Our strategy for overcoming this issue is based on combining technical topological results in Section 3 with the approach of [FS00]. The crucial new algebraic ingredient is that the factorizations of [FS00] happen inside the unipotent group U, while we utilize an embedding into the affine flag variety for that purpose. This embedding is defined on an open dense subset of G/P, but surprisingly, this subset turns out to contain the whole totally nonnegative part of the star of the corresponding cell. In order to show this result, we develop a toolbox of subtraction-free parametrizations in Section 5. This machinery also reveals intriguing properties of (G/P)≥0 such as Proposition 9.22, which may be interesting to explore further in their own right.
1.3. Outline
In Section 2, we introduce totally nonnegative spaces and define Fomin–Shapiro atlases. We state in Theorem 2.4 that every shellable totally nonnegative space that admits a Fomin–Shapiro atlas is a regular CW complex, and prove it in Section 3. We give background on G/P in Section 4, and study subtraction-free Marsh–Rietsch parametrizations in Section 5. We then apply our results on such parametrizations to prove Theorem 6.4, that will later imply that the above open subset Og contains Starg≥0. We introduce affine Bruhat atlases in Section 7 and use them to construct a Fomin–Shapiro atlas for G/P in Section 8. Theorem 2.5 (which implies our main result Theorem 1.1) is proved in Section 8.3. Section 9 is devoted to specializing our construction to type A (when G=SLn), with a special focus on the totally nonnegative Grassmannian Gr≥0(k,n). We illustrate many of our constructions by examples in Section 9, and we encourage the reader to consult this section while studying other parts of the paper. We discuss some conjectures and further directions in Section 10. Finally, we give additional background on Kac–Moody flag varieties in Appendix A.
Acknowledgments
We thank Sergey Fomin, Patricia Hersh, Alex Postnikov, and Lauren Williams for stimulating discussions. We are also grateful to George Lusztig and Konni Rietsch for their comments on the first version of this manuscript. We thank the anonymous referees for their help with improving the presentation of the paper.
2. Overview of the proof
We formulate our results in the abstract language of totally nonnegative spaces, since we expect that they can be applied in other contexts; see Section 10.
2.1. Totally nonnegative spaces
We refer the reader to Section 3.2 for background on posets and regular CW complexes. For a finite poset (Q,⪯), we denote by Q:=Q⊔{0^} the poset obtained from Q by adjoining a minimum 0^. Björner showed [Bjö84, Proposition 4.5(a)] that if Q is graded, thin, and shellable, then Q is isomorphic to the face poset of some regular CW complex. If Q is a graded poset, we let dim:Q→Z≥0 denote the rank function of Q.
Definition 2.1**.**
We say that a triple (Y,Y≥0,Q) is a totally nonnegative space (or TNN space for short) if the following conditions are satisfied.
(TNN1)
The poset (Q,⪯) is graded and contains a unique maximal element 1^.
2. (TNN2)
Y is a smooth manifold, stratified into embedded submanifolds Y=⨆g∈Q\accentset∘Yg, and for each h∈Q, \accentset∘Yh has dimension dim(h) and closure Yh:=⨆g⪯h\accentset∘Yg.
3. (TNN3)
Y≥0 is a compact subset of Y.
4. (TNN4)
For g∈Q, Yg>0:=\accentset∘Yg∩Y≥0 is a connected component of \accentset∘Yg diffeomorphic to R>0dim(g).
5. (TNN5)
The closure of Yh>0 inside Y equals Yh≥0:=⨆g⪯hYg>0.
We say that a TNN space (Y,Y≥0,Q) is shellable if it additionally satisfies the following.
(TNN1’)
The poset (Q,⪯) is thin and shellable.
For the case Y=G/P, the smooth submanifolds \accentset∘Yg are the open projected Richardson varieties of [KLS14].
Definition 2.2**.**
Let N≥0, and denote by ∥⋅∥ the Euclidean norm on RN. We say that a pair (Z,ϑ) is a smooth cone if Z⊂RN is a closed embedded submanifold and ϑ:R>0×RN→RN a smooth map such that
(SC1)
ϑ gives an (R>0,⋅)-action on RN that restricts to an (R>0,⋅)-action on Z.
2. (SC2)
∂t∂∥ϑ(t,x)∥>0 for all t∈R>0 and x∈RN∖{0}.
The map ϑ is a smooth analog of a contractive flow of [GKL17]; see Lemma 3.4.
For g∈Q, define Starg:=⨆h⪰g\accentset∘Yh and Starg≥0:=Starg∩Y≥0=⨆h⪰gYh>0; cf. (1.1).
Definition 2.3**.**
We say that a TNN space (Y,Y≥0,Q) admits a Fomin–Shapiro atlas if for each g∈Q, there exists an open subset Og⊂Starg, a smooth cone (Zg,ϑg), and a diffeomorphism
[TABLE]
satisfying the following conditions.
(FS1)
For all h⪰g, we are given \accentset∘Zg,h⊂Zg such that Zg=⨆h⪰g\accentset∘Zg,h and \accentset∘Zg,g={0}.
2. (FS2)
For all h⪰g and t∈R>0, we have ϑg(t,\accentset∘Zg,h)=\accentset∘Zg,h.
3. (FS3)
For all h⪰g, we have νˉg(\accentset∘Yh∩Og)=(\accentset∘Yg∩Og)×\accentset∘Zg,h.
4. (FS4)
For all y∈\accentset∘Yg∩Og, we have νˉg(y)=(y,0).
5. (FS5)
Starg≥0⊂Og.
We will prove the following result in Section 3.3, using link induction.
Theorem 2.4**.**
Suppose that (Y,Y≥0,Q) is a shellable TNN space that admits a Fomin–Shapiro atlas. Then Y≥0=⨆h∈QYh>0 is a regular CW complex. In particular, for each h∈Q, Yh≥0 is homeomorphic to a closed ball of dimension dim(h).
(G/P,(G/P)≥0,QJ)* is a shellable TNN space that admits a Fomin–Shapiro atlas.*
2.2. Plan of the proof
We give a brief outline of the proof of Theorem 2.5. See Section 4 for background on G/P, and see Sections 7 and A for background on G/B. We deduce that (G/P,(G/P)≥0,QJ) is a shellable TNN space from known results in Corollary 4.20. In order to construct a Fomin–Shapiro atlas, we consider the (infinite-dimensional) affine flag varietyG/B associated to G. It is stratified into (finite-dimensional) affine Richardson varieties G/B=⨆h~≤f~∈W~\accentset∘Rh~f~, where W~ is the affine Weyl group and ≤ denotes its Bruhat order. There exists an order-reversing injective map ψ:QJ→W~, defined in [HL15]; see (7.7). The set of minimal elements of QJ equals {(u,u)∣u∈WJ}, where WJ is the set of minimal length parabolic coset representatives of the Weyl group; see Section 4.6. For each minimal element f:=(u,u)∈QJ, ψ identifies the interval [f,1^] of QJ with (the dual of) a certain interval [τλJ,τuλ]⊂W~. For the case G/P=Gr(k,n), elements of QJ are in bijection with *
-diagram indexing a positroid cell to the corresponding bounded affine permutation of [KLS14]; see Example 9.6.
In Section 7.3, we lift ψ to the geometric level: given a minimal element f:=(u,u)∈QJ, we introduce a map φˉu:Cu(J)→G/B defined on an open dense subset Cu(J)⊂G/P. We show in Theorem 7.3 that for g∈QJ such that g⪰f, φˉu sends Cu(J)∩\accentset∘Πg isomorphically to the affine Richardson cell \accentset∘Rψ(g)ψ(f).
For every g~∈W~, we consider an open dense subset Cg~⊂G/B defined by Cg~:=g~⋅B−⋅B/B, as well as affine Schubert and opposite Schubert cells \accentset∘Xg~=⨆h~≤g~\accentset∘Rh~g~, \accentset∘Xg~=⨆g~≤f~\accentset∘Rg~f~. In Proposition 8.2, we give a natural isomorphism
[TABLE]
A finite-dimensional analog of this map is due to [KWY13], and similar maps have been considered in [KL79, FS00]. The action of ϑ on \accentset∘Xg~ essentially amounts to multiplying by an element of the affine torus, and thus preserves \accentset∘Rh~g~ for all h~≤g~.
Let us now fix g∈QJ, and choose some minimal element f:=(u,u)∈QJ such that f⪯g. Then the map φˉu is defined on an open dense subset Cu(J)⊂G/P, and let us denote by Og⊂Cu(J) the preimage of Cψ(g) under φˉu. The diffeomorphism (2.1) is obtained by conjugating the isomorphism (2.2) by the map φˉu. The smooth cone (Zg,ϑg) is extracted from the corresponding structure on \accentset∘Xψ(g). As we have already mentioned, the hardest step in the proof consists of showing (FS5). To achieve this, we study subtraction-free parametrizations of partial flag varieties in Section 5, and then use them to show that some generalized minors of a particular group element ζu,v(J)(x) from Section 6 do not vanish for all x∈Starg≥0. The definition of ζu,v(J)(x) is quite technical, but we conjecture in Section 9 that in the Grassmannian case, these generalized minors specialize to simple functions on Gr(k,n) that we call u-truncated minors. We complete the proof of Theorem 2.5 in Section 8.3.
3. Topological results
Throughout this section, we assume that (Y,Y≥0,Q) is a TNN space that admits a Fomin–Shapiro atlas. Thus for each g∈Q, we have the objects Og, Zg, ϑg, and νˉg from Definition 2.3. Additionally, we assume some familiarity with basic theory of smooth manifolds; see e.g. [Lee13].
3.1. Links
Throughout, we denote the two components of the map νˉg from (2.1) by νˉg=(νˉg,1,νˉg,2), where νˉg,1:Og→\accentset∘Yg∩Og and νˉg,2:Og→Zg. We set Starg,h≥0:=Yh≥0∩Starg≥0=⨆g⪯g′⪯hYg′>0. Let Ng be the integer from Definition 2.2 such that Zg⊂RNg.
In the latter disjoint union, we have Lkg,g>0=∅ since \accentset∘Zg,g={0} by (FS1).
Lemma 3.2**.**
Let g≺h∈Q.
(i)
For all x∈Og, we have x∈Yh>0 if and only if νˉg(x)∈Yg>0×Zg,h>0.
2. (ii)
Zg,h>0 is an embedded submanifold of Zg of dimension dim(h)−dim(g) that intersects Sg transversely. For all t∈R>0 and x∈Zg,h>0, we have ϑ(t,x)∈Zg,h>0.
3. (iii)
Lkg,h>0 is a contractible smooth manifold of dimension dim(h)−dim(g)−1.
4. (iv)
Lkg,h≥0 is a compact subset of Zg.
Before we prove these properties, let us state some preliminary results on smooth manifolds. Given smooth manifolds A,B and a smooth map f:A→B, a point a∈A is called a regular point of f if the differential of f at a is surjective. Similarly, b∈B is called a regular value of f if f−1(b) consists of regular points. In this case f−1(b) is a closed embedded submanifold of A of dimension dim(A)−dim(B) [Lee13, Corollary 5.14].
Lemma 3.3**.**
Suppose that A,B are smooth manifolds and B′⊂B is such that A×B′ is an embedded submanifold of A×B. Then B′ is an embedded submanifold of B.
Proof.
Choose a∈A. Clearly a is a regular value of the projection A×B′→A, so {a}×B′ is an embedded submanifold of A×B′, and hence of {a}×B.
∎
Let ϑ:R>0×RN→RN be a smooth map satisfying (SC1) and (SC2).
(iv)
We have ϑ(t,0)=0 for all t∈R>0.
2. (iv)
We have limt→0+ϑ(t,x)=0 for all x∈RN.
3. (iv)
For all x∈RN∖{0}, there exists a unique t∈R>0 such that ∥ϑ(t,x)∥=1, which we denote by t1(x). The function t1:RN∖{0}→R>0 is continuous.
Proof.
The function f:R×RN→RN defined by f(t,x)=ϑ(e−t,x) is a contractive flow, as defined in [GKL17, Definition 2.1]. Therefore the statements follow from [GKL17, Lemma 2.2] and the claim in the proof of [GKL17, Lemma 2.3].
∎
3.2: We prove this more generally for g⪯h. The set Starg≥0 is connected since it contains a connected dense subset Y1^>0. Therefore νˉg,1(Starg≥0) is a connected subset of \accentset∘Yg∩Og. By (FS4), it contains Yg>0, and therefore νˉg,1(Starg≥0)=Yg>0 by (TNN4). By definition, νˉg,2(Starg,h≥0)=Zg,h≥0, and thus νˉg(Starg,h≥0)⊂Yg>0×Zg,h≥0. By (FS3), we get νˉg(Yh>0)⊂Yg>0×Zg,h>0. In particular, Zg,h>0=νˉg,2(Yh>0) is a connected subset of \accentset∘Zg,h. Let C be the connected component of \accentset∘Zg,h containing Zg,h>0. By (FS3), νˉg−1(Yg>0×C) is a connected subset of \accentset∘Yh∩Og, which contains Yh>0 as we have just shown. Therefore we must have νˉg−1(Yg>0×C)=Yh>0 by (TNN4), which shows that Zg,h>0=C is a connected component of \accentset∘Zg,h. Thus indeed νˉg(Yh>0)=Yg>0×Zg,h>0.
3.2: By (TNN4) and (TNN2), Yh>0 is an embedded submanifold of Y. Applying νˉg and using 3.2, we get that Yg>0×Zg,h>0 is an embedded submanifold of Yg>0×Zg, of dimension dim(h)−dim(g). By Lemma 3.3, Zg,h>0 is an embedded submanifold of Zg. Moreover, it follows from (FS2) that ϑg(t,Zg,h>0)=Zg,h>0 for all t∈R>0, since Zg,h>0 is a connected component of \accentset∘Zg,h. Thus 1 is a regular value of the restriction ∥⋅∥:Zg,h>0→R>0, so the manifolds Sg and Zg,h>0 intersect transversely inside RNg.
3.2: By 3.2, Lkg,h>0=Zg,h>0∩Sg is an embedded submanifold of Zg of dimension dim(h)−dim(g)−1. To show that it is contractible, we use the fact that a retract of a contractible space is contractible [Hat02, Exercise 0.9]. Since Yh>0 is contractible (by (TNN4)), so is νˉg(Yh>0)=Yg>0×Zg,h>0. Then {x}×Zg,h>0 is a retract of Yg>0×Zg,h>0 for any x∈Yg>0, so Zg,h>0 is contractible. Finally, by 3.2 and (iv), the map x↦ϑg(t1(x),x) gives a retraction Zg,h>0→Lkg,h>0.
3.2: By (FS5), Starg,h≥0=Yh≥0∩Starg≥0=Yh≥0∩Og is a closed subset of Og. Thus νˉg(Starg,h≥0) is a closed subset of Yg>0×Zg. Since νˉg(Starg,h≥0)=Yg>0×Zg,h≥0 (by 3.2 and (3.1)), we get that Zg,h≥0 is a closed subset of Zg. It follows that Lkg,h≥0=Zg,h≥0∩Sg is a closed and bounded subset of Zg, which is closed in RNg by Definition 2.2.
∎
Recall that Cone(A):=(A×R≥0)/(A×{0}) is the open cone over A. We denote by c:=(∗,0)∈Cone(A) its cone point.
Proposition 3.5**.**
Let g≺h∈Q.
(iv)
We have a homeomorphism Zg,h≥0∼Cone(Lkg,h≥0) sending [math] to the cone point c, and sending Zg,g′>0 to Lkg,g′>0×R>0 for all g≺g′⪯h.
2. (iv)
We have a homeomorphism Starg,h≥0∼Yg>0×Cone(Lkg,h≥0) sending Yg>0 to Yg>0×{c}.
Proof.
(iv): Define a map ξ:Zg,h≥0→Cone(Lkg,h≥0) sending [math] to c and x to (ϑg(t1(x),x),t1(x)1) for x∈Zg,h≥0∖{0}, where t1(x) is defined in (iv) and ϑg(t1(x),x)∈Lkg,h≥0 by 3.2. We claim that ξ is a homeomorphism. Note that ξ has an inverse ξ−1, which sends c to [math] and (y,t) to ϑg(t,y) for (y,t)∈Cone(Lkg,h≥0)∖{c}=Lkg,h≥0×R>0. By (iv), ξ is continuous on Zg,h≥0∖{0} and ξ−1 is continuous on Lkg,h≥0×R>0. It remains to show that ξ is continuous at [math] and that ξ−1 is continuous at c.
Suppose that (xn)n≥0 is a sequence in Zg,h≥0∖{0} converging to [math]. We claim that t1(xn)→∞ as n→∞. Otherwise, after passing to a subsequence, we may assume that there exists R∈R>0 such that t1(xn)≤R for all n≥0. Then (SC2) implies that ∥ϑg(R,xn)∥≥∥ϑg(t1(xn),xn)∥=1 for all n≥0. Taking n→∞ gives ∥ϑg(R,0)∥≥1, contradicting (iv). This shows that ξ is continuous at [math].
Suppose now that ((yn,tn))n≥0 is a sequence in Lkg,h≥0×R>0 converging to c, i.e., tn→0. The function D(t):=maxx∈Sg∥ϑg(t,x)∥ is increasing in t, by compactness of Sg and (SC2). We have limt→0+D(t)=0 by (iv) and compactness of Sg (more precisely, by Dini’s theorem). Therefore ξ−1(yn,tn)=ϑg(tn,yn) converges to [math] as n→∞, showing that ξ−1 is continuous at c.
(iv): By 3.2, νˉg restricts to a homeomorphism Starg,h≥0∼Yg>0×Zg,h≥0, which by (FS4) sends Yg>0 to Yg>0×{0}. The result follows from (iv).
∎
Our next aim is to analyze the local structure of the space Lkg,h≥0. For two topological spaces A and B and a∈A, b∈B, a local homeomorphism between (A,a) and (B,b) is a homeomorphism from an open neighborhood of a in A to an open neighborhood of b in B which sends a to b.
Lemma 3.6**.**
Let g≺p⪯h∈Q, xp∈Lkg,p>0, and set d:=dim(p)−dim(g)−1. Then there exists a local homeomorphism between (Lkg,h≥0,xp) and (Zp,h≥0×Rd,(0,0)).
Proof.
Choose some xg∈Yg>0 and consider the open subset Hp⊂Zg defined by Hp:={x∈Zg∣νˉg−1(xg,x)∈Op}. Introduce a map
[TABLE]
Since xp∈Lkg,p>0⊂Zg,p>0 and xg∈Yg>0, we get xˉp:=νˉg−1(xg,xp)∈Yp>0 by 3.2. By (FS5), we have Yp>0⊂Starp≥0⊂Op, and thus xp∈Hp. Since Hp is open in Zg, Hp∩Sg is an open subset of Zg∩Sg, which is nonempty since it contains xp. We have θg,p(xp)=0 by (FS4).
We claim that xp is a regular point of θg,p. By (FS4), the differential of νˉp,2:Op→Zp is surjective at xˉp, and its kernel is the tangent space of \accentset∘Yp at xˉp. By (TNN4) and (FS5), Yp>0 is a connected component of \accentset∘Yp∩Op, and it contains xˉp=νˉg−1(xg,xp) as we have shown above. Therefore xp is a regular point of θg,p if and only if the manifolds Yp>0 and F:=νˉg−1({xg}×(Hp∩Sg)) intersect transversely at xˉp. By 3.2, we have νˉg(Yp>0)=Yg>0×Zg,p>0, and clearly νˉg(F)={xg}×(Hp∩Sg). These two manifolds intersect transversely at (xg,xp) by 3.2. We have shown that xp is a regular point of θg,p.
By the submersion theorem (see e.g. [Kos93, Corollary A(1.3)]), there exist local coordinates centered at xp∈Hp∩Sg and at 0∈Zp in which θg,p is just the canonical projection Rdim(Hp∩Sg)→Rdim(Zp). Recall that Q contains a unique maximal element 1^, and by (2.1) we have dim(Zg)=codim(g):=dim(1^)−dim(g). Thus dim(Hp∩Sg)=codim(g)−1, dim(Zp)=codim(p), and dim(Hp∩Sg)−dim(Zp)=d. We have shown that there exist open neighborhoods U of xp in Hp∩Sg and V of [math] in Zp and a diffeomorphism β:U∼V×Rd sending xp to (0,0) such that the first component of β coincides with the restriction θg,p:U→V.
In order to complete the proof, we need to show that the image β(U∩Lkg,h≥0) equals (V∩Zp,h≥0)×Rd. We may assume that U is connected. Suppose we are given x∈U, and let r∈Q be such that x′:=νˉg−1(xg,x)∈\accentset∘Yr. Since U⊂Hp, x′ belongs to Op⊂Starp by Definition 2.3, and therefore p⪯r. By 3.2, we have x∈U∩Lkg,r>0 if and only if x′∈Yr>0. On the other hand, νˉp,1(νˉg−1({xg}×U)) is a connected subset of \accentset∘Yp∩Op that contains νˉp,1(xˉp)∈Yp>0. Thus νˉp,1(νˉg−1(xg,U))⊂Yp>0 by (TNN4). It follows that x′∈Yr>0 if and only if θg,p(x)=νˉp,2(x′) belongs to Zp,r>0. The result follows by taking the union over all p⪯r⪯h, using (3.1).
∎
3.2. Topological background
3.2.1. Regular CW complexes
We refer to [Hat02, LW69] for background on CW complexes.
Definition 3.7**.**
Let X be a Hausdorff space. We call a finite disjoint union X=⨆α∈QXα
a regular CW complex if it satisfies the following two properties.
(CW1)
For each α∈Q, there exists a homeomorphism from the closure Xα to a closed ball B which sends Xα to the interior of B.
2. (CW2)
For each α∈Q, there exists Q′⊂Q such that Xα=⨆β∈Q′Xβ.
The face poset of X is the poset (Q,⪯), where β⪯α if and only if Xβ⊂Xα.
The condition (CW2) is often omitted from the definition of a regular CW complex, but is necessary in order to apply the arguments of [Bjö84]. We remark that the cell decomposition of Y≥0 satisfies (CW2) by (TNN5).
3.2.2. Posets
We review the definitions of graded, thin, and shellable for finite posets, though we will not need to work with them in our arguments. We refer to [Bjö80, Sta12] for background.
A finite poset (Q,⪯) is called graded if every maximal chain in Q has the same length ℓ, in which case we denote rank(Q):=ℓ. For x≤z∈Q, we denote by [x,z]:={y∈Q∣x≤y≤z} the corresponding interval. Note that the intervals in a graded poset Q are also graded, and we call Qthin if every interval of rank 2 has exactly 4 elements.
The order complex of a graded poset Q is the pure (rank(Q)−1)-dimensional simplicial complex whose vertices are the elements of Q, and whose faces are the chains in Q. We say that Q is shellable if its order complex is shellable, i.e., its maximal faces can be ordered as F1,…,Fn so that for 2≤k≤n, Fk∩(⋃1≤i<kFi) is a nonempty union of (rank(Q)−2)-dimensional faces of Fk.
Suppose that X is a regular CW complex with face poset Q. If Q⊔{0^,1^} (obtained by adjoining a minimum 0^ and a maximum 1^ to Q) is graded, thin, and shellable, then X is homeomorphic to a sphere of dimension rank(Q)−1.
3.2.3. Poincaré conjecture
Recall that an n-dimensional topological manifold with boundary is a Hausdorff space C such that every point x∈C has an open neighborhood homeomorphic either to Rn, or to R≥0×Rn−1 via a homeomorphism which takes x to a point in {0}×Rn−1. In the latter case, we say that x belongs to the boundary of C, denoted ∂C.
The following is a well-known consequence of the (generalized) Poincaré conjecture due to Smale [Sma61], Freedman [Fre82], and Perelman [Per02]. We refer to [Dav08, Theorem 10.3.3(ii)] for this formulation.
Let C be a compact contractible n-dimensional topological manifold with boundary, such that its boundary ∂C is homeomorphic to an (n−1)-dimensional sphere. Then C is homeomorphic to an n-dimensional closed ball.
For n≥6, Theorem 3.10 can be proved using the topological h-cobordism theorem [Mil65, KS77]. We sketch another standard argument for deducing Theorem 3.10 from the Poincaré conjecture when n is arbitrary. The boundary of C is collared by [Bro62, Theorem 2], i.e., there exists a homeomorphism from an open neighborhood of ∂C in C to ∂C×[0,1), which takes ∂C to ∂C×{0}. Thus we can attach the (collared) boundary of an n-dimensional closed ball to the (collared) boundary of C, obtaining a topological manifold C′. By van Kampen’s theorem, C′ is simply connected. It is easy to see from the Mayer–Vietoris sequence that C′ is a homology sphere. Thus C′ must be homeomorphic to a sphere by the Poincaré conjecture. Therefore C is homeomorphic to a closed ball by Brown’s Schoenflies theorem [Bro60].
The following is also a consequence of Brown’s collar theorem [Bro62, Theorem 2].
Proposition 3.11**.**
Suppose that C is a topological manifold with boundary ∂C. Then C is homotopy equivalent to its interior C∖∂C.
3.3. Link induction
Theorem 3.12**.**
Suppose that (Y,Y≥0,Q) is a shellable TNN space that admits a Fomin–Shapiro atlas, and let g≺h∈Q. Then Lkg,h≥0=⨆g≺g′⪯hLkg,g′>0 (cf. (3.1)) is a regular CW complex homeomorphic to a closed ball of dimension dim(h)−dim(g)−1.
Proof.
We proceed by induction on d:=dim(h)−dim(g)−1. For the base case d=0, we have Lkg,h≥0=Lkg,h>0, which is a [math]-dimensional contractible manifold by 3.2. Thus Lkg,h≥0 is a point, and we are done with the base case. Assume now that d>0 and that the result holds for all d′<d. We need to verify (CW1) and (CW2) when Xα=Lkg,h>0 (the other cases follow from the induction hypothesis).
We claim that Lkg,h≥0 is a topological manifold with boundary ∂Lkg,h≥0, where
[TABLE]
Let x∈Lkg,h≥0. By (3.1), we have x∈Lkg,g′>0 for a unique g≺g′⪯h. If g′=h, then x has an open neighborhood in Lkg,h≥0 homeomorphic to Rd by 3.2. If g′≺h, then by Lemma 3.6 we have a local homeomorphism (Lkg,h≥0,x)∼(Zg′,h≥0×Rd′,(0,0)), where d′:=dim(g′)−dim(g)−1. By (iv), we have a homeomorphism Zg′,h≥0∼Cone(Lkg′,h≥0) which sends [math] to the cone point c. By the induction hypothesis, Lkg′,h≥0 is homeomorphic to a (d−d′−1)-dimensional closed ball, and so we have a homeomorphism Cone(Lkg′,h≥0)∼R≥0×Rd−d′−1 which sends c to (0,0). Composing gives a local homeomorphism (Lkg,h≥0,x)∼(R≥0×Rd−d′−1×Rd′,(0,0,0)). Thus indeed Lkg,h≥0 is a topological manifold with boundary given by (3.2).
By 3.2, Lkg,h≥0 is compact. By 3.2 and Proposition 3.11, Lkg,h≥0 is contractible. Thus Lkg,h≥0 is a compact contractible topological manifold with boundary. In addition, the boundary ∂Lkg,h≥0 is a regular CW complex by the induction hypothesis. Its face poset is the interval (g,h):=[g,h]∖{g,h} in Q. The interval [g,h] is graded, thin, and shellable by (TNN1), (TNN1’), and Proposition 3.8, and thus ∂Lkg,h≥0 is homeomorphic to a (d−1)-dimensional sphere by Theorem 3.9. By Theorem 3.10, we get a homeomorphism from Lkg,h≥0 to a d-dimensional closed ball B. By (3.2), it sends the interior Lkg,h>0 to the interior of B. This proves (CW1), and (CW2) follows from (3.2). This completes the induction.
∎
The proof follows the same structure as the proof of Theorem 3.12. We proceed by induction on dim(h). If dim(h)=0, then Yh≥0=Yh>0 is a point by (TNN4), which finishes the base case.
Let dim(h)>0. We want to show that Yh≥0 is a topological manifold with boundary
[TABLE]
Let x∈Yh≥0. By (TNN5), we have x∈Yg>0 for a unique g⪯h. If g=h, then x has an open neighborhood in Yh≥0 homeomorphic to Rdim(h) by (TNN4). If g≺h, then Starg≥0 is an open subset of Y≥0 (its complement is ⋃g′⪰gYg′≥0, which is closed by (TNN5)). Thus Starg,h≥0 is an open neighborhood of x in Yh≥0. By (iv), (TNN4), and Theorem 3.12, we get a homeomorphism Starg,h≥0∼R≥0×Rdim(h)−1 whose first component sends x∈Yg>0 to 0∈R≥0. This shows that Yh≥0 is a topological manifold with boundary given by (3.3).
By (TNN3) and (TNN5), Yh≥0 is compact. By (TNN4) and Proposition 3.11, Yh≥0 is contractible. Thus Yh≥0 is a compact contractible topological manifold with boundary. In addition, the boundary ∂Yh≥0 is a regular CW complex by the induction hypothesis. Its face poset is the interval (0^,h) in Q. The interval [0^,h] is graded, thin, and shellable by (TNN1), (TNN1’), and Proposition 3.8, and thus ∂Yh≥0 is homeomorphic to a (d−1)-dimensional sphere by Theorem 3.9. We are done by Theorem 3.10, as in the proof of Theorem 3.12.
∎
Remark 3.13**.**
We note that Theorems 2.5 and 3.12 imply the result of Hersh [Her14b] (see Corollary 1.3) that the link of the identity in the Bruhat decomposition of U≥0 is a regular CW complex. (Recall that U is the unipotent radical of the standard Borel subgroup B⊂G.) Indeed, let B−⊂G denote the opposite Borel subgroup. Then the natural inclusion U↪G/B− sends U to the opposite Schubert cell Star(id,id) indexed by id∈W, and the composition of this map with νˉ(id,id) sends the link of the identity in U>0w homeomorphically to Lk(id,id),(id,w)≥0 for all w∈W.
4. G/P: preliminaries
We give some background on partial flag varieties. Throughout, K denotes an algebraically closed field of characteristic [math], and K∗:=K∖{0} denotes its multiplicative group.
4.1. Pinnings
We recall some standard notions that can be found in e.g. [Lus94, Section 1]. Suppose that G is a simple and simply connected algebraic group over K, with T⊂G a maximal torus. Let B,B− be opposite Borel subgroups satisfying T=B∩B−. We identify G with its set of K-valued points. When K=C, we assume that G and T are split over R, and denote by G(R)⊂G and T(R)⊂T the sets of their R-valued points. (Thus what was denoted by G in Section 1 is from now on denoted by G(R). We are also assuming that G is a simple algebraic group, rather than semisimple; our results for the case of a general semisimple group reduce to the simple case by taking products.)
Let X(T):=Hom(T,K∗) be the weight lattice, and for a weight γ∈X(T) and a∈T, we denote the value of γ on a by aγ. Let Φ⊂X(T) be the set of roots. We have a decomposition Φ=Φ+⊔Φ− of Φ as a union of positive and negative roots corresponding to the choice of B; see [Hum75, Section 27.3]. For α∈Φ, we write α>0 if α∈Φ+ and α<0 if α∈Φ−. Let {αi}i∈I be the simple roots corresponding to the choice of Φ+. For every i∈I, we have a homomorphism ϕi:SL2→G, and denote
[TABLE]
The data (T,B,B−,xi,yi;i∈I) is called a pinning for G. Let W:=NG(T)/T be the Weyl group, and for i∈I, let si∈W be represented by s˙i above. Then W is generated by {si}i∈I, and (W,{si}i∈I) is a finite Coxeter group. For w∈W, the lengthℓ(w) is the minimal n such that w=si1⋯sin for some i1,…,in∈I. When n=ℓ(w), we call i:=(i1,…,in) a reduced word for w. The representatives {s˙i}i∈I satisfy the braid relations [Spr98, Proposition 9.3.2], so we set w˙:=s˙i1⋯s˙in∈G, and this representative does not depend on the choice of i.
Let Y(T):=Hom(K∗,T) be the coweight lattice. For i∈I, we have a simple coroot αi∨(t):=ϕi(t00t−1)∈Y(T). Denote by ⟨⋅,⋅⟩:Y(T)×X(T)→Z the natural pairing so that for γ∈X(T), β∈Y(T), and t∈K∗, we have (β(t))γ=t⟨β,γ⟩. Let {ωi}i∈I⊂X(T) be the fundamental weights. They form a dual basis to {αi∨}i∈I: ⟨αj∨,ωi⟩=δij for i,j∈I.
The Weyl group W acts on T by conjugation, which induces an action on Y(T), X(T), and Φ. For γ∈X(T), t∈K∗, a∈T, and w∈W, we have [FZ99, (1.2) and (2.5)]
[TABLE]
Following [BZ97, (1.6) and (1.7)] (see also [FZ99, (2.1) and (2.2)]), we define two involutive anti-automorphisms x↦xT and x↦xι of G by
[TABLE]
for all i∈I, t∈K∗, a∈T, and w∈W, where z:=w−1. We note that when z=w−1∈W and i=(i1,…,in) is a reduced word for w then w˙−1=s˙in−1⋯s˙i1−1 while z˙=s˙in⋯s˙i1.
4.2. Subgroups of U
We say that a subset Θ⊂Φ is bracket closed if whenever α,β∈Θ are such that α+β∈Φ, we have α+β∈Θ. For a bracket closed subset Θ⊂Φ+, define U(Θ)⊂U to be the subgroup generated by {Uα∣α∈Θ}, where Uα is a root subgroup of G; see [Hum75, Theorem 26.3]. For a bracket closed subset Θ⊂Φ−, let U−(Θ):=U(−Θ)T⊂U−.
Given closed subgroups H1,…,Hn of an algebraic group H, we say that H1,⋯,Hndirectly spanH if the multiplication map H1×⋯×Hn→H is a biregular isomorphism.
If Θ=⨆i=1nΘi and Θ,Θ1,…,Θn⊂Φ+ are bracket closed then U(Θ) is directly spanned by U(Θ1),…,U(Θn).
2. (iv)
In particular, U(Θ) is directly spanned by {Uα∣α∈Θ} in any order, and therefore U(Θ)≅K∣Θ∣.
For α∈Φ and w∈W, we have w˙Uαw˙−1=Uwα. For w∈W, define Inv(w):=(w−1Φ−)∩Φ+. The subsets Inv(w) and Φ+∖Inv(w) are bracket closed [Hum75, Section 28.1], and
[TABLE]
4.3. Bruhat projections
Let Θ⊂Φ+ be bracket closed, and let w∈W. Define Θ1:=Θ∩Inv(w) and Θ2:=Θ∖Inv(w). Thus both sets are bracket closed and
[TABLE]
Denote U1:=U−(wΘ1) and U2:=U(wΘ2). Then by (iv), the multiplication map gives isomorphisms μ12:U1×U2→w˙U(Θ)w˙−1 and μ21:U2×U1→w˙U(Θ)w˙−1. Denote by ν1:w˙U(Θ)w˙−1→U1 and ν2:w˙U(Θ)w˙−1→U2 the second component of μ21−1 and μ12−1, respectively. In other words, given g∈w˙U(Θ)w˙−1, ν1(g) is the unique element in U1∩U2g and ν2(g) is the unique element in U2∩U1g.
The map (ν1,ν2):w˙U(Θ)w˙−1→U1×U2 is a biregular isomorphism.
4.4. Commutation relations
Let a,b∈W be such that ℓ(ab)=ℓ(a)+ℓ(b). Then
[TABLE]
Thus by (iv), the multiplication map gives an isomorphism
[TABLE]
We will later need the following consequences of (4.7): if ℓ(ab)=ℓ(a)+ℓ(b) then
[TABLE]
Multiplying both sides of (4.9) by b˙−1 on the left, we get b˙−1U(Inv(a))b˙⊂U(Inv(ab)), which follows from (4.6). We obtain (4.8) from (4.9) by applying the map x↦xT; see (4.3).
Lemma 4.3**.**
Let α∈Φ+ and i∈I be such that α=αi. Let Ψ⊂Φ denote the set of all roots of the form mα−rαi for integers m>0, r≥0. Then Ψ is a bracket closed subset of Φ+, and for all t∈K we have yi(t)Uαyi(−t)⊂U(Ψ).
Proof.
Let x∈Uα and x′:=s˙i−1xs˙i∈Usiα. By [BB05, Lemma 4.4.3], si permutes Φ+∖{αi} (in particular, siα>0). Write
[TABLE]
Denote by Ψ′⊂Φ the set of all roots of the form msiα+rαi for integers m,r>0. It is clear that Ψ′⊂Φ+∖{αi,siα} is a bracket closed subset. By [Hum75, Lemma 32.5], we have xi(−t)x′xi(t)x′−1∈U(Ψ′), so xi(−t)x′xi(t)∈U(Ψ′)x′. Thus Ψ′′:=siΨ′ is also a bracket closed subset of Φ+∖{αi,α}, and we have s˙iU(Ψ′)x′s˙i−1=U(Ψ′′)x. Clearly, Ψ=Ψ′′⊔{α}. We thus have yi(t)Uαyi(−t)⊂U(Ψ′′)Uα=U(Ψ).
∎
4.5. Flag variety and Bruhat decomposition
Let G/B be the flag variety of G (over K). We recall some standard properties of the Bruhat decomposition that can be found in e.g. [Hum75, Section 28]. Define open Schubert, opposite Schubert, and Richardson varieties:
[TABLE]
Recall the Bruhat and Birkhoff decompositions:
[TABLE]
Let Xv denote the (Zariski) closure of \accentset∘Xv. Similarly, let Xw denote the closure of \accentset∘Xw, and then Rv,w=Xv∩Xw is the closure of \accentset∘Rv,w in G/B. We have
[TABLE]
For any w∈W, i∈I, and t∈K∗, we have
[TABLE]
For t=(t1,…,tn)∈(K∗)n and a reduced word i=(i1,…,in) for w∈W, define
We give a description of the poset QJ studied in [Rie06, GY09, KLS14, HL15] in a form adapted to our needs in this paper.
Let J⊂I, and denote by WJ⊂W the subgroup generated by {si}i∈J. Let WJ be the set of minimal-length coset representatives of W/WJ; see [BB05, Section 2.4]. Let wJ be the longest element of WJ, and wJ:=w0wJ be the maximal element of WJ. Let ΦJ⊂Φ consist of roots that are linear combinations of {αi}i∈J. Define
[TABLE]
The sets ΦJ+, Φ+(J), ΦJ−, Φ−(J) are clearly bracket closed, so consider subgroups
[TABLE]
In fact, we have
[TABLE]
Let WmaxJ:={wwJ∣w∈WJ}. By [BB05, Proposition 2.4.4], every w∈W admits a unique parabolic factorizationw=w1w2 for w1∈WJ and w2∈WJ, and this factorization is length-additive. We state some standard facts on parabolic factorizations for later use.
Lemma 4.4**.**
(iv)
If u∈WJ and siu<u, then siu∈WJ.
2. (iv)
Given u∈WJ and r,r′∈WJ, we have ur≤ur′ if and only if r≤r′.
Proof.
For (iv) suppose that siu∈/WJ, so that siusj<siu for some j∈J. Then siusj<siu<u<usj, which contradicts ℓ(usj)=ℓ(siusj)±1. For (iv), see [BB05, Exercise 2.21].
∎
Lemma 4.5**.**
For any w∈WJ, we have Inv(w)⊂Φ+(J). In particular, wΦJ+⊂Φ+, w˙UJw˙−1⊂U, and w˙UJ−w˙−1⊂U−.
Proof.
Let α∈Φ+ be a positive root. Then it can be written as α=∑i∈Iciαi for ci∈Z≥0. Since w∈WJ, we have wαi>0 for all i∈J. Thus if wα<0, we must have ci=0 for some i∈/J, so α∈Φ+(J).
∎
The set {uv∣u≤x,v≤y} contains a unique maximal element, denoted x∗y. The set {xv∣v≤y} contains a unique minimal element, denoted x◃y.
2. (iv)
There exist elements u′≤x and v′≤y such that x∗y=xv′=u′y, and these factorizations are both length-additive.
3. (iv)
If x′≤x, then x′∗y≤x∗y and x′◃y≤x◃y.
4. (iv)
If xy is length-additive, then x∗y=xy and (xy)◃y−1=x.
The operations ∗ and ◃ are called the Demazure product and downwards Demazure product.
Proof.
The first three parts were shown in [He09, Section 1.3], with the caveat that our ◃ is the ‘mirror image’ of He’s ▹. Part (iv) follows from the definitions of ∗ and ◃.
∎
Definition 4.7**.**
Let QJ={(v,w)∈W×WJ∣v≤w}. We define an order relation ⪯ on QJ as follows: for (v,w),(v′,w′)∈QJ, we write (v,w)⪯(v′,w′) if and only if there exists r∈WJ such that vr is length-additive and v′≤vr≤wr≤w′. For (v,w)∈QJ, define
[TABLE]
Lemma 4.8**.**
(iv)
Let (v,w),(v′,w′)∈QJ, r∈WJ, and v′≤vr≤wr≤w′. Then (v,w)⪯(v′,w′).
2. (iv)
Let (u,u),(v,w),(v′,w′)∈QJ. Then (u,u)⪯(v,w)⪯(v′,w′) if and only if
[TABLE]
Proof.
(iv): By Lemma 4.6, there exists r′≤r such that v∗r=vr′≥vr, and vr′ is length-additive. We have vr′≤wr′ by (iv), and wr′≤wr by (iv). Therefore v′≤vr≤vr′≤wr′≤wr≤w′, so (v,w)⪯(v′,w′).
(iv) (⇒): Suppose that (u,u)⪯(v,w)⪯(v′,w′). Then by Definition 4.7, there exist r′,r′′∈WJ such that vr′ is length-additive, v′≤vr′≤wr′≤w′, and v≤ur′′≤w. Define r∈WJ by the equality (ur′′)∗r′=ur. Then applying ∗r′ on the right to v≤ur′′≤w, by (iv)–(iv), we obtain vr′≤ur≤wr′. Therefore (4.22) holds.
(iv) (⇐): Suppose that (4.22) holds. Then (v,w)⪯(v′,w′). Define r′′∈WJ by the equality (ur)◃r′−1=ur′′. Then applying ◃(r′)−1 on the right to vr′≤ur≤wr′, by (iv)–(iv), we obtain v≤ur′′≤w. Therefore (u,u)⪯(v,w).
∎
Remark 4.9**.**
By (iv), Definition 4.7 remains unchanged if we omit the condition that vr is length-additive. It follows that QJ coincides with the poset studied in [HL15, Section 2.4]. Therefore by [HL15, Appendix], QJ is also isomorphic to the posets studied in [Rie06, GY09, KLS14].
4.7. Partial flag variety G/P
Fix J⊂I as before. Let P⊂G be the subgroup generated by B and {yi(t)∣t∈K∗,i∈J}. We denote by G/P the partial flag variety corresponding to J, and let πJ:G/B→G/P be the natural projection map. Let LJ⊂P be the Levi subgroup of P. It is generated by T and {xi(t),yi(t)∣i∈J,t∈K∗}. Let P− be the parabolic subgroup opposite to P, with LJ=P∩P−.
For (v,w)∈QJ we introduce \accentset∘Πv,w:=πJ(\accentset∘Rv,w)⊂G/P, and define the projected Richardson varietyΠv,w⊂G/P to be the closure of \accentset∘Πv,w in the Zariski topology. By [KLS14, Proposition 3.6], we have
[TABLE]
Now let K=C. The varieties \accentset∘Xw, \accentset∘Xv, Xw, Xv, \accentset∘Rv,w, and Rv,w are defined over R. The map πJ is defined over R as well, and thus so are \accentset∘Πv,w and Πv,w. We let
[TABLE]
It follows that the decomposition (4.23) is valid over R:
[TABLE]
4.8. Total positivity
Assume K=C in this section. Recall from Section 4.1 that for each i∈I, we have elements xi(t), yi(t) (for t∈C) and αi∨(t) (for t∈C∗).
Let G≥0⊂G(R) be the submonoid generated by xi(t), yi(t), and αi∨(t) for t∈R>0. Define (G/B)≥0 to be the closure of (G≥0/B)⊂(G/B)R in the analytic topology. For v≤w∈W, let Rv,w≥0 denote the closure of Rv,w>0:=\accentset∘Rv,w∩(G/B)≥0 inside (G/B)≥0.
(Assume K=C.) Let (v,w)∈QJ and r∈WJ be such that vr is length-additive.
Then
[TABLE]
Proof.
By [KLS14, Lemma 3.1], we have πJ(\accentset∘Rv,w)=πJ(\accentset∘Rvr,wr)=\accentset∘Πv,w, and πJ restricts to isomorphisms \accentset∘Rv,w∼\accentset∘Πv,w, \accentset∘Rvr,wr∼\accentset∘Πv,w. Thus πJ(Rv,w>0)=πJ(Rvr,wr>0)=Πv,w>0 follows from the equality πJ((G/B)≥0)=(G/P)≥0, proving (4.27). To show (4.28), note that Ra,b and Ra,b≥0 are compact for any a≤b, and therefore their images under πJ are closed.
∎
Recall the definition of xi(t) and yi(t) from (4.19). Choose a reduced word i=(i1,…,in) for w∈W and define
[TABLE]
Let U≥0⊂U(R) (respectively, U≥0−⊂U−(R)) be the submonoid generated by xi(t) (respectively, by yi(t)) for t∈R>0. Then U≥0=⨆w∈WU>0(w) and U≥0−=⨆w∈WU>0−(w). We have U>0(w)=U≥0∩B−w˙B− and U>0−(w)=U≥0−∩Bw˙B, and these sets do not depend on the choice of the reduced word i for w; see [Lus94, Proposition 2.7].
4.9. Marsh–Rietsch parametrizations
Assume that K is algebraically closed. Given w∈W, an expressionw for w is a sequence w=(w(0),…,w(n)) such that w(0)=id, w(n)=w, and for j=1,…,n, either w(j)=w(j−1) or w(j)=w(j−1)sij for some ij∈I. In the latter case we require w(j−1)<w(j), unlike in [MR04]. We define Jw+:={1≤j≤n∣w(j−1)<w(j)} and Jw∘:={1≤j≤n∣w(j−1)=w(j)} so that Jw+⊔Jw∘={1,2,…,n}. Every reduced word i=(i1,…,in) for w gives rise to a reduced expressionw=w(i)=(w(0),…,w(n)) with w(j)=w(j−1)sij for j=1,…,n.
Let v≤w∈W, and consider a reduced expression w=(w(0),…,w(n)) for w corresponding to a reduced word i=(i1,…,in). Then there exists a unique positive subexpression v for v insidew, i.e., an expression v=(v(0),…,v(n)) for v such that for j=1,…,n, we have v(j−1)<v(j−1)sij. This positive subexpression can be constructed inductively by setting v(n):=v and
[TABLE]
Corollary 4.14**.**
In the setting above, if v(1)=si for some i∈I then v≤siw.
Proof.
Indeed, if v≤siw<w then there exists a positive subexpression v′=(v(0)′,…,v(n−1)′) for v inside w(i′), where i′=(i2,…,in). By (4.29), we have v(j)′=v(j+1) for j=0,1,…,n−1, which contradicts the fact that v(0)′=1 while v(1)=si.
∎
For w∈W, let \operatorname{Red}(w):=\{{\mathbf{w}}\mid\text{{\mathbf{w}}isareducedexpressionforw}\}. For v≤w∈W, let
[TABLE]
Thus for all v≤w, the sets Red(w) and Red(v,w) have the same cardinality. Let v≤w∈W and (v,w)∈Red(v,w). Given a collection t=(tk)k∈Jv∘∈(K∗)Jv∘, define
[TABLE]
4.9.1. Marsh–Rietsch parametrizations of (G/B)≥0
In this section, we assume K=C. Let v, w, v, and w be as above. Define a subset Gv,w>0⊂G(R) by
Suppose that g∈G≥0 and x∈G are such that xB∈Rv,w>0 for some v≤w∈W. Then gxB∈Rv′,w′>0 for some v′≤v≤w≤w′.
Proof.
By Proposition 4.16, we have gxB∈(G/B)≥0, so it suffices to show that gx∈Bw˙′B∩B−v˙′B for some v′≤v≤w≤w′. Note that we have x∈Bw˙B∩B−v˙B. By Definition 4.10, it is enough to consider the cases g=xi(t) and g=yi(t) for i∈I and t∈R>0.
Suppose that g=yi(t). We clearly have gx∈B−v˙B. If siw>w then by (4.16) we have gx∈Bs˙iw˙B. Thus we may assume that siw<w. By Theorem 4.15, we can also assume x=gv,w(t)=g1⋯gn for t∈R>0Jv∘ and some choice of (v,w)∈Red(v,w) such that w=(w(0),…,w(n)) satisfies w(1)=si. Let v=(v(0),…,v(n)). If v(1)=si then g1=yi(t′), so gx∈Gv,w>0 and we are done. If v(1)=si then by Corollary 4.14 we have v≤siw. Recall that gx∈B−v˙B and by (4.16), gx∈Bs˙iw˙B⊔Bw˙B. But B−v˙B∩Bs˙iw˙B=∅ by (4.12). Therefore we must have gx∈Bw˙B, finishing the proof in this case.
The case g=xi(t) follows similarly using a “dual” Marsh–Rietsch parametrization [Rie06, Section 3.4], where for (v,w)∈Red(v,w), every element of Rww0,vw0>0 is parametrized as
Let i=(i1,…,in) be a reduced word for w:=ur, such that (iℓ(u)+1,…,in) is a reduced word for r. Let (v,w)∈Red(v,w) be such that w corresponds to i. Then it is clear from Lemma 4.13 that after setting v′:=(v(0),…,v(ℓ(u))) and u:=(w(0),…,w(ℓ(u))), we get (v′,u)∈Red(v◃r−1,u). Moreover, the indices iℓ(u)+1,…,in clearly belong to J, so if g1⋯gn∈Gv,w>0 then g1⋯gℓ(u)∈Gv′,u>0 and πJ(g1⋯gnB)=πJ(g1⋯gℓ(u)B). We are done by Theorem 4.15.
∎
4.10. G/P is a shellable TNN space
We show that the triple ((G/P)R,(G/P)≥0,QJ) is a shellable TNN space in the sense of Definition 2.1. We start by recalling several known results.
Theorem 4.19**.**
(iv)
The poset QJ:=QJ⊔{0^} is graded, thin, and shellable.
2. (iv)
(G/P)R* is a smooth manifold. Each \accentset∘Πv,wR is a smooth embedded locally closed submanifold of (G/P)R.*
3. (iv)
For (v,w)∈QJ, Πv,w>0 is a connected component of \accentset∘Πv,wR.
Proof.
Part (iv) is due to Williams [Wil07]. For (iv), (G/P)R is a smooth manifold because it is a homogeneous space of a real Lie group. Each \accentset∘Πv,wR is a smooth embedded manifold because it is the set of real points of a smooth algebraic subvariety \accentset∘Πv,w of G/P; see [KLS14, Corollary 3.2] or [Lus98a, Rie06]. Part (iv) is due to Rietsch [Rie99].
∎
Corollary 4.20**.**
((G/P)R,(G/P)≥0,QJ)* is a shellable TNN space.*
(TNN5): This result is due to Rietsch [Rie06]; see (4.25).
∎
4.11. Gaussian decomposition
Assume K is algebraically closed. Let us define
[TABLE]
For i∈I, let Δi∓:G0∓→K and Δi±:G0±→K be defined as follows. Given (x−,x0,x+)∈U−×T×U, we have x−x0x+∈G0∓ and x+x0x−∈G0±, and we set Δi∓(x−x0x+):=x0ωi, Δi±(x+x0x−):=x0w0ωi. For a finite set A, let PA denote the (∣A∣−1)-dimensional projective space over K, with coordinates indexed by elements of A.
Lemma 4.21**.**
(iv)
The multiplication map gives biregular isomorphisms
[TABLE]
2. (iv)
The maps Δi∓ and Δi± extend to regular functions G→K.
3. (iv)
G0∓={x∈G∣Δi∓(x)=0 for all i∈I}, G0±={x∈G∣Δi±(x)=0 for all i∈I}.
4. (iv)
Fix i∈I and let Wωi:={wωi∣w∈W} denote the W-orbit of the corresponding fundamental weight. Then there exists a regular map Δiflag:G/B→PWωi such that for w∈W and x∈G, the wωi-th coordinate of Δiflag(xB) equals Δi∓(w˙−1x).
Proof.
For (iv), see [Hum75, Proposition 28.5]. Parts (iv) and (iv) are well known when K=C; see [FZ99, Proposition 2.4 and Corollary 2.5]. We give a proof for arbitrary algebraically closed K, using a standard argument that relies on representation theory. We refer to [Hum75, Section 31] for the necessary notation and background.
We have G0±=w˙0−1G0∓w˙0 and Δi±(w˙0−1gw˙0)=Δi∓(g) for all g∈G0∓. Thus it suffices to give a proof for Δi∓ and G0∓. For i∈I, there exists a regular function cωi:G→K that coincides with Δi∓ on G0∓; see [Hum75, Section 31.4]. This shows (iv). Explicitly, cωi is given as follows: consider the highest weight module Vωi for G, and let v+∈Vωi be its highest weight vector. We have a direct sum of vector spaces Vωi=Kv+⊕V′, where V′ is spanned by weight vectors of weights other than ωi. Letting r+:Vωi→K denote the linear function such that r+(v+)=1 and r+(V′)={0}, we have cωi(g):=r+(gv+) for all g∈G. The decomposition Vωi=Kv+⊕V′ is such that for (x−,x0,x+)∈U−×T×U and w∈W, we have x+v+=v+, x0v+=Mv+ for some M∈K∗, x−v+∈v++V′, x−V′⊂V′, and w˙v+∈V′ if wωi=ωi. Thus if g∈G0∓ then cωi(g)=0 for all i∈I.
Conversely, if g∈/G0∓ then by (4.11), there exists a unique w=id∈W such that g∈U−w˙TU. For i∈I such that wωi=ωi, we get cωi(g)=0. This proves (iv). For (iv), let Vωi=V1⊕V2 where V1 is spanned by all weight vectors of weights in Wωi, and V2 is spanned by the remaining weight vectors. Let π1:Vωi→V1 denote the projection along V2. It follows that for all g∈G, π1(gv+)=0. Then Δiflag is the natural morphism G/B→P(V1), sending gB to [π1(gv+)].
∎
Lemma 4.22**.**
Define G0(J):=P−P (with notation as in Section 4.7).
(iv)
We have G0(J)=P−B and P=⨆r∈WJBr˙B.
2. (iv)
For p∈P, we have pU(J)p−1=U(J). Similarly, for p∈P−, we have pU−(J)p−1=U−(J). In particular, for p∈LJ, we have pU(J)p−1=U(J) and pU−(J)p−1=U−(J).
3. (iv)
The multiplication map gives a biregular isomorphism U−(J)×LJ×U(J)∼G0(J). In particular, every element x∈G0(J) can be uniquely factorized as [x]−(J)⋅[x]J⋅[x]+(J)∈U−(J)⋅LJ⋅U(J). The map G0(J)→LJ sending x to [x]J satisfies [p−xp+]J=[p−]J[x]J[p+]J for all x∈G0(J), p−∈P−, and p+∈P.
4. (iv)
The map b↦[b]J gives group homomorphisms U→UJ and U−→UJ−, such that
[TABLE]
Proof.
By [Hum75, Section 30.2], U(J) is the unipotent radical (in particular, a normal subgroup) of P and U−(J) is the unipotent radical of P−. This shows (iv). It follows that P=LJU(J)=LJB, and therefore G0(J)=P−B. By [Hum75, Section 30.1] and (4.11), P=⨆r∈WJBr˙B, which proves (iv).
By [Bor91, Proposition 14.21(iii)], the multiplication map gives a biregular isomorphism U−(J)×P→G0(J). By [Hum75, Section 30.2], the multiplication map gives a biregular isomorphism LJ×U(J)→P. Thus we get a biregular isomorphism U−(J)×LJ×U(J)∼G0(J). It is clear from the definition that [p−xp+]J=[p−]J[x]J[p+]J, since we can factorize p−=[p−]−(J)[p−]J and p+=[p+]J[p+]+(J). Thus we are done with (iv), and (iv) follows by repeatedly applying (iv).
∎
4.12. Affine charts
For u∈WJ, define Cu(J):=u˙G0(J)/P⊂G/P. The following maps are biregular isomorphisms for u∈WJ and v,w∈W (see [Bor91, Proposition 14.21(iii)], [Spr98, Proposition 8.5.1(ii)], and [FH91, Corollary 23.60]):
The isomorphism in (4.31) identifies an open dense subset Cu(J) of G/P with the group u˙U−(J)u˙−1. We now combine this with Lemma 4.2.
Definition 4.23**.**
Let U1(J):=u˙U−(J)u˙−1∩U and U2(J):=u˙U−(J)u˙−1∩U−. For x∈u˙G0(J), consider the element g(J)∈u˙U−(J)u˙−1 such that g(J)u˙∈xP∩u˙U−(J), which is unique by (4.31). Further, let h1(J),g1(J)∈U1(J) and h2(J),g2(J)∈U2(J) be the elements such that h2(J)g(J)=g1(J) and h1(J)g(J)=g2(J). By (4.31), the map x↦g(J) is regular, and the map g(J)↦(g1(J),g2(J),h1(J),h2(J)) is regular by Lemma 4.2. Let us denote by κ:u˙G0(J)→U2(J) the map x↦κx:=h2(J). It descends to a regular map κ:Cu(J)→U2(J) sending xP to κx.
5. Subtraction-free parametrizations
We study subtraction-free analogs of Marsh–Rietsch parametrizations [MR04] of (G/B)≥0.
5.1. Subtraction-free subsets
Given some fixed collection t of variables of size ∣t∣, let R[t] be the ring of polynomials in t, and R>0[t]⊂R[t] be the semiring of nonzero polynomials in t with positive real coefficients. Let F:=R(t) be the field of rational functions in t. Define
[TABLE]
[TABLE]
We call elements of Fsfsubtraction-free rational expressions in t. In this section, we assume that K=F is the algebraic closure of F.
Definition 5.1**.**
Let Tsf⊂T be the subgroup generated by αi∨(t) for i∈I and t∈Fsf∗. Let G⋄⊂G be the subgroup generated by
[TABLE]
We define subgroups U⋄:=U∩G⋄, U−⋄:=U−∩G⋄, B⋄:=TsfU⋄=U⋄Tsf and B−⋄:=TsfU−⋄=U−⋄Tsf (cf. Lemma 5.2 below). We also put U⋄(Θ):=U⋄∩U(Θ) (respectively, U−⋄(Θ):=U−⋄∩U−(Θ)) for a bracket closed subset Θ of Φ+ (respectively, of Φ−). Given a reduced word i for w∈W, define
[TABLE]
These subsets do not depend on the choice of i; see [BZ97, Section 3].
For two subsets H1 and H2 of G, we say that H1commutes setwise withH2 if H1⋅H2=H2⋅H1. We say that H1commutes setwise withg∈G if H1⋅g=g⋅H1.
Lemma 5.2**.**
Tsf* commutes setwise with B⋄, U, U−, U⋄(Θ), U−⋄(Θ), Usf(w), Usf−(w), and w˙.*
Proof.
It follows from (4.2) that Tsf commutes setwise with B⋄, U, U−, Usf(w), Usf−(w), and w˙. For U⋄(Θ), U−⋄(Θ), we use a generalization of (4.2): for α∈Φ+, i∈I, and w∈W such that wαi=α, write xα(t):=w˙xi(t)w˙−1∈U⋄({α}) and yα(t):=w˙yi(t)w˙−1∈U−⋄({−α}) for t∈F⋄. Then (4.2) implies axα(t)a−1=xα(aαt) and ayα(t)a−1=yα(a−αt).
∎
Let us now introduce subtraction-free analogs of Marsh–Rietsch parametrizations. Let v≤w∈W and (v,w)∈Red(v,w). Recall that for t′=(tk′)k∈Jv∘∈(K∗)Jv∘, gv,w(t′)=g1⋯gn is defined in (4.30). Define Gv,wsf:={gv,w(t′)∣t′∈(Fsf∗)Jv∘}⊂G⋄. The following result is closely related to [MR04, Lemma 11.8].
Lemma 5.3**.**
Let v≤w∈W and (v,w)∈Red(v,w). Let gv,w(t′) be as in (4.30) for t′∈(Fsf∗)Jv∘. Then for each k=0,1,…,n and for all x∈U⋄∩v˙(k)−1U−v˙(k), we have
[TABLE]
Proof.
We prove this by induction on k. For k=n, the result is trivial, so suppose that k<n. Let x∈U⋄∩v˙(k)−1U−v˙(k). If gk+1=s˙i for some i∈I then ℓ(v(k+1))=ℓ(v(k))+ℓ(si), so we use (4.9) to show that x⋅gk+1=gk+1⋅x′ for some x′∈U∩v˙(k+1)−1U−v˙(k+1). Since x′=s˙i−1xs˙i and each term belongs to G⋄, we see that x′∈U⋄∩v˙(k+1)−1U−v˙(k+1), so we are done by induction.
Suppose now that gk+1=yi(t) for some i∈I and t∈Fsf∗. Write
[TABLE]
By (4.5), U⋄∩v˙(k)−1U−v˙(k)=U⋄(Inv(v(k))). Clearly again yi(−t)xyi(t)∈G⋄, and we claim that yi(−t)xyi(t)∈U(Inv(v(k))) for all x∈U(Inv(v(k))). First, using (iv), we can assume that x∈Uα for some α∈Inv(v(k)). Since v(k)si>v(k), we have αi∈/Inv(v(k)), so α=αi. Let Ψ={mα−rαi}⊂Φ+ be the set of roots as in Lemma 4.3. Our goal is to show that Ψ⊂Inv(v(k)). Let γ:=mα−rαi∈Ψ for some m>0 and r≥0. We now show that γ∈Inv(v(k)), which is equivalent to saying that v(k)γ<0. Indeed, v(k)γ=mv(k)α−rv(k)αi. Since α∈Inv(v(k)), v(k)α<0. Since αi∈/Inv(v(k)), v(k)αi>0. Thus v(k)γ<0, because −v(k)γ is a positive linear combination of positive roots. We have shown that Ψ⊂Inv(v(k)), and thus by Lemma 4.3, we find yi(−t)xyi(t)∈U(Inv(v(k))). Since v(k)=v(k+1), we get
[TABLE]
and we are done by induction.
∎
Proposition 5.4**.**
For v≤w∈W, the set Gv,wsf⋅U⋄⊂G⋄ does not depend on the choice of (v,w)∈Red(v,w). In other words: let (v0,w0),(v1,w1)∈Red(v,w). Then for any t0∈(Fsf∗)Jv0∘ there exist t1∈(Fsf∗)Jv1∘ and x∈U⋄ such that gv0,w0(t0)=gv1,w1(t1)⋅x.
Proof.
Recall that for each w0∈Red(w) there exists a unique positive subexpression v0 for v such that (v0,w0)∈Red(v,w). We need to show that choosing a different reduced expression w1 for w results in a subtraction-free coordinate change t0↦t1 of the parameters in Theorem 4.15. Any two reduced expressions for w are related by a sequence of braid moves, so it suffices to assume that w0 and w1 differ by a single braid move.
The explicit formulae for the corresponding coordinate transformations can be found in the proof of [Rie08, Proposition 7.2]; however, an extra step is needed to show that those formulae indeed give the correct coordinate transformations. More precisely, suppose that Φ′ is a root subsystem of Φ of rank 2, and let W′ be its Weyl group. Then it was checked in the proof of [Rie08, Proposition 7.2] that for any v′≤w′∈W′, any (v0′,w0′),(v1′,w1′)∈Red(v′,w′), and any t0′∈(Fsf∗)Jv0′∘, there exist t1′∈(Fsf∗)Jv1′∘ and x∈U such that gv0′,w0′(t0′)=gv1′,w1′(t1′)⋅x.
Let us now complete the proof of Proposition 5.4 (as well as of [Rie08, Proposition 7.2]).111Alternatively, the proof of [Rie08, Proposition 7.2] can be completed using [MR04, Theorem 7.1]. We thank Konni Rietsch for pointing this out to us. Suppose that w0 and w1 differ by a braid move along a subword gk+1⋯gk+m of g1⋯gn. Here gk+1⋯gk+m=gv0′,w0′(t0′) as above. Applying a move from [Rie08], we transform gk+1⋯gk+m into gk+1′⋯gk+m′x for some x∈U and gk+1′⋯gk+m′=gv1′,w1′(t1′). Thus
[TABLE]
By [MR04, Proposition 5.2], the elements h:=g1⋯gk+m and h′:=g1⋯gk⋅gk+1′⋯gk+m′ belong to U−v˙(k+m). Since h=h′x, we get x∈v˙(k+m)−1U−v˙(k+m). Moreover, since h,h′∈G⋄ and x∈U, we must have x∈U⋄. Thus by Lemma 5.3, we have
[TABLE]
Definition 5.5**.**
From now on we denote Rv,wsf:=Gv,wsfB⋄⊂G⋄. By Proposition 5.4, the set Rv,wsf does not depend on the choice of (v,w)∈Red(v,w). As we discuss in Section 5.4, Rv,wsf is the “subtraction-free” analog of Rv,w>0.
5.2. Collision moves
Assume K=F. By [FZ99, (2.13)], for each t∈Fsf∗ there exist t+∈Fsf∗, a+∈Tsf, and t−∈F⋄ satisfying
[TABLE]
[TABLE]
(Here, each of the four moves yields different t+,a+,t−.) By [FZ99, (2.11)], for each t,t′∈Fsf∗ there exist t+,t+′∈Fsf∗ and a+∈Tsf satisfying
As a direct consequence of (5.5), (5.6), and Lemma 5.2, for any v,w∈W we get
[TABLE]
Lemma 5.6**.**
(iv)
Let w∈W. Then
[TABLE]
2. (iv)
If v,w∈W are such that ℓ(vw)=ℓ(v)+ℓ(w), then
[TABLE]
3. (iv)
Let w1,…,wk∈W be such that ℓ(w1⋯wk)=ℓ(w1)+⋯+ℓ(wk). Then for any h∈Usf−(w1⋯wk) there exist b1∈Usf(w1−1),…,bk∈Usf(wk−1) such that for each 1≤i≤k, we have
[TABLE]
4. (iv)
Let v≤w∈W. Then
[TABLE]
Proof.
Let us prove the following claim: if vv1=w and ℓ(w)=ℓ(v)+ℓ(v1), then
[TABLE]
We prove this by induction on ℓ(v). If ℓ(v)=0 then v=id and (5.12) is trivial. Otherwise there exists an i∈I such that v′:=siv<v and thus w′:=siw<w. Let yi(t′)∈Usf−(w). Using (5.4), we see that for some t1∈Fsf∗, t+∈Fsf∗ and t−∈F⋄,
[TABLE]
By (5.7), xi(t+)⋅Usf−(w′)⊂Tsf⋅Usf−(w′)⋅Usf(si). Clearly siv′>v′, so y′:=v˙′−1yi(t−)v˙′∈U−. On the other hand, v˙y′v˙−1=s˙i−1yi(t−)s˙i=xi(−t−)∈U. Thus y′∈U−∩v˙−1Uv˙, and it is also clear that y′∈G⋄. We have shown that
[TABLE]
We have v′v1=w′, so by induction,
[TABLE]
Since Usf(v′−1)⋅Usf(si)=Usf(v−1), we have shown that
[TABLE]
By (4.6) applied to a=si, b=v′, ab=v, we get Inv(v′)⊂Inv(v), so (U−⋄∩v˙′−1Uv˙′)⊂(U−⋄∩v˙−1Uv˙), and we have finished the proof of (5.12).
Combining (5.12) with (4.8), we obtain (5.9).
Next, (5.10) can be shown by induction: the case k=0 is trivial. For k≥1, we can write h=h1⋯hk∈Usf−(w1)⋯Usf−(wk). By (5.9), we have
[TABLE]
for some b1′∈Usf(w1) that does not depend on i. Using (5.7), we write b1′⋅h2⋯hk=h2′⋯hk′⋅b1∈Usf−(w2)⋯Usf−(wk)⋅Usf(w1), and then proceed by induction.
Let us state several further corollaries of (5.12):
[TABLE]
Indeed, specializing (5.12) to v=w, we obtain (5.14). We obtain (5.15) from (5.14) by replacing w with z:=w−1 and then applying the involution x↦xι of (4.4), while (5.16) is obtained from (5.15) by applying the involution x↦xT of (4.3).
To show (5.8), observe that the inclusion B−⋄⋅w˙−1⋅Usf−(w)⊂B−⋄⋅Usf(w−1) follows from (5.14). To show the reverse inclusion, we use (5.16) to write
[TABLE]
Since w˙−1⋅(U⋄∩w˙U−w˙−1)⊂U−⋄w˙−1, we obtain B−⋄⋅w˙−1⋅Usf−(w)=B−⋄⋅Usf(w−1), which is the first part of (5.8). The second part follows by applying the involution x↦xι of (4.4).
It remains to show (5.11). We argue by induction on ℓ(w), and the base case ℓ(w)=0 is clear. Suppose that v≤w, and let w′:=siw<w for some i∈I. If v′:=siv<v then by the same argument as in the proof of (5.13), we get
[TABLE]
Since v′≤w′, we can apply the induction hypothesis to write v˙′−1⋅Usf−(w′)⊂B−⋄⋅Usf(v′−1). We thus obtain
[TABLE]
finishing the induction step in the case siv<v. But if siv>v then v˙−1yi(t1)v˙∈U−⋄, so in this case we have v˙−1Usf−(w)⊂U−⋄⋅v˙−1⋅Usf−(w′), and the result follows by applying the induction hypothesis to the pair v≤w′.
∎
5.3. Alternative parametrizations for the top cell
The following two lemmas are subtraction-free versions of [Rie06, Lemmas 4.2 and 4.3].
Lemma 5.7**.**
Let v∈W. Then we have
[TABLE]
Proof.
Recall from Definition 5.5 that Rv,wsf=Gv,wsf⋅B⋄. We have w=w0, so choose a reduced expression w0 for w0 that ends with v. With this choice, Gv,w0sf=Usf−(w0v−1)⋅v˙. Thus we can write
[TABLE]
Let z:=w0v−1. Using (5.8) and B−⋄⋅w˙0=w˙0⋅B⋄, we have
[TABLE]
Combining the above equations, we find Rv,w0sf=Usf(z−1)⋅w˙0⋅B⋄, and it remains to note that z−1=vw0−1=vw0.
∎
Lemma 5.8**.**
Let v≤w∈W. Then we have
[TABLE]
Proof.
It follows from the definition of Gv,wsf that if w′w is length-additive then Usf−(w′)Rv,wsf=Rv,w′wsf. Applying this to w′=w0w−1, we get Usf−(w0w−1)⋅Rv,wsf=Rv,w0sf. By Lemma 5.7, we have Rv,w0sf⋅B⋄=Usf(vw0)⋅w˙0⋅B⋄. Thus Usf(v−1)⋅Usf(vw0)⋅w˙0⋅B⋄=Usf(w0)⋅w˙0⋅B⋄, so applying Lemma 5.7 again, we find Usf(w0)⋅w˙0⋅B⋄=Rid,w0sf⋅B⋄. The result follows since Rid,w0sf=Usf−(w0)⋅B⋄.
∎
5.4. Evaluation
We explain the relationship between Rv,wsf and Rv,w>0.
Given t′∈R>0∣t∣, we denote by evalt′:Fsf→R>0 the evaluation homomorphism (of semifields) sending f(t) to f(t′). It extends to a well-defined group homomorphism evalt′:G⋄→G(R), and it follows from Theorem 4.15 that {evalt′(g)B∣g∈Rv,wsf}=Rv,w>0 as subsets of (G/B)R. It is clear that the following diagram is commutative.
[TABLE]
Here solid arrows denote regular maps, and dashed arrows denote maps defined on a subset F′⊂F given by F′:={R(t)/Q(t)∣R(t),Q(t)∈R[t],Q(t′)=0}. Since the diagram (5.18) is commutative, it follows that the images Δi∓(G⋄) and Δi±(G⋄) belong to F′.
Let t=(t′,t′′). Observe that any f(t′,t′′)∈Fsf∗ gives rise to a continuous function R>0∣t′∣×R>0∣t′′∣→R>0. Moreover, if sending t′′→0 in f(t′,t′′) gives rise to a well-defined subtraction-free rational expression, then f(t′,t′′) extends to a continuous function R>0∣t′∣×R≥0∣t′′∣→R≥0. Surprisingly, the converse is also true, as our next result shows.
Lemma 5.9**.**
Suppose that f(t′,t′′)∈Fsf∗ is such that the corresponding function R>0∣t′∣×R>0∣t′′∣→R>0 extends to a continuous function R>0∣t′∣×R≥0∣t′′∣→R≥0. Then limt′′→0f(t′,t′′) can be represented (as a function R>0∣t′∣→R≥0) by a subtraction-free rational expression in t′.
Proof.
By induction, it is enough to prove this when ∣t′′∣=1, where t′′=t′′ is a single variable. In this case, f(t′,t′′)=R(t′,t′′)/Q(t′,t′′) where R and Q have positive coefficients. Let us consider R and Q as polynomials in t′′ only. After dividing R and Q by (t′′)k for some k, we may assume that one of them is not divisible by t′′. Then Q cannot be divisible by t′′, since otherwise f would not give rise to a continuous function R>0∣t′∣×R≥0∣t′′∣→R≥0. We can write Q(t′,t′′)=Q1(t′,t′′)t′′+Q2(t′) and R(t′,t′′)=R1(t′,t′′)t′′+R2(t′), where R1,R2,Q1,Q2 are polynomials with nonnegative coefficients and Q2(t′)=0. Thus limt′′→0f(t′,t′′) can be represented by R2(t′)/Q2(t′), which is a subtraction-free rational expression in t′.
∎
Lemma 5.10**.**
(Assume K=C.) Suppose that a≤b≤c∈W. Then Δ∓(b˙−1x)=0 for some x∈G(R) such that xB∈Ra,c>0.
Proof.
Suppose that Δ∓(b˙−1x)=0 for all x∈G(R) such that xB∈Ra,c>0. Consider the map Δiflag:G/B→PWωi from (iv). We get that the bωi-th coordinate of Δiflag is identically zero on Ra,c>0. Therefore it must be zero on the Zariski closure of Ra,c>0 inside G/B, which is Ra,c. By (4.14), Ra,c contains b˙B=\accentset∘Rb,b, and thus Δi∓(b˙−1b˙) must be zero. We get a contradiction since by definition Δi∓(b˙−1b˙)=1.
∎
5.5. Applications to the flag variety
We use the machinery developed in the previous sections to obtain some natural statements about (G/B)≥0.
Lemma 5.11**.**
(Assume K=F.) Suppose that a≤c∈W and b∈W. Then for any x∈Ra,csf and i∈I,
[TABLE]
Moreover, if a≤b≤c then
[TABLE]
Proof.
Let t=(t1,t2,t3) with ∣t1∣=ℓ(a), ∣t2∣=ℓ(w0)−ℓ(c), ∣t3∣=ℓ(c)−ℓ(a). Choose reduced words i for a−1 and j for w0c−1, and let (a,c)∈Red(a,c). Suppose that x∈ga,c(t3)B⋄ and let
[TABLE]
By Lemma 5.8, g∈Usf−(w0)⋅B⋄=Usf−(b)⋅Usf−(b−1w0)⋅B⋄. By (5.8), we have b˙−1⋅Usf−(b)⊂B−⋄⋅Usf(b−1). Therefore
[TABLE]
By (5.7), we get b˙−1g∈B−⋄⋅Usf−(b−1w0)⋅Usf(b−1)⋅B⋄=B−⋄⋅B⋄, and by definition, Δi∓(y)∈Fsf∗ for any y∈B−⋄⋅B⋄. Since Δi∓ is a regular function on G by (iv), the function f(t1,t2,t3):=Δi∓(b˙−1g)∈Fsf∗ extends to a continuous function on R≥0∣t1∣×R≥0∣t2∣×R>0∣t3∣. Therefore by Lemma 5.9, limt1,t2→0f(t1,t2,t3) is a subtraction-free rational expression in t3. Since limt1,t2→0g=ga,c(t3), we get that Δi∓(b˙−1ga,c(t3))∈Fsf. Since x∈ga,c(t3)B⋄, (5.19) follows.
Suppose now that a≤b≤c. We would like to show (5.20), so assume that for some i∈I and x∈Ra,csf, we have Δi∓(b˙−1x)=0. Let t′∈(Fsf∗)∣t∣ and (a,c)∈Red(a,c) be such that x∈ga,c(t′)B⋄, and let y(t):=ga,c(t). Then we have Δi∓(b˙−1y(t))∈Fsf by (5.19). If Δi∓(b˙−1y(t)) were a nonzero rational function in t then clearly substituting t↦t′ for t′∈(Fsf∗)∣t∣ would also produce a nonzero rational function. Since substituting t↦t′ yields Δi∓(b˙−1x)=0, we must have Δi∓(b˙−1y(t))=0. Therefore Δi∓(b˙−1x′)=0 for all x′∈Ra,csf.
Now let t′∈R>0∣t∣. Recall from Section 5.4 that the image of Ra,csf in (G/B)R under the map evalt′ equals Ra,c>0. Thus by (5.18), Δi∓(b˙−1x′)=0 for all x′∈G(R) such that x′B∈Ra,c>0, which contradicts Lemma 5.10. Hence Δi∓(b˙−1x)∈Fsf∗, and therefore x∈b˙B−B follows from (iv), finishing the proof of (5.20).
∎
Corollary 5.12**.**
(Assume K=C.) Suppose that a≤c∈W and b∈W. Then for any (a,c)∈Red(a,c) and t′∈R>0Ja∘, we have
[TABLE]
Moreover, if a≤b≤c then
[TABLE]
Proof.
By (5.19), we know that Δi∓(b˙−1ga,c(t))∈Fsf for all i∈I. Evaluating at t=t′ (cf. Section 5.4), we find that Δi∓(b˙−1ga,c(t′))≥0 for all i∈I, showing (5.21). Similarly, (5.22) follows from (5.20).
∎
Proposition 5.13**.**
(Assume K=F.)
For all v,w,v′,w′∈W and x∈Usf(v′)⋅Tsf⋅Usf−(w′), we have Δi±(v˙xw˙−1)∈Fsf.
Proof.
Let t=(t1,t2,t1′,t2′) with ∣t1∣=ℓ(v′), ∣t2∣=ℓ(w′), ∣t1′∣=ℓ(w0)−ℓ(v′), and ∣t2′∣=ℓ(w0)−ℓ(w′). Let tv:=(t1′,t1) and tw:=(t2,t2′). Choose reduced words i,j for w0 such that i ends with a reduced word for v′ and j starts with a reduced word for w′. Set g=g(t1,t2,tv,tw):=xi(tv)⋅a⋅yj(tw) for some arbitrary element a∈Tsf. We get
[TABLE]
By (5.16), (5.7), and (5.8), we get v˙gw˙−1∈B⋄⋅Usf−(v)⋅Usf(w−1)⋅B−⋄. By (5.7), we can permute Usf−(v) and Usf(w−1), showing v˙gw˙−1∈B⋄⋅B−⋄. Thus Δi±(v˙gw˙−1)∈Fsf∗. It gives rise to a continuous function on R>0∣t1∣×R>0∣t2∣×R≥0∣t1′∣×R≥0∣t2′∣, so sending t1′,t2′→0 via Lemma 5.9 and varying t1, t2, and a, we get Δi±(v˙xw˙−1)∈Fsf for all x∈Usf(v′)⋅Tsf⋅Usf−(w′).
∎
6. Bruhat projections and total positivity
In this section, we prove a technical result (Theorem 6.4) which later will be used to finish the proof of Theorem 2.5. Assume K is algebraically closed and fix u∈WJ.
6.1. The map ζu,v(J)
Retain the notation from Definition 4.23. Given v∈W and u∈WJ, let us introduce a subset
[TABLE]
Note that if x∈Gu,v(J) then xP⊂Gu,v(J); see (iv) below.
Definition 6.1**.**
Define a map η:Gu,v(J)→LJ sending x∈Gu,v(J) to η(x):=[v˙−1κxx]J. Also define a map πu˙P−:u˙G0(J)→u˙P− sending x∈u˙G0(J) to the unique element πu˙P−(x)∈u˙P−∩xU(J). Explicitly (cf. (iv)), we put
[TABLE]
Finally, define ζu,v(J):Gu,v(J)→G by ζu,v(J)(x):=πu˙P−(x)⋅η(x)−1.
Lemma 6.2**.**
(iv)
The maps κ and πu˙P− are regular on u˙G0(J).
2. (iv)
The maps η and ζu,v(J) are regular on Gu,v(J)⊂u˙G0(J).
3. (iv)
If x∈u˙G0(J) and x′∈xP then κx′=κx.
4. (iv)
If x∈Gu,v(J) and x′∈xP then ζu,v(J)(x)=ζu,v(J)(x′).
Proof.
Parts (iv) and (iv) are clear since each map is a composition of regular maps. Part (iv) follows from Definition 4.23, since by construction the map κ starts by applying the isomorphism in (4.31), which gives a regular map Cu(J)→u˙U−(J)u˙−1. To prove (iv), suppose that x∈Gu,v(J) and x′∈xP is given by x′=xp for p∈P. Then πu˙P−(x′)=πu˙P−(x)[p]J by (iv). By (iv), κx′=κx, and η(x′)=[v˙−1κx′x′]J=[v˙−1κxx]J[p]J=η(x)[p]J. Thus
The ultimate goal of this section is to prove the following result.
Theorem 6.4**.**
(Assume K=C.) Let (u,u)⪯(v,w)⪯(v′,w′)∈QJ and x∈G be such that xB∈Rv′,w′>0. Then x∈Gu,v(J) and ζu,v(J)(x)∈BB−w˙.
6.2. Properties of κ
We further investigate the element κxx. Denote u~:=uwJ∈WmaxJ.
Lemma 6.5**.**
The groups U(J), U1(J), and U2(J) from Definition 4.23 satisfy
[TABLE]
Proof.
By (iv), we see that w˙JU−(J)w˙J−1=U−(J), which shows (6.3). For (6.4), U1(J)=u˙U−(J)u˙−1∩U by definition. By Lemma 4.5, we have u˙UJ−u˙−1⊂U−, so (6.4) follows from (4.5). For (6.5), observe that wJΦJ+=ΦJ−, so u~ΦJ+⊂Φ− by (4.6). We thus have u~˙U−u~˙−1=(u~˙UJ−u~˙−1)⋅(u~˙U−(J)u~˙−1) where (u~˙UJ−u~˙−1)⊂U, and hence u~˙U−u~˙−1∩U−=u~˙U−(J)u~˙−1∩U−=U2(J) by the definition of U2(J).
∎
Lemma 6.6**.**
For x∈u˙G0(J), there exists a unique element h∈U2(J) such that hx∈U1(J)u˙P, and we have h=κx.
Proof.
Let g(J)∈U(J) and p∈P be such that g(J)u˙=xp. We first show that such an h∈U2(J) exists. By Definition 4.23, κx is an element of U2(J) such that κxg(J)∈U1(J). In particular, κxx=κxg(J)u˙p−1∈U1(J)u˙P, which shows existence. To show uniqueness, observe that the action of u˙U−(J)u˙−1 on u˙G0(J)/P⊂G/P is free by (4.31), and in particular the action of U2(J) is also free.
∎
Lemma 6.7**.**
If x∈u˙G0(J)∩Bu˙r˙B for some r∈WJ, then κx=1.
Proof.
By Lemma 6.6, it suffices to show that Bu˙r˙B⊂U1(J)uP. Write
[TABLE]
By (4.34), Bu˙B⊂(u˙U−∩Uu˙)⋅B, and therefore we find
The subgroups u˙U(J)u˙−1, U1(J), and U2(J) are preserved under conjugation by a.
2. (iv)
If x∈u˙G0(J), then ax∈u˙G0(J) and κaxax=aκxx.
3. (iv)
(Assume K=C.) For each w∈W, there exists ρw∨∈Y(T) such that for all x∈w˙B−B, limt→0ρw∨(t)⋅xB=w˙B in G/B. If w∈WJ, then for all x∈w˙G0(J), limt→0ρw∨(t)⋅xP=w˙P in G/P.
Proof.
Since u˙∈NG(T), there exists b∈T such that au˙=u˙b. Thus au˙U(J)u˙−1a−1=u˙bU(J)b−1u˙−1=u˙U(J)u˙−1, which shows (iv), and (iv) is a simple consequence of (iv). To show (iv), assume K=C and choose ρ∨∈Y(T) such that ⟨ρ∨,αi⟩<0 for all i∈I. Then limt→0ρ∨(t)yρ∨(t)−1=1 for all y∈U−, and in particular for all y∈U−(J). Set ρw∨:=w−1ρ∨, so that for t∈C∗, ρw∨(t)=w˙ρ∨(t)w˙−1 by (4.2). Every x∈w˙B−B belongs to w˙yB for some y∈U−, so ρw∨(t)⋅x⋅B=w˙ρ∨(t)yρ∨(t)−1⋅B→w˙B as t→0. Similarly, if w∈WJ then every x∈w˙G0(J) belongs to w˙yP for some y∈U−(J) by (4.31), so ρw∨(t)⋅xP→w˙P as t→0.
∎
Lemma 6.9**.**
Suppose that v′′≤ur≤w′′ for some v′′,w′′∈W and r∈WJ, and let x∈G.
(iv)
(Assume K=F.) If x∈Rv′′,w′′sf, then x∈u˙G0(J).
2. (iv)
(Assume K=C.) If xB∈Rv′′,w′′>0, then x∈u˙G0(J) and κxxB∈Rv′′,urw>0 for some rw∈WJ such that rw≥r.
Proof.
When K=F, (5.20) implies Rv′′,w′′sf⊂u˙r˙B−B⊂u˙P−B, and by (iv), P−B=G0(J), which shows (iv). Similarly (for K=C), by Corollary 5.12, we have x∈u˙r˙B−B for any x∈Rv′′,w′′>0, so Rv′′,w′′>0⊂u˙G0(J).
Assume now that K=C and xB∈Rv′′,w′′>0. Let p∈P and g(J)∈u˙U−(J)u˙−1 be such that xp=g(J)u˙. Then κxxp=g1(J)u˙ for g1(J)∈U1(J). By (6.4), U1(J)u˙⊂Uu˙⊂Bu˙B. By (iv), we have p−1∈Br˙wB for some rw∈WJ. We get κxx=g1(J)u˙⋅p−1∈Bu˙B⋅Br˙wB⊂Bu˙r˙wB by (4.18). On the other hand, κx∈U− and x∈B−v′′B, so κxx∈B−v′′B. Therefore κxxB∈\accentset∘Rv′′,urw.
We now show rw≥r. By (5.22), x∈u˙r˙B−B, so by (iv), we have ρur∨(t)⋅xB→u˙r˙B as t→0 in G/B. Since u˙r˙∈u˙G0(J), κ is regular at u˙r˙B, and by Lemma 6.7, we have κu˙r˙=1. Thus κρur∨(t)xρur∨(t)xB→u˙r˙B as t→0. By (iv), κρur∨(t)xρur∨(t)xB=ρur∨(t)⋅κxxB, which belongs to \accentset∘Rv′′,urw for all t∈C∗. We see that the closure of \accentset∘Rv′′,urw contains u˙r˙B, and so v′′≤ur≤urw by (4.14). Thus r≤rw by (iv).
Finally, we show κxxB∈(G/B)≥0. First, clearly the map κ is defined over R, so κxxB∈(G/B)R. Consider the subset Rv′′,[u~,w0]>0:=⨆w′′≥u~Rv′′,w′′>0⊂(G/B)≥0. It contains Rv′′,w0>0 as an open dense subset, and therefore Rv′′,[u~,w0]>0 is connected. We have already shown that for any x′∈Rv′′,[u~,w0]>0, κx′x′B∈\accentset∘Rv′′,u~R (because we have rw≥r=wJ). Thus the image of the set Rv′′,[u~,w0]>0 under the map x′↦κx′x′ must lie inside a single connected component of \accentset∘Rv′′,u~R. However, if x′∈Rv′′,u~>0⊂Rv′′,[u~,w0]>0 then κx′=1 by Lemma 6.7, so in this case κx′x′∈Rv′′,u~>0. We conclude that the image of Rv′′,[u~,w0]>0 is contained inside Rv′′,u~>0⊂(G/B)≥0. It follows by continuity that for arbitrary v′′≤ur≤w′′ and x∈Rv′′,w′′>0, we have κxxB∈(G/B)≥0.
∎
(Assume K=C.) In the notation of (iv), we have κxxP∈Πvˉ′′,u>0 for vˉ′′:=v′′◃rw−1.
Proof.
(iv) says that κxxB∈Rv′′,urw>0, so applying Corollary 4.18, we find that πJ(κxxB)=κxxP∈Πvˉ′′,u>0.
∎
6.3. Proof via subtraction-free parametrizations
In this section, we fix some set t of variables and assume K=F. Also fix u∈WJ and recall that u~=uwJ∈WmaxJ.
By Definition 4.23, the map κ is defined on u˙G0(J). By (iv), we have Rv′′,w′′sf⊂u˙G0(J) whenever v′′≤ur≤w′′ for some r∈WJ. In particular, κ is defined on Usf−(w′′)⊂Rid,w′′sf for all w′′≥u~.
Proposition 6.11**.**
Let q∈W be such that ℓ(u~q)=ℓ(u~)+ℓ(q). Then for h∈Usf−(u~q), we have κhh∈Usf−(u~).
Proof.
Write h∈Usf−(u~q)=Usf−(u~)⋅Usf−(q). Using (5.8), we find
[TABLE]
By (5.7), B−⋄⋅Usf(u~−1)⋅Usf−(q)=B−⋄⋅Usf−(q)⋅Usf(u~−1)⊂B−⋄⋅Usf(u~−1). Writing B−⋄⊂U−⋅Tsf, we get
Let g∈u~˙U−u~˙−1 be such that h∈g⋅Tsf⋅Usf−(u~). Recall from (6.5) that U2(J)=u~˙U−u~˙−1∩U−. By (iv), there exists h′∈U2(J) such that h′g∈u~˙U−u~˙−1∩U. Thus
[TABLE]
But observe that both h and h′ belong to U−. Since the factorization of h′h as an element of U⋅T⋅U− is unique by (iv), it follows that h′h∈Usf−(u~). By (4.20), Usf−(u~)⊂Bu~˙B. By Lemma 6.7, κh′h=1, so κh=h′, and thus κhh∈Usf−(u~).
∎
Corollary 6.12**.**
For q∈W such that ℓ(u~q)=ℓ(u~)+ℓ(q) and v≤u~, we have Rid,u~qsf⊂Gu,v(J).
Proof.
As we have already mentioned, (iv) shows that Rid,u~qsf⊂u˙G0(J). Let x∈Rid,u~qsf=Usf−(u~q)⋅B⋄, and let b∈B⋄ and h∈Usf−(u~q) be such that x=hb. By (iv), we have κx=κh. By Proposition 6.11, κhh∈Usf−(u~), and therefore κxx∈Usf−(u~)⋅B⋄=Rid,u~sf. By (5.20), we get κxx∈v˙B−B.
∎
Corollary 6.12 shows that the map ζu,v(J) is defined on the whole Rid,u~qsf.
Lemma 6.13**.**
Suppose that u0∈WJ and v0≤u~0:=u0wJ. Let h∈Usf−(u~0), and let bu,bv∈U be such that u~˙0−1h∈B−⋅bu and v˙0−1h∈B−⋅bv. Then [bubv−1]J∈Usf(r) for some r∈WJ.
Proof.
First, recall from (iv) and (5.11) that bu and bv are uniquely defined and satisfy bu∈Usf(u~0−1), bv∈Usf(v0−1). Let h=h1h2 for h1∈Usf−(u0) and h2∈Usf−(wJ). Our first goal is to show that [bu]J∈UJ satisfies (and is uniquely defined by) w˙J−1h2∈B−⋅[bu]J. Letting bu′∈UJ be uniquely defined by w˙J−1h2∈B−⋅bu′, we thus need to show that [bu]J=bu′.
Since d∈U, we can use (iv) to factorize it as d=[d]J[d]+(J). Since h2∈UJ−⊂LJ, (iv) shows that there exists d′∈U(J) such that [d]+(J)h2=h2d′. Since [d]J∈UJ by (iv), (4.21) shows that w˙J−1[d]J∈U−w˙J−1. Combining the pieces together, we get
[TABLE]
On the other hand, u~˙0−1h∈B−⋅bu, so bu=bu′d′, where bu′∈UJ and d′∈U(J). It follows that [bu]J=bu′, and thus we have shown that w˙J−1h2∈B−⋅[bu]J.
We now prove the result by induction on ℓ(u0). When ℓ(u0)=0, we have u~0=wJ and v0∈WJ. Thus there exists v1∈WJ such that wJ=v0⋅v1 with ℓ(wJ)=ℓ(v0)+ℓ(v1). We have bu,bv∈UJ, so [bubv−1]J=bubv−1 by (iv). By (5.10), there exist b0∈Usf(v0−1) and b1∈Usf(v1−1) such that
[TABLE]
In particular, we have bv=b0 and bu=b1b0. Thus [bubv−1]J=b1∈Usf(v1−1), and we are done with the base case.
Assume ℓ(u0)>0, and let i∈I be such that u1:=siu0<u0. By (iv), u1∈WJ, so define u~1:=u1wJ∈WmaxJ. Let h∈Usf−(u~0) be factorized as h=hih1′h2 for hi=yi(t)∈Usf−(si), h1′∈Usf−(u1), and h2∈Usf−(wJ).
Suppose that siv0>v0, in which case we have v0≤u~1. Let h′:=h1′h2 and bu′∈U be defined by u~˙1−1h′∈B−⋅bu′. Since siv0>v0, we see that v˙0−1hi∈B−⋅v˙0−1, so v˙0−1h′∈B−⋅v˙0−1h=B−⋅bv. By the induction hypothesis applied to v0≤u~1 and h′∈Usf−(u~1), we have [bu′bv−1]J∈Usf(r) for some r∈WJ. On the other hand, we have shown above that [bu]J satisfies w˙J−1h2∈B−⋅[bu]J. But since h′=h1′h2 for h2∈Usf−(wJ), we get that [bu′]J satisfies w˙J−1h2∈B−⋅[bu′]J, and thus [bu]J=[bu′]J. Therefore using (iv), we get
[TABLE]
finishing the induction step in the case siv0>v0.
Suppose now that v1:=siv0<v0. Let h=hih1′h2∈Usf−(u~0) be as above. By (5.8), s˙i−1hi∈B−⋄⋅Usf(si), so let di∈Usf(si) be such that s˙i−1hi∈B−⋄⋅di. By (5.7), Usf(si)⋅Usf−(u~1)=Usf−(u~1)⋅Usf(si), so let bi∈Usf(si) and h′∈Usf−(u~1) be such that dih1′h2=h′bi. We check using (5.9) that
[TABLE]
Let bu′,bv′∈U be defined by u~˙1−1h′∈B−⋅bu′ and v˙1−1h′∈B−⋅bv′. Then by the induction hypothesis applied to v1≤u~1 and h′∈Usf−(u~1), we find [bu′bv′−1]J∈Usf(r) for some r∈WJ. But it is clear from (6.6) that bu=bu′bi and bv=bv′bi. Therefore [bubv−1]J∈Usf(r).
∎
Theorem 6.14**.**
For all v≤u~, w∈WJ, i∈I, and x∈Rid,w0sf, we have
[TABLE]
Proof.
Let q∈W be such that w0=u~q, so ℓ(u~q)=ℓ(u~)+ℓ(q). Let x∈Rid,w0sf=Usf−(w0)⋅B⋄ be written as x=h⋅b, where h=h1h2h3∈Usf−(w0) for h1∈Usf−(u), h2∈Usf−(wJ), h3∈Usf−(q), and b∈B⋄. By (5.10), there exist b1∈Usf(u−1), b2∈Usf(wJ), and b3∈Usf(q−1) such that
[TABLE]
Let x′:=hb1−1. We have x′=xb−1b1−1∈xB⊂xP, and therefore x′∈Gu,v(J) and ζu,v(J)(x′)=ζu,v(J)(x) by (iv). On the other hand, by (6.8), x′∈u˙B−⋄⊂u˙P−, so (iv) implies ζu,v(J)(x′)=x′η(x′)−1.
Let us now compute η(x′)=[v˙−1κx′x′]J. By (iv), κx=κx′=κh, and by Proposition 6.11, κhh∈Usf−(u~). Thus by (5.11), v˙−1κhh∈B−⋄⋅Usf(v−1), so let d0∈B−⋄ and b0∈Usf(v−1) be such that v˙−1κhh=d0b0. By definition, κh∈U2(J), so by (6.5), u~˙−1κhu~˙∈U−, and therefore using (6.8) we find
[TABLE]
We can now apply Lemma 6.13: we have v≤u~, κhh∈Usf−(u~), u~˙−1κhh∈B−⋅b2b1, and v˙−1κhh∈B−⋅b0. Let bu:=b2b1∈U and bv:=b0∈U. By Lemma 6.13, [bubv−1]J=[b2b1b0−1]J∈Usf(r) for some r∈WJ.
Recall that v˙−1κhh=d0b0 for d0∈B−⋄ and b0∈Usf(v−1). Thus
[TABLE]
By (iv), we get [d0b0b1−1]J=[d0]J[b0b1−1]J. Thus
[TABLE]
By (6.8), we have w˙0−1x′∈B−⋄⋅b3b2, so x′∈B⋄w˙0b3b2. Using (iv), we thus get
[TABLE]
We are interested in the element ζu,v(J)(x)w˙−1. We know that d0∈B−⋄, so [d0]J∈TsfUJ−, and by Lemma 4.5, w˙[d0]Jw˙−1∈Tsf⋅U−. Hence
[TABLE]
In particular, Δi±(ζu,v(J)(x)w˙−1)∈Fsf if and only if Δi±(w˙0b3[b2b1b0−1]Jw˙−1)∈Fsf. Recall that b3∈Usf(q−1) and [b2b1b0−1]J∈Usf(r) for some r∈WJ. Thus b3[b2b1b0−1]J∈Usf(q−1r), so we are done by Proposition 5.13.
∎
Our strategy will be very similar to the one we used in the proof of Corollary 5.12.
Fix (u,u)⪯(v,w)⪯(v′,w′)∈QJ. Let t=(t1,t2,t3) with ∣t1∣=ℓ(v′), ∣t2∣=ℓ(w0)−ℓ(w′), and ∣t3∣:=ℓ(w′)−ℓ(v′), and assume K=F. Choose reduced words i for v′−1 and j for w0w′−1, and let (v′,w′)∈Red(v′,w′). Suppose that x∈gv′,w′(t3)⋅B⋄. Then
[TABLE]
By Lemma 5.8, we have g(t1,t2,t3)∈Rid,w0sf. Thus by Theorem 6.14, for all i∈I we have Δi±(ζu,v(J)(g(t1,t2,t3))w˙−1)∈Fsf. Denote by f(t1,t2,t3):=Δi±(ζu,v(J)(g(t1,t2,t3))w˙−1) the corresponding subtraction-free rational expression, which yields a continuous function R>0∣t1∣×R>0∣t2∣×R>0∣t3∣→R≥0. We claim that f extends to a continuous function R≥0∣t1∣×R≥0∣t2∣×R>0∣t3∣→R≥0. Indeed, fix some (t1′,t2′,t3′)∈R≥0∣t1∣×R≥0∣t2∣×R>0∣t3∣ and let K=C. The element x′:=g(t1′,t2′,t3′) (obtained by evaluating at (t1′,t2′,t3′); see Section 5.4) belongs to G≥0⋅Rv′,w′>0, and by Lemma 4.17 there exist v′′,w′′∈W such that v′′≤v′≤w′≤w′′ and x′∈Rv′′,w′′>0. Recall from (iv) that we have
[TABLE]
for some r′,r∈WJ such that ℓ(vr′)=ℓ(v)+ℓ(r′). In particular, by (iv), x′∈u˙G0(J) and κx′x′∈Rv′′,urw>0 for some rw∈WJ such that rw≥r. By Corollary 5.12, κx′x′∈v˙r˙′B−B⊂v˙G0(J), which shows that x′∈Gu,v(J). The map ζu,v(J) is therefore regular at x′ by (iv). The map Δi± is regular on G by (iv), so in particular it is regular at ζu,v(J)(x′)w˙−1. We have shown that the map x′′↦Δi±(ζu,v(J)(x′′)w˙−1) is regular at x′=g(t1′,t2′,t3′) for all (t1′,t2′,t3′)∈R≥0∣t1∣×R≥0∣t2∣×R>0∣t3∣. Thus the map f(t1,t2,t3) extends to a continuous function R≥0∣t1∣×R≥0∣t2∣×R>0∣t3∣→R≥0. By Lemma 5.9, we find that f(0,0,t3):=limt1,t2→0f(t1,t2,t3) belongs to Fsf, i.e., it can be represented by a subtraction-free rational expression in the variables t3. On the other hand, it is clear that f(0,0,t3)=Δi±(ζu,v(J)(gv′,w′(t3))w˙−1).
Our next goal is to show that f(0,0,t3)∈Fsf∗. Indeed, suppose otherwise that f(0,0,t3)=0 (as an element of F). By (iv), ζu,v(J) descends to a regular map Gu,v(J)/P→G (still assuming K=C). Therefore the map fˉ:Gu,v(J)/P→C sending x′P to Δi±(ζu,v(J)(x′)w˙−1) is also regular. If f(0,0,t3)=0 then fˉ vanishes on πJ(Rv′,w′>0)=Πv′,w′>0, and therefore it vanishes on its Zariski closure, which is Πv′,w′. We have πJ(Rv,w>0)=Πv,w>0⊂Πv′,w′, so fˉ(x)=0 for any x∈Gu,v(J) such that xB∈Rv,w>0. Let us show that this leads to a contradiction.
Let x∈G be such that xB∈Rv,w>0. By (4.27), there exists x′∈xP such that x′B∈Rvr′,wr′>0. By (iv), we have x′∈u˙G0(J), and thus x∈u˙G0(J). Having xB∈Rv,w>0 implies x∈B−v˙B∩Bw˙B. Since κx∈U2(J)⊂U−, we have κxx∈B−v˙B. By (4.34), B−v˙B=(v˙U−∩U−v˙)B⊂v˙B−B, so κxx∈v˙B−B, and therefore x∈Gu,v(J). Moreover, v˙−1κxx∈B−B, and thus η(x)=[v˙−1κxx]J∈UJ−TUJ. On the other hand, πu˙P−(x)∈xU(J)⊂xB⊂Bw˙B; see Definition 6.1. Thus
[TABLE]
Recall that because w∈WJ, we have UJ−w˙−1⊂w˙−1U− by Lemma 4.5. Hence
[TABLE]
By (4.34) (after taking inverses of both sides), Bw˙B=B⋅(U−w˙∩w˙U), so
[TABLE]
In particular, Δi±(ζu,v(J)(x)w˙−1)=0 for all i∈I. This gives a contradiction, showing f(0,0,t3)∈Fsf∗. But then evaluating f at any t3′∈R>0ℓ(w′)−ℓ(v′) yields a positive real number. We have shown that Δi±(ζu,v(J)(x)w˙−1)=0 for all x∈G such that xB∈Rv′,w′>0. We are done by (iv).
∎
7. Affine Bruhat atlas for the projected Richardson stratification
In this section, we embed the stratification (4.23) of G/P inside the affine Richardson stratification of the affine flag variety. Throughout, we work over K=C.
7.1. Loop groups and affine flag varieties
Recall that G is a simple and simply connected algebraic group.
Let A:=C[z,z−1] and A+,A−⊂A denote the subrings given by A+:=C[z], A−:=C[z−1]. Then we have ring homomorphisms evˉ0:A+→C (respectively, evˉ∞:A−→C), sending a polynomial in z (respectively, in z−1) to its constant term. Let G:=G(A) denote the polynomial loop group of G.
Remark 7.1**.**
The group G is closely related to the (minimal) affine Kac–Moody groupGmin associated to G, introduced by Kac and Peterson [KP83, PK83]. Below we state many standard results about G without proof. We refer the reader unfamiliar with Kac–Moody groups to Appendix A, where we give some background and explain how to derive these statements from Kumar’s book [Kum02].
their unipotent radicals. There exists a tautological embedding G↪G, and we treat G as a subset of G.
We let T:=C∗×T⊂C∗⋉G be the affine torus, where C∗ acts on G via loop rotation; see Section 8.2. The affine root systemΔ of G is the subset of X(T):=Hom(T,C∗)≅X(T)⊕Zδ given by
[TABLE]
are the real and imaginary roots, and the set of positive rootsΔ+⊂Δ has the form
[TABLE]
We let Δre+:=Δ+∩Δre and Δre−:=Δ−∩Δre. For each α∈Δre+ (respectively, α∈Δre−), we have a one-parameter subgroup Uα⊂U (respectively, Uα⊂U−). The group U (respectively, U−) is generated by {Uα}α∈Δre+ (respectively, {Uα}α∈Δre−), and for each α∈Δre, we fix a group isomorphism xα:C∼Uα.
Let QΦ∨:=⨁i∈IZαi∨ denote the coroot lattice of Φ.
The affine Weyl groupW~=W⋉QΦ∨ is a semidirect product of W and QΦ∨, i.e., as a set we have W~=W×QΦ∨, and the product rule is given by (w1,λ1)⋅(w2,λ2):=(w1w2,λ1+w1λ2).
For λ∈QΦ∨, we denote the element (id,λ)∈W~ by τλ. The group W~ is isomorphic to NC∗⋉G(T)/T, and for f∈W~, we choose a representative f˙∈G of f in NC∗⋉G(T), with the assumption that for w∈W, the representative w˙∈G⊂G is given by (4.1). Thus W~ is a Coxeter group with generators s0⊔{si}i∈I, length function ℓ:W~→Z≥0, and affine Bruhat order≤.
The group W~ acts on Δ, and for α∈Φ, β∈Δre, λ∈QΦ∨, and w∈W, we have
[TABLE]
Let G/B denote the affine flag variety of G. This is an ind-variety that is isomorphic to the flag variety of the corresponding affine Kac–Moody group Gmin; see Section A.4. For each h,f∈W~ we have Schubert cells \accentset∘Xf:=Bf˙B/B and opposite Schubert cells \accentset∘Xh:=B−h˙B/B.
If h≤f∈W~ then \accentset∘Xh∩\accentset∘Xf=∅. For h≤f, we denote \accentset∘Rhf:=\accentset∘Xh∩\accentset∘Xf. For all g∈W~, we have
[TABLE]
For g∈W~, let
[TABLE]
As we explain in Section A.5, the map x↦xg˙B gives biregular isomorphisms
[TABLE]
Let U(I)⊂U be the subgroup generated by {Uα}α∈Δre+∖Φ+. Similarly, let U−(I)⊂U− be the subgroup generated by {Uα}α∈Δre−∖Φ−. For x∈G⊂G, we have
[TABLE]
7.2. Combinatorial Bruhat atlas for G/P
We fix an element λ∈QΦ∨ such that ⟨λ,αi⟩=0 for i∈J and ⟨λ,αi⟩∈Z<0 for i∈I∖J. Thus λ is anti-dominant and the stabilizer of λ in W is equal to WJ. Following [HL15], define a map
[TABLE]
By [HL15, Theorem 2.2], the map ψ gives an order-reversing bijection between QJ and a subposet of W~. More precisely, let τλJ:=τλ(wJ)−1, and recall from (7.2) that uτλu−1=τuλ. By [HL15, Section 2.3], for all (v,w)∈QJ we have
[TABLE]
see Figure 2 for an example. By [HL15, Theorem 2.2], for all u∈WJ we have
[TABLE]
Remark 7.2**.**
The construction of [HL15] can be applied in the more general setting where λ is an anti-dominant coweight, and thus ψ sends QJ to the extended affine Weyl group. This is especially natural when λ is a minuscule coweight, and thus G/P is a cominuscule Grassmannian. In this case, the image of ψ is a lower order ideal in affine Bruhat order. The map φˉu below then sends Cu(J) to the Schubert cell \accentset∘Xτuλ as opposed to the more complicated intersection XτλJ∩\accentset∘Xτuλ.
7.3. Bruhat atlas for the projected Richardson stratification of G/P
Let u∈WJ. Recall that λ∈QΦ∨ has been fixed. We further assume that the representatives τ˙λ and τ˙uλ satisfy the identity u˙τ˙λu˙−1=τ˙uλ.
Our goal is to construct a geometric lifting of the map ψ. Recall the maps x↦g1(J) and x↦g2(J) from Definition 4.23. We define maps
[TABLE]
The main result of this section is the following theorem.
Theorem 7.3**.**
(4)
The map φˉu is a biregular isomorphism
[TABLE]
and for all (v,w)⪰(u,u)∈QJ, φˉu restricts to a biregular isomorphism
¯φ**_u: C^(J)_u∩∘Π**_v,w∼→∘R_vτ_λw^-1^τ_uλ.**
2. (4)
Suppose that (u,u)⪯(v,w)⪯(v′,w′)∈QJ. Then
[TABLE]
The remainder of this section will be devoted to the proof of Theorem 7.3.
7.4. An alternative definition of φˉu
Recall the notation from Definition 4.23, and that we have fixed u∈WJ and λ∈QΦ∨ satisfying ⟨λ,αi⟩=0 for i∈J and ⟨λ,αi⟩∈Z<0 for i∈I∖J. We list the rules for conjugating elements of G⊂G by τ˙λ.
Lemma 7.4**.**
We have
[TABLE]
Proof.
Recall that LJ is generated by T, UJ, and UJ−, and since τλα=α for all α∈ΦJ, we see that (7.13) follows from (7.2). By (7.2), we find τλα∈Δre+∖Φ+ for α∈Φ−(J) and τλα∈Δre−∖Φ− for α∈Φ+(J), which shows (7.14). Similarly, τλ−1α∈Δre+∖Φ+ for α∈Φ+(J) and τλ−1α∈Δre−∖Φ− for α∈Φ−(J), which shows (7.15).
To show (7.16), we use (7.6), (7.14), (7.15), and U1(J),U2(J)⊂u˙U−(J)u˙−1 to get
[TABLE]
The map φˉu can alternatively be characterized as follows. Recall from Definition 4.23 that we have a regular map κ:u˙G0(J)→U2(J) that descends to a regular map κ:Cu(J)→U2(J) by (iv). Recall also from (iv) that u˙G0(J)=u˙P−⋅B.
Lemma 7.5**.**
Let x∈u˙P−. Then
[TABLE]
Proof.
We continue using the notation of Definition 4.23. Let p∈LJ and g(J)∈u˙U−(J)u˙−1 be such that xp=g(J)u˙. Note that g2(J)u˙=h1(J)g(J)u˙=h1(J)xp, and since h1(J)∈U1(J)⊂U⊂B, we see that (g2(J)u˙)−1⋅B=(xp)−1⋅B. On the other hand, κxxp=h2(J)g(J)u˙=g1(J)u˙. Since p commutes with τ˙λ by (7.13), we find
[TABLE]
7.5. The affine Richardson cell of φˉu
Lemma 7.6**.**
We have
[TABLE]
Proof.
The torus T acts on G/P by left multiplication and preserves the sets Cu(J) and \accentset∘Πv,w for all (v,w)∈QJ. By (4.23), Πv,w contains u˙P if and only if (u,u)⪯(v,w). Suppose that xP∈Cu(J)∩\accentset∘Πv,w for some (v,w)∈QJ. Then TxP/P⊂Cu(J), and by (iv), the closure of this set contains u˙P. On the other hand, the closure of this set is contained inside Πv,w, and thus (u,u)⪯(v,w).
∎
Lemma 7.7**.**
Let (v,w)∈QJ⪰(u,u). Then
[TABLE]
Proof.
Let x∈u˙G0(J) be such that xP∈\accentset∘Πv,w. Let us first show that φˉu(xP)∈\accentset∘Xτuλ. By (7.12), we have
[TABLE]
Observe that g1(J)∈U1(J)⊂U, and by (7.16), τ˙uλ⋅(g2(J))−1⋅τ˙uλ−1∈U(I). We get
[TABLE]
This proves that φˉu(xP)∈\accentset∘Xτuλ.
We now show φˉu(xP)∈\accentset∘Xvτλw−1. Recall that \accentset∘Πv,w=πJ(\accentset∘Rv,w), so assume that x∈B−v˙B∩Bw˙B. Since u˙G0(J)=u˙P−B by (iv), we may assume that x∈u˙P−, in which case φˉu(xP) is given by (7.17). We have κxx∈B−v˙B and x−1∈Bw˙−1B, so it suffices to show
[TABLE]
Clearly we have
[TABLE]
By (7.13) and (iv), UJ can be moved to the right past τ˙λ and U(J). We can then move U(J) to the left past τ˙λ using (7.14), which gives
[TABLE]
By (7.6), U−(I) can be moved to the left past v˙⋅U(J), and then U(J) can be moved to the right past τ˙λ using (7.15), yielding
[TABLE]
By (7.6), U(I) can be moved to the right past UJ⋅w˙−1. Since w∈WJ, Lemma 4.5 implies that UJ⋅w˙−1⊂w˙−1U, so (7.22) follows.
∎
Observe that XτλJ∩\accentset∘Xτuλ=⨆(v,w)∈QJ⪰(u,u)\accentset∘Rvτλw−1τuλ by (7.3) and (7.9). By (7.19), φˉu(Cu(J))⊂XτλJ∩\accentset∘Xτuλ. Let us identify \accentset∘Xτuλ with the affine variety U1(τuλ) via (7.5), and denote by φˉu†:Cu(J)→U1(τuλ) the composition of (7.5) and φˉu.
We claim that φˉu† gives a biregular isomorphism between Cu(J) and a closed subvariety of U1(τuλ). Let x∈u˙G0(J) and let g(J), g1(J), g2(J) be as in Definition 4.23. Let y:=φu(xP)⋅τ˙uλ−1, so φˉu(xP)=y⋅τ˙uλ⋅B. Thus φˉu†(xP)=y if and only if y∈U1(τuλ). By (7.21), we have y∈U. Hence in order to prove y∈U1(τuλ), we need to show y∈τ˙uλU−τ˙uλ−1. Conjugating both sides by τ˙uλ, we get
[TABLE]
which belongs to U− since (g2(J))−1∈U2(J)⊂U− by definition and τ˙uλ−1g1(J)τ˙uλ∈U−(I) by (7.16). Thus y∈U1(τuλ) and φˉu†(xP)=y. By Lemma 4.2, we may identify Cu(J) with U1(J)×U2(J), so let φˉu‡:U1(J)×U2(J)→U1(τuλ) be the map sending (g1(J),g2(J)) to y:=g1(J)⋅τ˙uλ(g2(J))−1τ˙uλ−1.
Let Θ1:=uΦ−(J)∩Φ+ and Θ2:=uΦ−(J)∩Φ−, so U1(J)=U(Θ1), U2(J)=U−(Θ2), and Θ1⊔Θ2=uΦ−(J). By the proof of (7.16), τuλΘ2⊂Δre+∖Φ+ and τuλ−1Θ1⊂Δre−, and thus Θ1⊔τuλΘ2⊂Inv(τuλ−1). Let Θ3⊂Δre+ be defined by Θ3:=Inv(τuλ−1)∖(Θ1⊔τuλΘ2). By Lemma A.1, the multiplication map gives a biregular isomorphism
[TABLE]
where U(Θ) denotes the subgroup generated by {Uα}α∈Θ. In particular, U(Θ1)⋅U(τuλΘ2) is a closed subvariety of U1(τuλ) isomorphic to C∣Θ1∣+∣Θ2∣=Cℓ(wJ). Observe that U(τuλΘ2)=τ˙uλU2(J)τ˙uλ−1, and hence φˉu‡ essentially coincides with the restriction of the map (7.23) to U(Θ1)×U(τuλΘ2)×{1}. We have thus shown that φˉu‡ gives a biregular isomorphism between U1(J)×U2(J) and a closed ℓ(wJ)-dimensional subvariety of U1(τuλ). Therefore φˉu gives a biregular isomorphism between Cu(J) and a closed ℓ(wJ)-dimensional subvariety φˉu(Cu(J)) of \accentset∘Xτuλ. By Proposition A.2, XτλJ∩\accentset∘Xτuλ is a closed irreducible subvariety of \accentset∘Xτuλ, and by (7.8) and Proposition A.2, it has dimension ℓ(wJ). Since φˉu(Cu(J))⊂XτλJ∩\accentset∘Xτuλ, it follows that φˉu(Cu(J))=XτλJ∩\accentset∘Xτuλ. We are done with the proof of (4).
Remark 7.8**.**
Alternatively, the proof of (4) could be deduced from Deodhar-type parametrizations [Had84, Had85, BD94] of \accentset∘Rvτλw−1τuλ, by observing that any reduced word for τuλ that is compatible with the length-additive factorization τuλ=u⋅τλJ⋅wJu−1 in (7.8) contains a unique reduced subword for τλJ.
We use the notation and results from Section 6. Let x∈G be such that xP∈Πv′,w′>0. Since Πv′,w′>0=πJ(Rv′,w′>0), we may assume that xB∈Rv′,w′>0. Then x∈u˙G0(J) by (iv), so φˉu(xP) is defined. In addition, by (iv) we may assume that x∈u˙P−. By definition, φˉu(xP)∈Cvτλw−1 if and only if w˙τ˙λ−1v˙−1φˉu(xP)∈B−B/B. By (7.17), this is equivalent to
[TABLE]
By Theorem 6.4, x∈Gu,v(J), so v˙−1κxx∈G0(J). Let us factorize y:=v˙−1κxx as y=[y]−(J)[y]J[y]+(J) using (iv). By (7.13) and (7.15), we get
[TABLE]
Using (7.6), we can move U−(I) to the left and U(I) to the right, so we see that (7.24) is equivalent to w˙[y]Jx−1∈B−B. By Definition 6.1, we have [y]J=η(x), and by (iv), we have ζu,v(J)(x)=xη(x)−1=x[y]J−1. By Theorem 6.4, ζu,v(J)(x)∈BB−w˙, and after taking inverses, we obtain w˙[y]Jx−1∈B−B⊂B−B, finishing the proof. ∎
We first define the affine flag variety version of the map νˉg from (2.1). We will need some results on the Gaussian decomposition inside G; see Section A.5 for a proof.
Lemma 8.1**.**
Let G0:=B−⋅B.
(iv)
The multiplication map gives a biregular isomorphism of ind-varieties
[TABLE]
For x∈G0, we denote by [x]−∈U−, [x]0∈T, and [x]+∈U the unique elements such that x=[x]−[x]0[x]+.
2. (iv)
For g∈W~, the multiplication map gives biregular isomorphisms of ind-varieties
[TABLE]
The group g˙U−g˙−1, as well as its subgroups U1(g) and U2(g), act on Cg. The following result, which we state for the polynomial loop group G, holds in Kac–Moody generality.
Proposition 8.2**.**
Let g∈W~.
(iv)
For x∈G such that xB∈Cg, there exist unique elements y1∈U1(g) and y2∈U2(g) such that y1xB∈\accentset∘Xg and y2xB∈\accentset∘Xg.
2. (iv)
The map ν~g:Cg∼\accentset∘Xg×\accentset∘Xg sending xB to (y1xB,y2xB) is a biregular isomorphism of ind-varieties.
3. (iv)
For all h,f∈W~ satisfying h≤g≤f, the map ν~g restricts to a biregular isomorphism Cg∩\accentset∘Rhf∼\accentset∘Rgf×\accentset∘Rhg of finite-dimensional varieties.
Proof.
Let us first prove an affine analog of Lemma 4.2. Let ν1:g˙U−g˙−1→U2(g), ν2:g˙U−g˙−1→U1(g) denote the second component of μ12−1 and μ21−1 (cf. (8.2)), respectively, and let ν:=(ν1,ν2):g˙U−g˙−1→U2(g)×U1(g). We claim that ν is a biregular isomorphism. By (iv), ν is a regular morphism. Let us now compute the inverse of ν. Given x1∈U1(g) and x2∈U2(g), we claim that there exist unique y1∈U1(g) and y2∈U2(g) such that y1x2=y2x1. Indeed, this equation is equivalent to y2−1y1=x1x2−1, so we must have y2=[x1x2−1]−−1 and y1=[x1x2−1]+. Clearly, ν−1(x2,x1)=y1x2=y2x1, and by (iv), the map ν−1 is regular. Applying (7.5) finishes the proof of (iv) and (iv).
We now prove (iv). Observe that if xB∈Cg∩\accentset∘Rhf for some h≤f∈W~ then x∈B−h˙B∩Bf˙B. Let y1,y2 be as in (iv). Then y1∈U1(g)⊂U, so y1x∈Bf˙B. Similarly, y2∈U2(g)⊂U−, so y2x∈B−h˙B. It follows that if xB∈Cg∩\accentset∘Rhf then ν~g(xB)∈\accentset∘Rhg×\accentset∘Rgf. In particular, we must have h≤g≤f, and we are done by (7.3).
∎
8.2. Torus action
Recall that T=C∗×T is the affine torus. The group C∗ acts on G via loop rotation as follows. For t∈C∗, we have t⋅g(z)=g(tz). We form the semidirect product C∗⋉G with multiplication given by (t1,x1(z))⋅(t2,x2(z)):=(t1t2,x1(z)x2(t1z)) for (t1,x1(z)),(t2,x2(z))∈C∗×G. Let Y(T):=Hom(C∗,T)≅Zd⊕Y(T). For λ∈Y(T), t∈C∗, t′∈C, and α∈Δre, we have
[TABLE]
where xα:C∼Uα is as in Section 7.1, and ⟨⋅,⋅⟩:Y(T)×X(T)→Z extends the pairing from Section 4.1 in such a way that ⟨d,δ⟩=1 and ⟨d,αi⟩=⟨αi∨,δ⟩=0 for i∈I.
Let g∈W~ and define N:=ℓ(g). If Inv(g)={α(1),…,α(N)}, then by Lemma A.1, the map xg:CN→U1(g) given by
[TABLE]
is a biregular isomorphism. For t=(t1,…,tN)∈CN, define ∥t∥:=(∣t1∣2+⋯+∣tN∣2)21∈R≥0, and
let ∥⋅∥:U1(g)→R≥0 be defined by ∥y∥:=∥xg−1(y)∥. Identifying U1(g) with \accentset∘Xg via (7.5), we get a function ∥⋅∥:\accentset∘Xg→R≥0.
We say that ρ~∈Y(T) is a regular dominant integral coweight if ⟨ρ~,δ⟩∈Z>0 and ⟨ρ~,αi⟩∈Z>0 for all i∈I. In this case, we have ⟨ρ~,α⟩∈Z>0 for any α∈Δre+. Let us choose such a coweight ρ~, and define ϑg:R>0×G/B→G/B by ϑg(t,xB):=ρ~(t)xB.
It follows from (8.3) that if g∈W~ and y∈U1(g) is such that xg−1(y)=(t1,…,tN) then there exist k1,…,kN∈Z>0 satisfying
By Corollary 4.20, ((G/P)R,(G/P)≥0,QJ) is a shellable TNN space in the sense of Definition 2.1. Thus it suffices to construct a Fomin–Shapiro atlas.
Let (u,u)⪯(v,w)∈QJ, and define f:=(u,u), g:=(v,w). Thus we have ψ(f)=τuλ and ψ(g)=vτλw−1. Moreover, for the maximal element 1^=(id,wJ)∈QJ, we have ψ(1^)=τλJ. By (4), the map φˉu gives an isomorphism Cu(J)∼Xψ(1^)∩\accentset∘Xψ(f). Let OgC⊂Cu(J) be the preimage of Cψ(g)∩Xψ(1^)∩\accentset∘Xψ(f) under φˉu, and denote by Og:=OgC∩(G/P)R. Since Cψ(g) is open in G/B, we see that OgC is open in Cu(J) which is open in G/P, so Og is an open subset of (G/P)R. By (4), Og contains Starg≥0, which shows (FS5). Moreover, we claim that Og⊂Starg. Indeed, if h⪰f but h⪰g then ψ(h)≤ψ(g). The map φˉu sends \accentset∘Πh∩Cu(J) to \accentset∘Rψ(h)ψ(f), which does not intersect Cψ(g) by (A.3).
We now define the smooth cone (Zg,ϑg). Throughout, we identify \accentset∘Xψ(g) with CNg for Ng:=ℓ(ψ(g)) via (8.4). We set ZgC:=Xψ(1^)∩\accentset∘Xψ(g) and \accentset∘Zg,hC:=\accentset∘Rψ(h)ψ(g) for g⪯h∈QJ. We let Zg:=ZgC∩RNg and \accentset∘Zg,h:=\accentset∘Zg,hC∩RNg denote the corresponding sets of real points. Thus (FS1) follows. The action ϑg restricts to RNg, and by (8.5), it satisfies (SC2). As we discussed in Section 8.2, the action of ϑg also preserves both Zg (showing (SC1)) and \accentset∘Zg,h (showing (FS2)).
Finally, we define a map νˉg:OgC→(\accentset∘Πg∩OgC)×CNg as follows. Let ν~g=(ν~g,1,ν~g,2):Cg∼\accentset∘Xg×\accentset∘Xg be the map from Proposition 8.2. We let νˉg,2:=ν~g,2∘φˉu, so it sends OgC→Cψ(g)→\accentset∘Xψ(g)≅CNg. By (iv), the image of νˉg,2 is precisely ZgC. We also let νˉg,1:=φˉu−1∘ν~g,1∘φˉu, so it sends
[TABLE]
It follows from (4) and Proposition 8.2 that νˉg:=(νˉg,1,νˉg,2) gives a biregular isomorphism OgC∼(\accentset∘Πg∩OgC)×ZgC. All maps in the definition of ZgC are defined over R, so νˉg gives a smooth embedding Og→(\accentset∘ΠgR∩Og)×RNg with image (\accentset∘ΠgR∩Og)×Zg. By Lemma 3.3, we find that Zg is an embedded submanifold of RNg, so we get a diffeomorphism
[TABLE]
By (4) and (iv), we find that for h⪰g, νˉg sends \accentset∘Πh∩Og to (\accentset∘Πg∩Og)×\accentset∘Zg,h, showing (FS3). When xP∈\accentset∘Πg∩Og, we have φˉu(xP)∈\accentset∘Rψ(g)ψ(f), so ν~g,1(φˉu(xP))=φˉu(xP) and ν~g,2(φˉu(xP))∈\accentset∘Rψ(g)ψ(g). Thus νˉg,1(xP)=x and νˉg,2(xP)=0, showing (FS4). We have checked all the requirements of Definitions 2.1, 2.2, and 2.3.∎
9. The case G=SLn
In this section, we illustrate our construction in type A. We mostly focus on the case when G/P is the GrassmannianGr(k,n) so that (G/P)≥0 is the totally nonnegative GrassmannianGr≥0(k,n) of Postnikov [Pos07]. Throughout, we assume K=C.
9.1. Preliminaries
Fix an integer n≥1 and denote [n]:={1,2,…,n}. For 0≤k≤n, let (k[n]) denote the set of all k-element subsets of [n].
Let G=SLn be the group of n×n matrices over C of determinant 1. We have subgroups B,B−,T,U,U−⊂G consisting of upper triangular, lower triangular, diagonal, upper unitriangular, and lower unitriangular matrices of determinant 1, respectively. The Weyl group W is the group Sn of permutations of [n], and for i∈I=[n−1], si∈W is the simple transposition of elements i and i+1. If w∈W is written as a product w=si1…sil, then the action of w on [n] is given by w(j)=si1(⋯(sil(j))⋯) for j∈[n]. For S⊂[n], we set wS:={w(j)∣j∈S}. For example, if n=3 and w=s2s1 then w(1)=3, w(2)=1, w(3)=2, and w{1,3}={2,3}.
For i∈[n−1], the homomorphism ϕi:SL2→G just sends a matrix A∈SL2 to the n×n matrix ϕi(A)∈SLn which has a 2×2 block equal to A in rows and columns i,i+1. Thus if n=3 then s˙1=[010−100001], s˙2=[1000010−10], and if w=s2s1 then w˙=[001−1000−10]. In general, given w∈Sn, w˙ contains a ±1 in row w(j) and column j for each j∈[n], and the sign of this entry is −1 if and only if the number of ±1’s strictly below and to the left of it is odd. In other words, the (w(j),j)-th entry of w˙ equals (−1)#{i<j∣w(i)>w(j)}.
For x∈SLn, xT is just the matrix transpose of x, and xι defined in (4.4) is the “positive inverse” given by (xι)i,j=(−1)i+j(x−1)i,j for all i,j.
For i∈[n−1], the function Δi∓:SLn→C is the top-left i×i principal minor, while Δi±:SLn→C is the bottom-right i×i principal minor. The subset G0∓=B−B consists precisely of matrices x∈SLn all of whose top-left principal minors are nonzero, in agreement with (iv). We define Δn∓(x)=Δn±(x):=detx=1.
9.2. Flag variety
The group B acts on G=SLn by right multiplication, and G/B is the complete flag variety in Cn. It consists of flags{0}=V0⊂V1⊂⋯⊂Vn=Cn in Cn such that dimVi=i for i∈[n]. For a matrix x∈SLn, the element xB∈G/B gives rise to a flag V0⊂V1⊂⋯⊂Vn such that Vi is the span of columns 1,…,i of x. For k∈[n], S∈(k[n]), and x∈SLn, we denote by ΔSflag the determinant of the k×k submatrix of x with row set S and column set [k]. Thus for each k∈[n], we have a map Δkflag:G/B→CP(kn)−1 sending xB to (ΔSflag(x))S∈(k[n]). Here (k[n]) is identified with the set Wωk from (iv).
9.3. Partial flag variety
For J⊂[n], we have a parabolic subgroup P⊂G, and the partial flag variety G/P consists of partial flags{0}=V0⊂Vj1⊂⋯⊂Vjl⊂Vn=Cn, where {j1<⋯<jl}:=[n−1]∖J and dimVji=ji for i∈[l]. The projection πJ:G/B→G/P sends a flag (V0,V1,…,Vn) to (V0,Vj1,…,Vjl,Vn). When J=∅, we have P=B and G/P=G/B. We will focus on the “complementary” special case:
[TABLE]
In this case, G/P is the (complex) Grassmannian Gr(k,n), which we will identify with the space of n×k full rank matrices modulo column operations. Let us write matrices in SLn in block form
, where A is of size k×k and D is of size (n−k)×(n−k). For a matrix x=\scalebox{0.6}{\mbox{\displaystyle\left[\begin{array}[]{c|c}A&B\
\hline\cr C&D\end{array}\right]}}\in\operatorname{SL}_{n}, we denote by \left[x\right|:=\scalebox{0.6}{\mbox{\displaystyle\left[\begin{array}[]{c}A\
\hline\cr C\end{array}\right]}} the n×k submatrix consisting of the first k columns of x. Thus every x∈SLn gives rise to an element xP of G/P which is a k-dimensional subspace Vk⊂Cn equal to the column span of [x∣. The map Δkflag in this case is the classical Plücker embeddingΔkflag:Gr(k,n)↪CP(kn)−1.
The set WJ from Section 4.6 consists of Grassmannian permutations: we have w∈WJ if and only if w=id or every reduced word for w ends with sk. Equivalently, w∈WJ if and only if w(1)<⋯<w(k) and w(k+1)<⋯<w(n), so the map w↦w[k] gives a bijection WJ→(k[n]). The parabolic subgroup WJ (generated by {sj}j∈J) consists of permutations w∈Sn such that w[k]=[k], and the longest element wJ∈WJ is given by (wJ(1),…,wJ(n))=(k,…,1,n,…,k+1). The maximal element wJ of WJ is given by (wJ(1),…,wJ(n))=(n−k+1,…,n,1,…,n−k). We have
[TABLE]
where Ur is an r×r upper unitriangular matrix, Ir is the r×r identity matrix, A∈SLk, D∈SLn−k, and B, C are arbitrary k×(n−k) and (n−k)×k matrices, respectively.
9.4. Affine charts
We have G0(J):={x∈G∣Δ[k]flag(x)=0}, and for x=\scalebox{0.6}{\mbox{\displaystyle\left[\begin{array}[]{c|c}A&B\
\hline\cr C&D\end{array}\right]}}\in G_{0}^{{({J})}} (such that detA=Δ[k]flag(x)=0), the factorization x=[x]−(J)[x]0(J)[x]+(J) from (iv) is given by
[TABLE]
The matrix D−CA−1B is called the Schur complement of A in x.
For u∈WJ, the set Cu(J)⊂G/P from Section 4.12 consists of elements xP such that Δu[k]flag(x)=0. The (inverse of the) isomorphism (4.31) essentially amounts to computing the reduced column echelon form of an n×k matrix: if x∈G is such that xP∈Cu(J) is sent to g(J)∈u˙U−(J)u˙−1 via (4.31), then the n×k matrices [x∣ and [g(J)u˙ have the same column span, and the submatrix of [g(J)u˙ with row set u[k] is the k×k identity matrix. Let us say that an n×k matrix M is in u[k]-echelon form if its submatrix with row set u[k] is the k×k identity matrix.
The matrices g1(J)u˙ and g2(J)u˙ from Definition 4.23 are obtained from g(J)u˙ simply by replacing some entries with [math]. Explicitly, let (Mi,j):=[g(J)u˙, (Mi,j′):=[g1(J)u˙, and (Mi,j′′):=[g2(J)u˙ be the corresponding n×k matrices. Thus Mi,j=δi,u(j) for all i∈u[k] and j∈[k], and we have
[TABLE]
The operation M↦M′, which we call u-truncation, will play an important role.
Example 9.1**.**
Let G/P=Gr(2,4) and u=s3s2∈WJ, so u[k]={1,4}. We have
[TABLE]
where blank entries correspond to zeros.
9.5. Positroid varieties
We review the background on positroid varieties inside Gr(k,n), which were introduced in [KLS13], building on the work of Postnikov [Pos07]. Let S~n be the group of affine permutations, i.e., bijections f:Z→Z such that f(i+n)=f(i)+n for all i∈Z. We have a function av:S~n→Z sending f to av(f):=n1∑i=1n(f(i)−i), which is an integer for all f∈S~n. For j∈Z, denote S~j,n:={f∈S~n∣av(f)=j}. Every f∈S~n is determined by the sequence f(1),…,f(n), and we write f in window notation as f=[f(1),…,f(n)]. For λ∈Zn, define τλ∈S~n by τλ:=[d1,…,dn], where di=i+nλi for all i∈[n]. Let Bound(k,n)⊂S~k,n be the set of bounded affine permutations, which consists of all f∈S~n satisfying av(f)=k and i≤f(i)≤i+n for all i∈Z. The subset S~0,n is a Coxeter group with generators s1,…,sn−1,sn=s0, where for i∈[n], si:Z→Z sends i to i+1, i+1 to i, and j to j for all j≡i,i+1(modn). We let ≤ denote the Bruhat order on S~0,n, and ℓ:S~0,n→Z≥0 denote the length function. We have a bijection S~0,n→S~k,n sending (i↦f(i)) to (i↦f(i)+k), which induces a poset structure and a length function on S~k,n. When f≤g, we write g≤opf, and we will be interested in the poset (Bound(k,n),≤op), which has a unique maximal element τk:=[1+k,2+k,…,n+k]. It is known that Bound(k,n) is a lower order ideal of (S~k,n,≤op). We fix λ=1k0n−k:=(1,…,1,0,…,0)∈Zn (with k1’s). Then τλ=[1+n,…,k+n,k+1,…,n] is one of the (k[n]) minimal elements of (Bound(k,n),≤op). The group Sn is naturally a subset of S~0,n, and we have τk=τλ(wJ)−1=τλJ, where τλJ was introduced in Section 7.2. Note that λ is cominuscule; see Remark 7.2.
Given an n×k matrix M and i∈[n], we let Mi denote the ith row of M. We extend this to all i∈Z in such a way that Mi+n=(−1)k−1Mi for all i∈Z. Thus we view M as a periodic Z×k matrix. (The sign (−1)k−1 is chosen so that if M∈Gr≥0(k,n), then the matrix with rows Mi,…,Mi+n−1 belongs to Gr≥0(k,n) for all i∈Z; see Section 9.11.)
Every n×k matrix M of rank k gives rise to a map fM:Z→Z sending i∈Z to the minimal j≥i such that Mi belongs to the linear span of Mi+1,…,Mj. It is easy to see that fM∈Bound(k,n) and fM depends only on the column span of M. For h∈Bound(k,n), the (open) positroid variety\accentset∘Πh⊂Gr(k,n) is the subset \accentset∘Πh:={M∈Gr(k,n)∣fM=h}. Its Zariski closure inside Gr(k,n) is Πh=⨆g≤oph\accentset∘Πg; see [KLS13, Theorem 5.10].
For h∈Bound(k,n), define the Grassmann necklaceIh=(Ia)a∈Z of h by
[TABLE]
Then Ia is a k-element subset of [a,a+n), where for a≤b∈Z we set [a,b):={a,a+1,…,b−1}. For a≤b∈Z and M∈Gr(k,n), define rank(M;a,b) to be the rank of the submatrix of M with row set [a,b). For a,b∈Z and h∈S~n, define ra,b(h):=#{i<a∣h(i)≥b}. We describe two well-known characterizations of open positroid varieties; see [KLS13, Section 5.2].
Proposition 9.2**.**
Let h∈Bound(k,n) and let Ih=(Ia)a∈Z be its Grassmann necklace.
(iv)
The set \accentset∘Πh consists of all M∈Gr(k,n) such that for each a∈Z, Ia is the lexicographically minimal k-element subset S of [a,a+n) such that the rows (Mi)i∈S are linearly independent.
2. (iv)
For M∈Gr(k,n), we have M∈\accentset∘Πh if and only if
[TABLE]
We use window notation for Grassmann necklaces as well, i.e., we write Ih=[I1,…,In].
Recall that we have fixed λ=1k0n−k∈Zn. For (v,w)∈QJ, define fv,w∈S~n by
[TABLE]
Theorem 9.3** ([KLS13, Propositions 3.15 and 5.4]).**
The map (v,w)↦fv,w gives a poset isomorphism
[TABLE]
For (v,w)∈QJ, we have \accentset∘Πv,w=\accentset∘Πfv,w and Πv,w=Πfv,w as subsets of G/P=Gr(k,n).
Example 9.4**.**
There are n positroid varieties of codimension 1, each given by the condition Δ{i−k+1,…,i}flag=0 for some i∈[n]. Indeed, the top element (id,wJ)∈QJ covers n elements, namely (si,wJ) for i∈[n−1], together with (id,sn−kwJ). In the former case we have fsi,wJ=siτλJ, which corresponds to the variety Δ{i−k+1,…,i}flag=0. In the latter case we have fid,sn−kwJ=τλJsn−k, which corresponds to the variety Δ{n−k+1,…,n}flag=0.
Example 9.5**.**
One can check directly from (9.4) and (9.2) that the first element of the Grassmann necklace of fv,w is I1=v[k]. Similarly, w[k]={i∈[n]∣fv,w(i)>n}.
Example 9.6**.**
Elements of Bound(k,n) and QJ are in bijection with *
L
-diagrams* of [Pos07]. The bijection between QJ and the set of
L
-diagrams is described in [Pos07, Section 19]: the pair (v,w)∈QJ gives rise to a
L
-diagram whose shape is a Young diagram inside a k×(n−k) rectangle, corresponding to the set w[k]. The squares of the
L
-diagram correspond to the terms in a reduced expression for w, as shown in Figure 2 (top left): the box with coordinates (i,j) in matrix notation is labeled by sk+j−i, and we form the expression by reading boxes from right to left, bottom to top. The terms in the positive subexpression for v inside w correspond to the squares of the
L
-diagram that are not filled with dots; see Figure 2 (bottom left). Thus the bijection of Theorem 9.3 can be pictorially represented as in Figure 2 (right). We refer to [Pos07, Section 19] or [Wil07, Appendix A] for the precise description. For the example in Figure 2, we have v=s1, w=s2s1s4s3s2, and fv,w=[3,4,7,5,6] in window notation, which is obtained by following the strands in Figure 2 (right) from top to bottom.
9.6. Polynomial loop group
We explain how the construction in Section 7 applies to the case G/P=Gr(k,n). Recall that A:=C[z,z−1]. Let GLn(A) denote the polynomial loop group of GLn, consisting of n×n matrices with entries in A whose determinant is a nonzero Laurent monomial in z, i.e., an invertible element of A. (We use GLn(A) instead of SLn(A) as the constructions are combinatorially more elegant.)
We have a group homomorphism val:GLn(A)→Z sending x∈GLn(A) to j∈Z such that detx=cz−j for some c∈C∗, and we let GLn(j)(A):={x∈GLn(A)∣valx=j}. The subgroups GLn(A+) and GLn(A−) are contained inside the group GLn(0)(A) of matrices whose determinant belongs to C∗. We have subgroups U(A+):=evˉ0−1(U), U−(A−):=evˉ∞−1(U−), B(A+):=evˉ0−1(B) and B−(A−):=evˉ∞−1(B−) of GLn(0)(A). Thus in the notation of Section 7 for G=SLn, we have G=SLn(A)⊊GLn(0)(A), B=SLn(A)∩B(A+)⊊B(A+), U=U(A+), and U−=U−(A−).
To each matrix x∈GLn(A), we associate a Z×Z matrix x~=(x~i,j)i,j∈Z that is uniquely defined by the conditions
(1)
x~i,j=x~i+n,j+n for all i,j∈Z, and
2. (2)
the entry xi,j(z) equals the finite sum ∑d∈Zx~i,j+dnzd for all i,j∈[n].
One can check that if x=x1x2, then x~=x~1x~2. With this identification, the subgroups U, U−, B(A+), and B−(A−) have a very natural meaning. For example, x∈GLn(A) belongs to U if and only if x~i,j=0 for i>j and x~i,i=1 for all i∈Z. Similarly, B(A+) consists of all elements x∈GLn(A) such that x~i,j=0 for i>j and x~i,i=0 for all i∈Z.
To each affine permutation f∈S~k,n, we associate an element f˙∈GLn(A) so that the corresponding Z×Z matrix f~ satisfies f~i,j=1 if i=f(j) and f~i,j=0 otherwise, for all i,j∈Z.
In other words, if for i,j∈[n] there exists d∈Z such that f(j)=i+dn then f˙i,j(z):=z−d, and otherwise f˙i,j(z):=0. Observe that valf˙=k for all f∈S~k,n, and thus f˙∈GLn(k)(A). Recall that we have fixed λ=1k0n−k∈Zn. We obtain τ˙λ=diag(z1,…,z1,1,…,1) with k entries equal to z1, and for u∈WJ, we therefore get τ˙uλ=diag(c1,…,cn), where ci=z1 for i∈u[k] and ci=1 for i∈/u[k].
9.7. Affine flag variety
The quotient GLn(k)(A)/B(A+) is isomorphic to the affine flag variety G/B of Section 7 for the case G=SLn. Indeed, GLn(0)(A) acts simply transitively on GLn(k)(A) and we clearly have GLn(0)(A)/B(A+)≅G/B. For f≤oph∈S~k,n and g∈S~k,n, we have subsets \accentset∘Xf,\accentset∘Xh,\accentset∘Rhf,Cg⊂GLn(k)(A)/B(A+) defined by
[TABLE]
Let us now calculate the map φu from (7.11). Recall that it sends xP∈Cu(J) to g1(J)⋅τ˙uλ⋅(g2(J))−1. Assuming as before that x=g(J)u˙∈u˙U−(J), consider the corresponding n×k matrix (Mi,j):=[x∣ in u[k]-echelon form.
Proposition 9.7**.**
The matrix y:=φu(xP)∈GLn(k)(A) is given for all i,j∈[n] by
[TABLE]
Proof.
This follows by directly computing the product g1(J)⋅τ˙uλ⋅(g2(J))−1.
∎
The map φˉu:xP↦g1(J)⋅τ˙uλ⋅(g2(J))−1⋅B(A+) is a slight variation of a similar embedding of [Sni10] which we denote φˉu′. We have φˉu′(xP)=g1(J)⋅τ˙uλ⋅g2(J)⋅B(A+), and the corresponding matrix y′=φu′(xP):=g1(J)⋅τ˙uλ⋅g2(J) is given by (9.5) except that −Mi,s should be replaced by Mi,s. Thus y′ is obtained from y by substituting z↦−z and then changing the signs of all columns in u[k]. In particular, y′ and y are related by an element of the affine torus from Section 8.2.
Proposition 9.14 below is due to Snider [Sni10]. (4) generalizes Snider’s result to arbitrary G/P. The advantage of introducing the sign change in our map φˉu is that it is better suited for applications to total positivity: for instance, the analog of (4) does not hold for the map φˉu′.
We give a standard convenient characterization of \accentset∘Xh using lattices. For each x∈GLn(A) and column a∈Z, we introduce a Laurent polynomial xa(t)∈C[t,t−1] defined by xa(t):=∑i∈Zx~i,ati, and an infinite-dimensional linear subspace La(x)⊂C[t,t−1] given by La(x):=Span{xj(t)∣j<a}, where Span denotes the space of all finite linear combinations. For b∈Z, define another linear subspace Eb⊂C[t,t−1] by Eb:=Span{ti∣i≥b}. Finally, for a,b∈Z, define ra,b(x)∈Z to be the dimension of La(x)∩Eb. In other words, ra,b(x) is the dimension of the space of Z×1 vectors that have zeros in rows b−1,b−2,… and can be obtained as finite linear combinations of columns a−1,a−2,… of x~. Recall from Section 9.5 that for a,b∈Z and h∈S~n, we define ra,b(h):=#{i<a∣h(i)≥b}.
Lemma 9.10**.**
Let x∈GLn(d)(A) and h∈S~d,n for some d∈Z. Then
[TABLE]
Proof.
It is clear that ra,b(x)=ra,b(h) when x=h˙. One can check that ra,b(y−xy+)=ra,b(x) for all x∈GLn(d)(A), y−∈B−(A−), y+∈B(A+), and a,b∈Z. This proves (9.7) since GLn(d)(A)/B(A+)=⨆h∈S~d,n\accentset∘Xh by (A.2).
∎
Remark 9.11**.**
A latticeL is usually defined (see e.g. [Kum02, Section 13.2.13]) to be a free C[[z]]-submodule of C((t))≅C((z))n (where z=tn) satisfying L⊗C[[z]]C((z))≅C((z))n. The C[[z]]-submodule generated by our La(x) gives a lattice La(x) in the usual sense.
Definition 9.12**.**
Suppose we are given an n×k matrix M in u[k]-echelon form. Recall that we have defined the row Ma for all a∈Z in such a way that Ma+n=(−1)k−1Ma. For a∈Z and j∈[k], denote by θa,ju∈[a,a+n) the unique integer that is equal to u(j) modulo n. Define the u-truncationMtrua of M to be the [a,a+n)×k matrix Mtrua=(Mi,jtrua) such that for i∈[a,a+n) and j∈[k], the entry Mi,jtrua is equal to Mi,j if i≤θa,ju and to [math] otherwise; see Example 9.18. Thus Mtrua is obtained from the matrix with rows Ma,…,Ma+n−1 by setting an entry to [math] if it is below the corresponding ±1 in the same column, and we label its rows by a,…,a+n−1 rather than by 1,…,n. For example, if x=g(J)u˙ and M=[x∣ then Mtru1=[g1(J)u˙; cf. Example 9.1.
Lemma 9.13**.**
Let x=g(J)u˙∈u˙U−(J), M:=[x∣, and y:=φu(xP). Then for all a∈Z, the space La(y) has a basis
[TABLE]
Proof.
For a subset S⊂Z, define S+nZ:={j+in∣j∈S,i∈Z}. The space La(y) is the span of yj(t) for all j<a. If j∈/u[k]+nZ then yj(t)=tj by definition. If j∈u[k]+nZ then yj−n(t)=tj+∑j−n<i<jciti, where ci is zero for i∈u[k]+nZ. It follows that La(y) contains ti for all i<a. Moreover, the only indices j<a such that yj(t)∈/Span{ti∣i<a} are those that belong to [a−n,a)∩(u[k]+nZ). Let j∈[a−n,a)∩(u[k]+nZ) be such an index, and let s∈[k] be the unique index such that u(s)∈j+nZ. Then clearly yj(t)±Ps(t)∈Span{ti∣i<a}, where the sign depends on the parity of nj−u(s)∈Z. Thus Ps(t)∈La(y) for all s∈[k], and La(y) is the span of {ti∣i<a}⊔{P1(t),…,Pk(t)}. Since the Laurent polynomials Ps(t) have different degrees, they must be linearly independent.
∎
We give an alternative proof of (4) for the case G/P=Gr(k,n).
Proposition 9.14**.**
For h∈Bound(k,n) such that τuλ≤oph, the map φˉu gives isomorphisms
[TABLE]
Proof.
It is clear from (9.5) that we have a biregular isomorphism U1(J)×U2(J)∼U1(τuλ) sending (g1(J),g2(J)) to g1(J)⋅τ˙uλ(g2(J))−1τ˙uλ−1. Thus the map (g1(J),g2(J))↦g1(J)⋅τ˙uλ⋅(g2(J))−1⋅B(A+) gives a parametrization of \accentset∘Xτuλ; see (7.5). Since Cu(J)=⨆h∈Bound(k,n)(Cu(J)∩\accentset∘Πh), let us fix h∈Bound(k,n) and x=g(J)u˙∈u˙U−(J). Define M:=[x∣ and y:=φu(xP). By (9.3), we have M∈\accentset∘Πh if and only if k−rank(M;a,b)=ra,b(h) for all a≤b∈Z. By (9.7), we have y⋅B(A+)∈\accentset∘Xh if and only if ra,b(y)=ra,b(h) for all a,b∈Z. If a>b then ra,b(y)=ra,b+1(y)+1 by (9.8) and ra,b(h)=ra,b+1(h)+1 since h∈Bound(k,n) satisfies h−1(b)≤b, so h−1(b)<a. We have shown that y⋅B(A+)∈\accentset∘Xh if and only if ra,b(y)=ra,b(h) for all a≤b∈Z. Thus it suffices to show
[TABLE]
By (9.8), ra,b(y) is the dimension of Span{P1(t),…,Pk(t)}∩Eb. By the rank-nullity theorem, k−ra,b(y) is the rank of the submatrix of Mtrua with row set [a,b), which is obtained by downward row operations from the submatrix of M with row set [a,b). This shows (9.9).
∎
Remark 9.15**.**
By (4), the image of φˉu is XτλJ∩\accentset∘Xτuλ, where τλJ=τλ(wJ)−1. But recall from Section 9.5 that τλ(wJ)−1=τk, and since \accentset∘Xτk is dense in GLn(k)(A)/B(A+), we find that XτλJ∩\accentset∘Xτuλ=\accentset∘Xτuλ.
Example 9.16**.**
Suppose that x=g(J)u˙ is given as in Example 9.1, so that y=φu(xP) is the matrix from Example 9.8. It is clear that y∈B(A+)⋅τ˙uλ regardless of the values of x1,x2,x3,x4, and therefore y⋅B(A+) belongs to \accentset∘Xτuλ. We can try to factorize y as an element of B−(A−)⋅τ˙k⋅B(A+):
[TABLE]
This factorization makes sense only when all denominators on the right-hand side are nonzero, which shows that y⋅B(A+)∈\accentset∘Rτkτuλ whenever the minors Δ12flag(x)=x2, Δ23flag=x1x4−x2x3, and Δ34flag=x3 are nonzero. Observe also that Δ14flag(x)=1. Thus y⋅B(A+)∈\accentset∘Rτkτuλ precisely when xP∈\accentset∘Πτk, where τk=[3,4,5,6] in window notation. If x2=0 then xP∈\accentset∘Πh for h=[2,4,5,7]. In this case, we have
[TABLE]
Therefore y∣x2=0 belongs to \accentset∘Rhτuλ whenever x1,x3,x4=0. Observe that the Grassmann necklace of h is given by Ih=[{1,3},{2,3},{3,4},{4,5}] in window notation, and the corresponding flag minors of x∣x2=0 are given by Δ13flag=x4, Δ23flag=x1x4, Δ34flag=x3, and Δ14flag=1, in agreement with Proposition 9.14.
9.8. Preimage of Cg
For this section, we fix τuλ≤opg∈Bound(k,n). We would like to understand the preimage of (\accentset∘Xτuλ∩Cg)⊂GLn(k)(A)/B(A+) under the map φˉu. For a set S⊂[a,a+n) of size k, define ΔStrua(M) to be the determinant of the k×k submatrix of Mtrua with row set S. Let Ig=(Ia)a∈Z be the Grassmann necklace of g.
Proposition 9.17**.**
Suppose that xP∈Cu(J) and let M:=[g(J)u˙. Then φˉu(xP)∈Cg if and only if ΔIatrua(M)=0 for all a∈[n].
Proof.
Let h∈S~n be the unique element such that g˙−1φˉu(xP) belongs to \accentset∘Xh, so that φˉu(xP)∈Cg if and only if h=id. Since valφu(xP)=k and valg˙−1=−k, we get h∈S~0,n. Hence h=id if and only if ra,a(h)=0 for all a∈Z. Let y:=φu(xP) and y′:=g˙−1y. Then for a∈Z, we get La(y′)=g−1La(y), where g−1 acts on C[t,t−1] as a linear map sending tj to tg−1(j). In particular, La(y′)∩Ea=(g−1La(y))∩Ea has the same dimension as La(y)∩gEa. Let us define Ha:={ti∣i≥a}, so Ea=Span(Ha) and gEa=Span(gHa). Since g(i)≥i for all i∈Z, it follows from (9.2) that gHa=Ha∖{tj}j∈Ia. Therefore by (9.8), La(y)∩gEa={0} if and only if Span{Pj(t)}j∈[k]∩Span(Ha∖{tj}j∈Ia)={0}, which happens precisely when the submatrix of Mtrua with row set Ia is nonsingular, i.e., ΔIatrua(M)=0.
∎
Example 9.18**.**
Suppose that x is the matrix from Example 9.1, so that y:=φu(xP) is given in Example 9.8. We have
[TABLE]
Suppose that g=[2,4,5,7] as in Example 9.16, so that its Grassmann necklace is Ig=[{1,3},{2,3},{3,4},{4,5}] in window notation. This gives
[TABLE]
On the other hand, recall from Example 9.16 that g˙=[11z1z1]. Since y∈Cg if and only if g˙−1y∈B−(A−)⋅B(A+), we can factorize it as
[TABLE]
Again, this is valid only when the denominators in the right-hand side are nonzero. Thus we see that g˙−1y belongs to B−(A−)⋅B(A+) precisely when all minors in (9.10) are nonzero, in agreement with Proposition 9.17.
9.9. Fomin–Shapiro atlas
The computation in (9.11) can now be used to find the maps νˉg and ϑg. As in Section 8.3, denote by Og⊂Cu(J) the preimage of Cg∩\accentset∘Xτuλ under φˉu. Thus for our running example, Og is the subset of Cu(J) where all minors in (9.10) are nonzero. We are interested in the map νˉg=(νˉg,1,νˉg,2):Og→(\accentset∘Πg∩Og)×Zg from (2.1), defined in Section 8.3. The first component is νˉg,1=φˉu−1∘ν~g,1∘φˉu, where ν~g:Cg∩\accentset∘Xτuλ∼\accentset∘Rgτuλ×\accentset∘Xg is the map from (iv). In order to compute it, we consider the factorization g˙−1y=y−⋅y+∈U−⋅B(A+) from (9.11). The group U1(g) is 1-dimensional since ℓ(g)=1, and the corresponding element y1∈U1(g) from (iv) can be computed by factorizing g˙y−g˙−1 as an element of U1(g)⋅U2(g):
[TABLE]
Therefore the map ν~g,1 sends y⋅B(A+) from (9.6) to
[TABLE]
Applying φˉu−1 to the right-hand side, we see that the map νˉg,1 is given by
[TABLE]
Similarly, factorizing g˙y−g˙−1 as an element of U2(g)⋅U1(g), we find that
[TABLE]
We have Ng=ℓ(g)=1, and the map νˉg,2:Og→Zg=R sends [1x1x3x2x41] to x4x2.
9.9.1. Torus action
We compute the maps from Section 8.2. Let ρ~∈Y(T) denote the group homomorphism ρ~:C∗→C∗×T sending t to ρ~(t):=(tn,diag(tn−1,…,t,1)). If x∈GLn(A) is represented by a Z×Z matrix (x~i,j) then the element y:=ρ~(t)xρ~(t)−1∈GLn(A) satisfies y~i,j=tj−ix~i,j for all i,j∈Z.
Example 9.19**.**
Continuing the example above, we find that
[TABLE]
Thus the action of ϑg on Zg is given by ϑg(t,x4x2)=x4tx2. The pullback of this action to Og⊂Cu(J) via νˉg−1 preserves x3, x4, and x1x4−x2x3 (since it preserves νˉg,1(x)), but multiplies x4x2 by t. Therefore it is given by
[TABLE]
9.10. The maps κ and ζu,v(J)
The subset u˙G0(J) consists of matrices x∈G such that Δu[k]flag(x)=0. Suppose that x=g(J)u˙∈u˙U−(J). Then the elements g1(J)u˙ and g2(J)u˙ are obtained from x by setting some entries to zero; see Section 9.4. The map x↦κxx from Definition 4.23 sends x=g(J)u˙ to g1(J)u˙, e.g., if [x∣=[1x1x3x2x41] then [κxx∣=[1x2x41] as in Example 9.1. Comparing this to Section 9.8, we see that if M=[x∣ is in u[k]-echelon form then [κxx∣ is the u-truncation Mtru1.
Now let (v,w)∈QJ⪰(u,u), so τuλ≤opg:=fv,w, and define Ig:=(Ia)a∈Z. The set Gu,v(J) from (6.1) consists of x∈G such that Δu[k]flag(x)=0 and Δv[k]flag(κxx)=0. But recall from Example 9.5 that v[k]=I1. Thus
[TABLE]
Example 9.20**.**
We compute the maps κ and ζu,v(J) for our running example. Suppose that x=g(J)u˙ is given as in Example 9.1, and let g=[2,4,5,7] as in Example 9.18. Then g=s2τk, so under the correspondence (9.4), we have g=fv,w for v=s2 and w=wJ=s2s1s3s2; cf. Example 9.4. Since v[k]=I1={1,3}, we see that x∈Gu,v(J) whenever x4=0. We have just computed that [κxx∣=[1x2x41], so v˙−1κxx=[1x4−x211−1]. Factorizing the latter as an element of U−(J)⋅LJ⋅U(J) via (9.1), we get
[TABLE]
Thus we have computed η(x)=[v˙−1κxx]J from Definition 6.1. Since x∈u˙U−(J), we use (iv) to find
[TABLE]
Therefore the bottom-right principal minors of ζu,v(J)(x)w˙−1 are
[TABLE]
By Proposition 9.17, the preimage of Cg under φˉu is described by ΔIatrua(M)=0 for all a∈[n]. Alternatively, as we showed in Section 7.7, the preimage of Cg under φˉu is described by Δi±(ζu,v(J)(x)w˙−1)=0 for all i∈[n−1]. The following result has been computationally checked for all n≤5, k∈[n], and (u,u)⪯(v,w)∈QJ:
Conjecture 9.21**.**
Let (u,u)⪯(v,w)∈QJ. Define g:=fv,w, and let Ig=(Ia)a∈Z be its Grassmann necklace. Suppose that x=g(J)u˙∈Gu,v(J) and let M:=[x∣. Then
[TABLE]
For example, compare (9.13) with (9.10). Also recall that when i=1, Δn±(ζu,v(J)(x)w˙−1):=1, so in this case (9.14) holds trivially.
9.11. Total positivity
We recall some background on the totally nonnegative Grassmannian Gr≥0(k,n) of [Pos07]. By a result of Whitney [Whi52], G≥0 is the set of matrices in SLn(R) all of whose minors (of arbitrary sizes) are nonnegative. We have the following characterizations:
[TABLE]
The equality (9.16) is due to Rietsch; see [Lam16, Remark 3.8] for a proof. The equality (9.15) can be proved using arguments from [Whi52] (cf. the proof of Lemma 4.17). We caution the reader that the analogous statement can fail to hold for other choices of J. For instance, when G=SL4 and J={2}, (G/P)≥0 does not contain all xP∈(G/P)R such that ΔSflag(x)≥0 for all S∈(1[n])∪(3[n]); see [Che11, Section 10.1].
For f∈Bound(k,n), we let Πf>0:=\accentset∘Πf∩Gr≥0(k,n) and Πf≥0:=Πf∩Gr≥0(k,n). Thus for (v,w)∈QJ, we have Πfv,w>0=Πv,w>0 and Πfv,w≥0=Πv,w≥0 by Theorem 9.3.
Proposition 9.22**.**
Let τuλ≤opg≤oph∈Bound(k,n), and let Ig=(Ia)a∈Z be the Grassmann necklace of g. Suppose that a matrix M in u[k]-echelon form belongs to Πh>0. Then
[TABLE]
Proof.
Applying Theorem 9.3, we have (u,u)⪯(v,w)⪯(v′,w′)∈QJ, where g=fv,w and h=fv′,w′. By (4.22), we get v′≤vr′≤ur≤wr′≤w′ for some r,r′∈WJ.
First suppose that a=1. Let x∈G be such that M=[g(J)u˙ and xP∈Πh>0, and define M′:=Mtru1. We may assume that xB∈Rv′,w′>0. By Corollary 6.10, we find that κxxP∈Πvˉ′,u>0, where vˉ′:=v′◃rw−1 for some rw∈WJ satisfying rw≥r; see (iv). This shows that M′∈Gr≥0(k,n). Since ur≤urw, we find that ur◃rw−1≤u by (iv), and therefore ur◃rw−1=u. Applying ◃rw−1 to v′≤vr′≤ur via (iv), we see that vˉ′≤(vr′◃rw−1)≤u. Let v=v1v2 for v1∈WJ and v2∈WJ be the parabolic factorization of v. Then vr′◃rw−1∈v1WJ, and thus (v1,v1)⪯(vˉ′,u)∈QJ, which is equivalent to Δv1[k]flag(κxx)>0. From Example 9.5 we have v[k]=I1, and v1[k]=v[k] since v∈v1WJ, so ΔI1tru1(M)=ΔI1flag(κxx)>0. We have shown (9.17) for a=1. Applying the cyclic shift χ:Gr≥0(k,n)→Gr≥0(k,n) (which takes M to the matrix with rows (Ma+1)a∈[n]), we obtain (9.17) for all a∈Z.
∎
Note that our proof of Proposition 9.22 involves a lifting from G/P to G/B, so it does not stay completely inside Gr(k,n).
We now consider an example for the case G/P=Gr(2,5). Let u:=s2∈WJ, so u[k]={1,3}. Consider (v′,w′)∈QJ given by v′:=s1 and w′:=s2s1s4s3s2 as in Figure 2, so that h:=fv′,w′=[3,4,7,5,6]. We use Marsh–Rietsch parametrizations222For the Grassmannian case, Marsh–Rietsch parametrizations are closely related to BCFW bridge parametrizations; see [BCFW05, AHBC*+*16, Kar16]. from Section 4.9.1 to compute x∈G such that xB∈Rv′,w′>0 and xP∈Πh>0:
[TABLE]
where t=(t1,t3,t4,t5)∈R>04. Observe that xB∈(G/B)≥0 since all flag minors of x are nonnegative. (For instance, the first column of x consists of nonnegative entries.) In fact, flag minors of x are subtraction-free rational expressions in t; cf. (5.19). The n×k matrix [x∣ is not in u[k]-echelon form, but the matrix M:=[g(J)u˙ is. Up to a common scalar, the 2×2 flag minors of M are the same as the corresponding flag minors of x; however, other (i.e., 1×1) flag minors of M are not necessarily nonnegative. The Grassmann necklace of h is Ih=[{1,2},{2,3},{3,4},{4,7},{5,7}]. Using (iv), we check that indeed xP∈Πh>0.
Let us choose (v,w)∈QJ with v:=s2s1, w:=s2s1s4s3s2, so that g:=fv,w=[2,4,8,5,6]. The corresponding
L
-diagram is obtained from the one in Figure 2 (bottom left) by removing the dot in the bottom row. We have (u,u)⪯(v,w)⪯(v′,w′) and τuλ≤opg≤oph. We compute the elements κx=h2(J)∈U2(J), πu˙P−(x), η(x), and ζu,v(J)(x)=πu˙P−(x)⋅η(x)−1 from Definition 6.1:
[TABLE]
We see that all flag minors of κxx are nonnegative; cf. (iv). Observe that κg(J)u˙=κx by (iv), so by (iv), we could alternatively compute ζu,v(J)(x) as the product g(J)u˙⋅η(g(J)u˙)−1:
[TABLE]
Finally, we compute the bottom-right i×i principal minors of ζu,v(J)(x)w˙−1 and observe that they are all nonzero subtraction-free expressions in t, agreeing with Theorems 6.4 and 6.14:
[TABLE]
Let us check that this agrees with 9.21. The Grassmann necklace of g is Ig=[{1,3},{2,3},{3,4},{4,8},{5,8}] in window notation. We see that the corresponding u-truncated minors of M=[g(J)u˙ are indeed given by
[TABLE]
10. Further directions
In addition to Theorem 1.1 and Hersh’s result [Her14b] (cf. Corollary 1.3), we expect the regularity theorem to hold for many other spaces occurring in total positivity. The most natural immediate direction is total positivity for Kac–Moody flag varieties.
Let Gmin be a minimal Kac–Moody group, Umin,U−min,Bmin,B−min be unipotent and Borel subgroups, and W~ be the Weyl group as in Appendix A. Furthermore, let Pmin⊃Bmin denote a standard parabolic subgroup of Gmin (a group of the form Gmin∩PY in the notation of [Kum02]).
Definition 10.1**.**
Define the totally nonnegative partU≥0− of U−min to be the subsemigroup generated by {xαi(t)∣t∈R>0,1≤i≤r}.
Define the totally nonnegative part of the flag variety Gmin/Pmin to be the closure (Gmin/Pmin)≥0:=U≥0−Pmin/Pmin.
We remark that our notion of U≥0− coincides with the one studied recently by Lusztig [Lus20, Lus19] in the simply laced case.
When Gmin is an affine Kac–Moody group of type A, Definition 10.1 agrees with the definition of Lam and Pylyavskyy (cf. [LP12, Theorem 2.6]) for the polynomial loop group.
Conjecture 10.2** (Regularity conjecture for Kac–Moody groups and flag varieties).**
(1)
The intersection of U≥0− with the Bruhat stratification {Bminw˙Bmin∣w∈W~} of Gmin endows U≥0− with an (infinite) cell decomposition with closure partial order equal to the Bruhat order of W~. Furthermore, the link of the identity in any (closed) cell is a regular CW complex homeomorphic to a closed ball.
2. (2)
The intersection of (Gmin/Bmin)≥0 with the open Richardson stratification \accentset∘Ruv of Gmin/Bmin endows (Gmin/Bmin)≥0 with the structure of a regular CW complex. The closure partial order is the interval order of the Bruhat order of W~, and after adding a minimum, every interval of the closure partial order is thin and shellable.
3. (3)
The intersection of (Gmin/Pmin)≥0 with the open projected Richardson stratification Πv,w∘ of Gmin/Pmin endows (Gmin/Pmin)≥0 with the structure of a regular CW complex. The closure partial order is the natural partial order on P-Bruhat intervals of W~, and after adding a minimum, every interval of the closure partial order is thin and shellable.
Note that every interval in the Bruhat order of W~ is known to be thin and shellable [BW82]. The stratification Πv,w∘ and the P-Bruhat order can be defined analogously to [KLS14].
We include a list of some other spaces occurring in total positivity which we expect to have a natural regular CW complex structure.
(1)
The totally nonnegative part of double Bruhat cells [FZ99]. It has been expected that a link of a double Bruhat cell inside another double Bruhat cell is a regular CW complex homeomorphic to a closed ball. Our Theorem 3.12 confirms this in type A, since double Bruhat cells for GLn embed in the Grassmannian Gr(n,2n); see [Pos07, Remark 3.11].
2. (2)
The compactified space of planar electrical networks [Lam18] and the space of boundary correlations of planar Ising models [GP20, Conjecture 9.1]. These spaces are known to be homeomorphic to closed balls [GKL17, GP20], and have cell decompositions [Lam18, GP20] whose face poset is graded, thin, and shellable [HK21].
3. (3)
Amplituhedra [AHT14] and, more generally, Grassmann polytopes [Lam16]. Grassmann polytopes generalize convex polytopes into the Grassmannian Gr(k,n). The former are well known to be regular CW complexes homeomorphic to closed balls. Some amplituhedra and Grassmann polytopes have been shown to be homeomorphic to closed balls in [KW19, GKL17, BGPZ19], though we caution that not all Grassmann polytopes are balls.
4. (4)
The totally nonnegative part of the wonderful compactification of a semisimple algebraic group [He04]. A cell decomposition of this space was constructed in [He04].
We expect that most spaces in this list are (complexes of) shellable TNN spaces that admit a Fomin–Shapiro atlas.
Finally, let us mention the analogy between totally nonnegative spaces
and Teichmüller space [FG06, Gui08, GW18, Lab06]. Thurston’s compactification of the
Teichmüller space of a compact surface of genus g≥2 is
homeomorphic to a closed ball of dimension 6g−6 [Thu88], a
result that could be compared to Theorem 1.1.
Appendix A Kac–Moody flag varieties
We recall some background on Kac–Moody groups, and refer to [Kum02] for all missing definitions. We start by introducing the minimal Kac–Moody group Gmin and its flag variety Gmin/Bmin, and then explain how they relate to the polynomial loop group G and its flag variety G/B from Section 7.
A.1. Kac–Moody Lie algebras
Suppose that A~ is a generalized Cartan matrix [Kum02, Definition 1.1.1]. Thus A~ is an r×r integer matrix for some r≥1. We assume A~ is symmetrizable, that is, there exists a diagonal matrix D∈GLr(Q) such that DA~ is a symmetric matrix. As in [Kum02, Section 1.1], denote by g the Kac–Moody Lie algebra associated to A~, and let h⊂g be its Cartan subalgebra, whose dual is denoted by h∗. Thus h and h∗ are vector spaces over C of dimension r~:=2r−rank(A~), and we let ⟨⋅,⋅⟩:h×h∗→C denote the natural pairing.
We let Δ⊂h∗ denote the root system of g, as defined in [Kum02, Section 1.2]. Let {αi}i=1r⊂h∗ be the simple roots and {αi∨}i=1r⊂h be the simple coroots.
Let Δre⊂Δ denote the set of real roots and Δim⊂Δ denote the set of imaginary roots, so Δ=Δre⊔Δim. Also let Δ=Δ+⊔Δ− denote the decomposition of Δ into positive and negative roots, and denote Δre+:=Δ+∩Δre and Δre−:=Δre∩Δ−. Denote by W~ the Weyl group associated to A~ as in [Kum02, Section 1.3]. Thus W~ acts on Δ, and preserves the subset Δre. Moreover, W~ is generated by simple reflectionss1,…,sr∈W~, and (W~,{si}i=1r) is a Coxeter group by [Kum02, Proposition 1.3.21]. We let (W~,≤) denote the Bruhat order on W~ and ℓ:W~→Z≥0 denote the length function.
A.2. Kac–Moody groups
Let Gmin be the minimal Kac–Moody group associated to A~ by Kac and Peterson [KP83, PK83]; see [Kum02, Section 7.4]. For each real root α∈Δre, there is a one-parameter subgroup Uα⊂Gmin by [Kum02, Definition 6.2.7].333The results in [Kum02] are usually stated for the maximal Kac–Moody group which he denotes by G. However, these results apply to Gmin as well; see Remark A.3. For each α∈Δre, we fix an isomorphism xα:C∼Uα of algebraic groups. Similarly to the subgroups U,U−,T,B,B− of G, we have subgroups Umin,U−min,Tmin,Bmin,B−min of Gmin. The subgroup Umin is generated by {Uα}α∈Δre+, and U−min is generated by {Uα}α∈Δre−. Next, Tmin is an r~-dimensional algebraic torus defined in [Kum02, Section 6.1.6], Bmin=Tmin⋉Umin is the standard positive Borel subgroup and B−min=Tmin⋉U−min is the standard negative Borel subgroup.
We define a bracket closed subsetΘ⊂Δre in the same way as in Section 4.2, and for a bracket closed subset Θ⊂Δre+ (respectively, Θ⊂Δre−), we have a subgroup U(Θ)⊂Umin (respectively, U−(Θ)⊂U−min), generated by Uα for α∈Θ; see [Kum02, 6.1.1(6) and Section 6.2.7]. For w∈W~, Inv(w):=Δ+∩w−1Δ−⊂Δre+ is a bracket closed subset of size ℓ(w); cf. [Kum02, Example 6.1.5(b)]. We state the Kac–Moody analog of (iv).
Suppose that Θ=⨆i=1nΘi and Θ,Θ1,…,Θn⊂Δre+ are finite bracket closed subsets. Then U(Θ),U(Θ1),…,U(Θn) are finite-dimensional unipotent algebraic groups, and the multiplication map gives a biregular isomorphism
[TABLE]
A.3. Kac–Moody flag varieties
The Weyl group W~ equals NGmin(Tmin)/Tmin , where NGmin(Tmin) is the normalizer of Tmin in Gmin; cf. [Kum02, Lemma 7.4.2]. For f∈W~, we denote by f˙∈Gmin an arbitrary representative of f in NGmin(Tmin).
By [Kum02, Lemma 7.4.2, Exercise 7.4.E(9), and Theorem 5.2.3(g)], we have Bruhat and Birkhoff decompositions of Gmin:
[TABLE]
We let Gmin/Bmin denote the Kac–Moody flag variety of Gmin.
For each h,f∈W~, we have Schubert cells \accentset∘Xf:=Bminf˙Bmin/Bmin and opposite Schubert cells \accentset∘Xh:=B−minh˙Bmin/Bmin.
If h≤f∈W~ then by [Kum02, Lemma 7.1.22(b)], \accentset∘Xh∩\accentset∘Xf=∅. For h≤f, we define \accentset∘Rhf:=\accentset∘Xh∩\accentset∘Xf. Therefore (7.3) follows from (A.2). The flag variety Gmin/Bmin is a projective ind-variety by [Kum02, Section 7.1]. The Schubert cell \accentset∘Xf and Schubert variety Xf are finite-dimensional subvarieties, while the opposite Schubert cell \accentset∘Xh and opposite Schubert variety Xh are ind-subvarieties.
Proposition A.2**.**
Let h≤f∈W~. Then Xh∩Xf is a closed irreducible (ℓ(f)−ℓ(h))-dimensional subvariety of Xf, and \accentset∘Rhf is an open dense subset of Xh∩Xf.
Proof.
By (7.5), \accentset∘Xf is ℓ(f)-dimensional, and by [Kum02, Lemma 7.3.10], \accentset∘Xh∩Xf has codimension ℓ(h) in Xf. The rest follows by [Kum17, Proposition 6.6].
∎
For g∈W~, let Cg:=g˙B−minBmin/Bmin. We have
[TABLE]
where the unions are taken over h,f∈W~. The first part of (A.3) follows from (A.2), and for the second part, see the proof of (iv).
Remark A.3**.**
Let G^⊃Gmin be the “maximal” Kac–Moody group (denoted G in [Kum02]) associated to A~, and let B^⊃Bmin be its standard positive Borel subgroup. Then the standard negative Borel subgroup of G^ is still B−min. By [Kum02, 7.4.5(2)], we may identify Gmin/Bmin with G^/B^. By [Kum02, 7.4.2(3)], \accentset∘Xf coincides with the variety B^fB^/B^ in [Kum02, Definition 7.1.13] for f∈W~. Similarly, for h∈W~, \accentset∘Xh=B−min⋅h˙Bmin/Bmin coincides with the variety B∅h:=B−minhB^/B^ defined in the last paragraph of [Kum02, Section 7.1.20].
A.4. Affine Kac–Moody groups and polynomial loop groups
Suppose that A~ is the affine Cartan matrix associated to a simple and simply-connected algebraic group G. Thus we have r=∣I∣+1, r~=∣I∣+2, and A~ is defined by [Kum02, 13.1.1(7)]. Let G denote the polynomial loop group from Section 7. Our goal is to explain that the flag varieties G/B and Gmin/Bmin are isomorphic.
Let C⊂T⊂G be the center of G, and let C~⊂Tmin⊂Gmin be the center of Gmin; see [Kum02, Lemma 6.2.9(c)]. By [Kum02, Corollary 13.2.9], there exists a surjective group homomorphism ψ:Gmin→(C∗⋉G)/C with kernel C~, where C∗ acts on G as in Section 8.2; see also [Kum02, Definition 13.2.1]. The groups U,U−⊂G are identified with the groups Umin,U−min⊂Gmin, and we have T/C≅Tmin/C~. Thus ψ induces an isomorphism Gmin/Bmin∼G/B between the affine Kac–Moody flag variety and the affine flag variety. The Weyl groups W~ of G and Gmin are isomorphic by [Kum02, Proposition 13.1.7], and the root systems Δ coincide by [Kum02, Corollary 13.1.4]. Therefore the subsets \accentset∘Xf, \accentset∘Xh, \accentset∘Rhf, and Cg of G/B get sent by ψ to the corresponding subsets of Gmin/Bmin. As explained in the last paragraph of [Kum02, Section 13.2.8], G can be viewed as a subset of Gmin as well, and the restriction of ψ to G is the quotient map G→G/C.
We justify some of the other statements that we used in Sections 7.1 and 8.2.
For (7.2), see [Kum02, Section 13.1]. For (7.6), see [Kum02, Section 6.1.13]. For a description of Y(T) from Section 8.2, see [Kum02, Section 13.2.2]. For a description of the pairing ⟨⋅,⋅⟩:Y(T)×X(T)→Z in the same section, see [Kum02, Section 13.1.1].
A.5. Gaussian decomposition and affine charts
By [Kum02, Theorem 7.4.14], Gmin is an affine ind-group. Similarly, Umin, U−min, T, Bmin, and B−min are affine ind-groups; see e.g. [Kum02, Section 7.4] and [Kum02, Corollary 7.3.8].
Let G0min:=B−minBmin and g∈W~. Recall the subgroups U1(g) and U2(g) from (7.4). Then U1(g) is a closed ℓ(g)-dimensional subgroup of Umin≅U, and U2(g) is a closed ind-subgroup of U−min≅U−.
For (iv), see [Kum02, Proposition 7.4.11]. For (iv), we use an argument given in [Wil13, Proposition 2.5]. Both maps are bijective morphisms by [Kum02, Lemma 6.1.3]. In particular, it follows that g˙U−ming˙−1⊂G0min and for x∈g˙U−ming˙−1, we have [x]0=1. The inverse maps are given by μ21−1(x)=([x]−,[x]+), μ12−1(x)=([x−1]+−1,[x−1]−−1). They are regular morphisms by (iv), which proves (iv).
∎
The map g˙U−ming˙−1∼Cg is a biregular isomorphism for g=id by [Kum02, Lemma 7.4.10]. Since W~ acts on Gmin/Bmin by left multiplication, the case of general g∈W~ follows as well. Since U1(g), U2(g) are closed ind-subvarieties of g˙U−ming˙−1 and \accentset∘Xg, \accentset∘Xg are closed ind-subvarieties of Cg, it suffices to show that the image of U1(g) equals \accentset∘Xg while the image of U2(g) equals \accentset∘Xg. By [Kum02, Exercise 7.4.E(9) and 5.2.3(11)], we have
[TABLE]
Thus
[TABLE]
Bibliography87
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[AHBC + 16] Nima Arkani-Hamed, Jacob Bourjaily, Freddy Cachazo, Alexander Goncharov, Alexander Postnikov, and Jaroslav Trnka. Grassmannian Geometry of Scattering Amplitudes . Cambridge University Press, Cambridge, 2016.
2[AHT 14] Nima Arkani-Hamed and Jaroslav Trnka. The amplituhedron. J. High Energy Phys. , (10):33, 2014.
3[BB 05] Anders Björner and Francesco Brenti. Combinatorics of Coxeter groups , volume 231 of Graduate Texts in Mathematics . Springer, New York, 2005.
4[BCFW 05] Ruth Britto, Freddy Cachazo, Bo Feng, and Edward Witten. Direct proof of the tree-level scattering amplitude recursion relation in Yang–Mills theory. Phys. Rev. Lett. , 94(18):181602, 4, 2005.
5[BD 94] Yuly Billig and Matthew Dyer. Decompositions of Bruhat type for the Kac–Moody groups. Nova J. Algebra Geom. , 3(1):11–39, 1994.
6[BGPZ 19] Pavle V. M. Blagojević, Pavel Galashin, Nevena Palić, and Günter M. Ziegler. Some more amplituhedra are contractible. Selecta Math. (N.S.) , 25(1):25:8, 2019.
7[Bjö80] Anders Björner. Shellable and Cohen–Macaulay partially ordered sets. Trans. Amer. Math. Soc. , 260(1):159–183, 1980.
8[Bjö84] A. Björner. Posets, regular CW complexes and Bruhat order. European J. Combin. , 5(1):7–16, 1984.