differential-equations / Chemical reaction network theory: mass-action kinetics

The permanence conjecture for weakly reversible mass-action systems with fixed rates

Theorem 1.1: for a finite weakly reversible network with fixed positive rates and any positive stoichiometric class PP, there is a nonempty compact convex forward-invariant KP⊂PK_P\subset P that every solution from PP enters in finite time; hence one εP\varepsilon_P bounds every trajectory in PP between εP\varepsilon_P and εP−1\varepsilon_P^{-1} after its entry time, also on unbounded classes. The proof adds strict increase off the trapping set and a passage between scales to the companion's construction. Uniformity holds within one class and one choice of rates; entry times may depend on the initial point, and time-varying rates are not treated.

32Significance / 100
1Frontier events
0Verification tasks
0Recorded attempts

Temporal state

Current frontier

No reconciled state yet.

Append-only history

Frontier timeline

differential-equationsOct 5, 2026Significance 32/100Registry: unreviewed

The permanence conjecture for weakly reversible mass-action systems with fixed rates

Prior state unknown→proved

Theorem 1.1: for a finite weakly reversible network with fixed positive rates and any positive stoichiometric class PP, there is a nonempty compact convex forward-invariant KP⊂PK_P\subset P that every solution from PP enters in finite time; hence one εP\varepsilon_P bounds every trajectory in PP between εP\varepsilon_P and εP−1\varepsilon_P^{-1} after its entry time, also on unbounded classes. The proof adds strict i…

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

Research memory

Claims and attempts

Scoped claims

Source authenticated

Theorem 1.1: for a finite weakly reversible network with fixed positive rates and any positive stoichiometric class PP, there is a nonempty compact convex forward-invariant KP⊂PK_P\subset P that every solution from PP enters in finite time; hence one εP\varepsilon_P bounds every trajectory in PP between εP\varepsilon_P and εP−1\varepsilon_P^{-1} after its entry time, also on unbounded classes. The proof adds strict increase off the trapping set and a passage between scales to the companion's construction. Uniformity holds within one class and one choice of rates; entry times may depend on the initial point, and time-varying rates are not treated.

Theorem 1.1: for a finite weakly reversible network with fixed positive rates and any positive stoichiometric class PP, there is a nonempty compact convex forward-invariant KP⊂PK_P\subset P that every solution from PP enters in finite time; hence one εP\varepsilon_P bounds every trajectory in PP between εP\varepsilon_P and εP−1\varepsilon_P^{-1} after its entry time, also on unbounded classes. The proof adds strict increase off the trapping set and a passage between scales to the companion's construction. Uniformity holds within one class and one choice of rates; entry times may depend on the initial point, and time-varying rates are not treated.

Recorded attempts

Evidence graph

Connected research record