Eq. (21), p. 11 — the excess cost of a symmetric channel is no smaller than at equal sizes
ProvedLNChannels.RateBounds.diagonal_reductionLet , , , and consider for real
For all real , with ,
By the previous milestone, is the cost of a symmetric bidirectional channel minus the on-chain cost . 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 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 and is no larger than at either point. It is exactly what the proof of Theorem 2(ii) uses.
import Mathlib import Definitions.Def_LNChannels_RateBounds_ClosedForms
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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.