Documentation

Mathlib.Combinatorics.Enumerative.Pentagonal.PowerSeries

Pentagonal number theorem for power series #

This file proves the pentagonal number theorem for power series:

$$ \prod_{n = 0}^{\infty} (1 - x^{n + 1}) = \sum_{k=-\infty}^{\infty} (-1)^k x^{a_k} $$

where $a_k = k(3k - 1)/2$ are the pentagonal numbers. We state the theorem in two parts by introducing the intermediate power series PowerSeries.pentagonalSeries, whose coefficients are defined using pentagonal numbers. We then show that this series is equal to both sides.

Main theorems #

noncomputable def PowerSeries.pentagonalSeries (R : Type u_1) [CommRing R] :

The power series $\sum_{k=-\infty}^{\infty}(-1)^k x^{k * (3k - 1) / 2}$.

Equations
Instances For

    PowerSeries.pentagonalSeries as an infinite sum over natural numbers. In this version, terms are ordered by strictly increasing exponent pentagonal k for k = 0, 1, -1, 2, -2, 3, ..., and every two terms are grouped together.

    theorem PowerSeries.coeff_prod_one_sub_X_pow_eventually_eq (R : Type u_1) [CommRing R] (n : ) :
    ∀ᶠ (s : Finset ) in Filter.atTop, (coeff n) (∏ ns, (1 - X ^ (n + 1))) = (coeff n) (pentagonalSeries R)

    Pentagonal number theorem for power series, expressed as the statement that the coefficients of the product ∏ n, 1 - X ^ (n + 1) are eventually constants as (pentagonalSeries R).coeff.

    Pentagonal number theorem for power series, expressed as an infinite product. See also PowerSeries.WithPiTopology.hasSum_pentagonalSeries that expresses pentagonalSeries as an infinite sum.