AFTD Auto-Formalizing Theoretical Domains

in715_deficit_proper_row_11

theoremverified

Finite certificate for the explicit fourteen-vertex graph.

Statement

theorem in715_deficit_proper_row_11 : ∀ v : Fin 14, G.Adj 11 v → s((11 : Fin 14),v) ∉ C → color 11 ≠ color v
Source
Finite graph and certificates from experiments 20940 and 20968; see state/campaigns/triangle_reductions/outside_induced_kernel_in701.md.
Verified
10 Nov 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 1
Used by 1

The proof, explained

This theorem confirms that the coloring on the explicit 14-vertex graph $G$ is proper along every edge incident to vertex 11, except possibly for edges in the deficit set $C$. The proof introduces an arbitrary vertex $v$, enumerates all 14 possible values using `fin_cases`, and discharges every case through direct computation in the Lean kernel via `decide +kernel`.

  1. Let $v$ be an arbitrary vertex in $\mathrm{Fin}\ 14$.

    We introduce the vertex $v$ to prove the universal statement for all vertices of the graph.

    line 7

      intro v
  2. The condition holds for vertex 11 and each $v \in \{0, 1, \dots, 13\}$. automation

    The tactic `fin_cases` splits the goal into 14 subgoals, corresponding to each possible value of $v \in \mathrm{Fin}\ 14$. For each specific vertex, the statement is a decidable proposition involving only concrete finite data (the adjacency relation in $G$, membership in the finite set $C$, and the values of the function `color`), which `decide +kernel` settles by direct evaluation in the Lean kernel.

    line 8

      fin_cases v <;> decide +kernel

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 scoped Sym2set_option maxRecDepth 100000set_option maxHeartbeats 30000000open In701Deficit14theorem in715_deficit_proper_row_11 : ∀ v : Fin 14, G.Adj 11 v → s((11 : Fin 14),v) ∉ C → color 11 ≠ color v := by  intro v  fin_cases v <;> decide +kernel
See it in the graphDiscuss this resultChallenge it