in715_Wok5
Finite verification of the explicit ten-vertex packing and edge-avoidance witnesses.
Statement
theorem in715_Wok5 : ∀ q ∈ in715_W5, 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 asserts that all witness pairs in the finite collection `in715_W5` satisfy four combinatorial conditions: the block system has size 8, its blocks belong to the precomputed family `sharp_T`, distinct blocks share at most one vertex, and no block contains any of the specified avoided edges. Because all the objects are concrete finite data structures over the 10-element set `Fin 10`, the goal is a decidable proposition. The proof finishes by direct computational reflection, evaluating the decision procedure in Lean's kernel.
Every witness configuration in `in715_W5` satisfies the four packing, cardinality, and edge-avoidance conditions. automation
The statement asserts four properties for each element `q = (q₁, q₂)` of the finite list `in715_W5`: the list `q₂` contains exactly 8 distinct blocks; each block belongs to `sharp_T`; any two distinct blocks in `q₂` intersect in at most one vertex (a packing condition); and no edge in `q₁` is contained in any block of `q₂`. Because the list `in715_W5`, the vertices in `Fin 10`, and all subsets and relations are finite, this entire universally quantified property is decidable. The `decide +kernel` tactic verifies the claim by executing the decision procedure directly inside Lean's trusted kernel.
theorem in715_Wok5 : ∀ q ∈ in715_W5, 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`), where Lean's kernel directly computes the truth value of the finite decidable statement by exhaustive evaluation, with no intermediate manual deduction steps.
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_Wok5 : ∀ q ∈ in715_W5, 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