AFTD Auto-Formalizing Theoretical Domains

ArrowTheorem.unanimity

defimported Lean

A social welfare function $f:\{0,1\}^n\to\bbr$ is unanimous if $f(\texttt{false},\dots,\texttt{false}) = 1$: when all voters prefer alternative $a$ over $b$, so does society.

Statement

set_option maxHeartbeats 800000 in
open scoped BigOperators in
open BooleanAnalysis in
variable {n : ℕ} in
def ArrowTheorem.unanimity (f : BooleanFunc n) : Prop
Defined in
TCSlib, `ArrowTheorem.unanimity`
Lean proof
By Mina, Allan Li, Owen McGinty (from the file's git history), from github.com/Shilun-Allan-Li/tcslib at c8a02591b1e5 (Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.25.0.
Verified
07 Oct 2026
Axioms
none listed
Built on 1
Used by 2
  • ArrowTheorem.degree_one_implies_dictatorDegree-one unanimous voting rules are dictatorships. Let $f:\{0,1\}^n\to\bbr$ be a Boolean function that is odd, is $\pm 1$-valued, and is…
  • ArrowTheorem.arrow_theoremArrow's impossibility theorem. Let $n$ be a natural number and let $f:\{0,1\}^n\to\bbr$ be a social welfare function that aggregates the…

Lean source view module on GitHub

set_option maxHeartbeats 800000 in
open scoped BigOperators in
open BooleanAnalysis in
variable {n : ℕ} in
/-- Unanimity: if all voters prefer a to b, society prefers a to b. In our encoding, f(all-false) = 1 means "a preferred to b" when every voter marks `false` (i.e., prefers the first alternative). **Source:** [OD14, Ch. 2]. -/
def ArrowTheorem.unanimity (f : BooleanFunc n) : Prop :=
  f (fun _ => false) = 1
See it in the graphDiscuss this resultChallenge it