AFTD Auto-Formalizing Theoretical Domains

monroe_load_comp_perm

theoremverified

Precomposing an assignment with a permutation of the voters does not change how many voters each candidate receives.

Statement

theorem monroe_load_comp_perm {n : ℕ} {β : Type*} [DecidableEq β] (π : Fin n → β)
    (σ : Equiv.Perm (Fin n)) (x : β) :
    (Finset.univ.filter fun v => π (σ v) = x).card = (Finset.univ.filter fun v => π v = x).card
Source
step towards hare_monroe_satisfies_droop_jr (Monroe and Droop-JR, open case of Justified Representation: From Hare to Droop, arXiv:2508.00811)
Verified
06 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Used by 2
  • monroe_exchangeExchange step: replacing c ∈ W by c ∉ W approved by all of S (no member of S being satisfied by π) yields a Hare-valid assignment whose…
  • droop_monroe_exchangeExchange step for Droop assignments: swapping c₀ ∈ W for c ∉ W approved by all of S (no member of S satisfied) gives a Droop-valid…

Lean source view module on GitHub

/-- Precomposing an assignment with a permutation of the voters does not change how many voters each candidate receives. -/theorem monroe_load_comp_perm {n : ℕ} {β : Type*} [DecidableEq β] (π : Fin n → β)    (σ : Equiv.Perm (Fin n)) (x : β) :    (Finset.univ.filter fun v => π (σ v) = x).card = (Finset.univ.filter fun v => π v = x).card := by  refine Finset.card_bij' (fun v _ => σ v) (fun v _ => σ.symm v) ?_ ?_ ?_ ?_ <;> simp
See it in the graphDiscuss this resultChallenge it