AFTD Auto-Formalizing Theoretical Domains

is_droop_pjr_plus

def

Droop-PJR+ (arXiv:2508.00811, Def. 11): for every ℓ ∈ [k], every group S with |S| > ℓn/(k+1) jointly approving a candidate outside W collectively approves at least ℓ members of W.

Statement

def is_droop_pjr_plus {n m : ℕ} (A : Fin n → Finset (Fin m)) (k : ℕ) (W : Finset (Fin m)) :
    Prop
Defined in
Justified Representation: From Hare to Droop, arXiv:2508.00811, Def. 11 (Droop-PJR+)
Verified
06 Oct 2026
Axioms
none listed
Used by 2

Lean source view module on GitHub

/-- Droop-PJR+ (arXiv:2508.00811, Def. 11): for every `ℓ ∈ [k]`, every group `S` with `|S| > ℓ n/(k+1)` that jointly approves a candidate outside `W` collectively approves at least `ℓ` members of `W`. -/
def is_droop_pjr_plus {n m : ℕ} (A : Fin n → Finset (Fin m)) (k : ℕ) (W : Finset (Fin m)) :
    Prop :=
  ∀ ℓ, 1 ≤ ℓ → ℓ ≤ k → ∀ S : Finset (Fin n), ℓ * n < (k + 1) * S.card →
    (∃ c, c ∉ W ∧ ∀ i ∈ S, c ∈ A i) → ℓ ≤ (W.filter fun c => ∃ i ∈ S, c ∈ A i).card
See it in the graphDiscuss this resultChallenge it