Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Example 4.11, p. 13 — approval voting is susceptible to destructive control by partition of voters in models TE and TP

Proved
HHRControl.PV.example_4_11

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

approval-votingelection-controlp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1susceptibility

Example 4.11. Let C={a,b,c}C=\{a,b,c\}C={a,b,c} and let VVV consist of ten approval voters (bits for a,b,ca,b,ca,b,c):

v1=v2=v3=v4=001,v5=v6=v7=100,v8=v9=v10=010.v_1=v_2=v_3=v_4=001,\quad v_5=v_6=v_7=100,\quad v_8=v_9=v_{10}=010.v1​=v2​=v3​=v4​=001,v5​=v6​=v7​=100,v8​=v9​=v10​=010.

Then ccc is the unique approval winner of (C,V)(C,V)(C,V). For V1={v1,v2,v5,v6,v7}V_1=\{v_1,v_2,v_5,v_6,v_7\}V1​={v1​,v2​,v5​,v6​,v7​} and V2=V−V1V_2=V-V_1V2​=V−V1​, aaa is the unique winner of (C,V1)(C,V_1)(C,V1​) and bbb of (C,V2)(C,V_2)(C,V2​); they are nominated and tie in the final election, in model TE and in model TP. Consequently approval voting is susceptible to destructive control by partition of voters in both models.

This election witnesses the susceptibility part of the approval destructive 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 n; reason: 0-based indices; no instance changes
Preamble
import Mathlib
import Definitions.Def_HHRControl_PV_Elections
Formal statement
namespace HHRControl.PV

open Finset

/-- Example 4.11, p. 13: approval voting is susceptible to destructive control by partition of
voters, in models TE and TP. Candidates `a, b, c` are `0, 1, 2`; an approval ballot is the set of
approved candidates. -/
theorem example_4_11 :
    (let P : Fin 10 → Approval 3 :=
        ![{2}, {2}, {2}, {2}, {0}, {0}, {0}, {1}, {1}, {1}];
      approval.winners 3 10 P univ univ = {2} ∧
      approval.winners 3 10 P univ {0, 1, 4, 5, 6} = {0} ∧
      approval.winners 3 10 P univ ({0, 1, 4, 5, 6} : Finset (Fin 10))ᶜ = {1} ∧
      ∀ rule : TieRule, twoStage rule approval P {0, 1, 4, 5, 6} = {0, 1}) ∧
    SusceptibleDC .TE approval ∧ SusceptibleDC .TP approval := by sorry

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