Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 3.3, p. 6 — a cost-minimizing Lightning Network is bipartite, with all net flows from A to B

Proved
LNTopology.Local.corollary_3_3

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

bipartite-graphlightning-networknetwork-designp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let ccc be a channel cost function satisfying (MO), (SY), (CI) and (SA), and let Λ=(λi,j)\Lambda=(\lambda_{i,j})Λ=(λi,j​) be a Lightning Network on a finite node set VVV that is cost-minimizing for a payment flow FFF. Then there is a set A⊆VA\subseteq VA⊆V, with complement B=V∖AB=V\setminus AB=V∖A, such that

  1. the channel graph of Λ\LambdaΛ — nodes VVV, an edge between iii and jjj whenever λi,j≠0\lambda_{i,j}\neq0λi,j​=0 — is bipartite with parts AAA and BBB; and
  2. every net flow goes from AAA to BBB:
λi,j>0 ⟹ i∈A and j∈B.\lambda_{i,j}>0\ \Longrightarrow\ i\in A\ \text{and}\ j\in B .λi,j​>0 ⟹ i∈A and j∈B.

This is the structural conclusion of §3.1: in a cost-minimizing Lightning Network, the nodes split into pure senders and pure receivers, and every channel joins a sender to a receiver.

Formalization Note The bipartite clause uses Mathlib's SimpleGraph.IsBipartiteWith A Aᶜ on SimpleGraph.fromRel (fun a b => Λ a b ≠ 0). The flow-direction clause is the stronger content and is stated separately. The statement is conditional: it does not claim that a cost-minimizing network exists. (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
Formal statement
namespace LNTopology.Local

/-- Corollary 3.3 (SSRN 4439190, p. 6; proof p. 10): a cost-minimizing Lightning Network is a
bipartite graph with parts `A` and `B = Aᶜ` in which every net flow goes from `A` to `B`. -/
theorem corollary_3_3 {V : Type*} [Fintype V] (c : ℝ → ℝ) (hc : IsChannelCost c)
    (f : V → ℝ) (Λ : V → V → ℝ) (hmin : IsCostMinimizing c f Λ) :
    ∃ A : Set V, (SimpleGraph.fromRel (fun a b => Λ a b ≠ 0)).IsBipartiteWith A Aᶜ ∧
      ∀ i j, 0 < Λ i j → i ∈ A ∧ j ∉ A := by sorry

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