Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq. (21), p. 11 — the excess cost of a symmetric channel is no smaller than at equal sizes l1=l2=(l1+l2)/2l_1=l_2=(l_1+l_2)/2l1​=l2​=(l1​+l2​)/2

Proved
LNChannels.RateBounds.diagonal_reduction

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

convexitylightning-networkp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let α>1\alpha>1α>1, B≥0B\ge0B≥0, C∈RC\in\mathbb RC∈R, and consider for real x,y>0x,y>0x,y>0

H(x,y)=x+y+B(αx+αy)(αx−1)(αy−1)−2Cα(α−1)2.H(x,y)=x+y+\frac{B(\alpha^{x}+\alpha^{y})}{(\alpha^{x}-1)(\alpha^{y}-1)}-\frac{2C\alpha}{(\alpha-1)^2}.H(x,y)=x+y+(αx−1)(αy−1)B(αx+αy)​−(α−1)22Cα​.

For all real l1,l2>0l_1,l_2>0l1​,l2​>0, with m=(l1+l2)/2m=(l_1+l_2)/2m=(l1​+l2​)/2,

H(m,m)≤H(l1,l2)andH(m,m)=2m+2Bαm(αm−1)2−2Cα(α−1)2.(21)H(m,m)\le H(l_1,l_2)\qquad\text{and}\qquad H(m,m)=2m+\frac{2B\alpha^{m}}{(\alpha^{m}-1)^2}-\frac{2C\alpha}{(\alpha-1)^2}.\tag{21}H(m,m)≤H(l1​,l2​)andH(m,m)=2m+(αm−1)22Bαm​−(α−1)22Cα​.(21)

By the previous milestone, H(l1,l2)H(l_1,l_2)H(l1​,l2​) is the cost of a symmetric bidirectional channel minus the on-chain cost 2Cλ/r2C\lambda/r2Cλ/r. Hence a symmetric channel is cheaper than on-chain settlement for some sizes only if it is for some equal sizes, and the two-variable problem reduces to the one-variable function (21).

Formalization Note The paper argues that HHH is strictly convex and symmetric, so its minimizer is unique and lies on the diagonal. That argument presupposes that a minimizer exists. The statement here is the midpoint form, which needs no minimizer: the value at the midpoint of (l1,l2)(l_1,l_2)(l1​,l2​) and (l2,l1)(l_2,l_1)(l2​,l1​) is no larger than at either point. It is exactly what the proof of Theorem 2(ii) uses.

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

/-- (21), p. 11, midpoint form: for `α > 1`, `B ≥ 0` and real sizes `l₁, l₂ > 0`, the function
`H(x, y) = x + y + B(α^x + α^y)/((α^x − 1)(α^y − 1)) − 2Cα/(α − 1)²` satisfies
`H(m, m) ≤ H(l₁, l₂)` at `m = (l₁ + l₂)/2`, and `H(m, m) = 2m + 2Bα^m/(α^m − 1)² − 2Cα/(α − 1)²`. -/
theorem diagonal_reduction (α B C l₁ l₂ : ℝ) (hα : 1 < α) (hB : 0 ≤ B) (hl₁ : 0 < l₁)
    (hl₂ : 0 < l₂) :
    let H : ℝ → ℝ → ℝ := fun x y =>
      x + y + B * (α ^ x + α ^ y) / ((α ^ x - 1) * (α ^ y - 1)) - 2 * C * α / (α - 1) ^ 2
    let m := (l₁ + l₂) / 2
    H m m ≤ H l₁ l₂ ∧
      H m m = 2 * m + 2 * B * α ^ m / (α ^ m - 1) ^ 2 - 2 * C * α / (α - 1) ^ 2 := 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(ii), eq. (21)
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