Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Lemma 3.8, (3.35)–(3.36), p. 19 — sandwich bounds when Γ⁻_{θ¹} ∩ Γ⁺_{θ²} = ∅

Proved
KangKurtz.Combine.eq_3_35_3_36

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

balance-conditionp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1reaction-networks

Consider a reaction network with net changes ζk\zeta_kζk​, species exponents αi≥0\alpha_i\ge0αi​≥0, reaction exponents βk\beta_kβk​ and ρk=βk+νk⋅α\rho_k=\beta_k+\nu_k\cdot\alphaρk​=βk​+νk​⋅α. For θ∈[0,∞)s0\theta\in[0,\infty)^{s_0}θ∈[0,∞)s0​ let Γθ±\Gamma^\pm_\thetaΓθ±​ be the reactions with ± θ⋅ζk>0\pm\,\theta\cdot\zeta_k>0±θ⋅ζk​>0; maxima over the empty set are −∞-\infty−∞ and ∨\vee∨ denotes the maximum.

Let θ1,θ2∈[0,∞)s0\theta^1,\theta^2\in[0,\infty)^{s_0}θ1,θ2∈[0,∞)s0​ with Γθ1−∩Γθ2+=∅\Gamma^-_{\theta^1}\cap\Gamma^+_{\theta^2}=\emptysetΓθ1−​∩Γθ2+​=∅, and c1,c2>0c_1,c_2>0c1​,c2​>0. Then

max⁡k∈Γθ1−ρk≤max⁡k∈Γc1θ1+c2θ2−ρk≤max⁡k∈Γθ1−ρk∨max⁡k∈Γθ2−ρk,(3.35)\max_{k\in\Gamma^-_{\theta^1}}\rho_k\le\max_{k\in\Gamma^-_{c_1\theta^1+c_2\theta^2}}\rho_k\le\max_{k\in\Gamma^-_{\theta^1}}\rho_k\vee\max_{k\in\Gamma^-_{\theta^2}}\rho_k, \tag{3.35}k∈Γθ1−​max​ρk​≤k∈Γc1​θ1+c2​θ2−​max​ρk​≤k∈Γθ1−​max​ρk​∨k∈Γθ2−​max​ρk​,(3.35) max⁡k∈Γθ2+ρk≤max⁡k∈Γc1θ1+c2θ2+ρk≤max⁡k∈Γθ1+ρk∨max⁡k∈Γθ2+ρk.(3.36)\max_{k\in\Gamma^+_{\theta^2}}\rho_k\le\max_{k\in\Gamma^+_{c_1\theta^1+c_2\theta^2}}\rho_k\le\max_{k\in\Gamma^+_{\theta^1}}\rho_k\vee\max_{k\in\Gamma^+_{\theta^2}}\rho_k. \tag{3.36}k∈Γθ2+​max​ρk​≤k∈Γc1​θ1+c2​θ2+​max​ρk​≤k∈Γθ1+​max​ρk​∨k∈Γθ2+​max​ρk​.(3.36)

When all four maxima of θ1\theta^1θ1 and θ2\theta^2θ2 coincide (the situation (3.34) of the paper), these bounds collapse to equalities and give the balance equation for c1θ1+c2θ2c_1\theta^1+c_2\theta^2c1​θ1+c2​θ2; this is the one case of Lemma 3.8 not covered by Lemmas 3.5–3.7.

Formalization Note. All maxima are in WithBot ℝ; the conclusion is the conjunction of the four inequalities.

Preamble
import Mathlib
import Definitions.Def_KangKurtz_Combine_Setting
Formal statement
namespace KangKurtz.Combine

theorem eq_3_35_3_36 {s r : ℕ} (ν ν' : Fin r → Fin s → ℕ) (α : Fin s → ℝ) (hα : ∀ i, 0 ≤ α i)
    (β : Fin r → ℝ)
    (θ₁ θ₂ : Fin s → ℝ) (hθ₁ : ∀ i, 0 ≤ θ₁ i) (hθ₂ : ∀ i, 0 ≤ θ₂ i)
    (hdisj : Disjoint (KangKurtz.SCC.GammaMinus ν ν' θ₁) (KangKurtz.SCC.GammaPlus ν ν' θ₂))
    (c₁ c₂ : ℝ) (hc₁ : 0 < c₁) (hc₂ : 0 < c₂) :
    (KangKurtz.SCC.maxRho ν α β (KangKurtz.SCC.GammaMinus ν ν' θ₁) ≤ KangKurtz.SCC.maxRho ν α β (KangKurtz.SCC.GammaMinus ν ν' (c₁ • θ₁ + c₂ • θ₂)) ∧
      KangKurtz.SCC.maxRho ν α β (KangKurtz.SCC.GammaMinus ν ν' (c₁ • θ₁ + c₂ • θ₂)) ≤
        KangKurtz.SCC.maxRho ν α β (KangKurtz.SCC.GammaMinus ν ν' θ₁) ⊔ KangKurtz.SCC.maxRho ν α β (KangKurtz.SCC.GammaMinus ν ν' θ₂)) ∧
    (KangKurtz.SCC.maxRho ν α β (KangKurtz.SCC.GammaPlus ν ν' θ₂) ≤ KangKurtz.SCC.maxRho ν α β (KangKurtz.SCC.GammaPlus ν ν' (c₁ • θ₁ + c₂ • θ₂)) ∧
      KangKurtz.SCC.maxRho ν α β (KangKurtz.SCC.GammaPlus ν ν' (c₁ • θ₁ + c₂ • θ₂)) ≤
        KangKurtz.SCC.maxRho ν α β (KangKurtz.SCC.GammaPlus ν ν' θ₁) ⊔ KangKurtz.SCC.maxRho ν α β (KangKurtz.SCC.GammaPlus ν ν' θ₂)) := by sorry

end KangKurtz.Combine
Source
Kang and Kurtz, Separation of time-scales and model reduction for stochastic reaction networks, arXiv:1011.1672v1, p. 19, §3.4, proof of Lemma 3.8, (3.35)–(3.36)
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