ArrowTheorem.profile_kernel_bcca
theoremverifiedimported Lean
The $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 its $bc$-vote vector and $y(p)$ for its $ca$-vote vector, each lying in $\{0,1\}^n$. Averaging the product of Walsh characters over all $6^n$ profiles gives \[ \left(\tfrac{1}{6}\right)^{n} \sum_{p} \chi_S\bigl(x(p)\bigr)\,\chi_T\bigl(y(p)\bigr) \;=\; \begin{cases} \left(-\tfrac{1}{3}\right)^{\abs{S}} & \text{if } S = T,\\[2pt] 0 & \text{if } S \ne T. \end{cases} \]
Statement
set_option maxHeartbeats 800000 in open scoped BigOperators in open BooleanAnalysis in variable {n : ℕ} in lemma ArrowTheorem.profile_kernel_bcca (S T : Finset (Fin n)) : (1/6 : ℝ)^n * ∑ p : Profile n, chiS S (bcVotes p) * chiS T (caVotes p) = if S = T then (-1/3 : ℝ)^S.card else 0
- Source
- TCSlib, `ArrowTheorem.profile_kernel_bcca`
- 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.profile_kernel_bcca← ArrowTheorem.profile_kernel_bcca (TCSlib/BooleanAnalysis/ArrowTheorem.lean:426): verbatim
- Verified
- 07 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 8
- ArrowTheorem.profile_kernel_genGeneral profile kernel for paired preference assignments. Let $x, y : \mathrm{Fin}\,6 \to \mathrm{Bool}$ be two preference assignments…
- ArrowTheorem.sum_caPref_signVanishing sum of signed $c$-vs-$a$ preferences. For each of the six strict orderings $k\in\{0,1,\dots,5\}$ of three alternatives, let…
- ArrowTheorem.caVotesGiven a profile $p$, the vote vectors $\mathrm{abVotes}(p)$, $\mathrm{bcVotes}(p)$, $\mathrm{caVotes}(p) \in \{0,1\}^n$ record each…
- ArrowTheorem.bcVotesGiven a profile $p$, the vote vectors $\mathrm{abVotes}(p)$, $\mathrm{bcVotes}(p)$, $\mathrm{caVotes}(p) \in \{0,1\}^n$ record each…
- ArrowTheorem.ProfileA profile assigns each of the $n$ voters one of the 6 orderings: $p : \mathrm{Fin}\,n \to \mathrm{Fin}\,6$.
- 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…
- BooleanAnalysis.chiSThe Walsh--Fourier character associated to $S\subseteq[n]$ is…
- Used by 1
- ArrowTheorem.expected_product_bccaExpected product of the $bc$ and $ca$ vote vectors. Let $f:\{0,1\}^n\to\bbr$ be a Boolean function, and for each profile…
Lean source view module on GitHub
set_option maxHeartbeats 800000 in open scoped BigOperators in open BooleanAnalysis in variable {n : ℕ} in /-- Kernel lemma for the bc–ca pair. -/ lemma ArrowTheorem.profile_kernel_bcca (S T : Finset (Fin n)) : (1/6 : ℝ)^n * ∑ p : Profile n, chiS S (bcVotes p) * chiS T (caVotes p) = if S = T then (-1/3 : ℝ)^S.card else 0 := profile_kernel_gen sum_bcPref_sign sum_caPref_sign sum_bcPref_caPref S T