Presentations of Transversal Valuated Matroids
Alex Fink, Jorge Alberto Olarte

TL;DR
This paper generalizes classical transversal matroid theory to the valuated setting using tropical geometry, explicitly describing the fibers of the tropical Stiefel map and characterizing transversal valuated matroids.
Contribution
It provides a detailed description of the fibers of the tropical Stiefel map and characterizes when a valuated matroid is transversal, extending classical matroid theorems to the tropical context.
Findings
Explicit description of fibers of the tropical Stiefel map
Characterization of transversal valuated matroids via initial matroids
Dual results describing stable intersections and valuated strict gammoids
Abstract
Given row vectors of tropical numbers, , the tropical Stiefel map constructs a version of their row space, whose Pl\"ucker coordinates are tropical determinants. We explicitly describe the fibers of this map. From the viewpoint of matroid theory, the tropical Stiefel map defines a generalization of transversal matroids in the valuated context, and our results are the valuated generalizations of theorems of Brualdi and Dinolt, Mason and others on the set of all set families that present a given transversal matroid. We show that a connected valuated matroid is transversal if and only if all of its connected initial matroids are. The duals of our results describe complete stable intersections via valuated strict gammoids.
Peer Reviews
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.
Presentations of Transversal Valuated Matroids
Alex Fink and Jorge Alberto Olarte
Abstract.
Given row vectors of tropical numbers, , the tropical Stiefel map constructs a version of their row space, whose Plücker coordinates are tropical determinants. We explicitly describe the fibers of this map. From the viewpoint of matroid theory, the tropical Stiefel map defines a generalization of transversal matroids in the valuated context, and our results are the valuated generalizations of theorems of Brualdi and Dinolt, Mason and others on the set of all set families that present a given transversal matroid. We show that a connected valuated matroid is transversal if and only if all of its connected initial matroids are. The duals of our results describe complete stable intersections of tropical linear spaces via valuated strict gammoids.
1. Introduction
In tropical mathematics, the accepted definition of tropical linear spaces uses an analogue to vectors of Plücker coordinates. These vectors were introduced by Dress and Wenzel [16], who named them valuated matroids because matroids appear as a special case.
Over a field , every linear subspace of can also be described as the rowspace of some matrix with entries in . The tropical counterpart fails. The tropical Stiefel map of [20] sends a matrix of tropical numbers to the tropical linear space determined by its vector of maximal minors; however, not all tropical linear spaces arise in this way.
The combinatorics of the map is governed by transversal matroids. Let be a multiset of subsets of a finite set . Edmonds and Fulkerson [18] observed that the set of subsets which form a transversal of , i.e. such that there is an injection with for each , are the independent sets of a matroid. A matroid arising in this way is called a transversal matroid, and is called a presentation of . To emphasize the commonality between valuated and unvaluated cases, we define a transversal valuated matroid to be a valuated matroid in the image of , i.e. a vector of tropical maximal minors of a matrix of tropical numbers. The matroids that are transversal valuated matroids are exactly the transversal matroids.
Brualdi and Dinolt described all presentations of a given transversal matroid. (Their original formulation [10, Theorem 5.2.6] is Proposition 3.7 below.) Any transversal matroid has a unique maximal presentation, which consists of copies of for each flat of , where the number is computed by a recurrence (3.2) on the lattice of flats. Every presentation of can be obtained from the maximal one by deleting relative coloops in a way that doesn’t contravene Hall’s theorem, i.e. that satisfies
[TABLE]
for every , where is the corank function.
Our main theorem is an explicit description of the fibers of .
Theorem 1.1** (Synopsis of Theorem 6.6).**
Each nonempty fiber of the tropical Stiefel map is the orbit of a fan in the space of tropical matrices under the action of permuting the rows.
This directly generalizes Brualdi and Dinolt’s result to valuated matroids. For (unvaluated) matroids in the image of , the apex of our fan is the unique maximal presentation of Brualdi and Dinolt. Apart from a lineality space, all rays of our fan are in coordinate directions, and the sets of coordinates that appear are described by a “local” reformulation of equation (1.1).
In [20] a necessary condition for a valuated matroid to be transversal was given (Proposition 3.6). Assuming for convenience that is connected, the condition is that if is transversal, all connected initial matroids of must be transversal. The initial matroids are those whose matroid polytopes appear in the polytope subdivision induced by . We obtain a converse.
Theorem 1.2** (= Theorem 6.20).**
A connected valuated matroid is transversal if and only if all of its connected initial matroids are transversal.
Duality of valuated matroids replaces the tropical Stiefel map by the process of taking the stable intersection of a collection of tropical hyperplanes. In the realm of matroids, the dual of the class of transversal matroids is the class of strict gammoids. This class arises from flows in directed graphs, which admit a natural generalization to the realm of valuated matroids which we call valuated strict gammoids. We find the statements derived from Theorem 6.20 by this duality to be of interest in their own right.
Theorem 1.3** (= Theorem 7.5).**
Let be a valuated matroid and its corresponding tropical linear space. Then the following are equivalent:
- (1)
* is the stable intersection of tropical hyperplanes.* 2. (2)
* is a valuated strict gammoid.* 3. (3)
Near each point, is locally the Bergman fan of a strict gammoid.
Furthermore, Theorem 6.6 explicitly describes the spaces of all -tuples of tropical hyperplanes whose stable intersection is a given tropical linear space, and of all weighted directed graphs that present a given valuated strict gammoid.
In this paper, Section 2 reviews valuated matroids and tropical linear spaces. Section 3 introduces transversality and the Stiefel map, and interprets the former as the -valued case of the latter. We begin to characterize presentations in Section 4, by bounds on the number of rows chosen from certain regions of the tropical linear space. Section 5 introduces a piece of technical apparatus needed for the proofs of the main theorems, after which Section 6 proves them. Section 7 introduces strict gammoids and stable intersection and reframes our results in this language.
Acknowledgments
During this work the first author received support from the Deutsche Forschungsgemeinschaft project “Facetten der Komplexität” and from the European Union’s Horizon 2020 research and innovation programme under grant agreement No 792432. The first author also thanks the Mittag-Leffler Institute for their hospitality and delightful working conditions. The second author was supported by the Einstein Foundation Berlin through the visiting fellowship of Francisco Santos. We thank Michael Joswig, Georg Loho, and a referee for valuable feedback.
2. Valuated matroids and tropical linear spaces
This section is a review of standard concepts to set up the terminology and notation; it contains no new material. Our work’s main characters are tropical linear spaces, or to give them another of their cryptomorphic names, valuated matroids [16]. We recommend [30, chap. 4] as a more detailed reference for tropical linear spaces and valuated matroids. For (unvaluated) matroids, any standard textbook will suffice.
Fix a set . We denote the set of all subsets of with cardinality by . Given a subset , we denote its zero-one indicator vector by
[TABLE]
We distinguish multisets from sets by writing them with doubled braces, like .
In the theory of valuated matroids, coordinates are drawn from the semiring of tropical numbers, with operations and and identity elements and [math]. The set of vectors of tropical numbers plays the role of affine -space in tropical geometry. But we prefer to work in projective space:
[TABLE]
where the action of is by addition. When we speak of the relative interior of a polyhedron , we exclude the points which have more coordinates equal to than a generic point of does, i.e. the points on the “faces at infinity” of .
2.1. Valuated matroids and matroid polytopes
A valuated matroid on the ground set , whose rank is an integer with , is a vector in whose coordinates are labeled by satisfying the tropical Plücker relations: for any sets and , there is more than one index at which attains its minimal value.
Given a valuated matroid , the set of all such that is finite is the set of bases of a matroid, called the matroid underlying . Following the notation used in [5], we write for the matroid underlying . For a matroid we write for the set of bases of . In this work we often look at matroids (cryptomorphically) as the special case of valuated matroids that only have [math] and coordinates: that is, if and otherwise.
For a subset of we write for the rank of in , for its closure, for the restriction of to , for the contraction of in , and for the deletion of in . We write for the dual of , for the lattice of flats of , and for the lattice of cyclic flats, i.e. if and only if and . A cyclic set of is the complement of a flat of , equivalently a union of zero or more circuits of . The coclosure of is the largest cyclic set contained in , in other words, . The corank of is . We write for the direct sum of and .
The matroid polytope of is
[TABLE]
The dimension of is equal to minus the number of connected components of . For any the intersection of with the hyperplane is a face of and it is the polytope of the matroid . Any facet of which intersects the interior of is of this form for a cyclic flat , and all the other facets are also of this form for some singleton .
A valuated matroid with underlying matroid can be regarded as a height function on the vertices of the polytope . Such a height function produces a regular subdivision of in the sense of [13, Definition 2.2.10]. A real-valued function from the vertices of is a matroid subdivision if and only if all the faces of the induced regular subdivision are matroid polytopes [45, Proposition 2.2]. A vector selects a face of the regular subdivision induced by by taking the convex hull of all vertices of such that is minimized. Such a face corresponds to the polytope of a matroid which we write known as the initial matroid of at . We write for the set of all initial matroids of all of whose loops are loops in .
Example 2.1**.**
Consider the uniform matroid . Its matroid polytope is the hypersimplex which is an octahedron. Now consider the valuated matroid where and for every . The matroid subdivision induced by divides the octahedron into two square pyramids, one with apex and the other one with apex . The only that selects the pyramid with apex is while the only that selects the pyramid with apex is . The initial matroids contained in are those whose polytopes are the two square pyramids, their common square face, and four of the triangular faces, namely and its -images.
2.2. Tropical linear spaces
The (projective) tropical linear space associated to a valuated matroid is
[TABLE]
We call a tropical hyperplane if has rank .
We describe the polyhedral structure of a tropical linear space using the language of matroids. For simplicity, we assume throughout that has no loops or coloops. Define
[TABLE]
We have that is the closure of within , where the closure operation only adds points with infinite coordinates ([45, Prop 2.3]; implicit in [28]). The complex is pure of dimension . The polyhedral complex structure of is determined by the faces in : the interiors of these faces are the sets of points such that the matroid is constant. For a matroid , we write for its corresponding cell, that is:
[TABLE]
where is the set of all nonloops of and is the inclusion filling in infinities in the missing coordinates. When this cell is 0-dimensional, i.e. when is connected, we call it (pedantically, is the point which is the single element of ).
Example 2.2**.**
Consider the valuated matroid from Example 2.1. The polytopes in the subdivision induced by that correspond to loopless matroids are the two square pyramids, the square separating the pyramids and the four triangles which are inside each of the hyperplanes for . Figure 1 shows a picture of the associated linear space.
If is a matroid, the polyhedral complex structure we have just placed on the tropical linear space is the Bergman fan as in [19], with the ‘coarse subdivision’ as in [4].
We will use a construction of the set in terms of flats throughout.
Proposition 2.3** ([30], Theorem 4.2.6).**
Let be a matroid with no loops. Then
[TABLE]
The above shows that, as a set, the Bergman fan is the order complex of the lattice of flats, which endows the Bergman fan with its ‘fine subdivision’ structure, also known as the nested set complex of .
If is a tropical linear space and is in the relative interior of , then equals the set of vectors such that for all sufficiently small . That is, looks like the translation locally near .
Valuated matroids have analogs of dual, restriction and contraction. The dual of is the valuated matroid of rank given by . Notice that . Let be an arbitrary subset of and any basis of . Then the restriction of to is the valuated matroid on the ground set of rank such that for any . This definition does not depend on the choice of , as choosing a different basis means tropically scaling all Plücker coordinates by the same factor. In particular . The contraction of in can be defined as .
Lemma 4.1.11 of [21] describes the effects of deletion and contraction on . Given a subset we have that
[TABLE]
where is the extension of by setting the coordinates indexed by to be . Let and let be the projection of to the coordinates indexed by . Then
[TABLE]
3. Transversality
We recommend [9] as a general reference for transversal matroids.
3.1. The tropical Stiefel map
The fibers of the following map are our main subject.
Definition 3.1** ([20]).**
Let be a tropical matrix. The tropical Stiefel map is the partial function assigning to the valuated matroid [36, Example 5.2.3] defined by
[TABLE]
The minimum on the right hand side of this equation, over the allocations of the names to the elements of , is a tropical maximal minor of . The history of the connection between transversals and determinants goes back at least to [17].
Remark 3.2*.*
The domain of is the subset of where at least one injective function achieves for all . By Hall’s theorem, the only matrices excluded from the domain are those that have a submatrix all of whose entries are for some .
Example 3.3**.**
Consider the matrix
[TABLE]
in . Computing the tropical minors gives for any and , which is the same valuated matroid as in Examples 2.1 and 2.2. Notice that replacing either or (but not both at the same time) by any tropical number larger than 0 does not change any of the minors, so the resulting matrix would be mapped to the same valuated matroid. Similarly, replacing either or by a number larger than also does not change . Figure 1 shows the tropical linear space of . Any matrix with must have one row giving projective coordinates for a point in the blue subcomplex of the figure, and the other row doing the same for the red subcomplex. Later, we will show how all fibers of have a similar behavior.
Permuting the rows of , or adding a scalar to any row, does not change , and therefore neither does left multiplication by any invertible tropical matrix. The first invariance implies that is determined by the list of the projectivization (lying in ) of each row of , and the second invariance means that is determined by the unordered list, i.e. the multiset, of these projectivizations. So we will normally discuss fibers of in terms of such multisets.
Definition 3.4**.**
A (transversal) presentation of a valuated matroid of rank is a multiset of points in such that , where is a matrix whose rows are coordinate vectors for the elements of .
If we say that a multiset is a presentation of a tropical linear space , we mean that it is a presentation of .
The tropical Stiefel map is not surjective onto the space of valuated matroids. In [20] the name Stiefel tropical linear space was given to tropical linear spaces of the form . We grant the valuated matroids another name motivated in what follows:
Definition 3.5**.**
A valuated matroid is transversal if it is in the image of . An unvaluated matroid is transversal if it is the underlying matroid of a transversal valuated matroid.
Note that a transversal valuated matroid is not merely an arbitrary valuated matroid whose underlying matroid is transversal. A counterexample is the valuated matroid of Figure 2, whose underlying matroid is the transversal matroid , but which is not transversal itself as explained in Example 3.10.
Let us understand why Definition 3.5 agrees with the classical definition of a transversal matroid. Classically, a set system presentation of a transversal matroid on is a multiset of subsets of . A set is independent if there is a matching i.e. is independent if there is an injective function such that for every .
Such a set system presentation can be turned into a presentation in our sense by replacing each element by where
[TABLE]
In the corresponding -matrix , we have that if there is matching from and otherwise. Conversely, given a transversal valuated matroid , the multiset consisting of the set of finite entries of each row of is a presentation of .
We caution readers of the literature on transversal matroids that most authors allow the set system presenting a rank matroid to contain more than sets. These authors would say that all our presentations are “of rank ”.
Here is a necessary condition for transversality of valuated matroids.
Proposition 3.6** (Fink, Rincón [20, Corollary 5.6]).**
Let be a transversal valuated matroid. Then every matroid such that is a facet of is transversal.
In Theorem 6.20 we show that this condition is also sufficient.
3.2. The set of presentations of a matroid
Given a set system presentation of , we have that is a flat of for every (this follows, for example, from Lemma 4.1). So, to characterize the presentations of is to determine when a multiset of flats of constitutes the complements of a presentation of . This problem was solved by Brualdi and Dinolt [10] who proved that every transversal matroid has a unique maximal presentation and showed how to derive all other presentations from it. To describe the unique maximal presentation they use an algorithm which we now discuss.
Let be the Möbius function on the lattice of cyclic flats . For define
[TABLE]
If is non-negative, we can consider the multiset of cyclic flats where each has multiplicity . Brualdi calls this the distinguished family of cyclic flats [9, p. 77].
Proposition 3.7** (Brualdi and Dinolt [10],, Theorem 4.7).**
Let be a transversal matroid. Then is non-negative, and the complements of the distinguished family of cyclic flats make up the unique maximal presentation of . Moreover, is a presentation if and only if the complements are flats such that
[TABLE]
and for every
[TABLE]
At the heart of this paper is the idea of generalizing the above result to valuated matroids.
The literature contains several statements similar or equivalent to the above. Below we describe another reformulation of Proposition 3.7 as a precise bijection between integer vectors and presentations. See Bonin [7] for more detail on the equivalence.
Proposition 3.8**.**
Let be a matroid, and . Then has a transversal presentation consisting of copies of for each if and only if satisfies the following inequalities:
[TABLE]
Notice that if is a transversal matroid, extending to be 0 for every non-cyclic flat yields a solution of the integer program in Proposition 3.8. This is the minimal such function in the following sense: if is a solution of this system for some matroid , then by Proposition 3.7 we have that for every
[TABLE]
Testing if is transversal can be done by checking whether (as defined in Equation 3.2) satisfies inequalities (3.3) and (3.4). Another test for transversality, Proposition 6.8, was provided by Mason and Ingleton.
The above discussion shows that every set system presentation of can be obtained from the maximal presentation by replacing some elements with where . Therefore, every set system presentation of is obtained from the maximal presentation by adding relative coloops to the flats chosen.
Example 3.9**.**
The work [20] focuses on presentations of valuated matroids with no , which it represents as matrices like in Definition 3.4.
The underlying matroid of any such is the uniform matroid , the matroid with . The only cyclic flats of are and , so we get (as is the case for all matroids) and . Hence the maximal presentation of is .
The non-cyclic flats of are all sets such that . Inequality (3.4) says that for any with , there cannot be more than sets among the complements of a presentation of that are supersets of or equal to . Because a proper flat of has at most elements, the case of the last sentence is true as well. Proposition 3.8 says that any set system of sets satisfying these conditions is a presentation of . After translating to matrices via equation (3.1), this is the statement (c)(d) of [20, Proposition 8]. The reader may check that when one recovers Philip Hall’s marriage theorem, and when , the dragon marriage theorem of Postnikov [38].
Example 3.10**.**
Consider the matroid on 6 elements of rank 2 given by . For to have a transversal presentation, would have to satisfy , as all of the sets , , are cyclic flats of corank . But this means that , which is a violation of condition (3.5). In consequence, no valuated matroid such that can be in the image of the Stiefel map.
Similar reasoning shows that no rank 2 matroid with three or more nontrivial parallel classes has a transversal presentation. The non-transversality of a valuated matroid can be seen in the geometry of the corresponding linear space. For example, the tropical linear space in Figure 2 has a vertex incident to 3 bounded edges. This vertex corresponds to the non-transversal matroid and each bounded edge corresponds to one of its non trivial cyclic flats. This provides one proof that the tree formed by the bounded faces of a Stiefel tropical linear space of rank is a path.
3.3. Additional remarks
Remark 3.11*.*
The image of is always contained in the tropical Grassmannian , the tropicalization of the Grassmannian over a field in its Plücker embedding [43]. The matroid of Example 3.10 lies in the tropical Grassmannian for any field, so does not surject onto .
Remark 3.12*.*
A family of presentations that have been the focus of much previous work are the pointed presentations, where has a tropical identity matrix as a maximal submatrix [24, 41, 27]. The unvaluated matroids with pointed presentations are called fundamental transversal matroids [7, Section 3.1] (see also [6, 39]); by Proposition 4.8, these presentations can be taken to be by matrices. If has a pointed presentation , then all facets of share the vertex where is the identity submatrix. The converse is false: for example, non-fundamental transversal matroids exist, and for these has only one facet. In other words, whereas the Grassmannian over a field has an atlas of charts isomorphic to , one for each position of the identity submatrix, the corresponding maps from fail even to cover the image of .
Remark 3.13*.*
If and are valuated matroids on of respective ranks and , their stable sum is the valuated matroid of rank defined by
[TABLE]
for each , provided that for some . Stable sum generalizes matroid union in the special case that the matroid union is additive in rank, for which reason Frenk [21, Section 4.1] calls it the “valuated matroid union”. In this language, presentations are decompositions of a valuated matroid as a stable sum of rank 1 valuated matroids.
Remark 3.14*.*
A way of looking at the tropical Stiefel map which we do not take up here is in terms of the semimodule theory of . This viewpoint is adopted in [12], and is generalized in [34] to the valuated version of Perfect’s “induction” of a matroid across a directed graph [37].
4. Characterizing presentations by regions
In this section, we characterize presentations of a valuated matroid in terms of bounds on the number of points which may lie in certain regions of .
We start by noting that the search for transversal presentations of a tropical linear space is helpfully delimited by the fact that all elements of a presentation must lie in . This is essentially the tropical Cramer rule [2, 40], but the proof is short so we include it for convenience.
Lemma 4.1**.**
Let be a transversal presentation of a valuated matroid . Then for each .
Proof.
Write the presentation as a matrix . Define an expanded matrix whose first rows agree with and whose st row equals its th row. Given a set , let be a transversal from to in so that is minimal. By construction of , swapping the th and th entries of the transversal preserves this sum. This implies that both and minimize the quantity , because in each case is the sum of the matrix entries in the transversal other than the entry in the th row, which contributes . Therefore the tropical equations in the definition of hold at . ∎
Our next step is to generalize Proposition 3.8, which characterizes set system presentations of matroids, to describe presentations of unvaluated matroids by points with unrestricted tropical coordinates. In this case, the regions we invoke can be seen as generalizing the ranges of summation in inequalities (3.4) and (3.5).
For that purpose we define relative support. This is essentially the same notion as covectors in the theory of tropical hyperplane arrangements [3, Section 3]. The covector of a point is the list of complements of its relative supports with respect to the apex of each tropical hyperplane.
Definition 4.2**.**
Let and be two points in such that has finite coordinates. The relative support of with respect to is the set indexing the coordinates where does not attain its minimum.
Note that addition of a scalar multiple of to the coordinates of a point does not affect its relative support, so the relative support is well defined. If has a fixed vector of affine coordinates , then we say that the supportive choice of affine coordinates for , with respect to , is the one which achieves . In terms of supportive coordinates, Definition 4.2 becomes
[TABLE]
Let where is a matroid of rank on . By definition of , we have that for every . So for each flat we define the region
[TABLE]
In supportive coordinates with respect to the zero vector, consists of all the points which have positive entries in the coordinates indexed by . Similarly, for each cyclic flat we define another region
[TABLE]
In other words, consists of all points in where no coordinate of in achieves the minimum among its coordinates and are those points in whose coordinates in are . Clearly . Given a multiset of points in , , we define the numbers
[TABLE]
where is a flat in the first line, and a cyclic flat in the second.
Proposition 4.3**.**
Let be a transversal matroid, and . Then is a presentation of if and only if the following conditions hold:
- (1)
. 2. (2)
.
Proof.
Let be the matrix whose rows are the supportive coordinates for with respect to 0, so all entries are nonnegative and each row contains a zero. First we assume that is a presentation of , that is . Let and suppose that condition (1) is not satisfied for . Let . Let such that . There are rows with positive coordinates in all of the columns indexed by . This means that in the square submatrix given by the columns of , there is a submatrix whose entries are all positive. Then the tropical minor corresponding to must be positive, which is a contradiction as .
Now suppose there is a cyclic flat that violates condition (2). As we already proved condition (1) is satisfied, we can assume . Then there are rows with finite entries in the columns corresponding to . Assume there is a matching of the submatrix of with these rows. Then any matching of the whole matrix can be used to get a matching that uses the columns of in all of those rows by exchanging the entries. This is a contradiction to the rank of ; so no such matching exists, and there must be a violation of Hall’s condition. Let be the violating subset of rows of size , so that there are at most columns with which elements of can be matched. Let be one of those columns. Because is cyclic there should be a matching of rows to . So there is a row corresponding to a point in which is not used in this matching. Then has access to at most columns of , which is a contradiction to the matching.
We now do the other direction. Assume conditions (1) and (2) are satisfied. Because , we have . Consider the initial matroid , that is, the matroid whose bases are given by the entries where is [math]. This is transversal, and Condition (1) implies that all independent sets in are also independent sets in (see Lemma 4.4 in [10]). This means that for each there is a matching on the 0 entries of , so that .
Now let . Then there exists of rank such that . By condition (2) there are rows with infinity entries at the columns of . This means that in the square submatrix of with columns indexed by , there is a submatrix with all entries infinity. So . Altogether, this shows . ∎
We now turn our attention to the more general case where is any valuated matroid. When we look at general tropical linear spaces, we have to define the regions and more carefully. They will now have three parameters: the tropical linear space , a point with finite coordinates and a flat such that the relative interior of contains . Before we define these regions, we provide the following lemma which explains why it still makes sense to take flats as parameters.
Proposition 4.4**.**
Let be a tropical linear space, and be a point in the relative interior of . Then for any .
Proof.
Notice that being in the relative interior of already implies that has finite coordinates, so it makes sense to talk about . Without loss of generality we can translate so that is the origin. In this case, we may assume that if and only if . Now suppose that there exists such that . This means there is an element such that . Let be such that . Then , and for any . By the tropical Plücker equation corresponding to , the minimum in
[TABLE]
is achieved twice. We have that . But for any other , if then and if then . So the minimum is only attained once, which is a contradiction. ∎
Given a tropical linear space , a matroid , a flat and a point , we define two regions, which we will use to constrain the possible position of points in presentations. Let
[TABLE]
and, whenever ,
[TABLE]
See Example 4.13 for examples of these definitions.
Lemma 4.5**.**
Let be a matroid. Then
- (1)
** 2. (2)
**
where and are the regions defined earlier.
Proof.
The first equivalence is straight forward from the definitions of and . To see that note that , so every has positive entries in when written in supportive coordinates with respect to [math]. Any must have coordinates larger than in when written in supportive coordinates with respect to the [math]. As is an open cone, can have arbitrarily large coordinates in and any must have infinite entries at , so . But clearly also for every , so the equality holds. ∎
Given a multiset of points in we can define as in the unsubdivided case. For ,
[TABLE]
where is a flat of in the first line, and a cyclic flat of in the second. The following lemma shows that and for every vertex of .
Lemma 4.6**.**
Let be a connected matroid, and . Then .
Proof.
If , then is of the form for a flag containing and such that for every ; the are finite because we have excluded faces at infinity from the relative interior. This is the same form as points have in the cone of the Bergman fan of . This means in particular that for any and we have when written in the supportive coordinates with respect to (fixed coordinates for) . So if , then there is a such that . For every it follows that , and , so which means that . ∎
The following definition helps us use the Bergman fan case for the more general setting of tropical linear spaces.
Definition 4.7**.**
Let be a tropical linear space, and . The zoom map of to is the map such that
[TABLE]
We think of as ‘zooming’ into , pushing all points of away from to infinity in a straight line. Thus, keeps only local information of around .
Proposition 4.8**.**
Let be a coloop-free matroid, not necessarily connected, and let be a point in the relative interior of . Suppose is a presentation of . Then is a presentation of , i.e. is a set system presentation of .
The corresponding arguments in [20] are Propositions 5.5 and 5.9.
Proof.
Let be the matrix whose th row consists of written in supportive coordinates with respect to . Notice that the scaling of rows in the matrix does not change and adding the vector to each of the rows of , changes by adding . This implies that if and only if . So we have that equals , the tropical linear space translated so that is at the origin.
Tropically exponentiating (i.e. classically multiplying) each entry of by transforms by a classical homothety centered at the origin of factor , so . When , we have that where is the matrix where the row is given by . Since tropical linear spaces are locally fans, we have that as , goes to the fan with which coincides near the origin. This is the same fan whose translation by coincides with near , namely , since . Because is a continuous map in its domain, these two limits imply that as long as is still in the domain of . So the only thing left to prove is that this is the case, namely, that there is a set for which .
If there were no maximal minor of equal to [math], then there would be an submatrix of consisting of strictly positive entries such that . Among such matrices select one where is maximal, i.e. with the most columns. Let be the set of rows taken by and be the set of columns not taken by . Notice that . Consider a bipartite graph whose vertices are and containing the edge just if . If is disconnected, then there is a connected component with vertices and with . So the submatrix of given by rows and columns is strictly positive and has more columns than , which is a contradiction. So is connected.
Let . As has no coloops, then there is a basis such that . Because , then is minimal among all maximal minors of . The value of is achieved by a matching . All matching must use an entry of , because implies that the total number of columns and rows of not included in is less than . So there is an element such that . Let be the graph where you add to the vertex and the edge . As is connected, then there is a path from to . The matching given by does not use consecutive edges. By replacing each edge used by in by the edge that follows it, we get a matching from to . But the weight of this matching is less than that of as we replaced a strictly positive entry by zero. This contradicts the minimality of . ∎
Example 4.9**.**
Let be the valuated matroid of rank on 5 elements such that , , and for any other than these two. Notice that the rows of the matrix
[TABLE]
form a presentation of , that is . Let be the second row of . The matroid is such that . (See also Figure 3, where the same matroid appears as .) We have that
[TABLE]
It is straightforward to check that the collection of flats satisfy the conditions of Proposition 3.7, so their complements are a set system presentation of . In other words, the rows of the matrix
[TABLE]
form a presentation of .
We will need the following lemma.
Lemma 4.10**.**
Let be a coloop-free matroid and let lie in a coloop-free face . For we have that
[TABLE]
Proof.
A point satisfies if and only if for every . By definition of the zoom map , this happens if and only if for every , which is equivalent to . ∎
Proposition 4.11**.**
Let be a presentation of . Then for any coloop-free matroid and we have that for , with equality if .
Proof.
By Proposition 4.8 we have that is a presentation of . Then by Proposition 4.3 there are at most elements of in . By Lemma 4.10,
[TABLE]
so there are at most elements of in . If then there are exactly elements of in so there are exactly elements of in . ∎
Theorem 4.12**.**
Let be a tropical linear space and . Then is a presentation of if and only if for every connected matroid the following hold:
- (1)
* for all ; and* 2. (2)
* for all .*
Proof.
Let be a presentation of a tropical linear space . Applying Proposition 4.11 for every vertex of gives us condition (1). For any connected matroid and every , by Lemma 4.10 we have that there are exactly elements of in . If condition (2) is not satisfied, it means that one of those points is in . Let be that point.
Then there exists such that . From we see that is coloop-free and , so by Proposition 4.11 we have that . Notice also that . However by Lemma 4.6 we have that so
[TABLE]
which is a contradiction.
Conversely, suppose satisfies conditions (1) and (2). Let be the matrix which has as its rows, so what we have to prove is that . For any connected matroid , we have that satisfies (1) and (2) for , so it is a presentation of . By adding to each element of we get a presentation of . The matrix we obtain by concatenating all of these presentations coincides in its finite entries with . As the finite Plücker coordinates of agree with up to adding a scalar, the difference between any pair of Plücker coordinates of both indexed by elements of has the value called for by . Because the incidence graph of edges and maximal cells in is connected, we conclude that all finite Plücker coordinates of agree with up to a single global scalar.
Let be a nonbasis of . Consider a facet of such that fails to satisfy its defining inequality. Let be one of the maximal cells of which have a facet contained in , and let be the cyclic flat that defines that facet. Then . As the polytope of is in the boundary of , we have for all . This implies that points in have entries in the coordinates corresponding to . Because of (2) for and , there are elements of in . So at most of the rows of contain a finite entry in a column indexed by . This is a violation of Hall’s condition, so there is no matching for using finite entries of . So . ∎
Example 4.13**.**
Consider the tropical linear space from Example 2.1. There are two connected matroids in , namely whose vertex in is with bases and whose vertex in is with bases . Since , the conditions imposed by Theorem 4.12 for are trivial. We name the 4 rays in :
[TABLE]
We have
[TABLE]
Condition (2) of Theorem 4.12 says that any presentation has exactly one point in (the blue region in Figure 1) and exactly one point in (the red region in Figure 1), just as we said in Example 2.1. Condition (1) says that there is at most one point in for every , and at most one point in and in , but in this case this follows from condition (2).
We end this section by using the previous theorem to understand how presentations behave under contractions.
Proposition 4.14**.**
Let be a presentation of and a cyclic flat of rank . Then there are exactly points in all of whose coordinates indexed by elements of are . The projection of these points to the coordinates form a presentation of .
Proof.
As , there are coloop-free matroids in such that their polytopes are contained in the hyperplane
[TABLE]
Condition (2) of Theorem 4.12 applied to any of these matroids implies that there are exactly points of with in the coordinates, because the cells of corresponding to these cells extend to infinity in the direction. Let be the multiset of those points.
For every coloop-free matroid in there is a coloop-free matroid such that and . In particular, . For every point there is a point which coincides with in the coordinates and is arbitrarily large in the coordinates. For such points and for any flat we have that
[TABLE]
where again means the inclusion which sets the coordinates to . As the lattice of flats of is isomorphic to the interval above in lattice of flats of , the conditions that Theorem 4.12 imposes on when applied to are exactly the same as its conditions for presentations of . ∎
5. Matroid valuations
We will make use of the notion of matroid valuation, not to be confused with valuated matroids. This unfortunate similitude in names comes from the word “valuation” having pre-existing use in two different areas, respectively measure theory and algebra.
Given a polyhedron , let be its indicator function, defined by
[TABLE]
Definition 5.1**.**
Let be an abelian group, and a function of a matroid taking values in . We say that is a (matroid) valuation if, whenever are matroids and integers such that
[TABLE]
it also holds that
[TABLE]
For a general reference on matroid valuations, see [14]. We recount a few basic properties here. First, linear combinations of matroid valuations are again matroid valuations.
Example 5.2**.**
Suppose a matroid polytope has a subdivision into a collection of other matroid polytopes : e.g. the regular subdivision of a valuated matroid defined in Section 2.1 is of this form. Then by inclusion-exclusion,
[TABLE]
Each nonempty intersection is a matroid polytope, so discarding the terms with empty intersection gives a relation of form (5.1). Therefore such a subdivision of provides an “inclusion-exclusion” linear relation that a matroid valuation must satisfy.
Lemma 5.3**.**
Let be a chain of subsets of , and nonnegative integers. Let be the -valued matroid function which takes value 1 on if each is a cyclic flat of with and 0 otherwise. Then is a matroid valuation.
Proof.
The matroid function which takes value 1 on if for each , and 0 otherwise, is known to be a matroid valuation [14, Proposition 5.3]. So to prove the lemma it will suffice to write as a linear combination of functions .
A set is a cyclic flat of if and only if there is no such that and no such that . If , then the assertion is equivalent to for each . Therefore the indicator function of the predication “ is a flat of rank ”, i.e. “ and there is no such that ”, can be written by inclusion-exclusion as
[TABLE]
Repeating the same argument in the dual allows (where the two indices are lists of length one) to be written as an alternating sum of terms . We thus have
[TABLE]
where the sum is over choices of sets and for each .
Submodularity implies that if for some , then also for every disjoint from . Therefore, for any term of (5.2) in which for some , with , inserting into or removing it from gives another term which is equal with opposite sign. So we may cancel these terms, and by repeating the argument in the dual we may impose on the index set of the sum (5.2) the further conditions and . We have furthermore that any term with is zero, because if , submodularity is violated at and . Thus we can impose the condition on (5.2) as well. Under this condition all the sets in the indices form a single chain and we have
[TABLE]
which is a valuation. It follows that is a valuation. ∎
Recall the function defined in Equation 3.2.
Lemma 5.4**.**
The function is a matroid valuation.
Proof.
By Philip Hall’s theorem, the Möbius function is a sum over the chains of cyclic flats from to in , with a chain of length weighted . Therefore can be written as a linear combination of the running over all chains of sets and all tuples , the coefficient of being . By Lemma 5.3, we conclude that is a valuation. ∎
6. The presentation space
The goal of this section is to describe the set of all presentations of a given valuated matroid (Theorem 6.6). The techniques of the proof will give us further results such as Theorem 6.20, the converse of Proposition 3.6: if all facets of a regular subdivision correspond to transversal matroids, then the subdivision defines a transversal valuated matroid.
6.1. Distinguished matroids and apices
We say that has transversal facets if all of its facets correspond to polytopes of transversal matroids. So Proposition 3.6 says that transversal valuated matroids have transversal facets. Define
[TABLE]
All of the matroids in this set index cells of .
Definition 6.1**.**
Let be a valuated matroid with transversal facets. The distinguished multiset of matroids of contains each matroid with multiplicity . For any connected matroid with , let be the point in whose coordinate vector extends by setting the coordinates corresponding to to be . The distinguished multiset of apices of consists of for every , with the same multiplicities.
If has transversal facets, then all elements of are transversal, because contraction of cyclic flats preserves transversality. To see this, notice that if the cyclic flats of are exactly sets of the form where is a cyclic flat of containing . So if is the maximal presentation of , the multiset of all elements of that are disjoint of is the maximal presentation of by Proposition 3.8. Therefore only takes non-negative values for any .
Proposition 6.2**.**
Let be a valuated matroid of rank with transversal facets. Then .
Proof.
Let us write for the total number of matroids from that appear in , counted with multiplicities:
[TABLE]
If is disconnected then . So we may freely change the coefficient of disconnected matroids in the above sum. In particular
[TABLE]
where are the polytopes of the connected matroids in , and
[TABLE]
The key fact being used is that if equals some then . Equation (6.1) gives a case of Example 5.2 which we may apply Lemma 5.4 to and conclude that .
To finish, if is a distinguished cyclic flat of , we observe that , which is its multiplicity as a distinguished cyclic flat of . So the total number of distinguished matroids of , counted with multiplicity, equals the number of distinguished cyclic flats of , which is exactly . ∎
Definition 6.3**.**
Let be a transversal matroid and let . The presentation fan of consists of all tuples of points such that are independent flats and there is a presentation of such that for . If is a valuated matroid with transversal facets and , then for every we define
[TABLE]
Finally we define the presentation space of to be the orbit of
[TABLE]
under the action of by permuting points.
In the product is only taken once, regardless of the multiplicity of in ; multiplicities are already accounted for in the definition of . Notice that and therefore are invariant under the action, and is invariant under the action.
Example 6.4**.**
Recall the valuated matroid from Examples 2.1, 2.2, 3.3 and 4.13 with connected matroids . We have that and so and . The distinguished apices are . The presentation fan consists of two rays, one in direction and the other in direction while has its rays going in direction and . Figure 1 shows in blue and in red. The presentation space consists of the orbit of the product of these fans: in other words,
[TABLE]
Example 6.5**.**
The uniform matroid is the unique rank matroid such that . The presentation fan of the uniform matroid is an -invariant subset of where if and only if for every non-empty subset ,
[TABLE]
The support of the -vectors within give the set system presentations from Example 3.9.
The reason for calling a presentation space is the following theorem.
Theorem 6.6**.**
Let be a transversal valuated matroid. Then is a presentation of if and only if .
In other words, the theorem asserts that equals the row-wise projectivization of . Notice that if is the Bergman fan of a matroid , then the distinguished set of apices consists of . So the distinguished set of apices are the valuated generalization of the unique maximal presentation of a transversal matroid.
We prove the two directions of the equivalence in Theorem 6.6 separately. The easier one is Proposition 6.7, below. The other direction is Theorem 6.19.
Proposition 6.7**.**
Let be a transversal valuated matroid. If is a presentation of then .
Proof.
Let be a presentation of and let . First assume . Then by Proposition 4.8 we have that is a presentation of .
By Proposition 4.3 (2) there are exactly points in a presentation of whose relative support with respect to [math] contains , for every . By definition of and the Möbius inversion formula, there are exactly points in such that the maximal cyclic flat contained in their relative support with respect to [math] is , i.e. points such that . Applying this to , we get that there are exactly points of whose relative support with respect to [math] is an independent set of . The tuple formed from the corresponding points in will then be in .
Now if is not in but in for some , then by Proposition 4.14 there is such that its projection to the coordinates is a presentation of . Then by the same argument as above, there are of those points in which proves the desired result as . ∎
6.2. Pseudopresentations
We recall the following characterization of transversal matroids in the form due to Ingleton [26]. Essentially the same characterization, but quantifying over all cyclic sets, was given earlier by Mason [32].
Proposition 6.8**.**
A matroid is transversal if and only if for every collection of cyclic flats the following inequality is satisfied:
[TABLE]
Notice that for , this is the submodularity axiom of the rank function. We also remark that on substituting in the above inequality, the terms cancel out, and therefore a formally identical inequality is true where is replaced by and by .
Definition 6.9**.**
Let be a transversal matroid of rank . We say that a collection of flats of is a pseudopresentation if
[TABLE]
To motivate this definition, note that it is a necessary condition for a presentation of that the complements of its members be a pseudopresentation (see Proposition 3.7).
Example 6.10**.**
Consider the uniform matroid with . The collection consisting of the flat with multiplicity is a pseudopresentation, because , matching the computation of from Example 3.9. However, the collection of complements of this collection is not a presentation of as it fails to meet the conditions of Proposition 3.7. In particular, the matroid with such presentation would have as a loop.
The following lemma says that if a pseudopresentation fails to be the complements of a presentation, then the failure is “local”, that is, there is a distinguished cyclic flat such that the which extend were poorly chosen. In other words, replacing every element in the pseudopresentation which does not extend by its coclosure does not yield a presentation either.
Lemma 6.11**.**
Let be a transversal matroid with and let be a pseudopresentation. Suppose that are not the complements of a presentation. Then there exists and , such that:
- •
* for every *
- •
* for every .*
- •
**
Proof.
Suppose that such does not exist but are not the complements of a presentation. Then there is a set of indices such that
[TABLE]
Let be the number of different elements of and without loss of generality let that set be . For let and let . The clearly partition so we have that
[TABLE]
Let . For any proper subset let
[TABLE]
and let . Notice that for any element , is a coloop of some , so in particular it is a coloop in . Therefore we have that
[TABLE]
Since the are pseudopresentation, we have that consists of plus (possibly) some coloops. Since , we have that
[TABLE]
As we assume is not a certificate as described in the lemma (as the tuple in the statement), we have that
[TABLE]
Now for any , let
[TABLE]
By inclusion-exclusion, we have that
[TABLE]
(The right hand side is counting the number of flats that contain and for some .) Now notice that
[TABLE]
and
[TABLE]
so
[TABLE]
Similarly as before, we assume the conditions of the lemma are not satisfied for , so
[TABLE]
Adding all bounds for the and using Proposition 6.8 we get:
[TABLE]
which is a contradiction, as we assumed . ∎
Example 6.12**.**
Consider , labelling the ground set so that is the sum of the matroid on and the matroid on . We have . The collection is a pseudopresentation of , since . However, it is not the set of complements of a presentation since they all intersect in which is not a loop. This failure to be a presentation is concentrated in the flats extending , so in terms of Lemma 6.11 we have , and .
6.3. Paths of points and flats
The two proofs in Section 6.4 are both arguments by contradiction establishing some property of all distinguished flats of coloopless matroids indexing a face in a tropical linear space . They proceed by reducing a counterexample to another counterexample for different and . In this subsection we introduce the reductions used and show that a sequence thereof must terminate.
Let be a tropical linear space such that has transversal facets. Let , and let be the matroid such that . Assume is coloopless. Let be a distinguished flat. Denote by the supporting hyperplane
[TABLE]
If then is not a hyperplane, but in this event we will not use .
Definition 6.13**.**
An ascendent step from is a triple satisfying conditions given as follows.
- (0)
If then there are no ascendent steps. 2. (1)
If and then the ascendent steps are the triples of form
[TABLE]
for some with . 3. (2)
If , and then the conditions on an ascendent step are as follows. As above, , where now is minimal such that . Then is in a cell which must be a proper face of . The flat must be such that is independent in . 4. (3)
If , and then there are no ascendent steps.
We know , so these cases are comprehensive.
Definition 6.14**.**
An ascendent path is a finite or infinite sequence of triples , , such that for each , either is the last term of the sequence or is an ascendent step from .
Let us give some intuition of what an ascendent path is. In each ascendent step, we go from the point in a colooples cell and start going in a straight line within in direction until we change the cell of where we are standing, so long as it is still is coloopless. If that change occurs immediately, that is, is of higher dimension than and is a face of , we keep going in the same direction (Case 1). If not, since is bounded because is coloopless, then that change occurs at a face of i.e. is a face of (Case 2). This is the opposite of the last case in that
[TABLE]
In this case we may choose a new direction, however with the restriction above which is equivalent that , that is, consists of coloops in . We repeat this until the direction is (Case 0) or we leave the bounded region of (Case 3). Again, what we will show for our later uses of this definitions, in Lemma 6.17, is that all ascendent paths terminate after finitely many steps (thus for example they cannot loop). The reason why we call the paths “ascendent” is Lemma 6.16.
Lemma 6.15**.**
Let be an ascendent path. Then, for any , is independent in .
Proof.
We use descending induction on . The base case is , where is empty and therefore independent in any matroid.
If then the ascendent step from belongs either to Case 1 or Case 2 of Definition 6.13. In Case 1, so
[TABLE]
which by induction hypothesis is independent in
[TABLE]
which is what is needed.
In Case 2, first notice that
[TABLE]
By definition of ascendent step, is independent in , so it is also independent in any restriction of that contains it, in particular in . By the induction hypothesis, consists of coloops of , so the set , being obtained by adding coloops to , is also independent in . But
[TABLE]
so is also independent in and hence in . ∎
Lemma 6.16**.**
Let be an infinite ascendent path. Then the sequence of is nondecreasing when written in supportive coordinates with respect to , i.e. for every , the -th coordinate of is a nondecreasing function of .
Proof.
For each we have that and thus
[TABLE]
in , for positive reals . Fix a coordinate vector for . The lemma is immediate once we show that is not the whole ground set , as this implies that (6.3) remains true when is given supportive coordinates with respect to , with for any . But this follows from Lemma 6.15. Indeed, cannot equal because if were independent in it would consist entirely of coloops in , but was assumed coloop-free. ∎
Lemma 6.17**.**
Infinite ascendent paths do not exist.
In particular, if is a set of triples such that for all , an ascendent step from is also in , then is empty.
Proof.
We argue that if is followed by an ascendent step of Case 1 in an ascendent path, then can never appear subsequently in the path. This proves the result, because has only finitely many initial matroids, and every step in Case 2 decreases the number of connected components of so an infinite sequence of just Case 2 steps can’t occur either.
By the assumption of Case 1, there exists such that . Suppose that appears subsequently in the path. We have , so . By Lemma 6.16, consists of plus possibly some other elements which by Lemma 6.15 are coloops of . As is an independent set in , we can extend it to a basis of . Since , we can arrange that contains elements of . Also, contains all of the coloops of . Extend further to a basis of containing . Since contains fewer than elements of , this construction arranges that is a strict superset of . By definition of relative support, this containment implies
[TABLE]
Since , we have that the basis causes to take its minimum value exactly when . In particular . Subtracting (6.4) gives , so cannot be a basis of , a contradiction.
The final claim is clear. ∎
6.4. Proof of Theorem 6.6
Throughout this subsection, let be a tropical linear space such that has transversal facets and let be its distinguished multiset of apices. Let and be such that, for each , lies in the cone with apex .
Proposition 6.18**.**
Under the assumptions of this subsection, for every coloop-free and , the multiset is a pseudopresentation of .
Proof.
Consider such for a coloopless . If is not a pseudopresentation then there is a flat such that
[TABLE]
We show that there is no such triple using Lemma 6.17, by either showing a contradiction directly or constructing an ascendent step that also satisfies (6.5). The proof is arranged according to the cases of Definition 6.13.
Case 0. If then so and the multiplicity of in is exactly . If is a distinguished apex with then by Definition 6.3 applied to , . So
[TABLE]
Case 1. Let be the ascendent step from . The lattice of flats of decomposes as where is isomorphic to the sublattice of below and is isomorphic to the sublattice above . In particular, . If there are points with , then those same apices satisfy and . So Equation 6.5 for implies Equation 6.5 for .
Case 2. Recall that in this case and are related by Equation 6.2. If , then contains exactly supersets (possibly not strict) of , which will also be in because the upper intervals above are identical in and . For a proper subset of , we have that
[TABLE]
To see this, compare the use of the recursion (3.2) to compute on the interval and on the interval . Note that these two intervals are isomorphic. The coranks in the latter interval exceed those in the former by ; this is accounted for by the distinguished flats of above . The other difference is the presence of flats not comparable with in . Because is a lattice, it contains a greatest lower bound of and , namely . This is the maximal element of contained in . Therefore, terms behave in the recursion as if they were terms , and this is the fact expressed by (6.6).
The case of Equation 6.6 means that if there are exactly elements such that is an independent set in . In particular, for every . Then any point that satisfies must satisfy . So again, Equation 6.5 for implies that there is an such that Equation 6.5 holds for the ascendent step .
Case 3. In this case is in the boundary of and the affine span of contains . In particular is unbounded in the direction. But then is a coloopless matroid with , so is connected and consists of just a vertex with infinity in the coordinates corresponding to . In particular, the multiplicity of in is , i.e. holds for values of . By Definition 6.3 applied to , for each of these , so Equation 6.5 cannot hold. ∎
Theorem 6.19**.**
Under the assumptions of this subsection, is a presentation of .
Proof.
If is not a presentation of , then by Theorem 4.12 there exists where is a coloopless matroid such that is not a presentation. By Proposition 6.18, is indeed a pseudopresentation, so by Lemma 6.11 we know there is a flat , a set such that for every and distinguished flats such that for every and
[TABLE]
We now use Lemma 6.17, either directly showing a contradiction or constructing an ascendent step from that exhibits the same failure of presentation. Again, we break into the cases of Definition 6.13.
Case 0. If , contradiction is immediate because .
Case 1. For with small enough , we have that for any . Since for any set that contains we have that , we conclude that
[TABLE]
Case 2. Here, . For every , is a cyclic flat in . However, it may be the case that . This happens when there is a cyclic flat such that . In any case, we can find distinguished flats such that for every we have . Moreover, there are another distinguished flats such that for every . In total we have that
[TABLE]
Then is not a presentation of . So we can use Lemma 6.11 again to find and such that where the conditions for presentation fail.
The only thing left to prove is that is independent in , for to be indeed an ascendent step from . Notice that it follows from the proof of Lemma 6.11 that . Then for any we have that . As , then where it follows that is independent in .
Case 3. Notice that
[TABLE]
Then
[TABLE]
implies
[TABLE]
But this is a contradiction to the definition of , which says that there is a presentation of containing
[TABLE]
6.5. Further consequences
A corollary of the above results is the converse of Proposition 3.6.
Theorem 6.20**.**
A tropical linear space is in the Stiefel image if and only if all the facets in its dual subdivision are transversal.
Since the class of transversal matroids is closed under contractions of cyclic sets [8, Theorem 5.4] and arbitrary deletions, if is transversal then so is any initial matroid which has no new coloops. Thus Theorem 6.20 can be sloganized: transversality is a local property of a tropical linear space.
Corollary 6.21**.**
Let be a matroid and suppose has a regular subdivision such that all facets in the subdivision are transversal. Then is transversal.
Proof.
Let be a tropical linear space dual to such a regular subdivision. By Theorem 6.20, is in the Stiefel image so it has a presentation . Consider the matrix that replaces all finite entries of by 0. Then is the Bergman fan of , so is transversal. ∎
Example 6.22**.**
Let be the valuated matroid of Example 4.9: we recall that was of rank on 5 elements such that , , and for any other than these two. The three distinguished matroids , and of are shown in Figure 3. The respective distinguished apices of are , and . Figure 4 shows the presentation fan of each distinguished matroid: the fan from is the cone over the boundary of a square and the fan from is the cone over the boundary of a triangle, while the fan from is the single point . So any matrix must have one row in the red zone, another row in the blue zone and a third row lying exactly at the green point.
7. Strict gammoids and stable intersection
The first appearance of stable intersection of tropical varieties was as the fan displacement rule of Fulton and Sturmfels [22]. Speyer [45, Section 3] described the special case of stable intersection for tropical linear spaces in terms of Plücker coordinates.
Definition 7.1**.**
Let and be valuated matroids on of respective ranks and . Their stable intersection is the valuated matroid of rank defined by
[TABLE]
for each , provided that there exists some for which the above formula yields .
In particular, for such a valuated matroid to exist we must have . By comparing this definition to Remark 3.13, we see that stable intersection is dual to stable sum, in the sense that
[TABLE]
The linear space is contained inside but in general this containment can be strict (for example, whenever ).
In matroid theory, the dual of a transversal matroid is commonly known as a strict gammoid.
Definition 7.2**.**
Let be a directed graph with vertices and directed edges , and let be a subset of size . A linking from a set to is a collection of vertex-disjoint directed paths such that each path starts from a vertex in and ends in , and each vertex of is the start of exactly one path.
We allow a path to be zero edges long.
Proposition 7.3**.**
The collection of all sets of size such that there is a linking from to is the set of bases of a matroid. A matroid arises this way if and only if it is the dual of a transversal matroid.
The first sentence of Proposition 7.3 is due to Mason [31], the second to Ingleton and Piff [25].
Our work provides a valuated version of strict gammoids. We now describe these in terms of weighted directed graphs, akin to the graphs Speyer and Williams use to parametrize the tropical positive Grassmannian [44]. Consider a weighted directed graph with vertices and where is now a weight function which is [math] on the diagonal. The directed edges of the graph are exactly the pairs where takes finite value. Let be a subset of size . Given a linking from a set to , the weight of that linking is the sum of the weights of all of the edges used in that linking.
Proposition 7.4**.**
Let be a weighted directed graph with no negative cycles. Let be the vector such that for every subset , is the minimum weight among all linkings from to . Then is a valuated matroid. Moreover, a valuated matroid arises this way if and only if it is the dual of a transversal valuated matroid.
We call any such valuated matroid a valuated strict gammoid.
Proof.
Consider to be the matrix where the rows are indexed by and is the weight of the edge from to . In particular, is [math] for every . Let and consider the tropical minor of corresponding to the columns . A matching from those columns to the rows corresponds to picking edges such that every vertex in has exactly one edge coming in and all vertices in have exactly one edge coming out. Taken together this is exactly a linking from to plus possibly some cycles in . The value of the term of that matching in the corresponding tropical minor is equal to the weight of the linking plus the weights of the cycles. However, as there are no negative cycles, removing the cycles (choosing the matching where for every vertex in a cycle is matched with itself instead) the value of the corresponding term can only decrease. So the corresponding minor is equal to the minimum weight of a matching for to , that is, . This shows is exactly the dual of .
Now if is dual to a transversal valuated matroid with , to construct the corresponding weighted graph , let be any basis of and let be a matching that achieves the minimum of . Let be the weighted directed graph where for every there is an edge from to with weight . As achieves the minimum among matchings there cannot be any negative cycles in . So when the matrix is constructed from as described above, then is obtained from by subtracting from each entry of the row . In particular , so is the valuated matroid associated to . ∎
As a corollary from Theorem 6.20 and Proposition 7.4 we get the following.
Theorem 7.5**.**
Let be a valuated matroid. Then the following are equivalent:
- (1)
* is a valuated strict gammoid.* 2. (2)
* is the stable intersection of tropical hyperplanes.* 3. (3)
Every connected matroid in is a strict gammoid.
Furthermore, Theorem 6.6 explicitly describes the space of all -tuples of tropical hyperplanes whose stable intersection is and, through Proposition 7.4, all possible weighted directed graphs representing as a valuated strict gammoid.
Example 7.6**.**
Recall the snowflake tropical linear space from Example 3.10. As we said, is not a transversal valuated matroid; however, its dual is. Indeed, the following are all the connected matroids in :
[TABLE]
All of these are transversal. We have that
[TABLE]
so
[TABLE]
The presentation fan of is 3-dimensional for each . For , let be the closed cone containing the points such that for and for . The presentation fans are:
[TABLE]
So any presentation of is of the form with . Thus the snowflake is the stable intersection of the four tropical hyperplanes with apex for any such presentation. For example, the rows of the matrix
[TABLE]
form a presentation of . From this presentation, together with the matching , . and (as in the proof of Proposition 7.4), we obtain the weighted directed graph from Figure 5 representing .
Notice that given a valuated strict gammoid , collections of tropical hyperplanes whose stable intersection is together with a matching are in bijection with weighted directed graph representations of .
8. Other connections
8.1. Gammoids and maps
Among matroids, the class of gammoids is the minor-closure of either of the classes of valuated matroids or strict gammoids. So a class of valuated gammoids could be defined either as contractions of the transversal valuated matroids that are our main subject or as restrictions of the valuated strict gammoids of Section 7. Valuated gammoids are exactly the images of morphisms from free matroids in the sense of Frenk [21, §4.2], whose results are essentially a tropical formulation of earlier results from [29, 33, 35].
8.2. Tropical convexity
As explained in Section 1, the tropical Stiefel map is one tropical counterpart of the map from a matrix to its rowspace. A different counterpart is the set of all -linear combinations of a set of tropical vectors. This is known as the tropical cone. If the coefficients in the -linear combination are further restricted to sum to [math] (the multiplicative identity element), we get the tropical convex hull. Tropical cones and convex hulls have been intensely studied from many points of view [3, 15, 27, 1, 23, 42, 11].
Tropical cones are usually not tropical linear spaces at all: [46, Theorem 16] describes when they are. However, tropical linear spaces are tropically convex [15, Theorem 7]. Lemma 4.1 implies the following.
Corollary 8.1** ([20, Theorem 6.3]).**
The Stiefel tropical linear space contains the tropical cone .
Thus, the tropical Stiefel map provides a bridge between these two objects, by giving a tropical linear space containing a given tropical cone (Corollary 8.1). If the tropical cone is -dimensional and defined by points, then the tropical Stiefel map provides an -dimensional tropical linear space, which is smallest possible.
Every bounded cell of is contained in the tropical cone [20, Theorem 6.8]. More generally, contains the cells of dual to coloop-free matroids, which is exactly the bounded part of if .
8.3. Principal bundles
The Stiefel map was given the name “Stiefel” to reflect the fact that the space of tropical matrices maps to the space of valuated matroids just as the non-compact Stiefel manifold of matrices of rank maps to the Grassmannian of -planes in -space.
Theorem 6.6 mirrors the classical fact that the non-compact Stiefel manifold is a principal bundle over the Grassmannian, as we now explain. The only invertible matrices of tropical numbers are the generalized permutation matrices, those which have exactly one finite entry in every row and column, forming a group isomorphic to . Theorem 6.6 implies that the space of tropical matrices without too many infinities (Remark 3.2) has a deformation retract onto the Minkowski sum of the set of apices and the lineality space, which is a ramified bundle over its image. The ramification arises because an apex can have equal rows.
It remains an open question to describe the topology of the image of the tropical Stiefel map. The above bundle perspective suggests a possible approach.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Marianne Akian, Stephane Gaubert, and Alexander Guterman. Tropical polyhedra are equivalent to mean payoff games. International Journal of Algebra and Computation , 22(01):1250001, 2012.
- 2[2] Marianne Akian, Stéphane Gaubert, and Alexander Guterman. Tropical Cramer determinants revisited. Tropical and idempotent mathematics and applications , 616:1–45, 2014.
- 3[3] Federico Ardila and Mike Develin. Tropical hyperplane arrangements and oriented matroids. Mathematische Zeitschrift , 262(4):795–816, 2009.
- 4[4] Federico Ardila and Caroline J Klivans. The Bergman complex of a matroid and phylogenetic trees. Journal of Combinatorial Theory, Series B , 96(1):38–49, 2006.
- 5[5] Matthew Baker and Nathan Bowler. Matroids over partial hyperstructures. Adv. Math. , 343:821–863, 2019.
- 6[6] Robert E Bixby. A simple proof that every matroid is an intersection of fundamental transversal matroids. Discrete Mathematics , 18(3):311–312, 1977.
- 7[7] Joseph E Bonin. An introduction to transversal matroids, 2010.
- 8[8] Richard Brualdi and John Mason. Transversal matroids and Hall’s theorem. Pacific Journal of Mathematics , 41(3):601–613, 1972.
