Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-05
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Fejer means converge uniformly for continuous periodic functions

Statement

Let f:R→C be one-periodic and continuous. Then

sup⁡x∈R∣σNf(x)−f(x)∣⟶0(N→∞).

Facts & Assumptions

Given: A one-periodic continuous function f:R→C.

[L1]

The Cesaro means satisfy σNf=f∗FN, so σNf(x)=∫01f(x−t)FN(t) dt for every x (Cesaro and Abel means of a Fourier series).

[L2]

The Fejer kernels are nonnegative, have integral 1, and their mass on [δ,1−δ] tends to 0 for every δ∈(0,1/2] (The Fejer kernel is a positive approximate identity).

Proof

technique · direct
1.1givenchoose

Let ε>0. Because f is continuous on the compact interval [0,1] and one-periodic, it is uniformly continuous modulo 1. Choose δ∈(0,1/2] such that ∣f(x−t)−f(x)∣<ε/2 whenever x∈R and t∈[0,δ]∪[1−δ,1].

2.1L1L2step 1.1algebra

For every x∈R, subtract f(x) inside the integral from [L1]: ∣σNf(x)−f(x)∣≤∫01∣f(x−t)−f(x)∣FN(t) dt. Split the integral into the near set [0,δ]∪[1−δ,1] and the far set [δ,1−δ]. By step 1.1 and the positivity from [L2], the near part is at most ε/2. The far part is at most 2∥f∥∞∫δ1−δFN(t) dt.

3.1L2step 2.1choosealgebra∎

By [L2], choose N0 so large that 2∥f∥∞∫δ1−δFN(t) dt<ε/2 for all N≥N0. Then step 2.1 gives sup⁡x∈R∣σNf(x)−f(x)∣<ε(N≥N0). Since ε was arbitrary, the convergence is uniform.

Depends on

Used by

Dependency tree · two levels

4 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources