Lably
Skip to content

Basel problem

Sum of inverse squares of natural numbers

  • 13 min read
  • 10 chapters

Related on Lably

Through Leonhard Euler, Basel and Summation

The Basel problem asks for the precise summation of the reciprocals of the squares of the natural numbers, i.e. the precise sum of the infinite series: ∑n=1∞1n2=112+122+132+⋯.

The sum of the series is approximately equal to 1.644934. The Basel problem asks for the exact sum of this series (in closed form), as well as a proof that this sum is correct. Euler found the exact sum to be π2/6 and announced this discovery in 1735. His arguments were based on manipulations that were not justified at the time, although he was later proven correct. He produced an accepted proof in 1741.

The solution to this problem can be used to estimate the probability that two large random numbers are coprime. Two random integers in the range from 1 to n, in the limit as n goes to infinity, are relatively prime with a probability that approaches 6/π2, the reciprocal of the solution to the Basel problem.

Euler's approach

Euler's original derivation of the value π2/6 essentially extended observations about finite polynomials and assumed that these same properties hold true for infinite series.

Euler's original reasoning requires justification (100 years later, Karl Weierstrass proved that Euler's representation of the sine function as an infinite product is valid, by the Weierstrass factorization theorem), but even without justification, by simply obtaining the correct value, he was able to verify it numerically against partial sums of the series. The agreement he observed gave him sufficient confidence to announce his result to the mathematical community.

To follow Euler's argument, recall the Taylor series expansion of the sine function sin⁡x=x−x33!+x55!−x77!+⋯ Dividing through by x gives sin⁡xx=1−x23!+x45!−x67!+⋯.

The Weierstrass factorization theorem shows that the right-hand side is the product of linear factors given by its roots, just as for finite polynomials. Euler assumed this as a heuristic for expanding an infinite degree polynomial in terms of its roots, but in fact it is not always true for general P(x). This factorization expands the equation into: sin⁡xx=(1−xπ)(1+xπ)(1−x2π)(1+x2π)(1−x3π)(1+x3π)⋯=(1−x2π2)(1−x24π2)(1−x29π2)⋯

If we formally multiply out this product and collect all the x2 terms (we are allowed to do so because of Newton's identities), we see by induction that the x2 coefficient of ⁠sin x/x⁠ is −(1π2+14π2+19π2+⋯)=−1π2∑n=1∞1n2.

But from the original infinite series expansion of ⁠sin x/x⁠, the coefficient of x2 is −⁠1/3!⁠ = −⁠1/6⁠. These two coefficients must be equal; thus, −16=−1π2∑n=1∞1n2.

Multiplying both sides of this equation by −π2 gives the sum of the reciprocals of the positive square integers. ∑n=1∞1n2=π26.

Generalizations of Euler's method using elementary symmetric polynomials

Using formulae obtained from elementary symmetric polynomials, this same approach can be used to enumerate formulae for the even-indexed even zeta constants which have the following known formula expanded by the Bernoulli numbers: ζ(2n)=(−1)n−1(2π)2n2⋅(2n)!B2n.

For example, let the partial product for sin⁡(x) expanded as above be defined by Sn(x)x=∏k=1n(1−x2k2⋅π2). Then using known formulas for elementary symmetric polynomials (a.k.a., Newton's formulas expanded in terms of power sum identities), we can see (for example) that [x4]Sn(x)x=12π4((Hn(2))2−Hn(4))→n→∞12π4(ζ(2)2−ζ(4))⟹ζ(4)=π490=−2π4⋅[x4]sin⁡(x)x+π436[x6]Sn(x)x=−16π6((Hn(2))3−3Hn(2)Hn(4)+2Hn(6))→n→∞16π6(ζ(2)3−3ζ(2)ζ(4)+2ζ(6))⟹ζ(6)=π6945=−3⋅π6[x6]sin⁡(x)x−23π26π490+π6216,

and so on for subsequent coefficients of [x2k]Sn(x)x. There are other forms of Newton's identities expressing the (finite) power sums Hn(2k) in terms of the elementary symmetric polynomials, ei≡ei(−π212,−π222,−π232,−π242,…), but we can go a more direct route to expressing non-recursive formulas for ζ(2k) using the method of elementary symmetric polynomials. Namely, we have a recurrence relation between the elementary symmetric polynomials and the power sum polynomials given as on this page by (−1)kkek(x1,…,xn)=∑j=1k(−1)k−j−1pj(x1,…,xn)ek−j(x1,…,xn),

which in our situation equates to the limiting recurrence relation (or generating function convolution, or product) expanded as π2k2⋅(2k)⋅(−1)k(2k+1)!=−[x2k]sin⁡(πx)πx×∑i≥1ζ(2i)xi.

Then by differentiation and rearrangement of the terms in the previous equation, we obtain that ζ(2k)=[x2k]12(1−πxcot⁡(πx)).

Consequences of Euler's proof

By the above results, we can conclude that ζ(2k) is always a rational multiple of π2k. In particular, since π and integer powers of it are transcendental, we can conclude at this point that ζ(2k) is irrational, and more precisely, transcendental for all k≥1. By contrast, the properties of the odd-indexed zeta constants, including Apéry's constant ζ(3), are almost completely unknown.

Sign in to keep reading

9 more chapters are free with a Lably account.

More in Topics in mathematics