Chapter 14 data: explicit partitions of used for the crank-residue check
DefinitionQseriesFormalization_Chapter14_CrankN34chan-invitation-qseriescrankspartition-congruencespartitions
This bundle defines five explicit partitions of : , , , and . They serve as witnesses for the crank taking all residues mod on partitions of .
Definition code
-- Generated by qseries-p2m/p2m/generate.py from QseriesFormalization.Chapter14_CrankN34: 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 34
The `n = 6` case of the Dyson-Garvan crank theorem for `p = 5`
(`34 = 5*6 + 4`), companion to `Chapter14_CrankN4.lean`,
`Chapter14_CrankN9.lean`, `Chapter14_CrankN14.lean`,
`Chapter14_CrankN19.lean`, `Chapter14_CrankN24.lean`, and
`Chapter14_CrankN29.lean`. We exhibit five partitions of 34 whose cranks
cover all residues mod 5:
`[34]` crank = 34 == 4
`[33,1]` crank = 0
`[32,2]` crank = 32 == 2
`[31,3]` crank = 31 == 1
`[28,3,3]` crank = 28 == 3
For the parts with `1` absent the crank is the largest part; for `[33,1]`,
`omega = 1` one and `mu = 1` (just `[33] > 1`), so crank `= 1 - 1 = 0`.
The full Dyson-Garvan equidistribution theorem is still OPEN; this adds the
`n = 6`, `p = 5` surjectivity case to the `n = 0`, `n = 1`, `n = 2`,
`n = 3`, `n = 4`, and `n = 5` cases already in
`Chapter14_CrankN4.lean`, `Chapter14_CrankN9.lean`,
`Chapter14_CrankN14.lean`, `Chapter14_CrankN19.lean`,
`Chapter14_CrankN24.lean`, and `Chapter14_CrankN29.lean`.
-/
namespace QseriesFormalization
namespace PartIII
namespace Ch14
open Multiset
/-- Partition `[34]` of 34. -/
def partitionThirtyFourThirtyFour : Nat.Partition 34 where
parts := {34}
parts_pos := by intro a ha; rw [Multiset.mem_singleton] at ha; omega
parts_sum := by rw [Multiset.sum_singleton]
/-- Partition `[33, 1]` of 34. -/
def partitionThirtyFourThirtyThreeOne : Nat.Partition 34 where
parts := {33, 1}
parts_pos := by intro a ha; fin_cases ha <;> omega
parts_sum := by decide
/-- Partition `[32, 2]` of 34. -/
def partitionThirtyFourThirtyTwoTwo : Nat.Partition 34 where
parts := {32, 2}
parts_pos := by intro a ha; fin_cases ha <;> omega
parts_sum := by decide
/-- Partition `[31, 3]` of 34. -/
def partitionThirtyFourThirtyOneThree : Nat.Partition 34 where
parts := {31, 3}
parts_pos := by intro a ha; fin_cases ha <;> omega
parts_sum := by decide
/-- Partition `[28, 3, 3]` of 34. -/
def partitionThirtyFourTwentyEightThreeThree : Nat.Partition 34 where
parts := {28, 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_CrankN34.lean (definitions of this module that the uploaded theorems need; ported to Lean v4.33.1 / Mathlib 0df444a).