Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Theorem 11.45 — Parseval's identity for a complete orthonormal system

Proved
Rudin.ch11_parseval_complete

by Lucas · Sep 13, 2026 · Mathlib 0df444a (Lean v4.33.1)

analysisfourier-analysismeasure-theory

Let {φn}\{\varphi_n\}{φn​} be a complete orthonormal system in L2(μ)\mathscr{L}^2(\mu)L2(μ) and let cn=∫fφn dμc_n = \int f\varphi_n\,d\mucn​=∫fφn​dμ be the Fourier coefficients of f∈L2(μ)f \in \mathscr{L}^2(\mu)f∈L2(μ). Then ∑ncn2=∫f2 dμ\sum_n c_n^2 = \int f^2\,d\mu∑n​cn2​=∫f2dμ; the Fourier series of fff converges to fff in the mean.

Preamble
import Mathlib
import Definitions.Def_Rudin_ch11_L2

open Filter Topology MeasureTheory
Formal statement
namespace Rudin

/-- Rudin, Theorem 11.45: if `{φₙ}` is a complete orthonormal set in `ℒ²(μ)` and `cₙ` are the
Fourier coefficients of `f ∈ ℒ²(μ)`, then `∑ cₙ² = ∫ f² dμ` (Parseval's identity). -/
theorem ch11_parseval_complete {X : Type*} [MeasurableSpace X] (μ : Measure X) (φ : ℕ → X → ℝ)
    (hmem : ∀ n, MemL2 μ (φ n))
    (horth : ∀ m n, m ≠ n → (∫ x, φ m x * φ n x ∂μ) = 0)
    (hnorm : ∀ n, (∫ x, (φ n x) ^ 2 ∂μ) = 1)
    (hcomplete : ∀ g : X → ℝ, MemL2 μ g → (∀ n, (∫ x, g x * φ n x ∂μ) = 0) → L2Norm μ g = 0)
    (f : X → ℝ) (hf : MemL2 μ f) (c : ℕ → ℝ) (hc : ∀ n, c n = ∫ x, f x * φ n x ∂μ) :
    Tendsto (fun N => ∑ n ∈ Finset.range N, (c n) ^ 2) atTop (𝓝 (∫ x, (f x) ^ 2 ∂μ)) := by sorry

end Rudin
Source
Walter Rudin, Principles of Mathematical Analysis, 3rd edition, McGraw-Hill, 1976, Chapter 11, p. 331, Theorems 11.43 and 11.45
Read-back

What the Lean code literally says, in plain math · Aristotle (Harmonic)

Let XXX be a measurable space with measure μ\muμ and let φ0,φ1,⋯:X→R\varphi_0,\varphi_1,\dots : X \to \mathbb{R}φ0​,φ1​,⋯:X→R satisfy:

  • each φn\varphi_nφn​ lies in L2(μ)\mathcal{L}^2(\mu)L2(μ) (measurable with integrable square);
  • orthogonality: ∫Xφmφn dμ=0\int_X \varphi_m \varphi_n \, d\mu = 0∫X​φm​φn​dμ=0 whenever m≠nm \ne nm=n;
  • normalization: ∫Xφn2 dμ=1\int_X \varphi_n^2 \, d\mu = 1∫X​φn2​dμ=1 for every nnn;
  • completeness: for every g∈L2(μ)g \in \mathcal{L}^2(\mu)g∈L2(μ), if ∫Xg φn dμ=0\int_X g\,\varphi_n \, d\mu = 0∫X​gφn​dμ=0 for all nnn, then ∥g∥2=0\lVert g \rVert_2 = 0∥g∥2​=0 (the norm vanishes; ggg itself need not be the zero function).

Let f∈L2(μ)f \in \mathcal{L}^2(\mu)f∈L2(μ) and let c:N→Rc : \mathbb{N}\to\mathbb{R}c:N→R be defined by the hypothesis cn=∫Xf φn dμc_n = \int_X f\,\varphi_n\,d\mucn​=∫X​fφn​dμ for every nnn. Then

∑n=0N−1cn2  ⟶  ∫Xf2 dμ(N→∞),\sum_{n=0}^{N-1} c_n^{2} \;\longrightarrow\; \int_X f^2 \, d\mu \qquad (N \to \infty),n=0∑N−1​cn2​⟶∫X​f2dμ(N→∞),

i.e. the partial sums of the squares of the Fourier coefficients converge to the integral of f2f^2f2.

The partial sum over n<Nn < Nn<N omits the term cNc_NcN​; the limit is asserted for the ordered partial sums.

Human review
  • Endorsed by Shuze Chen · Sep 13, 2026

  • Endorsed by Lucas · Sep 13, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, licensed under Apache 2.0.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTermsJoin SlackJoin Zulip© 2026 Prove2Me