spr_sign_count
def
The number of signs on a board of the sign-preservation-with-reuse game with n cells, each empty or holding a plus or a minus.
Statement
def spr_sign_count {n : ℕ} (b : Fin n → Option Bool) : ℕ- Defined in
- arXiv:2610.07623 (Explicit asymptotic bounds for sequential calibration beyond T^{2/3}), Sec. 2.2 (payoff of the sign-preservation-with-reuse game)
- Verified
- 07 Oct 2026
- Axioms
- none listed
- Used by 4
- 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,…
- spr_value_zero_monoAt horizon 0, the sign-preservation-with-reuse game value equals the sign count, which is monotone under sign deletion: if b' is a…
Lean source view module on GitHub
/-- Number of signs on a board of the sign-preservation-with-reuse game: a board has `n` cells, each empty (`none`), holding a plus (`some true`) or holding a minus (`some false`). -/ def spr_sign_count {n : ℕ} (b : Fin n → Option Bool) : ℕ := (Finset.univ.filter fun i => (b i).isSome).card