AFTD Auto-Formalizing Theoretical Domains

ag_abs_aux

theoremverified

Elementary inequality behind the Lipschitz bound.

Statement

theorem ag_abs_aux (a b d : ℚ) (hb : (0 ≤ b ∧ b ≤ d) ∨ (d ≤ b ∧ b ≤ 0)) :
    2 * |a + b| ≤ |a| + |d| + |a + d|
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

/-- Elementary inequality behind the Lipschitz bound. -/theorem ag_abs_aux (a b d : ℚ) (hb : (0 ≤ b ∧ b ≤ d) ∨ (d ≤ b ∧ b ≤ 0)) :    2 * |a + b| ≤ |a| + |d| + |a + d| := by  rcases hb with ⟨h1, h2⟩ | ⟨h1, h2⟩ <;>    rcases abs_cases (a + b) with ⟨e1, _⟩ | ⟨e1, _⟩ <;>    rcases abs_cases a with ⟨e2, _⟩ | ⟨e2, _⟩ <;>    rcases abs_cases d with ⟨e3, _⟩ | ⟨e3, _⟩ <;>    rcases abs_cases (a + d) with ⟨e4, _⟩ | ⟨e4, _⟩ <;>    linarith
See it in the graphDiscuss this resultChallenge it