Alphabeta Math
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.

✓ 6 results · all verified · 5 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 1 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Fejer and Poisson Summability of Fourier Series

1 · Prerequisites

2 · Summary

This page treats the two positive summation methods for one-period Fourier series. The route is concrete: define Cesaro and Abel means on T=R/Z, prove that the Fejer and Poisson kernels are positive approximate identities, then deduce norm convergence, uniform convergence on continuous data, and pointwise convergence at Lebesgue points and jumps. The closing comparison records the Gibbs overshoot for Dirichlet partial sums and explains why the positive kernels avoid it.

The general L1 coefficient and summability statements, including midpoint convergence and the Cesaro-to-Abel comparison, assume Countable Choice. The Lp convergence proofs inherit that premise through integration and density. The kernel identities and continuous-data arguments have the explicit choice-free Riemann-integral routes stated in their items.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicableverified 2026-09-23 (gpt-6-sol)Open item page →

Cesaro and Abel means of a Fourier series

Definition

The continuous kernel Pr below is defined by its uniformly convergent series without a choice premise. For the means of an arbitrary integrable function f, assume the Axiom of Countable Choice, as in Period-one Fourier coefficients, partial sums, and convolution on the torus, and let f be integrable on one period. For a Riemann-integrable one-periodic representative, the coefficient and kernel integrals in the formulas below may instead be ordinary Riemann integrals; these formulas then need no choice premise and agree with their Lebesgue versions when Countable Choice is assumed.

For N≥0, the Cesaro mean (or Fejer mean) of order N of the Fourier series of f is

σNf(x):=1N+1∑j=0NSjf(x).

Because Dirichlet and Fejer kernels defines FN(t)=1N+1∑j=0NDj(t), and Period-one Fourier coefficients, partial sums, and convolution on the torus defines convolution and partial sums, one has

σNf=f∗FN.

For 0≤r<1, the series

Pr(t):=∑k∈Zr∣k∣ek(t)

converges absolutely and uniformly on T, because ∑k∈Z∣r∣k∣ek(t)∣=∑k∈Zr∣k∣<∞. The Abel mean of the Fourier series of f is

Arf(x):=∑k∈Zr∣k∣f^(k)ek(x).

Because ∣f^(k)∣≤∫01∣f(t)∣ dt, this series also converges absolutely and uniformly in x. Therefore termwise integration against the absolutely convergent kernel series gives

Arf=f∗Pr.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-05Open item page →

The Fejer kernel is a positive approximate identity

Statement

For every N≥0, the Fejer kernel satisfies

FN(t)=1N+1∣∑j=0Nej(t)∣2.

Hence, for t∉Z,

FN(t)=1N+1(sin⁡((N+1)πt)sin⁡(πt))2,

so FN(t)≥0 for all t, ∫01FN(t) dt=1, and for every δ∈(0,1/2],

∫δ1−δFN(t) dt≤1(N+1)sin⁡2(πδ).

In particular,

∫δ1−δFN(t) dt⟶0(N→∞).

Facts & Assumptions

Given: An integer N≥0 and a real δ∈(0,1/2].

[L1]

The Fejer kernel is FN(t)=1N+1∑m=0NDm(t), where Dm(t)=∑∣k∣≤mek(t) and ∫01Dm(t) dt=1 (Dirichlet and Fejer kernels).

Proof

technique · direct
1.1L1algebra

Expanding the average in [L1] gives ∑m=0NDm(t)=∑m=0N∑∣k∣≤mek(t)=∑∣k∣≤N(N+1−∣k∣)ek(t). On the other hand, ∣∑j=0Nej(t)∣2=∑j=0N∑ℓ=0Nej−ℓ(t)=∑∣k∣≤N(N+1−∣k∣)ek(t). Therefore FN(t)=1N+1∣∑j=0Nej(t)∣2.

2.1L1step 1.1algebra

If t∉Z, the finite geometric-series formula gives ∑j=0Nej(t)=∑j=0Ne2πijt=eπiNtsin⁡((N+1)πt)sin⁡(πt), so step 1.1 yields the displayed square formula. This proves FN(t)≥0 for every t∉Z, and at integers the same formula extends by continuity to FN(0)=N+1. Also [L1] gives ∫01FN(t) dt=1N+1∑m=0N∫01Dm(t) dt=1.

3.1step 2.1algebra∎

For t∈[δ,1−δ], one has ∣sin⁡(πt)∣≥sin⁡(πδ). Using step 2.1 and ∣sin⁡((N+1)πt)∣≤1 therefore gives FN(t)≤1(N+1)sin⁡2(πδ). Integrating over an interval of length at most 1 yields ∫δ1−δFN(t) dt≤1(N+1)sin⁡2(πδ)→0.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-05Open item page →

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]).

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-05Open item page →

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.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-05Open item page →

Fejer means converge at Lebesgue points

Statement

Assume the Axiom of Countable Choice.

Let f:R→C be one-periodic with f∣[0,1]∈L1([0,1]). If x∈R is a Lebesgue point of f, then

σNf(x)⟶f(x)(N→∞).

In particular, σNf(x)→f(x) for almost every x.

Facts & Assumptions

Given: The Axiom of Countable Choice, a one-periodic function f with f∣[0,1]∈L1([0,1]), and a Lebesgue point x of f.

[L1]

The Cesaro means satisfy σNf=f∗FN (Cesaro and Abel means of a Fourier series).

[L2]

The Fejer kernels are nonnegative, have integral 1, and obey the square formula and tail estimate from The Fejer kernel is a positive approximate identity.

[L3]

At a Lebesgue point, lim⁡r→0+12r∫−rr∣f(x−t)−f(x)∣ dt=0 in the one-dimensional case of Lebesgue points and the Lebesgue set of an Lloc1 class.

[L4]

Assuming the Axiom of Countable Choice, almost every point is a Lebesgue point (Almost every point is a Lebesgue point of a locally integrable function).

Proof

technique · direct
1.1L3chooseconstructalgebra

Let ε>0. By [L3], choose δ∈(0,1/2] so that ∫−hh∣f(x−t)−f(x)∣ dt<ε4h(0<h≤δ). For 0<h≤δ, put G(h):=∫0h(∣f(x+t)−f(x)∣+∣f(x−t)−f(x)∣) dt. Then G(h)<εh/4 for 0<h≤δ.

2.1L1L2step 1.1algebra

Using [L1], pair the intervals [0,1/2] and [1/2,1] exactly as in the Dirichlet symmetric-difference formula. This gives ∣σNf(x)−f(x)∣≤∫01/2(∣f(x+t)−f(x)∣+∣f(x−t)−f(x)∣)FN(t) dt. Set aN:=min⁡(δ,(N+1)−1). Since step 1.1 gives G(aN)<εaN/4 and the square formula in [L2] yields FN(t)≤N+1, the interval (0,aN) contributes at most ε/4. If aN<(δ), then for t∈[aN,δ] one has sin⁡(πt)≥2t, so [L2] gives FN(t)≤14(N+1)t2. Integration by parts with G′(t) equal almost everywhere to the displayed integrand therefore gives ∫aNδG′(t)t2 dt=G(δ)δ2−G(aN)aN2+2∫aNδG(t)t3 dt≤3ε4aN, so the interval [aN,δ] contributes at most 3ε/16. Consequently ∫0δ(∣f(x+t)−f(x)∣+∣f(x−t)−f(x)∣)FN(t) dt≤7ε16 for every N.

3.1L2step 2.1choosealgebra

On [δ,1/2], the integrand is integrable and [L2] gives sup⁡t∈[δ,1−δ]FN(t)→0. Hence ∫δ1/2(∣f(x+t)−f(x)∣+∣f(x−t)−f(x)∣)FN(t) dt→0. Choose N0 so large that this far contribution is <9ε/16 for all N≥N0. Then step 2.1 yields ∣σNf(x)−f(x)∣<ε(N≥N0). Thus σNf(x)→f(x).

4.1L4step 3.1∎

The first claim holds at every Lebesgue point by step 3.1. Applying [L4] therefore gives σNf(x)→f(x) for almost every x.

LemmaStatement: Literature-sourcedProof: AI-adaptedverified 2026-09-23 (gpt-6-sol)Open item page →

The Poisson kernel on the circle is a positive approximate identity

Statement

For 0≤r<1, let

Pr(t):=∑k∈Zr∣k∣ek(t).

Then

Pr(t)=1−r21−2rcos⁡(2πt)+r2.

Hence Pr(t)≥0 for every t, ∫01Pr(t) dt=1, and for every δ∈(0,1/2],

sup⁡t∈[δ,1−δ]Pr(t)⟶0(r↑1).

In particular,

∫δ1−δPr(t) dt⟶0(r↑1).

Facts & Assumptions

Given: A parameter r with 0≤r<1 and a real δ∈(0,1/2].

[L1]

The Poisson kernel Pr and the characters ek(t)=e2πikt are defined in Cesaro and Abel means of a Fourier series and Period-one Fourier coefficients, partial sums, and convolution on the torus. Their uniformly convergent series and the Riemann integral of the continuous kernel are choice-free; the Abel mean of a general L1 function in the first definition assumes Countable Choice.

Proof

technique · direct
1.1L1algebra

Let z=e2πit. By [L1], Pr(t)=1+∑k=1∞rkzk+∑k=1∞rkz−k. Both geometric series converge absolutely, so Pr(t)=1+rz1−rz+rz−11−rz−1=1−r2(1−rz)(1−rz−1). Since z+z−1=2cos⁡(2πt), this is exactly Pr(t)=1−r21−2rcos⁡(2πt)+r2.

2.1L1step 1.1algebra

Step 1.1 shows Pr(t)≥0 because 1−2rcos⁡(2πt)+r2=(1−r)2+2r(1−cos⁡(2πt))≥0, and the numerator is positive for r<1. Uniform convergence permits termwise ordinary Riemann integration of the defining series. Every nonconstant character has Riemann integral zero on a period, so ∫01Pr(t) dt=1.

3.1step 1.1algebra∎

The limit only concerns r↑1, so it is enough to consider r∈[1/2,1). If t∈[δ,1−δ], then 1−2rcos⁡(2πt)+r2=(1−r)2+4rsin⁡2(πt)≥2sin⁡2(πδ). Therefore step 1.1 gives Pr(t)≤1−r22sin⁡2(πδ). As r↑1, the right-hand side tends to 0, so the displayed supremum tends to 0. Multiplying that supremum bound by the interval length at most 1 gives the same limit for the tail integral.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-05Open item page →

Abel means converge in L^p, uniformly, and at Lebesgue points

Statement

Assume the Axiom of Countable Choice.

Let f:R→C be one-periodic with f∣[0,1]∈L1([0,1]).

  1. If 1≤p<∞ and f∣[0,1]∈Lp([0,1]), then ∥Arf−f∥Lp([0,1])⟶0(r↑1).
  2. If f is continuous, then sup⁡x∈R∣Arf(x)−f(x)∣⟶0(r↑1).
  3. If x is a Lebesgue point of f, then Arf(x)⟶f(x)(r↑1).

In particular, Arf(x)→f(x) for almost every x.

Facts & Assumptions

Given: The Axiom of Countable Choice and a one-periodic function f with f∣[0,1]∈L1([0,1]).

[L1]

The Abel means satisfy Arf=f∗Pr, so Arf(x)=∫01f(x−t)Pr(t) dt for every x and every 0≤r<1 (Cesaro and Abel means of a Fourier series).

[L2]

The Poisson kernels are nonnegative, have integral 1, and their mass on [δ,1−δ] tends to 0 as r↑1 (The Poisson kernel on the circle is a positive approximate identity).

[L3]

At a Lebesgue point, lim⁡h→0+12h∫−hh∣f(x−t)−f(x)∣ dt=0 (Lebesgue points and the Lebesgue set of an Lloc1 class).

[L4]

Assuming the Axiom of Countable Choice, almost every point is a Lebesgue point (Almost every point is a Lebesgue point of a locally integrable function).

[L5]

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 one-periodic and in Lp([0,1]) for some 1≤p<∞. Using [L1] and the positivity and unit mass in [L2], Jensen's inequality gives ∣Arg(x)∣p≤∫01∣g(x−t)∣pPr(t) dt. Integrating in x over [0,1] shows ∥Arg∥Lp([0,1])≤∥g∥Lp([0,1]), and hence ∥Arg−Arh∥Lp([0,1])≤∥g−h∥Lp([0,1]).

1.2L1L2givenchoosealgebra

Assume now that f is continuous, and let ε>0. Uniform continuity modulo 1 gives δ∈(0,1/2] such that ∣f(x−t)−f(x)∣<ε/2 whenever t∈[0,δ]∪[1−δ,1]. Using [L1] and [L2] exactly as in the Fejer proof yields ∣Arf(x)−f(x)∣≤ε/2+2∥f∥∞∫δ1−δPr(t) dt. By [L2], the far term is <ε/2 for all r close enough to 1, uniformly in x. Therefore Arf→f uniformly.

1.3L1L2L3chooseconstructalgebra

Assume x is a Lebesgue point of f, and let ε>0. By [L3], choose δ∈(0,1/2] so that ∫−hh∣f(x−t)−f(x)∣ dt<ε4h(0<h≤δ). Define G(h):=∫0h(∣f(x+t)−f(x)∣+∣f(x−t)−f(x)∣) dt, so G(h)<εh/4 for 0<h≤δ. Pairing [0,1/2] and [1/2,1] in [L1] gives ∣Arf(x)−f(x)∣≤∫01/2(∣f(x+t)−f(x)∣+∣f(x−t)−f(x)∣)Pr(t) dt. Set ar:=min⁡(δ,1−r). On (0,ar), the closed form in [L2] gives Pr(t)≤2/(1−r), so this interval contributes at most ε/2. If ar<δ and r≥1/2, then sin⁡(πt)≥2t on [ar,δ], so [L2] gives Pr(t)≤1−r216rt2≤1−r4t2. The same integration-by-parts estimate as in the Fejer proof shows that [ar,δ] contributes at most 3ε/16. Finally, [δ,1/2] contributes o(1) as r↑1 by [L2]. Hence Arf(x)→f(x).

2.1L5step 1.1step 1.2choosealgebra

Let 1≤p<∞ and assume f∣[0,1]∈Lp([0,1]). Let ε>0. Repeating the construction from the Fejer Lp theorem with [L5], one obtains a continuous one-periodic function u such that ∥f−u∥Lp([0,1])<ε/3. Then step 1.1 and the uniform convergence of step 1.2 give ∥Arf−f∥Lp([0,1])≤∥Ar(f−u)∥Lp([0,1])+∥Aru−u∥Lp([0,1])+∥u−f∥Lp([0,1])<ε for all r sufficiently close to 1. Hence Arf→f in Lp([0,1]).

3.1L4step 1.3∎

Step 1.3 proves the pointwise conclusion at every Lebesgue point, and [L4] therefore gives the almost-everywhere convergence.

TheoremStatement: Literature-sourcedProof: AI-adaptedverified 2026-09-23 (gpt-6-sol)Open item page →

Cesaro summability implies Abel summability

Statement

Assume the Axiom of Countable Choice. Let f:R→C be one-periodic with f∣[0,1]∈L1([0,1]), and let x,s∈R. If

σNf(x)⟶s(N→∞),

then

Arf(x)⟶s(r↑1).

Facts & Assumptions

Given: Countable Choice, a one-periodic integrable function f, a point x∈R, and a scalar s such that σNf(x)→s.

[L1]

The Cesaro means and Abel means are defined in Cesaro and Abel means of a Fourier series.

Proof

technique · direct
1.1L1algebra

Let SN:=SNf(x) and σN:=σNf(x). Since SN=(N+1)σN−NσN−1(N≥0, σ−1:=0), one has ∑N=0∞rNSN=(1−r)∑N=0∞(N+1)rNσN for 0≤r<1. On the other hand, the definition of Arf(x) in [L1] gives Arf(x)=(1−r)∑N=0∞rNSN=(1−r)2∑N=0∞(N+1)rNσN.

2.1step 1.1algebra

Put wN(r):=(1−r)2(N+1)rN(N≥0). These weights are nonnegative, and ∑N=0∞wN(r)=(1−r)2∑N=0∞(N+1)rN=1. Therefore step 1.1 rewrites the Abel mean as Arf(x)−s=∑N=0∞wN(r)(σN−s).

3.1step 2.1givenchoosealgebra∎

Let ε>0. Choose N0 so large that ∣σN−s∣<ε/2 for all N≥N0, and put M:=max⁡0≤N<N0∣σN−s∣. By step 2.1, ∣Arf(x)−s∣≤M∑N=0N0−1wN(r)+ε2∑N=N0∞wN(r). The tail sum is at most ε/2, and for each fixed N one has wN(r)→0 as r↑1, so the finite initial sum is <ε/(2M) for r close enough to 1 when M>0, and is already 0 when M=0. Hence ∣Arf(x)−s∣<ε for all r sufficiently close to 1. Therefore Arf(x)→s.

TheoremStatement: Literature-sourcedProof: AI-adaptedverified 2026-09-23 (gpt-6-sol)Open item page →

Fejer means converge to midpoint values at jumps

Statement

Assume the Axiom of Countable Choice. Let f:R→C be one-periodic with f∣[0,1]∈L1([0,1]). Assume the one-sided limits f(x−) and f(x+) exist at some point x. Then

σNf(x)⟶f(x−)+f(x+)2(N→∞).

Facts & Assumptions

Given: Countable Choice, a one-periodic function f with f∣[0,1]∈L1([0,1]), a point x∈R, and existing one-sided limits f(x−) and f(x+).

[L1]

The Cesaro means satisfy σNf=f∗FN (Cesaro and Abel means of a Fourier series).

[L2]

The Fejer kernels are nonnegative, have integral 1, and satisfy the tail estimate in The Fejer kernel is a positive approximate identity.

Proof

technique · direct
1.1L1L2algebra

Put m:=(f(x−)+f(x+))/2. Using [L1], split the integral over [0,1] at 1/2 and substitute u=1−t on [1/2,1]. Because FN(1−u)=FN(u), this gives σNf(x)−m=∫01/2(f(x−t)−f(x−)+f(x+t)−f(x+))FN(t) dt. Also 2∫01/2FN(t) dt=∫01FN(t) dt=1.

2.1L2step 1.1choosealgebra

Let ε>0. Choose δ∈(0,1/2] so that ∣f(x−t)−f(x−)∣<ε,∣f(x+t)−f(x+)∣<ε(0<t<δ). Then the interval (0,δ) contributes at most 2ε∫01/2FN(t) dt=ε by step 1.1. The interval [δ,1/2] contributes at most (∫01∣f(y)∣ dy+∫01∣f(y)∣ dy+∣f(x−)∣+∣f(x+)∣2)sup⁡t∈[δ,1−δ]FN(t), which tends to 0 by [L2].

3.1L2step 2.1choosealgebra∎

Choose N0 so large that the far contribution in step 2.1 is <ε for N≥N0. Then ∣σNf(x)−m∣<2ε(N≥N0). Since ε was arbitrary, σNf(x)→m.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-09-05Open item page →

Gibbs overshoot at a piecewise C^1 jump

Statement

Assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)).

Let f:R→R be one-periodic and piecewise C1 on one period. Assume x0 is a jump point of f, and write

J:=f(x0+)−f(x0−).

Then

SNf ⁣(x0+12N+1)⟶f(x0+)+J(Si⁡(π)π−12)(N→∞),

where

Si⁡(π):=∫0πsin⁡uu du.

Here the integrand is assigned its continuous-extension value 1 at u=0.

In particular, when J>0 the nearby Dirichlet partial sums overshoot the right limit by the fixed amount

J(Si⁡(π)π−12)≈0.08949 J.

Facts & Assumptions

Given: Countable Choice, a one-periodic real-valued piecewise C1 function f, a jump point x0, and the jump size J=f(x0+)−f(x0−).

[F1]

In the 2π-periodic normalization, Theorem 1.42 of Plonka--Potts--Steidl--Tasche states that if g is piecewise continuously differentiable, y0 is a jump point, and g(y0) is reset to the midpoint of its one-sided limits, then SNg ⁣(y0+2π2N+1)⟶g(y0+)+(Si⁡(π)π−12)(g(y0+)−g(y0−)).

Proof

technique · direct
1.1givenconstruct

Put m:=(f(x0+)+f(x0−))/2, and define f~(x):=m when x−x0∈Z and f~(x):=f(x) otherwise. Membership in x0+Z is invariant under integer translation, so f~ is one-periodic; on each period it is piecewise C1 and has midpoint value m at the jump represented by x0. The exceptional set x0+Z={x0+n:n∈N}∪{x0−n:n∈N} is countable and hence Lebesgue null by Every at most countable subset of Rn is Lebesgue null; in particular λ1(Q)=0. Thus f and f~ agree almost everywhere, so after multiplication by any character their integrals agree by Two integrable functions are equal almost everywhere exactly when all of their indefinite integrals agree. Hence they have the same Fourier coefficients and the same partial sums in the normalization of Period-one Fourier coefficients, partial sums, and convolution on the torus. They also have the same one-sided limits and the same jump J.

2.1F1step 1.1algebra

Apply [F1] to the 2π-periodic function g(y):=f~(y/(2π)) at y0:=2πx0. Its Fourier coefficients and partial sums correspond exactly to the period-one coefficients and partial sums of f~ under the substitution y=2πx, while the source offset 2π/(2N+1) becomes 1/(2N+1). Therefore SNf~ ⁣(x0+12N+1)⟶f(x0+)+J(Si⁡(π)π−12). By step 1.1 the same limit holds for SNf.

3.1step 2.1algebra∎

Since Si⁡(π)≈1.85194, one has Si⁡(π)π−12≈0.08949. Thus when J>0 the limiting value in step 2.1 lies above the right limit by the claimed fixed amount.

RemarkRemark: Literature-sourcedProof: Not applicableaudited 2026-09-05Open item page →

Gibbs phenomenon

Dirichlet partial sums are controlled by the oscillatory kernel DN, whose sign changes create the persistent overshoot quantified in Gibbs overshoot at a piecewise C^1 jump. By contrast, The Fejer kernel is a positive approximate identity and The Poisson kernel on the circle is a positive approximate identity show that Fejer and Poisson kernels are positive and have total mass one. Their summation methods therefore average across a jump instead of amplifying it, and the preceding convergence theorems return the midpoint value rather than a fixed overshoot.

5 · Examples, counterexamples and false statements

None yet.

Sources