AFTD Auto-Formalizing Theoretical Domains

catch_up_value_eq_eval_list

theoremverified

For a duplicate-free list l, the value of Catch-Up on the finset of l equals the computable mirror evaluated on l from scores 0, 0 at the opening move.

Statement

theorem catch_up_value_eq_eval_list (l : List ℕ) (hl : l.Nodup) :
    catch_up_value l.toFinset = catch_up_eval_list l.length l 0 0 true
Source
step towards the kernel checks catch_up_value_icc_four/seven/eight/eleven (Catch-Up: A Game in Which the Lead Alternates (Game & Puzzle Design 1(2), 2015), Table 2; computable mirror and pruned search of catch_up_value_aux)
Verified
06 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 3
  • 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_eval_listA computable mirror of catch_up_value_aux: the same Catch-Up recursion on a list of the remaining numbers, by structural recursion on a…
  • catch_up_value_aux_eq_eval_listFor every fuel n, every duplicate-free list l of length at most n, and all scores and opening flags, the Catch-Up value of the finset of l…
Used by 1
  • catch_up_value_icc_eq_evalThe value of Catch-Up on {1, ..., N} equals the computable mirror evaluated on the list [1, ..., N]; this is what lets the kernel settle…

Lean source view module on GitHub

/-- Catch-Up on the finset of a duplicate-free list, computed by the mirror. -/
theorem catch_up_value_eq_eval_list (l : List ℕ) (hl : l.Nodup) :
    catch_up_value l.toFinset = catch_up_eval_list l.length l 0 0 true :=
  catch_up_value_aux_eq_eval_list l.length l hl le_rfl 0 0 true
See it in the graphDiscuss this resultChallenge it