AFTD Auto-Formalizing Theoretical Domains

population_paradox

def

A population paradox between (p, h) and (p', h'): two states i != j with p'_i >= p_i and p'_j <= p_j such that i loses a seat and j gains one.

Statement

def population_paradox {n : ℕ} (f : (Fin n → ℕ) → ℕ → (Fin n → ℕ)) (p p' : Fin n → ℕ) (h h' : ℕ) : Prop
Defined in
In This Apportionment Lottery, the House Always Wins, arXiv:2202.11061 (EC 2022 / Operations Research), Sec. 2 and Sec. 3.1; formalized by the operator (Claude), 2026-10-03
Verified
03 Oct 2026
Axioms
none listed
Used by 2

Lean source view module on GitHub

/-- A population paradox (In This Apportionment Lottery, the House Always Wins, Sec. 2) of the apportionment solution `f` between `(p, h)` and `(p', h')`: states `i ≠ j` with `p'_i ≥ p_i` and `p'_j ≤ p_j`, yet `i` loses a seat and `j` gains one. -/
def population_paradox {n : ℕ} (f : (Fin n → ℕ) → ℕ → (Fin n → ℕ)) (p p' : Fin n → ℕ) (h h' : ℕ) : Prop :=
  ∃ i j, i ≠ j ∧ p i ≤ p' i ∧ p' j ≤ p j ∧ f p' h' i < f p h i ∧ f p h j < f p' h' j
See it in the graphDiscuss this resultChallenge it