Beyond Mock Modularity: Elliptic Corrections for Higher Dyson Ranks

Claudia Alfes, Ken Ono, Ashvin Swaminathan

Abstract

When $m = 1$, the Dyson rank generating function is a classical bridge between partition theory, Ramanujan's mock theta functions, and the theory of harmonic Maass forms and nonholomorphic Jacobi forms. The rank is a statistic on partitions, and the higher Dyson systems, for $m \geq 2$, are a natural multivariable refinement of it, combining $m$ graded rank contributions. Unlike the classical case, these higher systems are not expected to fit the mock-modular framework, which raises the question of what analytic structure governs them. We show that their root-of-unity specializations carry a hidden elliptic structure. A finite $q$-difference recurrence produces an explicit polynomial obstruction to the expected index $m$ elliptic transformation law, and because the obstruction is finite, its partial fractions canonically determine finitely many Appell--Lerch correction terms that remove it. The corrected functions satisfy a twisted index $m$ elliptic law; a natural translation removes the twist, and their holomorphic finite parts admit finite theta decompositions. Thus, the natural analogue of Dyson's mock-modular phenomenon at higher $m$ is not mock modularity but a finite theta decomposition governed by an index $m$ elliptic transformation law. These results grew out of a human--AI collaboration, and the key new formulas were formalized and machine-verified in Lean/Mathlib by AxiomProver.

Disclosure

“roduced, for each batch, a problem.lean for- malizing the statements and a solution.lean containing the complete Lean proofs. These files are located at Batch1/Output/, Batch2/Output/, Batch3/Output/, and Batch4/Output/. Declaration of generative AI and AI-assisted technologies in the manuscript preparation process As described in Appendix B, AxiomProver (an AI tool under development) was used to formalize and formally verify, in Lean, the key new formu”

PDF page 33
Classification
Drafting limited passages
Multiplier
5
Verified

Structural counts

Pages 33 pdf
Theorems 10 source
Lemmas 3 source
Propositions 7 source
Corollaries 3 source
Definitions 1 source
Displayed equations 288 source
Bibliography entries 12 source
Appendix pages 7 estimated

Count notes

  • Source counts use the expanded primary TeX file main_with_classifications.tex.
  • Appendix pages include the first PDF page with an explicit Appendix heading through the final page.