Chapter 7 Step 1 definitions: Schur polynomials, theta-Gaussian finite sums for the first Rogers--Ramanujan identity
DefinitionQseriesFormalization_Chapter07_RRStep1chan-invitation-qseriespentagonal-numbersq-binomialrogers-ramanujan
This bundle defines the Rogers--Ramanujan/Schur polynomial by , , the Schur finite sum , the exponent (as a natural number), and the natural-valued Schur bottom index, defined as when and as otherwise. The integer-valued variant schurB n j is the integer quotient without this sentinel. It defines the zero-extended Gaussian binomial gBz, the theta-Gaussian finite sum and variants, and the per- residual and carry terms used in the carry-telescope proof of the Schur recurrence.
Definition code
-- Generated by qseries-p2m/p2m/generate.py from QseriesFormalization.Chapter07_RRStep1: skeleton subtraction
-- keeps 14 declaration(s); proofs kept; project imports -> Definitions bundles.
import Definitions.Def_QseriesFormalization_DefCoreQSeries
import Mathlib
import Mathlib.Analysis.SpecialFunctions.Log.Summable
import Mathlib.Analysis.Normed.Group.Tannery
/-!
# Chapter 7 — Rogers-Ramanujan Step 1 (Schur finite identity + Tannery)
Isolated module for the deepest R-R step: the Schur polynomial recurrence,
its identification with the finite Gaussian sum, and the Tannery limit
yielding `rrJInf 1 q · (q;q)_∞ = ∑'_j (-1)^j q^(j(5j+1)/2)`.
See `docs/RR_step1_schur.md`.
-/
namespace QseriesFormalization
namespace PartII
namespace Ch07
section Complex
open Filter Topology
/-- The Rogers-Ramanujan / Schur polynomial `d_N`, defined by the recurrence
`d_N = d_{N-1} + q^(N-1)·d_{N-2}`, `d_0 = d_1 = 1`. -/
noncomputable def rrPoly (q : ℂ) : ℕ → ℂ
| 0 => 1
| 1 => 1
| (N + 2) => rrPoly q (N + 1) + q ^ (N + 1) * rrPoly q N
@[simp] theorem rrPoly_zero (q : ℂ) : rrPoly q 0 = 1 := rfl
@[simp] theorem rrPoly_one (q : ℂ) : rrPoly q 1 = 1 := rfl
/-- The Schur finite sum `S q N := ∑_{n=0}^{N} q^(n²)·[N-n choose n]_q`. -/
noncomputable def schurSum (q : ℂ) (N : ℕ) : ℂ :=
∑ n ∈ Finset.range (N + 1), q ^ (n ^ 2) * gaussianBinom q (N - n) n
/-! ### Schur recurrence for `schurSum`
The crux of Step 1: `schurSum q (N+2) = schurSum q (N+1) + q^(N+1)·schurSum q N`.
Proof (verified by hand, exponent algebra):
`S q (N+2) = ∑_n q^(n²)·[N+2-n choose n]_q`. Apply gaussianBinom Pascal
(`[m+1 choose k+1]_q = [m choose k+1]_q + q^(m-k)·[m choose k]_q` with
`m=N+1-n, k=n-1`):
`[N+2-n choose n]_q = [N+1-n choose n]_q + q^(N+2-2n)·[N+1-n choose n-1]_q`
So `S q (N+2) = S q (N+1) + ∑_n q^(n²+N+2-2n)·[N+1-n choose n-1]_q`.
Reindex `n = m+1`: `q^((m+1)²+N+2-2(m+1)) = q^(m²+N+1)`, and
`[N+1-(m+1) choose m]_q = [N-m choose m]_q`. So the second sum
`= q^(N+1)·∑_m q^(m²)·[N-m choose m]_q = q^(N+1)·S q N`. ∎
The Lean formalization of this Finset reindex + Pascal split is in
`schurSum_recurrence` (below), and `rrPoly_eq_schurSum` follows by
two-step induction. -/
/-! ### Tannery LHS — pointwise gaussianBinom limit -/
/-! ### Schur RHS — parity-split theta-Gaussian finite sum (FORM UNRESOLVED)
**Sanity-check failure (2026-05-15)**: the naively-stated Schur RHS form
`d_{2M} = ∑_{j=-M}^{M} (-1)^j q^(j(5j+1)/2) [2M choose M-j]_q`
does NOT satisfy `d_2 = 1 + q`. Direct computation at `M=1` (j ∈ {-1,0,1}):
`(-1)·q²·[2,2] + 1·q⁰·[2,1] + (-1)·q³·[2,0] = -q² + (1+q) - q³`,
which is `1+q-q²-q³ ≠ 1+q = rrPoly q 2 = schurSum q 2` (both proven above).
So a convention is off: the bottom index is likely `⌊(N-5j)/2⌋` (with `5j`,
not `2j`), OR the polynomial is the H-type `∑ q^(n²+n)[…]`, OR the exponent
differs. This requires a careful literature reference (Andrews,
*The Theory of Partitions*, Thm 7.x; or Sills, *An Invitation to the
Rogers–Ramanujan Identities*) and must NOT be guessed.
**Generalized pentagonal helper** (correct & reusable regardless of the
final bottom-index convention): -/
/-- Generalized pentagonal exponent `j(5j+1)/2` as a `ℕ` (always `≥ 0`). -/
noncomputable def pentExp5 (j : ℤ) : ℕ := (j * (5 * j + 1) / 2).toNat
/-- Schur bottom index `⌊(n-5j)/2⌋` as a `ℕ`. When `n-5j < 0` we return
`n+1` (out of `[0,n]`, so `gaussianBinom q n (n+1) = 0` — the term vanishes,
matching the true identity where these `j` contribute nothing). For
`n-5j ≥ 0`, `((n-5j)/2 : ℤ).toNat` is the exact floor. -/
noncomputable def schurBottom (n : ℕ) (j : ℤ) : ℕ :=
if (n : ℤ) - 5 * j < 0 then n + 1
else (((n : ℤ) - 5 * j) / 2).toNat
/-- Zero-extended integer-bottom Gaussian binomial (ChatGPT-recommended
wrapper for the Schur reindex): `0` when `k ∉ [0, n]`, else `[n choose k]_q`. -/
noncomputable def gBz (q : ℂ) (n : ℕ) (k : ℤ) : ℂ :=
if 0 ≤ k ∧ k ≤ (n : ℤ) then gaussianBinom q n k.toNat else 0
/-- The Schur RHS theta-Gaussian finite sum:
`∑_{j} (-1)^j q^(j(5j+1)/2) · [n choose ⌊(n-5j)/2⌋]_q`,
summed over `j ∈ [-(n+1), n+1]` (finite support; outside, the Gaussian is 0). -/
noncomputable def schurRHS (q : ℂ) (n : ℕ) : ℂ :=
∑ j ∈ Finset.Icc (-(n : ℤ) - 1) ((n : ℤ) + 1),
(-1 : ℂ) ^ j * q ^ pentExp5 j * gaussianBinom q n (schurBottom n j)
/-- `schurRHS` via the `gBz` wrapper (reindex-friendly: clean `ℤ` arithmetic). -/
noncomputable def schurRHSz (q : ℂ) (n : ℕ) : ℂ :=
∑ j ∈ Finset.Icc (-(n : ℤ) - 1) ((n : ℤ) + 1),
(-1 : ℂ) ^ j * q ^ pentExp5 j * gBz q n ((schurBottom n j : ℤ))
/-! ### Schur recurrence via carry-telescope (ChatGPT extended-pro skeleton) -/
/-- Raw integer floor bottom `⌊(n-5j)/2⌋` (no `if`, clean ℤ arithmetic). -/
noncomputable def schurB (n : ℕ) (j : ℤ) : ℤ :=
((n : ℤ) - 5 * j) / 2
/-- `schurRHSz` term with the raw floor bottom. -/
noncomputable def schurTermZ' (q : ℂ) (n : ℕ) (j : ℤ) : ℂ :=
(-1 : ℂ) ^ j * q ^ pentExp5 j * gBz q n (schurB n j)
/-- Common reindex range (wide enough for `N`, `N+1`, `N+2`). -/
noncomputable def bigJ (N : ℕ) : Finset ℤ :=
Finset.Icc (-(N : ℤ) - 3) ((N : ℤ) + 3)
/-! #### Unconditional single-step q-Pascal (via gBz zero-extension) -/
/-! #### Local q-binomial residual identities (Schur 1917 combinatorial core)
Two-Pascal-step cancellation: `gBz(N+2)(b+1)` reduced via one upper and one
lower single-step q-Pascal, with the cross term killed because either the
`toNat` exponents sum to `N+1` (when `0 ≤ b ≤ N`) or `gBz q N b = 0`. -/
/-! #### Carry-telescope proof of the Schur recurrence (unconditional) -/
/-- Per-`j` residual of the RR recurrence (with the raw-floor term). -/
noncomputable def schurResidual (q : ℂ) (N : ℕ) (j : ℤ) : ℂ :=
schurTermZ' q (N + 2) j - schurTermZ' q (N + 1) j
- q ^ (N + 1) * schurTermZ' q N j
/-- Telescoping carry: nonzero only on the even-parity residues. -/
noncomputable def schurCarry (q : ℂ) (N : ℕ) (j : ℤ) : ℂ :=
if ((N : ℤ) - 5 * j) % 2 = 0 then
(-1 : ℂ) ^ j * q ^ (pentExp5 j + (schurB N j + 1).toNat)
* gBz q N (schurB N j + 1)
else 0
end Complex
end Ch07
end PartII
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 7. Lean source: https://github.com/xiangyazi24/invitation-to-qseries-lean/blob/5df34b280b6a9c4a68ab09105b4e5d3c7bbe88d1/QseriesFormalization/Chapter07_RRStep1.lean (definitions of this module that the uploaded theorems need; ported to Lean v4.33.1 / Mathlib 0df444a).