Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Fejér kernel

Definition
Fejer_fejerKernel

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

fourier-seriesharmonic-analysis

The NNN-th Fejér kernel, FN(θ)=∑n=−NN(1−∣n∣N+1)cos⁡(nθ)F_N(\theta) = \sum_{n=-N}^{N} \left(1 - \frac{|n|}{N+1}\right)\cos(n\theta)FN​(θ)=∑n=−NN​(1−N+1∣n∣​)cos(nθ).

Definition code
import Mathlib

namespace Fejer

/-- The `N`-th Fejér kernel, `F_N(θ) = ∑_{n=-N}^{N} (1 - |n|/(N+1)) cos(nθ)` — the real-valued
function whose convolution against `f` computes the `N`-th Cesàro mean of `f`'s Fourier series. -/
noncomputable def fejerKernel (N : ℕ) (θ : ℝ) : ℝ :=
  ∑ n ∈ Finset.Icc (-(N : ℤ)) (N : ℤ), (1 - (|n| : ℝ) / (N + 1)) * Real.cos (n * θ)

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.
Read-back

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

For every natural number NNN and every real number θ\thetaθ, fejerKernel(N,θ)\text{fejerKernel}(N,\theta)fejerKernel(N,θ) is defined as a finite sum over the integers nnn ranging over the closed integer interval [−N,N][-N, N][−N,N] (exactly 2N+12N+12N+1 terms). For each such integer nnn, the summand is

(1−∣n∣N+1)cos⁡(nθ),\left(1 - \frac{|n|}{N+1}\right)\cos(n\theta),(1−N+1∣n∣​)cos(nθ),

where ∣n∣|n|∣n∣ is cast to a real number and N+1N+1N+1 (with NNN cast to a real number) appears in the denominator. Thus

fejerKernel(N,θ)=∑n=−NN(1−∣n∣N+1)cos⁡(nθ).\text{fejerKernel}(N,\theta) = \sum_{n=-N}^{N}\left(1 - \frac{|n|}{N+1}\right)\cos(n\theta).fejerKernel(N,θ)=n=−N∑N​(1−N+1∣n∣​)cos(nθ).

The weight 1−∣n∣N+11 - \frac{|n|}{N+1}1−N+1∣n∣​ equals 111 at n=0n=0n=0, decreases linearly in ∣n∣|n|∣n∣, and reaches its smallest value 1N+1\frac{1}{N+1}N+11​ at n=±Nn = \pm Nn=±N; since ∣n∣≤N<N+1|n| \le N < N+1∣n∣≤N<N+1 throughout the summation range, this weight is always strictly positive. No case analysis or restriction is placed on θ\thetaθ; the formula is evaluated literally at whatever real value θ\thetaθ is given, using cos⁡(nθ)\cos(n\theta)cos(nθ) for each integer nnn in range.

In the case N=0N = 0N=0: the summation range is the singleton {0}\{0\}{0}, so the sum has exactly one term, with weight 1−0=11 - 0 = 11−0=1 and cos⁡(0⋅θ)=1\cos(0\cdot\theta)=1cos(0⋅θ)=1. Hence fejerKernel(0,θ)=1\text{fejerKernel}(0,\theta) = 1fejerKernel(0,θ)=1 for every real θ\thetaθ, with no dependence on θ\thetaθ whatsoever.

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