Lemma 3.4, p. 15 — the balance condition passes across components
ProvedKangKurtz.SCC.lemma_3_4Let be a species-weight vector and fix a real time-scale exponent . Suppose , 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:
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 , and the time-scale bound with no sign-changing reactions is automatically true.
import Mathlib import Definitions.Def_KangKurtz_SCC_Setting
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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.