Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Example 4.10, p. 12 — Condorcet voting is susceptible to destructive control by partition of voters

Proved
HHRControl.PV.example_4_10

by mikedeng1 · Oct 24, 2026 · Mathlib 0df444a (Lean v4.33.1)

condorcetelection-controlp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1susceptibility

Example 4.10. Let C={a,b,c}C=\{a,b,c\}C={a,b,c} and let VVV consist of seven voters

v1,v2:c>a>b,v3:c>b>a,v4:b>a>c,v5:b>c>a,v6:a>b>c,v7:a>c>b.v_1,v_2: c>a>b,\quad v_3: c>b>a,\quad v_4: b>a>c,\quad v_5: b>c>a,\quad v_6: a>b>c,\quad v_7: a>c>b.v1​,v2​:c>a>b,v3​:c>b>a,v4​:b>a>c,v5​:b>c>a,v6​:a>b>c,v7​:a>c>b.

Then ccc is the Condorcet winner of (C,V)(C,V)(C,V). For V1={v1,v7}V_1=\{v_1,v_7\}V1​={v1​,v7​} and V2=V−V1V_2=V-V_1V2​=V−V1​ there is no Condorcet winner of (C,V1)(C,V_1)(C,V1​) and bbb is the Condorcet winner of (C,V2)(C,V_2)(C,V2​), so ccc is not the unique winner of the two-stage election (in either tie-handling model). Consequently Condorcet voting is susceptible to destructive control by partition of voters.

This election witnesses the susceptibility part of the Condorcet clause of Theorem 3.6.

Differences from the source:

  • encoding: candidates a, b, c; voters v1, v2, … → candidates 0, 1, 2 of Fin 3; voter vᵢ is index i − 1 of Fin n; reason: 0-based indices; no instance changes
  • encoding: voters with the listed preference orders → every profile P whose ballots have the listed codes (rankingCode lists the candidates from most to least preferred); reason: rankingCode is injective, so this is exactly the listed profile; the profile exists
  • encoding: Condorcet: the models TE and TP do not apply (p. 3) → stated for both tie rules; reason: a Condorcet winner is unique when it exists, so TE and TP nominate the same candidates and give the same two-stage election
Preamble
import Mathlib
import Definitions.Def_HHRControl_PV_Elections
Formal statement
namespace HHRControl.PV

open Finset

/-- Example 4.10, p. 12: Condorcet voting is susceptible to destructive control by partition of
voters (in either tie-handling model). Candidates `a, b, c` are `0, 1, 2`; a ballot is given by
its code, the candidates from the most to the least preferred. -/
theorem example_4_10 :
    (∀ P : Fin 7 → Ranking 3,
      (∀ v, rankingCode (P v) =
        ![[2, 0, 1], [2, 0, 1], [2, 1, 0], [1, 0, 2], [1, 2, 0], [0, 1, 2], [0, 2, 1]] v) →
        condorcet.winners 3 7 P univ univ = {2} ∧
        condorcet.winners 3 7 P univ {0, 6} = ∅ ∧
        condorcet.winners 3 7 P univ ({0, 6} : Finset (Fin 7))ᶜ = {1} ∧
        ∀ rule : TieRule, twoStage rule condorcet P {0, 6} ≠ {2}) ∧
    ∀ rule : TieRule, SusceptibleDC rule condorcet := by sorry

end HHRControl.PV
Source
Hemaspaandra, Hemaspaandra & Rothe, Anyone but Him: The Complexity of Precluding an Alternative, arXiv:cs/0507027v5, p. 12, Example 4.10
Human review
  • Endorsed by Shuze Chen · Oct 24, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 24, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me