Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 3.12 — a star topology costs at most 2⋅cmin⁡(F)2\cdot c_{\min}(\mathcal F)2⋅cmin​(F)

Proved
LNTopology.StarBound.corollary_3_12

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

approximationlightning-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 with ∑i∈Vfi=0\sum_{i\in V}f_i=0∑i∈V​fi​=0. For every hub h∈Vh\in Vh∈V, the star Λh\Lambda^{h}Λh centered at hhh (each node i≠hi\neq hi=h has a single channel, to hhh, carrying its flow fif_ifi​) satisfies

c(Λh)  ≤  2 cmin⁡(F),c(\Lambda^{h})\;\le\;2\,c_{\min}(\mathcal F),c(Λh)≤2cmin​(F),

where cmin⁡(F)c_{\min}(\mathcal F)cmin​(F) is the minimal cost of a Lightning Network on VVV that supports F\mathcal FF.

The star is the natural candidate for a cost-minimal topology; Corollary 3.11 shows it is generally not optimal, and this corollary shows that it is never worse than optimal by more than a factor of two, for every cost function satisfying the axioms.

Formalization Note. The bound is stated for every hub, matching the paper's sentence "the star topology is at most twice as costly as the minimum"; the paper's proof uses one particular hub. cmin⁡c_{\min}cmin​ is an infimum over Lightning Networks on the same node set (the paper's "min" need not be attained when ccc is discontinuous). The hypothesis ∑ifi=0\sum_i f_i=0∑i​fi​=0 is the model's standing identity (§2, p. 4) and is required: without it cmin⁡c_{\min}cmin​ is a junk value. (SA) is 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, which would make the statement vacuous).

Preamble
import Mathlib
import Definitions.Def_LNTopology_StarBound_Model
import Definitions.Def_LNTopology_StarBound_MinCost
import Definitions.Def_LNTopology_Local_Star
Formal statement
namespace LNTopology.StarBound

/-- Corollary 3.12, p. 9: for any flow `f` (with `∑ i, f i = 0`), the LNTopology.Local.star centered at any hub
costs at most twice the minimal cost of a Lightning Network supporting `f`. -/
theorem corollary_3_12 {V : Type*} [Fintype V] [DecidableEq V] (c : ℝ → ℝ)
    (hc : IsChannelCost c) (f : V → ℝ) (hf : ∑ i, f i = 0) (h : V) :
    cost c (LNTopology.Local.star f h) ≤ 2 * cmin c f := by sorry

end LNTopology.StarBound
Source
Guasoni, Huberman & Shikhelman, Lightning Network Economics: Topology, SSRN 4439190 (version of Feb. 3, 2023), p. 9 (PDF 10), Corollary 3.12; proof p. 14 (PDF 15), App. C
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