AFTD Auto-Formalizing Theoretical Domains

ArrowTheorem.sum_bcPref_sign

theoremverifiedimported Lean

Balanced b-versus-c preferences over the six orderings. Consider the six strict orderings of three alternatives $a$, $b$, and $c$, indexed by $k \in \{0,\dots,5\}$, and let $p(k)$ denote the $b$-versus-$c$ pairwise preference of ordering $k$. Under the sign encoding $\sigma$, these preferences sum to zero across all six orderings: \[ \sum_{k=0}^{5} \sigma\bigl(p(k)\bigr) = 0. \]

Statement

set_option maxHeartbeats 800000 in
open scoped BigOperators in
open BooleanAnalysis in
variable {n : ℕ} in
lemma ArrowTheorem.sum_bcPref_sign :
    ∑ k : Fin 6, boolToSign (bcPref k) = 0
Source
TCSlib, `ArrowTheorem.sum_bcPref_sign`
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
Classical.choiceQuot.soundpropext
Built on 2
  • BooleanAnalysis.boolToSignThe sign encoding maps $\mathrm{Bool}$ to $\{-1,1\}\subset\bbr$:…
  • ArrowTheorem.bcPref$\mathrm{abPref}(k)$, $\mathrm{bcPref}(k)$, $\mathrm{caPref}(k)$ give the Boolean preference of ordering $k\in\{0,\dots,5\}$ in the…
Used by 2

Lean source view module on GitHub

set_option maxHeartbeats 800000 inopen scoped BigOperators inopen BooleanAnalysis invariable {n : ℕ} in/-- The sum of bcPref signs over all 6 orderings is 0. -/lemma ArrowTheorem.sum_bcPref_sign :    ∑ k : Fin 6, boolToSign (bcPref k) = 0 := by  simp only [Fin.sum_univ_six, bcPref, boolToSign]  norm_num
See it in the graphDiscuss this resultChallenge it