ArrowTheorem.sum_abPref_sign
theoremverifiedimported Lean
Balance of the a-vs-b preference signs. There are six strict orderings $k \in \{0,1,\dots,5\}$ of the three alternatives $a,b,c$. For each such ordering, let $p_{ab}(k)$ be its $a$-vs-$b$ preference, the Boolean that records whether $b$ is ranked above $a$, and apply the sign encoding $\sigma$, so that $\sigma(p_{ab}(k))$ equals $+1$ when ordering $k$ ranks $a$ above $b$ and $-1$ when it ranks $b$ above $a$. Then these six signed preferences sum to zero: \[ \sum_{k=0}^{5} \sigma\bigl(p_{ab}(k)\bigr) = 0. \]
Statement
set_option maxHeartbeats 800000 in open scoped BigOperators in open BooleanAnalysis in variable {n : ℕ} in lemma ArrowTheorem.sum_abPref_sign : ∑ k : Fin 6, boolToSign (abPref k) = 0
- Source
- TCSlib, `ArrowTheorem.sum_abPref_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.ArrowTheorem.sum_abPref_sign← ArrowTheorem.sum_abPref_sign (TCSlib/BooleanAnalysis/ArrowTheorem.lean:324): verbatim
- Verified
- 07 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 2
- BooleanAnalysis.boolToSignThe sign encoding maps $\mathrm{Bool}$ to $\{-1,1\}\subset\bbr$:…
- ArrowTheorem.abPref$\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
- ArrowTheorem.profile_kernel_abcaKernel of the ab–ca vote correlation. Fix a natural number $n$ and consider profiles $p$ of $n$ voters, each of whom reports one of the…
- ArrowTheorem.profile_inner_product_kernelOrthogonality kernel for the $ab$–$bc$ vote pair. Fix $n$, and for each profile $p \in \{0,\dots,5\}^n$ let…
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
set_option maxHeartbeats 800000 inopen scoped BigOperators inopen BooleanAnalysis invariable {n : ℕ} in/-- The sum of abPref signs over all 6 orderings is 0. -/lemma ArrowTheorem.sum_abPref_sign : ∑ k : Fin 6, boolToSign (abPref k) = 0 := by simp only [Fin.sum_univ_six, abPref, boolToSign] norm_num