in715_Wcover3
Finite verification of the explicit ten-vertex packing and edge-avoidance witnesses.
Statement
theorem in715_Wcover3 : ∀ e ∈ (sharp_EL.drop 15).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 pair of edges $(e, f)$, where $e$ is drawn from a specific five-edge slice of `sharp_EL` (indices 15 through 19) and $f$ is any edge in `sharp_EL`, is jointly covered by the edge set of at least one witness in `sharp_W`. Because `sharp_EL`, `sharp_W`, and the vertex set `Fin 10` are finite and explicitly defined, the property is decidable. The proof delegates the entire exhaustive verification to Lean's kernel reduction via `decide +kernel`.
For every edge $e$ in the five-element sublist of `sharp_EL` from index 15 to 19 and every edge $f \\in \\text{sharp\\_EL}$, there exists a witness $q \\in \\text{sharp\\_W}$ whose edge set $q.1$ contains both $e$ and $f$. automation
The statement consists of bounded quantifiers over explicit, finite lists of edges and witness configurations on the 10-element vertex set $\\text{Fin } 10$. As a result, the statement is decidable by exhaustive search. The tactic `decide +kernel` instructs the Lean kernel to reduce the decidability decision procedure to `True` by direct computation.
theorem in715_Wcover3 : ∀ e ∈ (sharp_EL.drop 15).take 5, ∀ f ∈ sharp_EL, ∃ q ∈ sharp_W, e ∈ q.1 ∧ f ∈ q.1 := by decide +kernel
- The proof is executed entirely by computational reflection (`decide +kernel`), which evaluates the finite combinatorial search directly inside the Lean kernel without producing intermediate deductive proof steps. The options `maxRecDepth` and `maxHeartbeats` are raised in lines 2–3 to accommodate the large number of reduction 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 30000000theorem in715_Wcover3 : ∀ e ∈ (sharp_EL.drop 15).take 5, ∀ f ∈ sharp_EL, ∃ q ∈ sharp_W, e ∈ q.1 ∧ f ∈ q.1 := by decide +kernel