Lemma 1 — for nonnegative integers
ProvedCongestionPoA.AsymSum.lemma1inequalityp2o-batch-pfp1ap2o-gran-per-chapterp2o-plan-paperp2o-v1price-of-anarchy
For every pair of nonnegative integers ,
This elementary inequality is the arithmetic heart of the bound for the average social cost: applied facility by facility with and , it turns the bound obtained from the Nash conditions into a bound by .
Formalization Note and are natural numbers and the inequality is read in the reals. The hypothesis that they are integers is essential: for real , the left side is and the right side is .
Preamble
import Mathlib
Formal statement
namespace CongestionPoA.AsymSum
/-- Christodoulou and Koutsoupias, *The Price of Anarchy of Finite Congestion Games*, STOC 2005,
PDF p. 3, Lemma 1: for every pair of nonnegative integers `α, β`,
`β(α + 1) ≤ (1/3)α² + (5/3)β²`.
**Formalization Note.** `α` and `β` range over `ℕ` and the inequality is read in `ℝ`. Integrality is
essential: over the reals the inequality fails at `α = 0`, `β = 1/2`. -/
theorem lemma1 (α β : ℕ) :
(β : ℝ) * ((α : ℝ) + 1) ≤ (1 / 3 : ℝ) * (α : ℝ) ^ 2 + (5 / 3 : ℝ) * (β : ℝ) ^ 2 := by sorry
end CongestionPoA.AsymSum
Source
Christodoulou and Koutsoupias, The Price of Anarchy of Finite Congestion Games, STOC 2005, DOI 10.1145/1060590.1060600, PDF p. 3, Lemma 1
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.