Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 3.2, p. 6 — an odd cycle is not cost-minimizing

Proved
LNTopology.Local.corollary_3_2

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

lightning-networknetwork-designodd-cyclep2o-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 supporting the flow FFF. Suppose Λ\LambdaΛ contains a cycle of odd length k≥3k\ge3k≥3: distinct nodes u1,…,uku_1,\dots,u_ku1​,…,uk​ with a channel between uju_juj​ and uj+1u_{j+1}uj+1​ for 1≤j<k1\le j<k1≤j<k and between uku_kuk​ and u1u_1u1​, the flow in each channel going in either direction,

λuj,uj+1≠0 (1≤j<k),λuk,u1≠0.\lambda_{u_j,u_{j+1}}\neq 0\ (1\le j<k),\qquad \lambda_{u_k,u_1}\neq0 .λuj​,uj+1​​=0 (1≤j<k),λuk​,u1​​=0.

Then Λ\LambdaΛ is not cost-minimizing for FFF.

Together with König's characterization of bipartite graphs, this gives Corollary 3.3: the channel graph of a cost-minimizing network has no odd cycle.

Formalization Note The cycle is a map u:{0,…,k−1}→Vu:\{0,\dots,k-1\}\to Vu:{0,…,k−1}→V (Fin k), injective, with successor given by finRotate k (j↦j+1j\mapsto j+1j↦j+1, and k−1↦0k-1\mapsto 0k−1↦0). "A channel connects" is read as a nonzero net flow, in either direction. (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.2 (SSRN 4439190, p. 6; proof p. 10): a Lightning Network containing a cycle of
odd length `k` — distinct nodes `u 0, …, u (k-1)` with a channel (nonzero net flow, in either
direction) between `u j` and its cyclic successor `u (finRotate k j)` — is not cost-minimizing. -/
theorem corollary_3_2 {V : Type*} [Fintype V] (c : ℝ → ℝ) (hc : IsChannelCost c)
    (f : V → ℝ) (Λ : V → V → ℝ) (hΛ : IsLN Λ) (hsupp : Supports Λ f)
    (k : ℕ) (hk : 3 ≤ k) (hodd : Odd k) (u : Fin k → V) (hu : Function.Injective u)
    (hcyc : ∀ j : Fin k, Λ (u j) (u (finRotate k j)) ≠ 0) :
    ¬ IsCostMinimizing c f Λ := 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.2; 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