ArrowTheorem.sum_caPref_sign
theoremverifiedimported Lean
Vanishing sum of signed $c$-vs-$a$ preferences. For each of the six strict orderings $k\in\{0,1,\dots,5\}$ of three alternatives, let $b_k\in\mathrm{Bool}$ record the $c$-vs-$a$ preference of ordering $k$, and encode it as a sign by $\sigma(b_k)=1$ when $b_k$ is false and $\sigma(b_k)=-1$ when $b_k$ is true. Then these six signed preferences sum to zero: \[ \sum_{k=0}^{5} \sigma(b_k) = 0. \]
Statement
set_option maxHeartbeats 800000 in open scoped BigOperators in open BooleanAnalysis in variable {n : ℕ} in lemma ArrowTheorem.sum_caPref_sign : ∑ k : Fin 6, boolToSign (caPref k) = 0
- Source
- TCSlib, `ArrowTheorem.sum_caPref_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_caPref_sign← ArrowTheorem.sum_caPref_sign (TCSlib/BooleanAnalysis/ArrowTheorem.lean:336): 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.caPref$\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_kernel_bccaThe $bc$–$ca$ profile kernel. Let $S, T \subseteq [n]$, and for a profile $p \colon \mathrm{Fin}\,n \to \mathrm{Fin}\,6$ write $x(p)$ for…
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 caPref signs over all 6 orderings is 0. -/lemma ArrowTheorem.sum_caPref_sign : ∑ k : Fin 6, boolToSign (caPref k) = 0 := by simp only [Fin.sum_univ_six, caPref, boolToSign] norm_num