AFTD Auto-Formalizing Theoretical Domains

temporal_embed_sat

def

Satisfaction of voter i from a set Y of (candidate, round) pairs: the number of pairs (c, r) in Y with c approved by i in round r.

Statement

def temporal_embed_sat {n ℓ m : ℕ} (a : Fin n → Fin ℓ → Finset (Fin m)) (i : Fin n)
    (Y : Finset (Fin m × Fin ℓ)) : ℕ
Defined in
arXiv:2505.22513, App. A (satisfaction in the general-approval embedding)
Verified
06 Oct 2026
Axioms
none listed
Used by 3
  • 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…
  • is_bfjr_cohesive(α, β)-BFJR-cohesiveness (arXiv:2505.22513, Def. A.5) in the embedding of a temporal election: for every feasible X, either some Y with…
  • is_temporal_bfjrBFJR for a temporal outcome o (arXiv:2505.22513, Def. A.5): every (α, β)-BFJR-cohesive group has a member with satisfaction at least β…

Lean source view module on GitHub

/-- Satisfaction of voter `i` from a set `Y` of (candidate, round) pairs: the number of pairs `(c, r) ∈ Y` with `c ∈ a i r`. -/
def temporal_embed_sat {n ℓ m : ℕ} (a : Fin n → Fin ℓ → Finset (Fin m)) (i : Fin n)
    (Y : Finset (Fin m × Fin ℓ)) : ℕ :=
  (Y.filter fun p => p.1 ∈ a i p.2).card
See it in the graphDiscuss this resultChallenge it