Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

The Fejér kernel has integral one

Proved
Fejer.fejerKernel_integral_eq_one

by Elsie66 · Sep 7, 2026 · Mathlib 0df444a (Lean v4.33.1)

fourier-seriesharmonic-analysis

12π∫−ππFN(θ) dθ=1\frac{1}{2\pi}\int_{-\pi}^{\pi} F_N(\theta)\,d\theta = 12π1​∫−ππ​FN​(θ)dθ=1 for every NNN.

Formal statement
import Mathlib
import Definitions.Def_Fejer_fejerKernel

namespace Fejer

open MeasureTheory

/-- **The Fejér kernel has integral `1` over one period.** -/
theorem fejerKernel_integral_eq_one (N : ℕ) :
    (1 / (2 * Real.pi)) * ∫ θ in (-Real.pi)..Real.pi, fejerKernel N θ = 1 := by
  sorry

end Fejer
Source
L. Fejér, "Untersuchungen über Fouriersche Reihen," Math. Ann. 58 (1904); E. M. Stein & R. Shakarchi, Fourier Analysis: An Introduction, Ch. 2, §5.
Read-back

What the Lean code literally says, in plain math · claude-sonnet-5

For every natural number NNN (universally quantified as an argument to the theorem), the claim is that

12π∫−ππfejerKernel⁡(N,θ) dθ=1,\frac{1}{2\pi}\int_{-\pi}^{\pi} \operatorname{fejerKernel}(N,\theta)\,d\theta = 1,2π1​∫−ππ​fejerKernel(N,θ)dθ=1,

where fejerKernel⁡(N,θ)=∑n=−NN(1−∣n∣N+1)cos⁡(nθ)\operatorname{fejerKernel}(N,\theta) = \sum_{n=-N}^{N} \left(1 - \frac{|n|}{N+1}\right)\cos(n\theta)fejerKernel(N,θ)=∑n=−NN​(1−N+1∣n∣​)cos(nθ), a sum over 2N+12N+12N+1 integer terms. At N=0N=0N=0: the sum has the single term n=0n=0n=0, giving fejerKernel⁡(0,θ)=1\operatorname{fejerKernel}(0,\theta) = 1fejerKernel(0,θ)=1 identically, so the claimed identity reduces to 12π∫−ππ1 dθ=1\frac{1}{2\pi}\int_{-\pi}^{\pi} 1\,d\theta = 12π1​∫−ππ​1dθ=1. No other hypotheses are imposed on NNN (in particular NNN is not assumed positive), and the equality asserted is exact equality of real numbers, not a limit or an inequality.

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

  • Endorsed by Elsie66 · Sep 7, 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.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactJoin Slack© 2026 Prove2Me