Euler's pentagonal number theorem
ProvedFamousTheorems.pentagonal_number_theoremEuler's pentagonal number theorem.
as formal power series over any commutative ring.
The exponents are the generalized pentagonal numbers. Combined with it yields Euler's recurrence for the partition function, and it is the first of the Macdonald identities.
Formalization note. PowerSeries.pentagonalSeries R has coefficient at and elsewhere. The infinite product converges in the coefficientwise (pi) topology on , opened via PowerSeries.WithPiTopology. Mathlib: PowerSeries.WithPiTopology.hasProd_one_sub_X_pow.
Preamble
import Mathlib
Formal statement
namespace FamousTheorems
open scoped PowerSeries.WithPiTopology
theorem pentagonal_number_theorem (R : Type*) [CommRing R] [TopologicalSpace R] :
HasProd (fun n : ℕ => (1 - PowerSeries.X ^ (n + 1) : PowerSeries R)) (PowerSeries.pentagonalSeries R) := by sorry
end FamousTheoremsSource
Listed in Mathlib's curated theorem manifests (docs/1000.yaml); formalized in Mathlib as `PowerSeries.WithPiTopology.hasProd_one_sub_X_pow`. Proof here reduces to that Mathlib result.