Numerical check:
ProvedQseriesFormalization.PartIV.Ch20.ramanujanTau_two_mod_twochan-invitation-qseriesramanujan-tau
With (ramanujanTau ), the integer cast into is , i.e. . A single numerical instance, not a general congruence for . Chapter 20.
Preamble
import Definitions.Def_QseriesFormalization_Chapter20
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.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
open QseriesFormalization.PartIV
open QseriesFormalization.PartIV.Ch20
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`. -/
/-! ### Extended Ramanujan τ values through 50 -/
set_option maxHeartbeats 0
set_option maxRecDepth 100000
set_option linter.unusedSimpArgs false
/-! #### Certified fast evaluation of the coefficients of `η²⁴` up to `q⁴⁹`
`tauEtaPowVec 49 24` performs 24 truncated convolutions over `Vector`/`Fin` sums, which the
kernel evaluates slowly. Below, the same coefficients are computed by repeated squaring on plain
integer lists (`η² , η⁴, η⁸, η¹⁶`, then `η¹⁶ · η⁸`), five truncated products in all. Each list
product is proved to compute the coefficients of the power-series product
(`tauListMul_getD`), so the list for `η²⁴` equals the coefficients of `(etaPS ℤ)^24`; the vector
side equals them by `tauEtaPowVec_spec`. Only the final 50-entry comparison of the fast list with
the stated table is a kernel computation. -/
/-! ### Hecke multiplicativity checks at coprime factor pairs up to 50 -/
/-! ### Prime-power Hecke recursion checks -/
/-! ### Parity and coefficient bounds through 50 -/
/-! ### Ramanujan's mod-691 congruence through 50 -/
/-! #### Formal Eisenstein series for the mod-691 route -/
/-! ### Log-derivative recurrence -/
/-! ### Ramanujan τ congruences at primes p ∈ {2, 3, 5, 7}
For the Ramanujan tau function, classical results show `τ(p) ≡ 0 (mod p)` for certain
small primes (and more generally `τ(p) ≡ 1 + p¹¹ (mod 691)` etc.). We verify the
prime divisibility for p = 2, 3, 5, 7 directly from the computed values. -/Formal statement
theorem QseriesFormalization.PartIV.Ch20.ramanujanTau_two_mod_two :
(ramanujanTau ℤ 2 : ZMod 2) = 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#L3613-L3617