AFTD Auto-Formalizing Theoretical Domains

wild_nine_example_b_third

theoremverified

For 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 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_third : wild_nine_third_sum wild_nine_example_b = 324
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

The proof, explained

The theorem evaluates the third-order sum invariant wild_nine_third_sum for the explicit 9×9 array wild_nine_example_b, showing that it equals 324. Because both the array and the summation over the 280 canonical partitions are finite and computable, the claim is a decidable proposition. The proof consists of direct evaluation performed by Lean's kernel via the decide tactic.

  1. wild_nine_third_sum wild_nine_example_b = 324 automation

    The equality is established by direct computation. The left-hand side is a finite sum over the 280 canonical triple partitions of the 9-element set, evaluating the polynomial D(D - 1)(D - 2) on the explicit 9×9 array wild_nine_example_b. Since all definitions are fully computable and the partition set is finite, equality of natural numbers is decidable, and the `decide +kernel` tactic directs Lean's kernel to normalize the computation directly to true.

    line 7

      decide +kernel

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

open Finsetopen scoped BigOperatorsset_option maxRecDepth 12000set_option maxHeartbeats 6000000theorem wild_nine_example_b_third : wild_nine_third_sum wild_nine_example_b = 324 := by  decide +kernel
See it in the graphDiscuss this resultChallenge it