AFTD Auto-Formalizing Theoretical Domains

team_sum_split

lemmaverified

Splitting a sum over outcome vectors of length n+1 by the first outcome.

Statement

open Finset in
lemma team_sum_split {n : ℕ} (F : (Fin (n + 1) → Bool) → ℝ) :
    ∑ ω, F ω = ∑ ω : Fin n → Bool, (F (Fin.cons true ω) + F (Fin.cons false ω))
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
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 in/-- Splitting a sum over outcome vectors of length `n+1` by the first outcome. -/lemma team_sum_split {n : ℕ} (F : (Fin (n + 1) → Bool) → ℝ) :    ∑ ω, F ω = ∑ ω : Fin n → Bool, (F (Fin.cons true ω) + F (Fin.cons false ω)) := by  rw [← (Fin.consEquiv (fun _ : Fin (n + 1) => Bool)).sum_comp, Fintype.sum_prod_type,    Fintype.sum_bool, ← Finset.sum_add_distrib]  rfl
See it in the graphDiscuss this resultChallenge it