in715_deficit_proper_row_5
Finite certificate for the explicit fourteen-vertex graph.
Statement
theorem in715_deficit_proper_row_5 : ∀ v : Fin 14, G.Adj 5 v → s((5 : Fin 14),v) ∉ C → color 5 ≠ 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
The theorem states that in the specified 14-vertex graph $G$, any edge incident to vertex 5 that does not belong to the deficit set $C$ is properly colored. The proof introduces an arbitrary vertex $v$ and performs an exhaustive case analysis over all 14 elements of $\mathrm{Fin}\,14$. Each of the 14 resulting cases is a decidable Boolean statement about concrete finite structures, verified directly by Lean's kernel via computation.
Let $v$ be an arbitrary vertex of the graph.
We introduce the universally quantified variable $v \in \mathrm{Fin}\,14$, reducing the theorem to showing that if vertex 5 is adjacent to $v$ and the undirected edge $\{5, v\}$ is not in $C$, then vertex 5 and vertex $v$ receive distinct colors.
intro vFor each of the 14 possible vertices $v \in \{0, \dots, 13\}$, the coloring condition holds. automation
Because the vertex type $\mathrm{Fin}\,14$ is finite, `fin_cases` splits the goal into 14 concrete cases ($v = 0, 1, \dots, 13$). In each case, graph adjacency in $G$, membership in the edge set $C$, and the vertex coloring function are computable on explicit finite data, so `decide +kernel` evaluates each case directly in Lean's kernel.
fin_cases v <;> decide +kernel
- All 14 cases are closed by Lean's kernel computation (`decide +kernel`), which evaluates the Boolean predicates for graph adjacency, edge-set non-membership, and vertex coloring directly from their definitions without generating intermediate proof steps.
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_5 : ∀ v : Fin 14, G.Adj 5 v → s((5 : Fin 14),v) ∉ C → color 5 ≠ color v := by intro v fin_cases v <;> decide +kernel