wild_nine_example_a_pair_profile
For the explicit normalized nine-vertex array A, the multiset of pairwise joint bad-color counts is 32 copies of4 and4 copies of13. 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_pair_profile : wild_nine_pair_profile wild_nine_example_a =
Multiset.replicate 32 4 + Multiset.replicate 4 13- 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- Built on 1
- wild_nine_example_a_thirdFor 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…
- Used by 1
- 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 theorem states that for an explicit 9-vertex array, the multiset of pairwise joint bad-color counts consists of 32 occurrences of 4 and 4 occurrences of 13 across all 36 unordered index pairs. Because every component of the definition is finite and computable, the goal is established entirely by direct kernel computation (`decide +kernel`).
The pair profile of `wild_nine_example_a` equals the multiset with 32 copies of 4 and 4 copies of 13. automation
Because the array is an explicit 9×9 matrix over `Fin 9` and the pair profile function computes a deterministic statistic across all $\binom{9}{2} = 36$ index pairs, both sides evaluate to concrete finite multisets. Lean's kernel computes both sides directly to verify that they are identical.
decide +kernel
- The proof relies entirely on computational reflection and reduction in Lean's kernel (`decide +kernel`), evaluating all 36 pair counts directly without generating step-by-step mathematical deductions.
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 maxRecDepth 12000set_option maxHeartbeats 6000000theorem wild_nine_example_a_pair_profile : wild_nine_pair_profile wild_nine_example_a = Multiset.replicate 32 4 + Multiset.replicate 4 13 := by decide +kernel