Display (21) — for
ProvedCongestionApproxPNE.display_21algorithmic-game-theoryasymptoticsp2o-gran-per-chapterp2o-plan-paperp2o-v1real-analysis
For all real ,
The paper cites this pair of inequalities (NIST Handbook of Mathematical Functions, Eq. 4.5.13) and uses them to bound both halves of the sequence in Lemma 3.
Formalization Note The exponent is real, so is the real power Real.rpow of a positive base.
Differences from the source: none.
Preamble
import Mathlib set_option autoImplicit false
Formal statement
namespace CongestionApproxPNE
/-- **Display (21): `exp(xy/(x+y)) < (1 + x/y)^y < exp(x)` for all `x, y > 0`.**
Christodoulou, Gairing, Giannakopoulos, Poças, Waldmann, *Existence and Complexity of Approximate
Equilibria in Weighted Congestion Games*, arXiv:2002.07466v3, Appendix A, proof of Lemma 3, display (21), p.23: "exp(xy/(x + y)) < (1 + x/y)^y < exp(x),
for all x, y > 0." (cited there from the NIST Handbook, Eq. 4.5.13).
**Formalization Note** `y` is real, so `(1 + x/y)^y` is `Real.rpow` (its base is positive). -/
theorem display_21 (x y : ℝ) (hx : 0 < x) (hy : 0 < y) :
Real.exp (x * y / (x + y)) < (1 + x / y) ^ y ∧ (1 + x / y) ^ y < Real.exp x := by sorry
end CongestionApproxPNE
Source
Christodoulou et al., Existence and Complexity of Approximate Equilibria in Weighted Congestion Games, arXiv:2002.07466v3, Appendix A, proof of Lemma 3, display (21), p.23 (PDF p.24)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.