Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Example 4.9, p. 12 — plurality is susceptible to constructive and destructive control by partition of voters in model TE

Proved
HHRControl.PV.example_4_9

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

election-controlp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1pluralitysusceptibility

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

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

Then ccc is not a plurality winner of (C,V)(C,V)(C,V). For V1={v5}V_1=\{v_5\}V1​={v5​} and V2=V−V1V_2=V-V_1V2​=V−V1​, ccc is the unique plurality winner of (C,V1)(C,V_1)(C,V1​), aaa and bbb tie for winner of (C,V2)(C,V_2)(C,V2​), and in model TE ccc is the unique winner of the two-stage election.

For the destructive case let V′={v1,v2,v3,v5}V'=\{v_1,v_2,v_3,v_5\}V′={v1​,v2​,v3​,v5​}. Then aaa is the unique plurality winner of (C,V′)(C,V')(C,V′), and for V1′={v1,v3}V'_1=\{v_1,v_3\}V1′​={v1​,v3​}, V2′={v2,v5}V'_2=\{v_2,v_5\}V2′​={v2​,v5​} neither subcommittee nominates a candidate in model TE, so aaa is not the unique winner of the two-stage election.

Consequently plurality voting is susceptible to constructive and to destructive control by partition of voters in model TE.

These elections witness the susceptibility part of the plurality TE clauses 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 5; in the election (C, V′) the voters v1, v2, v3, v5 are indices 0–3 of Fin 4; 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
Preamble
import Mathlib
import Definitions.Def_HHRControl_PV_Elections
Formal statement
namespace HHRControl.PV

open Finset

/-- Example 4.9, p. 12: plurality voting is susceptible to constructive and to destructive control
by partition of voters in model TE. 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_9 :
    (∀ P : Fin 5 → Ranking 3,
      (∀ v, rankingCode (P v) = ![[0, 1, 2], [0, 1, 2], [1, 0, 2], [1, 0, 2], [2, 0, 1]] v) →
        (2 : Fin 3) ∉ plurality.winners 3 5 P univ univ ∧
        plurality.winners 3 5 P univ {4} = {2} ∧
        plurality.winners 3 5 P univ ({4} : Finset (Fin 5))ᶜ = {0, 1} ∧
        twoStage .TE plurality P {4} = {2}) ∧
    (∀ P' : Fin 4 → Ranking 3,
      (∀ v, rankingCode (P' v) = ![[0, 1, 2], [0, 1, 2], [1, 0, 2], [2, 0, 1]] v) →
        plurality.winners 3 4 P' univ univ = {0} ∧
        nominees .TE plurality P' {0, 2} = ∅ ∧
        nominees .TE plurality P' ({0, 2} : Finset (Fin 4))ᶜ = ∅ ∧
        twoStage .TE plurality P' {0, 2} ≠ {0}) ∧
    SusceptibleCC .TE plurality ∧ SusceptibleDC .TE plurality := 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.9
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