in715_Wok4
Finite verification of the explicit ten-vertex packing and edge-avoidance witnesses.
Statement
theorem in715_Wok4 : ∀ q ∈ in715_W4, 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_W4 satisfies four structural conditions: its collection of sets has size 8, every set belongs to sharp_T, distinct sets share at most one vertex, and no specified edge occurs in any set. Because all data structures and predicates are explicit and finite, the claim is decidable. The proof succeeds by direct kernel computation using decide +kernel.
For every entry q in in715_W4, q.2 has cardinality 8, all its elements belong to sharp_T, any two distinct elements intersect in at most one vertex, and no edge in q.1 belongs to any element of q.2. automation
The statement is a bounded universal quantification over finite lists of finite sets and edges over Fin 10, making the entire proposition decidable. The tactic decide +kernel instructs Lean's kernel to reduce the decision procedure by direct computation, verifying all four conditions for each witness in in715_W4.
theorem in715_Wok4 : ∀ q ∈ in715_W4, 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 is carried out purely by computation in the kernel; all verifications (cardinalities, list memberships, intersections, and edge avoidance) are evaluated algorithmically rather than through deductive lemmas.
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_Wok4 : ∀ q ∈ in715_W4, 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