AFTD Auto-Formalizing Theoretical Domains

in715_deficit_xlink

theoremverified

Finite certificate for the explicit fourteen-vertex graph.

Statement

theorem in715_deficit_xlink : ∀ v : Fin 14, G.Adj 10 v ↔ v ∈ ({0,1,2,3,4} : Finset (Fin 14))
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
Used by 1
  • 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…

The proof, explained

This theorem establishes that in the explicit 14-vertex graph $G$, the neighborhood of vertex $10$ is precisely $\{0, 1, 2, 3, 4\}$. Because the vertex set is finite and adjacency is decidable, the claim is a purely computational, finite check. It is proved by exhaustive evaluation directly within the Lean kernel.

  1. For every vertex $v \in \operatorname{Fin} 14$, vertex $10$ is adjacent to $v$ in $G$ if and only if $v \in \{0, 1, 2, 3, 4\}$. automation

    The graph $G$ is an explicit finite graph on 14 vertices. Both the adjacency relation $G.\mathrm{Adj}\; 10\; v$ and membership in the finite set $\{0, 1, 2, 3, 4\}$ are decidable predicates. As a result, the universally quantified equivalence over all 14 elements of $\operatorname{Fin} 14$ can be checked exhaustively by computation. The tactic `decide +kernel` instructs the Lean kernel to reduce this finite decision procedure to truth.

    line 6

    theorem in715_deficit_xlink : ∀ v : Fin 14, G.Adj 10 v ↔ v ∈ ({0,1,2,3,4} : Finset (Fin 14)) := by decide +kernel

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

open scoped Sym2set_option maxRecDepth 100000set_option maxHeartbeats 30000000open In701Deficit14theorem in715_deficit_xlink : ∀ v : Fin 14, G.Adj 10 v ↔ v ∈ ({0,1,2,3,4} : Finset (Fin 14)) := by decide +kernel
See it in the graphDiscuss this resultChallenge it