AFTD Auto-Formalizing Theoretical Domains

catch_up_value_triple_win_of_sum_lt

theoremverifiedformalization

For any natural numbers x < y < z such that x + y < z, the game value of Catch-Up played on the three-element set {x, y, z} is CatchUpOutcome.win.

Statement

theorem catch_up_value_triple_win_of_sum_lt (x y z : ℕ) (hxy : x < y) (hyz : y < z) (hsum : x + y < z) :
    catch_up_value {x, y, z} = CatchUpOutcome.win
Formalizes
Analysis of All the End Game Possibilities in Catch-up When There Are 3 or 4 Pieces Remaining (2024)
Verified
01 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 4
  • catch_up_valueThe outcome of Catch-Up played on the finite set S of natural numbers, from the first player's point of view, assuming optimal play by…
  • catch_up_value_eq_win_iffFor any nonempty finite set S of natural numbers, the game value catch_up_value S is CatchUpOutcome.win if and only if there exists some…
  • catch_up_value_aux_loss_of_sum_ltIn a Catch-Up position, if the mover's score plus the sum of all remaining numbers is strictly less than the opponent's score, then the…
  • CatchUpOutcomeThe three possible outcomes of a game of Catch-Up, from the point of view of a fixed player: win, loss, draw.
Used by 7

Read back from the Lean

For all natural numbers $x$, $y$, and $z$, if $x < y$, $y < z$, and $x + y < z$, then the value of the Catch-Up game played on the set $\{x, y, z\}$ (starting with both players at score 0, on the first move) is a win for the first player (CatchUpOutcome.win).

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

Lean source view module on GitHub

/-- For three pieces with x < y < z and x + y < z, Catch-Up is a first-player win. -/theorem catch_up_value_triple_win_of_sum_lt (x y z : ℕ) (hxy : x < y) (hyz : y < z) (hsum : x + y < z) :    catch_up_value {x, y, z} = CatchUpOutcome.win := by  have hS : ({x, y, z} : Finset ℕ).Nonempty := ⟨z, by simp⟩  rw [catch_up_value_eq_win_iff _ hS]  refine ⟨z, by simp, ?_⟩  have herase : ({x, y, z} : Finset ℕ).erase z = {x, y} := by    ext a    simp only [Finset.mem_erase, Finset.mem_insert, Finset.mem_singleton]    constructor    · rintro ⟨hne, h | h | h⟩      · left; exact h      · right; exact h      · subst h; contradiction    · rintro (rfl | rfl)      · refine ⟨ne_of_lt (lt_trans hxy hyz), Or.inl rfl⟩      · refine ⟨ne_of_lt hyz, Or.inr (Or.inl rfl)⟩  rw [herase]  have hxy_ne : x ∉ ({y} : Finset ℕ) := by simp [ne_of_lt hxy]  have hsum' : 0 + ∑ a ∈ ({x, y} : Finset ℕ), a < z := by    rw [zero_add, Finset.sum_insert hxy_ne, Finset.sum_singleton]    exact hsum  exact catch_up_value_aux_loss_of_sum_lt {x, y} 0 z false hsum'
See it in the graphDiscuss this resultChallenge it