AFTD Auto-Formalizing Theoretical Domains

in715_deficit_proper_row_9

theoremverified

Finite certificate for the explicit fourteen-vertex graph.

Statement

theorem in715_deficit_proper_row_9 : ∀ v : Fin 14, G.Adj 9 v → s((9 : Fin 14),v) ∉ C → color 9 ≠ 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

The theorem verifies row 9 of the proper coloring certificate for an explicit 14-vertex graph $G$: any neighbor $v$ of vertex 9 whose edge $\{9, v\}$ is not in the deficit set $C$ must have a color different from vertex 9. The proof exhaustively checks all 14 vertices $v \in \mathrm{Fin}\; 14$ by case analysis and closes each case via direct computational evaluation in Lean's kernel.

  1. Fix an arbitrary vertex $v$ of the 14-vertex graph.

    We introduce the vertex $v : \mathrm{Fin}\; 14$ to prove the universal statement for all vertices.

    line 7

      intro v
  2. For every vertex $v$, if $v$ is adjacent to 9 in $G$ and the edge $\{9, v\} \notin C$, then $\mathrm{color}(9) \neq \mathrm{color}(v)$. automation

    Since $\mathrm{Fin}\; 14$ contains only 14 elements, `fin_cases v` splits the goal into 14 explicit cases $v \in \{0, 1, \dots, 13\}$. For each case, graph adjacency, membership in the finite set $C$, and vertex color inequality are all concrete, decidable finite checks, which are verified by direct kernel computation (`decide +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_9 : ∀ v : Fin 14, G.Adj 9 v → s((9 : Fin 14),v) ∉ C → color 9 ≠ color v := by  intro v  fin_cases v <;> decide +kernel
See it in the graphDiscuss this resultChallenge it