in715_deficit_proper_row_7
Finite certificate for the explicit fourteen-vertex graph.
Statement
theorem in715_deficit_proper_row_7 : ∀ v : Fin 14, G.Adj 7 v → s((7 : Fin 14),v) ∉ C → color 7 ≠ 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 any edge incident to vertex 7 in the explicit 14-vertex graph $G$ has differently colored endpoints, unless that edge belongs to the defect set $C$. The proof introduces an arbitrary vertex $v$ and exhausts all 14 possible vertices in $\mathrm{Fin}\; 14$. Each of the 14 resulting subgoals is a closed, decidable proposition about explicit graph and set data, verified directly by computational reflection in the Lean kernel.
It suffices to verify the condition for an arbitrary vertex $v$.
We introduce the universally quantified vertex $v \in \mathrm{Fin}\; 14$ into the local context.
intro vThe coloring condition holds for all 14 candidate vertices $v$. automation
Because $v$ belongs to the finite type $\mathrm{Fin}\; 14$, `fin_cases` exhaustively splits the goal into 14 cases ($v = 0, 1, \dots, 13$). In each case, graph adjacency in $G$, membership in the edge set $C$, and vertex colors are fully concrete and computable, so `decide +kernel` verifies the implication by direct kernel evaluation.
fin_cases v <;> decide +kernel
- The case-by-case verification relies entirely on kernel computation (`decide +kernel`), which evaluates the explicit definitions of the graph adjacency, the set $C$, and the coloring function without generating human-readable intermediate 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_7 : ∀ v : Fin 14, G.Adj 7 v → s((7 : Fin 14),v) ∉ C → color 7 ≠ color v := by intro v fin_cases v <;> decide +kernel