Mod-5 dissection abbreviations over : , , , and cube-terms
DefinitionQseriesFormalization_Pending_Chapter17_ASD_Mod5_Fullchan-invitation-qseriesformal-power-seriespartition-congruencesq-pochhammer
This bundle defines, in , , (the substitution ), , and where is the residue- section of . It also defines the four cube terms , , and appearing in the expansion of .
Definition code
-- Generated by qseries-p2m/p2m/generate.py from QseriesFormalization.Pending.Chapter17_ASD_Mod5_Full: skeleton subtraction -- keeps 8 declaration(s); proofs kept; project imports -> Definitions bundles. import Definitions.Def_QseriesFormalization_Pending_Chapter17_ASD_Mod5 import Mathlib.Combinatorics.Enumerative.Partition.GenFun import Mathlib.RingTheory.PowerSeries.Basic import Mathlib.RingTheory.PowerSeries.Expand import Mathlib.RingTheory.PowerSeries.Inverse import Mathlib.Data.ZMod.Basic import Mathlib.Analysis.SpecificLimits.Normed import Mathlib.Analysis.Normed.Ring.InfiniteSum import Mathlib import Mathlib.Combinatorics.Enumerative.Partition.Basic import Mathlib.Tactic.Linarith import Mathlib.Analysis.SpecialFunctions.Log.Summable import Mathlib.Analysis.Normed.Group.Tannery /-! # Chapter 17 — Full mod-5 ASD residue extraction This file continues `Pending.Chapter17_ASD_Mod5`. It keeps the Atkin--Swinnerton-Dyer mod-5 dissection in terms of the already-proved section components * `A 0`, the residue-0 component of `(q;q)_∞^3`; * `A 1`, the residue-1 component of `(q;q)_∞^3`. After Frobenius, the denominator-cleared form of Hirschhorn §3.6 is `partitionGenFun * (expand 5 qPochInfPS)^2 = (A 0 + A 1)^3` in `(ZMod 5)⟦X⟧`. Applying the compressed `5`-section operator gives the five generating-function congruences, with the right-hand side still written in section-component form. -/ namespace QseriesFormalization namespace Pending namespace ASDMod5Full open PowerSeries open QseriesFormalization.PartIV.Ch19 open QseriesFormalization.Pending.ASDMod5 noncomputable abbrev Q5 : (ZMod 5)⟦X⟧ := qPochInfPS (ZMod 5) noncomputable abbrev D5 : (ZMod 5)⟦X⟧ := PowerSeries.expand 5 (by decide) Q5 noncomputable abbrev P5 : (ZMod 5)⟦X⟧ := partitionGenFun (ZMod 5) noncomputable abbrev S5 : (ZMod 5)⟦X⟧ := A 0 + A 1 noncomputable abbrev N0 : (ZMod 5)⟦X⟧ := (A 0) ^ 3 noncomputable abbrev N1 : (ZMod 5)⟦X⟧ := (3 : (ZMod 5)⟦X⟧) * (A 0) ^ 2 * A 1 noncomputable abbrev N2 : (ZMod 5)⟦X⟧ := (3 : (ZMod 5)⟦X⟧) * A 0 * (A 1) ^ 2 noncomputable abbrev N3 : (ZMod 5)⟦X⟧ := (A 1) ^ 3 end ASDMod5Full end Pending 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 17. Lean source: https://github.com/xiangyazi24/invitation-to-qseries-lean/blob/5df34b280b6a9c4a68ab09105b4e5d3c7bbe88d1/QseriesFormalization/Pending/Chapter17_ASD_Mod5_Full.lean (definitions of this module that the uploaded theorems need; ported to Lean v4.33.1 / Mathlib 0df444a).