Chapter 14 data: explicit partitions of used for the crank-residue check
DefinitionQseriesFormalization_Chapter14_CrankN14chan-invitation-qseriescrankspartition-congruencespartitions
This bundle defines five explicit partitions of as Nat.Partition 14 values: , , , and . They are the witnesses used to show the crank takes all five residues modulo on partitions of .
Definition code
-- Generated by qseries-p2m/p2m/generate.py from QseriesFormalization.Chapter14_CrankN14: 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 14
The `n = 2` case of the Dyson-Garvan crank theorem for `p = 5`
(`14 = 5*2 + 4`), companion to `Chapter14_CrankN4.lean` and
`Chapter14_CrankN9.lean`. We exhibit five partitions of 14 whose cranks cover
all residues mod 5:
`[14]` crank = 14 ≡ 4
`[13,1]` crank = 0
`[12,2]` crank = 12 ≡ 2
`[11,3]` crank = 11 ≡ 1
`[8,3,3]` crank = 8 ≡ 3
For the parts with `1 ∉ parts` the crank is the largest part; for `[13,1]`,
`omega = 1` one and `mu = 1` (just `[13] > 1`), so crank `= 1 - 1 = 0`.
The full Dyson-Garvan equidistribution theorem is still OPEN; this adds the
`n = 2`, `p = 5` surjectivity case to the `n = 0` and `n = 1` cases already in
`Chapter14_CrankN4.lean` and `Chapter14_CrankN9.lean`.
-/
namespace QseriesFormalization
namespace PartIII
namespace Ch14
open Multiset
/-- Partition `[14]` of 14. -/
def partitionFourteenFourteen : Nat.Partition 14 where
parts := {14}
parts_pos := by intro a ha; rw [Multiset.mem_singleton] at ha; omega
parts_sum := by rw [Multiset.sum_singleton]
/-- Partition `[13, 1]` of 14. -/
def partitionFourteenThirteenOne : Nat.Partition 14 where
parts := {13, 1}
parts_pos := by intro a ha; fin_cases ha <;> omega
parts_sum := by decide
/-- Partition `[12, 2]` of 14. -/
def partitionFourteenTwelveTwo : Nat.Partition 14 where
parts := {12, 2}
parts_pos := by intro a ha; fin_cases ha <;> omega
parts_sum := by decide
/-- Partition `[11, 3]` of 14. -/
def partitionFourteenElevenThree : Nat.Partition 14 where
parts := {11, 3}
parts_pos := by intro a ha; fin_cases ha <;> omega
parts_sum := by decide
/-- Partition `[8, 3, 3]` of 14. -/
def partitionFourteenEightThreeThree : Nat.Partition 14 where
parts := {8, 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_CrankN14.lean (definitions of this module that the uploaded theorems need; ported to Lean v4.33.1 / Mathlib 0df444a).