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 in L^p for 1 <= p < infinity

Statement

Assume the Axiom of Countable Choice.

Let 1≤p<∞, and let f:R→C be one-periodic with f∣[0,1]∈Lp([0,1]). Then

∥σNf−f∥Lp([0,1])⟶0(N→∞).

Facts & Assumptions

Given: The Axiom of Countable Choice, an exponent 1≤p<∞, and a one-periodic function f with f∣[0,1]∈Lp([0,1]).

[L1]

The Cesaro means satisfy σNg=g∗FN for every one-periodic integrable g (Cesaro and Abel means of a Fourier series).

[L2]

The Fejer kernels are nonnegative and have integral 1 (The Fejer kernel is a positive approximate identity).

[L3]

Fejer means of continuous one-periodic functions converge uniformly (Fejer means converge uniformly for continuous periodic functions).

[L4]

Assuming the Axiom of Countable Choice, Cc(R) is dense in Lp(R) for 1≤p<∞ (Cc(Rn) is dense in Lp(Rn) for 1≤p<∞).

Proof

technique · direct
1.1L1L2algebra

Let g be any one-periodic member of Lp([0,1]). By [L1] and the positivity and unit mass from [L2], Jensen's inequality gives ∣σNg(x)∣p=∣∫01g(x−t)FN(t) dt∣p≤∫01∣g(x−t)∣pFN(t) dt. Integrating in x over [0,1] and using one-periodicity yields ∥σNg∥Lp([0,1])≤∥g∥Lp([0,1]). Applying this to g−h shows ∥σNg−σNh∥Lp([0,1])≤∥g−h∥Lp([0,1]).

1.2L3algebra

If u is continuous and one-periodic, then [L3] gives sup⁡x∈R∣σNu(x)−u(x)∣→0. Hence ∥σNu−u∥Lp([0,1])≤sup⁡x∈R∣σNu(x)−u(x)∣→0.

1.3L4givenchooseconstructalgebra

Let ε>0. Because ∣f∣p is integrable on [0,1], choose a∈(0,1/6) so that ∫0a∣f(x)∣p dx+∫1−a1∣f(x)∣p dx<(ε/6)p. Define Fa:R→C by Fa(x)=f(x) for x∈[a,1−a] and Fa(x)=0 otherwise. Then [L4] gives g∈Cc(R) with ∥Fa−g∥Lp(R)<ε/6. Let ηa be the piecewise linear cutoff that is 0 on (−∞,a/2]∪[1−a/2,∞), 1 on [a,1−a], and linear on [a/2,a] and [1−a,1−a/2]. Put h:=ηag. Then h∈Cc((0,1)) and, because ηa=1 on [a,1−a] where Fa is supported, ∥h−Fa∥Lp(R)≤∥g−Fa∥Lp(R)<ε/6. Now periodize h by u(x):=∑m∈Zh(x−m). Since supp⁡(h) is a compact subset of (0,1), at most one summand is nonzero at each x, so u is continuous and one-periodic. On [0,1] only the m=0 summand can contribute, hence u=h there. Therefore ∥f−u∥Lp([0,1])≤∥f−Fa∥Lp([0,1])+∥Fa−h∥Lp(R)<ε/3.

2.1step 1.1step 1.2step 1.3choosealgebra∎

Choose u as in step 1.3. Then ∥σNf−f∥Lp([0,1])≤∥σN(f−u)∥Lp([0,1])+∥σNu−u∥Lp([0,1])+∥u−f∥Lp([0,1]). Step 1.1 bounds the first term by ∥f−u∥Lp([0,1])<ε/3, and step 1.2 makes the middle term <ε/3 for all large N. Thus ∥σNf−f∥Lp([0,1])<ε for all large N. Since ε>0 was arbitrary, σNf→f in Lp([0,1]).

Depends on

Used by

Dependency tree · two levels

10 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