Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Corollary 3.2, p. 10 — a node with an incoming and an outgoing channel makes any network non-cost-minimizing

Proved
LNTopology.Local.in_and_out

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

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

Let ccc be a channel cost function satisfying (MO), (SY), (CI) and (SA), let Λ=(λi,j)\Lambda=(\lambda_{i,j})Λ=(λi,j​) be a Lightning Network on a finite node set VVV supporting the flow FFF, and suppose some node vvv has an incoming and an outgoing channel: there are nodes u,wu,wu,w with

λu,v>0andλv,w>0.\lambda_{u,v}>0\quad\text{and}\quad\lambda_{v,w}>0 .λu,v​>0andλv,w​>0.

Then Λ\LambdaΛ is not cost-minimizing for FFF: some Lightning Network on VVV supporting FFF has strictly smaller cost.

This is Theorem 3.1 as the paper uses it in the proofs of Corollaries 3.2 and 3.3 and in Appendix C: inside an arbitrary network, where uuu and www may already share a channel and other channels are present, a relaying node still makes the network non-optimal.

Formalization Note Nothing is assumed about the rest of Λ\LambdaΛ, in particular λu,w\lambda_{u,w}λu,w​ may be nonzero. Node distinctness need not be assumed: u≠v≠wu\ne v\ne wu=v=w and u≠wu\ne wu=w follow from anti-symmetry. (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

/-- The in-and-out claim (proof of Corollary 3.2, SSRN 4439190, p. 10), i.e. Theorem 3.1 inside
an arbitrary network: if a node `v` of a Lightning Network `Λ` supporting `f` has an incoming
channel (`0 < Λ u v`) and an outgoing channel (`0 < Λ v w`), then `Λ` is not cost-minimizing
for `f`. -/
theorem in_and_out {V : Type*} [Fintype V] (c : ℝ → ℝ) (hc : IsChannelCost c)
    (f : V → ℝ) (Λ : V → V → ℝ) (hΛ : IsLN Λ) (hsupp : Supports Λ f) (u v w : V)
    (huv : 0 < Λ u v) (hvw : 0 < Λ v w) :
    ¬ IsCostMinimizing c f Λ := by sorry

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