Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 3.11, p. 9 — with two net payers and two net payees, no star is cost-minimizing

Proved
LNTopology.Local.corollary_3_11

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

lightning-networknetwork-designp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1star-topology

Let ccc be a channel cost function satisfying (MO), (SY), (CI) and (SA), and let F=(fi)i∈VF=(f_i)_{i\in V}F=(fi​)i∈V​ be a payment flow on a finite node set with ∑ifi=0\sum_i f_i=0∑i​fi​=0. Suppose there are distinct nodes i1≠i2i_1\neq i_2i1​=i2​ and distinct nodes j1≠j2j_1\neq j_2j1​=j2​ with

fi1, fi2>0>fj1, fj2.f_{i_1},\,f_{i_2}>0>f_{j_1},\,f_{j_2}.fi1​​,fi2​​>0>fj1​​,fj2​​.

Then for every hub h∈Vh\in Vh∈V, the star with hub hhh (each node i≠hi\ne hi=h joined only to hhh, by a channel carrying its own net flow) is not cost-minimizing for FFF.

The star topology is the natural guess for a globally cheapest network; this corollary of Theorem 3.1 shows it is cost-minimizing only when there is a single net payer or a single net payee.

Formalization Note The hypothesis ∑ifi=0\sum_i f_i=0∑i​fi​=0 (p. 4: "the sum of all the flows is 0") is stated because no network is given: it is what makes the star support FFF. Under the row-sum convention a node with fi>0f_i>0fi​>0 is a net payer; the statement is symmetric under F↦−FF\mapsto-FF↦−F, so the paper's opposite sign convention gives the same theorem. (SA) is used in the corrected form for all x,y>0x,y>0x,y>0 (the printed range is unsatisfiable). Cost-minimizing compares with networks on the same node set.

Preamble
import Mathlib
import Definitions.Def_LNTopology_Local_Model
import Definitions.Def_LNTopology_Local_Star
Formal statement
namespace LNTopology.Local

/-- Corollary 3.11 (SSRN 4439190, p. 9; proof p. 13): if the flow `f` (summing to zero) has two
distinct nodes with positive flow and two distinct nodes with negative flow, then no star
network, whatever its hub, is cost-minimizing for `f`. -/
theorem corollary_3_11 {V : Type*} [Fintype V] [DecidableEq V] (c : ℝ → ℝ)
    (hc : IsChannelCost c) (f : V → ℝ) (hsum : ∑ i, f i = 0)
    (i₁ i₂ j₁ j₂ : V) (hi : i₁ ≠ i₂) (hj : j₁ ≠ j₂)
    (hi₁ : 0 < f i₁) (hi₂ : 0 < f i₂) (hj₁ : f j₁ < 0) (hj₂ : f j₂ < 0) :
    ∀ h : V, ¬ IsCostMinimizing c f (star f h) := by sorry

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