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
- condorcet_failure_iff_acyclic_half_coverFix a positive number n of voters. There exists a finite election with these n voters in which every candidate set of size at most three…
- Used by 10
- condorcet_critical_rank_core_source_exchangeFor positive k and n=k+q, a nonempty induced S_k subset of a rank relation whose vertices all have q active indices and satisfy the…
- condorcet_small_complement_fractional_coverFor k at least two, let a finite nonnegative real-weighted family of subsets have unit weighted coverage at every element of a specified…
- condorcet_minimal_rank_core_pareto_antichainIn a globally minimum induced S_k subset of a rank-compatible relation, with every vertex active somewhere, distinct vertices a and b with…
- condorcet_acyclic_cover_rank_minimumFor positive q, every finite S_k relation with an n-set acyclic family covering every vertex at least q times yields a trimmed exactly-q…
- condorcet_cover_rank_dominated_vertex_deleteInside an induced S_k subset B of a rank-compatible relation, a vertex b can be deleted when a distinct vertex a in B is active somewhere,…
- condorcet_stable_fractional_tight_cover_obstructionThere are twenty three-element activity sets on six vertices, covering each vertex ten times, and injective local rankings. A stable…
- condorcet_acyclic_cover_rank_saturationFor any finite relation with the outside common predecessor property for sets of at most k vertices and any finite acyclic cover family,…
- condorcet_cover_rank_relation_acyclicEvery activity set induces a well-founded relation in the rank-compatible relation, without any injectivity assumption on the ranks.
- condorcet_arc_maximal_cohort_selection_obstructionThere is an eleven-vertex S2 relation with six acyclic sets, exactly three memberships per vertex, and a rank-compatible description with…
- condorcet_source_anchored_exchange_obstructionThere is a forty-vertex rank-compatible S2 relation with injective rankings with six acyclic sets and exactly three memberships per…
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