AFTD Auto-Formalizing Theoretical Domains

spi_sum_fun_fin_four

lemmaverified

A sum over value profiles Fin 4 -> Fin 2 expands into the 16 explicit profiles.

Statement

open Finset in
lemma spi_sum_fun_fin_four {β : Type*} [AddCommMonoid β] (f : (Fin 4 → Fin 2) → β) :
    ∑ k, f k = ∑ a : Fin 2, ∑ b : Fin 2, ∑ c : Fin 2, ∑ d : Fin 2, f ![a, b, c, d]
Source
step towards strategic_prophet_no_half_robust_static_threshold (no static threshold is 1/2-robust, open in Intrinsic Robustness of Prophet Inequality to Strategic Reward Signaling, NeurIPS 2024 (arXiv:2409.18269), Remark 4.1 and Sec. 6)
Verified
06 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Used by 1
  • spx_prophet_valueThe prophet value of the four-player instance is E[max] = 155039/15625.

Lean source view module on GitHub

open Finset in/-- `E[max]` over four independent two-point rewards expands into a sum over the 16 value profiles. -/lemma spi_sum_fun_fin_four {β : Type*} [AddCommMonoid β] (f : (Fin 4 → Fin 2) → β) :    ∑ k, f k = ∑ a : Fin 2, ∑ b : Fin 2, ∑ c : Fin 2, ∑ d : Fin 2, f ![a, b, c, d] := by  rw [← (Fin.consEquiv fun _ => Fin 2).sum_comp, Fintype.sum_prod_type]  refine Finset.sum_congr rfl fun a _ => ?_  rw [← (Fin.consEquiv fun _ => Fin 2).sum_comp, Fintype.sum_prod_type]  refine Finset.sum_congr rfl fun b _ => ?_  rw [← (Fin.consEquiv fun _ => Fin 2).sum_comp, Fintype.sum_prod_type]  refine Finset.sum_congr rfl fun c _ => ?_  rw [← (Fin.consEquiv fun _ => Fin 2).sum_comp, Fintype.sum_prod_type]  refine Finset.sum_congr rfl fun d _ => ?_  simp only [Fintype.sum_unique]  congr 1
See it in the graphDiscuss this resultChallenge it