ArrowTheorem.sum_abPref_caPref
Sum of paired preference signs. Label the six strict orderings of three alternatives $a,b,c$ by $k\in\{0,\dots,5\}$. For each ordering let $x_k\in\{-1,+1\}$ record the $a$-versus-$b$ comparison, taking the value $+1$ when $a$ is preferred to $b$ and $-1$ when $b$ is preferred to $a$, and let $y_k\in\{-1,+1\}$ record the $b$-versus-$c$ comparison in the same way, with $+1$ when $b$ is preferred to $c$ and $-1$ otherwise. Then \[ \sum_{k=0}^{5} x_k\,y_k \;=\; -2. \] For each of the six strict orderings $k \in \{0,\dots,5\}$ of three alternatives $a,b,c$, let $\sigma$ be the sign encoding, sending $\mathrm{false}$ to $+1$ and $\mathrm{true}$ to $-1$. Write $y_k = \sigma(p_k)$, where $p_k$ is the Boolean preference of ordering $k$ in the $b$-vs-$c$ comparison, and $z_k = \sigma(q_k)$, where $q_k$ is the preference in the $c$-vs-$a$ comparison. Then \[ \sum_{k=0}^{5} y_k\, z_k \;=\; -2. \] For each of the six strict orderings $k \in \{0,\dots,5\}$ of three alternatives $a,b,c$, write $p_{ab}(k)$ and $p_{ca}(k)$ for the Boolean preferences of ordering $k$ in the $a$-vs-$b$ and $c$-vs-$a$ comparisons, and let $\sigma$ be the sign encoding sending $\mathrm{false}$ to $1$ and $\mathrm{true}$ to $-1$. Then the sum over all six orderings of the products of the encoded signs is \[ \sum_{k=0}^{5} \sigma\big(p_{ab}(k)\big)\,\sigma\big(p_{ca}(k)\big) \;=\; -2. \]
Statement
set_option maxHeartbeats 800000 in open scoped BigOperators in open BooleanAnalysis in variable {n : ℕ} in lemma ArrowTheorem.sum_abPref_caPref : ∑ k : Fin 6, boolToSign (abPref k) * boolToSign (caPref k) = -2
- Source
- TCSlib, `ArrowTheorem.sum_abPref_caPref`
- 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_caPref← ArrowTheorem.sum_abPref_caPref (TCSlib/BooleanAnalysis/ArrowTheorem.lean:139): verbatim
- Verified
- 07 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 3
- ArrowTheorem.abPref$\mathrm{abPref}(k)$, $\mathrm{bcPref}(k)$, $\mathrm{caPref}(k)$ give the Boolean preference of ordering $k\in\{0,\dots,5\}$ in the…
- ArrowTheorem.caPref$\mathrm{abPref}(k)$, $\mathrm{bcPref}(k)$, $\mathrm{caPref}(k)$ give the Boolean preference of ordering $k\in\{0,\dots,5\}$ in the…
- BooleanAnalysis.boolToSignThe sign encoding maps $\mathrm{Bool}$ to $\{-1,1\}\subset\bbr$:…
- Used by 1
- 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…
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/-- Similarly, E[s_ab · s_ca] = -1/3. -/lemma ArrowTheorem.sum_abPref_caPref : ∑ k : Fin 6, boolToSign (abPref k) * boolToSign (caPref k) = -2 := by simp only [Fin.sum_univ_six, abPref, caPref, boolToSign] norm_num