condorcet_private_triple_stationarity_obstruction
There exist a strict tournament R on19 vertices with a common predecessor for every ordered triple, a chosen three-element set J(a) for every vertex a, natural vertex weights w, and an induced acyclic subset U. Each a is outside J(a), points to all of J(a), and is its unique common predecessor. The exact flow identity 3*w(b)=sum of w(a) over a with b in J(a) holds at every b. The total weight is35087, and U has weight22469, strictly above half. Thus some choice of private triples has stationary weights failing the required acyclic half bound. No claim is made about every policy or averaging over all private triples.
Statement
theorem condorcet_private_triple_stationarity_obstruction : ∃ (R : Fin 19 → Fin 19 → Prop) (J : Fin 19 → Finset (Fin 19)) (w : Fin 19 → ℕ) (U : Finset (Fin 19)), (∀ a, ¬ R a a) ∧ (∀ a b, a ≠ b → (R a b ↔ ¬ R b a)) ∧ (∀ a b c, ∃ r, R r a ∧ R r b ∧ R r c) ∧ (∀ a, (J a).card = 3 ∧ a ∉ J a ∧ (∀ b ∈ J a, R a b) ∧ ∀ r, (∀ b ∈ J a, R r b) → r = a) ∧ (∀ b, 3 * w b = ∑ a, if b ∈ J a then w a else 0) ∧ (∑ a, w a) = 35087 ∧ (∑ a ∈ U, w a) = 22469 ∧ 0 < (∑ a, w a) ∧ (∑ a, w a) < 2 * (∑ a ∈ U, w a) ∧ WellFounded (fun a b : {a : Fin 19 // a ∈ U} => R a.val b.val)
- Source
- IN-357 method diagnostic for OP-19, experiments8922 and8923. This refutes a newly tested arbitrary-private-policy construction for the acyclic-weight-separation target. It is not a refutation of the election conjecture or of optimized policies, and is not a research advance. The finite relation is the residue tournament on19 vertices; all data and acyclicity are kernel checked.
- Verified
- 29 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Used by 3
- condorcet_dimension_le_three_iff_oriented_acyclic_weight_separationThe unchanged universal strict three-candidate election conjecture is equivalent to the strict acyclic-weight-separation assertion…
- condorcet_join_cycle_tensor_mixed_fiber_boundFor the fixed19-vertex residue tournament, let left and right real fiber masses lie between0 and a common nonnegative bound k. Assume that…
- condorcet_permutation_tensor_acyclic_lt_halfLet I be any nonempty finite type and choose one permutation of I for each of two sides. On vertices (side,index,t) with t in the…
The proof, explained
We provide an explicit counterexample on 19 vertices. The tournament relation, private triples, weights, and acyclic set are defined explicitly. All finite tournament, predecessor, flow, mass, and ordering properties are verified by exhaustive computation with decide, and acyclicity of the subset is proved by showing the relation strictly increases a natural-number rank function. Finally, these components are assembled to instantiate the existential claim.
R is a tournament
Verified by exhaustive computation.
¬condorcet_private_stationary_relation b a)) := by decide
Every triple has a common predecessor
Verified by exhaustive computation.
condorcet_private_stationary_relation r c := by decide
Each vertex has a unique predecessor for its triple
Verified by exhaustive computation.
condorcet_private_stationary_relation r b) → r = a := by decide
Stationary flow condition holds
Verified by exhaustive computation.
condorcet_private_stationary_weight a else 0 := by decide
Total mass and subset mass bounds
Verified by exhaustive computation.
decideEdges in U strictly increase order
Verified by exhaustive computation.
condorcet_private_stationary_order a < condorcet_private_stationary_order b := by decide
The relation on U is well-founded
By pulling back the standard ordering on ℕ.
refine (measure (fun a : {a : Fin 19 // a ∈ condorcet_private_stationary_set} => condorcet_private_stationary_order a.val)).wf.mono ?_ intro a b hab exact condorcet_private_stationary_ordered a.val b.val a.property b.property hab
The main theorem holds
Assemble witnesses and verified properties.
refine ⟨condorcet_private_stationary_relation, condorcet_private_stationary_triple, condorcet_private_stationary_weight, condorcet_private_stationary_set, condorcet_private_stationary_tournament.1, condorcet_private_stationary_tournament.2, condorcet_private_stationary_s3, condorcet_private_stationary_unique, condorcet_private_stationary_flow, ?_, ?_, ?_, ?_, condorcet_private_stationary_wellFounded⟩ · exact condorcet_private_stationary_mass.1 · exact condorcet_private_stationary_mass.2.1 · exact condorcet_private_stationary_mass.2.2.1 · exact condorcet_private_stationary_mass.2.2.2
Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
open Finsetopen scoped BigOperatorsset_option maxHeartbeats 12000000set_option maxRecDepth 20000def condorcet_private_stationary_relation (a b : Fin 19) : Prop := (b-a).val ∈ ([1, 4, 5, 6, 7, 9, 11, 16, 17] : List ℕ)instance : DecidableRel condorcet_private_stationary_relation := fun a b => inferInstanceAs (Decidable ((b-a).val ∈ ([1, 4, 5, 6, 7, 9, 11, 16, 17] : List ℕ)))def condorcet_private_stationary_triple : Fin 19 → Finset (Fin 19) := ![{6,11,17},{6,17,18},{6,8,11},{0,1,8},{1,2,9},{2,3,10},{3,11,15},{4,5,12},{6,15,17},{1,6,10},{0,2,8},{15,17,18},{0,2,9},{0,1,17},{6,11,15},{0,2,3},{1,2,14},{3,14,15},{3,6,15}]def condorcet_private_stationary_weight : Fin 19 → ℕ := ![3610,1717,1893,5151,0,0,4206,0,2348,0,0,3656,0,0,1259,5679,0,3777,1791]def condorcet_private_stationary_order : Fin 19 → ℕ := ![0,0,0,4,0,0,0,0,0,0,0,1,0,0,0,3,0,2,0]def condorcet_private_stationary_set : Finset (Fin 19) := {6,11,17,15,3}theorem condorcet_private_stationary_tournament : (∀ a, ¬condorcet_private_stationary_relation a a) ∧ (∀ a b, a ≠ b → (condorcet_private_stationary_relation a b ↔ ¬condorcet_private_stationary_relation b a)) := by decidetheorem condorcet_private_stationary_s3 : ∀ a b c : Fin 19, ∃ r, condorcet_private_stationary_relation r a ∧ condorcet_private_stationary_relation r b ∧ condorcet_private_stationary_relation r c := by decidetheorem condorcet_private_stationary_unique : ∀ a : Fin 19, (condorcet_private_stationary_triple a).card = 3 ∧ a ∉ condorcet_private_stationary_triple a ∧ (∀ b ∈ condorcet_private_stationary_triple a, condorcet_private_stationary_relation a b) ∧ ∀ r, (∀ b ∈ condorcet_private_stationary_triple a, condorcet_private_stationary_relation r b) → r = a := by decidetheorem condorcet_private_stationary_flow : ∀ b : Fin 19, 3 * condorcet_private_stationary_weight b = ∑ a : Fin 19, if b ∈ condorcet_private_stationary_triple a then condorcet_private_stationary_weight a else 0 := by decidetheorem condorcet_private_stationary_mass : (∑ a : Fin 19, condorcet_private_stationary_weight a) = 35087 ∧ (∑ a ∈ condorcet_private_stationary_set, condorcet_private_stationary_weight a) = 22469 ∧ 0 < (∑ a : Fin 19, condorcet_private_stationary_weight a) ∧ (∑ a : Fin 19, condorcet_private_stationary_weight a) < 2 * (∑ a ∈ condorcet_private_stationary_set, condorcet_private_stationary_weight a) := by decidetheorem condorcet_private_stationary_ordered : ∀ a b : Fin 19, a ∈ condorcet_private_stationary_set → b ∈ condorcet_private_stationary_set → condorcet_private_stationary_relation a b → condorcet_private_stationary_order a < condorcet_private_stationary_order b := by decidetheorem condorcet_private_stationary_wellFounded : WellFounded (fun a b : {a : Fin 19 // a ∈ condorcet_private_stationary_set} => condorcet_private_stationary_relation a.val b.val) := by refine (measure (fun a : {a : Fin 19 // a ∈ condorcet_private_stationary_set} => condorcet_private_stationary_order a.val)).wf.mono ?_ intro a b hab exact condorcet_private_stationary_ordered a.val b.val a.property b.property habtheorem condorcet_private_triple_stationarity_obstruction : ∃ (R : Fin 19 → Fin 19 → Prop) (J : Fin 19 → Finset (Fin 19)) (w : Fin 19 → ℕ) (U : Finset (Fin 19)), (∀ a, ¬ R a a) ∧ (∀ a b, a ≠ b → (R a b ↔ ¬ R b a)) ∧ (∀ a b c, ∃ r, R r a ∧ R r b ∧ R r c) ∧ (∀ a, (J a).card = 3 ∧ a ∉ J a ∧ (∀ b ∈ J a, R a b) ∧ ∀ r, (∀ b ∈ J a, R r b) → r = a) ∧ (∀ b, 3 * w b = ∑ a, if b ∈ J a then w a else 0) ∧ (∑ a, w a) = 35087 ∧ (∑ a ∈ U, w a) = 22469 ∧ 0 < (∑ a, w a) ∧ (∑ a, w a) < 2 * (∑ a ∈ U, w a) ∧ WellFounded (fun a b : {a : Fin 19 // a ∈ U} => R a.val b.val) := by refine ⟨condorcet_private_stationary_relation, condorcet_private_stationary_triple, condorcet_private_stationary_weight, condorcet_private_stationary_set, condorcet_private_stationary_tournament.1, condorcet_private_stationary_tournament.2, condorcet_private_stationary_s3, condorcet_private_stationary_unique, condorcet_private_stationary_flow, ?_, ?_, ?_, ?_, condorcet_private_stationary_wellFounded⟩ · exact condorcet_private_stationary_mass.1 · exact condorcet_private_stationary_mass.2.1 · exact condorcet_private_stationary_mass.2.2.1 · exact condorcet_private_stationary_mass.2.2.2