Birational sequences and the tropical Grassmannian
Lara Bossinger111Supported by ”Programa de Becas Posdoctorales en la UNAM 2018” Instituto de Matemáticas, Universidad Nacional Autónoma de México.
Abstract
We introduce iterated sequences for Grassmannians, a new class of Fang-Fourier-Littelmann’s birational sequences and explain how they give rise to points in the tropical Grassmannian.
For Gr(2,Cn) we show that the associated valuations induce toric degenerations.
We describe recursively the vertices of the corresponding Newton–Okounkov polytopes, which are particular vertices of a hypercube and hence integral.
We show further that every toric degenerations of Gr(2,Cn) constructed using the tropical Grassmannian due to Speyer and Sturmfels can be recovered by iterated sequences.
1 Introduction
Toric degenerations of Grassmannians or more generally flag and spherical varieties have been a vivid research topic during the last 20 years.
A novel framework, called birational sequences, stemming from representation theory was given by Fang, Fourier and Littelmann in [FFL17].
Within this framework, we introduce and analyze new birational sequences for Grassmannians and discover surprising connections to the tropical Grassmannian by Speyer–Sturmfels [SS04].
To be more precise we need to introduce a bit of notation.
A toric degeneration of a projective variety X is a flat morphism π:X→Ad with generic fiber π−1(t) for t=0 isomorphic to X and π−1(0) a projective toric variety.
Consider SLn over C with Borel subgroup B of upper triangular matrices.
Let Pk be the parabolic subgroup of block-upper triangular matrices with blocks of size k×k and (n−k)×(n−k). In particular, the Grassmannian Gr(k,Cn) is isomorphic to SLn/Pk.
Denote its dimension by d.
Further, let U− be lower triangular matrices with 1’s along the diagonal.
The root system of type An−1 is R={εi−εj}i=j where {εi}i is the standard basis of Rn.
For every positive root β∈R+ we have the one-parameter root subgroup U−β⊂U−.
In this setting the notion of birational sequences due to Fang, Fourier and Littelmann [FFL17] applies:
a sequence S=(β1,…,βd) of positive roots is called birational for Gr(k,Cn) if the multiplication map
[TABLE]
has image birational to Gr(k,Cn).
Birational sequences give rise to coordinates on the Grassmannian.
These can be used to define valuations on the homogeneous coordinate ring.
The construction allows to compute certain values of the valuations explicitly via representations of the Lie algebra sln.
If the valuation has finitely generated value semi-group it induces a toric degeneration of the Grassmannian by [And13].
Their setting unifies many known constructions of toric degenerations in representation theory, such as [GL96, Cal02, AB04, FFL11].
However, besides the previously known cases few new birational sequences were discovered so far.
A central question is whether toric degenerations constructed from tropical geometry (see e.g. [SS04] for the case of Grassmannians) or cluster algebras (see e.g. [RW19]) can be recovered using birational sequences.
In this paper we study birational sequences that do not correspond to the previously known ones. One way to construct them is provided by the following central Lemma (see also Lemma 2). It allows to obtain a birational sequences for Gr(k,Cn+1) from a birational sequence for Gr(k,Cn).
Lemma**.**
Let S=(β1,…,βd) be a birational sequence for Gr(k,Cn) and choose i1,…,ik pairwise differently from {1,…,n}. Then the following is a birational sequence for Gr(k,Cn+1):
[TABLE]
Inspired by the Lemma we define a new class of birational sequences:
a birational sequence S for Gr(k,Cn) constructed from a birational sequence for Gr(k,Ck+1) by applying the Lemma n−k−1 many times is called iterated (see Definition 11).
Focusing on iterated sequences for Gr(2,Cn), we show further that the corresponding valuations have the necessary property to induce toric degenerations (relying on a result of [Bos20]).
Fixing the Plücker embedding of Gr(2,Cn) the corresponding Newton–Okounkov polytopes are in fact integral polytopes inside the hypercube222We consider the hypercube as the convex hull of all elements in {0,1}2(n−2)⊂R≥02(n−2). in R≥02(n−2) (see Corollary 2).
The vertices are given by the images of the valuation on Plücker coordinates, which in this case form a Khovanskii basis.
Moreover, we identify iterated sequences with maximal cones in trop(Gr(k,Cn)), the tropical Grassmannian [SS04].
For k=2 we give the explicit Algorithm 1 to do so.
For an iterated sequence S denote by CS⊂trop(Gr(2,Cn)) the output of the algorithm.
We say two toric degenerations of a projective variety X are equivalent if their special fibers are isomorphic toric varieties.
Our main results (Theorems 1&2) can be summarized as follows:
Theorem**.**
Let S be an iterated sequence for Gr(k,Cn). Then there exists a maximal cone C⊂trop(Gr(k,Cn)) such that the toric degeneration of Gr(k,Cn) induced by S is equivalent to the one given by the maximal cone C⊂trop(Gr(k,Cn)).
Moreover, for k=2 the cone C equals the cone CS which is the output Algorithm 1. Conversely, for every maximal
cone C⊂trop(Gr(2,Cn)) there exists an iterated
sequence S such that the induced toric degenerations of C and S are equivalent.
Remark 1**.**
Combining with the results of [BFF*+*18], where toric degenerations of Gr(2,Cn) from plabic graphs are studied, our main result implies that iterated sequences not only recover all possible toric degenerations of Gr(2,Cn) constructed using the tropical Grassmannian, but also all those constructed using plabic graphs (as in [RW19]).
Said differently, up to equivalence of toric degenerations the following sets are in one-to-one correspondence:
[TABLE]
We analyze the combinatorial structure of iterated sequences in terms of trivalent trees with n leaves that are in correspondence with maximal cones of trop(Gr(2,Cn)).
Let T be the infinite graph with vertices corresponding to (unlabelled) trivalent trees.
Two vertices T1,T2 of T are connected by an directed edge T1→T2, if T2 can be obtained from T1 by adding a leaf-edge (see Figure 1).
The unique source of T is the trivalent tree with three leaves.
Algorithm 1 yields the following corollary:
Corollary**.**
Every iterated sequence S for Gr(2,Cn) yields a unique path from the source of T to the trivalent tree with n leaves corresponding to the equivalence class333Equivalence classes are considered with respect to the action of the symmetric group Sn on the Plücker coordinates, see §2.2 below Remark 2 of the maximal cone CS⊂trop(Gr(2,Cn)).
The paper is structured as follows: after setting up the notation in §2 we recall necessary notions on valuations in §2.1.
Reminders on tropical geometry can be found in §2.2.
In §3 we introduce iterated (birational) sequences for Grassmannians and recall the construction of the associated valuations due to [FFL17].
In §4 we focus on iterated sequences for Gr(2,Cn) and prove the main result.
Acknowledgements: The result of this paper is part of my PhD thesis [Bos18] supervised by Peter Littelmann at the University of Cologne.
I am grateful for his advice and support throughout my PhD.
Further, I would like to thank Xin Fang, Ghislain Fourier and Alfredo Nájera Chávez for inspiring and helpful discussions and an anonymous referee for asking a question that lead to Corollary 3.
2 Notation
Let Ik,n be the set of ordered integer sequences i=(i1<⋯<ik) with 1≤i1 and ik≤n.
We consider the Grassmannian Gr(k,Cn) of k-dimensional subspaces in Cn with its Plücker embedding.
It is the vanishing of the Plücker ideal Ik,n⊂C[pj∣j∈Ik,n] in the polynomial ring on Plücker variables pj.
To describe Ik,n more explicitly we need some more notation.
Denote {1,…,n} by [n]. Consider j=(j1<⋯<jk+1)∈Ik+1,n and js∈j, i.e. 1≤s≤k+1.
Then j∖js denotes the sequence in Ik,n obtained by removing js from j.
For i=(i1<⋯<ik−1)∈Ik−1,n and j∈[n] define
[TABLE]
Set ℓ(i,j):=k−(r+1).
Note that if j=il for some 1≤l≤k−1 then i∪j∈Ik,n, in this case we set pi∪j=0.
The Plücker ideal Ik,n is generated by elements of form
[TABLE]
for i∈Ik−1,n and j∈Ik+1,n (see e.g. [LB15, §4.2.2]).
For k=2 we simplify notation by pij:=p(i<j) for (i<j)∈I2,n.
Then the Plücker relations are of form:
[TABLE]
with 1≤r<s<u<v≤n.
Let Ak,n:=C[pj]j∈Ik,n/Ik,n≅C[Gr(k,Ck)], which is the homogeneous coordinate ring of the Grassmannian.
The cosets pˉj∈Ak,n are called Plücker coordinates.
We recall some standard facts about Lie algebras, algebraic groups and their representations that will be used throughout the rest of the paper.
Let sln be the Lie algebra corresponding to SLn and fix a Cartan decomposition sln=n−⊕h⊕n+.
The Cartan subalgebra h consists of diagonal traceless matrices, and n− (resp. n+) of strictly lower (resp. upper) triangular matrices.
In the type An−1 root system R={εi−εj}i=j∈[n]⊂Rn we have positive roots R+={εi−εj}i<j and simple roots {εi−εi+1}i=1,…,n−1.
Further, set Rk+:={εi−εj∣1≤i≤k≤j≤n}.
For every positive root εi−εj we have a root operator fi,j∈n−:
it is the elementary matrix with only non-zero entry being 1 in the (j,i)-position.
Let Λ denote the weight lattice, generated by fundamental weights ω1,…,ωn−1.
The kth fundamental representation of sln is V(ωk)=⋀kCn.
It is cyclically generated by a highest weight vector vωk over the universal enveloping algebra U(n−).
Example 1**.**
For V(ω2) fix the basis {ei∧ej∣1≤i<j≤n}. Then the action of n− is given by
[TABLE]
We choose e1∧e2 as the highest weight vector vω2.
Identifying the Grassmannian with the quotient SLn/Pk, the Plücker embedding can be written as Gr(k,Cn)↪P(V(ωk)).
For r≥1 let V(rωk)∗ denote the vector space dual to V(rωk).
We obtain Ak,n≅⨁r≥0V(rωk)∗ and
the Plücker coordinate pˉj∈Ak,n for j=(j1<⋯<jk)∈Ik,n is the dual basis element (ej1∧⋯∧ejk)∗∈V(ωk)∗.
Let Uk−⊂U− be the subgroup generated by elements exp(zfi,j)=\mathds1+zfi,j, where εi−εj∈Rk+.
Then Uk− is open and dense in SLn/Pk≅Gr(k,Cn).
Hence, we have Plücker coordinates on Uk−: pˉj is the k×k-minor on columns [k] and rows j.
Moreover, we have an isomorphism of the fields of rational functions C(Gr(k,Cn))≅C(Uk−).
2.1 Valuations
We recall basic notions on valuations and Newton-Okounkov polytopes as presented in [KK12].
Consider A=C[x1,…,xn]/I with I a homogeneous ideal and kernel of π:C[x1,…,xn]→A.
Denote xˉi:=π(xi).
The standard grading on the polynomial ring induces a positive grading on A=⨁i≥0Ai.
Let d be the Krull-dimension of A.
Additionally, fix a linear order ≺ on the additive abelian group Zd.
Definition 1**.**
A map v:A∖{0}→(Zd,≺) is a valuation, if it satisfies for all f,g∈A∖{0} and c∈C∗
(i) v(f+g)⪰min{v(f),v(g)},
(ii) v(fg)=v(f)+v(g) and
(iii) v(cf)=v(f).
Let v:A∖{0}→(Zd,≺) be a valuation.
The image {v(f)∣f∈A∖{0}}⊂Zd forms an additive semi-group.
We denote it by S(A,v) and refer to it as the value semi-group.
The rank of the valuation is the rank of the sublattice generated by S(A,v) in Zd.
We are interested in valuations of full rank, i.e. rank(v)=d.
One naturally defines a Zd-filtration on A by Fv⪰a:={f∈A∖{0}∣v(f)⪰a}∪{0} (and similarly Fv≻a). The associated graded algebra is
[TABLE]
If the filtered components Fv⪰a/Fv≻a are at most one-dimensional for all a∈Zd, we say v has one-dimensional leaves.
By [KM19, Theorem 2.3] the full-rank assumption on v implies that v has one-dimensional leaves.
In particular, by [BG09, Remark 4.13] we then have an isomorphism C[S(A,v)]≅grv(A).
To define a Z≥0-filtration on A induced by v we make use of the following lemma:
Lemma**.**
([Cal02, Lemma 3.2])
Let S be a finite subset of Zd. Then there exists a linear form e:Zd→Z≥0 such that for all m,n∈S we have m≺n⇒e(m)>e(n) (note the switch!).
Assume S(A,v) is finitely generated, more precisely assume S(A,v) is generated by v(xˉ1),…,v(xˉn).
In this case {xˉ1,…,xˉn} is called a Khovanskii basis444This term was introduced in [KM19] generalizing the notion of SAGBI basis for (A,v).
Now choose a linear form as in the lemma for S being the set of generators.
We construct a Z≥0-filtration on A by F≤m:={f∈A∖{0}∣e(v(f))≤m}∪{0} for m∈Z≥0.
Define similarly F<m.
The associated graded algebra satisfies
[TABLE]
For f∈A∖{0} denote by f its image in the quotient F≤e(v(f))/F<e(v(f)), hence f∈grv(A).
We obtain a family of C-algebras containing A and grv(A) as fibers (see e.g. [And13, Proposition 5.1]) that can be defined as follows:
Definition 2**.**
The Rees algebra associated with the valuation v and the filtration {F≤m}m is the flat C[t]-subalgebra of A[t] defined as
[TABLE]
It has the properties that Rv,e/tRv,e≅grv(A) and Rv,e/(1−t)Rv,e≅A.
In particular, it defines a flat family over A1 (the coordinate on A1 given by t). The generic fiber is isomorphic to Proj(A) and the special fiber is the toric variety Proj(grv(A)), where Proj is taken with respect to the Z≥0-grading on A.
Introduced by Lazarsfeld-Mustaţă [LM09] and Kaveh-Khovanskii [KK12] we recall the definition of Newton-Okounkov body.
Definition 3**.**
Let v:A∖{0}→(Zd,≺) be a valuation of full rank.
The Newton-Okounkov body is
[TABLE]
Anderson showed in [And13] that if grv(A) is finitely generated, then Δ(A,v) is a rational polytope.
Moreover, it is the polytope associated to the normalization of the toric variety Proj(grv(A)).
The aim of [Bos20] is to give a criterion for when a valuation induces toric degeneration.
Using Anderson’s result, this translates to giving a criterion for when the corresponding value semi-group is finitely generated.
We state the criterion [Bos20, Lemma 3 and Theorem 1] below and use it to prove our main theorem in §4.
It uses the notion of initial ideals, that are defined as follows.
For u∈Z≥0n let xu to denote the monomial x1u1⋯xnun∈C[x1,…,xn].
Definition 4**.**
Let f=∑auxu∈C[x1,…,xn] and fix an element
w∈Rn (resp. M∈Zd×n).
Then the initial form of f with respect to w (resp. M) is
[TABLE]
Let I⊂C[x1,…,xn] be an ideal. Then its initial ideal with respect to w∈Rn (resp. M∈Zd×n) is defined as
[TABLE]
Definition 5**.**
Given a valuation v:A∖{0}→(Zd,≺)
define the weighting matrix of v by
[TABLE]
That is, the columns of Mv are given by the images v(xˉi) for i∈[n].
Theorem**.**
([Bos20, Theorem 1])
Let v:A∖{0}→(Zd,≺) be a full-rank valuation
with Mv∈Zd×n the weighting matrix of v.
Then
[TABLE]
In this case {xˉ1,…,xˉn} forms a Khovanskii basis for (A,v) and
Δ(A,v)=conv(v(xˉi)∣i∈[n]).
In particular, the theorem (resp. its proof) implies that if inMv(I) is prime, we have grv(A)≅C[x1,…,xn]/inMv(I).
To make a connection to tropical geometry, more precisely the tropical Grassmannian, we rely on the following Lemma.
Lemma**.**
([Bos20, Lemmata 2&3])
Let v:A∖{0}→(Zd,≺) be a full-rank valuation and Mv the associated weighting matrix. Then inMv(I) is monomial-free.
Moreover, there exists w∈Zn with inw(I)=inMv(I).
2.2 Tropical Geometry
We recall basic notions on tropical geometry, in particular on the tropical Grassmannian.
For details we refer to [MS15] and [SS04].
For u∈Zn as before we denote xu=x1u1⋯xnun∈C[x1±1,…,xn±1].
Definition 6**.**
Let f=∑auxu∈C[x1±1,…,xn±1]. The tropicalization of f is the function ftrop:Rn→R given by
[TABLE]
If w−v=(m,…,m), for some v,w∈Rn and m∈R, we have that the minimum in ftrop(w) and ftrop(v)
is achieved for the same u∈Zn with au=0.
Definition 7**.**
([MS15, Definitions 3.1.1/2])
Let f=∑auxu∈C[x1±1,…,xn±1] and V(f) the associated hypersurface in the algebraic torus Tn=(C∗)n. Then the tropical hypersurface of f is
[TABLE]
Let I be an ideal in C[x1±1,…,xn±1]. The tropicalization of the variety V(I)⊂Tn is defined as
[TABLE]
For a projective variety V(I)⊂Pn−1 with I a homogeneous ideal in C[x1,…,xn] we consider the ideal I^:=IC[x1±1,…,xn±1].
Then V(I^)=V(I)∩Tn.
The tropicalization of a projective variety is defined as trop(V(I)):=trop(V(I^)).
Recall the notion of initial ideal from Definiton 4 and consider for w∈Rn the initial ideal inw(I).
By [Eis95, Theorem 15.17],
there exists a flat family over C whose generic fiber over t=0 is isomorphic
to C[x1,…,xn]/I and whose special fiber over t=0 is isomorphic to C[x1,…,xn]/inw(I).
It is given by the following family of ideals
[TABLE]
Let Is denote the ideal I~t∣t=s. For s=0 the isomorphism C[x1,…,xn]/Is≅C[x1,…,xn]/I1=C[x1,…,xn]i/I is given by a ring automorphism of C[x1,…,xn] sending Is to I.
If inw(I) is toric, i.e. a binomial prime ideal, then V(inw(I)) is a toric variety (see e.g. [MS15, Lemma 2.4.14]) and flat degeneration of V(I) with family defined by I~t.
To find toric initial ideals, it is reasonable to consider the tropicalization of V(I) as due to the Fundamental Theorem of Tropical Geometry [MS15, Theorem 3.2.3] we have
[TABLE]
Further, by the Structure Theorem [MS15, Theorem 3.3.5] trop(V(I)) is the support of a pure rational d-dimensional polyhedral fan, where d is the Krull-dimension of I.
It contains a linear subspace, called lineality space defined as
[TABLE]
If I is homogeneous we have R(1,…,1)⊂trop0(V(I)).
It is often convenient to consider the quotient of trop(V(I)) by the lineality space.
We can choose a fan structure on trop(V(I)) by considering it as a subfan of the Gröbner fan of I.
In particular, if v and w lie in the relative interior of a cone C, denoted by v,w∈C∘, if and only if
[TABLE]
We therefore adopt the notation inC(I):=inw(I) for an arbitrary w∈C∘.
We say a cone C is prime, if inC(I) is a prime ideal.
Definition 8**.**
The tropical Grassmannian, denoted trop(Gr(k,Cn))⊂R(kn) is the tropical variety of the Plücker ideal Ik,n.
By [SS04, Corollary 3.1] it is a k(n−k)+1-dimensional polyhedral fan whose maximal cones are all of this dimension.
We mainly focus on the tropicalization of Gr(2,Cn).
By [SS04, Corollary 4.4] trop(Gr(2,Cn)) has the very nice property that every initial ideal inC(I2,n) associated to a maximal cone C⊂trop(Gr(2,Cn)) is toric.
Further, Speyer and Sturmfels show the following:
Theorem**.**
([SS04, Theorem 3.4])
The quotient trop(Gr(2,Cn))/trop0(Gr(2,Cn))⊂R(2n)/Rn intersected with the unit sphere is, up to sign, the space of phylogenetic trees [BHV01].
The theorem implies that every maximal prime cone C can be associated with a labeled trivalent tree with n leaves.
The set of all labeled trivalent trees with n leaves is denoted by Tn.
A trivalent tree is a graph with internal vertices of valency three and no loops or cycles of any kind.
Non-internal vertices are called leaves and the word labeled refers to labeling the leaves by 1,…,n.
We call an edge internal, if it connects two internal vertices.
We label the standard basis of R(2n) by ordered sequences (i<j)∈I2,n corresponding to Plücker variables.
The following definition shows how to obtain a point in the relative interior of a maximal cone in trop(Gr(2,Cn)) from a labeled trivalent tree. It follows from [SS04, Theorem 3.4].
Definition 9**.**
Let T be a labeled trivalent tree with n leaves. Then the (i<j)’th entry of the weight vector wT∈trop(Gr(2,Cn)) is
[TABLE]
For notational convenience we set
inT(I2,n):=inwT(I2,n). The corresponding maximal cone in trop(Gr(2,Cn)) is denoted CT.
Remark 2**.**
Combining the above, we have that every trivalent labeled tree induces a toric degeneration of Gr(2,Cn) with flat family as given in (2.7).
A main result of [KM19] is that there is a full-rank valuation with finitely generated value semi-group associated to prime cones in the tropicalization of a projective variety.
This yields a flat family using Rees algebras as in Definition 2.
The symmetric group Sn acts on Tn by permuting the labels of the leaves of a tree.
We also have an Sn-action on Plücker coordinates given by
[TABLE]
If σ−1(i)>σ−1(j), we set pσ−1(i)σ−1(j):=−pσ−1(j)σ−1(i).
The Sn-action induces a ring automorphism of C[pij]i<j for every σ∈Sn.
It sends inT(I2,n) to inσ(T)(I2,n) for every trivalent labeled tree T∈Tn.
Denote the equivalence class of T with respect to this action by T.
It is uniquely determined by the underlying (unlabeled) trivalent tree with n leaves, see for example Figure 2. We denote the set of trivalent trees by Tn/Sn.
Consider a trivalent tree T∈Tn/Sn. If there are two non-internal edges connected to the same internal vertex c, then we say T has a cherry at vertex c.
Lemma 1**.**
Every trivalent tree with n≥4 leaves has a cherry.
Proof.
We use induction on n. For n=4 Figure 2 displays the only trivalent tree in T4/S4 and we see, it has two cherries. Now consider a trivalent tree T′∈Tn+1/Sn+1. We remove one edge connected to a leaf and obtain a tree T∈Tn/Sn. By induction, T has a cherry at some vertex c. Adding the removed edge back there are two possibilities: either we add it to an internal edge (creating a new internal vertex), then the cherry also exists in T′. Or we add it at an edge with a leaf, hence create a new cherry.
∎
3 Birational sequences
We recall the definition of birational sequences due to Fang, Fourier, and Littelmann in [FFL17] and associated valuations.
After proving the central Lemma 2 we define a new class of birational sequences called iterated in Definition 11.
From now on let d:=k(n−k) be the dimension of Gr(k,Cn).
Consider a positive root β∈R+.
The root subgroup corresponding to β is given by U−β:={exp(zfβ)∣z∈C}⊂U−, where exp(zfβ)=\mathds1+zfβ.
Definition 10**.**
([FFL17, Definition 2])
Let S=(β1,…,βd) be a sequence of positive roots. Then S is called a birational sequence for Gr(k,Cn) if the multiplication map
[TABLE]
has image birational to Uk−.
Notice that U−β1×⋯×U−βd≅Ad.
Example 2**.**
The following are two first (and motivating) examples of birational sequences:
-
The multiplication map ∏β∈Rk+U−β→U− has image Uk− and hence, is birational.
In particular, every sequence containing all roots in Rk+ (in arbitrary order) is a birational sequence called PBW-sequence, see [FFL17, Example 1 and page 131].
We distinguish between PBW-sequences S and S′ when the order of the roots in S is different from the order of the roots in S′.
2. 2.
For w0 the longest element in Sn, let wk∈Sn/⟨si∣i=k⟩ denote a coset representative of w0.
Fix a reduced decomposition wk=si1…sid of wk and let S=(εi1−εi1+1,…,εid−εid+1) be the corresponding sequence of simple roots.
Then S is a birational sequence, it is referred to as the reduced decomposition case in [FFL17, Example 2].
The second example shows that repetitions of positive roots may occur in birational sequences.
Our aim is to shed some light on sequences that are neither PBW nor associated to reduced decompositions for Grassmannians.
The following lemma allows us to construct such sequences for Gr(k,Cn+1) from sequences for Gr(k,Cn).
Lemma 2**.**
Let S=(β1,…,βd) be a birational sequence for Gr(k,Cn) and chose I={i1,…,ik}⊂[n] with ∣I∣=k. Then the following is a birational sequence for Gr(k,Cn+1):
[TABLE]
Proof.
The elements of im(ψS′) are of the form
[TABLE]
for y1,…,yk,z1,…,zd∈C.
They satisfy an+1,j=y1ai1,j+⋯+ykaik,j for 1≤i≤n.
Deleting the last row and column gives the image of ψS, i.e. for 1≤i<j≤n we have ai,j∈C[z1,…,zd].
We need to show that im(ψS′) is birational to Uk−⊂SLn+1 given that im(ψS) is birational to Uk−⊂SLn.
Denote the corresponding map for S by ϕS:im(ψS)⇢Uk−⊂SLn.
Recall that elements of Uk− are block matrices of form
[TABLE]
where non-trivial xi,j occur for 1≤j≤k and k+1≤i≤n.
Let i∈Ik,n be the orderd sequence with entries i1,…,ik.
We define a birational map ϕS′:im(ψS′)⇢U−⊂SLn+1 by specifying for 1≤j≤k
[TABLE]
Then ϕS′(an+1,j)=∑l=1kϕS′(yl)ϕS(ail,j).
Before continuing with the computation note that on Uk−⊂SLn+1 we have pˉ(1<⋯<k)∖j∪il((xr,s)r,s)=xil,j for 1≤l≤k.
If j≤k, making use of the Plücker relations (2.1) this yields the following:
[TABLE]
For l>k we obtain ϕS′(an+1,l)∈C(xi,j∣1≤j≤k,k+1≤i≤n).
In particular, we have C(im(ϕS′))≅C(Uk−)≅C(Gr(k,Cn+1)).
By little abuse of notation we denote the invertible maps induced by S between C(Gr(k,Cn)) and C(Ad)≅C(z1,…,zd) by ψS∗ and (ψS∗)−1, respectively.
Induced by the pullback of ψS′ we consider the map between the rings of rational functions (also denoted ψS′∗):
[TABLE]
A straightforward computation reveals that the following map is indeed inverse to ψS′∗ above
[TABLE]
which completes the proof.
∎
Definition 11**.**
For k<n consider a birational sequence for Gr(k,Ck+1). Now extend it as in (3.1) to a birational sequence for Gr(k,Ck+2). Repeat this process until the outcome is a birational sequence for Gr(k,Cn). Birational sequences of this form are called iterated.
We explain how to obtain a valuation from a fixed birational sequence S=(β1,…,βd) for Gr(k,Cn) as constructed in [FFL17, §7].
Define the height function ht:R+→Z≥0 by ht(εi−εj):=j−i.
Then the height weighted function ΨS:Zd→Z is given by
[TABLE]
Let <lex be the lexicographic order on Zd.
The ΨS-weighted reverse lexicographic order ≺ΨS on Zd is defined by setting for m,n∈Zd
[TABLE]
When the sequence S is clear from the context we denote ΨS by Ψ.
Definition 12**.**
([FFL17, §7])
Let f=∑auyu with u∈Z≥0d be a non-zero polynomial in C[y1,…,yd].
The valuation vS:C[y1,…,yd]∖{0}→(Z≥0d,≺Ψ) associated to S is defined as
[TABLE]
We extend vS to a valuation on C(y1,…,yd)∖{0} by vS(gf):=vS(f)−vS(g) for f,g∈C[y1,…,yd]∖{0}.
Valuations of form (3.3) are called lowest term valuations.
As S is a birational sequence, for every f∈C(Gr(k,Cn)) there exists a unique element ψS∗(f)∈C(y1,…,yd). Hence, we have a valuation on C(Gr(k,Cn))∖{0} given by vS(f):=vS(ψS∗(f)).
We restrict to obtain
[TABLE]
Denote by S(Ak,n,vS) the associated value semi-group and the associated graded algebra by grS(Ak,n).
For the images of Plücker coordinates pˉj∈Ak,n we choose as before the notation pj∈grS(Ak,n).
The weighting matrix for vS is denoted MS.
Theorem 1**.**
Let S be an iterated sequence for Gr(k,Cn) and vS:Ak,n∖{0}→(Z≥0d,≺Ψ) the corresponding valuation.
Then there exists a cone C⊂trop(Gr(k,Cn)) such that
[TABLE]
Proof.
We need to show that vS is a full rank valuation.
Then by [Bos20, Corollary 3] the initial ideal inMv(Ik,n) is monomial-free.
Moreover, there exists w∈Z(kn) with inw(Ik,n)=inMv(Ik,n).
In particular, we have a cone C⊂trop(Gr(k,Cn)) with w∈C∘.
To prove that vS has full rank, it suffices to show that MS has full rank.
As S is an iterated sequence we pursue by induction on n.
If n=k+1 we may assume that S=(ε1−εk+1,…,εk−εk+1).
In this case, after choosing an apropriate order on Plücker coordinates, MS contains the identity matrix as a submatrix.
Now assume that the claim is true for n−1 and let
S=(εi1−εn,…,εik−εn,β1,…,βd′), where (β1,…,βd′) is an iterated sequence for Gr(k,Cn−1).
We have to show that the rows of MS corresponding to εi1−εn,…,εik−εn are linearly independent.
Consider j1,…,jk∈Ik,n such that for all l≤k we have i1,…,il−1,n∈jl and il∈jl.
Compute the columns of MS corresponding to vS(pˉj1),…,vS(pˉjk) using [FFL17, Proposition 2].
We see that the submatrix with rows corresponding to εi1−εn,…,εik−εn is a k×k-identity matrix.
Hence, the columns of vS(pˉj1),…,vS(pˉjk) are linearly independent and so MS is of full rank by induction.
∎
Corollary 1**.**
For every iterated sequence S the weighting matrix MS is of full rank.
4 Iterated sequences for Gr(2,Cn)
In this subsection we prove Theorem 2 stated in the introduction.
After proving Proposition 1 we can apply [Bos20, Theorem 1] to complete the proof.
We focus on iterated sequences for Gr(2,Cn) and start by computing the images of Plücker coordinates under the associated valuations.
Let S=(β1,…,βd) be a birational sequence for Gr(2,Cn).
Let U(nS−)⊂U(n−) be the subalgebra generated by monomials of form fβ1m1…fβdmd.
We consider the irreducible highest weight representation V(ω2)=⋀2Cn=U(nS−)⋅(e1∧e2).
There exists at least one monomial of form fSm=fβ1m1…fβdmd with the property fSm⋅(e1∧e2)=ei∧ej for all 1≤i,j≤n.
Then by [FFL17, Proposition 2] we have
[TABLE]
Example 3**.**
Consider Gr(2,C4) and the iterated sequence S=(ε1−ε4,ε2−ε4,ε1−ε3,ε2−ε3), respectively S′=(ε3−ε4,ε2−ε4,ε1−ε3,ε2−ε3).
They are birational by Lemma 2, as (ε1−ε3,ε2−ε3) is of PBW-type for Gr(2,C3).
We compute the valuation vS on Plücker coordinates.
There are two monomials sending e1∧e2 to e3∧e4, namely
[TABLE]
We have ΨS(1,0,0,1)=ΨS(0,1,1,0)=4, but (1,0,0,1)>lex(0,1,1,0). Hence, vS(pˉ34)=(1,0,0,1).
For vS′ we compute fS(1,0,0,1)(e1∧e2)=fS(0,1,0,0)(e1∧e2)=e1∧e4
Again, we have ΨS′(1,0,0,1)=ΨS′(0,1,0,0)=2, but as (1,0,0,1)>lex(0,1,0,0) it follows vS′(pˉ14)=(1,0,0,1).
In Table 1 you can find the images of all Plücker coordinates under vS and vS′.
From now on we fix an iterated birational sequence S=(εin−εn,εjn−εn,…,εi3−ε3,εj3−ε3) for Gr(2,Cn), where il,jl∈[l−1] with il=jl for all 3≤l≤n.
Then Algorithm 1 associates to S a labeled trivalent tree TS with n leaves.
Definition 13**.**
To an iterated sequence S we associate the trivalent tree TS and the sequence of trees TS=(TnS,…,T3S) that are the output of Algorithm 1.
Denote by CS the maximal cone in trop(Gr(2,Cn)) corresponding to the tree TS by [SS04, Theorem 3.4].
Example 4**.**
Consider S=(ε4−ε6,ε5−ε6,ε2−ε5,ε3−ε5,ε2−ε4,ε3−ε4,ε1−ε3,ε2−ε3), an iterated sequence for Gr(2,C6) .
We construct the trees TS=(T3S,T4S,T5S,T6S) by Algorithm 1.
Figure 4 shows the obtained sequence of trees.
Let MS:=MvS be the weighting matrix associated to vS as in Definition 5.
We compute the initial ideal inMS(I2,n) of the Plücker ideal I2,n to apply [Bos20, Theorem 1].
Proposition 1**.**
For every iterated sequence S we have inMS(I2,n)=inCS(I2,n).
Proof.
Let {eij}(i<j)∈I2,n be the standard basis of R(2n). Adopting the notation for monomials in the polynomial ring C[pij]i<j we have
[TABLE]
In particular, MS(eij+ekl)=vS(pˉij)+vS(pˉkl)=vS(pˉijpˉkl) and inMS(Ri,j,k,l) is the sum of those monomials in Ri,j,k,l for which the valuation vS of the corresponding monomials in A2,n is minimal with respect to ≺Ψ.
Recall that inCS(I2,n)=⟨inCS(Ri,j,k,l)∣1≤i<j<k<l≤n⟩ by [SS04, Proof of Theorem 3.4].
This implies that it is enough to prove the following claim.
Claim: For every Plücker relation Ri,j,k,l with 1≤i<j<k<l≤n we have inCS(Ri,j,k,l)=inMS(Ri,j,k,l).
Proof of claim: We proceed by induction. For n=4 let S=(εi−ε4,εj−ε4,εi3−ε3,εj3−ε3), i.e. the tree TS has a cherry labeled by i and 4.
Consider the Plücker relation Ri,j,k,4=pijpk4−pikpj4+pi4pjk with {i,j,k}=[3]. Then
[TABLE]
Let S′=(εi3−ε3,εj3−ε3) be the sequence for Gr(2,C3) and denote by p^rs with (r<s)∈I2,3 the Plücker coordinates in A2,3.
For m=(md−2,…,m1)∈Zd−2 and md,md−1∈Z write (md,md−1,m):=(md,md−1,md−2,…,m1)
We compute
[TABLE]
This implies vS(pˉi4pˉjk)≻ΨvS(pˉijpˉk4)=vS(pˉikpˉj4), and hence
inMS(Ri,j,k,4)=inCS(Ri,j,k,4).
Assume the claim is true for n−1 and let S=(εin−εn,εjn−εn,…,εi3−ε3,εj3−ε3) be an iterated sequence for Gr(2,Cn).
Then S′=(εin−1−εn−1,εjn−1−εn−1,…,εi3−ε3,εj3−ε3) is an iterated sequence for Gr(2,Cn−1).
Denote by p^ij with (i<j)∈I2,n−1 the Plücker coordinates in A2,n−1.
As vS(pˉij)=(0,0,vS′(p^ij)) for i,j<n we deduce inCS(Ri,j,k,l)=inMS(Ri,j,k,l) with i,j,k,l<n by induction.
Consider a Plücker relation of form Ri,j,k,n and compute
[TABLE]
As (in,n) is a cherry in TS we observe that the associated weight vector wTS∈CS∘⊂trop(Gr(2,Cn)) satisfies (wTS)ln=(wTS)lin=(wTS′)lin−1.
In particular, for i,j,k=in we have by induction inMS(Ri,j,k,n)=inCS(Ri,j,k,n).
The only relations left to consider are of form Rin,j,k,n for j,k∈[n−1]∖{in}. For MS we compute by the above
[TABLE]
Hence, inMS(Rin,j,k,n)=pinjpkn−pinkpjn. As (in,n) labels a cherry in TS we also have inCS(Rin,j,k,n)=inMS(Rin,j,k,n).
∎
Theorem 2**.**
For every iterated sequence S we have grS(A2,n)≅C[pij]i<j/inCS(I2,n).
Conversely, for every maximal prime cone C⊂trop(Gr(2,Cn)) there exists a birational sequence S, such that C[pij]i<j/inC(I2,n)≅grS(A2,n).
Proof.
Let S be an iterated sequence. By Corollary 1 we can apply [Bos20, Theorem 1] and get
[TABLE]
For the second we pursue by induction:
for n=3 there is only one maximal cone C⊂trop(Gr(2,C3)). The sequence S=(ε1−ε3,ε2−ε3) satisfies CS=C.
Assume the claim is true for n−1 and consider a maximal cone C⊂trop(Gr(2,Cn)) with associated tree TC.
Let TC denote the underlying unlabeled tree.
Find a cherry in TC and remove it.
Denote by TC′ the obtained tree with n−1 leaves.
By induction there exist an iterated sequence S′ for Gr(2,Cn−1) with associated tree TS′ of shape TC′.
Now add back the cherry and label the additional leaf by n.
The cherry is labeled by some i<n and n.
Hence, S:=(εi−εn,εj−εn,S′) for arbitrary j<n with i=j is an iterated sequence with TS of shape TC and therefore grS(A2,n)≅C[pij]i<j/inC(I2,n).
∎
For an iterated sequence S for Gr(2,Cn) denote by TiS the (unlabeled) trivalent tree underlying the labeled trivalent tree TiS with i leaves in the tree sequence TS.
Algorithm 1 provides a tool for comparing whether two iterated sequences induce isomorphic flat toric degenerations.
Construct TS1,TS2 for two such sequences S1,S2 and consider TnS1 and TnS2. If TnS1 and TnS2 coincide then
[TABLE]
Let Hd:=conv(e∈{0,1}d) be the hypercube in R≥0d.
Corollary 2**.**
For every iterated sequence S for Gr(2,Cn) the Newton-Okounkov polytope has (2n) vertices of form vS(pˉij) for 1≤i<j≤n. Further, it has no interior lattice points and satisfies
[TABLE]
Moreover, if S1,S2 are two different iterated sequences for Gr(2,Cn) with
TnS1=TnS2, then
the Newton-Okounkov polytopes are unimodularly equivalent555Two polytopes P,Q⊂Rd are called unimodularly equivalent if there exists matrix M∈GLd(Z) and w∈Zd
Q=fM(P)+w,
where fM(x)=xM for x∈Rd. It is denoted Q≅P and by [CLS11, §2.1 and §2.3] implies that the associated projective toric varieties are isomorphic..
Proof.
By Theorem 2 the value semi-group S(A2,n,vS) is generated by {vS(pˉij)}i<j.
This implies Δ(A2,n,vS)=conv(v(pˉij))i<j.
Observe from the proof of Proposition 1 that vS(pˉij)∈{0,1}d.
Therefore, vS(pˉij)∈conv(vS(pˉkl)∣(k<l)=(i<j)).
Hence, for all 1≤i<j≤n every vS(pˉij) is indeed a vertex and Δ(A2,n,vS)⊂Hd.
Regarding the second statement, let S1,S2 be two iterated sequences.
Assume we have TnS1=TnS2 and
consider the lattice ideals associated to each inCSi(I2,n) (see e.g. [BLMM17, Lemma 2]).
The corresponding lattice points {lji}j=1,…,(2n) define polytopes in their ambient lattice which are unimodularly equivalent to Δ(A2,n,vSi) (see [BLMM17, proof of Theorem 4] for the precise construction).
Therefore, (4.2) implies Δ(A2,n,vS1)≅Δ(A2,n,vS2).
∎
Given a maximal cone CT∈trop(Gr(2,Cn)) with associated labeled trivalent tree T the rays of C are in bijection with internal edges of T, i.e. those not adjacent to any leaf.
Internal edges give rise to partitions of [n] into two sets (each of cardinality ≥2) corresponding to the labelings of the leaves on either side of the edge.
Given a partition (A,B) of [n] the ray is EA,B=−∑i∈A∑j∈Beij∈R(2n), see [SS04, page 396].
Corollary 3**.**
Let S be an iterated sequence S for Gr(2,Cn) and
for n≥4 we consider the projection πn:R(2n)→R(2n−1) onto all coordinates that do not involve n.
Then TS=(T3,T4S,…,TnS) corresponds to a sequence of cones (CT3,CT4S,…,CTnS) with CTiS∈trop(Gr(2,Ci)) and πi(CTiS)=CTi−1S.
Proof.
The first property follows from Theorem 2.
For the second notice that if (A,B) is a partition of [n] then (A∩[n−1],B∩[n−1]) is a partition of [n−1].
Moreover, πn(EA,B)=EA∩[n−1],B∩[n−1]∈R(2n−1).
For every 4≤i≤n the trees TiS and Ti−1S have all interior edges in common, except the one adjacent to the cherry added when constructing TiS from Ti−1S.
Hence, the rays of CTiS are mapped to the rays of CTi−1S by πn.
∎
Remark 3**.**
In [KM19, Proposition 8.16] the authors describe an initial ideal inM(I) for an ideal I⊂C[x1…,xn] with respect to a matrix M∈Rn×d as inu1(…inud(I)…), where u1,…,ud are the columns of M.
This leads to a sequence of initial ideals of I, namely I,inud(I),inud−1(inud(I)) and so on.
The sequence of cones (CT3,CT4S,…,CTnS) from Corollary 3 also yields a sequence of initial ideals
inT3(I2,3),inT4S(I2,4),…,inTnS(I2,n).
This sequence is different in nature from the first as we are taking initial ideals of different ideals.
The following definition allows us to interpret iterated sequences for Gr(2,Cn) in a combinatorial way in Corollary 4 below.
Definition 14**.**
The tree graph T is an infinite graph whose vertices at level i≥3 correspond to trivalent trees with i leaves. There is an arrow T→T′, if T has i leaves, T′ has i+1 leaves and T′ can be obtained from T by attaching a new boundary edge to the middle of some edge of T. There is a unique source T3 at level 3 (see Figure 1).
Corollary 4**.**
Every iterated sequence S for Gr(2,Cn) corresponds to a path from T3 to TnS in the tree graph T.
Proof.
The underlying unlabeled trees in the sequence TS=(T3,T4S,…,TnS) associated to S define the path T3→T4S→⋯→TnS in T.
∎