Significance
Motivated by the desire to estimate phylogenetic trees from data on collections of taxa rather than just pairs, in 2004 a new variant of phylogenetic tree reconstruction was introduced, and two important theoretical questions were asked about it. One of these questions was solved within a few years; the other remained open until now. We resolve this second question and in doing so significantly enlarge a bridge between phylogenetics and a rapidly developing area of contemporary mathematics called tropical geometry.
Keywords: phylogenetic tree, dissimilarity vector, Grassmannian, tropical geometry, rational normal curve
Abstract
In 2004, Pachter and Speyer introduced the higher dissimilarity maps for phylogenetic trees and asked two important questions about their relation to the tropical Grassmannian. Multiple authors, using independent methods, answered affirmatively the first of these questions, showing that dissimilarity vectors lie on the tropical Grassmannian, but the second question, whether the set of dissimilarity vectors forms a tropical subvariety, remained opened. We resolve this question by showing that the tropical balancing condition fails. However, by replacing the definition of the dissimilarity map with a weighted variant, we show that weighted dissimilarity vectors form a tropical subvariety of the tropical Grassmannian in exactly the way that Pachter and Speyer envisioned. Moreover, we provide a geometric interpretation in terms of configurations of points on rational normal curves and construct a finite tropical basis that yields an explicit characterization of weighted dissimilarity vectors.
In one of the first papers on tropical geometry, Speyer and Sturmfels (1) introduced the tropical Grassmannian and showed that coincides with the space of -leaf phylogenetic trees, a tropical analogue of the moduli space of stable rational -pointed curves that plays an important role in genomics. With this Euclidean embedding, each phylogenetic tree is identified with its dissimilarity vector, the -tuple of path lengths connecting each pair of the leaves.
Pachter and Speyer (2) generalized this embedding by introducing the higher dissimilarity maps: for each integer with they showed that any phylogenetic tree can be recovered from its -dissimilarity vector, the -tuple recording the sum of edge lengths in the subtree spanned by each subset of leaves. They also stated two questions concerning the possible tropical geometry of these higher dissimilarity maps: 1) Is the space of -dissimilarity vectors in contained in the tropical Grassmannian ? If so, then 2) is there a rational map whose image tropicalizes to yield the space of -dissimilarity vectors? The first question was answered positively by several authors using distinct methods (3–5), whereas the second question has remained open other than the case that was confirmed in the original (2). There have been numerous papers studying other aspects of Pachter and Speyer’s higher dissimilarity maps as well (e.g., refs. 6–13).
In this paper we resolve the second question of Pachter and Speyer and introduce and study a variant of the higher dissimilarity maps that is more compatible with tropical geometry.
1. Statement of Results
By direct calculation we provide a negative answer to the second tropical question of Pachter and Speyer (recall that the first open case is , ).
Theorem 1.1. For the space of four-dissimilarity vectors in is a polyhedral complex that is not balanced, for any choice of weights on the facets, and hence is not a tropical variety (see also Theorem 3.1).
However, this is not the end of the story. The rational map in ref. 2, providing the motivation for their second tropical question, does not tropicalize to a map sending the two-dissimilarity vector of each phylogenetic tree to the corresponding three-dissimilarity vectors—as Pachter and Speyer point out, the output is twice the corresponding three-dissimilarity vector. This generalizes to a rational map whose tropicalization sends the two-dissimilarity vector of a phylogenetic tree to the -tuple recording, for each size subset of the leaves, the sum of all path lengths connecting all pairs of leaves in this subset. It is just a coincidence that for these two different notions of subtree weights differ by a scalar. We call these -tuples defined using path lengths within subtrees weighted -dissimilarity vectors and the map sending a phylogenetic tree to its vector of weighted -dissimilarity vectors the weighted -dissimilarity map. While for the original -dissimilarity vectors do not have the tropical geometry interpretation Pachter and Speyer had hoped for, it turns out these weighted variants do.
Theorem 1.2. For , the weighted -dissimilarity map embeds the space of phylogenetic trees as a tropical subvariety in . This tropical variety is the tropicalization of a subvariety of that is both 1) the image of a natural rational map and 2) the Gelfand–MacPherson correspondence applied to the open subvariety of parameterizing configurations of distinct points that lie on a rational normal curve in (see also Theorem 4.1 and Proposition 5.1).
The equations for the Zariski closure of the locus in mentioned in the preceding theorem were studied in ref. 14. While they are not known in full generality, we prove here that a particularly simple subset of the defining equations, after applying the Gelfand–MacPherson correspondence, yields a tropical basis for an ideal whose set-theoretic vanishing locus is the subvariety of alluded to in the preceding theorem. As a consequence of this tropical basis result, we obtain the following characterization of weighted dissimilarity vectors, generalizing the classic tree-metric theorem for two-dissimilarity vectors.
Theorem 1.3. Fix . A vector is a weighted -dissimilarity vector if and only if the following two conditions hold:
-
i)
for each 4-tuple , there exists an of size such that two of the following expressions equal each other and are greater than or equal to the third:
-
i)
for each , , and for each cube on (see section 5) with corresponding bipartition we have
(See also Corollary 5.1.)
The case is a main result of ref. 1, and our proof relies on their result; in both this case and the case , condition 2 here is vacuous because . In general, this characterization does not provide a minimal, nonredundant set of conditions, and indeed, our proof suggests an algorithmic approach for reducing the number of conditions of type 2 that need to be checked.
Remark 1.1: In ref. 1 it is shown that the quadratic Plücker relations do not form a tropical basis for the ideal of when and , and in general, the tropical Grassmannian depends on the characteristic of the base field. It is interesting to contrast with the present situation where the tropical subvariety of parameterizing weighted -dissimilarity vectors, and the tropical basis we construct for it, is independent of the base field.
2. Background and Preliminaries
We begin with some conventions. We work over an algebraically closed field of arbitrary characteristic, equipped with the trivial valuation. For a subvariety of projective space, we denote by the restriction of the affine cone over to the dense open torus in . Tropicalization sends subvarieties of the torus to subsets of Euclidean space .
2.1. Phylogenetic Trees
For us, an -leaf phylogenetic tree is a connected graph, without cycles or vertices of degree 2, with leaves labeled by the integers , that is equipped with an -valued length on each edge such that all of the internal edges have nonnegative length. The set of -leaf phylogenetic trees with a fixed combinatorial tree as the underlying graph forms a half-space , and by identifying trees having edges of length 0 with the trees obtained by deleting such edges these half-spaces are naturally glued together and form an abstract polyhedral complex that we shall denote by , known as the space of phylogenetic trees (15). An influential result of Speyer and Sturmfels is that the tropical Grassmannian
coincides with the space of phylogenetic trees (theorem 3.4 in ref. 1).
Remark 2.1: A phylogenetic tree is sometimes defined to have edge lengths only on its internal edges. The space of such phylogenetic trees is the quotient of by a linear subspace of dimension , and it coincides with the moduli space of tropical -pointed stable rational curves somewhat analogous to Kapranov’s construction (16) of as a (Chow) quotient of the Grassmannian by the maximal torus (indeed, the linear subspace acting on is the tropicalization of Kapranov’s torus action). Throughout this paper we include the noninternal edge lengths and hence work in without taking this linear subspace quotient.
2.2. Dissimilarity Vectors and Maps
The map
sending each phylogenetic tree to the vector whose entry is the sum of edge lengths along the unique path in connecting leaf to leaf , is known as the dissimilarity map, and the output is a dissimilarity vector. This map is injective (17), with image equal to ; it identifies phylogenetic trees with dissimilarity vectors or, equivalently, points of the tropical Grassmannian (1).
The higher dissimilarity map
introduced in ref. 2 for , sends to the higher dissimilarity vector whose entry, for , is the sum of edge lengths among all edges in the subtree spanned by the leaves indexed by ; it is injective for (theorem in section 2 in ref. 2). Since a tree spanned by two leaves is a path, the case of this map coincides with the dissimilarity map in the preceding paragraph.
Pachter and Speyer asked two questions about these higher dissimilarity maps (problems 3 and 4 in ref. 2): 1) is the image of contained in , and if so, then 2) is there a rational map whose image, viewed as a subvariety of by taking the affine cone over the Plücker embedding and then intersecting with the big torus in , tropicalizes to the space of higher dissimilarity vectors ? Various authors, cited above in the Introduction, resolved the first of these questions in the affirmative. For the second question, there has been progress in characterizing the image of (13), even in terms of a piecewise linear map that appears related to tropical geometry (8), but the only case that had been fully resolved is , where in section 3 in ref. 2, it is observed that the rational map induced by applying the second Veronese map to the columns of a matrix achieves the desired goal. This Pachter and Speyer map can be generalized as follows.
Definition 2.1: The matrix morphism ,
[1] |
given by applying the -Veronese map to each column, descends to a rational map of Grassmannians that we call the column-wise -Veronese Grassmannian map, or simply Veronese Grassmannian map.
The fact that this matrix map descends to the Grassmannians follows from the elementary observation that the image of each orbit is contained in a orbit. Note, however, that the image of a full-rank matrix need not be a full-rank matrix, so at the level of Grassmannians this really is just a rational map and not a regular morphism; for instance, the full-rank matrix
is sent to the following nonfull-rank matrix:
This column-wise Veronese Grassmannian map will play a central role in our paper.
3. Resolution of Pachter and Speyer’s Second Question
Recall that for each tree underlying an -leaf phylogenetic tree (meaning has leaves labeled by but the edges do not carry weights), there is a polyhedral cone in the space of phylogenetic trees , let us call it , parameterizing phylogenetic trees on . The restriction of the dissimilarity map to each such polyhedral cone is linear, and so the image is a polyhedral cone in . By varying , the polyhedral cones provide a polyhedral decomposition of the space of -dissimilarity vectors.
For each edge of , let be the phylogenetic tree on where has length 1 and all of the other edges have length 0. In phylogenetics, such trees are called split metrics. Then the polyhedral cone consists of all -linear combinations of the vectors such that the coefficient on is nonnegative whenever is an internal edge.
To show that the space of -dissimilarity vectors for is not the tropicalization of the image of a map , we show a stronger result: is not even a tropical variety in general. This is because as a polyhedral complex, is not balanced for (for the definition of balanced see definition 3.3.1 in ref. 18), and tropical varieties are balanced by theorem 3.3.5 in ref. 18. We check this explicitly in the first nontrivial case.
Theorem 3.1. The 11-dimensional polyhedral complex is not balanced for any choice of facet weights, and hence, it is not a tropical variety.
Proof: Consider the graph in Fig. 1 with a unique vertex of degree 4. This corresponds to a codimension-one cone that is the common face of three maximal-dimensional cones, call them . Each corresponds to the graph obtained by inserting an edge separating the four incident edges in into two pairs of coincident edges (Fig. 2). Since the edge is internal, the cone is the span of and the vector . For to be balanced along it is necessary that are linearly dependent modulo the subspace spanned by .
Fig. 1.
The graph defining a 10-dimensional cone in the space of four-dissimilarity vectors.
Fig. 2.
The three graphs whose corresponding 11-dimensional cones meet along the common face .
Consider the matrix whose columns are indexed by the size 4 subsets of [7] (ordered lexicographically: ), whose first 10 rows are the images under of the split metrics defined by the edges in , and whose last three rows are the images of the split metrics defined by the edges :
The last three rows are the vectors (the only entry of not equal to 1 is in the column indexed by the unique 4-tuple of vertices whose induced subgraph does not contain ). With computer assistance we check that this matrix has full rank. This implies that the last three rows are linearly independent modulo the subspace spanned by the first 10 rows, which shows that tropical balancing is not possible at .
4. Weighted Dissimilarity Vectors
In this section we tropicalize the Veronese Grassmannian map from Definition 2.1 and show that the image of the tropicalized map is the space of phylogenetic trees, embedded by the weighted dissimilarity vectors that we introduce in this paper. One of the main steps is to recognize the Veronese Grassmannian map as the restriction of a monomial map of tori; this crucially avails us of functoriality of tropicalization.
4.1. Coordinatizing the Veronese Grassmannian Map
Recall that the Veronese Grassmannian map in Definition 2.1 is expressed in terms of a matrix map of affine spaces . In order to tropicalize it we need to coordinatize the induced map on Grassmannians in their Plücker embeddings. Since these Grassmannians are obtained as quotients, this means expressing the matrix map in terms of homogeneous collections of invariants, i.e., maximal minors. We do this by defining a morphism of tori that restricts to the Veronese Grassmannian map.
Remark 4.1: Since technically, in this paper we tropicalize projective varieties by first lifting to affine cones and then restricting to dense tori, by a slight abuse of terminology we shall use the term Veronese Grassmannian map to refer to the rational map in Definition 2.1 as well as the induced morphism (the fact that the latter is indeed a regular morphism follows from Proposition 4.1 below); the context will always make clear which meaning is intended.
Definition 4.1: For each , let
be the group scheme morphism induced from the -algebra homomorphism
Proposition 4.1. The monomial morphism restricts to the Veronese Grassmannian map
Proof: By the first fundamental theorem of invariant theory, we need to see how the maximal minors of the right-hand matrix in Eq. 1 depend on the maximal minors of the left-hand matrix. However, the right-hand matrix is just a Vandermonde matrix where the columns have been homogenized, so for any collection of columns the corresponding maximal minor is
where denotes the -maximal minor of the left-hand matrix. This shows the restricted morphism is indeed induced by the column-wise Veronese map.
Since is a toric morphism, we can now apply functoriality of tropicalization for toric morphisms (corollary 3.2.13 in ref. 18) which tells us that the tropicalization of the closure (in ) of the image of the Veronese Grassmannian map coincides with the image of the tropicalized map restricted to the tropical Grassmannian . As we discussed earlier, is the space of two-dissimilarity vectors, and is the linear map described explicitly in the following proposition (whose proof is trivial). Our next steps are to go through this functoriality argument in detail and to interpret as sending two-dissimilarity vectors to the weighted dissimilarity vectors that we introduce next.
Proposition 4.2. The monomial morphism
tropicalizes to the linear map
whose component, for , is .
4.2. Weighted Dissimilarity Maps
We being this section with a weighted variant of the dissimilarity map.
Definition 4.2: For each , let
be the weighted dissimilarity map sending a phylogenetic tree to the weighted dissimilarity vector defined as follows. For each , let be the -leaf subtree of spanned by the leaves indexed by , and let the component of be the sum of the entries of the dissimilarity vector .
In other words, records for each -leaf subtree the sum of all path lengths in the subtree. The usual -dissimilarity map records for each -leaf subtree the sum of all edge lengths in the subtree, whereas is a weighted variant because it counts each edge with multiplicity equal to the number of leaf-to-leaf paths in the subtree in which the edge occurs.
Remark 4.2: Note that since in a three-leaf tree, every edge is traversed exactly twice among the possible leaf-to-leaf paths, whereas for the usual and weighted dissimilarity maps are, in general, not simply scalar multiples of each other.
We will later show that the image of the weighted dissimilarity map is a tropical variety (Theorem 4.1) and hence in particular is a balanced polyhedral complex. Before getting to that general proof, one might be curious to see how the matrix used to establish nonbalancing in the proof of Theorem 3.1 changes when using the weighted dissimilarity map.
Example 4.1: Replacing every instance of the dissimilarity map with the weighted dissimilarity map in the construction of the matrix in the proof of Theorem 3.1 yields the following:
Recall that the first 10 rows are the images of the split metrics defined by the graph in Fig. 1, and the last 3 rows are the images of the split metrics defined by the edges in Fig. 2. Note that and indeed are not scalar multiples of each other, but as expected, the locations of the zero entries in this matrix are the same as in the previous matrix. For this matrix, the first 10 rows are linearly independent, but the whole matrix has rank 12. Hence, the last three rows are linearly dependent modulo the linear subspace spanned by the previous 10, and this is what allows for balancing to hold here. Explicitly, the one-dimensional left kernel is spanned by the vector
which tells us that the sum of the images of the split metrics given by the three edges equals the sum of the images of the split metrics given by the four coincident edges in the graph .
The following proposition, whose proof follows immediately from the definition and Proposition 4.2, plays a fundamental role in this paper (indeed, we were led to the definition of the weighted dissimilarity map primarily so that this holds).
Proposition 4.3. The weighted dissimilarity map factors as follows:
Accordingly, in order to better understand the weighted dissimilarity map, we need to first establish a key property of the linear map .
Lemma 4.1. For the map is injective, and for it is bijective.
Proof: This is trivial for since is the identity map, so assume . Let be the matrix associated to , namely,
[2] |
We will construct an explicit left-inverse of . Define the matrix by
where . That is, for and we have
We will show that by directly calculating its entries. First of all,
For , we have
If , then the condition in the third summation is impossible since , so
where the last equality follows from an elementary calculation. If instead , then
where again the last equality is an elementary calculation.
The equality then implies surjectivity when .
Remark 4.3: By Proposition 4.3, the matrix constructed in the preceding proof, when viewed as a linear map , sends the weighted -dissimilarity vector of a phylogenetic tree to the corresponding two-dissimilarity vector.
Corollary 4.1. For , the weighted dissimilarity map is injective.
Proof: Lemma 4.1 and Proposition 4.3, together with the fact that the two-dissimilarity map is injective, show that is a composition of injective maps and hence is injective.
Corollary 4.2. For , the space of phylogenetic trees and the space of weighted -dissimilarity vectors are isomorphic as combinatorial polyhedral complexes. Furthermore, if , then they are also isomorphic to the space of -dissimilarity vectors.
Proof: This follows from the injectivity of in Corollary 4.1, the additional injectivity of when , and the observation that both maps are linear on each polyhedral stratum of .
Although both the dissimilarity map and the weighted dissimilarity map provide Euclidean embeddings of the space of phylogenetic trees, we have seen in section 3 that the former embedding is not a tropical variety; we show in the following subsection that the latter embedding is tropical, and we use the Veronese Grassmannian map to produce an algebraic variety realizing it as a tropicalization.
4.3. Back to Pachter and Speyer’s Second Question
Recall that the second question of Pachter and Speyer, whether the space of -dissimilarity vectors is the tropicalization of the image of a rational map of Grassmannians, ended up being false for the plain reason that higher dissimilarity vectors are not a balanced polyhedral complex and hence cannot be a tropical variety. We now establish a positive answer to the variant of Pachter and Speyer’s second question where dissimilarity vectors are replaced with weighted dissimilarity vectors.
Theorem 4.1. For , the space of weighted -dissimilarity vectors is the tropicalization of the image of the Veronese Grassmannian map .
Proof: By functoriality of tropicalization with respect to toric morphisms (corollary 3.2.13 in ref. 18), we have that
By Proposition 4.1, is the image of the Veronese Grassmannian map; by Lemma 4.2, below, this image is closed in the torus so we can ignore the Zariski closure in the right-hand side of this equality; and by Proposition 4.3, the left-hand side is .
Lemma 4.2. For , the image is closed in .
Proof: Let , and let be a DVR with field of fractions and residue field such that we have a map with mapping to and mapping to . Let be the open locus of matrices all of whose maximal minors are nonzero. The -quotient morphism is a locally trivial bundle in the Zariski topology, so we can lift to a map ; fix a choice of lift. This is a matrix over all of whose maximal minors are nonzero—so in particular, none of the columns of this matrix is the zero vector—and whose restriction to is, up to the action, a matrix in the form shown in the right-hand side of Eq. 1.
Because none of the columns of this matrix is 0, it descends to an point of the -quotient . The restriction of this latter point to is a configuration of points in that lie on a rational normal curve because the map in Eq. 1 simply applies the -Veronese map to each column, and the action preserves the property of the configuration lying on a rational normal curve. Therefore, the induced point is in the Zariski closure of the locus of points lying on a rational normal curve, and it is nondegenerate by the nonvanishing of maximal minors. So by proposition 2.7 in ref. 14 this point is a configuration of points on a quasi-Veronese curve (a nondegenerate flat limit of rational normal curves; definition 2.5 in ref. 14), which we denote by . We claim there is an actual rational normal curve containing this -point configuration.
If is irreducible, then it is a rational normal curve, and we may set . Suppose not, i.e., is a reducible quasi-Veronese curve. We can then write where, by lemma 2.6 in ref. 14, and are connected, possibly reducible, quasi-Veronese curves of positive degrees and , respectively, with . The same lemma shows that the projective linear subspace spanned by a degree quasi-Veronese curve is of dimension . It follows that the number of points lying on is at most , for , since otherwise, the points on would be linearly dependent and so any set of points containing these points would also be linearly dependent, contradicting the fact that all maximal minors of the corresponding matrix are nonzero. Consequently,
Thus, we have at most points in , and they are in general linear position by the nonzero maximal minors condition, so Castelnuovo’s lemma (theorem 1.18 in ref. 19) implies the existence of a rational normal curve through all points, as claimed.
Any rational normal curve in is in the orbit of the standard Veronese rational normal curve . So, up to acting on the lift by , we can assume that is the standard Veronese rational normal curve. This implies that the corresponding limiting point in is in the form shown in the right-hand side of Eq. 1, so its image under the quotient is indeed in the image of .
Remark 4.4: In theorem 3.2 in ref. 8, Bocci and Cools introduce a piecewise linear map
that provides a factorization of the -dissimilarity map, namely, . On the other hand, as shown in Proposition 4.3, our linear map provides a factorization of our weighted -dissimilarity map, namely, . Since is injective, we can choose a left inverse for it (such as the one explicitly constructed in the proof of Lemma 4.1), and then composing this with yields a piecewise linear map such that the following diagram commutes:
![]() |
In particular, we obtain a factorization . As we have seen, is a tropical variety in , whereas is not. Intuitively, the map tilts rays in the space of weighted dissimilarity vectors in such a way that certain collections of rays go from being linearly dependent to being linearly independent, and this is what destroys the balancing condition needed to be a tropical variety.
5. Tropical Bases and a Generalized Tree-Metric Theorem
Recall that is a closed subvariety (in the ambient torus ) whose tropicalization is the space of weighted -dissimilarity vectors . In order to find tropical equations for the tropicalization of this subvariety—and hence a characterization of weighted dissimilarity vectors—we need to first find equations for the subvariety itself.
5.1. Gelfand–MacPherson Correspondence
The proof of Lemma 4.2 shows that points of correspond to configurations of points in that lie on a rational normal curve. This correspondence is in essence the Gelfand–MacPherson correspondence, which identifies generic orbits in with generic orbits in and vice versa (cf. section 2.2 in ref. 16). In fact, we have the following.
Proposition 5.1. For , corresponds under Gelfand–MacPherson to the open locus in of configurations of distinct points that lie on a rational normal curve.
Proof: The proof of Lemma 4.2 shows that each point of corresponds to a configuration of points on a rational normal curve, and these points must be distinct since otherwise two columns in the matrix of coordinates would be proportional, and hence, any maximal minor containing these columns would be zero, contradicting the fact that all maximal minors are nonzero. Conversely, it is a classical fact (coming from the Vandermonde determinant) that distinct points on a rational normal curve are linearly independent, so any configuration of such points corresponds to a matrix all of whose maximal minors are nonzero, and as noted in the proof of Lemma 4.2, such a matrix yields a point of .
In particular, any -invariant polynomial that vanishes on the locus in of configurations lying on a rational normal curve corresponds to a -invariant polynomial that vanishes on . In other words, to find the ideal defining , a natural place to look is the ideal defining the Zariski closure in of the locus of points lying on a rational normal curve. This latter closed subvariety, and the ideal defining it, was the focus of ref. 14, where it is denoted (since it parameterizes configurations on a quasi-Veronese curve).
Two potential issues arise with this strategy: 1) generators for the ideal of are not fully known in general and 2) not all of the generators for this ideal are -invariant (remark 4.24 in ref. 14). However, we will establish in this section that the generators that are known from ref. 14 (all of which are -invariant) suffice to cut out the tropicalization of . We begin by reviewing these equations.
5.2. Equations for Points to Lie on a Rational Normal Curve
The closure of the locus of points lying on a rational normal curve in is the whole space if or . Thus, we will assume from now on. The first nontrivial example of is , which parametrizes 6-tuples of points in that lie on a conic. This is an irreducible hypersurface in defined by the vanishing of the following -invariant polynomial expressed as a quartic binomial in bracket notation (equation 3.4.9 in ref. 20 and remark 3.3 in ref. 14):
The notation here denotes the determinant of the submatrix, of a matrix of coordinates on , with columns . This bracket expression is not fully -symmetric, because brackets satisfy many nontrivial Plücker relations. Indeed, up to obvious sign changes, there are 15 different presentations of , as we next describe.
Let be the graph with vertex set where vertices and are connected if . A straightforward combinatorial argument shows that has 15 subgraphs isomorphic to the three-dimensional cube, and these form a single orbit under the natural action. A cube is a bipartite graph, so for each cube subgraph we can uniquely divide the vertex set into black and white subsets, which we label and , respectively, where we adopt the convention that the smallest triplet in the lexicographic order is black. For each vertex , we have the associated bracket , and for each cube in we may define a polynomial
Example 5.1: The subgraph generated by
is a cube, and the corresponding black–white bipartition is
so here coincides with the polynomial presented above.
Lemma 5.1. For each cube , we have as subvarieties of .
Proof: As noted above, , where is the cube in Example 5.1, so it suffices to show that if is another cube, then . By geometric considerations, the irreducible hypersurface is invariant under the natural action on . This implies that any permutation of must be a polynomial whose vanishing locus is also . The transitive action on the set of cubes is compatible with the action on bracket polynomials induced from the permutation action on . Therefore, for any cube , there exists a permutation for which and
as desired.
Remark 5.1: Even though all 15 polynomials define the hypersurface (and so this discussion of cubes and bipartitions did not arise in ref. 14), when we turn attention to tropicalization later in this section, we will need the extra flexibility provided by the choice of cube .
For , is defined scheme-theoretically by the polynomials obtained by pulling back along the projection maps (theorem 3.6 in ref. 14).
For , things get trickier; the polynomials found in ref. 14 were obtained as follows. The idea is to take the polynomial for , pull it back to , apply the Gale transformation which, up to a constant, in bracket form is simply taking the complement of each index set (proposition 4.5 in ref. 14) to get a polynomial on , then pull this back to . More formally:
-
i)
Choose , , and a cube in .
-
ii)
Take the pull-back along the projection .
-
iii)
Take the Gale transform .
-
iv)
Take the pull-back along the projection .
In slightly different notation, by using proposition 4.1 and remark 4.2 in ref. 21, we can rewrite the resulting polynomials explicitly as follows. For each
let be a cube in , and let be the corresponding bipartition. For instance, the choice of cube in Example 5.1 yields
Then let
Each vanishes on by lemma 4.17 in ref. 14.
5.3. Tropical Basis
Since these -invariant polynomials are expressed in bracket form (i.e., they are written as polynomials in the maximal minors), they can immediately be interpreted as polynomial functions on the Grassmannian ; this is done simply by viewing each minor as the corresponding Plücker coordinate function. These are quartic binomials on the Grassmannian, and the choice of cube corresponds to all 15 possible ways of lifting this to a quartic binomial on the ambient .
Definition 5.1: Let be the set of bracket binomials from section 5.2, and let be the ideal generated by and the Plücker relations for .
Note that if or , then for any , so it is safe to extend the preceding definition by setting in these cases.
Proposition 5.2. The set-theoretic vanishing locus in of the ideal is .
Proof: The result is trivial for , so let . First, we shall establish the set-theoretic containment . By definition the left-hand side is contained in , so all of the Plücker relations vanish on it. On the other hand, since each vanishes on , when viewed as a Grassmannian polynomial it vanishes on by Proposition 5.1. So it suffices to establish the reverse set-theoretic containment.
Let , and let be any matrix (necessarily with nonzero maximal minors) in the corresponding orbit. Let be any collection of columns in , viewed as a configuration of points in . Due to the nonzero maximal minors, is in general linear position, so we can choose a Gale dual configuration , and it too is in general linear position by proposition 4.5 in ref. 14. Now for all involving the labels of the points in , so by theorem 3.6 in ref. 14, must lie on a conic. This conic must be smooth since is in general linear position. It now follows from a classical result of Goppa (corollary 3.2 in ref. 22) that the configuration also lies on a rational normal curve, call it . Now replace a single point of with one of the other columns of and apply the same argument to deduce that this new configuration lies on a rational normal curve . However, these two rational normal curves have points in common, so by Castelnuovo’s lemma we have . Repeating this for the remaining columns shows that the full configuration given by lies on a rational normal curve, and hence, as desired.
Remark 5.2: We expect that as subschemes of , not just subvarieties, but we have not been able to establish this.
By viewing as a polynomial on , we can tropicalize it to obtain a tropical polynomial on . Moreover, since is a binomial, the corresponding tropical hypersurface is a classical hyperplane. Concretely, for coordinates on , where , the tropical hypersurface is given by
[3] |
We first show that the above classical hyperplanes cut out the image of the injective classically linear map (recall Lemma 4.1).
Proposition 5.3. For , we have
Proof: If or , then so the left-hand side is , but so is the right-hand side due to the bijectivity of in these cases established in Lemma 4.1. So assume that .
Let be the matrix whose rows encode the coefficients of the linear forms in Eq. 3, so that is the intersection on the left side of the proposition statement. Let be the matrix associated to , which was described explicitly in the proof of Lemma 4.1. Our task is thus to prove .
We shall first show that , i.e., . From the definition of , this is equivalent to the following: for each and each , the number of terms in Eq. 3 with a positive coefficient for which equals the number of such terms with a negative coefficient. If we write the bipartition corresponding to the cube as
then the positive terms of are for , and the negative terms are for . So we need to show that the number of for which equals the number of for which . This follows immediately from the observations that 1) each element of occurs in exactly two and two and 2) if a pair of elements of occurs in a or a , then it occurs in exactly one and one .
Having shown that , since (Lemma 4.1), it now suffices to show that or, equivalently, . To do this, we will find linearly independent rows in . Order the columns of according to the lexicographic order on . We will first find a collection of rows where the leftmost nonzero entries all occur in distinct columns since such rows are necessarily linearly independent, and then we will show that this collection has elements in it.
Consider a column . Let be the subset comprising the three smallest elements and let be the remaining elements. Choose another set of three elements in satisfying , , and . Consider the following cube on :
Notice that is the smallest vertex of the cube in lexicographic order. Let be the usual bipartition of , so in particular, . Then the vector , where
is a row of such that the first nonzero entry is . Let be the number of columns for which we can construct a row by the above description. We will show that by using induction on . It is obvious that .
Now we count the possibilities. First of all, in we have that or . The number of cases with is precisely , which by inductive assumption is equal to . Thus, we only have to count the cases with .
The possible range of is as we need at least elements in larger than , namely, . When , then can be any number between 2 and , so the number of possibilities for is . In this case, the number of ways to choose is . When , then cannot be , because we need two elements larger than (for and ) to make a cube where the smallest term is , but in , there is only one element larger than . So for we have possibilities and possibilities for .
In summary, the number of ways to make such a construction is
Thus, we obtain a recursive formula
From the inductive assumption and the lemma below, we obtain that .
Lemma 5.2.
Proof: First, note that and , so the right-hand side in the formula equals . Thus, the identity we need to show is equivalent to
which, in turn, is equivalent to
By using the substitution and , this is equivalent to
This last form of the identity can be established by combinatorial considerations: the term is precisely the number of ways one can choose a subset of of cardinality whose second smallest entry is .
Remark 5.3: The analogue of Proposition 5.3 for the unweighted dissimilarity map does not hold. As we discussed in Remark 4.4, for the -dissimilarity map we have that is replaced by the Bocci–Cools piecewise linear map . Hence, in general is not equal to the intersection of tropical hypersurfaces , which is instead a linear subspace of as Proposition 5.3 shows.
The three-term Plücker relations are the polynomials
with the standard convention that index sets are permuted to be increasing and the corresponding permutation signs are included when doing so. These do not generate the full ideal of Plücker relations in general, but they do so when passing to the Laurent polynomial ring so they define in the torus . In particular, in Definition 5.1 we could have defined the same ideal by using only the three-term Plücker relations rather than all of the Plücker relations.
For , the three-term Plücker relations form a tropical basis for the ideal of Plücker relations (corollary 4.3.12 in ref. 18), which means 1) as already noted, they generate the ideal of Plücker relations in the Laurent polynomial ring and 2) the intersection of the tropical hypersurfaces
for equals in .
Theorem 5.1. Fix . The three-term Plücker relations together with the bracket binomials form a tropical basis for the ideal .
Proof: We already noted above that these polynomials generate since we are working in the Laurent polynomial ring. So, we just need to show that the intersection of the tropical hypersurfaces defined by these polynomials coincides with the tropicalization of the vanishing locus of the ideal . By Proposition 5.1 we have , and by Theorem 4.1 we have . Thus, our task is reduced to showing that the intersection of the tropical hypersurfaces associated to the polynomials in the theorem statement equals the space of weighted -dissimilarity vectors .
Proposition 4.3 shows that , and Proposition 5.3 shows that the intersection of the tropical hypersurfaces associated to the is . Thus, all that remains is to show that the pull-backs along of the three-term Plücker relations define ; indeed, this suffices since is a monomial map; hence, pulling back along it commutes with tropicalization. From the definition of we have
so in the Laurent polynomial ring the three-term Plücker relations for pull back to the three-term Plücker relations for , which as we noted above are a tropical basis.
Remark 5.4: It follows from this proof that not all of the bracket binomials are needed to form this tropical basis. Indeed, the only role they play is cutting out the codimension linear subspace that is the image of , so this codimension is the number that is actually needed if they are chosen correctly. Similarly, not all of the three-term Plücker relations are needed: for each 4-tuple , only a single choice of is needed (and any such choice will do).
As an immediate corollary, by spelling out explicitly the conditions defining the tropical hypersurfaces for each polynomial in this tropical basis we obtain a characterization of weighted dissimilarity vectors, generalizing the classic tree-metric theorem for two-dissimilarity vectors.
Corollary 5.1. A vector is a weighted -dissimilarity vector if and only if the following two conditions hold:
-
i)
for each 4-tuple , there exists an of size such that two of the following expressions equal each other and are greater than or equal to the third:
-
i)
for each , , and for each cube in with corresponding bipartition we have
Acknowledgments
N.G. was supported in part by NSF DMS-1802263 and thanks the members of the Spring 2016 University of Georgia Vertical Integration of Research and Education graduate student tropical research group: Natalie Hobson, Andrew Maurer, Xian Wu, Matt Zawodniak, and Nate Zbacnik. We also thank the anonymous referee for the valuable comments and suggestions.
Footnotes
The authors declare no competing interest.
This article is a PNAS Direct Submission.
Data Availability
There are no data underlying this work.
References
- 1.Speyer D., Sturmfels B., The tropical Grassmannian. Adv. Geom. 4, 389–411 (2004). [Google Scholar]
- 2.Pachter L., Speyer D., Reconstructing trees from subtree weights. Appl. Math. Lett. 17, 615–621 (2004). [Google Scholar]
- 3.Cools F., On the relation between weighted trees and tropical Grassmannians. J. Symbolic Comput. 44, 1079–1086 (2009). [Google Scholar]
- 4.Giraldo B., Dissimilarity vectors of trees are contained in the tropical Grassmannian. Electron. J. Comb. 17, 7 (2010). [Google Scholar]
- 5.Manon C., Dissimilarity maps on trees and the representation theory of . J. Algebr. Comb. 33, 199–213 (2011). [Google Scholar]
- 6.Baldisserri A., Rubei E., On graphlike -dissimilarity vectors. Ann. Comb. 18, 365–381 (2014). [Google Scholar]
- 7.Baldisserri A., Rubei E., A characterization of dissimilarity families of trees. Discrete Appl. Math. 220, 35–45 (2017). [Google Scholar]
- 8.Bocci C., Cools F., A tropical interpretation of -dissimilarity maps. Appl. Math. Comput. 212, 349–356 (2009). [Google Scholar]
- 9.Evans S., Lanoue D., Recovering a tree from the lengths of subtrees spanned by a randomly chosen sequence of leaves. Adv. Appl. Math. 96, 39–75 (2018). [DOI] [PMC free article] [PubMed] [Google Scholar]
- 10.Herrmann S., Moulton V., The split decomposition of a -dissimilarity map. Adv. Appl. Math. 49, 39–56 (2012). [Google Scholar]
- 11.Levy D., Yoshida R., Pachter L., Beyond pairwise distances: Neighbor-joining with phylogenetic diversity estimates. Mol. Biol. Evol. 23, 491–498 (2006). [DOI] [PubMed] [Google Scholar]
- 12.Rubei E., Sets of double and triple weights of trees. Ann. Comb. 15, 723–734 (2007). [Google Scholar]
- 13.Rubei E., On dissimilarity vectors of general weighted trees. Discrete Math. 312, 2872–2880 (2012). [Google Scholar]
- 14.Caminata A., Giansiracusa N., Moon H.-B., Schaffler L., Equations for point configurations to lie on a rational normal curve. Adv. Math. 340, 653–683 (2018). [Google Scholar]
- 15.Billera L., Holmes S., Vogtmann K., Geometry of the space of phylogenetic trees. Adv. Appl. Math. 27, 733–767 (2001). [Google Scholar]
- 16.Kapranov M., “Chow quotients of Grassmannians I” in I. M. Gelfand Seminar, S. Gelfand, S. Gindikin, Eds. (Adv. Soviet Math., American Mathematical Society, Providence, RI, 1993), vol. 16, pp. 29–110. [Google Scholar]
- 17.Buneman P., “The recovery of trees from measures of dissimilarity” in Mathematics in the Archaeological and Historical Sciences, Hodson F., Kendall D., Tautu P., Eds. (Edinburgh University Press, Edinburgh, 1971), pp. 387–395. [Google Scholar]
- 18.Maclagan D., Sturmfels B., Introduction to Tropical Geometry (Graduate Studies in Mathematics, American Mathematical Society, Providence, RI, 2015), vol. 161, pp. xii+363. [Google Scholar]
- 19.Harris J., Algebraic Geometry. A First Course (Graduate Texts in Mathematics, Corrected Reprint, Springer-Verlag, New York, 1995), vol. 133. [Google Scholar]
- 20.Sturmfels Bernd., Algorithms in Invariant Theory (Texts and Monographs in Symbolic Computation, Springer-Verlag, Vienna, ed. 2, 2008). [Google Scholar]
- 21.Caminata A., Schaffler L., A Pascal’s theorem for rational normal curves. arXiv:1903.00460 (1 March 2019).
- 22.Eisenbud D., Popescu S., The projective geometry of the Gale transform. J. Algebra 230, 127–173 (2000). [Google Scholar]
Associated Data
This section collects any data citations, data availability statements, or supplementary materials included in this article.
Data Availability Statement
There are no data underlying this work.