wild_bundled_leaf_packing_small_obstruction
There is a normalized symmetric Latin array of order nine with the four specified color-zero pairs, such that every two disjoint pair-role leaves either have an invalid triple or share an internal nonzero color. Yet the same array has an explicit rooted partition into three triples whose quotient is connected in every color. Thus the blanket two-leaf bundled-rainbow restriction is unnecessary in this known base case. This does not refute its n>=13 variant or the wild-number conjecture.
Statement
theorem wild_bundled_leaf_packing_small_obstruction : ∃ A : Fin 9 → Fin 9 → Fin 9, (∀ u, A u u=u) ∧ (∀ u v,A u v=A v u) ∧ (∀ u,Function.Injective (A u)) ∧ (let a : Fin 4 → Fin 9 := fun i => ⟨2*i.val+1,by omega⟩ let b : Fin 4 → Fin 9 := fun i => ⟨2*i.val+2,by omega⟩ (∀ i,A (a i) (b i)=0) ∧ (∀ i j u v : Fin 4, i≠j → u≠v → Disjoint ({i,j} : Finset (Fin 4)) {u,v} → ∀ s t : Bool, let z := if s then b j else a j let z' := if t then b v else a v A (a i) z=b i ∨ A (b i) z=a i ∨ A (a u) z'=b u ∨ A (b u) z'=a u ∨ ¬ Disjoint ({A (a i) z,A (b i) z} : Finset (Fin 9)) {A (a u) z',A (b u) z'})) ∧ (∃ (p : Fin 9 → Fin 3) (r : Fin 3 → Fin 9), (∀ t,p (r t)=t) ∧ (∀ t,(univ.filter fun v => p v=t).card=3) ∧ ∀ (i : Fin 9) (S : Finset (Fin 3)), S.Nonempty → S≠univ → ∃ u v : Fin 9,u≠v ∧ p u∈S ∧ p v∉S ∧ A u v=i)
- Source
- IN-342 supporting steps for OP-306, arXiv:2610.22142 Sections3.3.2/6. The target remains prescribed-coloring sharpness; these are local validity and conditioning-family helpers, not a seal-free partition theorem or new wild-number bound. No research advance is claimed.
- Verified
- 29 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext
The proof, explained
The proof is an explicit counterexample established entirely by computational verification. An explicit 9x9 Latin array is exhibited, and its normalization, symmetry, row injectivity, and color-zero pairs are verified by exhaustive kernel evaluation. Lean then checks by finite case analysis that every pair of disjoint leaves is obstructed, either by a degenerate triple or by sharing an internal nonzero color. Finally, an explicit rooted partition into three triples is supplied, and finite evaluation confirms that its quotient multigraph is connected in every color.
The index expressions $2i+1$ and $2i+2$ define valid elements of $\mathrm{Fin}\,9$ for every $i \in \mathrm{Fin}\,4$. automation
In the definition of the pair-endpoint maps $a, b : \mathrm{Fin}\,4 \to \mathrm{Fin}\,9$ in the theorem statement, Lean requires proofs of the bounds $2i+1 < 9$ and $2i+2 < 9$. Since $i < 4$, the maximum values are $2(3)+1 = 7 < 9$ and $2(3)+2 = 8 < 9$, both settled automatically by linear integer arithmetic (`omega`).
(let a : Fin 4 → Fin 9 := fun i => ⟨2*i.val+1,by omega⟩ let b : Fin 4 → Fin 9 := fun i => ⟨2*i.val+2,by omega⟩
The explicit array `in342_bundled_nine_matrix` is a normalized, symmetric Latin array of order 9. automation
The existential quantifier is instantiated with the candidate matrix `in342_bundled_nine_matrix`. Its normalization ($A(u, u) = u$), symmetry ($A(u, v) = A(v, u)$), and row injectivity are each verified by exhaustive evaluation over $\mathrm{Fin}\,9$ using kernel computation (`decide +kernel`).
refine ⟨in342_bundled_nine_matrix,?_,?_,?_,?_,?_⟩ · decide +kernel · decide +kernel · decide +kernel
The four specified pairs have color 0, and every pair of disjoint leaves is obstructed. automation
After simplifying the definitions of the pair endpoints, the goal splits into two conjuncts. Exhaustive computation (`decide +kernel`) checks that $A(2i+1, 2i+2) = 0$ for all $i \in \mathrm{Fin}\,4$, and verifies that for all disjoint pairs of pair-roles and all boolean choices of endpoints, the two leaves either contain an invalid triple or share a nonzero internal color.
· dsimp only constructor <;> decide +kernel
There exists a rooted partition of the nine vertices into three triples whose quotient is connected in every color. automation
The proof witnesses the partition with the explicit map $p = [0, 0, 1, 0, 1, 2, 1, 2, 2]$ and root selection $r = [0, 2, 5]$. By exhaustive kernel evaluation (`decide +kernel`), Lean verifies that each root is in its part ($p(r(t)) = t$), that each part contains exactly 3 vertices, and that for every color $i \in \mathrm{Fin}\,9$ and every proper nonempty subset $S \subset \mathrm{Fin}\,3$, there is an edge of color $i$ crossing the cut $(S, S^c)$.
· refine ⟨![0,0,1,0,1,2,1,2,2],![0,2,5],?_,?_,?_⟩ · decide +kernel · decide +kernel · decide +kernel
- The entire proof proceeds by computational verification using `decide +kernel`: both the Latin array of order 9 and the quotient partition into three triples are explicitly defined, and all required algebraic, combinatorial, and connectivity properties are checked by exhaustive kernel evaluation over finite types.
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 Finsetset_option maxHeartbeats 4000000set_option maxRecDepth 20000private def in342_bundled_nine_data : Array (Array (Fin 9)) := #[#[0,8,4,6,7,3,1,2,5],#[8,1,0,4,5,7,3,6,2],#[4,0,2,5,1,6,7,8,3],#[6,4,5,3,0,8,2,1,7],#[7,5,1,0,4,2,8,3,6],#[3,7,6,8,2,5,0,4,1],#[1,3,7,2,8,0,6,5,4],#[2,6,8,1,3,4,5,7,0],#[5,2,3,7,6,1,4,0,8]]private def in342_bundled_nine_matrix : Fin 9 → Fin 9 → Fin 9 := fun u v => (in342_bundled_nine_data[u.val]!)[v.val]!theorem wild_bundled_leaf_packing_small_obstruction : ∃ A : Fin 9 → Fin 9 → Fin 9, (∀ u, A u u=u) ∧ (∀ u v,A u v=A v u) ∧ (∀ u,Function.Injective (A u)) ∧ (let a : Fin 4 → Fin 9 := fun i => ⟨2*i.val+1,by omega⟩ let b : Fin 4 → Fin 9 := fun i => ⟨2*i.val+2,by omega⟩ (∀ i,A (a i) (b i)=0) ∧ (∀ i j u v : Fin 4, i≠j → u≠v → Disjoint ({i,j} : Finset (Fin 4)) {u,v} → ∀ s t : Bool, let z := if s then b j else a j let z' := if t then b v else a v A (a i) z=b i ∨ A (b i) z=a i ∨ A (a u) z'=b u ∨ A (b u) z'=a u ∨ ¬ Disjoint ({A (a i) z,A (b i) z} : Finset (Fin 9)) {A (a u) z',A (b u) z'})) ∧ (∃ (p : Fin 9 → Fin 3) (r : Fin 3 → Fin 9), (∀ t,p (r t)=t) ∧ (∀ t,(univ.filter fun v => p v=t).card=3) ∧ ∀ (i : Fin 9) (S : Finset (Fin 3)), S.Nonempty → S≠univ → ∃ u v : Fin 9,u≠v ∧ p u∈S ∧ p v∉S ∧ A u v=i) := by refine ⟨in342_bundled_nine_matrix,?_,?_,?_,?_,?_⟩ · decide +kernel · decide +kernel · decide +kernel · dsimp only constructor <;> decide +kernel · refine ⟨![0,0,1,0,1,2,1,2,2],![0,2,5],?_,?_,?_⟩ · decide +kernel · decide +kernel · decide +kernel