spr_opt_three_two
On three cells with at most two rounds, the sign-preservation-with-reuse minimax value is two: spr_opt 3 2 = 2.
Statement
theorem spr_opt_three_two : spr_opt 3 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
spr_opt 3 2 = 2, which asserts that the value of the optimization function spr_opt on inputs $n = 3$ and $t = 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 establishes that on a board of three cells with at most two rounds, the sign-preservation-with-reuse minimax value is 2. Because the board size and horizon are small constants, the entire minimax game tree is finite and computable. Lean evaluates the recursive function `spr_value` directly by definitional reduction, completing the proof by reflexivity (`rfl`).
spr_opt 3 2 = 2
The definition `spr_opt 3 2` expands to `spr_value 3 2 (fun _ => none)`, which computes the minimax value of the sign-preservation game on three cells over two rounds starting from an empty board. Because all state transitions, choices, and resets operate over finite sets (subsets of `Fin 3` and boolean values), the recurrence can be evaluated purely by finite computation. Lean's kernel executes this reduction directly, simplifying the left-hand side to 2, and the proof finishes by reflexivity (`rfl`).
theorem spr_opt_three_two : spr_opt 3 2 = 2 := rfl
- The entire minimax game tree is evaluated directly by Lean's kernel via definitional reduction; no intermediate game states or moves appear explicitly in the proof.
Written by a model (gemini-3.8-flash) from the Lean source alone (no goal states were available). Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.
Lean source view module on GitHub
/-- opt(3, 2) = 2: on three cells with two rounds, the pointer can force two signs. -/theorem spr_opt_three_two : spr_opt 3 2 = 2 := rfl