pentagonal number theorem
Theorem :
(1) |
where the two sides are regarded as formal power series over .
Proof: For , denote by the coefficient of in the product on the left, i.e. write
By this definition, we have for all
where (resp. ) is the number of partitions of asa sum of an even (resp. odd) number of distinct summands.To fix the notation, let be set of pairs where isa natural number
and is a decreasing mapping such that .The cardinal of is thus , and is the union ofthese two disjoint sets:
Now on the right side of (1) we have
Therefore what we want to prove is
(2) | |||||
(3) |
For we have
(4) | |||||
(5) |
Take some , and suppose first that is notof the form (4) nor (5).Since is decreasing, there is a unique integer such that
If , define by
If , define by
In both cases, is decreasing and .The mapping maps takes an element having odd to an element having even , and vice versa.Finally, the reader can verify that .Thus we have constructed a bijection ,proving (3).
Now suppose that for some (perforce unique) .The above construction still yields a bijection between and excluding (from one set or the other) the singleelement :
as in (4).Likewise if , only this element is excluded:
as in (5).In both cases we deduce (2), completing the proof.
Remarks: The name of the theorem derives from the fact thatthe exponents are the generalized pentagonal numbers.
The theorem was discovered and proved by Euler around 1750.This was one of the first results about what are now called thetafunctions, and was also one of the earliest applications ofthe formalism of generating functions.
The above proof is due to F. Franklin,(Comptes Rendus de l’Acad. des Sciences,92, 1881, pp. 448-450).