AFTD Auto-Formalizing Theoretical Domains

bz3_props_pattern

lemmaverified

The winning pattern of a 3-player game with simplex weights and strict quota 1/2 satisfies bz3_props.

Statement

lemma bz3_props_pattern (w : Fin 3 → ℝ) (hw : in_std_simplex w) :
    bz3_props (bz3_pattern w) = true
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
  • wvg_winsA coalition wins in the weighted voting game (w; q) with strict quota if its total weight exceeds q.
  • in_std_simplexA vector lies in the standard simplex: nonnegative entries summing to 1.
  • bz3_propsNecessary conditions on the winning pattern of a 3-player weighted game with simplex weights and strict quota 1/2: empty loses, grand…
  • 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_bool_impFor Booleans, (not a or b) is true iff a true implies b true.
Used by 1

Lean source view module on GitHub

lemma bz3_props_pattern (w : Fin 3 → ℝ) (hw : in_std_simplex w) :    bz3_props (bz3_pattern w) = true := by  obtain ⟨h0, h1⟩ := hw  rw [Fin.sum_univ_three] at h1  have a := h0 0; have b := h0 1; have c := h0 2  simp only [bz3_props, Bool.and_eq_true, bz3_bool_imp, Bool.not_eq_true']  simp only [bz3_pattern, decide_eq_true_eq, decide_eq_false_iff_not]  simp [bz3_coal, Finset.sum_insert, wvg_wins]  constructorm* _ ∧ _ <;> intros <;> linarith
See it in the graphDiscuss this resultChallenge it