in715_deficit_c_edges
Finite certificate for the explicit fourteen-vertex graph.
Statement
theorem in715_deficit_c_edges : ∀ e ∈ C, e ∈ G.edgeSet- 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 3
- in715_deficit_preciseAn explicit fourteen-vertex graph has a maximum seven-triangle packing, a seven-edge triangle cover, an outside five-cycle link and a…
- in715_deficit_pack_eqFinite certificate for the explicit fourteen-vertex graph.
- simple_graph_deficit_two_example_two_edge_dropDeleting two specified base edges from the explicit 14-vertex local-count counterexample decreases its triangle-packing number from seven…
The proof, explained
The theorem asserts that every edge in a distinguished set of pairs $C$ belongs to the edge set of the explicit fourteen-vertex graph $G$. Because both $C$ and $G$ are finite objects on $\mathrm{Fin}(14)$, this universal quantification over a finite set is a decidable proposition. The entire proof is carried out by direct computational evaluation in the Lean kernel via `decide +kernel`.
Every edge in the finite set $C$ is an edge of the graph $G$. automation
The edge set of $G$ and the collection $C$ are both explicitly given finite combinatorial objects on the vertex set $\mathrm{Fin}(14)$. Checking whether every element $e \in C$ satisfies $e \in G.\mathrm{edgeSet}$ reduces to a finite number of decidable boolean checks, which Lean verifies by exhaustive computation in the kernel.
theorem in715_deficit_c_edges : ∀ e ∈ C, e ∈ G.edgeSet := by decide +kernel
- The proof relies entirely on Lean's kernel computation (`decide +kernel`) to verify the finite combinatorial condition by direct evaluation.
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_c_edges : ∀ e ∈ C, e ∈ G.edgeSet := by decide +kernel