This is a Lean formalization of the Huang–Jiang–Oblomkov conjecture on the point counts of pairs of commuting nilpotent matrices satisfying A^a = B^b.
- The finite identity: for coprime
1 < a < band everyN, the HJO polynomial is(q)_Ntimes the generating function of the balanced cylindric partitions with largest entry at mostN. - The Huang–Jiang–Oblomkov conjecture for every coprime
1 < a < b.
Both assume two results quoted from the literature: the collinear commutation of the slope operators, and the compositional rational shuffle identity.
See §Formal Challenge for a formal certificate.
This depends on Mathlib and Axiom Math's repository QSeriesLib.
A formal challenge file certifying that this repository does formalize the results
claimed above is located at Challenge/Basic.lean. This file only
depends on the dependencies above. It contains formal statements of
§Main Results with sorry as proof.
This repository can be verified against the formal challenge with the Lean
comparator on a Linux machine. First, follow the instructions in
https://github.com/leanprover/comparator to install comparator. Then, run the following command:
lake env comparator Comparator/comparator.json
This repository has been locally verified with the comparator.