wild_nine_example_b_pair_profile
For the explicit normalized nine-vertex array B, 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_b_pair_profile : wild_nine_pair_profile wild_nine_example_b =
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 asserts that the pairwise joint bad-color profile of the explicit normalized nine-vertex array `wild_nine_example_b` consists of 32 pairs with count 4 and 4 pairs with count 13. Because the array, the finite index set $\mathrm{Fin}\;9$, and the counting function are fully explicit and computable, this equality is decidable. The proof evaluates the statement by delegating the exhaustive verification over all $\binom{9}{2} = 36$ pairs directly to Lean's kernel via `decide +kernel`.
The pairwise bad-color profile of `wild_nine_example_b` equals the multiset containing 32 copies of 4 and 4 copies of 13. automation
The equality is established by finite computational reflection in the Lean kernel (`decide +kernel`). The kernel evaluates the definition of `wild_nine_pair_profile` on the explicit array `wild_nine_example_b`, computing the bad-color count for each of the $\binom{9}{2} = 36$ pairs of distinct indices in $\mathrm{Fin}\;9$, and verifies that the resulting multiset matches `Multiset.replicate 32 4 + Multiset.replicate 4 13`.
decide +kernel
- The entire proof is executed by computational reduction in the Lean kernel (`decide +kernel`); no intermediate deduction steps appear in the proof text.
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_b_pair_profile : wild_nine_pair_profile wild_nine_example_b = Multiset.replicate 32 4 + Multiset.replicate 4 13 := by decide +kernel