AFTD Auto-Formalizing Theoretical Domains

catch_up_value_aux_sub_scores

theoremverified

In Catch-Up, when the mover's score s_me is at most the opponent's score s_opp, the game value equals that from scores 0 and s_opp - s_me.

Statement

theorem catch_up_value_aux_sub_scores (remaining : Finset ℕ) (s_me s_opp : ℕ) (hle : s_me ≤ s_opp) (isFirstMove : Bool) :
    catch_up_value_aux remaining s_me s_opp isFirstMove =
      catch_up_value_aux remaining 0 (s_opp - s_me) isFirstMove
Source
step towards the Catch-Up conjecture (Catch-Up: A Game in Which the Lead Alternates (Game & Puzzle Design 1(2), 2015), Sec. 3.1; formal-conjectures CatchUpConjecture.lean) (Catch-Up ladder step)
Verified
06 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 2
  • catch_up_value_aux_add_scoresIn Catch-Up, adding a constant c to both the mover's and the opponent's score leaves the game value unchanged, because only score…
  • 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…

Lean source view module on GitHub

/-- In Catch-Up, when the mover's score is at most the opponent's score, the game value depends only on the score difference (the deficit). -/theorem catch_up_value_aux_sub_scores (remaining : Finset ℕ) (s_me s_opp : ℕ) (hle : s_me ≤ s_opp) (isFirstMove : Bool) :    catch_up_value_aux remaining s_me s_opp isFirstMove =      catch_up_value_aux remaining 0 (s_opp - s_me) isFirstMove := by  have h := catch_up_value_aux_add_scores remaining 0 (s_opp - s_me) s_me isFirstMove  rw [zero_add, Nat.sub_add_cancel hle] at h  exact h
See it in the graphDiscuss this resultChallenge it