in715_deficit_proper_row_2
Finite certificate for the explicit fourteen-vertex graph.
Statement
theorem in715_deficit_proper_row_2 : ∀ v : Fin 14, G.Adj 2 v → s((2 : Fin 14),v) ∉ C → color 2 ≠ 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 verifies that the 2-coloring on the explicit 14-vertex graph $G$ is proper along all edges incident to vertex 2 that do not belong to the deficit set $C$. The proof proceeds by finite exhaustive case analysis on the 14 possible vertices $v \in \mathrm{Fin}\; 14$. Each case is a decidable proposition on concrete finite sets and boolean functions, which is resolved by direct kernel computation.
Let $v$ be an arbitrary vertex of the 14-vertex graph.
We introduce the universally quantified vertex $v \in \mathrm{Fin}\; 14$ into the local context.
intro vFor every vertex $v$, if $v$ is adjacent to vertex 2 in $G$ and the undirected edge $\{2, v\}$ is not in the deficit set $C$, then vertex 2 and vertex $v$ receive different colors. automation
Because the graph has only 14 vertices, `fin_cases v` breaks the goal into 14 explicit cases ($v = 0, 1, \dots, 13$). In each case, the adjacency relation, set membership in $C$, and the coloring function are completely explicit finite objects, which Lean's kernel evaluates by direct computation (`decide +kernel`) to verify that the implication holds.
fin_cases v <;> decide +kernel
- The 14 cases are dispatched by kernel evaluation (`decide +kernel`), which directly computes the truth value of the finite boolean relations defining the graph adjacency, deficit edge set, and coloring without constructing intermediate human-readable deduction 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_2 : ∀ v : Fin 14, G.Adj 2 v → s((2 : Fin 14),v) ∉ C → color 2 ≠ color v := by intro v fin_cases v <;> decide +kernel