catch_up_value_triple_win_of_sum_gt
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_gt (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 6
- 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…
- CatchUpOutcomeThe three possible outcomes of a game of Catch-Up, from the point of view of a fixed player: win, loss, draw.
- catch_up_value_auxThe game value of a Catch-Up position for the player about to move. If nothing remains, compare scores. If even all remaining numbers…
- 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_singletonIn a Catch-Up position with a single remaining piece x, current score s_me, and opponent score s_opp, the game value for the mover is win…
- catch_up_outcome_best_eq_lossUnder Catch-Up's best-outcome aggregation on a list of outcomes, the aggregated outcome is a loss if and only if every outcome in the list…
- Used by 1
- QuantumMechanics.OneDimension.HilbertSpace.parityOperatorSchwartzThe parity operator on the Schwartz maps is defined as the linear map from
𝓢(ℝ, ℂ)to itself, such thatψis taken tofun x => ψ (-x).
- QuantumMechanics.OneDimension.HilbertSpace.parityOperatorSchwartzThe parity operator on the Schwartz maps is defined as the linear map from
Read back from the Lean
For any three natural numbers $x$, $y$, and $z$, if $x < y$, $y < z$, and $x + y > z$, then the game of Catch-Up played on the three-element set $\{x, y, z\}$ results in a win for the first player (that is, catch_up_value {x, y, z} = 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
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
/-- For any natural numbers x < y < z such that x + y > z, the game value of Catch-Up played on {x, y, z} is CatchUpOutcome.win. -/theorem catch_up_value_triple_win_of_sum_gt (x y z : ℕ) (hxy : x < y) (hyz : y < z) (hsum : x + y > z) : catch_up_value {x, y, z} = CatchUpOutcome.win := by have hxz : x < z := lt_trans hxy hyz have hyz_ne : y ≠ z := ne_of_lt hyz have hne : ({x, y, z} : Finset ℕ).Nonempty := by simp rw [catch_up_value_eq_win_iff _ hne] refine ⟨x, by simp, ?_⟩ rw [Finset.erase_insert (by simp [ne_of_lt hxy, ne_of_lt hxz])] have hne_yz : ({y, z} : Finset ℕ) ≠ ∅ := by simp rw [catch_up_value_aux.eq_def] simp only [hne_yz, if_false] have hsum_lt : ¬ (0 + ∑ i ∈ ({y, z} : Finset ℕ), i < x) := by simp [hyz_ne] omega simp only [hsum_lt, if_false] rw [catch_up_outcome_best_eq_loss] intro o ho simp only [List.mem_map, Finset.mem_toList, Finset.mem_attach, true_and] at ho rcases ho with ⟨⟨w, hw⟩, rfl⟩ have hw_cases : w = y ∨ w = z := by simpa using hw cases hw_cases with | inl h => subst w dsimp only simp only [Bool.false_eq_true, ↓reduceIte, ge_iff_le] have hge' : x ≤ 0 + y := by omega simp only [hge', ↓reduceIte] rw [Finset.erase_insert (by simp [hyz_ne])] rw [catch_up_value_aux_singleton] split_ifs with h1 h2 · rfl · omega · omega | inr h => subst w dsimp only simp only [Bool.false_eq_true, ↓reduceIte, ge_iff_le] have hge' : x ≤ 0 + z := by omega simp only [hge', ↓reduceIte] rw [Finset.erase_insert_of_ne hyz_ne, Finset.erase_singleton, Finset.insert_empty] rw [catch_up_value_aux_singleton] split_ifs with h1 h2 · rfl · omega · omega