AFTD Auto-Formalizing Theoretical Domains

ag_min_aux

theoremverified

For rationals X, Y, the difference min(X,2) - min(Y,2) lies between 0 and X - Y.

Statement

theorem ag_min_aux (X Y : ℚ) :
    (0 ≤ min X 2 - min Y 2 ∧ min X 2 - min Y 2 ≤ X - Y) ∨
      (X - Y ≤ min X 2 - min Y 2 ∧ min X 2 - min Y 2 ≤ 0)
Source
step towards ag_two_exact / ag_three_lower / ag_four_lower (Computing Equilibria in Anonymous Games, FOCS 2007 (arXiv:0710.5582), concluding conjecture that s*lambda is a lower bound)
Verified
06 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Used by 1
  • agCyc_lipschitzThe cyclic game is 1/8-Lipschitz (for at least two strategies).

Lean source view module on GitHub

theorem ag_min_aux (X Y : ℚ) :    (0 ≤ min X 2 - min Y 2 ∧ min X 2 - min Y 2 ≤ X - Y) ∨      (X - Y ≤ min X 2 - min Y 2 ∧ min X 2 - min Y 2 ≤ 0) := by  rcases le_total Y X with h | h  · left    constructor    · have := min_le_min_right 2 h; linarith    · simp only [min_def]; split_ifs <;> linarith  · right    constructor    · simp only [min_def]; split_ifs <;> linarith    · have := min_le_min_right 2 h; linarith
See it in the graphDiscuss this resultChallenge it