AFTD Auto-Formalizing Theoretical Domains

spr_opt_four_two

theoremverifiedoriginal

On four cells with at most two rounds, the sign-preservation-with-reuse minimax value is two: spr_opt 4 2 = 2.

Statement

theorem spr_opt_four_two : spr_opt 4 2 = 2
Related work
arXiv:2410.07623 (Explicit asymptotic bounds for sequential calibration beyond T^{2/3}), Sec. 2.2
Verified
12 Nov 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 1
  • spr_optopt(n, t): the number of signs remaining at the end of the sign-preservation-with-reuse game with n cells and at most t rounds, under…

Read back from the Lean

The value of spr_opt 4 2 is equal to 2.

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

The proof, explained

The theorem asserts that the minimax sign-preservation-with-reuse value on four cells with at most two rounds is 2. Since the state space and game tree are finite, the recursive definition of `spr_opt` is purely computational, and the equality holds by definitional reduction (reflexivity).

  1. spr_opt 4 2 = 2

    The minimax value `spr_opt 4 2` is defined recursively over finite types (`Fin 4` and `Option Bool`) via `spr_value`. Because the game tree has finite depth and branching factor, Lean computes the minimax value directly by definitional reduction, simplifying the left-hand side to 2, which matches the right-hand side by reflexivity (`rfl`).

    line 2

    theorem spr_opt_four_two : spr_opt 4 2 = 2 := by rfl

Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.

Lean source view module on GitHub

/-- opt(4, 2) = 2: on four cells with two rounds, the pointer can force two signs. -/theorem spr_opt_four_two : spr_opt 4 2 = 2 := by rfl
See it in the graphDiscuss this resultChallenge it