Generic framework for Pentagonal number theorem #
This file partially proves the Pentagonal number theorem for arbitrary topological ring, without concerning about summability, multipliability, or the existence of certain limits.
Complete proof is delegated to Complex.lean and PowerSeries.lean.
We define an auxiliary sequence
$$Γ_N = \sum_{n=0}^{\infty} γ_{k, n} = \sum_{n=0}^{\infty} \left( x^{(k+1)n} \prod_{i=0}^{n} 1 - x^{k + i + 1} \right)$$
Instances For
And a second auxiliary sequence
$$ ψ_{k, n} = x^{(k+1)n} (x^{2N + n + 3} - 1) \prod_{i=0}^{n-1} 1 - x^{k + i + 2} $$
Equations
Instances For
By summing with telescoping, we get a recurrence formlua for $Γ$
$$ Γ_{k} = 1 - x^{2N + 3} - x^{3N + 5}Γ_{k + 1} $$
The Euler function is related to $Γ$ by
$$ \prod_{n = 0}^{\infty} 1 - x^{n + 1} = 1 - x - x^2 Γ_0 $$
Applying the recurrence formula repeatedly, we get
$$ \prod_{n = 0}^{\infty} 1 - x^{n + 1} = \left(\sum_{k=0}^{k} (-1)^k \left(x^{k(3k+1)/2} + x^{(k+1)(3k+2)/2}\right) \right) + (-1)^{k+1}x^{(k+1)(3N + 4)/2}Γ_N $$
Taking $k \to \infty$, we get the pentagonal number theorem in the generic form
$$ \prod_{n = 0}^{\infty} 1 - x^{n + 1} = \sum_{k=0}^{\infty} (-1)^k \left(x^{k(3k+1)/2} + x^{(k+1)(3k+2)/2}\right) $$