agTot_sum
theoremverified
The total counts of a pure profile over all strategies sum to the number of players n.
Statement
open Finset in theorem agTot_sum {n s : ℕ} (σ : Fin n → Fin s) : ∑ j, agTot σ j = n
- Source
- step towards ag_two_exact / ag_three_lower / ag_four_lower (Computing Equilibria in Anonymous Games, FOCS 2007 (arXiv:0710.5582), concluding conjecture that s*lambda is a lower bound)
- Verified
- 06 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 1
- agTotTotal number of players on each strategy.
- Used by 2
- ag_four_lowerFour strategies: the lower bound sλ is attained. The 5-player, 4-strategy cyclic game is normalised and λ = 1/8-Lipschitz, yet has no pure…
- ag_three_lowerThree strategies: the lower bound exceeds sλ. The 5-player, 3-strategy cyclic game is normalised and λ = 1/8-Lipschitz, yet has no pure…
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
open Finset intheorem agTot_sum {n s : ℕ} (σ : Fin n → Fin s) : ∑ j, agTot σ j = n := by unfold agTot rw [← Finset.card_biUnion] · have : (Finset.univ.biUnion fun j => Finset.univ.filter (fun q => σ q = j)) = Finset.univ := by ext q; simp rw [this, Finset.card_univ, Fintype.card_fin] · intro i _ j _ hij simp only [Function.onFun] rw [Finset.disjoint_filter] intro q _ h1 h2 exact hij (h1.symm.trans h2)