Proof of Theorem 2(ii), p. 11 — the cost of a symmetric channel is
ProvedLNChannels.RateBounds.symmetric_costlightning-networkp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1payment-channels
Let , and real sizes . Put in (4) and let . Then
- and ;
- the bidirectional cost (3) of the symmetric channel is
- , so that the on-chain cost of the two streams equals .
These identities reduce Theorem 2(ii) to the sign of a function of and alone.
Formalization Note The cost is the closed form biCost of (3) at with real sizes and real powers.
Preamble
import Mathlib import Definitions.Def_LNChannels_RateBounds_ClosedForms
Formal statement
namespace LNChannels.RateBounds
/-- Proof of Theorem 2(ii), p. 11: for `λ₁ = λ₂ = λ` the cost (3) is
`l₁ + l₂ + B(α^{l₁} + α^{l₂})/((α^{l₁} − 1)(α^{l₂} − 1))` with
`α = α₊ = (r + 2λ + √(r(4λ + r)))/(2λ) > 1`, and `λ/r = α/(α − 1)²`. -/
theorem symmetric_cost (lam r B l₁ l₂ : ℝ) (hlam : 0 < lam) (hr : 0 < r) (hl₁ : 0 < l₁)
(hl₂ : 0 < l₂) :
let α := LNChannels.Exact.alphaPlus lam lam r
α = (r + 2 * lam + √(r * (4 * lam + r))) / (2 * lam) ∧
1 < α ∧
biCost lam lam r B l₁ l₂ =
l₁ + l₂ + B * (α ^ l₁ + α ^ l₂) / ((α ^ l₁ - 1) * (α ^ l₂ - 1)) ∧
lam / r = α / (α - 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), first two displays
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.