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
- droop_monroe_satisfies_droop_pjr_plusIf k + 1 divides n, every committee selected by the Droop Monroe rule satisfies Droop-PJR+. This settles the PJR+ entry for Droop Monroe…
- droop_monroe_violates_droop_pjr_plus_of_not_dvdWithout the assumption that k + 1 divides n, the Droop Monroe rule can output a committee violating Droop-PJR+: with n = 4 voters, k = 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