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 1p<, and let f:RC be one-periodic with f[0,1]Lp([0,1]). Then

σNffLp([0,1])0(N).

Facts & Assumptions

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

[L1]

The Cesaro means satisfy σNg=gFN 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 1p< (Cc(Rn) is dense in Lp(Rn) for 1p<).

Proof

technique · direct
1.1

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(xt)FN(t)dtp01g(xt)pFN(t)dt. Integrating in x over [0,1] and using one-periodicity yields σNgLp([0,1])gLp([0,1]). Applying this to gh shows σNgσNhLp([0,1])ghLp([0,1]).

L1L2algebra
1.2

If u is continuous and one-periodic, then [L3] gives supxRσNu(x)u(x)0. Hence σNuuLp([0,1])supxRσNu(x)u(x)0.

L3algebra
1.3

Let ε>0. Because fp is integrable on [0,1], choose a(0,1/6) so that 0af(x)pdx+1a1f(x)pdx<(ε/6)p. Define Fa:RC by Fa(x)=f(x) for x[a,1a] and Fa(x)=0 otherwise. Then [L4] gives gCc(R) with FagLp(R)<ε/6. Let ηa be the piecewise linear cutoff that is 0 on (,a/2][1a/2,), 1 on [a,1a], and linear on [a/2,a] and [1a,1a/2]. Put h:=ηag. Then hCc((0,1)) and, because ηa=1 on [a,1a] where Fa is supported, hFaLp(R)gFaLp(R)<ε/6. Now periodize h by u(x):=mZh(xm). 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 fuLp([0,1])fFaLp([0,1])+FahLp(R)<ε/3.

L4givenchooseconstructalgebra
2.1

Choose u as in step 1.3. Then σNffLp([0,1])σN(fu)Lp([0,1])+σNuuLp([0,1])+ufLp([0,1]). Step 1.1 bounds the first term by fuLp([0,1])<ε/3, and step 1.2 makes the middle term <ε/3 for all large N. Thus σNffLp([0,1])<ε for all large N. Since ε>0 was arbitrary, σNff in Lp([0,1]).

step 1.1step 1.2step 1.3choosealgebra

Depends on

Used by

Nothing in the library uses this result yet.

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