Numerical check: via formal power series
ProvedQseriesFormalization.PartIV.Ch20.ramanujan_partition_five_mod_sevenchan-invitation-qseriespartition-congruencespartitions
The partition count (partitionCount), cast to , is : . This is the case of Ramanujan's congruence , a single numerical fact (the general congruence is not asserted here). Chapter 20.
Preamble
import Definitions.Def_QseriesFormalization_DefCoreQSeries
import Mathlib
import Mathlib.Combinatorics.Enumerative.Partition.GenFun
import Mathlib.RingTheory.PowerSeries.Basic
import Mathlib.RingTheory.PowerSeries.Expand
import Mathlib.RingTheory.PowerSeries.Inverse
import Mathlib.RingTheory.PowerSeries.Derivative
import Mathlib.Analysis.SpecialFunctions.Log.Summable
import Mathlib.Analysis.Normed.Group.Tannery
import Mathlib.Combinatorics.Enumerative.Partition.Basic
import Mathlib.Tactic.Linarith
import Mathlib.Analysis.SpecificLimits.Normed
import Mathlib.Analysis.Normed.Ring.InfiniteSum
namespace QseriesFormalization.PartIV.Ch19 end QseriesFormalization.PartIV.Ch19
namespace QseriesFormalization.Pending.Ch15FormalDeriv end QseriesFormalization.Pending.Ch15FormalDeriv
/-!
# Chapter 20 — Modular discriminant Δ and the Ramanujan τ-function
⚠️ **AUX CHAPTER — full modularity of Δ(τ) OPEN**.
Per `PLAYBOOK_AUDIT.md` (2026-05-22): this file is the formal-PS landing
strip for the Ramanujan τ-function and the discriminant. Genuine
results proved here:
• Values: `ramanujanTau_zero .. ramanujanTau_fifty` matching OEIS A000594
• Multiplicativity checks at coprime factor pairs up to 50
• Prime-power Hecke recursion checks for p ∈ {2, 3, 5, 7} up to 50
• Log-derivative recurrence for all `n ≥ 2`
• Parity theorem: `τ(n)` is odd iff `n` is an odd square
• Mod-691 congruence `τ(n) ≡ σ₁₁(n)` verified through `n ≤ 50`
• Mod-p congruences: `ramanujanTau_p_mod_p` for `p ∈ {2,3,5,7}`
• n = 0 unconditional Ramanujan trio:
`ramanujan_partition_four_mod_five`, `_five_mod_seven`,
`_six_mod_eleven`
• Frobenius: `discriminantPS_pow_eq_expand`
• Algebraic structure: `etaPS_isUnit`, `discriminantPS_not_isUnit`,
`discriminantPS_eq_X_mul_etaPS_pow_24`,
`discriminantPS_eq_X_mul_tprod_pow_24`
**Chan's Ch 20 main result — the modular invariance of Δ(τ) under
SL₂(ℤ) and the resulting full multiplicativity of `τ(n)` — is NOT
formalized here**, because the formal-PS approach does not see the
complex-analytic modularity directly; that requires Mathlib's
`ModularForm` infrastructure which is incomplete for the η-quotient
case. Tracked as Tier 5 #18 in `TODO_THEOREMS.md`.
-/
open QseriesFormalization
variable {R : Type*} [Field R]
open Filter Topology
/-! ### Formal power series eta and discriminant
We lift Chan's η and Δ to formal power series over a commutative ring, using
the partition generating function infrastructure from Chapter 19. -/
open PowerSeries QseriesFormalization.PartIV.Ch19
open QseriesFormalization.Pending.Ch15FormalDeriv
variable (R : Type*) [CommRing R]
-- B2 small case verifications removed (they don't help the general proof).
-- General B2 target: (qPochInfPS R)^3 = jacobiThetaPS R requires Sylvester
-- combinatorial or analytic-formal bridge.
/-! ### Unconditional Ramanujan congruence: p(4) ≡ 0 (mod 5)
Closing the n=0 case of Ramanujan p(5n+4) ≡ 0 (mod 5) using the formal-PS
framework: compute `((q;q)∞^4).coeff 4` directly via the coeff_four_pow helper
and the Euler-pentagonal coefficient values, then bridge to `partitionCount 4`
via `coeff_pochInfPow_eq_partitionCount_of_lt`. -/Formal statement
theorem QseriesFormalization.PartIV.Ch20.ramanujan_partition_five_mod_seven :
((QseriesFormalization.Ch01.partitionCount 5 : Nat) : ZMod 7) = 0 := by sorrySource
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 20. Lean source: https://github.com/xiangyazi24/invitation-to-qseries-lean/blob/5df34b280b6a9c4a68ab09105b4e5d3c7bbe88d1/QseriesFormalization/Chapter20.lean#L1932-L1942