AFTD Auto-Formalizing Theoretical Domains

is_temporal_droop_fjr

def

Droop-FJR for temporal elections (arXiv:2505.22513, Def. A.6): for every nonempty group S and set of rounds T there is R ⊆ T of size ⌈(|T|+1)|S|/n⌉ - 1 such that for every outcome o′ some i ∈ S has sat_i(o) ≥ min over j ∈ S of sat_j(o′ restricted to R).

Statement

def is_temporal_droop_fjr {n ℓ m : ℕ} (a : Fin n → Fin ℓ → Finset (Fin m))
    (o : Fin ℓ → Fin m) : Prop
Defined in
arXiv:2505.22513, Def. A.6 (Droop-FJR for temporal elections)
Verified
06 Oct 2026
Axioms
none listed
Built on 1
  • temporal_satSatisfaction of voter i in a temporal election from outcome o restricted to rounds R: the number of rounds r in R with o(r) approved by i…
Used by 1
  • temporal_droop_fjr_not_imp_bfjrDroop-FJR does not imply BFJR in temporal voting, even when no voter approves every candidate in a round. Four voters, six rounds, two…

Lean source view module on GitHub

/-- Droop-FJR for temporal elections (arXiv:2505.22513, Def. A.6): for every nonempty group `S` and every set of rounds `T` there is `R ⊆ T` with `|R| = ⌈(|T|+1)|S|/n⌉ - 1` such that for every outcome `o'` some `i ∈ S` has `sat_i(o) ≥ min_{j ∈ S} sat_j(o'_R)`. -/
def is_temporal_droop_fjr {n ℓ m : ℕ} (a : Fin n → Fin ℓ → Finset (Fin m))
    (o : Fin ℓ → Fin m) : Prop :=
  ∀ S : Finset (Fin n), S.Nonempty → ∀ T : Finset (Fin ℓ),
    ∃ R ⊆ T, R.card = ((T.card + 1) * S.card + n - 1) / n - 1 ∧
      ∀ o' : Fin ℓ → Fin m, ∃ i ∈ S, ∃ j ∈ S,
        temporal_sat a j o' R ≤ temporal_sat a i o Finset.univ
See it in the graphDiscuss this resultChallenge it