Theorem 3.10 —
ProvedLNTopology.StarBound.theorem_3_10Let be a nonempty finite set of nodes, a channel cost function satisfying (MO), (SY), (CI) and (SA), and a payment flow with . Then the minimal cost of a Lightning Network on supporting satisfies
The two bounds locate the globally minimal cost without computing it: the upper bound is achieved by a star topology, and the lower bound comes from the fact that each payer's (or each payee's) flow must be carried by its own channels.
Formalization Note. is an infimum, since the paper's "min" need not be attained for a discontinuous . The hypothesis is the model's standing identity (§2, p. 4); without it no network supports and would be a junk value. Nonemptiness of is needed for . (SA) is in its corrected form, for all . The statement is symmetric under , so the row-sum sign convention is immaterial.
import Mathlib import Definitions.Def_LNTopology_StarBound_Model import Definitions.Def_LNTopology_StarBound_MinCost
namespace LNTopology.StarBound
/-- Theorem 3.10, p. 8: for a flow `f` with `∑ i, f i = 0` on a nonempty finite node set,
`∑_i c(f_i) - max_i c(f_i) ≥ c_min(f) ≥ max(∑_{f_i>0} c(f_i), ∑_{f_i<0} c(f_i))`. -/
theorem theorem_3_10 {V : Type*} [Fintype V] [Nonempty V] (c : ℝ → ℝ) (hc : IsChannelCost c)
(f : V → ℝ) (hf : ∑ i, f i = 0) :
cmin c f ≤ ∑ i, c (f i) - Finset.univ.sup' Finset.univ_nonempty (fun i => c (f i)) ∧
max (∑ i ∈ Finset.univ.filter (fun i => 0 < f i), c (f i))
(∑ i ∈ Finset.univ.filter (fun i => f i < 0), c (f i)) ≤ cmin c f := by sorry
end LNTopology.StarBound
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.