ArrowTheorem.abPref
defimported Lean
$\mathrm{abPref}(k)$, $\mathrm{bcPref}(k)$, $\mathrm{caPref}(k)$ give the Boolean preference of ordering $k\in\{0,\dots,5\}$ in the $a$-vs-$b$, $b$-vs-$c$, and $c$-vs-$a$ comparisons, respectively.
Statement
set_option maxHeartbeats 800000 in open scoped BigOperators in variable {n : ℕ} in def ArrowTheorem.abPref : Fin 6 → Bool
- Defined in
- TCSlib, `ArrowTheorem.abPref`
- 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.abPref← ArrowTheorem.abPref (TCSlib/BooleanAnalysis/ArrowTheorem.lean:92): verbatim
- Verified
- 07 Oct 2026
- Axioms
- none listed
- Used by 4
- ArrowTheorem.sum_abPref_bcPrefSum 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…
- ArrowTheorem.sum_abPref_caPrefSum 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…
- ArrowTheorem.abVotesGiven a profile $p$, the vote vectors $\mathrm{abVotes}(p)$, $\mathrm{bcVotes}(p)$, $\mathrm{caVotes}(p) \in \{0,1\}^n$ record each…
- ArrowTheorem.sum_abPref_signBalance 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…
Lean source view module on GitHub
set_option maxHeartbeats 800000 in open scoped BigOperators in variable {n : ℕ} in /-- Preference of ordering k in the a-vs-b comparison (false = prefer a). -/ def ArrowTheorem.abPref : Fin 6 → Bool | ⟨0, _⟩ => false -- a > b > c | ⟨1, _⟩ => false -- a > c > b | ⟨2, _⟩ => true -- b > a > c | ⟨3, _⟩ => true -- b > c > a | ⟨4, _⟩ => false -- c > a > b | ⟨5, _⟩ => true -- c > b > a