Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(14)–(15), p. 14 — every supporting network costs at least ∑fi>0c(fi)\sum_{f_i>0}c(f_i)∑fi​>0​c(fi​) and at least ∑fi<0c(fi)\sum_{f_i<0}c(f_i)∑fi​<0​c(fi​)

Proved
LNTopology.StarBound.eq_14_15

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

lightning-networknetwork-designp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1payment-channels

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 G=(λi,j)G=(\lambda_{i,j})G=(λi,j​) be any Lightning Network on VVV (anti-symmetric) that supports F\mathcal FF. Then

c(G)  ≥  ∑i: fi>0c(fi)andc(G)  ≥  ∑i: fi<0c(fi).c(G)\;\ge\;\sum_{i:\,f_i>0}c(f_i)\qquad\text{and}\qquad c(G)\;\ge\;\sum_{i:\,f_i<0}c(f_i).c(G)≥i:fi​>0∑​c(fi​)andc(G)≥i:fi​<0∑​c(fi​).

These are the inequalities (14) and (15) of the paper, and they give the lower bound cmin⁡(F)≥max⁡(∑fi>0c(fi),∑fi<0c(fi))c_{\min}(\mathcal F)\ge\max\big(\sum_{f_i>0}c(f_i),\sum_{f_i<0}c(f_i)\big)cmin​(F)≥max(∑fi​>0​c(fi​),∑fi​<0​c(fi​)) 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 cmin⁡c_{\min}cmin​ needs, since the minimum need not be attained when ccc is not continuous. This is a generalization of the displayed inequalities, not a restatement. (SA) is in its corrected form, for all x,y>0x,y>0x,y>0. Under the row-sum sign convention a positive fif_ifi​ is a net payer; the statement is symmetric under F↦−F\mathcal F\mapsto-\mathcal FF↦−F.

Preamble
import Mathlib
import Definitions.Def_LNTopology_StarBound_Model
Formal statement
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
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, (14) and (15)
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