Basel Problem/Proof 3

Proof
Let $x \in \left({0 \,.\,.\, \dfrac \pi 2}\right)$ and let $n$ be a non-negative integer.

Let $x_k = \dfrac {k \pi} {2n + 1}$ for $k = 1, 2, \ldots, n$.

Then:
 * $\sin \left({2n + 1}\right) x_k = 0$

So we have:


 * $\displaystyle \sum_{r \mathop = 0}^n \binom {2n + 1} {2r + 1} \left({-1}\right)^r \cot^{2 \left({n - r}\right)} x_k = 0$

for $k = 1, 2, \ldots, n$.

The numbers $x_k$ are all distinct and in the interval $\left({0 \,.\,.\, \dfrac \pi 2}\right)$.

By Shape of Cotangent Function, $\cot x$ is positive and injective in the interval $\left({0 \,.\,.\, \dfrac \pi 2}\right)$.

Therefore $\cot^2 x$ is also injective in this interval.

Hence the numbers $c_k = \cot^2 x_k$ are distinct for $k = 1, 2, \ldots, n$.

These numbers are the $n$ distinct roots of the $n$th degree polynomial:


 * $\displaystyle f \left({c}\right) := \sum_{r \mathop = 0}^n \binom {2n + 1} {2r + 1} (-1)^r c^{n - r}$

By Viète's Formulas, we can calculate the sum of the roots:


 * $\displaystyle \sum_{k \mathop = 1}^n \cot^2 x_k = \frac {\binom {2n + 1} 3} {\binom {2n + 1} 1} = \frac {2 n \left({2 n - 1}\right)} 6$

From the Difference of Squares of Cosecant and Cotangent $\cot^2 x = \csc^2 x - 1$ we can similarly deduce:


 * $\displaystyle \sum_{k \mathop = 1}^n \csc^2 x_k = \frac {2 n \left({2 n - 1}\right)} 6 + n = \frac {2 n \left({2 n + 2}\right)} 6$

By Shape of Sine Function, $\sin x$ is positive in the interval $\left({0 \,.\,.\, \dfrac \pi 2}\right)$.

So from the Tangent Inequality $\sin x < x < \tan x$ for $x \in \left({0 \,.\,.\, \dfrac \pi 2}\right)$, we can deduce that $\cot^2 x < 1 / x^2 < \csc^2 x$ in the same interval.

Summing this inequality from $x_1$ to $x_n$ gives:

or equivalently:

By Combination Theorem for Limits of Functions, the left and right hand sides tend to $\dfrac {\pi^2} 6$ as $n$ tends to infinity.

Therefore by the Squeeze Theorem:


 * $\displaystyle \zeta \left({2}\right) = \sum_{k \mathop = 1}^\infty \frac 1 {k^2} = \frac {\pi^2} 6$