AFTD Auto-Formalizing Theoretical Domains

condorcet_cover_rank_relation

def

The loopless rank-compatible relation: an arrow a to b is permitted precisely when a differs from b and a has a strictly smaller natural-number rank than b in every acyclic-set index containing both vertices.

Statement

def condorcet_cover_rank_relation {m n : ℕ}
    (U : Fin n → Finset (Fin m)) (p : Fin n → Fin m → ℕ)
    (a b : Fin m) : Prop
Source
IN-391, OP-19 campaign session10, 2026-10-30. General rank-saturation and dominance-deletion route for the acyclic half-cover reformulation. Supporting structural lemmas only; no election bound or research novelty is claimed.
Verified
30 Oct 2026
Axioms
none listed
Built on 1
Used by 10

Lean source view module on GitHub

open Finset
set_option maxHeartbeats 4000000

def condorcet_cover_rank_relation {m n : ℕ}
    (U : Fin n → Finset (Fin m)) (p : Fin n → Fin m → ℕ)
    (a b : Fin m) : Prop :=
  a ≠ b ∧ ∀ v, a ∈ U v → b ∈ U v → p v a < p v b
See it in the graphDiscuss this resultChallenge it