Chapter 14 data: explicit partitions of used for the crank-residue check
DefinitionQseriesFormalization_Chapter14_CrankN24chan-invitation-qseriescrankspartition-congruencespartitions
This bundle defines five explicit partitions of : , , , and . They serve as witnesses for the crank taking all five residues mod on partitions of .
Definition code
-- Generated by qseries-p2m/p2m/generate.py from QseriesFormalization.Chapter14_CrankN24: skeleton subtraction
-- keeps 5 declaration(s); proofs kept; project imports -> Definitions bundles.
import Mathlib
/-!
# Chapter 14 - Crank hits all 5 residues mod 5 for partitions of 24
The `n = 4` case of the Dyson-Garvan crank theorem for `p = 5`
(`24 = 5*4 + 4`), companion to `Chapter14_CrankN4.lean`,
`Chapter14_CrankN9.lean`, `Chapter14_CrankN14.lean`, and
`Chapter14_CrankN19.lean`. We exhibit five partitions of 24 whose cranks
cover all residues mod 5:
`[24]` crank = 24 == 4
`[23,1]` crank = 0
`[22,2]` crank = 22 == 2
`[21,3]` crank = 21 == 1
`[18,3,3]` crank = 18 == 3
For the parts with `1` absent the crank is the largest part; for `[23,1]`,
`omega = 1` one and `mu = 1` (just `[23] > 1`), so crank `= 1 - 1 = 0`.
The full Dyson-Garvan equidistribution theorem is still OPEN; this adds the
`n = 4`, `p = 5` surjectivity case to the `n = 0`, `n = 1`, `n = 2`, and
`n = 3` cases already in `Chapter14_CrankN4.lean`,
`Chapter14_CrankN9.lean`, `Chapter14_CrankN14.lean`, and
`Chapter14_CrankN19.lean`.
-/
namespace QseriesFormalization
namespace PartIII
namespace Ch14
open Multiset
/-- Partition `[24]` of 24. -/
def partitionTwentyFourTwentyFour : Nat.Partition 24 where
parts := {24}
parts_pos := by intro a ha; rw [Multiset.mem_singleton] at ha; omega
parts_sum := by rw [Multiset.sum_singleton]
/-- Partition `[23, 1]` of 24. -/
def partitionTwentyFourTwentyThreeOne : Nat.Partition 24 where
parts := {23, 1}
parts_pos := by intro a ha; fin_cases ha <;> omega
parts_sum := by decide
/-- Partition `[22, 2]` of 24. -/
def partitionTwentyFourTwentyTwoTwo : Nat.Partition 24 where
parts := {22, 2}
parts_pos := by intro a ha; fin_cases ha <;> omega
parts_sum := by decide
/-- Partition `[21, 3]` of 24. -/
def partitionTwentyFourTwentyOneThree : Nat.Partition 24 where
parts := {21, 3}
parts_pos := by intro a ha; fin_cases ha <;> omega
parts_sum := by decide
/-- Partition `[18, 3, 3]` of 24. -/
def partitionTwentyFourEighteenThreeThree : Nat.Partition 24 where
parts := {18, 3, 3}
parts_pos := by intro a ha; fin_cases ha <;> omega
parts_sum := by decide
end Ch14
end PartIII
end QseriesFormalization
Source
Lean formalization (Xiang Huang) of Hei-Chi Chan, An Invitation to q-Series: From Jacobi's Triple Product Identity to Ramanujan's "Most Beautiful Identity" (World Scientific, 2011), Chapter 14. Lean source: https://github.com/xiangyazi24/invitation-to-qseries-lean/blob/5df34b280b6a9c4a68ab09105b4e5d3c7bbe88d1/QseriesFormalization/Chapter14_CrankN24.lean (definitions of this module that the uploaded theorems need; ported to Lean v4.33.1 / Mathlib 0df444a).