Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Teorema de Parseval: 1T∫0T∣f∣2 dt=∑n∈Z∣Cn∣2\frac{1}{T}\int_0^T |f|^2\,dt = \sum_{n\in\mathbb{Z}} |C_n|^2T1​∫0T​∣f∣2dt=∑n∈Z​∣Cn​∣2

Proved
AnaliseDeFourier.parseval

by LG · Sep 22, 2026 · Mathlib 0df444a (Lean v4.33.1)

analysisfourier-seriesharmonic-analysis

This is Parseval's theorem for Fourier series, the capstone of the book's chapter 5.

Let T>0T>0T>0 and let f:R→Cf:\mathbb{R}\to\mathbb{C}f:R→C be a continuous TTT-periodic signal. Writing ωn=2πn/T\omega_n = 2\pi n/Tωn​=2πn/T, its exponential Fourier coefficients are

Cn=1T∫0Tf(t) e−iωnt dt,n∈Z,C_n = \frac{1}{T}\int_0^T f(t)\,e^{-i\omega_n t}\,dt, \qquad n \in \mathbb{Z},Cn​=T1​∫0T​f(t)e−iωn​tdt,n∈Z,

and its average power (Definição 5.1.1) is Pf=1T∫0T∣f(t)∣2 dtP_f = \frac1T\int_0^T |f(t)|^2\,dtPf​=T1​∫0T​∣f(t)∣2dt. Then

1T∫0T∣f(t)∣2 dt  =  ∑n=−∞∞∣Cn∣2.\frac{1}{T}\int_0^{T} |f(t)|^{2}\,dt \;=\; \sum_{n=-\infty}^{\infty} |C_n|^{2}.T1​∫0T​∣f(t)∣2dt=n=−∞∑∞​∣Cn​∣2.

The average power of a periodic signal is thus the sum of the powers carried by its individual harmonics, which is the quantitative content of the frequency-domain picture and the basis of the RMS computations in the book's examples.

Formalization Note. The book states the theorem for a periodic function "representable by a Fourier series"; continuity is used here as the concrete sufficient regularity hypothesis. The right-hand side is an unordered sum over Z\mathbb{Z}Z, so no particular order of summation is presupposed; its convergence is the subject of a separate milestone.

Preamble
import Mathlib
import Definitions.Def_analise_de_fourier_core

open MeasureTheory
Formal statement
namespace AnaliseDeFourier

theorem parseval (T : ℝ) (hT : 0 < T) (f : ℝ → ℂ) (hf : Continuous f)
    (hper : Function.Periodic f T) :
    avgPower T f = ∑' n : ℤ, ‖coeffC T f n‖ ^ 2 := by sorry

end AnaliseDeFourier
Source
Esequia Sauter, Fabio Souto de Azevedo (orgs.), Analise de Fourier - Um Livro Colaborativo, UFRGS/REAMAT, 26 July 2022, https://www.ufrgs.br/reamat/TransformadasIntegrais/livro-af/main.html, Teorema 5.1.1 (Teorema de Parseval), eq. (5.9), p. 37; average power: Definicao 5.1.1, eq. (5.1), p. 36; coefficients C_n: eq. (4.8), p. 30
Read-back

What the Lean code literally says, in plain math · Aristotle (Harmonic) - NON-BLIND: same agent that authored the statements

Non-blind read-back — not independent testimony. This read-back was written by the same agent that drafted the Lean statements of this proposal, at the explicit instruction of the proposal owner. It was not produced by a blind auditor with a fresh context: its author had access to the source text, to the informal statement and to the drafting intent. It therefore cannot serve the usual purpose of a read-back — catching an unfaithful formalization by independent reading — and no reviewer should mistake it for independent testimony. A reviewer who wants that guarantee should commission a blind read-back from an auditor that has seen only the Lean code.

Let TTT be a real number with T>0T>0T>0, and let f:R→Cf:\mathbb{R}\to\mathbb{C}f:R→C be a function that is continuous on the whole real line and periodic with period TTT, meaning f(t+T)=f(t)f(t+T)=f(t)f(t+T)=f(t) for every real ttt. For an integer nnn write ωT(n)=2πn/T\omega_T(n) = 2\pi n/TωT​(n)=2πn/T and

CT(f,n)  =  1T∫0Tf(t) e−i ωT(n)t dtC_T(f,n) \;=\; \frac{1}{T}\int_0^T f(t)\,e^{-i\,\omega_T(n)t}\,dtCT​(f,n)=T1​∫0T​f(t)e−iωT​(n)tdt

(an oriented Lebesgue integral over the interval from 000 to TTT, complex-valued), and let

PT(f)  =  1T∫0T∥f(t)∥2 dtP_T(f) \;=\; \frac{1}{T}\int_0^T \lVert f(t)\rVert^{2}\,dtPT​(f)=T1​∫0T​∥f(t)∥2dt

be the corresponding real-valued quantity, with ∥⋅∥\lVert\cdot\rVert∥⋅∥ the modulus.

The statement asserts the equality of real numbers

PT(f)  =  ∑n∈Z∥CT(f,n)∥2,P_T(f) \;=\; \sum_{n \in \mathbb{Z}} \bigl\lVert C_T(f,n)\bigr\rVert^{2},PT​(f)=n∈Z∑​​CT​(f,n)​2,

where the right-hand side is the unordered sum of the family indexed by all integers, positive, negative and zero. Two features of that sum are worth making explicit: it is not a limit of symmetric partial sums ∑∣n∣≤N\sum_{|n|\le N}∑∣n∣≤N​ but the unordered sum of a family, and if the family failed to be summable the unordered sum would be 000 by convention, so in that degenerate situation the equation would assert PT(f)=0P_T(f)=0PT​(f)=0. Summability is not among the hypotheses.

The hypotheses are exactly: T>0T>0T>0; fff continuous on R\mathbb{R}R; fff periodic with period TTT. Nothing is assumed about fff being real-valued, bounded, or piecewise smooth, and no relation to the trigonometric coefficients an,bna_n,b_nan​,bn​ appears in this statement.

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

    Confirmed by the moderator at approval.

  • Endorsed by LG · Sep 24, 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, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me