Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Claim 4.30, p. 24 — if c is not the unique plurality winner of (D ∪ {c}, V), then D = B′ ∪ {w} for a hitting set B′ of size ≤ k

Disproved
HHRControl.PV.claim_4_30

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

election-controlhitting-setp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1plurality

Let (C,V)(C,V)(C,V) be an election of Construction 4.28 for the Hitting Set instance (B,S,k)(B,S,k)(B,S,k): candidates B∪{c,w}B\cup\{c,w\}B∪{c,w} with B={b1,…,bm}B=\{b_1,\dots,b_m\}B={b1​,…,bm​}, a positive integer k≤mk\le mk≤m, and the voters listed there.

Claim 4.30. Let D⊆B∪{w}D\subseteq B\cup\{w\}D⊆B∪{w}. If ccc is not the unique plurality winner of the election (D∪{c},V)(D\cup\{c\},V)(D∪{c},V), then there exists a set B′⊆BB'\subseteq BB′⊆B such that

  1. D=B′∪{w}D=B'\cup\{w\}D=B′∪{w},
  2. www is the unique plurality winner of the election (B′∪{c,w},V)(B'\cup\{c,w\},V)(B′∪{c,w},V), and
  3. B′B'B′ is a hitting set of SSS of size at most kkk.

It is the second half of the correctness of the reduction from Hitting Set, and is used for Claim 4.41.

Differences from the source:

  • reading: Construction 4.28: the remaining candidates, and the elements of Sᵢ, follow "in some arbitrary order" → the claim is stated for every profile satisfying IsConstruction428 (any orders, any order of the voters); reason: the paper's arbitrary choice is universal; one canonical order would be a special case
  • encoding: candidates B ∪ {c, w} with B = {b1, …, bm}; S = {S1, …, Sn} → candidates Fin (m + 2) with bⱼ = candB (j − 1), c = candC m = m, w = candW m = m + 1; S : Fin n → Finset (Fin m); reason: 0-based indices; no instance changes
Preamble
import Mathlib
import Definitions.Def_CookPvsNP_defs
import Definitions.Def_ProjSchedTW_Complexity_Encoding
import Definitions.Def_HHRControl_PV_Elections
import Definitions.Def_HHRControl_PV_Languages
import Definitions.Def_HHRControl_PV_Construction428
Formal statement
namespace HHRControl.PV

open CookPvsNP

/-- Claim 4.30, p. 24: in an election of Construction 4.28, let `D ⊆ B ∪ {w}`. If `c` is not the
unique plurality winner of `(D ∪ {c}, V)`, then `D = B′ ∪ {w}` for a set `B′ ⊆ B` such that `w` is
the unique plurality winner of `(B′ ∪ {c, w}, V)` and `B′` is a hitting set of `S` of size at most
`k`. -/
theorem claim_4_30 (m n k : ℕ) (S : Fin n → Finset (Fin m)) {N : ℕ} (P : Fin N → Ranking (m + 2))
    (hP : IsConstruction428 m n k S P) (D : Finset (Fin (m + 2)))
    (hD : D ⊆ Finset.univ.image candB ∪ {candW m})
    (hc : plurality.winners (m + 2) N P (insert (candC m) D) Finset.univ ≠ {candC m}) :
    ∃ B' : Finset (Fin m), D = B'.image candB ∪ {candW m} ∧
      plurality.winners (m + 2) N P (B'.image candB ∪ {candC m, candW m}) Finset.univ =
        {candW m} ∧
      B'.card ≤ k ∧ IsHittingSet S B' := by sorry

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