Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eqs. (17)–(20), p. 11 — if κ≥(eC−1)/B\kappa\ge(e^C-1)/Bκ≥(eC−1)/B then F(m)>0F(m)>0F(m)>0 for every m>0m>0m>0

Proved
LNChannels.RateBounds.eq_17_20

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

lightning-networkp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1payment-channels

Let B>0B>0B>0, κ>0\kappa>0κ>0, C∈RC\in\mathbb RC∈R and

F(m)=C1−eκ+Beκm−1+m.F(m)=\frac{C}{1-e^{\kappa}}+\frac{B}{e^{\kappa m}-1}+m .F(m)=1−eκC​+eκm−1B​+m.

If

κ ≥ eC−1B,\kappa\ \ge\ \frac{e^{C}-1}{B},κ ≥ BeC−1​,

then F(m)>0F(m)>0F(m)>0 for every real m>0m>0m>0.

With κ=log⁡(1+r/λ)\kappa=\log(1+r/\lambda)κ=log(1+r/λ), F(m)F(m)F(m) is the cost of a unidirectional channel of size mmm minus the on-chain cost λC/r\lambda C/rλC/r, so under this condition on-chain settlement is strictly cheaper than a unidirectional channel of any size. This is the sufficient condition (17)–(20) from which Theorem 2(i) follows.

Formalization Note The paper concludes "F(m^)≥0F(\hat m)\ge0F(m^)≥0 by (17)", but (17) is strict and the strict conclusion is what Theorem 2(i)'s strict inequality needs; the strict form is stated, for all m>0m>0m>0 rather than only at the minimizer m^\hat mm^. The paper's argument chooses α≤C/(C+1)\alpha\le C/(C+1)α≤C/(C+1), which needs C>0C>0C>0; no sign is imposed on CCC here, since for C≤0C\le0C≤0 every term of FFF is nonnegative and m>0m>0m>0.

Preamble
import Mathlib
import Definitions.Def_LNChannels_RateBounds_ClosedForms
Formal statement
namespace LNChannels.RateBounds

/-- (17)–(20), p. 11: if `κ ≥ (e^C − 1)/B` then `F(m) = C/(1 − e^κ) + B/(e^{κm} − 1) + m` is
strictly positive for every `m > 0` (on-chain settlement is strictly cheaper than a unidirectional
channel of any size). -/
theorem eq_17_20 (B κ C : ℝ) (hB : 0 < B) (hκ : 0 < κ) (hκC : (Real.exp C - 1) / B ≤ κ) :
    ∀ m : ℝ, 0 < m → 0 < C / (1 - Real.exp κ) + B / (Real.exp (κ * m) - 1) + m := by sorry

end LNChannels.RateBounds
Source
Guasoni, Huberman & Shikhelman, Lightning Network Economics: Channels, Management Science (Articles in Advance, Nov. 6, 2023), DOI 10.1287/mnsc.2022.01664, p. 11 (PDF p. 12), proof of Theorem 2(i), eqs. (17)–(20)
Human review
  • Endorsed by Shuze Chen · Oct 15, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 15, 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