Eq. (16): , with the estimate
ProvedLightningNetwork.RateBounds.eq_16_lower_boundlightning-networkoperations-researchpayment-channels
Let (on-chain cost), (reset cost) and . Then
- for every , (from );
- if , then
These lower-bound the first two terms of the minimum in the proof of Theorem 2(i).
Differences from the source: none.
Preamble
import Mathlib
Formal statement
namespace LightningNetwork.RateBounds
/-- **Inequality (16), with the elementary estimate that precedes it.**
Guasoni, Huberman, Shikhelman, *Lightning Network Economics: Channels*, Management Science (2023),
doi:10.1287/mnsc.2022.01664, proof of Theorem 2(i), eq. (16), p. 11: "For this purpose, note first
that the elementary estimate e^x > 1 + x for x > 0 implies that C/(1 − e^κ) > −C/κ for all κ > 0.
Note also that 2B/(Bκ + √(Bκ(Bκ + 4))) ≥ α/κ for κ ≥ α²/(B(1 − α)), 0 < α < 1."
For an on-chain cost `C > 0`, a reset cost `B > 0` and `0 < α < 1`:
1. `C/(1 − e^κ') > −C/κ'` for every `κ' > 0`;
2. if `κ ≥ α²/(B(1 − α))` then `2B/(Bκ + √(Bκ(Bκ + 4))) ≥ α/κ`.
**Formalization Note.** `C > 0` is the model's (C is the cost of an on-chain transaction); the
estimate uses it. In clause 2, `κ > 0` follows from the hypotheses. -/
theorem eq_16_lower_bound (B C α κ : ℝ) (hB : 0 < B) (hC : 0 < C) (hα0 : 0 < α) (hα1 : α < 1)
(hκ : α ^ 2 / (B * (1 - α)) ≤ κ) :
(∀ κ' : ℝ, 0 < κ' → -C / κ' < C / (1 - Real.exp κ')) ∧
α / κ ≤ 2 * B / (B * κ + Real.sqrt (B * κ * (B * κ + 4))) := by sorry
end LightningNetwork.RateBounds
Source
Guasoni, Huberman, Shikhelman, Lightning Network Economics: Channels, Management Science (2023), doi:10.1287/mnsc.2022.01664, proof of Theorem 2(i), eq. (16) and the sentence before it, p. 11