Proof of Theorem 3.10, pp. 13–14 — the star supports and costs
ProvedLNTopology.StarBound.star_supports_costLet be a finite set of nodes, a channel cost function satisfying (MO), (SY), (CI) and (SA), and a payment flow with
Then for every hub , the star centered at
- is a Lightning Network (anti-symmetric),
- supports , and
- has cost
This is the construction behind the upper bound of Theorem 3.10 and behind Corollary 3.12: choosing a hub with gives a supporting network of cost .
Formalization Note. The paper fixes the hub with and then writes ; this fails when the most negative flow has the larger magnitude. The statement here holds for every hub, which is what the paper's computation shows; the hub maximizing is chosen in Theorem 3.10. The star uses (the paper writes , the opposite sign under the row-sum convention); the cost is the same by (SY). (SA) is in its corrected form, for all .
import Mathlib import Definitions.Def_LNTopology_StarBound_Model import Definitions.Def_LNTopology_Local_Star
namespace LNTopology.StarBound
/-- Proof of Theorem 3.10, pp. 13–14: when `∑ i, f i = 0`, the LNTopology.Local.star centered at any hub `h`
is a Lightning Network that supports `f`, and its cost is `∑_i c (f i) - c (f h)`. -/
theorem star_supports_cost {V : Type*} [Fintype V] [DecidableEq V] (c : ℝ → ℝ)
(hc : IsChannelCost c) (f : V → ℝ) (hf : ∑ i, f i = 0) (h : V) :
IsLN (LNTopology.Local.star f h) ∧ Supports (LNTopology.Local.star f h) f ∧
cost c (LNTopology.Local.star f h) = ∑ i, c (f i) - c (f h) := by sorry
end LNTopology.StarBound
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.