in715_deficit_proper_row_4
Finite certificate for the explicit fourteen-vertex graph.
Statement
theorem in715_deficit_proper_row_4 : ∀ v : Fin 14, G.Adj 4 v → s((4 : Fin 14),v) ∉ C → color 4 ≠ 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 establishes that vertex 4 satisfies the proper coloring condition (outside of the exceptional set of edges $C$) with respect to all of its neighbors in the 14-vertex graph $G$. The proof introduces an arbitrary vertex $v$ and performs an exhaustive case analysis over all 14 vertices in $\mathrm{Fin}\,14$. For each case, the statement reduces to a concrete decidable proposition that is discharged by kernel computation.
Fix an arbitrary vertex $v$ in the graph.
We introduce the universally quantified variable $v \in \mathrm{Fin}\,14$ into the local context.
intro vFor each possible vertex $v \in \{0, \dots, 13\}$, if vertex 4 is adjacent to $v$ and the edge $\{4, v\}$ is not in $C$, then vertex 4 and vertex $v$ have different colors. automation
The tactic `fin_cases` enumerates the 14 possible values of $v \in \mathrm{Fin}\,14$. Each of the resulting 14 subgoals is a closed, decidable proposition about explicitly defined finite objects (the graph $G$, the set $C$, and the coloring function). Lean's kernel evaluates each case directly by computation via `decide +kernel`.
fin_cases v <;> decide +kernel
- The proof relies entirely on Lean's kernel computation (`decide +kernel`) to evaluate the concrete finite graph adjacency, finset membership, and coloring for each vertex.
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_4 : ∀ v : Fin 14, G.Adj 4 v → s((4 : Fin 14),v) ∉ C → color 4 ≠ color v := by intro v fin_cases v <;> decide +kernel