in715_Wok2
Finite verification of the explicit ten-vertex packing and edge-avoidance witnesses.
Statement
theorem in715_Wok2 : ∀ q ∈ in715_W2, 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 witness pair in the explicit list `in715_W2` consists of an edge set and an 8-block packing of 10-vertex subsets from `sharp_T` intersecting pairwise in at most one vertex, with none of the specified edges appearing in any block. Because all objects are defined over the finite domain $\text{Fin } 10$ and given explicitly, the statement is decidable. The proof is completed in one step by evaluating the finite verification directly in Lean's kernel.
Every witness pair $q = (E, \mathcal{T}) \in \text{in715\_W2}$ satisfies the four conditions: $\mathcal{T}$ has cardinality 8, all blocks in $\mathcal{T}$ belong to `sharp_T`, distinct blocks in $\mathcal{T}$ share at most one vertex, and no edge in $E$ belongs to any block in $\mathcal{T}$. automation
The proposition is a bounded universal quantification over an explicit, finite list of witness pairs on the 10-element domain $\text{Fin } 10$. Each condition—set cardinality, list membership, pairwise intersection bounds, and edge disjointness—is decidable by finite computation. The `decide +kernel` tactic evaluates the boolean decision procedure directly inside the Lean kernel to reduce the goal to true.
theorem in715_Wok2 : ∀ q ∈ in715_W2, 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 exhaustive computational reduction within Lean's kernel rather than symbolic deductive steps. The compiler options on lines 2 and 3 set high limits on recursion depth (`maxRecDepth 100000`) and evaluation heartbeats (`maxHeartbeats 30000000`) to permit this large kernel computation.
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_Wok2 : ∀ q ∈ in715_W2, 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