condorcet_all_triple_policy_one_third_bridge_obstruction
For the explicit six-vertex irreflexive relation with predecessor masks[62,61,35,7,11,19], every set of at most three vertices has an outside common predecessor. No proper induced subset retains this property, and each arrow lies in a three-element out-neighborhood set for which its root is the unique common predecessor. The integer weights[3,3,1,1,1,1] have total10 and put at most3 on any induced acyclic subset. On the other hand, every nonnegative occupation on ALL outgoing three-element sets satisfying triple stationarity has an induced acyclic subset of at least3/8 of its total vertex weight, expressed homogeneously. The rational inequalities3/10<1/3<3/8<1/2 hold. This refutes a proposed policy bound by max(unrestricted optimum,1/3), not the half-threshold policy route or the main election statement.
Statement
theorem condorcet_all_triple_policy_one_third_bridge_obstruction : (∀ J : Finset (Fin 6), J.card ≤ 3 → ∃ a, a ∉ J ∧ ∀ b ∈ J, condorcet_six_core_relation a b) ∧ (∀ B : Finset (Fin 6), (∀ J : Finset (Fin 6), J ⊆ B → J.card ≤ 3 → ∃ a, a ∈ B ∧ a ∉ J ∧ ∀ b ∈ J, condorcet_six_core_relation a b) → B = univ) ∧ (∀ a b : Fin 6, condorcet_six_core_relation a b → ∃ J ∈ condorcet_six_core_actions a, b ∈ J ∧ ∀ r, (∀ t ∈ J, condorcet_six_core_relation r t) → r = a) ∧ (∑ a : Fin 6, condorcet_six_core_weight a) = 10 ∧ (∀ A : Finset (Fin 6), WellFounded (fun a b : {a : Fin 6 // a ∈ A} => condorcet_six_core_relation a.val b.val) → (∑ a ∈ A, condorcet_six_core_weight a) ≤ 3) ∧ (∀ (x : Fin 6 → Finset (Fin 6) → ℝ) (w : Fin 6 → ℝ), (∀ a, ∀ J ∈ condorcet_six_core_actions a, 0 ≤ x a J) → (∀ a, w a = ∑ J ∈ condorcet_six_core_actions a, x a J) → (∀ b, 3 * w b = ∑ a, ∑ J ∈ condorcet_six_core_actions a, if b ∈ J then x a J else 0) → ∃ A : Finset (Fin 6), WellFounded (fun a b : {a : Fin 6 // a ∈ A} => condorcet_six_core_relation a.val b.val) ∧ 3 * (∑ a, w a) ≤ 8 * (∑ a ∈ A, w a)) ∧ (3 / 10 : ℚ) < 1 / 3 ∧ (1 / 3 : ℚ) < 3 / 8 ∧ (3 / 8 : ℚ) < 1 / 2
- Source
- IN-372 method diagnostic for OP-19. Targeted computation9290 and exact integer audit9292. No novelty or research advance is claimed. The broad bridge tested here is stronger than the unrefuted strict-half policy condition.
- Verified
- 30 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 1
- condorcet_stationary_action_dual_acyclic_massFor nonnegative occupations of arbitrary finite families of rooted finite-set actions, let each vertex weight equal the sum of occupations…
The proof, explained
We analyze an explicit six-vertex tournament-like relation to demonstrate a gap between the unrestricted optimum weight of an acyclic set and the weight guaranteed under stationary policies on triple actions. Finite computation establishes the S_3 property, minimality, arc privatization, and forbidden-set properties. An LP duality argument shows that any stationary occupation measure places at least 3/8 of its weight on an induced acyclic set, whereas an unrestricted weight puts at most 3/10, refuting a conjectured 1/3 bound.
condorcet_six_core_s3 holds automation
Verified by exhaustive finite search.
∃ a, a ∉ J ∧ ∀ b ∈ J, condorcet_six_core_relation a b := by decide
condorcet_six_core_minimum holds automation
Verified by exhaustive finite search.
decidecondorcet_six_core_private_arcs holds automation
Verified by exhaustive finite search.
b ∈ J ∧ ∀ r, (∀ t ∈ J, condorcet_six_core_relation r t) → r = a := by decide
condorcet_six_core_order_check holds automation
Verified by exhaustive finite search.
condorcet_six_core_orders j a < condorcet_six_core_orders j b := by decide
condorcet_six_core_sets_acyclic holds
The order is a measure so it is well-founded.
uses
condorcet_six_core_order_checkrefine (measure (fun a : {a : Fin 6 // a ∈ condorcet_six_core_sets j} => condorcet_six_core_orders j a.val)).wf.mono ?_ intro a b hab exact condorcet_six_core_order_check j a b a.property b.property hab
condorcet_six_core_dual_check holds automation
Verified by exhaustive finite search.
3 * condorcet_six_core_potential a := by decide
condorcet_six_core_policy_bound holds
Dual check and acyclic mass bound.
uses
condorcet_six_core_dual_check,condorcet_stationary_action_dual_acyclic_mass,condorcet_six_core_sets_acyclichave hdual : ∀ a : Fin 6, ∀ J ∈ condorcet_six_core_actions a, (6 : ℝ) + (∑ b ∈ J, (condorcet_six_core_potential b : ℝ)) ≤ (∑ j : Fin 4, if a ∈ condorcet_six_core_sets j then (4 : ℝ) else 0) + 3 * (condorcet_six_core_potential a : ℝ) := by intro a J hJ exact_mod_cast condorcet_six_core_dual_check a J hJ obtain ⟨j,hj⟩ := condorcet_stationary_action_dual_acyclic_mass 6 4 (by decide) condorcet_six_core_actions x w (fun a => (condorcet_six_core_potential a : ℝ)) condorcet_six_core_sets (fun _ => 4) 6 (by intro j; norm_num) hx hw hflow hdual norm_num at hj exact ⟨_,condorcet_six_core_sets_acyclic j,by linarith⟩
condorcet_six_core_forbidden_check holds automation
Verified by exhaustive finite search.
B.Nonempty ∧ ∀ a ∈ B, ∃ b ∈ B, condorcet_six_core_relation b a := by decide
condorcet_six_core_weight_check holds automation
Verified by exhaustive finite search.
(∑ a ∈ A, condorcet_six_core_weight a) ≤ 3 := by decide
condorcet_six_core_unrestricted_bound holds
No forbidden set can be in an acyclic set.
uses
condorcet_six_core_weight_check,condorcet_six_core_forbidden_checkapply condorcet_six_core_weight_check A intro B hB hsub obtain ⟨hne,hpred⟩ := condorcet_six_core_forbidden_check B hB obtain ⟨b,hb⟩ := hne obtain ⟨a,ha,hmin⟩ := hA.has_min {a : {a : Fin 6 // a ∈ A} | a.val ∈ B} ⟨⟨b,hsub hb⟩,hb⟩ obtain ⟨c,hc,hca⟩ := hpred a.val ha exact hmin ⟨c,hsub hc⟩ hc hca
condorcet_six_core_stationary_check holds automation
Verified by exhaustive finite search.
(∑ a ∈ A, condorcet_six_core_stationary_weight a) ≤ 9) := by decide
Final theorem holds
Combining the properties.
uses
condorcet_six_core_s3,condorcet_six_core_minimum,condorcet_six_core_private_arcs,condorcet_six_core_unrestricted_bound,condorcet_six_core_policy_boundexact ⟨condorcet_six_core_s3,condorcet_six_core_minimum,condorcet_six_core_private_arcs, by decide,condorcet_six_core_unrestricted_bound,condorcet_six_core_policy_bound, by norm_num,by norm_num,by norm_num⟩
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 20000000set_option maxRecDepth 20000def condorcet_six_core_pred : Fin 6 → ℕ := ![62,61,35,7,11,19]def condorcet_six_core_relation (a b : Fin 6) : Prop := (condorcet_six_core_pred b).testBit a.val = trueinstance : DecidableRel condorcet_six_core_relation := fun a b => inferInstanceAs (Decidable ((condorcet_six_core_pred b).testBit a.val = true))def condorcet_six_core_actions (a : Fin 6) : Finset (Finset (Fin 6)) := (univ.powersetCard 3).filter fun J => ∀ b ∈ J, condorcet_six_core_relation a bdef condorcet_six_core_weight : Fin 6 → ℕ := ![3,3,1,1,1,1]def condorcet_six_core_sets : Fin 4 → Finset (Fin 6) := ![{3,4,5},{2,4,5},{2,3,5},{2,3,4}]def condorcet_six_core_orders : Fin 4 → Fin 6 → ℕ := ![![0,0,0,0,1,2],![0,0,2,0,0,1],![0,0,1,2,0,0],![0,0,0,1,2,0]]def condorcet_six_core_potential : Fin 6 → ℕ := ![3,3,0,0,0,0]def condorcet_six_core_forbidden : Finset (Finset (Fin 6)) := {{0,1},{0,2},{1,2},{0,3},{1,3},{0,4},{1,4},{0,5},{1,5},{2,3,4,5}}theorem condorcet_six_core_s3 : ∀ J : Finset (Fin 6), J.card ≤ 3 → ∃ a, a ∉ J ∧ ∀ b ∈ J, condorcet_six_core_relation a b := by decidetheorem condorcet_six_core_minimum : ∀ B : Finset (Fin 6), (∀ J : Finset (Fin 6), J ⊆ B → J.card ≤ 3 → ∃ a, a ∈ B ∧ a ∉ J ∧ ∀ b ∈ J, condorcet_six_core_relation a b) → B = univ := by decidetheorem condorcet_six_core_private_arcs : ∀ a b : Fin 6, condorcet_six_core_relation a b → ∃ J ∈ condorcet_six_core_actions a, b ∈ J ∧ ∀ r, (∀ t ∈ J, condorcet_six_core_relation r t) → r = a := by decidetheorem condorcet_six_core_order_check : ∀ j : Fin 4, ∀ a b : Fin 6, a ∈ condorcet_six_core_sets j → b ∈ condorcet_six_core_sets j → condorcet_six_core_relation a b → condorcet_six_core_orders j a < condorcet_six_core_orders j b := by decidetheorem condorcet_six_core_sets_acyclic (j : Fin 4) : WellFounded (fun a b : {a : Fin 6 // a ∈ condorcet_six_core_sets j} => condorcet_six_core_relation a.val b.val) := by refine (measure (fun a : {a : Fin 6 // a ∈ condorcet_six_core_sets j} => condorcet_six_core_orders j a.val)).wf.mono ?_ intro a b hab exact condorcet_six_core_order_check j a b a.property b.property habtheorem condorcet_six_core_dual_check : ∀ a : Fin 6, ∀ J ∈ condorcet_six_core_actions a, 6 + (∑ b ∈ J, condorcet_six_core_potential b) ≤ (∑ j : Fin 4, if a ∈ condorcet_six_core_sets j then 4 else 0) + 3 * condorcet_six_core_potential a := by decidetheorem condorcet_six_core_policy_bound (x : Fin 6 → Finset (Fin 6) → ℝ) (w : Fin 6 → ℝ) (hx : ∀ a, ∀ J ∈ condorcet_six_core_actions a, 0 ≤ x a J) (hw : ∀ a, w a = ∑ J ∈ condorcet_six_core_actions a, x a J) (hflow : ∀ b, 3 * w b = ∑ a, ∑ J ∈ condorcet_six_core_actions a, if b ∈ J then x a J else 0) : ∃ A : Finset (Fin 6), WellFounded (fun a b : {a : Fin 6 // a ∈ A} => condorcet_six_core_relation a.val b.val) ∧ 3 * (∑ a, w a) ≤ 8 * (∑ a ∈ A, w a) := by have hdual : ∀ a : Fin 6, ∀ J ∈ condorcet_six_core_actions a, (6 : ℝ) + (∑ b ∈ J, (condorcet_six_core_potential b : ℝ)) ≤ (∑ j : Fin 4, if a ∈ condorcet_six_core_sets j then (4 : ℝ) else 0) + 3 * (condorcet_six_core_potential a : ℝ) := by intro a J hJ exact_mod_cast condorcet_six_core_dual_check a J hJ obtain ⟨j,hj⟩ := condorcet_stationary_action_dual_acyclic_mass 6 4 (by decide) condorcet_six_core_actions x w (fun a => (condorcet_six_core_potential a : ℝ)) condorcet_six_core_sets (fun _ => 4) 6 (by intro j; norm_num) hx hw hflow hdual norm_num at hj exact ⟨_,condorcet_six_core_sets_acyclic j,by linarith⟩theorem condorcet_six_core_forbidden_check : ∀ B ∈ condorcet_six_core_forbidden, B.Nonempty ∧ ∀ a ∈ B, ∃ b ∈ B, condorcet_six_core_relation b a := by decidetheorem condorcet_six_core_weight_check : ∀ A : Finset (Fin 6), (∀ B ∈ condorcet_six_core_forbidden, ¬B ⊆ A) → (∑ a ∈ A, condorcet_six_core_weight a) ≤ 3 := by decidetheorem condorcet_six_core_unrestricted_bound (A : Finset (Fin 6)) (hA : WellFounded (fun a b : {a : Fin 6 // a ∈ A} => condorcet_six_core_relation a.val b.val)) : (∑ a ∈ A, condorcet_six_core_weight a) ≤ 3 := by apply condorcet_six_core_weight_check A intro B hB hsub obtain ⟨hne,hpred⟩ := condorcet_six_core_forbidden_check B hB obtain ⟨b,hb⟩ := hne obtain ⟨a,ha,hmin⟩ := hA.has_min {a : {a : Fin 6 // a ∈ A} | a.val ∈ B} ⟨⟨b,hsub hb⟩,hb⟩ obtain ⟨c,hc,hca⟩ := hpred a.val ha exact hmin ⟨c,hsub hc⟩ hc hcadef condorcet_six_core_occupation (a : Fin 6) (J : Finset (Fin 6)) : ℕ := if a = 0 then (if 1 ∈ J then 1 else 0) else if a = 1 then (if 0 ∈ J then 1 else 0) else 3def condorcet_six_core_stationary_weight (a : Fin 6) : ℕ := ∑ J ∈ condorcet_six_core_actions a, condorcet_six_core_occupation a Jtheorem condorcet_six_core_stationary_check : (∀ a, 0 < condorcet_six_core_stationary_weight a) ∧ (∑ a : Fin 6, condorcet_six_core_stationary_weight a) = 24 ∧ (∀ b : Fin 6, 3 * condorcet_six_core_stationary_weight b = ∑ a, ∑ J ∈ condorcet_six_core_actions a, if b ∈ J then condorcet_six_core_occupation a J else 0) ∧ (∀ A : Finset (Fin 6), (∀ B ∈ condorcet_six_core_forbidden, ¬B ⊆ A) → (∑ a ∈ A, condorcet_six_core_stationary_weight a) ≤ 9) := by decidetheorem condorcet_all_triple_policy_one_third_bridge_obstruction : (∀ J : Finset (Fin 6), J.card ≤ 3 → ∃ a, a ∉ J ∧ ∀ b ∈ J, condorcet_six_core_relation a b) ∧ (∀ B : Finset (Fin 6), (∀ J : Finset (Fin 6), J ⊆ B → J.card ≤ 3 → ∃ a, a ∈ B ∧ a ∉ J ∧ ∀ b ∈ J, condorcet_six_core_relation a b) → B = univ) ∧ (∀ a b : Fin 6, condorcet_six_core_relation a b → ∃ J ∈ condorcet_six_core_actions a, b ∈ J ∧ ∀ r, (∀ t ∈ J, condorcet_six_core_relation r t) → r = a) ∧ (∑ a : Fin 6, condorcet_six_core_weight a) = 10 ∧ (∀ A : Finset (Fin 6), WellFounded (fun a b : {a : Fin 6 // a ∈ A} => condorcet_six_core_relation a.val b.val) → (∑ a ∈ A, condorcet_six_core_weight a) ≤ 3) ∧ (∀ (x : Fin 6 → Finset (Fin 6) → ℝ) (w : Fin 6 → ℝ), (∀ a, ∀ J ∈ condorcet_six_core_actions a, 0 ≤ x a J) → (∀ a, w a = ∑ J ∈ condorcet_six_core_actions a, x a J) → (∀ b, 3 * w b = ∑ a, ∑ J ∈ condorcet_six_core_actions a, if b ∈ J then x a J else 0) → ∃ A : Finset (Fin 6), WellFounded (fun a b : {a : Fin 6 // a ∈ A} => condorcet_six_core_relation a.val b.val) ∧ 3 * (∑ a, w a) ≤ 8 * (∑ a ∈ A, w a)) ∧ (3 / 10 : ℚ) < 1 / 3 ∧ (1 / 3 : ℚ) < 3 / 8 ∧ (3 / 8 : ℚ) < 1 / 2 := by exact ⟨condorcet_six_core_s3,condorcet_six_core_minimum,condorcet_six_core_private_arcs, by decide,condorcet_six_core_unrestricted_bound,condorcet_six_core_policy_bound, by norm_num,by norm_num,by norm_num⟩