wild_nine_example_a_third
For the explicit normalized nine-vertex array A, the sum over all 280 canonical triple partitions of D(D-1)(D-2) is 288. Here D counts colors closing at least one of the three triple blocks; the arrays and finite partition family are explicit computable definitions. This is a certificate for a method diagnostic, not a wild-number claim.
Statement
theorem wild_nine_example_a_third : wild_nine_third_sum wild_nine_example_a = 288- Source
- IN-364 / OP-306, continuation of the finite weighted-partition route for https://arxiv.org/html/2610.22142v1, Sections3.3 and6. Standard permutation-orbit background: Matchings and Representation Theory (2018), Section4.10, https://dspacemainprd01.lib.uwaterloo.ca/server/api/core/bitstreams/9d33772f-c7dc-409f-a4ed-521da8d87890/content. The witness triple system is standard incidence data; these are route helpers or finite method diagnostics. No wild-number bound, new exact sharpness case, general sign theorem, or research advance is claimed.
- Verified
- 30 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Used by 4
- wild_nine_example_b_thirdFor the explicit normalized nine-vertex array B, the sum over all 280 canonical triple partitions of D(D-1)(D-2) is 324. Here D counts…
- wild_nine_example_b_pair_profileFor the explicit normalized nine-vertex array B, the multiset of pairwise joint bad-color counts is 32 copies of4 and4 copies of13. Here D…
- wild_nine_example_a_pair_profileFor the explicit normalized nine-vertex array A, the multiset of pairwise joint bad-color counts is 32 copies of4 and4 copies of13. Here D…
- wild_pair_moment_data_not_determine_thirdThere is no function of the multiset of pairwise joint bad-color counts and the multiset of unordered triple-witness multiplicities that…
The proof, explained
The file verifies structural properties of two explicit 9 × 9 quasigroup arrays and computes a combinatorial invariant for the first array A. It first verifies that both arrays A and B are normalized, commutative Latin squares (idempotent symmetric quasigroups) and confirms that the family of canonical partitions into three 3-element blocks has size 280. Finally, it proves that for array A, the sum of the third factorial moments d(P)(d(P)-1)(d(P)-2) of the closed-block color counts d(P) across all 280 partitions equals 288. Every result is proved by computational reflection using Lean's kernel decision procedure (`decide +kernel`).
Array A satisfies the axioms of an idempotent, commutative, and cancellative quasigroup on nine vertices. automation
The predicate `wild_nine_first` checks that for all indices in `Fin 9`, the array satisfies A(a, a) = a, A(a, b) = A(b, a), and A(a, b) = A(a, c) implies b = c. The tactic `decide +kernel` proves this finite, bounded universal statement by exhaustive check in the Lean kernel.
decide +kernelArray B satisfies the axioms of an idempotent, commutative, and cancellative quasigroup on nine vertices. automation
Like array A, array B (`wild_nine_example_b`) is checked exhaustively by `decide +kernel` against the three quasigroup conditions of `wild_nine_first`.
decide +kernelThe family of canonical triple partitions of a nine-element set contains exactly 280 partitions. automation
The definition `wild_nine_parts` filters subsets of size 3 containing 0 and pairs them with canonically ordered second blocks of size 3, partitioning the 9 vertices into three 3-element blocks. The tactic `decide +kernel` enumerates this collection and computes that its cardinality is 280, matching (1/3!) * (9 choose 3,3,3) = 280.
decide +kernelThe third factorial moment sum ∑_{P} d_P(d_P - 1)(d_P - 2) over all 280 canonical partitions equals 288 for array A. automation
For each partition P, the quantity d_P counts the colors closing at least one block of P. Since the array, the 280 partitions, and the badness conditions are all finite and computable, the entire sum is evaluated directly by kernel reduction via `decide +kernel`, which verifies that the resulting integer is 288.
decide +kernel
- All four theorems in the file are verified purely by computational reflection (`decide +kernel`), executing finite combinatorial checks directly in Lean's trusted kernel without intermediate deductive 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 Finsetopen scoped BigOperatorsset_option maxHeartbeats 6000000set_option maxRecDepth 12000abbrev wild_nine_first (A : Fin 9 → Fin 9 → Fin 9) : Prop := (∀ a, A a a = a) ∧ (∀ a b, A a b = A b a) ∧ (∀ a b c, A a b = A a c → b = c)def wild_nine_parts : Finset (Finset (Fin 9) × Finset (Fin 9)) := ((univ : Finset (Fin 9)).powersetCard 3 |>.filter fun T => (0 : Fin 9) ∈ T).biUnion fun T => (((univ \ T).powersetCard 3).filter fun U => ∀ v ∈ univ \ (T ∪ U), ∃ u ∈ U, u < v).image fun U => (T,U)def wild_nine_blocks (P : Finset (Fin 9) × Finset (Fin 9)) : Finset (Finset (Fin 9)) := {P.1,P.2,univ \ (P.1 ∪ P.2)}abbrev wild_nine_bad (A : Fin 9 → Fin 9 → Fin 9) (P : Finset (Fin 9) × Finset (Fin 9)) (c : Fin 9) : Prop := ∃ B ∈ wild_nine_blocks P, ∀ u ∈ B, ∀ v ∉ B, A u v ≠ cdef wild_nine_bad_count (A : Fin 9 → Fin 9 → Fin 9) (P : Finset (Fin 9) × Finset (Fin 9)) : ℕ := (univ.filter fun c => wild_nine_bad A P c).carddef wild_nine_third_sum (A : Fin 9 → Fin 9 → Fin 9) : ℕ := ∑ P ∈ wild_nine_parts, let d := wild_nine_bad_count A P; d*(d-1)*(d-2)def wild_nine_pair_count (A : Fin 9 → Fin 9 → Fin 9) (i j : Fin 9) : ℕ := (wild_nine_parts.filter fun P => wild_nine_bad A P i ∧ wild_nine_bad A P j).carddef wild_nine_pair_profile (A : Fin 9 → Fin 9 → Fin 9) : Multiset ℕ := (((univ : Finset (Fin 9 × Fin 9)).filter fun z => z.1 < z.2).val.map fun z => wild_nine_pair_count A z.1 z.2)def wild_nine_example_a : Fin 9 → Fin 9 → Fin 9 := ![![0,2,8,7,5,6,3,4,1],![2,1,7,5,8,3,0,6,4],![8,7,2,6,3,4,1,0,5],![7,5,6,3,1,2,4,8,0],![5,8,3,1,4,0,7,2,6],![6,3,4,2,0,5,8,1,7],![3,0,1,4,7,8,6,5,2],![4,6,0,8,2,1,5,7,3],![1,4,5,0,6,7,2,3,8]]def wild_nine_example_b : Fin 9 → Fin 9 → Fin 9 := ![![0,4,7,8,5,6,3,2,1],![4,1,8,5,2,3,0,6,7],![7,8,2,6,3,0,4,1,5],![8,5,6,3,1,2,7,4,0],![5,2,3,1,4,7,8,0,6],![6,3,0,2,7,5,1,8,4],![3,0,4,7,8,1,6,5,2],![2,6,1,4,0,8,5,7,3],![1,7,5,0,6,4,2,3,8]]def wild_nine_witness_multiplicity (A : Fin 9 → Fin 9 → Fin 9) (T : Finset (Fin 9)) : ℕ := ((univ : Finset (Fin 9 × Fin 9)).filter fun z => z.1 < z.2 ∧ ({z.1,z.2,A z.1 z.2} : Finset (Fin 9)) = T).carddef wild_nine_witness_profile (A : Fin 9 → Fin 9 → Fin 9) : Multiset ℕ := (((univ : Finset (Fin 9)).powersetCard 3).val.map fun T => wild_nine_witness_multiplicity A T)theorem wild_nine_example_a_ok : wild_nine_first wild_nine_example_a := by decide +kerneltheorem wild_nine_example_b_ok : wild_nine_first wild_nine_example_b := by decide +kerneltheorem wild_nine_parts_card : wild_nine_parts.card = 280 := by decide +kerneltheorem wild_nine_example_a_third : wild_nine_third_sum wild_nine_example_a = 288 := by decide +kernel