in715_Wcover2
Finite verification of the explicit ten-vertex packing and edge-avoidance witnesses.
Statement
theorem in715_Wcover2 : ∀ e ∈ (sharp_EL.drop 10).take 5, ∀ f ∈ sharp_EL, ∃ q ∈ sharp_W, e ∈ q.1 ∧ f ∈ q.1- Source
- Ten-vertex graph and pair-avoidance witnesses from experiments 20301–20303 and 20312; see state/campaigns/triangle_reductions/private_k4_in694.md.
- Verified
- 10 Nov 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 2
- in715_sharp_witness_countFinite verification of the explicit ten-vertex packing and edge-avoidance witnesses.
- simple_graph_in693_ten_seed_packing_numberThe concrete ten-vertex five-link seed has triangle packing number eight.
- Used by 1
- simple_graph_in693_ten_seed_pair_stableDeleting any two distinct edges of the ten-vertex seed leaves its triangle packing number equal to eight.
The proof, explained
The theorem asserts that every edge in a 5-edge slice of `sharp_EL` (from index 10 to 14) and every edge in `sharp_EL` are simultaneously covered by the edge set of at least one witness in `sharp_W`. Because the edge lists and candidate subgraphs on 10 vertices are explicit finite data structures, the statement is decidable. The proof proceeds entirely by kernel reduction, evaluating the finite search via `decide +kernel`.
For every edge $e$ among the five edges in `sharp_EL` starting at index 10 and every edge $f \in \text{sharp\_EL}$, there exists a witness $q \in \text{sharp\_W}$ such that both $e$ and $f$ belong to $q.1$. automation
All quantifiers range over concrete finite lists of edges on 10 vertices (`Fin 10`) and finite lists of candidate witnesses. The proposition is therefore decidable by finite exhaustive search. The tactic `decide +kernel` triggers kernel reduction to evaluate the decision procedure directly to `True` across all 155 pairs of edges.
theorem in715_Wcover2 : ∀ e ∈ (sharp_EL.drop 10).take 5, ∀ f ∈ sharp_EL, ∃ q ∈ sharp_W, e ∈ q.1 ∧ f ∈ q.1 := by decide +kernel
- The entire proof is executed by kernel evaluation (`decide +kernel`). The elevated limits for `maxRecDepth` and `maxHeartbeats` reflect the substantial computational budget required by the kernel to exhaustively verify all search instances.
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 30000000theorem in715_Wcover2 : ∀ e ∈ (sharp_EL.drop 10).take 5, ∀ f ∈ sharp_EL, ∃ q ∈ sharp_W, e ∈ q.1 ∧ f ∈ q.1 := by decide +kernel