arxiv: 2605.07645 · v1 · submitted 2026-05-08 · 🧮 math.AG

Recognition: 2 theorem links

· Lean Theorem

Root bounds of vertical systems using tropical geometry

Benjamin Schr\"oter, Elisenda Feliu, M\'at\'e L. Telek, Oskar Henriksson, Paul Alexander Helminck, Yue Ren

Pith reviewed 2026-05-11 01:58 UTC · model grok-4.3

classification 🧮 math.AG

keywords vertical polynomial systemstropical geometryroot countingmixed volumepositive real solutionschemical reaction networksmatroidssparse polynomials

0 comments

The pith

The generic number of complex zeros of an augmented vertically parametrized system equals the tropical intersection number of a tropical linear space and a classical linear space.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

Sparse polynomial systems with vertical coefficient dependencies arise in critical points of optimization problems and steady states of chemical reaction networks. The paper shows that augmenting these systems with linear forms makes their generic complex root count equal to the intersection number in tropical geometry between a tropical linear space and an ordinary linear space. When the matroid of the tropical linear space is cotransversal, the count reduces to a mixed volume. The results also include lower bounds on positive real roots from positive tropicalizations and simpler upper bounds when the positive roots admit toric structure.

Core claim

We prove that the generic number of complex zeros of an augmented vertically parametrized system is the tropical intersection number of a tropical linear space and a classical linear space. In the special case when the matroid of the tropical linear space is cotransversal, we express this number as a mixed volume. We also obtain bounds on the maximal number of positive zeros, which is often the significant number in applications, from the number of intersections between positive tropicalizations, and when the positive zeros have toric structure we provide upper bounds that are simpler and in some cases smaller than the generic root count.

What carries the argument

The tropical intersection number between the tropical linear space induced by the vertical parametrization (with its matroid) and the classical linear space coming from the linear augmentation.

If this is right

Exact generic complex root counts for systems describing optimization critical points and chemical reaction network steady states.
Mixed volume formulas for the root count whenever the matroid is cotransversal.
Lower bounds on the number of positive real solutions obtained from intersections of positive tropicalizations.
Simpler upper bounds on positive solutions when those solutions have toric structure, sometimes tighter than the generic count.
Practical algorithms, implemented in Julia, that compute these root bounds for applications.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

The same tropical intersection technique could be tested on non-vertical parametrizations to see whether similar exact counts emerge.
For large chemical networks the positive-root bounds may allow faster stability checks than full complex root enumeration.
Additional matroid properties beyond cotransversality might yield further explicit formulas for the intersection number.
Direct comparison of the tropical count against mixed-volume software on random vertical instances would confirm numerical agreement in low dimensions.

Load-bearing premise

The vertically parametrized system is generic and the linear augmentation preserves the tropical linear space structure that encodes the root count.

What would settle it

For a concrete generic augmented vertical system, compute the actual number of complex solutions by Gröbner basis or numerical homotopy continuation and check whether it equals the tropical intersection number; any mismatch disproves the claim.

Figures

Figures reproduced from arXiv: 2605.07645 by Benjamin Schr\"oter, Elisenda Feliu, M\'at\'e L. Telek, Oskar Henriksson, Paul Alexander Helminck, Yue Ren.

**Figure 1.** Figure 1: Schematic illustration of our root counting strategy. We first reembed the system as an intersection of a toric variety (blue) and a linear space (red) over the field K of complex Puiseux series. After tropicalization, roots can be counted using polyhedral geometry, and genericity can be certified by transversality. Here, we take a new and more elementary approach of computing root bounds using tropical ge… view at source ↗

**Figure 2.** Figure 2: Left figure: Trop(⟨x1 x2 − 1⟩) from Example 3.3, which coincides with Trop+(⟨x1 x2 − 1⟩). Right figure: Trop(⟨x1 + x2 − 1⟩) from Example 3.8, with only the two red thicker rays defining Trop+(⟨x1 + x2 − 1⟩). An important example that will play a key role later is the uniform matroid of rank k on [n], for which all subsets of [n] of size k + 1 are circuits. Equivalently, this is the matroid M∗ [A] for a mat… view at source ↗

**Figure 3.** Figure 3: The stable intersection Trop(⟨x1 x2 − 1⟩) ∧ Trop(⟨x1 + x2 − 1⟩) from Example 3.12 computed separately with the translations v1 = (0, −1) and v2 = (1, 1). The label of each intersection point is its multiplicity. For the translation vector v1, the sublattice index is 2. 3.4. Stable intersection. In this section, we consider the intersection of tropical varieties. We start by recalling that the intersection … view at source ↗

read the original abstract

Sparse polynomial systems with vertical coefficient dependencies arise naturally when describing the critical points of optimization problems and, when augmented with linear forms, the steady states of chemical reaction networks. Moreover, any polynomial system is the specialization of such a parametrized system. We prove that the generic number of complex zeros of an augmented vertically parametrized system is the tropical intersection number of a tropical linear space and a classical linear space. In the special case when the matroid of the tropical linear space is cotransversal, we express this number as a mixed volume. We also obtain bounds on the maximal number of positive zeros, which is often the significant number in applications. We derive lower bounds from the number of intersections between positive tropicalizations, and when the positive zeros have toric structure, we provide upper bounds that are simpler and in some cases smaller than the generic root count. The resulting algorithms are implemented in Julia.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

The paper proves the generic complex root count for augmented vertically parametrized systems equals a tropical intersection number, with a mixed-volume reduction in special cases plus positive-root bounds and Julia code.

read the letter

The one or two things to know: the paper proves that the generic number of complex zeros of an augmented vertically parametrized system is the tropical intersection number of a tropical linear space and a classical linear space. In the cotransversal matroid case this becomes a mixed volume, and they supply bounds on positive zeros derived from tropical methods. They do a good job linking the theory to practical settings like critical points of optimization problems and steady states of chemical reaction networks. The proof uses standard tropical intersection theory without circularity, and the Julia implementation allows direct computation of these numbers. This makes the abstract result usable. The soft spots are small. Genericity is assumed throughout, which is typical but means the formula gives the count only for generic coefficients. The positive bounds are lower bounds from positive tropicalizations and upper bounds under toric structure; these can be simpler but the paper notes they are not always smaller than the generic count. No load-bearing issues appear. This is for algebraic geometers and applied researchers in systems biology who need exact or bounded root counts for sparse systems. Readers with background in tropical geometry will get the most from it. The paper deserves a serious referee. The new formula, the special cases, and the code together make it worth reviewing. I would recommend sending it for peer review.

Referee Report

0 major / 3 minor

Summary. The manuscript proves that the generic number of complex zeros of an augmented vertically parametrized polynomial system equals the tropical intersection number of a tropical linear space and a classical linear space. For cotransversal matroids this count reduces to a mixed volume. The paper also derives lower bounds on positive real zeros from positive tropical intersections and upper bounds when the positive zeros admit toric structure, and supplies a Julia implementation of the algorithms.

Significance. If the proof is correct, the result supplies a direct tropical-geometric formula for root counts in vertically parametrized systems that arise in optimization and chemical reaction networks, together with a practical reduction to mixed volume in a natural special case. The positive-root bounds address a quantity of direct applied interest, and the open Julia code supports reproducibility and computational use.

minor comments (3)

[Theorem 3.1] The genericity hypotheses on the vertical coefficients and the augmentation forms are stated in the main theorem but would benefit from an explicit checklist or a short table summarizing which parameters must be generic for the equality to hold.
[Figure 2] Figure 2 (tropical linear space example) would be clearer if the classical linear space were drawn in the same ambient space with the intersection points labeled.
[§4.2] The proof of the mixed-volume reduction in the cotransversal case invokes a standard matroid identity; a one-sentence pointer to the precise reference or lemma number would help readers trace the step.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their positive summary of the manuscript, the assessment of its significance for applications in optimization and chemical reaction networks, and the recommendation of minor revision. No major comments were raised in the report.

Circularity Check

0 steps flagged

No significant circularity; central equality follows from established tropical intersection theory

full rationale

The paper proves that the generic number of complex zeros of an augmented vertically parametrized system equals the tropical intersection number of a tropical linear space and a classical linear space, with a reduction to mixed volume in the cotransversal matroid case. This derivation relies on standard results in tropical geometry and matroid theory rather than any self-definitional loop, fitted parameter renamed as prediction, or load-bearing self-citation chain. No equation or step reduces the claimed count to its own inputs by construction; the result is presented as a theorem proved from prior independent foundations, with algorithms implemented separately in Julia. The structure is self-contained against external algebraic and tropical benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The central claim rests on standard results from tropical geometry and matroid theory; the abstract introduces no free parameters, new entities, or ad-hoc axioms.

axioms (2)

standard math Tropical intersection theory for linear spaces and their matroids
Invoked to equate the generic zero count with the tropical intersection number.
standard math Cotransversal matroids admit a mixed-volume expression for their intersection numbers
Used to reduce the tropical count to a mixed volume in the special case.

pith-pipeline@v0.9.0 · 5467 in / 1344 out tokens · 47454 ms · 2026-05-11T01:58:57.322156+00:00 · methodology

discussion (0)

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

IndisputableMonolith/Foundation/AlexanderDuality.lean alexander_duality_circle_linking unclear
We prove that the generic number of complex zeros of an augmented vertically parametrized system is the tropical intersection number of a tropical linear space and a classical linear space.

Reference graph

Works this paper leans on

16 extracted references · 16 canonical work pages

[1]

Allamigeon, S

[AGS20] X. Allamigeon, S. Gaubert, and M. Skomra. Tropical spectrahedra.Discrete Comput. Geom.63.3 (2020). [AKW06] F. Ardila, C. Klivans, and L. Williams. The positive Bergman complex of an oriented matroid. Eur. J. Comb.27.4 (2006). [Ale13] D. Alessandrini. Logarithmic limit sets of real semi-algebraic sets.Adv. Geom.13.1 (2013). [Ard07] F. Ardila. Trans...

work page 2020
[2]

Borovik, P

[BBPMZ24] V. Borovik, P. Breiding, J. del Pino, M. Micha lek, and O. Zilberberg. Khovanskii bases for semimixed systems of polynomial equations—approximating stationary nonlinear Newtonian dynamics.J. Math. Pures Appl. (9)182 (2024). [BCS22] L. Brustenga i Moncus´ ı, G. Craciun, and M.-S. Sorea. Disguised toric dynamical systems.J. Pure Appl. Algebra226.8...

work page 2024
[3]

[BJS+07] T

Preprint:arXiv:2208.04590v2. [BJS+07] T. Bogart, A. N. Jensen, D. Speyer, B. Sturmfels, and R. R. Thomas. Computing tropical varieties. Journal of Symbolic Computation42.1-2 (2007). [BKM11] J. E. Bonin, J. P. S. Kung, and A. de Mier. Characterizations of transversal and fundamental transversal matroids.Electron. J. Comb.18.1 (2011). [BLMM17] L. Bossinger,...

work page arXiv 2007
[4]

Breiding, K

[BRT23] P. Breiding, K. Rose, and S. Timme. Certifying zeros of polynomial systems using interval arithmetic.ACM Trans. Math. Softw.49.1 (2023). [BSW22] P. Breiding, F. Sottile, and J. Woodcock. Euclidean distance degree and mixed volume.Found. Comput. Math.22.6 (2022). [CDSS09] G. Craciun, A. Dickenstein, A. Shiu, and B. Sturmfels. Toric dynamical system...

work page 2023
[5]

[FFT25] E

Preprint:https://web.dm.uba.ar/files/tesis_lic/2024/Fattori.pdf. [FFT25] E. Feliu, J. Ferrer, and M. L. Telek.Copositivity, discriminants and nonseparable signed supports

work page 2024
[6]

Polymake: a framework for analyzing convex polytopes

Preprint:arXiv:2512.07373. [FH25] E. Feliu and O. Henriksson. Toric invariance of vertically parametrized systems (2025). Preprint: arXiv:2411.15134v3. [FHC14] D. Flockerzi, K. Holstein, and C. Conradi. N-site phosphorylation systems with 2N-1 steady states.Bull. Math. Biol.76.8 (2014). [FHP25] E. Feliu, O. Henriksson, and B. Pascual-Escudero. Generic con...

work page arXiv 2025
[7]

Giaroli, R

28 [GRPD19] M. Giaroli, R. Rischter, M. P´ erez Mill´ an, and A. Dickenstein. Parameter regions that give rise to 2[n/2] +1 positive steady states in the n-site phosphorylation system.Math. Biosci. Eng.16.6 (2019). [GRZ22] P. G¨ orlach, Y. Ren, and L. Zhang. Computing zero-dimensional tropical varieties via projections. Comput. Complexity31.1 (2022). [HHR...

work page 2019
[8]

Tropical computations inpolymake

Preprint:arXiv:2409.13288. [HJ17] S. Hampe and M. Joswig. “Tropical computations inpolymake”.Algorithmic and experimental methods in algebra, geometry, and number theory. Cham: Springer,

work page arXiv
[9]

Generic root counts of tropically transverse systems: an invitation to tropical geometry inOSCAR

[HJ72] F. Horn and R. Jackson. General mass action kinetics.Arch. Rational. Mech. Anal.47 (1972). [HJS19] S. Hampe, M. Joswig, and B. Schr¨ oter. Algorithms for tight spans and tropical linear spaces.J. Symbolic Comput.91 (2019). [HR25a] P. A. Helminck and Y. Ren. Generic root counts and flatness in tropical geometry.J. Lond. Math. Soc. (2)111.5 (2025). [...

work page 1972
[10]

Huber and B

[HS95] B. Huber and B. Sturmfels. A polyhedral method for solving sparse polynomial systems.Math. Comput.64.212 (1995). [Jen16] A. N. Jensen.Tropical Homotopy Continuation

work page 1995
[11]

[JSY20] P

Preprint:arXiv:1601.02818v1. [JSY20] P. Jell, C. Scheiderer, and J. Yu. Real tropicalization and analytification of semialgebraic sets. Int. Math. Res. Not.2022.2 (2020). [LMR23] J. Lindberg, L. Monin, and K. Rose.The algebraic degree of sparse polynomial optimization

work page arXiv 2022
[12]

[Lom+23] T

Preprint:arXiv:2308.07765v2. [Lom+23] T. E. Loman, Y. Ma, V. Ilin, S. Gowda, N. Korsbo, N. Yewale, C. Rackauckas, and S. A. Isaacson. Catalyst: Fast and flexible modeling of reaction networks.PLoS Comput. Biol.19.10 (2023). [LY19] A. Leykin and J. Yu. Beyond polyhedral homotopies.Journal of Symbolic Computation91 (2019). MEGA 2017, Effective Methods in Al...

work page arXiv 2023
[13]

M¨ uller, E

[MFRCSD15] S. M¨ uller, E. Feliu, G. Regensburger, C. Conradi, A. Shiu, and A. Dickenstein. Sign conditions for injectivity of generalized polynomial maps with applications to chemical reaction networks and real algebraic geometry.Found. Comput. Math.16.1 (2015). [MS15] D. Maclagan and B. Sturmfels.Introduction to tropical geometry. Vol

work page 2015
[14]

Osserman and S

[OP13] B. Osserman and S. Payne. Lifting tropical intersections.Doc. Math.18 (2013). [Oxl06] J. G. Oxley.Matroid Theory. Oxford Graduate Texts in Mathematics. Oxford University Press, Inc.,

work page 2013
[15]

P´ erez Mill´ an, A

[PDSC12] M. P´ erez Mill´ an, A. Dickenstein, A. Shiu, and C. Conradi. Chemical reaction systems with toric steady states.Bull. Math. Biol.74 (2012). [Rin13] F. Rinc´ on. Computing tropical linear spaces.J. Symb. Comput.51 (2013). [RT26] K. Rose and M. L. Telek. Computing positive tropical varieties and lower bounds on the number of positive roots.J. Symb...

work page 2012
[16]

Wang and E

[WS08] L. Wang and E. D. Sontag. On the number of steady states in a multiple futile cycle.J. Math. Biol.57 (2008). 29 Authors’ addresses: Elisenda Feliu, University of Copenhagenefeliu@math.ku.dk Paul Alexander Helminck, IMPAN Warsawphelminck@impan.pl Oskar Henriksson, CSBD and MPI-CBG Dresdenoskar.henriksson@mpi-cbg.de Yue Ren, Durham Universityyue.ren2...

work page 2008