in715_Wok0
Finite verification of the explicit ten-vertex packing and edge-avoidance witnesses.
Statement
theorem in715_Wok0 : ∀ q ∈ in715_W0, 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 that each configuration in the finite list in715_W0 is a valid witness: its second component contains 8 distinct subsets from sharp_T that pairwise share at most one vertex (forming a packing) and avoid every edge listed in its first component. Because the domain is finite and all four properties are decidable over finite sets of vertices in Fin 10, the proof proceeds by exhaustive computational verification using Lean's kernel.
Every configuration q in in715_W0 satisfies the four packing and edge-avoidance properties. automation
The candidate list in715_W0 is an explicit finite list of pairs of edge sets and triangle lists over Fin 10. All four conditions—having size 8, drawing elements from sharp_T, pairwise intersecting in at most one vertex, and avoiding all edges in q.1—are decidable properties on finite sets. The tactic `decide +kernel` instructs the Lean kernel to evaluate the corresponding boolean decision procedure to `true`, establishing the universal statement by exhaustive finite computation.
theorem in715_Wok0 : ∀ q ∈ in715_W0, 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 proof relies entirely on computational reflection (`decide +kernel`), which evaluates the decidable proposition by direct computation in Lean's kernel. The compiler options `maxRecDepth` and `maxHeartbeats` on lines 2 and 3 are set high to accommodate the volume of finite set operations performed during evaluation.
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_Wok0 : ∀ q ∈ in715_W0, 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