AFTD Auto-Formalizing Theoretical Domains

spr_opt

def

opt(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 optimal play, starting from the empty board.

Statement

def spr_opt (n t : ℕ) : ℕ
Defined in
arXiv:2610.07623 (Explicit asymptotic bounds for sequential calibration beyond T^{2/3}), Sec. 2.2 (definition of opt(n, t))
Verified
07 Oct 2026
Axioms
none listed
Built on 1
  • spr_valueThe minimax value of the sign-preservation-with-reuse game with r rounds left from a given board: the pointer (maximizer) may stop or…
Used by 5
  • spr_opt_three_twoOn three cells with at most two rounds, the sign-preservation-with-reuse minimax value is two: spr_opt 3 2 = 2.
  • spr_opt_two_twoopt(2, 2) = 1: on two cells with two rounds, the labeler can keep at most one sign on the board.
  • spr_opt_three_oneOn three cells with at most one round, the sign-preservation-with-reuse minimax value is one: spr_opt 3 1 = 1.
  • spr_opt_four_twoOn four cells with at most two rounds, the sign-preservation-with-reuse minimax value is two: spr_opt 4 2 = 2.
  • spr_opt_capacity_leFor every integer k ≥ 1, board size n ∈ {2k - 1, 2k}, and horizon t, the sign-preservation-with-reuse minimax value satisfies spr_opt n t…

Lean source view module on GitHub

/-- `opt(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, starting from the empty board, under optimal play. -/
def spr_opt (n t : ℕ) : ℕ := spr_value n t fun _ => none
See it in the graphDiscuss this resultChallenge it