AFTD Auto-Formalizing Theoretical Domains

team_wins_cons

lemmaverified

The number of wins of an outcome vector with a prepended result b is [b] plus the number of wins of the rest.

Statement

open Finset in
lemma team_wins_cons {n : ℕ} (b : Bool) (ω : Fin n → Bool) :
    team_wins (Fin.cons b ω : Fin (n + 1) → Bool) = (if b = true then 1 else 0) + team_wins ω
Source
step towards team_thm4_part2_false / team_thm4_part2_exists_false (The Team Order Problem: Maximizing the Probability of Matching Being Large Enough, SAGT 2024 (arXiv:2605.21234), Section 6, Theorem 4(2))
Verified
06 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 1
  • team_winsNumber of successes in an outcome vector.
Used by 1
  • team_tail_eq_sumteam_tail equals the explicit sum over outcome vectors Σ_ω [t ≤ #wins(ω)] Π_i (q_i if ω_i else 1 - q_i).

Lean source view module on GitHub

open Finset inlemma team_wins_cons {n : ℕ} (b : Bool) (ω : Fin n → Bool) :    team_wins (Fin.cons b ω : Fin (n + 1) → Bool) = (if b = true then 1 else 0) + team_wins ω := by  unfold team_wins  rw [Fin.sum_univ_succ]  simp only [Fin.cons_zero, Fin.cons_succ]
See it in the graphDiscuss this resultChallenge it