AFTD Auto-Formalizing Theoretical Domains

spr_move

def

The board after the labeler empties the cells of a set R and places the sign s in the selected cell j.

Statement

def spr_move {n : ℕ} (b : Fin n → Option Bool) (j : Fin n) (R : Finset (Fin n)) (s : Bool) :
    Fin n → Option Bool
Defined in
arXiv:2610.07623 (Explicit asymptotic bounds for sequential calibration beyond T^{2/3}), Sec. 2.2, steps 2-3 of a round
Verified
07 Oct 2026
Axioms
none listed
Used by 3
  • 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…
  • 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…
  • spr_minimax_sign_deletion_monotonicityIn the sign-preservation-with-reuse game, the minimax value is monotone under adding existing signs: for every number n of ordered cells,…

Lean source view module on GitHub

/-- The board after the labeler empties the cells of `R` and places sign `s` in cell `j`. -/
def spr_move {n : ℕ} (b : Fin n → Option Bool) (j : Fin n) (R : Finset (Fin n)) (s : Bool) :
    Fin n → Option Bool :=
  fun i => if i = j then some s else if i ∈ R then none else b i
See it in the graphDiscuss this resultChallenge it