# Basel problem

The **Basel problem** is a problem in mathematical analysis with relevance to number theory, first posed by Pietro Mengoli in 1650 and solved by Leonhard Euler in 1734,^{[1]} and read on 5 December 1735 in *The Saint Petersburg Academy of Sciences*.^{[2]} Since the problem had withstood the attacks of the leading mathematicians of the day, Euler's solution brought him immediate fame when he was twenty-eight. Euler generalised the problem considerably, and his ideas were taken up years later by Bernhard Riemann in his seminal 1859 paper "On the Number of Primes Less Than a Given Magnitude", in which he defined his zeta function and proved its basic properties. The problem is named after Basel, hometown of Euler as well as of the Bernoulli family who unsuccessfully attacked the problem.

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:

- .

The sum of the series is approximately equal to 1.644934.^{[3]} 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, and it was not until 1741 that he was able to produce a truly rigorous proof.

## Contents

## Euler's approachEdit

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.

Of course, 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

Dividing through by x, we have

Using the Weierstrass factorization theorem, it can also be shown that the left-hand side is the product of linear factors given by its roots, just as we do for finite polynomials (which Euler assumed as a heuristic for expanding an infinite degree polynomial in terms of its roots, but is in general not always true for general ):^{[4]}

If we formally multiply out this product and collect all the *x*^{2} terms (we are allowed to do so because of Newton's identities), we see by induction that the *x*^{2} coefficient of sin *x*/*x* is ^{[5]}

But from the original infinite series expansion of sin *x*/*x*, the coefficient of *x*^{2} is −1/3! = −1/6. These two coefficients must be equal; thus,

Multiplying both sides of this equation by −π^{2} gives the sum of the reciprocals of the positive square integers.

This method of calculating is detailed in expository fashion most notably in Havil's *Gamma* book which details many zeta function and logarithm-related series and integrals, as well as a historical perspective, related to the Euler gamma constant.^{[6]}

### Generalizations of Euler's method using elementary symmetric polynomialsEdit

Using formulas obtained from elementary symmetric polynomials,^{[7]} this same approach can be used to enumerate formulas for the even-indexed even zeta constants which have the following known formula expanded by the Bernoulli numbers:

For example, let the partial product for expanded as above be defined by . 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

and so on for subsequent coefficients of . There are other forms of Newton's identities expressing the (finite) power sums in terms of the elementary symmetric polynomials, but we can go a more direct route to expressing non-recursive formulas for 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

which in our situation equates to the limiting recurrence relation (or generating function convolution, or product) expanded as

Then by differentiation and rearrangement of the terms in the previous equation, we obtain that

### Consequences of Euler's proofEdit

By Euler's proof for explained above and the extension of his method by elementary symmetric polynomials in the previous subsection, we can conclude that is *always* a rational multiple of . Thus compared to the relatively unknown, or at least unexplored up to this point, properties of the odd-indexed zeta constants, including Apéry's constant , we can conclude much more about this class of zeta constants. In particular, since and integer powers of it are transcendental, we can conclude at this point that is irrational, and more precisely, transcendental for all .

## The Riemann zeta functionEdit

The Riemann zeta function *ζ*(*s*) is one of the most significant functions in mathematics because of its relationship to the distribution of the prime numbers. The zeta function is defined for any complex number *s* with real part greater than 1 by the following formula:

Taking *s* = 2, we see that *ζ*(2) is equal to the sum of the reciprocals of the squares of all positive integers:

Convergence can be proven by the integral test, or by the following inequality:

This gives us the upper bound 2, and because the infinite sum contains no negative terms, it must converge to a value strictly between 0 and 2. It can be shown that *ζ*(*s*) has a simple expression in terms of the Bernoulli numbers whenever *s* is a positive even integer. With *s* = 2*n*:^{[8]}

## A rigorous proof using Euler's formula and L'Hôpital's ruleEdit

The function can be defined as the infinite product:

The infinite product is analytic, so taking the natural logarithm of both sides and differentiating yields

After dividing the equation by and regrouping one gets

We make a change of variables ( ):

Euler's formula can be used to deduce that

Then

Now we take the limit as approaches zero and use L'Hôpital's rule thrice:

## A rigorous proof using Fourier seriesEdit

Use Parseval's identity (applied to the function *f*(*x*) = *x*) to obtain

where

for *n* ≠ 0, and *c*_{0} = 0. Thus,

and

Therefore,

as required.

## Another rigorous proof using Parseval's identityEdit

Given a complete orthonormal basis in the space of L2 periodic functions over (i.e., the subspace of square-integrable functions which are also periodic), denoted by , Parseval's identity tells us that

where is defined in terms of the inner product on this Hilbert space given by

We can consider the orthonormal basis on this space defined by such that . Then if we take , we can compute both that

by elementary calculus and integration by parts, respectively. Finally, by Parseval's identity stated in the form above, we obtain that

### Generalizations and recurrence relationsEdit

Note that by considering higher-order powers of we can use integration by parts to extend this method to enumerating formulas for when . In particular, suppose we let

so that integration by parts yields the recurrence relation that

Then by applying Parseval's identity as we did for the first case above along with the linearity of the inner product yields that

## Cauchy's proofEdit

While most proofs use results from advanced mathematics, such as Fourier analysis, complex analysis, and multivariable calculus, the following does not even require single-variable calculus (although a single limit is taken at the end).

For a proof using the residue theorem, see the linked article.

### History of this proofEdit

The proof goes back to Augustin Louis Cauchy (Cours d'Analyse, 1821, Note VIII). In 1954, this proof appeared in the book of Akiva and Isaak Yaglom "Nonelementary Problems in an Elementary Exposition". Later, in 1982, it appeared in the journal *Eureka*, attributed to John Scholes, but Scholes claims he learned the proof from Peter Swinnerton-Dyer, and in any case he maintains the proof was "common knowledge at Cambridge in the late 1960s".

### The proofEdit

The main idea behind the proof is to bound the partial (finite) sums

between two expressions, each of which will tend to π^{2}/6 as *m* approaches infinity. The two expressions are derived from identities involving the cotangent and cosecant functions. These identities are in turn derived from de Moivre's formula, and we now turn to establishing these identities.

Let *x* be a real number with 0 < *x* < π/2, and let *n* be a positive odd integer. Then from de Moivre's formula and the definition of the cotangent function, we have

From the binomial theorem, we have

Combining the two equations and equating imaginary parts gives the identity

We take this identity, fix a positive integer *m*, set *n* = 2*m* + 1, and consider *x _{r}* =

*r*π/2

*m*+ 1 for

*r*= 1, 2, ...,

*m*. Then

*nx*is a multiple of π and therefore sin(

_{r}*nx*) = 0. So,

_{r}for every *r* = 1, 2, ..., *m*. The values *x _{r}* =

*x*

_{1},

*x*

_{2}, ...,

*x*are distinct numbers in the interval 0 <

_{m}*x*< π/2. Since the function cot

_{r}^{2}

*x*is one-to-one on this interval, the numbers

*t*= cot

_{r}^{2}

*x*are distinct for

_{r}*r*= 1, 2, ...,

*m*. By the above equation, these

*m*numbers are the roots of the

*m*th degree polynomial

By Vieta's formulas we can calculate the sum of the roots directly by examining the first two coefficients of the polynomial, and this comparison shows that

Substituting the identity csc^{2} *x* = cot^{2} *x* + 1, we have

Now consider the inequality cot^{2} *x* < 1/*x*^{2} < csc^{2} *x* (illustrated geometrically above). If we add up all these inequalities for each of the numbers *x _{r}* =

*r*π/2

*m*+ 1, and if we use the two identities above, we get

Multiplying through by (π/2*m* + 1)^{2}_{}, this becomes

As *m* approaches infinity, the left and right hand expressions each approach π^{2}/6, so by the squeeze theorem,

and this completes the proof.

## Other identitiesEdit

See the special cases of the identities for the Riemann zeta function when Other notably special identities and representations of this constant appear in the sections below.

### Series representationsEdit

The following are series representations of the constant:^{[9]}

There are also BBP-type series expansions for *ζ*(2).^{[9]}

### Integral representationsEdit

The following are integral representations of ^{[10]}^{[11]}^{[12]}

### Continued fractionsEdit

In van der Poorten's classic article chronicling Apéry's proof of the irrationality of ,^{[13]} the author notes several parallels in proving the irrationality of to Apéry's proof. In particular, he documents recurrence relations for almost integer sequences converging to the constant and continued fractions for the constant. Other continued fractions for this constant include ^{[14]}

and

where and .

## See alsoEdit

## ReferencesEdit

- Weil, André (1983),
*Number Theory: An Approach Through History*, Springer-Verlag, ISBN 0-8176-3141-0. - Dunham, William (1999),
*Euler: The Master of Us All*, Mathematical Association of America, ISBN 0-88385-328-0. - Derbyshire, John (2003),
*Prime Obsession: Bernhard Riemann and the Greatest Unsolved Problem in Mathematics*, Joseph Henry Press, ISBN 0-309-08549-7. - Aigner, Martin; Ziegler, Günter M. (1998),
*Proofs from THE BOOK*, Berlin, New York: Springer-Verlag - Edwards, Harold M. (2001),
*Riemann's Zeta Function*, Dover, ISBN 0-486-41740-9.

## NotesEdit

**^**Ayoub, Raymond (1974). "Euler and the zeta function".*Amer. Math. Monthly*.**81**: 1067–86. doi:10.2307/2319041.**^**E41 – De summis serierum reciprocarum**^**Sloane, N. J. A. (ed.). "Sequence A013661".*The On-Line Encyclopedia of Integer Sequences*. OEIS Foundation.**^**A priori, since the left-hand-side is a polynomial (of infinite degree) we can write it as a product of its roots as- Then since we know from elementary calculus that , we conclude that the leading constant must satisfy .

**^**In particular, letting denote a generalized second-order harmonic number, we can easily prove by induction that as .**^**Havil, J. (2003).*Gamma: Exploring Euler's Constant*. Princeton, New Jersey: Princeton University Press. pp. 37–42 (Chapter 4). ISBN 0-691-09983-9.**^**Cf., the formulas for generalized Stirling numbers proved in: Schmidt, M. D. (2018). "Combinatorial Identities for Generalized Stirling Numbers Expanding f-Factorial Functions and the f-Harmonic Numbers".*J. Integer Seq*.**21**(Article 18.2.7).**^**Arakawa, Tsuneo; Ibukiyama, Tomoyoshi; Kaneko, Masanobu (2014).*Bernoulli Numbers and Zeta Functions*. Springer. p. 61. ISBN 978-4-431-54919-2.- ^
^{a}^{b}Weisstein, Eric W. "Riemann Zeta Function \zeta(2)".*MathWorld*. Retrieved 29 April 2018. **^**Connon, D. F. "Some series and integrals involving the Riemann zeta function, binomial coefficients and the harmonic numbers (Volume I)". arXiv:0710.4022.**^**Weisstein, Eric W. "Double Integral".*MathWorld*. Retrieved 29 April 2018.**^**Weisstein, Eric W. "Hadjicostas's Formula".*MathWorld*. Retrieved 29 April 2018.**^**van der Poorten, Alfred (1979), "A proof that Euler missed ... Apéry's proof of the irrationality of*ζ*(3)" (PDF),*The Mathematical Intelligencer*,**1**(4): 195–203, doi:10.1007/BF03028234, archived from the original (PDF) on 2011-07-06**^**"Continued fractions for Zeta(2) and Zeta(3)".*tpiezas: A COLLECTION OF ALGEBRAIC IDENTITIES*. Retrieved 29 April 2018.

## External linksEdit

- An infinite series of surprises by C. J. Sangwin
- Step by step Proof
- "Remarques sur un beau rapport entre les series des puissances tant directes que reciproques" (PDF). (348 kB), English translation with notes of Euler’s paper by Lucas Willis and Thomas J. Osler
- "How Euler did it" (PDF). (265 kB)
- "The infinite series of Euler and the Bernoulli's spice up a calculus class" (PDF). (106 kB)
- "Evaluating
*ζ*(2)" (PDF). (184 kB), Fourteen proofs compiled by Robin Chapman - Visualization of Euler's factorization of the sine function