🔢 mathematics

Totally Nonnegative Tropical Flags and the Totally Nonnegative Flag Dressian

This paper establishes that Lusztig's totally nonnegative complete flag variety is characterized by nonnegative Plücker coordinates and proves that, unlike their general counterparts, the totally nonnegative parts of the tropical complete flag variety and the complete flag Dressian coincide.

Original authors: Jonathan Boretsky

Published 2026-06-02

📖 5 min read🧠 Deep dive

CC BY 4.0

Original authors: Jonathan Boretsky

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine you are trying to organize a massive, chaotic library. You have thousands of books (mathematical objects), and you want to sort them into specific shelves based on strict rules. This paper is about two different ways of organizing these books: one way is the "real world" method, and the other is a "simplified, abstract" method called tropical geometry.

The author, Jonathan Boretsky, proves that when you look only at the "nice" books (those with positive or non-negative numbers), both organization methods actually result in the exact same shelf arrangement.

Here is a breakdown of the paper's journey using simple analogies:

1. The Library of Flags (The Flag Variety)

Think of a Flag Variety as a giant library where every "book" is a specific way of stacking layers of information.

The Analogy: Imagine a set of Russian nesting dolls. You have a tiny doll, inside a slightly bigger one, inside a bigger one, all the way up to the largest one.
The Rule: In a "complete flag," every layer must fit perfectly inside the next. The "Plücker coordinates" are like the labels on these dolls. They tell you exactly how the layers are sized and positioned.
The "Totally Nonnegative" Part: The author focuses only on the "nice" libraries where every label is a positive number (or zero). He proves a simple rule: If every label on your nesting dolls is positive, then your stack is a valid "nice" flag. Before this paper, it wasn't 100% clear if checking just the labels was enough to guarantee the whole stack was valid, but he proved it is.

2. The Tropical Version (The Tropical Flag Variety)

Now, imagine a simplified version of this library called Tropical Geometry.

The Analogy: In the real world, you add numbers (2 + 2 = 4). In the "Tropical" world, you replace addition with taking the minimum (like finding the shortest path) and multiplication with addition.
The Result: The complex, curvy shapes of the real library turn into rigid, blocky shapes made of straight lines and corners (polyhedral complexes). It's like turning a watercolor painting into a pixelated, blocky video game map.
The Two Maps:
1. The Tropical Flag Variety: This is the map of all "realizable" stacks. These are stacks that can actually be built from a real, physical matrix of numbers.
2. The Flag Dressian: This is a much larger map. It includes all "abstract" stacks that follow the rules of the blocky map, even if they can't be built from a real matrix.
The Problem: Usually, the "Abstract" map (Dressian) is much bigger than the "Realizable" map (Variety). There are many blocky shapes that look valid but can't be built in the real world.

3. The Big Discovery: They Match in the "Nice" Zone

The main point of the paper is a surprising coincidence.

The Analogy: Imagine you have a huge, messy parking lot (the Dressian) and a smaller, organized parking lot (the Variety). Usually, the messy lot has many spots that don't fit in the organized lot.
The Twist: The author looks specifically at the "VIP section" of the parking lot where all the cars are parked in a strictly positive, orderly way (the "Totally Nonnegative" part).
The Result: In this VIP section, the messy lot and the organized lot are identical. Every abstract blocky shape that looks "nice" (positive) can actually be built from a real matrix. The "impossible" abstract shapes disappear when you restrict yourself to the positive zone.

4. How He Proved It (The Graphical Map)

To prove this, the author used a clever tool called a graphical construction (a network of lines and dots).

The Analogy: Think of a subway map.
- Sources are the train stations at the top.
- Sinks are the stations at the bottom.
- Paths are the train routes.
The Method: He created a specific subway map for every possible "nice" flag. He showed that the "labels" (Plücker coordinates) on the flag are determined by counting the number of ways trains can travel from top to bottom without crashing into each other.
The Key Insight: He identified a special set of "extremal" labels (the most important ones). He proved that if you know these specific labels, you can mathematically calculate every other label on the flag using simple rules (like a recipe).
The Conclusion: Since the "extremal" labels determine everything else, and the rules for calculating them work the same way in both the real world and the tropical world, the two worlds must be the same in the positive zone.

Summary

The paper takes two very different mathematical worlds—one complex and real, the other simplified and abstract—and shows that when you restrict your view to "positive" numbers, they are actually the same thing.

Real World: "If all your labels are positive, your stack is valid."
Tropical World: "If your abstract blocky map is positive, it is actually buildable in the real world."

The author unites these two perspectives, proving that the "totally nonnegative" part of the tropical flag variety is exactly the same as the "totally nonnegative" part of the flag Dressian. It's a unification of two different ways of looking at the same mathematical structure.

Technical Summary: Totally Nonnegative Tropical Flags and the Totally Nonnegative Flag Dressian

Problem Statement
This paper investigates the relationship between two distinct mathematical frameworks applied to the complete flag variety: the theory of total nonnegativity and tropical geometry. Specifically, it addresses two primary questions:

Real Case: Can the totally nonnegative part of the complete flag variety, $Fl_n^{\ge 0}$ (defined as the closure of flags with totally positive representatives), be characterized simply as the set of flags where all Plücker coordinates are nonnegative? While this characterization is known for the Grassmannian, extending it to the complete flag variety is non-trivial due to the complex structure of flag minors.
Tropical Case: Do the totally nonnegative tropical complete flag variety ( $TrFl_n^{\ge 0}$ ), which parameterizes realizable flags of tropical linear spaces, and the totally nonnegative complete flag Dressian ( $FlDr_n^{\ge 0}$ ), which parameterizes abstract flags of tropical linear spaces, coincide? In general, the Dressian strictly contains the tropical variety; the paper seeks to determine if this containment collapses when restricted to the totally nonnegative (or positive) locus.

Methodology
The author employs a parallel approach, developing analogous results for the real flag variety and its tropicalization simultaneously. The methodology relies heavily on combinatorial structures and explicit parameterizations:

Marsh-Rietsch Parameterization: The paper utilizes the cell decomposition of $Fl_n^{\ge 0}$ introduced by Marsh and Rietsch. The variety is decomposed into cells $R_{v,w}^>$ indexed by pairs of permutations $v \le w$ in the Bruhat order. Each cell is parameterized by a map $\Phi_{v,w}$ involving products of elementary matrices $x_i(a)$ and permutation matrices $\dot{s}_i$ .
Graphical Models (LGV Construction): A central tool is the construction of a weighted directed graph $G_{v,w}$ associated with each cell. Using the Lindström-Gessel-Viennot (LGV) lemma, the Plücker coordinates of a flag in a cell are expressed as sums over non-intersecting path collections in $G_{v,w}$ . This provides a combinatorial interpretation of the parameterization.
Extremal Indices: The paper introduces the concept of "extremal non-zero Plücker coordinates." These are specific coordinates indexed by subsets of $[n]$ derived from the Gale minimal and maximal bases of the underlying flag matroid. The author defines a map $\Xi$ that iteratively exchanges elements in these indices to traverse the set of extremal indices.
Tropicalization: The tropicalization of the parameterization maps and the Plücker relations is analyzed. The paper demonstrates that the tropicalization of the Marsh-Rietsch parameterization yields a parameterization of the tropical cells, and that the tropical Plücker relations (specifically the three-term incidence relations) suffice to determine all coordinates from the extremal ones.

Key Contributions and Results

Characterization of the Totally Nonnegative Flag Variety:
The paper proves Theorem 6.24, stating that the totally nonnegative complete flag variety $Fl_n^{\ge 0}$ is exactly the set of flags $F \in Fl_n$ such that all Plücker coordinates $P_I(F)$ are nonnegative.
- Mechanism: The proof relies on showing that for any flag with nonnegative Plücker coordinates, the support of the flag (the set of non-zero coordinates) forms a "realizable flag positroid." The author then constructs a specific cell $R_{v,w}^>$ matching this support and demonstrates that the nonnegative coordinates uniquely determine the parameters of the Marsh-Rietsch parameterization via subtraction-free rational expressions (Laurent monomials) in the extremal coordinates.
Equivalence of Tropical Spaces:
The paper proves Theorem 6.24 $^{trop}$ , establishing that the totally nonnegative tropical complete flag variety $TrFl_n^{\ge 0}$ equals the totally nonnegative complete flag Dressian $FlDr_n^{\ge 0}$ .
- Mechanism: This result mirrors the real case. The author shows that any point in the nonnegative Dressian has a support corresponding to a realizable flag positroid. By applying the tropical inverse of the parameterization map (which involves sums and differences of extremal coordinates rather than products and quotients), one can reconstruct the tropical weights. The three-term tropical incidence Plücker relations are shown to uniquely determine all other coordinates from the extremal ones, proving that any solution to the Dressian relations is realizable.
Combinatorial Structure of Extremal Coordinates:
A significant portion of the work is dedicated to characterizing the "extremal" Plücker coordinates.
- Proposition 6.10: It is proven that for any cell $R_{v,w}^>$ , there is a unique non-intersecting path collection in $G_{v,w}$ for each extremal index, and this collection is the union of a diagonal path collection and a greedy path collection.
- Algebraic Independence: The paper establishes that the extremal non-zero Plücker coordinates (specifically a subset $S_{v,w}$ ) are algebraically independent and generate the other coordinates via subtraction-free rational expressions. This allows for the explicit inversion of the parameterization map $\Phi_{v,w}$ .

Significance and Claims
The paper claims to unify two perspectives on flag varieties: the geometric characterization of total nonnegativity and the combinatorial study of tropical varieties.

Unification: The primary significance lies in demonstrating that the "positivity" condition (nonnegative Plücker coordinates) is sufficient to characterize the totally nonnegative flag variety, just as it does for the Grassmannian. This resolves a question regarding the dependency of Plücker coordinates on the Marsh-Rietsch parameters.
Tropical Coincidence: The result that $TrFl_n^{\ge 0} = FlDr_n^{\ge 0}$ is presented as a generalization of the known result for the Grassmannian (where the positive tropical Grassmannian equals the positive Dressian). The paper emphasizes that while the Dressian generally contains non-realizable points, the totally nonnegative restriction forces realizability.
Methodological Insight: The author notes that the proofs for the real and tropical cases are "virtually identical," suggesting a deep structural parallel between the algebraic geometry of the flag variety and its tropical counterpart. The use of the Marsh-Rietsch parameterization and the graphical LGV construction provides a concrete, combinatorial mechanism for understanding these high-dimensional spaces.

The paper does not claim to solve the general problem of characterizing the flag variety for arbitrary rank sequences $r$ (beyond the complete flag), though it mentions in the introduction that a follow-up paper will extend these results to flags of consecutive ranks. The current work is strictly focused on the complete flag variety and its tropicalization.

1. The Library of Flags (The Flag Variety)

2. The Tropical Version (The Tropical Flag Variety)

3. The Big Discovery: They Match in the "Nice" Zone

4. How He Proved It (The Graphical Map)

Summary

More like this