in715_deficit_proper_row_13
Finite certificate for the explicit fourteen-vertex graph.
Statement
theorem in715_deficit_proper_row_13 : ∀ v : Fin 14, G.Adj 13 v → s((13 : Fin 14),v) ∉ C → color 13 ≠ 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
- in715_deficit_p_sizeFinite certificate for the explicit fourteen-vertex graph.
- Used by 1
- in715_deficit_properFinite certificate for the explicit fourteen-vertex graph.
The proof, explained
To verify that the coloring is proper on every edge incident to vertex 13 that does not belong to the defect set $C$, the proof considers an arbitrary vertex $v$. Because the vertex set $\mathrm{Fin}\; 14$ is finite, the goal is split into 14 explicit cases $v = 0, \dots, 13$. In each case, whether 13 is adjacent to $v$, whether the edge $\{13, v\}$ is outside $C$, and whether their colors differ are completely concrete finite checks, all verified by direct computational evaluation in Lean's kernel.
Let $v$ be an arbitrary vertex of the graph.
We introduce an arbitrary vertex $v \in \mathrm{Fin}\; 14$ into the local context to establish the universal quantification over all vertices.
intro vIf vertex 13 is adjacent to $v$ and the undirected edge $\{13, v\}$ does not belong to $C$, then vertex 13 and vertex $v$ have distinct colors. automation
Exhaustive case analysis is performed over all 14 possible values of $v \in \{0, \dots, 13\}$ using `fin_cases`. For each case, the hypotheses and conclusion involve only concrete, computable definitions (the graph adjacency, membership in the finite set $C$, and the coloring assignment), so Lean's kernel evaluator (`decide +kernel`) verifies the implication by direct finite computation.
fin_cases v <;> decide +kernel
- The verification relies on computational reflection (`decide +kernel`), which evaluates the truth value of each finite proposition directly inside the Lean kernel rather than constructing an explicit deductive proof tree.
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 scoped Sym2set_option maxRecDepth 100000set_option maxHeartbeats 30000000open In701Deficit14theorem in715_deficit_proper_row_13 : ∀ v : Fin 14, G.Adj 13 v → s((13 : Fin 14),v) ∉ C → color 13 ≠ color v := by intro v fin_cases v <;> decide +kernel