WorksMathematics
Boundedness and persistence of weakly reversible mass-action systems
Abstract
We prove the boundedness and persistence conjectures for finite weakly reversible mass-action systems with positive constant reaction rates. For every positive initial condition, the solution exists for all forward time, and every concentration remains bounded above and bounded away from zero. The bounds may depend on the initial condition, and no boundedness assumption is imposed on its stoichiometric compatibility class.
Introduction
Weak reversibility is a condition on the directed graph of a chemical reaction network: each reaction has a directed return path. Two central questions ask whether this condition alone prevents species extinction under mass-action kinetics and whether every positive trajectory remains bounded. We prove the joint boundedness and persistence conclusion for arbitrary positive constant reaction rates, any number of connected components in the reaction graph, and every species dimension.
The problem and main result
A finite reaction network with species consists of a finite set of complexes and a set of directed reactions. We write a reaction as . The network is weakly reversible if, for each , there is a directed path from to . A connected component of the underlying undirected reaction graph is called a linkage class. There is no restriction on their number. Empty reaction sets and isolated complexes are allowed.
Assign a positive constant to each reaction. The mass-action equation is
Since the exponents are nonnegative integers, is a polynomial vector field. A forward trajectory in is called persistent if
The bounds in this definition may depend on the trajectory.
Theorem 1.1. Let , let be finite, let be weakly reversible, and let all reaction rates be positive constants. For every , the solution of (1.1) with exists for every . There is a number , depending on the network, the rates, and , such that
In particular, every positive trajectory is bounded and persistent. To relate the statement to conservation laws, put
The subspace is the stoichiometric subspace, and is the closed stoichiometric compatibility class of . Since takes values in , integration of the equation shows that a positive trajectory starting at stays in . Theorem 1.1 applies whether or not is bounded. It therefore includes the persistence question for bounded entire compatibility classes. The estimate (1.2) also shows directly that the omega-limit set is nonempty and disjoint from the orthant boundary: every sequence of times tending to infinity has a subsequence along which the trajectory converges inside the compact positive box in (1.2). We make no assertion in this generality that the trajectory converges to an equilibrium, or that the same works for all positive initial points. In particular, the theorem does not assert uniform eventual bounds over all positive initial points in a compatibility class.
The proof gives a geometric strengthening, stated precisely in Proposition 3.3: each belongs to a compact convex polytope such that every solution starting in exists globally and remains in . The set need not be a whole compatibility class. It is constructed in the ambient species space and may meet several such classes. Its convexity also yields a short proof of the known existence theorem of Boros [5]: every positive stoichiometric class contains a positive equilibrium (Corollary 3.4).
History and the role of the construction
The classical structural theory begins with complex balance. A system is complex-balanced if it admits a positive state at which the total incoming and outgoing reaction fluxes agree at every complex. Horn and Jackson’s equilibrium and stability theory [16], Horn’s complex-balancing criteria [15], and Feinberg’s deficiency-zero analysis [10] provide the foundations. Weak reversibility is a property of the graph, whereas complex balance also depends on the rates. The global-attractor question for complex-balanced systems asks whether every positive trajectory converges to the unique positive equilibrium in its stoichiometric class. This convergence follows from Theorem 1.1 under the additional complex-balance assumption; Remark 3.5 gives the argument.
Feinberg [12], Remark 6.1.E formulated the weaker expectation that a positive trajectory of a weakly reversible mass-action system cannot converge to a point where a species concentration is zero. Persistence excludes approach to the boundary along any sequence of times. Anderson [1], Section 1.1 separated the boundedness conjecture, that positive trajectories of weakly reversible mass-action systems are bounded, from the persistence conjecture for bounded trajectories. Together these imply persistence without an assumed upper bound. Theorem 1.1 establishes both conclusions for arbitrary positive constant reaction rates.
August and Barahona [3], Theorem 6 previously stated the general boundedness and persistence conclusion. Their proof, Part III on page 45 before Equation (11), infers monomial dominance from a maximal sum of exponents and a sufficiently large product of concentrations. That implication does not hold throughout the stated region. In with both rates one, the concentrations satisfy but , and
This contradicts the asserted implication. It does not contradict their theorem: is conserved in this example. Our proof controls the relevant exponent pairings separately and establishes the conclusion independently.
Several earlier results give classwise permanence or permit time-dependent rates. Here permanence means that, for each fixed compatibility class, there is a compact subset of the positive orthant that eventually contains every positive trajectory in that class, with entry time depending on the initial state. Anderson [1] proved boundedness for weakly reversible systems with a single linkage class. Gopalkrishnan, Miller, and Shiu [14] proved permanence for the larger class of strongly endotactic systems, which includes every weakly reversible single-linkage system; Boros and Hofbauer [6] gave a later proof of the single-linkage result. Craciun, Nazarov, and Pantea [9] proved boundedness, persistence, and permanence for two-species weakly reversible systems as part of their more general endotactic result. Pantea [18] proved persistence of bounded weakly reversible trajectories when the stoichiometric subspace has dimension two, with arbitrary species and linkage counts. Two species and two-dimensional stoichiometry are different restrictions. These results also permit rates that vary in time while remaining bounded above and away from zero. Our theorem treats constant rates in all dimensions and with any number of linkage classes. Its bounds may depend on the initial point, so it does not assert the classwise uniformity of permanence.
The revised toric-differential-inclusion approach of Craciun [8], Section 8, final remark, p. 81, in version 3 dated September 23, 2026, gives persistence for bounded positive trajectories of weakly reversible systems with uniformly positive and bounded variable rates. Its complex-balanced application combines the boundary construction with the Horn–Jackson Lyapunov bound. The general weakly reversible statement assumes a trajectory upper bound. Our construction supplies that bound together with persistence, through a compact convex forward-invariant polytope containing each prescribed positive initial point.
The geometric and analytical methods also have substantial antecedents. Invariant polygons and quantitative monomial comparisons appear in Craciun, Nazarov, and Pantea [9], and projected polyhedra in Pantea [18]. Anderson’s monomial tiers and return-path domination [2], the projection and multiscale arguments of Gopalkrishnan, Miller, and Shiu [13, 14], and Craciun’s ordered-complex embedding into toric differential inclusions [7] organize related comparisons. Our finite affine-label construction and directed-cut estimate are proved directly; none of these research results is an input to the proof.
Proof overview
The obstacle is to find a single finite family of linear inequalities that controls both small and large concentrations. An individual reaction need not point inward across a proposed face. Weak reversibility supplies return paths, so the inward estimate will concern the combined flux across cuts of the reaction graph. The normal of each active face must make strict comparisons that agree with the monomial sizes. Near a tie, an arbitrary approximation to a normal can reverse a comparison; the geometric construction must respect these ties.
For and , write
These points fill the box . We construct a concave piecewise-affine function
where is a finite set indexing the affine functions, and the slopes are independent of . A label is active at if its affine function attains this minimum; every minimizer is active at a tie. Lemma 2.1 and Corollary 2.2 supply the family for any positive tolerance : for all sufficiently small , every label active at satisfies , uniformly over the cube. No continuity of is required. We can therefore make the tolerance small near the hyperplanes where a coordinate or a complex comparison vanishes, while keeping it positive on those hyperplanes. This forces each nonzero slope comparison to have the same sign as the corresponding exponent comparison, with a fixed positive gap. In particular, for some independent of ,
The parameter order is essential: first the tolerance, then the fixed finite slopes, then their positive separation , and only then the final value of . A finite covering by nearby slopes alone would not ensure that the slopes attaining the minimum have the required accuracy.
Order the complexes by an active slope. Across a cut between two successive distinct levels, weak reversibility supplies an upward reaction whenever there is a downward reaction. The monomial comparison makes one upward rate dominate the sum of all downward rates once is small enough. Summing over the cuts gives for every active label. Consequently is nondecreasing along any trajectory segment in . At a tie, its right derivative is the minimum of the derivatives of all active branches, so controlling a preferred active label would not suffice. Equal slope levels need not have equal monomials; edges within one level contribute zero to the normal derivative.
The coordinate comparisons force every label active at the prescribed to have slope zero when is sufficiently small. Fixing such a label gives a constant branch with value and hence the global bound . The maximum set
is an intersection of finitely many closed affine half-spaces and contains . A zero slope cannot be active on , so misses that boundary. Convexity now places all of inside : a segment from to any point outside the box would meet its boundary. Thus is a compact positive polytope. Along a solution starting in , nondecrease of and the ceiling force the solution to remain in the maximum set. A first-exit argument and compact continuation prove invariance and global existence, giving the trajectory bounds. No active-label estimate outside is needed.
Section 2 proves the approximation lemma by induction on dimension and finite gluing over the minimum exponent, then obtains its uniform form. Section 3 imposes the sign constraints, proves the cut and derivative estimates, constructs the invariant polytope, and deduces the trajectory bounds, positive-equilibrium existence and complex-balanced convergence.
Affine labels with a prescribed tolerance
We construct a finite minimum of affine functions whose minimizing slopes approximate the exponents of a positive point. The permitted error is prescribed separately at each slope. Allowing this prescription to be discontinuous will let us impose sign conditions on finitely many linear forms in the application.
For an integer , , and , write
A label is a pair consisting of a vector , independent of , and a real-valued offset defined for all sufficiently small positive . For a finite nonempty family of labels, write its members as . For fixed sufficiently small and , a label is active at if
Thus every minimizing label is active when a tie occurs. Whenever finitely many families are combined, we restrict their offsets to a common interval on which they are all defined.
Lemma 2.1 (Affine approximation with arbitrary tolerance). Let be an integer, let be real numbers, and let be any function. There is a finite nonempty family of labels , with and as , such that the following holds. For every sequence and every sequence converging to , if a fixed label is active at for every , then
No regularity of is assumed, and the approximating vectors need not belong to .
Two aspects of the statement will be used separately. The slopes form a fixed finite set, rather than a set that changes with . Also, the conclusion concerns every label that stays active along a sequence, including labels tied with other minimizers. The freedom for to leave the cube is needed by the induction: a projected sequence may approach a face of a smaller cube from either side.
Proof. We induct on , using only positive dimensions smaller than . The largest coordinate of is , so we first construct a family for each fixed value of the smallest exponent. Within that family, negative offsets compensate for raising slope entries on the smaller coordinates of . Compactness extends the family’s guarantee to nearby minimum values, and a finite interval construction then selects among these families. When , the first step uses singleton families and invokes no induction hypothesis; the remaining steps therefore also establish the base case.
Step 1: construction at a fixed minimum. Set , write , and fix . We will construct a finite family whose slopes all satisfy , containing , with the following property: the conclusion of the lemma holds for activity within whenever the limiting vector satisfies .
If or , take . In either case, a limit in the cube with minimum must equal , so the asserted property holds. Assume henceforth in this construction that and .
A label has type if precisely entries of its slope are strictly greater than , with all other entries equal to . Type 0 consists of . Construct types in increasing order. After type has been constructed, choose so that
The already constructed type has finitely many slopes, and its tolerance values are all positive, so such a choice is possible. Only those finitely many values are compared; we do not take a positive lower bound for on an entire cube.
For each -element subset and each , let have entries on and off . Apply the induction hypothesis in dimension to , with tolerance ; the coordinates of are taken in their natural order. For every resulting label , where , put the label
in type . Taking all such coordinate sets and types gives a finite nonempty family . Each of its offsets is . The negative term favors raising slope entries when the corresponding coordinates of are small relative to ; the decreasing make this preference stronger at each successive type.
Step 2: verification at the fixed minimum. For the construction with and , suppose , , and . Fix a label of type that is active within along this sequence, and let be its set of raised coordinates. All asymptotic comparisons in this verification are along the sequence, and we write . Whenever a limiting exponent is strictly above or below a threshold, convergence leaves a fixed positive exponent gap for all large . We use these gaps, not a replacement of by : convergence of the exponents alone would not justify that replacement.
If , comparison with gives
Every coefficient on the left is at least . If some for , then, for a fixed and all sufficiently large , ; dividing the display by would yield a term tending to infinity. Consequently
Among labels constructed from this same , the contributions off and the offset are common. Thus is active in the family supplied by induction. Its limiting exponent vector belongs to , so the induction hypothesis yields
This is precisely where unrestricted approximating vectors are needed: may lie outside even though its limit lies inside that cube. In particular, no strict inequality is required when a limiting coordinate equals or .
We next control the coordinates off , including type by taking . Suppose . We claim that
If instead for some , then every limiting exponent on is strictly greater than . For , this uses on ; for there are no such coordinates to check. Choose any type label whose raised set is . Its affine value minus the value of is
because on every raised coordinate. The corresponding difference for the supposed active label is zero if , and is bounded below by if . Since in the latter case, the chosen competitor has a strictly smaller value for all sufficiently large , a contradiction. This proves the claim. Because and off , it follows that
where the strict inequality was imposed when constructing type .
If instead , the sole coordinate off has limiting exponent exactly : all coordinates on have exponent at least , and . Its error is therefore zero. Combining the bounds proves in all cases, including types and . No strictness was required at a threshold .
Step 3: extension to nearby minima. Keep and its finite family fixed. For a label in that family, let be the set of all limits of sequences for which and is active within at . This set is closed. Indeed, if and , choose from a realizing sequence for a point and parameter such that
and is active at . Then , so . This diagonal selection uses actual active points; it does not pass activity through a continuity assertion about .
The set
is therefore compact. Here each is a fixed real number; continuity of is unnecessary. The fixed-minimum verification shows that contains no point with . Since is continuous, there is such that contains no point with
For example, if is nonempty, take smaller than the positive minimum of on ; if it is empty, any positive radius initially suffices. Thus the limiting active-label conclusion holds whenever and .
Shrink , if necessary, so that every local offset also satisfies
For a nonsingleton family it suffices to require ; for a singleton family the offset is zero. The stronger decay uses the constructed form with ; it would not follow from alone. Shrinking the radius preserves the guarantee just proved. We have now obtained the desired approximation near every possible value of . It remains to make a finite combined family select an appropriate one of these neighborhoods.
Step 4: finite interval construction and combination. The local families already approximate correctly near their own minimum levels. We now give each family a common offset shift so that a globally active label must come from a suitable neighborhood. The overlap between neighboring neighborhoods is important: it permits equality at the transition cuts.
Choose a finite subcover of from the intervals . Remove intervals contained in another selected interval, retaining one copy if two coincide. Order the remaining centers as , and write . Noncontainment forces the orders of the left and right endpoints to agree; since , both orders agree with that of the centers. Hence
Successive intervals overlap. Otherwise , and a point of would be covered by none of the selected intervals. The first interval contains and the last contains , by the endpoint orders, coverage, and the fact that all centers lie in . For , choose
This open interval is nonempty: the two intervals overlap, each contains its own center, and . Thus belongs to both adjacent intervals and lies strictly between their centers. Setting and , we obtain
If , no cuts are needed and the sole selected interval contains the whole of .
Take the union of the selected families, replacing every offset at level by
The empty sum at is zero. Every new offset is : Equation (2.1) applies with , and every shift exponent satisfies . Within a local family this common shift does not change activity. Between adjacent families the new term selects the family on the appropriate side of the cut. Figure 1 shows the interval cover and the closed cut cells assigned to the selected families.
Figure 1. Finite gluing, schematically with three selected families. The open intervals are the neighborhoods where the local families approximate correctly. Each thick closed segment lies strictly inside its corresponding open interval. For a label from family that stays active along a convergent sequence, the common shifts in (2.3) force the limiting exponent minimum into that closed segment. Either adjacent family remains valid when equals a cut.
Suppose a fixed label from level is active in this combined family along and . Write for its original local offset and again abbreviate . We claim
If and , every is . The local offset is also , by Equation (2.1) and . Subtracting the value of the label with its shift, the value difference is
for all sufficiently large , contradicting activity.
If and , subtract instead the shifted label . The difference is
Every coefficient in the scalar product is at least . For some coordinate , , so . On the other hand, because . The displayed difference divided by therefore tends to , again contradicting activity. The outer bounds when or follow from .
By (2.2), the claimed bounds imply , including equality at either cut. A label active in the combined family is active within its original local family, since all labels at that level received the same shift. The guarantee for now gives . All contradictions above produced a strictly smaller competing value, so the argument applies to every active label even at ties. This completes the induction.
The sequential conclusion gives a uniform estimate on the entire cube, with the same fixed finite family. This is the form used for reaction networks.
Corollary 2.2 (Uniform activity bound). Let , , and be as in Lemma 2.1. Fix a finite nonempty family supplied by that Lemma. There is such that, for every and every , each label active at satisfies
The family is fixed before is chosen.
Proof. Otherwise there are , points , and labels active at for which
By finiteness of and compactness of , a subsequence has a fixed label and . Passing to the limit in the displayed inequality contradicts the strict inequality in Lemma 2.1. The value is fixed on this subsequence, so no regularity of is used.
In Section 3, we choose the tolerance so that every nonzero dot product of an active slope with a prescribed vector forces the exponent vector to have a dot product of the same sign. The freedom to choose a discontinuous permits this requirement near the corresponding hyperplanes.
From affine labels to persistent trajectories
We now apply Lemma 2.1 to the mass-action vector field. Its uniform form in Corollary 2.2 lets us choose the tolerance so that every strict ordering made by an active slope gives a monomial comparison with a definite gap. Weak reversibility converts those comparisons into nonnegative derivatives, and an initially active constant branch supplies the compact set that traps the trajectory.
Uniform approximation and sign constraints
Fix henceforth a network, positive rate constants, and as in Theorem 1.1. Write for the standard basis of , and set
Every vector in is nonzero. We include differences of all pairs of complexes, not only reaction vectors. The flux comparison below compares the source of one upward reaction with the sources of every downward reaction. Such sources need not be adjacent in the reaction graph and may even belong to different linkage classes.
For , define
This is a positive number for every , since the displayed minimum is over a finite nonempty set of positive numbers; in particular, . The definition is allowed to be discontinuous at the hyperplanes . This is the reason for allowing arbitrary positive tolerances in Lemma 2.1.
Apply that Lemma with , , , and the tolerance (3.2). Denote its fixed family by and put
Choose small enough that all offsets are defined and Corollary 2.2 applies for . Before choosing a particular , define
The positivity of again follows from finiteness. Both the slopes and are independent of the eventual choice of . Thus the order of choices is
In particular, is not a separation parameter that is allowed to tend to zero together with .
Suppose that , , and is active at . For every with , we have
Consequently,
In particular, forces . Thus a comparison too close to a tie in exponent space is made an exact tie by the active slope. The converse is not required: equal slope levels may contain complexes with different monomial values. For and any , this implies
Indeed, and , while and .
We can now fix a single satisfying
and, when , also satisfying
This choice is possible because and as , with already fixed. No minimum of reaction rates is needed when is empty. Write
Since , Equation (3.6) places in the interior of .
Every label active at has slope zero. In fact, if its th slope coordinate were nonzero, Equation (3.4) applied to would give , contradicting (3.6). The finite nonempty family has at least one active label; fix such a label and put . Then
Thus a constant branch is forced by the sign constraints, even though it was not prescribed in the application of Lemma 2.1.
There is no point at which . To see this, write with . The boundary condition is . Equality would make active, so Corollary 2.2 would instead give . We have proved
Thus the maximum set contains and misses . To prove its invariance, we next show that a trajectory segment in cannot decrease . The constant branch alone does not prove this: another branch tied with it might otherwise become smaller. We must control the derivatives of all active branches. The next two arguments establish that control from weak reversibility.
Flux across the ordered complex levels
The following finite graph statement isolates the role of weak reversibility. Its weights will be the monomials , and its levels will be the scalar products .
Lemma 3.1 (Flux across level cuts). Let be a finite set and a finite set of directed edges with source and target maps . Suppose that for every edge there is a directed path from its target back to its source. Let , let for , and let for . Assume that there is such that
If , assume in addition that
Then
Proof. The sum is zero if is empty, including the case of an empty vertex set. Otherwise list the distinct values of as . For , let
Let consist of edges from to and of edges in the reverse direction. Define their net upward flux by
If , take one of its edges. Its return path starts in and ends in , so that path contains an edge . Put . Every source of an edge in satisfies , and hence
It follows that . If is empty, then directly. Notice that the selected edge need not share a component with every downward edge. The all-pairs hypothesis (3.10) is what permits one upward contribution to dominate the entire downward sum in this proof.
For each edge, its level difference is the signed sum of the gaps over the cuts it crosses. Summing this identity over the finite edge set gives
When , both sides vanish. Equal vertex levels therefore cause no difficulty, and no connectedness assumption has entered the argument.
Return-path monomial domination appears in Anderson’s tier argument [2], and quantitative inward reaction estimates underlie the invariant polygons of Craciun, Nazarov, and Pantea [9]. Ordered-cut regrouping also appears in the proof of Craciun’s toric-inclusion embedding theorem [7]. Lemma 3.1 uses a direct finite estimate: one upward edge dominates the full downward flux. No tier extraction, cycle decomposition, or differential inclusion is required in the proof above.
For any and any label active at , apply Lemma 3.1 with
The return paths are supplied by weak reversibility, Equation (3.5) supplies (3.10), and Equation (3.7) supplies the rate inequality when there are reactions. Thus
This includes for an empty reaction set. The comparison in (3.10) is required for all ordered vertex pairs, including nonadjacent pairs in one component and pairs in different components; this explains the full set of complex differences in (3.1).
Derivatives of finite affine minima
Although need not be differentiable where its active labels change, its right derivative along a differentiable curve is explicit. We record the finite-affine minimum case of the classical active-branch directional-derivative principle; see, for example, Bertsekas [4] for the corresponding maximum formula. The short proof includes all ties and the monotonicity implication needed here.
Lemma 3.2 (Right derivative of a finite affine minimum). Let be a finite nonempty index set, let and for , and define
For a continuously differentiable curve , the right derivative at every exists and is
If for every and every , then is nondecreasing on .
Proof. Fix . Each inactive branch has a strictly positive gap above any chosen active branch at . By continuity and finiteness, every inactive branch stays above that chosen branch at for sufficiently small . For the remaining branches, the first-order expansions, uniform over the finite active set, give
This proves the right derivative formula, including at ties. Under the stated nonnegativity hypothesis, take any and any . The continuous function
has strictly positive right derivative at every . It cannot attain its maximum at such a point, because sufficiently small positive increments would increase its value. Compactness therefore places its maximum at , giving . Letting proves .
The invariant polytope and trajectory bounds
All active branches have nonnegative derivative in , while the constant branch in (3.8) gives everywhere. We now show that the maximum set of is the compact invariant polytope announced in the introduction. Its invariance will give Theorem 1.1.
Nonnegative derivatives on all active inequalities express the familiar inward-tangency condition for invariance, whose classical general form goes back to Nagumo [17]. Here we prove invariance directly by a first-exit argument.
Proposition 3.3. For every finite weakly reversible mass-action network with positive constant rates, and every , there is a compact convex polytope containing and forward invariant for the mass-action equation. Here forward invariance means that every solution starting in exists for all forward time and stays in .
Proof. Use the family, , , , and constructed above, and set
The equality follows from . Thus is a closed convex polyhedron containing , and (3.9) gives .
In fact . Otherwise a segment from to a point of outside that interior would lie in by convexity and meet , a contradiction. Therefore is bounded as well as closed, so it is a compact convex polytope in . This step uses no active-label estimate outside the box.
Let . Since the polynomial vector field is smooth on , it has a unique local solution from with a maximal forward existence interval . We initially regard this as a solution in ; confinement below will give positivity. On any interval for which , (3.12) and Lemma 3.2 make nondecreasing. Since and , we obtain
The point lies in the interior of . If the solution reached the boundary at a first time , its whole segment would lie in . Applying (3.14) to that closed segment would give , contrary to (3.9). Continuity shows that any departure from the interior before would have such a first boundary time. Hence for all , and (3.14) places the whole trajectory in .
If , continuity of on the compact box gives with for . Consequently
so has a limit as . Local existence from extends the solution past : the original integral equation passes to the endpoint, and both one-sided derivatives there equal . This contradicts maximality. Thus , proving the claimed forward invariance for every . □
Proof of Theorem 1.1. For the prescribed , Proposition 3.3 and its construction give a forward-invariant polytope with . The solution therefore exists globally and satisfies
Taking gives (1.2). Each coordinate has positive infimum on the entire forward trajectory, and hence positive forward limit inferior. □
Equilibria and complex-balanced convergence
The convexity of the invariant set also recovers the known existence of positive equilibria in every positive stoichiometric class, proved by Boros [5] (preprint, Theorem 1).
Corollary 3.4. For every finite weakly reversible mass-action network with positive constant rates and every , there is an equilibrium .
Proof. Let be the polytope in Proposition 3.3. The set is nonempty, compact, convex, and forward invariant. Write for the flow. For each integer , the continuous map has a fixed point by Brouwer’s theorem. Thus
Put . Invariance and the integral equation give for . Uniform continuity of on therefore yields
A subsequence of converges to some , and continuity gives . Since , this is the required positive equilibrium. □
Remark 3.5 (Complex-balanced convergence). Under the additional assumption of complex balance, Theorem 1.1 recovers the known global-attractor conclusion (see also [8]): for fixed positive rate constants, every positive trajectory converges to the unique positive equilibrium in its positive stoichiometric class . Indeed, complex balance implies weak reversibility, and Proposition 3.3 traps the trajectory in the compact positive forward-invariant set . Let be the unique positive equilibrium in this class. The Horn–Jackson entropy function
is nonincreasing and has zero derivative only at equilibria. This dissipation property and uniqueness in each positive class are the standard complex-balance conclusions [11] (Proposition 5.3 and Corollaries 5.4–5.5). LaSalle’s invariance principle therefore gives convergence. In particular, the conclusion holds for every fixed positive rate choice on every weakly reversible deficiency-zero network [11] (Corollary 5.10). Here the deficiency is , where is the number of linkage classes.
References
References
- [1]David F. Anderson. Boundedness of trajectories for weakly reversible, single linkage class reaction systems. Journal of Mathematical Chemistry, 49(10):2275–2290, 2011. doi: 10.1007/s10910-011-9886-4. URL https://arxiv.org/abs/1104.4992v2. Preprint: arXiv:1104.4992v2.
- [2]David F. Anderson. A proof of the global attractor conjecture in the single linkage class case. SIAM Journal on Applied Mathematics, 71(4):1487–1508, 2011. doi: 10.1137/11082631X. URL https://doi.org/10.1137/11082631X.
- [3]Elias August and Mauricio Barahona. Solutions of weakly reversible chemical reaction networks are bounded and persistent. IFAC Proceedings Volumes, 43(6):42–47, 2010. doi: 10.3182/20100707-3-BE-2012.0018. URL https://doi.org/10.3182/20100707-3-BE-2012.0018.
- [4]Dimitri P. Bertsekas. Convex Optimization Theory. Athena Scientific, 2009. URL https://web.mit.edu/dimitrib/www/Convex_Theory_Entire_Book.pdf.
- [5]Balázs Boros. Existence of positive steady states for weakly reversible mass-action systems. SIAM Journal on Mathematical Analysis, 51(1):435–449, 2019. doi: 10.1137/17M115534X. URL https://arxiv.org/abs/1710.04732v2. Preprint: arXiv:1710.04732v2.
- [6]Balázs Boros and Josef Hofbauer. Permanence of weakly reversible mass-action systems with a single linkage class. SIAM Journal on Applied Dynamical Systems, 19(1):352–365, 2020. doi: 10.1137/19M1248431. URL https://doi.org/10.1137/19M1248431.
- [7]Gheorghe Craciun. Polynomial dynamical systems, reaction networks, and toric differential inclusions. SIAM Journal on Applied Algebra and Geometry, 3(1):87–106, 2019. doi: 10.1137/17M1129076. URL https://arxiv.org/abs/1901.02544v1. Preprint: arXiv:1901.02544v1.
- [8]Gheorghe Craciun. Toric differential inclusions and a proof of the global attractor conjecture, 2026. URL https://arxiv.org/abs/1501.02860v3. arXiv:1501.02860v3, September 23, 2026; first version 2015.
- [9]Gheorghe Craciun, Fedor Nazarov, and Casian Pantea. Persistence and permanence of mass-action and power-law dynamical systems. SIAM Journal on Applied Mathematics, 73(1):305–329, 2013. doi: 10.1137/100812355. URL https://doi.org/10.1137/100812355.
- [10]Martin Feinberg. Complex balancing in general kinetic systems. Archive for Rational Mechanics and Analysis, 49:187–194, 1972. doi: 10.1007/BF00255665. URL https://doi.org/10.1007/BF00255665.
- [11]Martin Feinberg. Lectures on chemical reaction networks. Lectures at the Mathematics Research Center, University of Wisconsin–Madison, 1979. Written version copyright 1980. Manuscript PDF: https://zenodo.org/records/10631900/files/LecturesOnChemicalReactionNetworks_Feinberg.pdf.
- [12]Martin Feinberg. Chemical reaction network structure and the stability of complex isothermal reactors—I. The deficiency zero and deficiency one theorems. Chemical Engineering Science, 42 (10):2229–2268, 1987. doi: 10.1016/0009-2509(87)80099-4. URL https://doi.org/10.1016/0009-2509(87)80099-4.
- [13]Manoj Gopalkrishnan, Ezra Miller, and Anne Shiu. A projection argument for differential inclusions, with applications to persistence of mass-action kinetics. SIGMA, 9:025, 2013. doi: 10.3842/SIGMA.2013.025. URL https://doi.org/10.3842/SIGMA.2013.025. 25 pages.
- [14]Manoj Gopalkrishnan, Ezra Miller, and Anne Shiu. A geometric approach to the global attractor conjecture. SIAM Journal on Applied Dynamical Systems, 13(2):758–797, 2014. doi: 10.1137/130928170. URL https://doi.org/10.1137/130928170.
- [15]F. Horn. Necessary and sufficient conditions for complex balancing in chemical kinetics. Archive for Rational Mechanics and Analysis, 49:172–186, 1972. doi: 10.1007/BF00255664. URL https://doi.org/10.1007/BF00255664.
- [16]F. Horn and R. Jackson. General mass action kinetics. Archive for Rational Mechanics and Analysis, 47:81–116, 1972. doi: 10.1007/BF00251225. URL https://doi.org/10.1007/BF00251225.
- [17]Mitio Nagumo. Über die Lage der Integralkurven gewöhnlicher Differentialgleichungen. Proceedings of the Physico-Mathematical Society of Japan, 3rd Series, 24:551–559, 1942. doi: 10.11429/ppmsj1919.24.0_551. URL https://doi.org/10.11429/ppmsj1919.24.0_551.
- [18]Casian Pantea. On the persistence and global stability of mass-action systems. SIAM Journal on Mathematical Analysis, 44(3):1636–1673, 2012. doi: 10.1137/110840509. URL https://arxiv.org/abs/1103.0603v3. Preprint: arXiv:1103.0603v3.
