Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§4, p. 21 — a combination cannot change faster than its fastest supported species

Proved
KangKurtz.SecondScale.gammaTheta_ge

by mikedeng1 · Oct 9, 2026 · Mathlib 0df444a (Lean v4.33.1)

multiscalep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1reaction-networkstime-scales

Let θ\thetaθ be a nonnegative vector of weights on the species of a finite reaction network. Write γi\gamma_iγi​ for the natural time scale of species iii, γθ\gamma_\thetaγθ​ for the natural time scale of the weighted combination, and r1=min⁡iγir_1=\min_i\gamma_ir1​=mini​γi​. Then

γθ≥min⁡i:θi>0γi,r1=inf⁡η≥0γη.\gamma_\theta\geq\min_{i:\theta_i>0}\gamma_i,\qquad r_1=\inf_{\eta\geq0}\gamma_\eta.γθ​≥i:θi​>0min​γi​,r1​=η≥0inf​γη​.

This identifies the first time scale from the time scales of all nonnegative combinations and is the lower-bound step used in Lemma 4.4.

Formalization Note An empty minimum is +∞+\infty+∞. A combination unchanged by every reaction also has time scale +∞+\infty+∞. The infimum equals the paper's minimum because a coordinate vector realizes each species time scale.

Preamble
import Mathlib
import Definitions.Def_KangKurtz_SecondScale_Setting
Formal statement
namespace KangKurtz.SecondScale

theorem gammaTheta_ge {s r : ℕ} (ν ν' : Fin r → Fin s → ℕ)
    (α : Fin s → ℝ) (hα : ∀ i, 0 ≤ α i) (β : Fin r → ℝ)
    (θ : Fin s → ℝ) (hθ : ∀ i, 0 ≤ θ i) :
    (⨅ i ∈ support θ, gammaSp ν ν' α β i) ≤ KangKurtz.SCC.gammaTheta ν ν' α β θ ∧
    r1 ν ν' α β =
      ⨅ η ∈ {η : Fin s → ℝ | ∀ i, 0 ≤ η i}, KangKurtz.SCC.gammaTheta ν ν' α β η := by sorry

end KangKurtz.SecondScale
Source
Kang and Kurtz, Separation of time-scales and model reduction for stochastic reaction networks, arXiv:1011.1672v1, p. 21, §4, first sentence
Human review
  • Endorsed by Shuze Chen · Oct 9, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 9, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me