in715_Wcover5
Finite verification of the explicit ten-vertex packing and edge-avoidance witnesses.
Statement
theorem in715_Wcover5 : ∀ e ∈ (sharp_EL.drop 25).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 $e$ in a five-element slice of `sharp_EL` (from index 25 to 29) pairs with any edge $f \\in \\text{sharp\\_EL}$ inside the edge set $q.1$ of some configuration $q \\in \\text{sharp\\_W}$. Because all underlying structures are explicit and finite, the statement is a decidable proposition. The proof delegates the complete search to Lean's kernel, which verifies the property by exhaustive computation.
For every edge $e$ in the five-element sublist of `sharp_EL` starting at index 25 and every edge $f \\in \\text{sharp\\_EL}$, there exists an element $q \\in \\text{sharp\\_W}$ whose edge set $q.1$ contains both $e$ and $f$. automation
Because `sharp_EL` and `sharp_W` are explicit, finite lists of edges and configurations on the finite vertex type `Fin 10`, all quantifiers range over finite domains with decidable equality. The `decide +kernel` tactic evaluates the decidable proposition directly to `true` by kernel reduction.
theorem in715_Wcover5 : ∀ e ∈ (sharp_EL.drop 25).take 5, ∀ f ∈ sharp_EL, ∃ q ∈ sharp_W, e ∈ q.1 ∧ f ∈ q.1 := by decide +kernel
- The proof relies entirely on exhaustive computational evaluation in the Lean kernel (`decide +kernel`); the search over finite pairs is verified by computation rather than symbolic mathematical deduction.
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_Wcover5 : ∀ e ∈ (sharp_EL.drop 25).take 5, ∀ f ∈ sharp_EL, ∃ q ∈ sharp_W, e ∈ q.1 ∧ f ∈ q.1 := by decide +kernel