Chapter 14 data: explicit partitions of used for the crank-residue check
DefinitionQseriesFormalization_Chapter14_CrankN4chan-invitation-qseriescrankspartitions
This bundle defines three explicit partitions of (as Nat.Partition 4 values): , and , the middle cases used with the extreme partitions to show the crank hits every residue mod on partitions of .
Definition code
-- Generated by qseries-p2m/p2m/generate.py from QseriesFormalization.Chapter14_CrankN4: skeleton subtraction
-- keeps 3 declaration(s); proofs kept; project imports -> Definitions bundles.
import Mathlib
/-!
# Chapter 14 — Crank hits all 5 residues mod 5 for partitions of 4
Companion file to `Chapter14.lean`. Concretely verifies the n=4 case
of the Dyson-Garvan crank theorem: the 5 partitions of 4 have cranks
[4] crank = 4
[3,1] crank = 0
[2,2] crank = 2
[2,1,1] crank = -2
[1,1,1,1] crank = -4
which mod 5 are `{4, 0, 2, 3, 1}`, i.e. all 5 residues mod 5 are hit
exactly once. This is the combinatorial witness for `p(4) ≡ 0 (mod 5)`.
The full Dyson-Garvan theorem (`crank distributes evenly mod p over
partitions of `5n+4`/`7n+5`/`11n+6` for `p ∈ {5,7,11}`) is OPEN; this file
covers only the `n = 0`, `p = 5` case.
-/
namespace QseriesFormalization
namespace PartIII
namespace Ch14
open Multiset
/-! ## Construct the three mid-crank partitions explicitly -/
/-- Partition `[3, 1]` of 4. -/
def partitionFourThreeOne : Nat.Partition 4 where
parts := {3, 1}
parts_pos := by
intro a ha
fin_cases ha <;> omega
parts_sum := by decide
/-- Partition `[2, 2]` of 4. -/
def partitionFourTwoTwo : Nat.Partition 4 where
parts := {2, 2}
parts_pos := by
intro a ha
fin_cases ha <;> omega
parts_sum := by decide
/-- Partition `[2, 1, 1]` of 4. -/
def partitionFourTwoOneOne : Nat.Partition 4 where
parts := {2, 1, 1}
parts_pos := by
intro a ha
fin_cases ha <;> omega
parts_sum := by decide
/-! ## Compute cranks of the three mid partitions -/
/-! ## Surjectivity onto ZMod 5 -/
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_CrankN4.lean (definitions of this module that the uploaded theorems need; ported to Lean v4.33.1 / Mathlib 0df444a).