AFTD Auto-Formalizing Theoretical Domains

bz3_props

def

Necessary conditions on the winning pattern of a 3-player weighted game with simplex weights and strict quota 1/2: empty loses, grand coalition wins, monotone, no coalition wins together with its complement.

Statement

def bz3_props (x : Fin 8 → Bool) : Bool
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
none listed
Used by 2
  • bz3_checkEvery winning pattern satisfying bz3_props has discrepancy at least 2/5 for the target (3/10, 7/10, 0) (kernel computation over 256…
  • bz3_props_patternThe winning pattern of a 3-player game with simplex weights and strict quota 1/2 satisfies bz3_props.

Lean source view module on GitHub

/-- Necessary conditions on the winning coalitions of a 3-player weighted game with weights in the simplex and strict quota 1/2: the empty coalition loses, the grand coalition wins, winning is monotone, and a coalition and its complement cannot both win. -/
def bz3_props (x : Fin 8 → Bool) : Bool :=
  !x 0 && x 7 &&
  (!x 0 || x 1) && (!x 0 || x 2) && (!x 0 || x 4) && (!x 1 || x 3) && (!x 1 || x 5) &&
  (!x 2 || x 3) && (!x 2 || x 6) && (!x 4 || x 5) && (!x 4 || x 6) && (!x 3 || x 7) &&
  (!x 5 || x 7) && (!x 6 || x 7) &&
  (!x 1 || !x 6) && (!x 2 || !x 5) && (!x 4 || !x 3)
See it in the graphDiscuss this resultChallenge it