Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3.6, p. 17 — if θ¹ is balanced at a level above every ρ_k of Γ^±_{θ²}, then c₁θ¹ + c₂θ² is balanced

Proved
KangKurtz.Combine.lemma_3_6

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−∞.

Let θ1,θ2∈[0,∞)s0\theta^1,\theta^2\in[0,\infty)^{s_0}θ1,θ2∈[0,∞)s0​ satisfy

max⁡k∈Γθ1−ρk=max⁡k∈Γθ1+ρk>max⁡k∈Γθ2+∪Γθ2−ρk.(3.31)\max_{k\in\Gamma^-_{\theta^1}}\rho_k=\max_{k\in\Gamma^+_{\theta^1}}\rho_k>\max_{k\in\Gamma^+_{\theta^2}\cup\Gamma^-_{\theta^2}}\rho_k. \tag{3.31}k∈Γθ1−​max​ρk​=k∈Γθ1+​max​ρk​>k∈Γθ2+​∪Γθ2−​max​ρk​.(3.31)

Then for all c1,c2>0c_1,c_2>0c1​,c2​>0 the balance equation (3.7) holds for c1θ1+c2θ2c_1\theta^1+c_2\theta^2c1​θ1+c2​θ2:

max⁡k∈Γc1θ1+c2θ2−ρk=max⁡k∈Γc1θ1+c2θ2+ρk.\max_{k\in\Gamma^-_{c_1\theta^1+c_2\theta^2}}\rho_k=\max_{k\in\Gamma^+_{c_1\theta^1+c_2\theta^2}}\rho_k .k∈Γc1​θ1+c2​θ2−​max​ρk​=k∈Γc1​θ1+c2​θ2+​max​ρk​.

The strict inequality in (3.31) forces Γθ1+≠∅\Gamma^+_{\theta^1}\neq\emptysetΓθ1+​=∅; the right-hand side may be −∞-\infty−∞. This lemma handles the case of Lemma 3.8 in which both vectors are balanced at different levels.

Formalization Note. (3.31) is split into the equality and the strict inequality, both in WithBot ℝ; the maximum on the right is over the union Γθ2+∪Γθ2−\Gamma^+_{\theta^2}\cup\Gamma^-_{\theta^2}Γθ2+​∪Γθ2−​, as printed.

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

theorem lemma_3_6 {s r : ℕ} (ν ν' : Fin r → Fin s → ℕ) (α : Fin s → ℝ) (hα : ∀ i, 0 ≤ α i)
    (β : Fin r → ℝ)
    (θ₁ θ₂ : Fin s → ℝ) (hθ₁ : ∀ i, 0 ≤ θ₁ i) (hθ₂ : ∀ i, 0 ≤ θ₂ i)
    (h331_eq : KangKurtz.SCC.maxRho ν α β (KangKurtz.SCC.GammaMinus ν ν' θ₁) = KangKurtz.SCC.maxRho ν α β (KangKurtz.SCC.GammaPlus ν ν' θ₁))
    (h331_lt : KangKurtz.SCC.maxRho ν α β (KangKurtz.SCC.GammaPlus ν ν' θ₂ ∪ KangKurtz.SCC.GammaMinus ν ν' θ₂) <
      KangKurtz.SCC.maxRho ν α β (KangKurtz.SCC.GammaPlus ν ν' θ₁))
    (c₁ c₂ : ℝ) (hc₁ : 0 < c₁) (hc₂ : 0 < c₂) :
    KangKurtz.SCC.Balance ν ν' α β (c₁ • θ₁ + c₂ • θ₂) := by sorry

end KangKurtz.Combine
Source
Kang and Kurtz, Separation of time-scales and model reduction for stochastic reaction networks, arXiv:1011.1672v1, p. 17, Lemma 3.6, (3.31)
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