Proof of Theorem 3.10, p. 14 — a node's channels cost at least the cost of its net flow
ProvedLNTopology.StarBound.node_subadditivitylightning-networkp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1payment-channelssubadditivity
Let be a finite set of nodes, a channel cost function satisfying (MO), (SY), (CI) and (SA), and a payment flow. Let be a matrix with for every node . Then for every node ,
This is the first step of the lower bound in Theorem 3.10: the channels of a single node cost at least as much as one channel carrying that node's net flow.
Formalization Note. The channel flows have mixed signs, so the inequality is a many-term consequence of (MO), (SY), (CI) and (SA) together, not the two-term axiom (SA) itself. Anti-symmetry of is not needed and not assumed. (SA) is used in its corrected form, for all (the printed range is unsatisfiable).
Preamble
import Mathlib import Definitions.Def_LNTopology_StarBound_Model
Formal statement
namespace LNTopology.StarBound
/-- Proof of Theorem 3.10, p. 14: for a network supporting `f`, the cost of node `i`'s
channels is at least the cost of its net flow, `c (f i) ≤ ∑_j c (Λ i j)`. -/
theorem node_subadditivity {V : Type*} [Fintype V] (c : ℝ → ℝ) (hc : IsChannelCost c)
(f : V → ℝ) (Λ : V → V → ℝ) (hΛ : Supports Λ f) (i : V) :
c (f i) ≤ ∑ j, c (Λ i j) := by sorry
end LNTopology.StarBound
Source
Guasoni, Huberman & Shikhelman, Lightning Network Economics: Topology, SSRN 4439190 (version of Feb. 3, 2023), p. 14 (PDF 15), App. C, proof of Theorem 3.10 (lower bound, first paragraph)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.