Different Proofs

5. Basel problem🔗

Definition5.1
Group: Basel problem. (23)
Group member previews
Preview
Theorem 5.2
Loading preview
Group member preview content is loaded from the rendered-fragment cache.
uses 0
Used by 3
Reverse dependency previews
Preview
Theorem 5.2
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

The Basel problem asserts the value of the convergent series \sum_{n \geq 1} \frac{1}{n^2} = \frac{\pi^2}{6}. The summand at n = 0 is 1 / 0 = 0 by convention.

Lean code for Definition5.1●1 definition
  • def BaselProblem : Prop
    def BaselProblem : Prop
    The **Basel problem**: `∑ 1/n² = π²/6`, where the `n = 0` term is `1 / 0 = 0` by convention. 

First proof uses Parseval's identity, applied to the function f(x) = x on (-\pi, \pi].

Theorem5.2
Group: Basel problem. (23)
Group member previews
Preview
Definition 5.1
Loading preview
Group member preview content is loaded from the rendered-fragment cache.
uses 0used by 0✓L∃∀N

\sum_{n \geq 1} \frac{1}{n^2} = \frac{\pi^2}{6}.

Lean code for Theorem5.2●1 theorem
Proof for Theorem 5.2

Let f(x) = x on the interval (-\pi, \pi], viewed as a square-integrable function on the circle \mathbb{R} / 2\pi\mathbb{Z}. Integration by parts gives its Fourier coefficients c_n; for n \neq 0 the boundary term contributes c_n = \frac{(-1)^n}{2\pi i n} \cdot 2\pi, whose squared modulus is \lvert c_n \rvert^2 = 1/n^2, while c_0 = 0 because f is odd. Hence the identity \lvert c_0 \rvert^2 = 1/0^2 = 0 makes \lvert c_n\rvert^2 = 1/n^2 hold for every integer n. Parseval's identity states \sum_{n \in \mathbb{Z}} \lvert c_n \rvert^2 = \frac{1}{2\pi} \int_{-\pi}^{\pi} \lvert f(x) \rvert^2 \, dx. The right-hand side is \frac{1}{2\pi} \int_{-\pi}^{\pi} x^2 \, dx = \frac{1}{2\pi} \cdot \frac{2\pi^3}{3} = \frac{\pi^2}{3}. The left-hand side is \sum_{n \in \mathbb{Z}} \frac{1}{n^2} = 2 \sum_{n \geq 1} \frac{1}{n^2} because the summand is even and the n = 0 term vanishes. Equating the two sides gives 2 \sum_{n \geq 1} \frac{1}{n^2} = \frac{\pi^2}{3}, hence \sum_{n \geq 1} \frac{1}{n^2} = \frac{\pi^2}{6}, the value asserted by the Basel problem Definition 5.1.

Second proof uses Cauchy's method of bounding the partial sums by evaluating a certain trigonometric polynomial at the angles \frac{k\pi}{2n+1} for k = 1, \dots, n.

Lemma5.3
Group: Basel problem. (23)
Group member previews
Preview
Definition 5.1
Loading preview
Group member preview content is loaded from the rendered-fragment cache.
uses 0used by 1✓L∃∀N

For all \theta \in \mathbb{R} and n \in \mathbb{N}, \sin((2n+1)\theta) = \sum_{j=0}^{n} (-1)^j \binom{2n+1}{2j+1} \cos^{2(n-j)}\theta \, \sin^{2j+1}\theta.

Lean code for Lemma5.3●1 theorem
  • complete
    theorem BaselProblem.Cauchy.sin_two_mul_add_one (n : ℕ) (θ : ℝ) :
      Real.sin ((2 * ↑n + 1) * θ) =
        ∑ j ∈ Finset.range (n + 1),
          (-1) ^ j * ↑((2 * n + 1).choose (2 * j + 1)) *
              Real.cos θ ^ (2 * (n - j)) *
            Real.sin θ ^ (2 * j + 1)
    theorem BaselProblem.Cauchy.sin_two_mul_add_one
      (n : ℕ) (θ : ℝ) :
      Real.sin ((2 * ↑n + 1) * θ) =
        ∑ j ∈ Finset.range (n + 1),
          (-1) ^ j *
                ↑((2 * n + 1).choose
                    (2 * j + 1)) *
              Real.cos θ ^ (2 * (n - j)) *
            Real.sin θ ^ (2 * j + 1)
    De Moivre expansion of `sin ((2n+1)θ)` as an odd polynomial in `sin θ` and `cos θ`. 
Proof for Lemma 5.3
uses 0

Since \cos\theta + i\sin\theta = e^{i\theta}, we have \sin((2n+1)\theta) = \operatorname{Im}\big((\cos\theta + i\sin\theta)^{2n+1}\big). Expanding the power by the binomial theorem and taking the imaginary part keeps exactly the terms with an odd power of i\sin\theta; reindexing those terms by j gives the stated sum.

Definition5.4
Group: Basel problem. (23)
Group member previews
Preview
Definition 5.1
Loading preview
Group member preview content is loaded from the rendered-fragment cache.
uses 0used by 1✓L∃∀N

For n \in \mathbb{N}, let P_n(t) = \sum_{j=0}^{n} (-1)^j \binom{2n+1}{2j+1} t^{n-j}. This polynomial has degree n, leading coefficient 2n+1, and coefficient of t^{n-1} equal to -\binom{2n+1}{3}.

Lean code for Definition5.4●1 definition
  • def BaselProblem.Cauchy.cotPoly (n : ℕ) : Polynomial ℝ
    def BaselProblem.Cauchy.cotPoly (n : ℕ) :
      Polynomial ℝ
    The degree-`n` polynomial whose roots are `(cot (kπ/(2n+1)))²` for `k = 1, …, n`. 
Lemma5.5
Group: Basel problem. (23)
Group member previews
Preview
Definition 5.1
Loading preview
Group member preview content is loaded from the rendered-fragment cache.
uses 0used by 1✓L∃∀N

If \sin\theta \neq 0 then P_n(\cot^2\theta)\,\sin^{2n+1}\theta = \sin((2n+1)\theta).

Lean code for Lemma5.5●1 theorem
  • complete
    theorem BaselProblem.Cauchy.cotPoly_eval (n : ℕ) (θ : ℝ) (hθ : Real.sin θ ≠ 0) :
      Polynomial.eval (Real.cot θ ^ 2) (BaselProblem.Cauchy.cotPoly n) *
          Real.sin θ ^ (2 * n + 1) =
        Real.sin ((2 * ↑n + 1) * θ)
    theorem BaselProblem.Cauchy.cotPoly_eval (n : ℕ)
      (θ : ℝ) (hθ : Real.sin θ ≠ 0) :
      Polynomial.eval (Real.cot θ ^ 2)
            (BaselProblem.Cauchy.cotPoly n) *
          Real.sin θ ^ (2 * n + 1) =
        Real.sin ((2 * ↑n + 1) * θ)
    Evaluating `cotPoly` at `(cot θ)²` recovers `sin ((2n+1)θ) / sin θ ^ (2n+1)`. 
Proof for Lemma 5.5
Proof uses 2
Proof dependency previews
Preview
Lemma 5.3
Loading preview
Proof dependency preview content is loaded from the rendered-fragment cache.

Divide the De Moivre expansion Lemma 5.3 by \sin^{2n+1}\theta. Each summand becomes (-1)^j \binom{2n+1}{2j+1} \cos^{2(n-j)}\theta / \sin^{2(n-j)}\theta = (-1)^j \binom{2n+1}{2j+1} (\cot^2\theta)^{n-j}, and the sum of these is exactly P_n(\cot^2\theta) Definition 5.4.

Lemma5.6
Group: Basel problem. (23)
Group member previews
Preview
Definition 5.1
Loading preview
Group member preview content is loaded from the rendered-fragment cache.
uses 0used by 1✓L∃∀N

For n \geq 1, \sum_{k=1}^{n} \cot^2\!\left(\frac{k\pi}{2n+1}\right) = \frac{n(2n-1)}{3}.

Lean code for Lemma5.6●1 theorem
  • complete
    theorem BaselProblem.Cauchy.cotSq_sum (n : ℕ) (hn : 1 ≤ n) :
      ∑ k ∈ Finset.Icc 1 n, Real.cot (↑k * Real.pi / (2 * ↑n + 1)) ^ 2 =
        ↑n * (2 * ↑n - 1) / 3
    theorem BaselProblem.Cauchy.cotSq_sum (n : ℕ)
      (hn : 1 ≤ n) :
      ∑ k ∈ Finset.Icc 1 n,
          Real.cot
              (↑k * Real.pi / (2 * ↑n + 1)) ^
            2 =
        ↑n * (2 * ↑n - 1) / 3
    **Cauchy's identity.** The sum of `(cot (kπ/(2n+1)))²` over `k = 1, …, n` equals `n(2n-1)/3`,
    obtained from Vieta's formula applied to `cotPoly n`. 
Proof for Lemma 5.6

For k = 1, \dots, n the angle \theta_k = \frac{k\pi}{2n+1} lies in (0, \pi/2) and satisfies \sin((2n+1)\theta_k) = \sin(k\pi) = 0 while \sin\theta_k \neq 0, so Lemma 5.5 shows each \cot^2\theta_k is a root of P_n. The n values \cot^2\theta_k are distinct, hence are exactly the roots of the degree-n polynomial P_n. By Vieta's formula their sum is the negative ratio of the two leading coefficients, \binom{2n+1}{3} / (2n+1) = \frac{n(2n-1)}{3}.

Lemma5.7
Group: Basel problem. (23)
Group member previews
Preview
Definition 5.1
Loading preview
Group member preview content is loaded from the rendered-fragment cache.
uses 0used by 1✓L∃∀N

For 0 < x < \pi/2, \cot^2 x < \frac{1}{x^2}.

Lean code for Lemma5.7●1 theorem
  • complete
    theorem BaselProblem.Cauchy.cotSq_lt_inv_sq (x : ℝ) (hx0 : 0 < x)
      (hx : x < Real.pi / 2) : Real.cot x ^ 2 < 1 / x ^ 2
    theorem BaselProblem.Cauchy.cotSq_lt_inv_sq
      (x : ℝ) (hx0 : 0 < x)
      (hx : x < Real.pi / 2) :
      Real.cot x ^ 2 < 1 / x ^ 2
    For `x ∈ (0, π/2)`, `cot²x < 1/x²`. 
Proof for Lemma 5.7
uses 0

From x < \tan x on (0, \pi/2) we get \cot x < \frac{1}{x}; both sides are positive, so squaring preserves the inequality.

Lemma5.8
Group: Basel problem. (23)
Group member previews
Preview
Definition 5.1
Loading preview
Group member preview content is loaded from the rendered-fragment cache.
uses 0used by 1✓L∃∀N

For 0 < x < \pi/2, \frac{1}{x^2} < 1 + \cot^2 x.

Lean code for Lemma5.8●1 theorem
  • complete
    theorem BaselProblem.Cauchy.inv_sq_lt_one_add_cotSq (x : ℝ) (hx0 : 0 < x)
      (hx : x < Real.pi / 2) : 1 / x ^ 2 < 1 + Real.cot x ^ 2
    theorem BaselProblem.Cauchy.inv_sq_lt_one_add_cotSq
      (x : ℝ) (hx0 : 0 < x)
      (hx : x < Real.pi / 2) :
      1 / x ^ 2 < 1 + Real.cot x ^ 2
    For `x ∈ (0, π/2)`, `1/x² < 1 + cot²x` (right half of the squeeze; `csc² = 1 + cot²`). 
Proof for Lemma 5.8
uses 0

From 0 < \sin x < x we get \frac{1}{x^2} < \frac{1}{\sin^2 x} = 1 + \cot^2 x.

Theorem5.9
Group: Basel problem. (23)
Group member previews
Preview
Definition 5.1
Loading preview
Group member preview content is loaded from the rendered-fragment cache.
uses 0used by 0✓L∃∀N

\sum_{n \geq 1} \frac{1}{n^2} = \frac{\pi^2}{6}.

Lean code for Theorem5.9●1 theorem
Proof for Theorem 5.9
Proof uses 4
Proof dependency previews
Preview
Definition 5.1
Loading preview
Proof dependency preview content is loaded from the rendered-fragment cache.

Apply the squeeze \cot^2 x < \frac{1}{x^2} < 1 + \cot^2 x (Lemma 5.7 and Lemma 5.8) at the n angles \theta_k = \frac{k\pi}{2n+1} and sum over k. Using \sum_{k=1}^n \frac{1}{\theta_k^2} = \frac{(2n+1)^2}{\pi^2} \sum_{k=1}^n \frac{1}{k^2} together with Cauchy's identity Lemma 5.6 gives \frac{n(2n-1)}{3} < \frac{(2n+1)^2}{\pi^2} \sum_{k=1}^n \frac{1}{k^2} < \frac{n(2n-1)}{3} + n. Multiplying through by \frac{\pi^2}{(2n+1)^2} sandwiches the partial sum \sum_{k=1}^n \frac{1}{k^2} between two sequences both tending to \frac{\pi^2}{6}, so by the squeeze theorem the series converges to \frac{\pi^2}{6}, the value asserted by the Basel problem Definition 5.1.

The third and fourth proofs follow Seewoo Lee's note New(?) proof of Bassel problem. Normalize the Eisenstein series of weights 2 and 4 to have constant term 1. Ramanujan's identity for the derivative of E_2, compared at the coefficients of q and q^2, then determines the normalizing constant of E_2, which is -4\pi^2/\zeta(2).

Definition5.10
Group: Basel problem. (23)
Group member previews
Preview
Definition 5.1
Loading preview
Group member preview content is loaded from the rendered-fragment cache.
uses 0
Used by 3
Reverse dependency previews
Preview
Lemma 5.11
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

For k \geq 2 let \alpha_k = \frac{(2\pi i)^k}{\zeta(k)\,(k-1)!}. In particular \alpha_2 = -\frac{4\pi^2}{\zeta(2)}, so the Basel problem is the statement \alpha_2 = -24.

Lean code for Definition5.10●1 definition
  • def BaselProblem.α (k : ℕ) : ℂ
    def BaselProblem.α (k : ℕ) : ℂ
    The normalizing constant `αₖ = (2πi)ᵏ / (ζ(k) (k - 1)!)`, so that
    `Eₖ = 1 + αₖ ∑ σₖ₋₁(n) qⁿ`. The Basel problem is the evaluation `α₂ = -24`. 
Lemma5.11
Group: Basel problem. (23)
Group member previews
Preview
Definition 5.1
Loading preview
Group member preview content is loaded from the rendered-fragment cache.
uses 0
Used by 2
Reverse dependency previews
Preview
Lemma 5.14
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

With q = e^{2\pi i z}, the normalized Eisenstein series E_2 = G_2 / (2\zeta(2)) has the q-expansion E_2 = 1 + \alpha_2 \sum_{n \geq 1} \sigma_1(n) q^n.

Lean code for Lemma5.11●1 theorem
  • theorem BaselProblem.hasSum_E2 (τ : UpperHalfPlane) :
      HasSum
        (fun m ↦
          (if m = 0 then 1
            else BaselProblem.α 2 * ↑((ArithmeticFunction.sigma 1) m)) •
            Function.Periodic.qParam 1 ↑τ ^ m)
        (EisensteinSeries.E2 τ)
    theorem BaselProblem.hasSum_E2
      (τ : UpperHalfPlane) :
      HasSum
        (fun m ↦
          (if m = 0 then 1
            else
              BaselProblem.α 2 *
                ↑((ArithmeticFunction.sigma 1)
                    m)) •
            Function.Periodic.qParam 1 ↑τ ^ m)
        (EisensteinSeries.E2 τ)
    `E₂ = 1 + α₂ ∑ σ₁(n) qⁿ`, read off from the `q`-expansion of `G₂`. 
Proof for Lemma 5.11

Lipschitz's formula, which follows from Euler's partial fraction expansion of \pi \cot \pi z, gives G_2 = 2\zeta(2) + 2(2\pi i)^2 \sum_{n \geq 1} \sigma_1(n) q^n with \zeta(2) left unevaluated Definition 5.10; divide by 2\zeta(2).

Lemma5.12
Group: Basel problem. (23)
Group member previews
Preview
Definition 5.1
Loading preview
Group member preview content is loaded from the rendered-fragment cache.
uses 0
Used by 2
Reverse dependency previews
Preview
Lemma 5.14
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

The normalized Eisenstein series of weight 4 has the q-expansion E_4 = 1 + \alpha_4 \sum_{n \geq 1} \sigma_3(n) q^n.

Lean code for Lemma5.12●1 theorem
  • theorem BaselProblem.hasSum_E₄ (τ : UpperHalfPlane) :
      HasSum
        (fun m ↦
          (if m = 0 then 1
            else BaselProblem.α 4 * ↑((ArithmeticFunction.sigma 3) m)) •
            Function.Periodic.qParam 1 ↑τ ^ m)
        (ModularForm.E₄ τ)
    theorem BaselProblem.hasSum_E₄
      (τ : UpperHalfPlane) :
      HasSum
        (fun m ↦
          (if m = 0 then 1
            else
              BaselProblem.α 4 *
                ↑((ArithmeticFunction.sigma 3)
                    m)) •
            Function.Periodic.qParam 1 ↑τ ^ m)
        (ModularForm.E₄ τ)
    `E₄ = 1 + α₄ ∑ σ₃(n) qⁿ`. 
Proof for Lemma 5.12

This is the q-expansion of E_4 = G_4 / (2\zeta(4)), again with \zeta(4) left unevaluated Definition 5.10.

Lemma5.13
Group: Basel problem. (23)
Group member previews
Preview
Definition 5.1
Loading preview
Group member preview content is loaded from the rendered-fragment cache.
uses 0used by 1✓L∃∀N

If f = \sum_{m \geq 0} c_m q^m on the upper half-plane, then D f = \sum_{m \geq 0} m\,c_m q^m, where D = \frac{1}{2\pi i} \frac{d}{dz} = q \frac{d}{dq}.

Lean code for Lemma5.13●1 theorem
  • theorem Derivative.hasSum_normalizedDerivOfComplex_of_hasSum
      {f : UpperHalfPlane → ℂ} {h : ℝ} {c : ℕ → ℂ} (hh : 0 < h)
      (hf :
        ∀ (τ : UpperHalfPlane),
          HasSum (fun m ↦ c m • Function.Periodic.qParam h ↑τ ^ m) (f τ))
      (τ : UpperHalfPlane) :
      HasSum (fun m ↦ (↑m / ↑h * c m) • Function.Periodic.qParam h ↑τ ^ m)
        (Derivative.normalizedDerivOfComplex f τ)
    theorem Derivative.hasSum_normalizedDerivOfComplex_of_hasSum
      {f : UpperHalfPlane → ℂ} {h : ℝ}
      {c : ℕ → ℂ} (hh : 0 < h)
      (hf :
        ∀ (τ : UpperHalfPlane),
          HasSum
            (fun m ↦
              c m •
                Function.Periodic.qParam h
                    ↑τ ^
                  m)
            (f τ))
      (τ : UpperHalfPlane) :
      HasSum
        (fun m ↦
          (↑m / ↑h * c m) •
            Function.Periodic.qParam h ↑τ ^ m)
        (Derivative.normalizedDerivOfComplex f
          τ)
    The `q`-series of `D f` is obtained by differentiating the `q`-series of `f` term by term:
    `D (∑ cₘ qᵐ) = ∑ (m / h) cₘ qᵐ`. 
Proof for Lemma 5.13
uses 0

A power series can be differentiated term by term inside its disc of convergence, and D q^m = m q^m.

Lemma5.14
Group: Basel problem. (23)
Group member previews
Preview
Definition 5.1
Loading preview
Group member preview content is loaded from the rendered-fragment cache.
uses 0
Used by 2
Reverse dependency previews
Preview
Theorem 5.16
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

If D E_2 = \kappa (E_2^2 - E_4) for a constant \kappa, then \alpha_2 = \kappa (2\alpha_2 - \alpha_4) and 6\alpha_2 = \kappa (6\alpha_2 + \alpha_2^2 - 9\alpha_4).

Lean code for Lemma5.14●1 theorem
  • theorem BaselProblem.coeff_relations {κ : ℂ}
      (h :
        Derivative.normalizedDerivOfComplex EisensteinSeries.E2 =
          κ • (EisensteinSeries.E2 ^ 2 - ⇑ModularForm.E₄)) :
      BaselProblem.α 2 = κ * (2 * BaselProblem.α 2 - BaselProblem.α 4) ∧
        6 * BaselProblem.α 2 =
          κ *
            (6 * BaselProblem.α 2 + BaselProblem.α 2 ^ 2 -
              9 * BaselProblem.α 4)
    theorem BaselProblem.coeff_relations {κ : ℂ}
      (h :
        Derivative.normalizedDerivOfComplex
            EisensteinSeries.E2 =
          κ •
            (EisensteinSeries.E2 ^ 2 -
              ⇑ModularForm.E₄)) :
      BaselProblem.α 2 =
          κ *
            (2 * BaselProblem.α 2 -
              BaselProblem.α 4) ∧
        6 * BaselProblem.α 2 =
          κ *
            (6 * BaselProblem.α 2 +
                BaselProblem.α 2 ^ 2 -
              9 * BaselProblem.α 4)
    **Comparing coefficients.** If `D E₂ = κ (E₂² - E₄)`, then the coefficients of `q` and `q²`
    give `α₂ = κ (2α₂ - α₄)` and `6α₂ = κ (6α₂ + α₂² - 9α₄)`. 
Proof for Lemma 5.14
Proof uses 3
Proof dependency previews
Preview
Lemma 5.11
Loading preview
Proof dependency preview content is loaded from the rendered-fragment cache.

By Lemma 5.11, Lemma 5.12 and Lemma 5.13, the coefficients of q and q^2 are \alpha_2 and 6\alpha_2 in D E_2, 2\alpha_2 and 6\alpha_2 + \alpha_2^2 in E_2^2, and \alpha_4 and 9\alpha_4 in E_4, since \sigma_1(2) = 3 and \sigma_3(2) = 9. A convergent q-series determines its coefficients, so they agree on both sides.

Lemma5.15
Group: Basel problem. (23)
Group member previews
Preview
Definition 5.1
Loading preview
Group member preview content is loaded from the rendered-fragment cache.
uses 0
Used by 2
Reverse dependency previews
Preview
Theorem 5.16
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

If \alpha_2 = -24, then \sum_{n \geq 1} \frac{1}{n^2} = \frac{\pi^2}{6}.

Lean code for Lemma5.15●1 theorem
  • theorem BaselProblem.baselProblem_of_α_two (h : BaselProblem.α 2 = -24) :
      BaselProblem
    theorem BaselProblem.baselProblem_of_α_two
      (h : BaselProblem.α 2 = -24) :
      BaselProblem
    The Basel problem is the evaluation `α₂ = -24`, since `α₂ = (2πi)² / ζ(2) = -4π² / ζ(2)`. 
Proof for Lemma 5.15
Proof uses 2
Proof dependency previews
Preview
Definition 5.1
Loading preview
Proof dependency preview content is loaded from the rendered-fragment cache.

\alpha_2 = -\frac{4\pi^2}{\zeta(2)} = -24 says \zeta(2) = \frac{\pi^2}{6} Definition 5.10, and \zeta(2) = \sum_{n \geq 1} \frac{1}{n^2} Definition 5.1.

Theorem5.16
Group: Basel problem. (23)
Group member previews
Preview
Definition 5.1
Loading preview
Group member preview content is loaded from the rendered-fragment cache.
uses 0used by 0✓L∃∀N

\sum_{n \geq 1} \frac{1}{n^2} = \frac{\pi^2}{6}.

Lean code for Theorem5.16●1 theorem
Proof for Theorem 5.16
Proof uses 2
Proof dependency previews
Preview
Lemma 5.14
Loading preview
Proof dependency preview content is loaded from the rendered-fragment cache.

Take Ramanujan's identity D E_2 = \frac{E_2^2 - E_4}{12} from mathlib. By Lemma 5.14 with \kappa = \frac{1}{12}, 12\alpha_2 = 2\alpha_2 - \alpha_4 and 72\alpha_2 = 6\alpha_2 + \alpha_2^2 - 9\alpha_4, so \alpha_4 = -10\alpha_2 and \alpha_2 (\alpha_2 + 24) = 0. As \alpha_2 \neq 0, \alpha_2 = -24 Lemma 5.15. This proof is not independent of mathlib's evaluation of \zeta(2): mathlib proves Ramanujan's identity using \zeta(2) = \frac{\pi^2}{6}, and the identity with the constant \frac{1}{12} is in fact equivalent to it, by the computation just made.

The fourth proof removes this circularity. Without the value of \zeta(2), the argument by modularity gives Ramanujan's identity with \frac{1}{12} replaced by \kappa = \frac{\zeta(2)}{2\pi^2}. Its one input from the theory of modular forms, that cusp forms of weight 4 vanish, rests on the transformation of the Dedekind eta function, which is proved here from the pentagonal number theorem and Poisson summation.

Lemma5.17
Group: Basel problem. (23)
Group member previews
Preview
Definition 5.1
Loading preview
Group member preview content is loaded from the rendered-fragment cache.
uses 0
Used by 2
Reverse dependency previews
Preview
Lemma 5.18
Loading preview
Reverse dependency preview content is loaded from the rendered-fragment cache.
✓L∃∀N

For \operatorname{Im} z > 0, \eta(z) = q^{1/24} \prod_{n \geq 1} (1 - q^n) = \sum_{k \in \mathbb{Z}} (-1)^k e^{\pi i z (6k - 1)^2 / 12}.

Lean code for Lemma5.17●1 theorem
  • theorem BaselProblem.RamanujanUnnormalized.hasSum_eta {z : ℂ} (hz : 0 < z.im) :
      HasSum
        (fun k ↦
          (-1) ^ k *
            Complex.exp (↑Real.pi * Complex.I * z * (6 * ↑k - 1) ^ 2 / 12))
        (ModularForm.eta z)
    theorem BaselProblem.RamanujanUnnormalized.hasSum_eta
      {z : ℂ} (hz : 0 < z.im) :
      HasSum
        (fun k ↦
          (-1) ^ k *
            Complex.exp
              (↑Real.pi * Complex.I * z *
                  (6 * ↑k - 1) ^ 2 /
                12))
        (ModularForm.eta z)
    **Euler's pentagonal number theorem** for `η`:
    `η(z) = ∑ₖ (-1)ᵏ exp (πiz (6k - 1)² / 12)`. 
Proof for Lemma 5.17
uses 0

This is Euler's pentagonal number theorem \prod_{n \geq 1} (1 - q^n) = \sum_{k \in \mathbb{Z}} (-1)^k q^{k (3k - 1) / 2}, together with \frac{1}{24} + \frac{k (3k - 1)}{2} = \frac{(6k - 1)^2}{24}.

Lemma5.18
Group: Basel problem. (23)
Group member previews
Preview
Definition 5.1
Loading preview
Group member preview content is loaded from the rendered-fragment cache.
uses 0used by 1✓L∃∀N

For \operatorname{Im} z > 0, \eta(z) = (-3iz)^{-1/2} \sum_{n \in \mathbb{Z}} e^{-\pi i (2n - 1) / 6}\, e^{\pi i (-1/z) (2n - 1)^2 / 12}.

Lean code for Lemma5.18●1 theorem
  • theorem BaselProblem.RamanujanUnnormalized.eta_eq_tsum {z : ℂ} (hz : 0 < z.im) :
      ModularForm.eta z =
        1 / (-3 * Complex.I * z) ^ (1 / 2) *
          ∑' (n : ℤ),
            Complex.exp (-↑Real.pi * Complex.I * (2 * ↑n - 1) / 6) *
              Complex.exp
                (↑Real.pi * Complex.I * (-1 / z) * (2 * ↑n - 1) ^ 2 / 12)
    theorem BaselProblem.RamanujanUnnormalized.eta_eq_tsum
      {z : ℂ} (hz : 0 < z.im) :
      ModularForm.eta z =
        1 / (-3 * Complex.I * z) ^ (1 / 2) *
          ∑' (n : ℤ),
            Complex.exp
                (-↑Real.pi * Complex.I *
                    (2 * ↑n - 1) /
                  6) *
              Complex.exp
                (↑Real.pi * Complex.I *
                      (-1 / z) *
                    (2 * ↑n - 1) ^ 2 /
                  12)
    **Poisson summation** applied to the pentagonal series: the Gaussian `k ↦ exp (3πizk²)` has
    Fourier transform `ξ ↦ (-3iz)^{-1/2} exp (πi (-1/z) ξ² / 3)`, and the outcome is
    `η(z) = (-3iz)^{-1/2} ∑ₙ exp (-πi (2n - 1) / 6) exp (πi (-1/z) (2n - 1)² / 12)`. 
Proof for Lemma 5.18

Write the series of Lemma 5.17 as e^{\pi i z / 12} \sum_k e^{-\pi a k^2 + 2\pi b k} with a = -3iz and b = \frac{i (1 - z)}{2}, and apply Poisson summation to this Gaussian: \sum_k e^{-\pi a k^2 + 2\pi b k} = a^{-1/2} \sum_n e^{-\pi (n + ib)^2 / a}. Expanding the square, the factor e^{\pi i z / 12} cancels.

Lemma5.19
Group: Basel problem. (23)
Group member previews
Preview
Definition 5.1
Loading preview
Group member preview content is loaded from the rendered-fragment cache.
uses 0used by 1✓L∃∀N

For \operatorname{Im} w > 0, \sum_{n \in \mathbb{Z}} e^{-\pi i (2n - 1) / 6}\, e^{\pi i w (2n - 1)^2 / 12} = \sqrt{3}\,\eta(w).

Lean code for Lemma5.19●1 theorem
  • theorem BaselProblem.RamanujanUnnormalized.tsum_twisted {w : ℂ}
      (hw : 0 < w.im) :
      ∑' (n : ℤ),
          Complex.exp (-↑Real.pi * Complex.I * (2 * ↑n - 1) / 6) *
            Complex.exp (↑Real.pi * Complex.I * w * (2 * ↑n - 1) ^ 2 / 12) =
        ↑√3 * ModularForm.eta w
    theorem BaselProblem.RamanujanUnnormalized.tsum_twisted
      {w : ℂ} (hw : 0 < w.im) :
      ∑' (n : ℤ),
          Complex.exp
              (-↑Real.pi * Complex.I *
                  (2 * ↑n - 1) /
                6) *
            Complex.exp
              (↑Real.pi * Complex.I * w *
                  (2 * ↑n - 1) ^ 2 /
                12) =
        ↑√3 * ModularForm.eta w
    The twisted series of `eta_eq_tsum` is `√3 η`: split `n` modulo `3`; the classes `3j` and
    `3j + 1` both give the pentagonal series of `η` (the second after `j ↦ -j`), with factors
    `exp (± πi/6)` adding up to `2 cos (π/6) = √3`, and the class `3j + 2` cancels under
    `j ↦ -1 - j`. 
Proof for Lemma 5.19

Split n modulo 3. The classes n = 3j and n = 3j + 1 contribute e^{\pi i / 6} and e^{-\pi i / 6} times the series of Lemma 5.17 (the second after j \mapsto -j), and these factors add up to 2 \cos \frac{\pi}{6} = \sqrt{3}. The class n = 3j + 2 contributes a series that changes sign under j \mapsto -1 - j, so it vanishes.

Lemma5.20
Group: Basel problem. (23)
Group member previews
Preview
Definition 5.1
Loading preview
Group member preview content is loaded from the rendered-fragment cache.
uses 0used by 1✓L∃∀N

For \operatorname{Im} z > 0, \eta(-1/z)^{24} = z^{12}\,\eta(z)^{24}. Hence \Delta = \eta^{24} is a cusp form of weight 12 for \mathrm{SL}_2(\mathbb{Z}).

Lean code for Lemma5.20●1 theorem
  • theorem BaselProblem.RamanujanUnnormalized.eta_neg_one_div_pow {z : ℂ}
      (hz : 0 < z.im) :
      ModularForm.eta (-1 / z) ^ 24 = z ^ 12 * ModularForm.eta z ^ 24
    theorem BaselProblem.RamanujanUnnormalized.eta_neg_one_div_pow
      {z : ℂ} (hz : 0 < z.im) :
      ModularForm.eta (-1 / z) ^ 24 =
        z ^ 12 * ModularForm.eta z ^ 24
    **The transformation of `η²⁴`**: `η(-1/z)²⁴ = z¹² η(z)²⁴`. Raising `η = (-iz)^{-1/2} η(-1/z)`
    to the `24`th power removes the square root. 
Proof for Lemma 5.20
Proof uses 2
Proof dependency previews
Preview
Lemma 5.18
Loading preview
Proof dependency preview content is loaded from the rendered-fragment cache.

By Lemma 5.18 and Lemma 5.19 at w = -1/z, \eta(z) = \sqrt{3}\,(-3iz)^{-1/2}\,\eta(-1/z). The 24th power removes the square root: \eta(z)^{24} = 3^{12} (-3iz)^{-12} \eta(-1/z)^{24} = z^{-12} \eta(-1/z)^{24}. Invariance under z \mapsto z + 1 and vanishing at i\infty are visible from the product.

Lemma5.21
Group: Basel problem. (23)
Group member previews
Preview
Definition 5.1
Loading preview
Group member preview content is loaded from the rendered-fragment cache.
uses 0used by 1✓L∃∀N

A cusp form of weight k < 12 for \mathrm{SL}_2(\mathbb{Z}) is zero.

Lean code for Lemma5.21●1 theorem
  • theorem BaselProblem.RamanujanUnnormalized.cuspForm_eq_zero {k : ℤ}
      (hk : k < 12)
      (f : CuspForm (Matrix.SpecialLinearGroup.mapGL ℝ).range k) : f = 0
    theorem BaselProblem.RamanujanUnnormalized.cuspForm_eq_zero
      {k : ℤ} (hk : k < 12)
      (f :
        CuspForm
          (Matrix.SpecialLinearGroup.mapGL
              ℝ).range
          k) :
      f = 0
    Cusp forms of weight `k < 12` vanish: dividing by `Δ` lands in negative weight. 
Proof for Lemma 5.21

\Delta vanishes nowhere on the upper half-plane and has a simple zero at the cusp, so dividing a cusp form of weight k by \Delta Lemma 5.20 gives a modular form of weight k - 12 < 0, which is zero.

Lemma5.22
Group: Basel problem. (23)
Group member previews
Preview
Definition 5.1
Loading preview
Group member preview content is loaded from the rendered-fragment cache.
uses 0used by 1✓L∃∀N

With \kappa = \frac{\zeta(2)}{2\pi^2}, the function D E_2 - \kappa E_2^2 transforms like a modular form of weight 4 under \mathrm{SL}_2(\mathbb{Z}).

Lean code for Lemma5.22●1 theorem
  • theorem BaselProblem.RamanujanUnnormalized.slash_invariant
      (γ : Matrix.SpecialLinearGroup (Fin 2) ℤ) :
      SlashAction.map 4 γ
          (Derivative.normalizedDerivOfComplex EisensteinSeries.E2 -
            BaselProblem.RamanujanUnnormalized.κ •
              EisensteinSeries.E2 ^ 2) =
        Derivative.normalizedDerivOfComplex EisensteinSeries.E2 -
          BaselProblem.RamanujanUnnormalized.κ • EisensteinSeries.E2 ^ 2
    theorem BaselProblem.RamanujanUnnormalized.slash_invariant
      (γ :
        Matrix.SpecialLinearGroup (Fin 2) ℤ) :
      SlashAction.map 4 γ
          (Derivative.normalizedDerivOfComplex
              EisensteinSeries.E2 -
            BaselProblem.RamanujanUnnormalized.κ •
              EisensteinSeries.E2 ^ 2) =
        Derivative.normalizedDerivOfComplex
            EisensteinSeries.E2 -
          BaselProblem.RamanujanUnnormalized.κ •
            EisensteinSeries.E2 ^ 2
    `D E₂ - κ E₂²` is invariant under the weight-`4` slash action of `SL(2, ℤ)`: the defects of
    `D E₂` and of `E₂²` cancel exactly because `κ` is `ζ(2) / (2π²)`. 
Proof for Lemma 5.22
uses 0

For \gamma \in \mathrm{SL}_2(\mathbb{Z}) with bottom row (c, d), the transformation law of G_2 gives (cz + d)^{-2} E_2(\gamma z) = E_2(z) - \frac{2\pi i c}{2\zeta(2) (cz + d)}. Differentiating, the defects of D E_2 and of \kappa E_2^2 cancel exactly when \kappa \cdot \frac{(2\pi i)^2}{2\zeta(2)} = -1, that is, when \kappa = \frac{\zeta(2)}{2\pi^2}.

Lemma5.23
Group: Basel problem. (23)
Group member previews
Preview
Definition 5.1
Loading preview
Group member preview content is loaded from the rendered-fragment cache.
uses 0used by 1✓L∃∀N

D E_2 = \frac{\zeta(2)}{2\pi^2} (E_2^2 - E_4).

Lean code for Lemma5.23●1 theorem
  • theorem BaselProblem.RamanujanUnnormalized.normalizedDerivOfComplex_E2 :
      Derivative.normalizedDerivOfComplex EisensteinSeries.E2 =
        BaselProblem.RamanujanUnnormalized.κ •
          (EisensteinSeries.E2 ^ 2 - ⇑ModularForm.E₄)
    theorem BaselProblem.RamanujanUnnormalized.normalizedDerivOfComplex_E2 :
      Derivative.normalizedDerivOfComplex
          EisensteinSeries.E2 =
        BaselProblem.RamanujanUnnormalized.κ •
          (EisensteinSeries.E2 ^ 2 -
            ⇑ModularForm.E₄)
    **Ramanujan's identity, unnormalized**: `D E₂ = (ζ(2) / (2π²)) (E₂² - E₄)`. The cusp form
    `ramanujanCuspForm` has weight `4 < 12`, so it vanishes. 
Proof for Lemma 5.23
Proof uses 4
Proof dependency previews
Preview
Lemma 5.11
Loading preview
Proof dependency preview content is loaded from the rendered-fragment cache.

By Lemma 5.22, D E_2 - \kappa (E_2^2 - E_4) is modular of weight 4. It is holomorphic, and it tends to 0 - \kappa (1 - 1) = 0 at i\infty by Lemma 5.11 and Lemma 5.12. So it is a cusp form of weight 4, and it is zero by Lemma 5.21.

Theorem5.24
Group: Basel problem. (23)
Group member previews
Preview
Definition 5.1
Loading preview
Group member preview content is loaded from the rendered-fragment cache.
uses 0used by 0✓L∃∀N

\sum_{n \geq 1} \frac{1}{n^2} = \frac{\pi^2}{6}.

Lean code for Theorem5.24●1 theorem
Proof for Theorem 5.24
Proof uses 3
Proof dependency previews
Preview
Lemma 5.14
Loading preview
Proof dependency preview content is loaded from the rendered-fragment cache.

By Lemma 5.23 and Lemma 5.14 with \kappa = \frac{\zeta(2)}{2\pi^2}, \alpha_2 = \kappa (2\alpha_2 - \alpha_4) and 6\alpha_2 = \kappa (6\alpha_2 + \alpha_2^2 - 9\alpha_4), which are the note's equations with \frac{1}{12} replaced by \kappa. Since \kappa \alpha_2 = -2, multiplying both by \alpha_2 and eliminating \alpha_4 gives \alpha_2 (\alpha_2 + 24) = 0, so \alpha_2 = -24 Lemma 5.15.