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.ArrowTheorem.sum_bcPref_sign← ArrowTheorem.sum_bcPref_sign (TCSlib/BooleanAnalysis/ArrowTheorem.lean:330): 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.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
- 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…
- 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 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