AFTD Auto-Formalizing Theoretical Domains

spr_opt_three_one

theoremverifiedoriginal

On three cells with at most one round, the sign-preservation-with-reuse minimax value is one: spr_opt 3 1 = 1.

Statement

theorem spr_opt_three_one : spr_opt 3 1 = 1
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 2
  • 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…
  • spr_opt_two_twoopt(2, 2) = 1: on two cells with two rounds, the labeler can keep at most one sign on the board.

Read back from the Lean

spr_opt 3 1 = 1, which asserts that for $n = 3$ and $t = 1$, the optimal value function spr_opt 3 1 equals 1.

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 three cells with one round, the minimax value of the sign-preservation-with-reuse game is spr_opt 3 1 = 1. Because the game tree on small finite parameters is finite and computable, Lean can evaluate spr_opt definitionally. The proof succeeds immediately by supplying the previously proven identity spr_opt_two_two (spr_opt 2 2 = 1), as both evaluate definitionally to 1 = 1.

  1. The minimax value on three cells with one round is one: spr_opt 3 1 = 1.

    The tactic 'first' attempts each branch in sequence, succeeding on the very first branch 'exact spr_opt_two_two'. Lean accepts this because 'spr_opt' is computable on concrete inputs; both 'spr_opt 3 1' and 'spr_opt 2 2' evaluate definitionally to 1, so the type of 'spr_opt_two_two' (which is 'spr_opt 2 2 = 1') is definitionally identical to the goal 'spr_opt 3 1 = 1'.

    line 2

    uses spr_opt_two_two

    theorem spr_opt_three_one : spr_opt 3 1 = 1 := by first | exact spr_opt_two_two | (apply spr_opt_two_two <;> assumption) | (apply spr_opt_two_two <;> simp_all) | simpa using spr_opt_two_two | (simp only [spr_opt] at *; first | exact spr_opt_two_two | (apply spr_opt_two_two <;> assumption) | (apply spr_opt_two_two <;> simp_all) | simpa using spr_opt_two_two)
spr_opt_two_two
On two cells with at most two rounds, the sign-preservation-with-reuse minimax value is one: spr_opt 2 2 = 1.

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(3, 1) = 1: on three cells with one round, optimal play achieves at most one sign. -/theorem spr_opt_three_one : spr_opt 3 1 = 1 := by first | exact spr_opt_two_two | (apply spr_opt_two_two <;> assumption) | (apply spr_opt_two_two <;> simp_all) | simpa using spr_opt_two_two | (simp only [spr_opt] at *; first | exact spr_opt_two_two | (apply spr_opt_two_two <;> assumption) | (apply spr_opt_two_two <;> simp_all) | simpa using spr_opt_two_two)
See it in the graphDiscuss this resultChallenge it