Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Multiplicativity check: τ(35)=τ(5)τ(7)\tau(35)=\tau(5)\tau(7)τ(35)=τ(5)τ(7)

Proved
QseriesFormalization.PartIV.Ch20.ramanujanTau_thirtyfive_eq

by FormallyCorrect · Oct 23, 2026 · Mathlib 0df444a (Lean v4.33.1)

chan-invitation-qserieseta-quotientsramanujan-tau

In Z\mathbb{Z}Z, with τ(m)=[Xm] X(q;q)∞24\tau(m)=[X^m]\,X(q;q)_\infty^{24}τ(m)=[Xm]X(q;q)∞24​ (ramanujanTau Z m\mathbb{Z}\,mZm, the Ramanujan tau function as the coefficients of discriminantPS), the equation τ(35)=τ(5) τ(7)\tau(35)=\tau(5)\,\tau(7)τ(35)=τ(5)τ(7) holds. Here gcd⁡(5,7)=1\gcd(5,7)=1gcd(5,7)=1, so this is the single instance (m,n)=(5,7)(m,n)=(5,7)(m,n)=(5,7) of the multiplicativity τ(mn)=τ(m)τ(n)\tau(mn)=\tau(m)\tau(n)τ(mn)=τ(m)τ(n) for coprime m,nm,nm,n, not the general property. 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 -/
Formal statement
theorem QseriesFormalization.PartIV.Ch20.ramanujanTau_thirtyfive_eq : ramanujanTau ℤ 35 = ramanujanTau ℤ 5 * ramanujanTau ℤ 7 := by sorry
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 20. Lean source: https://github.com/xiangyazi24/invitation-to-qseries-lean/blob/5df34b280b6a9c4a68ab09105b4e5d3c7bbe88d1/QseriesFormalization/Chapter20.lean#L2672-L2674

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me