Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Example 4.16, p. 14 — plurality is susceptible to constructive and destructive control by partition of voters in model TP

Proved
HHRControl.PV.example_4_16

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

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

Example 4.16. Let C={a,b,c}C=\{a,b,c\}C={a,b,c} and let VVV consist of eight voters: u1,u2,u3u_1,u_2,u_3u1​,u2​,u3​ voting a>c>ba>c>ba>c>b, v1,v2v_1,v_2v1​,v2​ voting b>a>cb>a>cb>a>c, and w1,w2,w3w_1,w_2,w_3w1​,w2​,w3​ voting c>a>bc>a>bc>a>b.

Constructive case. aaa and ccc tie for first place in (C,V)(C,V)(C,V), so ccc is not the unique plurality winner. For V1={u1,u2,w1,w2,w3}V_1=\{u_1,u_2,w_1,w_2,w_3\}V1​={u1​,u2​,w1​,w2​,w3​} and V2={u3,v1,v2}V_2=\{u_3,v_1,v_2\}V2​={u3​,v1​,v2​}, ccc is the unique winner of (C,V1)(C,V_1)(C,V1​), bbb of (C,V2)(C,V_2)(C,V2​), and ccc wins the run-off against bbb.

Destructive case. Let V′=V∪{v3,w4}V'=V\cup\{v_3,w_4\}V′=V∪{v3​,w4​} with v3:b>a>cv_3: b>a>cv3​:b>a>c and w4:c>a>bw_4: c>a>bw4​:c>a>b. Then ccc is the unique plurality winner of (C,V′)(C,V')(C,V′). For V1′={u1,u2,u3,w1,w2}V'_1=\{u_1,u_2,u_3,w_1,w_2\}V1′​={u1​,u2​,u3​,w1​,w2​} and V2′={v1,v2,v3,w3,w4}V'_2=\{v_1,v_2,v_3,w_3,w_4\}V2′​={v1​,v2​,v3​,w3​,w4​}, aaa is the unique winner of (C,V1′)(C,V'_1)(C,V1′​), bbb of (C,V2′)(C,V'_2)(C,V2′​), and aaa wins the run-off against bbb.

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

These elections witness the susceptibility part of the plurality TP clauses of Theorem 3.6.

Differences from the source:

  • encoding: candidates a, b, c; voters u1, u2, u3, v1, v2, w1, w2, w3 (then v3, w4) → candidates 0, 1, 2 of Fin 3; the voters are indices 0–7 in that order (then 8, 9); 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.16, p. 14: plurality voting is susceptible to constructive and to destructive control
by partition of voters in model TP. Candidates `a, b, c` are `0, 1, 2`; a ballot is given by its
code, the candidates from the most to the least preferred. The voters are listed in the order
`u₁, u₂, u₃, v₁, v₂, w₁, w₂, w₃` (then `v₃, w₄` for the election `(C, V′)`). -/
theorem example_4_16 :
    (∀ P : Fin 8 → Ranking 3,
      (∀ v, rankingCode (P v) = ![[0, 2, 1], [0, 2, 1], [0, 2, 1], [1, 0, 2], [1, 0, 2],
          [2, 0, 1], [2, 0, 1], [2, 0, 1]] v) →
        plurality.winners 3 8 P univ univ = {0, 2} ∧
        plurality.winners 3 8 P univ {0, 1, 5, 6, 7} = {2} ∧
        plurality.winners 3 8 P univ ({0, 1, 5, 6, 7} : Finset (Fin 8))ᶜ = {1} ∧
        twoStage .TP plurality P {0, 1, 5, 6, 7} = {2}) ∧
    (∀ P' : Fin 10 → Ranking 3,
      (∀ v, rankingCode (P' v) = ![[0, 2, 1], [0, 2, 1], [0, 2, 1], [1, 0, 2], [1, 0, 2],
          [2, 0, 1], [2, 0, 1], [2, 0, 1], [1, 0, 2], [2, 0, 1]] v) →
        plurality.winners 3 10 P' univ univ = {2} ∧
        plurality.winners 3 10 P' univ {0, 1, 2, 5, 6} = {0} ∧
        plurality.winners 3 10 P' univ ({0, 1, 2, 5, 6} : Finset (Fin 10))ᶜ = {1} ∧
        twoStage .TP plurality P' {0, 1, 2, 5, 6} = {0}) ∧
    SusceptibleCC .TP plurality ∧ SusceptibleDC .TP plurality := by sorry

end HHRControl.PV
Source
Hemaspaandra, Hemaspaandra & Rothe, Anyone but Him: The Complexity of Precluding an Alternative, arXiv:cs/0507027v5, p. 14, Example 4.16
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