(14)–(15), p. 14 — every supporting network costs at least and at least
ProvedLNTopology.StarBound.eq_14_15Let be a finite set of nodes, a channel cost function satisfying (MO), (SY), (CI) and (SA), and a payment flow. Let be any Lightning Network on (anti-symmetric) that supports . Then
These are the inequalities (14) and (15) of the paper, and they give the lower bound of Theorem 3.10.
Formalization Note. The paper derives (14)–(15) for a cost-minimizing network, which by Theorem 3.1 has channels only between nodes of opposite flow signs, and it assumes such a minimizer exists. The statement here is for every supporting Lightning Network; it is the form the infimum needs, since the minimum need not be attained when is not continuous. This is a generalization of the displayed inequalities, not a restatement. (SA) is in its corrected form, for all . Under the row-sum sign convention a positive is a net payer; the statement is symmetric under .
import Mathlib import Definitions.Def_LNTopology_StarBound_Model
namespace LNTopology.StarBound
/-- (14)–(15), proof of Theorem 3.10, p. 14, for every supporting network: the cost of any
Lightning Network supporting `f` is at least the total cost of the positive flows and at least
the total cost of the negative flows. -/
theorem eq_14_15 {V : Type*} [Fintype V] (c : ℝ → ℝ) (hc : IsChannelCost c) (f : V → ℝ)
(Λ : V → V → ℝ) (hLN : IsLN Λ) (hΛ : Supports Λ f) :
∑ i ∈ Finset.univ.filter (fun i => 0 < f i), c (f i) ≤ cost c Λ ∧
∑ i ∈ Finset.univ.filter (fun i => f i < 0), c (f i) ≤ cost c Λ := by sorry
end LNTopology.StarBound
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.