AFTD Auto-Formalizing Theoretical Domains

wild_valid_triples_nine_repair

theoremverified

For any normalized symmetric row-injective array on an arbitrary vertex/color type, take nine distinct vertices. If their first triple has the indicated invalidity witness and the other two triples are valid, a permutation rearranges the nine vertices into three valid triples. Array values may lie outside the nine vertices. This is a validity repair only; it does not eliminate larger seals.

Statement

theorem wild_valid_triples_nine_repair {C : Type*} (A : C → C → C)
    (hdiag : ∀ u,A u u=u) (hsym : ∀ u w,A u w=A w u)
    (hinj : ∀ u,Function.Injective (A u))
    (v : Fin 9 → C) (hv : Function.Injective v)
    (hbad : A (v 0) (v 1)=v 2)
    (hT1 : (A (v 3) (v 4)≠v 5 ∧ A (v 3) (v 5)≠v 4 ∧ A (v 4) (v 5)≠v 3))
    (hT2 : (A (v 6) (v 7)≠v 8 ∧ A (v 6) (v 8)≠v 7 ∧ A (v 7) (v 8)≠v 6)) : ∃ σ : Equiv.Perm (Fin 9),∀ t : Fin 3,
      A (v (σ ⟨3*t.val+0,by omega⟩)) (v (σ ⟨3*t.val+1,by omega⟩))≠(v (σ ⟨3*t.val+2,by omega⟩)) ∧ A (v (σ ⟨3*t.val+0,by omega⟩)) (v (σ ⟨3*t.val+2,by omega⟩))≠(v (σ ⟨3*t.val+1,by omega⟩)) ∧ A (v (σ ⟨3*t.val+1,by omega⟩)) (v (σ ⟨3*t.val+2,by omega⟩))≠(v (σ ⟨3*t.val+0,by omega⟩))
Source
IN-342 supporting steps for OP-306, arXiv:2610.22142 Sections3.3.2/6. The target remains prescribed-coloring sharpness; these are local validity and conditioning-family helpers, not a seal-free partition theorem or new wild-number bound. No research advance is claimed. The former combined helper timed out in the180-second interactive gate. This is the SAME checked certificate and mathematical interpretation, split into a core and four soundness modules; no gate budget, axiom or mathematical statement is weakened.
Verified
29 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 5
Used by 1
  • wild_valid_triples_nine_factorEvery injective nine-vertex restriction of a normalized symmetric row-injective array can be permuted into three valid triples. The range…

The proof, explained

The proof proceeds by contradiction. Assuming no permutation of the nine vertices partitions them into three valid triples, the relations among the vertices define a truth assignment to propositional variables. Four encoding theorems show that this assignment satisfies a propositional formula encoding the problem constraints. Finally, a certified SAT refutation (wild_valid_triples_nine_sat_core) proves this formula is unsatisfiable, deriving False and concluding that a valid repair permutation must exist.

  1. The indices 3t, 3t + 1, and 3t + 2 are strictly less than 9 for any t ∈ Fin 3. automation

    In the theorem statement, defining each of the three triples requires indexing into Fin 9. Since t < 3, linear integer arithmetic (discharged by omega) verifies that 3t + 0, 3t + 1, and 3t + 2 are all strictly less than 9.

    line 11

          A (v (σ ⟨3*t.val+0,by omega⟩)) (v (σ ⟨3*t.val+1,by omega⟩))≠(v (σ ⟨3*t.val+2,by omega⟩)) ∧ A (v (σ ⟨3*t.val+0,by omega⟩)) (v (σ ⟨3*t.val+2,by omega⟩))≠(v (σ ⟨3*t.val+1,by omega⟩)) ∧ A (v (σ ⟨3*t.val+1,by omega⟩)) (v (σ ⟨3*t.val+2,by omega⟩))≠(v (σ ⟨3*t.val+0,by omega⟩)) := by
  2. We may assume for contradiction that no valid repair permutation exists.

    The existence goal is restated in terms of the predicate in342_nine_goal A v. We then assume the negation of this goal for contradiction (hno : ¬in342_nine_goal A v).

    lines 12–13

      change in342_nine_goal A v
      by_contra hno
  3. The valuation induced by the array and vertices satisfies the entire propositional formula in342_nine_formula.

    The array values on the nine vertices define a boolean valuation in342_nine_val A v. Four helper theorems (parts a, b, c, and d) establish that the array axioms, the distinctness of the nine vertices, the initial triple validity assumptions, and the non-existence of a repair permutation force this valuation to satisfy four subformulas. Applying in342_nine_sat_and combines these satisfaction results into satisfaction of their full conjunction, in342_nine_formula.

    line 14

    uses in342_nine_sat_and, wild_valid_triples_nine_encoding_part_a, wild_valid_triples_nine_encoding_part_b, wild_valid_triples_nine_encoding_part_c, wild_valid_triples_nine_encoding_part_d

      have hF : (in342_nine_val A v).satisfies_fmla in342_nine_formula := (in342_nine_sat_and (in342_nine_sat_and (wild_valid_triples_nine_encoding_part_a A hdiag hsym hinj v hv hbad hT1 hT2 hno) (wild_valid_triples_nine_encoding_part_b A hdiag hsym hinj v hv hbad hT1 hT2 hno)) (in342_nine_sat_and (wild_valid_triples_nine_encoding_part_c A hdiag hsym hinj v hv hbad hT1 hT2 hno) (wild_valid_triples_nine_encoding_part_d A hdiag hsym hinj v hv hbad hT1 hT2 hno)))
  4. A contradiction is derived, completing the proof.

    The lemma wild_valid_triples_nine_sat_core provides a verified refutation (a proof of the empty clause) for in342_nine_formula. Evaluating this refutation on the valuation in342_nine_val A v and its satisfaction proof hF yields False.

    line 15

    uses wild_valid_triples_nine_sat_core

      exact wild_valid_triples_nine_sat_core (in342_nine_val A v) hF
in342_nine_sat_and
If a valuation satisfies formula f and formula g, then it satisfies their conjunction f ∧ g.
wild_valid_triples_nine_encoding_part_a
Under the theorem's hypotheses together with the assumption that no repair permutation exists, the valuation satisfies part A of the encoding formula.
wild_valid_triples_nine_encoding_part_b
Under the theorem's hypotheses together with the assumption that no repair permutation exists, the valuation satisfies part B of the encoding formula.
wild_valid_triples_nine_encoding_part_c
Under the theorem's hypotheses together with the assumption that no repair permutation exists, the valuation satisfies part C of the encoding formula.
wild_valid_triples_nine_encoding_part_d
Under the theorem's hypotheses together with the assumption that no repair permutation exists, the valuation satisfies part D of the encoding formula.
wild_valid_triples_nine_sat_core
The propositional formula in342_nine_formula is unsatisfiable, deriving the empty clause.

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

set_option maxHeartbeats 4000000set_option maxRecDepth 20000theorem wild_valid_triples_nine_repair {C : Type*} (A : C → C → C)    (hdiag : ∀ u,A u u=u) (hsym : ∀ u w,A u w=A w u)    (hinj : ∀ u,Function.Injective (A u))    (v : Fin 9 → C) (hv : Function.Injective v)    (hbad : A (v 0) (v 1)=v 2)    (hT1 : (A (v 3) (v 4)≠v 5 ∧ A (v 3) (v 5)≠v 4 ∧ A (v 4) (v 5)≠v 3))    (hT2 : (A (v 6) (v 7)≠v 8 ∧ A (v 6) (v 8)≠v 7 ∧ A (v 7) (v 8)≠v 6)) : ∃ σ : Equiv.Perm (Fin 9),∀ t : Fin 3,      A (v (σ ⟨3*t.val+0,by omega⟩)) (v (σ ⟨3*t.val+1,by omega⟩))≠(v (σ ⟨3*t.val+2,by omega⟩)) ∧ A (v (σ ⟨3*t.val+0,by omega⟩)) (v (σ ⟨3*t.val+2,by omega⟩))≠(v (σ ⟨3*t.val+1,by omega⟩)) ∧ A (v (σ ⟨3*t.val+1,by omega⟩)) (v (σ ⟨3*t.val+2,by omega⟩))≠(v (σ ⟨3*t.val+0,by omega⟩)) := by  change in342_nine_goal A v  by_contra hno  have hF : (in342_nine_val A v).satisfies_fmla in342_nine_formula := (in342_nine_sat_and (in342_nine_sat_and (wild_valid_triples_nine_encoding_part_a A hdiag hsym hinj v hv hbad hT1 hT2 hno) (wild_valid_triples_nine_encoding_part_b A hdiag hsym hinj v hv hbad hT1 hT2 hno)) (in342_nine_sat_and (wild_valid_triples_nine_encoding_part_c A hdiag hsym hinj v hv hbad hT1 hT2 hno) (wild_valid_triples_nine_encoding_part_d A hdiag hsym hinj v hv hbad hT1 hT2 hno)))  exact wild_valid_triples_nine_sat_core (in342_nine_val A v) hF
See it in the graphDiscuss this resultChallenge it