in715_Wok1
Finite verification of the explicit ten-vertex packing and edge-avoidance witnesses.
Statement
theorem in715_Wok1 : ∀ q ∈ in715_W1, q.2.toFinset.card = 8 ∧ (∀ t ∈ q.2, t ∈ sharp_T) ∧ (∀ a ∈ q.2, ∀ b ∈ q.2, a ≠ b → (a ∩ b).card ≤ 1) ∧ (∀ e ∈ q.1, ∀ t ∈ q.2, e ∉ t.sym2)- 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 verifies finite packing and edge-avoidance witnesses on a 10-vertex set: every candidate pair in `in715_W1` consists of 8 distinct triangles from `sharp_T` that are pairwise edge-disjoint and avoid a prescribed set of edges. Because the domain and all lists are finite, the statement is a decidable boolean proposition. The proof completes the verification entirely by computational reduction in the Lean kernel using `decide +kernel`.
For every candidate pair q in in715_W1, the collection of triangles q.2 has size 8, is drawn from sharp_T, is pairwise edge-disjoint, and avoids all edges specified in q.1. automation
The theorem asserts four properties for every pair q = (E, T) in the finite list in715_W1 on the ten-element vertex set Fin 10: T contains 8 distinct sets, each t ∈ T belongs to sharp_T, any two distinct sets in T intersect in at most one vertex, and no edge in E is an edge of any triangle in T. Because all types and lists are finite, this is a decidable proposition. The `decide +kernel` tactic discharges the goal by direct evaluation in Lean's kernel.
theorem in715_Wok1 : ∀ q ∈ in715_W1, q.2.toFinset.card = 8 ∧ (∀ t ∈ q.2, t ∈ sharp_T) ∧ (∀ a ∈ q.2, ∀ b ∈ q.2, a ≠ b → (a ∩ b).card ≤ 1) ∧ (∀ e ∈ q.1, ∀ t ∈ q.2, e ∉ t.sym2) := by decide +kernel
- The entire proof is executed by computational reduction inside Lean's kernel via `decide +kernel` without producing intermediate lemma applications.
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_Wok1 : ∀ q ∈ in715_W1, q.2.toFinset.card = 8 ∧ (∀ t ∈ q.2, t ∈ sharp_T) ∧ (∀ a ∈ q.2, ∀ b ∈ q.2, a ≠ b → (a ∩ b).card ≤ 1) ∧ (∀ e ∈ q.1, ∀ t ∈ q.2, e ∉ t.sym2) := by decide +kernel