AFTD Auto-Formalizing Theoretical Domains

bz3_measure

lemmaverified

For three players and p = q = 1/2, the Banzhaf measure of a player is a quarter of its pivot count.

Statement

lemma bz3_measure (w : Fin 3 → ℝ) (i : Fin 3) :
    propensity_banzhaf_measure (1 / 2) (1 / 2) w i = (bz3_cnt (bz3_pattern w) i : ℝ) / 4
Source
step towards banzhaf_strict_majority_veto_distortion_ge_five_thirds (veto distortion at strict simple majority, left open in How Banzhaf Makes a Victor, EC 2026, Sec. 5)
Verified
06 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 6
  • propensity_banzhaf_measureThe p-propensity Banzhaf power measure: the probability that player i is pivotal when each other player votes yes independently with…
  • bz3_cntPivot counts of the three players of a 3-player game given by its winning pattern on the eight coalitions.
  • bz3_coalThe eight coalitions of three players indexed by bit pattern.
  • bz3_patternThe winning pattern of the 3-player weighted game (w; 1/2) with strict quota.
  • bz3_ite_eqAn if-then-else on a conjunction of decidable propositions, written as a product with a Boolean indicator.
  • bz3_sum_fourExpanding a sum over the four subsets of a two-element set of players.
Used by 1
  • bz3_discrepancyFor three players and p = q = 1/2, the discrepancy for target (3/10, 7/10, 0) equals the rational discrepancy of the winning pattern.

Lean source view module on GitHub

lemma bz3_measure (w : Fin 3 → ℝ) (i : Fin 3) :    propensity_banzhaf_measure (1 / 2) (1 / 2) w i = (bz3_cnt (bz3_pattern w) i : ℝ) / 4 := by  unfold propensity_banzhaf_measure  simp only [bz3_ite_eq]  obtain rfl | rfl | rfl : i = 0 ∨ i = 1 ∨ i = 2 := by fin_cases i <;> simp  · rw [show (Finset.univ.erase (0 : Fin 3)).powerset = {∅, {1}, {2}, {1, 2}} from by decide,      bz3_sum_four _ _ _ (by decide)]    simp only [show insert (0 : Fin 3) (∅ : Finset (Fin 3)) = {0} from by decide,      show insert (0 : Fin 3) ({1} : Finset (Fin 3)) = {0, 1} from by decide,      show insert (0 : Fin 3) ({2} : Finset (Fin 3)) = {0, 2} from by decide,      show insert (0 : Fin 3) ({1, 2} : Finset (Fin 3)) = {0, 1, 2} from by decide]    simp only [bz3_cnt, bz3_pattern, bz3_coal, Matrix.cons_val, Finset.card_empty, Finset.card_singleton,      Finset.card_pair (show (1 : Fin 3) ≠ 2 by decide)]    norm_num    ring  · rw [show (Finset.univ.erase (1 : Fin 3)).powerset = {∅, {0}, {2}, {0, 2}} from by decide,      bz3_sum_four _ _ _ (by decide)]    simp only [show insert (1 : Fin 3) (∅ : Finset (Fin 3)) = {1} from by decide,      show insert (1 : Fin 3) ({0} : Finset (Fin 3)) = {0, 1} from by decide,      show insert (1 : Fin 3) ({2} : Finset (Fin 3)) = {1, 2} from by decide,      show insert (1 : Fin 3) ({0, 2} : Finset (Fin 3)) = {0, 1, 2} from by decide]    simp only [bz3_cnt, bz3_pattern, bz3_coal, Matrix.cons_val, Finset.card_empty, Finset.card_singleton,      Finset.card_pair (show (0 : Fin 3) ≠ 2 by decide)]    norm_num    ring  · rw [show (Finset.univ.erase (2 : Fin 3)).powerset = {∅, {0}, {1}, {0, 1}} from by decide,      bz3_sum_four _ _ _ (by decide)]    simp only [show insert (2 : Fin 3) (∅ : Finset (Fin 3)) = {2} from by decide,      show insert (2 : Fin 3) ({0} : Finset (Fin 3)) = {0, 2} from by decide,      show insert (2 : Fin 3) ({1} : Finset (Fin 3)) = {1, 2} from by decide,      show insert (2 : Fin 3) ({0, 1} : Finset (Fin 3)) = {0, 1, 2} from by decide]    simp only [bz3_cnt, bz3_pattern, bz3_coal, Matrix.cons_val, Finset.card_empty, Finset.card_singleton,      Finset.card_pair (show (0 : Fin 3) ≠ 1 by decide)]    norm_num    ring
See it in the graphDiscuss this resultChallenge it