Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Lemma 3.8, p. 18 — Condition 3.2 and the balance equation (3.7) pass to c₁θ¹ + c₂θ² when Γ⁺_{θ¹} ∩ Γ⁻_{θ²} = ∅ or Γ⁻_{θ¹} ∩ Γ⁺_{θ²} = ∅

Proved
KangKurtz.Combine.lemma_3_8

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

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

Consider a reaction network with s0s_0s0​ species and r0r_0r0​ reactions, net changes ζk=νk′−νk\zeta_k=\nu'_k-\nu_kζk​=νk′​−νk​, species exponents αi≥0\alpha_i\ge0αi​≥0, reaction exponents βk∈R\beta_k\in\mathbb Rβk​∈R, 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 Γθ+={k:θ⋅ζk>0}\Gamma^+_\theta=\{k:\theta\cdot\zeta_k>0\}Γθ+​={k:θ⋅ζk​>0}, Γθ−={k:θ⋅ζk<0}\Gamma^-_\theta=\{k:\theta\cdot\zeta_k<0\}Γθ−​={k:θ⋅ζk​<0} (maxima over the empty set are −∞-\infty−∞). Fix γ∈R\gamma\in\mathbb Rγ∈R. Condition 3.2 holds for θ\thetaθ if

max⁡k∈Γθ−ρk=max⁡k∈Γθ+ρk(3.7)\max_{k\in\Gamma^-_\theta}\rho_k=\max_{k\in\Gamma^+_\theta}\rho_k \tag{3.7}k∈Γθ−​max​ρk​=k∈Γθ+​max​ρk​(3.7)

or

γ≤γθ≡max⁡i:θi>0αi−max⁡k∈Γθ+∪Γθ−ρk(3.8)\gamma\le\gamma_\theta\equiv\max_{i:\theta_i>0}\alpha_i-\max_{k\in\Gamma^+_\theta\cup\Gamma^-_\theta}\rho_k \tag{3.8}γ≤γθ​≡i:θi​>0max​αi​−k∈Γθ+​∪Γθ−​max​ρk​(3.8)

(with γθ=+∞\gamma_\theta=+\inftyγθ​=+∞ when Γθ+∪Γθ−=∅\Gamma^+_\theta\cup\Gamma^-_\theta=\emptysetΓθ+​∪Γθ−​=∅).

Let θ1,θ2∈[0,∞)s0\theta^1,\theta^2\in[0,\infty)^{s_0}θ1,θ2∈[0,∞)s0​ and c1,c2>0c_1,c_2>0c1​,c2​>0, and suppose

Γθ1+∩Γθ2−=∅orΓθ1−∩Γθ2+=∅.\Gamma^+_{\theta^1}\cap\Gamma^-_{\theta^2}=\emptyset\quad\text{or}\quad\Gamma^-_{\theta^1}\cap\Gamma^+_{\theta^2}=\emptyset .Γθ1+​∩Γθ2−​=∅orΓθ1−​∩Γθ2+​=∅.

Then:

  1. if Condition 3.2 holds for θ1\theta^1θ1 and for θ2\theta^2θ2, it holds for c1θ1+c2θ2c_1\theta^1+c_2\theta^2c1​θ1+c2​θ2;
  2. if the balance equation (3.7) holds for θ1\theta^1θ1 and for θ2\theta^2θ2, it holds for c1θ1+c2θ2c_1\theta^1+c_2\theta^2c1​θ1+c2​θ2.

Some hypothesis beyond Condition 3.2 for θ1\theta^1θ1 and θ2\theta^2θ2 is needed: the paper notes (p. 18) that for its example system (3.6) the species balance condition does not imply Condition 3.2 for θ=(1,1)\theta=(1,1)θ=(1,1); the disjointness of the sign sets is one such hypothesis. Together with the decomposition over strongly connected components (Lemma 3.4), the lemma reduces the verification of Condition 3.2 for all θ\thetaθ to a smaller family of weight vectors.

Formalization Note. The second paragraph of the printed lemma says "Condition 3.7"; the paper has no Condition 3.7, and the statement refers to the balance equation (3.7), which is what is formalized. The disjunction of the two disjointness conditions is a hypothesis of each part. Maxima are in WithBot ℝ, γθ\gamma_\thetaγθ​ is an EReal defined by cases without EReal subtraction, and α≥0\alpha\ge0α≥0, θ1,θ2≥0\theta^1,\theta^2\ge0θ1,θ2≥0 are the paper's standing assumptions.

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

theorem lemma_3_8 {s r : ℕ} (ν ν' : Fin r → Fin s → ℕ) (α : Fin s → ℝ) (hα : ∀ i, 0 ≤ α i)
    (β : Fin r → ℝ)
    (γ : ℝ) (θ₁ θ₂ : Fin s → ℝ) (hθ₁ : ∀ i, 0 ≤ θ₁ i) (hθ₂ : ∀ i, 0 ≤ θ₂ i)
    (c₁ c₂ : ℝ) (hc₁ : 0 < c₁) (hc₂ : 0 < c₂) :
    (Cond32 ν ν' α β γ θ₁ → Cond32 ν ν' α β γ θ₂ →
      (Disjoint (KangKurtz.SCC.GammaPlus ν ν' θ₁) (KangKurtz.SCC.GammaMinus ν ν' θ₂) ∨
        Disjoint (KangKurtz.SCC.GammaMinus ν ν' θ₁) (KangKurtz.SCC.GammaPlus ν ν' θ₂)) →
      Cond32 ν ν' α β γ (c₁ • θ₁ + c₂ • θ₂)) ∧
    (KangKurtz.SCC.Balance ν ν' α β θ₁ → KangKurtz.SCC.Balance ν ν' α β θ₂ →
      (Disjoint (KangKurtz.SCC.GammaPlus ν ν' θ₁) (KangKurtz.SCC.GammaMinus ν ν' θ₂) ∨
        Disjoint (KangKurtz.SCC.GammaMinus ν ν' θ₁) (KangKurtz.SCC.GammaPlus ν ν' θ₂)) →
      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. 18, Lemma 3.8
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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me