Eq. (19):
ProvedLightningNetwork.RateBounds.eq_19_cosh_boundlightning-networkoperations-researchpayment-channels
- For every real , .
- Consequently, for all real and ,
This replaces the hyperbolic condition in (18) by an exponential one.
Differences from the source:
- generalization: C > 0 (the cost of an on-chain transaction) and 0 < α < 1 → C and α any real numbers; reason: (19) is the instance x = C − α of the bound on cosh x, which the page states for every real x; the statement specializes to the page's C and α
Preamble
import Mathlib
Formal statement
namespace LightningNetwork.RateBounds
/-- **Inequality (19).**
Guasoni, Huberman, Shikhelman, *Lightning Network Economics: Channels*, Management Science (2023),
doi:10.1287/mnsc.2022.01664, proof of Theorem 2(i), eq. (19), p. 11: "Recall now that
cosh(x) = (e^x + e^{−x})/2 ≤ (e^{|x|} + 1)/2, whence 2(cosh(C − α) − 1) ≤ e^{|C−α|} − 1."
1. `cosh x ≤ (e^{|x|} + 1)/2` for every real `x`;
2. `2(cosh(C − α) − 1) ≤ e^{|C − α|} − 1` for all real `C`, `α`. -/
theorem eq_19_cosh_bound :
(∀ x : ℝ, Real.cosh x ≤ (Real.exp |x| + 1) / 2) ∧
∀ C α : ℝ, 2 * (Real.cosh (C - α) - 1) ≤ Real.exp |C - α| - 1 := 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. (19), p. 11