AFTD Auto-Formalizing Theoretical Domains

ArrowTheorem.bcPref

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.bcPref : Fin 6 → Bool
Defined in
TCSlib, `ArrowTheorem.bcPref`
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.
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.bcVotesGiven a profile $p$, the vote vectors $\mathrm{abVotes}(p)$, $\mathrm{bcVotes}(p)$, $\mathrm{caVotes}(p) \in \{0,1\}^n$ record each…
  • ArrowTheorem.sum_bcPref_signBalanced b-versus-c preferences over the six orderings. Consider the six strict orderings of three alternatives $a$, $b$, and $c$, indexed…
  • ArrowTheorem.sum_bcPref_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…

Lean source view module on GitHub

set_option maxHeartbeats 800000 in
open scoped BigOperators in
variable {n : ℕ} in
/-- Preference of ordering k in the b-vs-c comparison (false = prefer b). -/
def ArrowTheorem.bcPref : Fin 6 → Bool
  | ⟨0, _⟩ => false  -- a > b > c
  | ⟨1, _⟩ => true   -- a > c > b
  | ⟨2, _⟩ => false  -- b > a > c
  | ⟨3, _⟩ => false  -- b > c > a
  | ⟨4, _⟩ => true   -- c > a > b
  | ⟨5, _⟩ => true   -- c > b > a
See it in the graphDiscuss this resultChallenge it