Theorem 4, second sentence, PDF p. 6 — on s₁ ≤ s₂ ≤ φs₁, R = 1 + s₂/(s₁ + s₂) ≤ φ, with equality at s₂/s₁ = φ
ProvedWorstCaseEq.Speeds.R_le_goldenRatiogolden-ratiop2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1price-of-anarchy
Let be the golden ratio and let . Then
and when .
So the lower bound of Theorem 4 is largest, equal to the golden ratio, at the edge of the range on which it applies.
Formalization Note The ratio condition is written , equivalent because . The golden ratio is Mathlib's Real.goldenRatio.
Preamble
import Mathlib import Definitions.Def_agt_games import Definitions.Def_WorstCaseEq_Speeds_Model
Formal statement
namespace WorstCaseEq.Speeds
theorem R_le_goldenRatio (s₁ s₂ : ℝ) (h₁ : 0 < s₁) (h₁₂ : s₁ ≤ s₂)
(hφ : s₂ ≤ Real.goldenRatio * s₁) :
1 + s₂ / (s₁ + s₂) ≤ Real.goldenRatio ∧
(s₂ = Real.goldenRatio * s₁ → 1 + s₂ / (s₁ + s₂) = Real.goldenRatio) := by sorry
end WorstCaseEq.Speeds
Source
Koutsoupias & Papadimitriou, Worst-case equilibria (journal version, 2009), PDF p. 6, Theorem 4 (second sentence)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.