Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 3.10, p. 14 — a node's channels cost at least the cost of its net flow

Proved
LNTopology.StarBound.node_subadditivity

by mikedeng1 · Oct 14, 2026 · Mathlib 0df444a (Lean v4.33.1)

lightning-networkp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1payment-channelssubadditivity

Let VVV be a finite set of nodes, ccc a channel cost function satisfying (MO), (SY), (CI) and (SA), and F=(fi)i∈V\mathcal F=(f_i)_{i\in V}F=(fi​)i∈V​ a payment flow. Let Λ=(λi,j)\Lambda=(\lambda_{i,j})Λ=(λi,j​) be a matrix with ∑j∈Vλi,j=fi\sum_{j\in V}\lambda_{i,j}=f_i∑j∈V​λi,j​=fi​ for every node iii. Then for every node iii,

∑j∈Vc(λi,j)  ≥  c(∑j∈Vλi,j)=c(fi).\sum_{j\in V}c(\lambda_{i,j})\;\ge\;c\Big(\sum_{j\in V}\lambda_{i,j}\Big)=c(f_i).j∈V∑​c(λi,j​)≥c(j∈V∑​λi,j​)=c(fi​).

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 λi,j\lambda_{i,j}λi,j​ 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 Λ\LambdaΛ is not needed and not assumed. (SA) is used in its corrected form, for all x,y>0x,y>0x,y>0 (the printed range x>y≥0x>y\ge0x>y≥0 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
  • Endorsed by Shuze Chen · Oct 14, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 14, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me