AFTD Auto-Formalizing Theoretical Domains

condorcet_s2_incidence_recipe_failure_witness

theoremverified

The existing eight-vertex S3 relation actually contains a three-vertex S2 core with the fixed-incidence recipe obstruction: its unique common root together with a core vertex form an acyclic pair of weight3 out of total5. The witness explicitly supplies the core and its pair-predecessor property, so the conditional all-core diagnostic has a concrete instance.

Statement

theorem condorcet_s2_incidence_recipe_failure_witness :
    ∃ D : Finset (Fin 8), D.card=3 ∧
      (∀ a∈D,∀ b∈D,∃ c∈D,
        condorcet_uniform_outgoing_gap_relation c a ∧
        condorcet_uniform_outgoing_gap_relation c b) ∧
      ∃ r a : Fin 8, r ∉ D ∧ a ∈ D ∧
      (∀ x, (∀ b ∈ D, condorcet_uniform_outgoing_gap_relation x b) ↔ x = r) ∧
      WellFounded (fun x y : {x : Fin 8 // x ∈ ({r,a} : Finset (Fin 8))} =>
        condorcet_uniform_outgoing_gap_relation x.val y.val) ∧
      (let w : Fin 8 → ℕ := fun x => (if x∈D then 1 else 0) + (if x=r then 2 else 0)
       (∑ x,w x) = 5 ∧ (∑ x∈({r,a} : Finset (Fin 8)),w x) = 3)
Source
IN-383, OP-19 campaign session9, 2026-10-30. Concrete nonvacuity check for the eight-vertex recipe diagnostic, using core {1,4,7}. Supporting method diagnostic only, not a main-conjecture counterexample or a research novelty claim.
Verified
30 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 2

The proof, explained

The theorem is established by providing an explicit three-vertex core D = {1, 4, 7} in the 8-vertex tournament relation. Exhaustive finite computation (`decide`) verifies that this set has three elements and that every pair of elements shares a common predecessor in D. Applying the obstruction theorem `condorcet_minimum_s2_incidence_root_policy_obstruction` to this witness immediately produces the desired common root, acyclic pair, and weight distribution.

  1. The set D = {1, 4, 7} is a 3-element core whose pairs of vertices each share a common predecessor in D.

    We instantiate the existential witness for D with the explicit set {1, 4, 7}. Lean verifies by finite evaluation (`decide`) both that this set has cardinality 3 and that for every pair of vertices a, b ∈ {1, 4, 7}, there exists a common predecessor c ∈ {1, 4, 7} with outgoing edges to both a and b under the gap relation.

    line 16

      refine ⟨{1,4,7},by decide,by decide,?_⟩
  2. There exist an external vertex r ∉ D and a vertex a ∈ D satisfying the unique common root, acyclicity, and weight distribution properties.

    We apply the theorem `condorcet_minimum_s2_incidence_root_policy_obstruction` to D = {1, 4, 7}. Its two hypotheses—that |D| = 3 and that all pairs in D share a common predecessor in D—are identical to the checks in the previous step and are again discharged by exhaustive finite computation (`decide`).

    lines 17–18

    uses condorcet_minimum_s2_incidence_root_policy_obstruction

      exact condorcet_minimum_s2_incidence_root_policy_obstruction {1,4,7}
        (by decide) (by decide)
condorcet_minimum_s2_incidence_root_policy_obstruction
In the 8-vertex gap relation, if a 3-element subset D has a common predecessor in D for every pair of vertices, then there exists an external vertex r ∉ D and an element a ∈ D such that r is the unique vertex with outgoing edges to all of D, the relation restricted to {r, a} is well-founded (acyclic), and the weight function w(x) = 1_{x ∈ D} + 2·1_{x = r} has total sum 5 and sums to 3 on {r, a}.

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

open Finsetopen scoped BigOperatorsset_option maxHeartbeats 4000000theorem condorcet_s2_incidence_recipe_failure_witness :    ∃ D : Finset (Fin 8), D.card=3 ∧      (∀ a∈D,∀ b∈D,∃ c∈D,        condorcet_uniform_outgoing_gap_relation c a ∧        condorcet_uniform_outgoing_gap_relation c b) ∧      ∃ r a : Fin 8, r ∉ D ∧ a ∈ D ∧      (∀ x, (∀ b ∈ D, condorcet_uniform_outgoing_gap_relation x b) ↔ x = r) ∧      WellFounded (fun x y : {x : Fin 8 // x ∈ ({r,a} : Finset (Fin 8))} =>        condorcet_uniform_outgoing_gap_relation x.val y.val) ∧      (let w : Fin 8 → ℕ := fun x => (if x∈D then 1 else 0) + (if x=r then 2 else 0)       (∑ x,w x) = 5 ∧ (∑ x∈({r,a} : Finset (Fin 8)),w x) = 3) := by  refine ⟨{1,4,7},by decide,by decide,?_⟩  exact condorcet_minimum_s2_incidence_root_policy_obstruction {1,4,7}    (by decide) (by decide)
See it in the graphDiscuss this resultChallenge it