Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Lemma 3.4, p. 15 — the balance condition passes across components

Proved
KangKurtz.SCC.lemma_3_4

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

balance-conditionmultiscalep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1reaction-networksstrongly-connected-components

Let θ≥0\theta\ge0θ≥0 be a species-weight vector and fix a real time-scale exponent γ\gammaγ. Suppose θ=∑j=1mθj\theta=\sum_{j=1}^m\theta^jθ=∑j=1m​θj, with each nonnegative piece supported in a maximal strongly connected component of the species graph and distinct pieces belonging to distinct components. Then all three assertions of Lemma 3.4 hold:

(∀j,Cond⁡3.2(γ,θj))⟹Cond⁡3.2(γ,θ),(∀j,Balance⁡(θj))⟹Balance⁡(θ),(∀j,γ≤γθj)⟹γ≤γθ.\begin{aligned} (\forall j,\operatorname{Cond}_{3.2}(\gamma,\theta^j))&\Longrightarrow\operatorname{Cond}_{3.2}(\gamma,\theta),\\ (\forall j,\operatorname{Balance}(\theta^j))&\Longrightarrow\operatorname{Balance}(\theta),\\ (\forall j,\gamma\le\gamma_{\theta^j})&\Longrightarrow\gamma\le\gamma_\theta. \end{aligned}(∀j,Cond3.2​(γ,θj))(∀j,Balance(θj))(∀j,γ≤γθj​)​⟹Cond3.2​(γ,θ),⟹Balance(θ),⟹γ≤γθ​.​

The result makes component-level balance checks sufficient for a sum of pieces in different components.

Formalization Note The reaction network follows the paper's standing at-most-binary consumption restriction. The component conditions are stated as support containment within one mutual-reachability class and distinctness of classes. Empty maxima are −∞-\infty−∞, and the time-scale bound with no sign-changing reactions is automatically true.

Preamble
import Mathlib
import Definitions.Def_KangKurtz_SCC_Setting
Formal statement
namespace KangKurtz.SCC

theorem lemma_3_4
    {s r : ℕ} (ν ν' : Fin r → Fin s → ℕ)
    (hbinary : BinaryReactions ν)
    (α : Fin s → ℝ) (hα : ∀ i, 0 ≤ α i)
    (β : Fin r → ℝ) (γ : ℝ)
    (θ : Fin s → ℝ) (hθ : ∀ i, 0 ≤ θ i)
    {m : ℕ} (θs : Fin m → Fin s → ℝ)
    (hθs : ∀ j i, 0 ≤ θs j i)
    (hsum : θ = ∑ j, θs j)
    (hone : ∀ j i i', θs j i ≠ 0 → θs j i' ≠ 0 → SameComp ν ν' i i')
    (hdist : ∀ j j', j ≠ j' → ∀ i i',
      θs j i ≠ 0 → θs j' i' ≠ 0 → ¬ SameComp ν ν' i i') :
    ((∀ j, Cond32 ν ν' α β γ (θs j)) → Cond32 ν ν' α β γ θ) ∧
    ((∀ j, Balance ν ν' α β (θs j)) → Balance ν ν' α β θ) ∧
    ((∀ j, TimeScale ν ν' α β γ (θs j)) → TimeScale ν ν' α β γ θ) := by sorry
end KangKurtz.SCC
Source
Kang and Kurtz, Separation of time-scales and model reduction for stochastic reaction networks, arXiv:1011.1672v1, p. 15, §3.4, Lemma 3.4
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