Chapter 14 data: explicit partitions of used for the crank-residue check
DefinitionQseriesFormalization_Chapter14_CrankN9chan-invitation-qseriescrankspartitions
This bundle defines four explicit partitions of : , , and . Together with the singleton partition , they are witnesses for the crank taking all residues mod on partitions of .
Definition code
-- Generated by qseries-p2m/p2m/generate.py from QseriesFormalization.Chapter14_CrankN9: skeleton subtraction
-- keeps 4 declaration(s); proofs kept; project imports -> Definitions bundles.
import Mathlib
/-!
# Chapter 14 — Crank hits all 5 residues mod 5 for partitions of 9
The `n = 1` case of the Dyson–Garvan crank theorem for `p = 5` (`9 = 5·1 + 4`),
companion to `Chapter14_CrankN4.lean`. We exhibit five partitions of 9 whose
cranks cover all residues mod 5:
`[9]` crank = 9 ≡ 4
`[8,1]` crank = 0
`[7,2]` crank = 7 ≡ 2
`[6,3]` crank = 6 ≡ 1
`[3,3,3]` crank = 3 ≡ 3
For the parts with `1 ∉ parts` the crank is the largest part; for `[8,1]`,
`ω = 1` one and `μ = 1` (just `[8] > 1`), so crank `= 1 − 1 = 0`.
The full Dyson–Garvan equidistribution theorem is still OPEN; this adds the
`n = 1`, `p = 5` surjectivity case to the `n = 0` case already in
`Chapter14_CrankN4.lean`.
-/
namespace QseriesFormalization
namespace PartIII
namespace Ch14
open Multiset
/-- Partition `[8, 1]` of 9. -/
def partitionNineEightOne : Nat.Partition 9 where
parts := {8, 1}
parts_pos := by intro a ha; fin_cases ha <;> omega
parts_sum := by decide
/-- Partition `[7, 2]` of 9. -/
def partitionNineSevenTwo : Nat.Partition 9 where
parts := {7, 2}
parts_pos := by intro a ha; fin_cases ha <;> omega
parts_sum := by decide
/-- Partition `[6, 3]` of 9. -/
def partitionNineSixThree : Nat.Partition 9 where
parts := {6, 3}
parts_pos := by intro a ha; fin_cases ha <;> omega
parts_sum := by decide
/-- Partition `[3, 3, 3]` of 9. -/
def partitionNineThreeThreeThree : Nat.Partition 9 where
parts := {3, 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_CrankN9.lean (definitions of this module that the uploaded theorems need; ported to Lean v4.33.1 / Mathlib 0df444a).