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.

9 results · all verified · 8 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 current on-disk Lp proofs use the library's published real-line density theorem, so the norm-convergence items inherit the same Axiom-of-Countable-Choice cost already present elsewhere in the Fourier route on current bytes.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-05Open item page →

Cesaro and Abel means of a Fourier series

Definition

Let f be integrable on one period.

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

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

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

σNf=fFN.

For 0r<1, the series

Pr(t):=kZrkek(t)

converges absolutely and uniformly on T, because kZrkek(t)=kZrk<. The Abel mean of the Fourier series of f is

Arf(x):=kZrkf^(k)ek(x).

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

Arf=fPr.

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 N0, the Fejer kernel satisfies

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

Hence, for tZ,

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)dt1(N+1)sin2(πδ).

In particular,

δ1δFN(t)dt0(N).

Facts & Assumptions

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

[L1]

The Fejer kernel is FN(t)=1N+1m=0NDm(t), where Dm(t)=kmek(t) and 01Dm(t)dt=1 (Dirichlet and Fejer kernels).

Proof

technique · direct
1.1

Expanding the average in [L1] gives m=0NDm(t)=m=0Nkmek(t)=kN(N+1k)ek(t). On the other hand, j=0Nej(t)2=j=0N=0Nej(t)=kN(N+1k)ek(t). Therefore FN(t)=1N+1j=0Nej(t)2.

L1algebra
2.1

If tZ, 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 tZ, and at integers the same formula extends by continuity to FN(0)=N+1. Also [L1] gives 01FN(t)dt=1N+1m=0N01Dm(t)dt=1.

L1step 1.1algebra
3.1

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)sin2(πδ). Integrating over an interval of length at most 1 yields δ1δFN(t)dt1(N+1)sin2(πδ)0.

step 2.1algebra
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 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
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:RC be one-periodic and continuous. Then

supxRσNf(x)f(x)0(N).

Facts & Assumptions

Given: A one-periodic continuous function f:RC.

[L1]

The Cesaro means satisfy σNf=fFN, so σNf(x)=01f(xt)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.1

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(xt)f(x)<ε/2 whenever xR and t[0,δ][1δ,1].

givenchoose
2.1

For every xR, subtract f(x) inside the integral from [L1]: σNf(x)f(x)01f(xt)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 2fδ1δFN(t)dt.

L1L2step 1.1algebra
3.1

By [L2], choose N0 so large that 2fδ1δFN(t)dt<ε/2 for all NN0. Then step 2.1 gives supxRσNf(x)f(x)<ε(NN0). Since ε was arbitrary, the convergence is uniform.

L2step 2.1choosealgebra
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:RC be one-periodic with f[0,1]L1([0,1]). If xR 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=fFN (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, limr0+12rrrf(xt)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.1

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

L3chooseconstructalgebra
2.1

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(xt)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)t2dt=G(δ)δ2G(aN)aN2+2aNδG(t)t3dt3ε4aN, so the interval [aN,δ] contributes at most 3ε/16. Consequently 0δ(f(x+t)f(x)+f(xt)f(x))FN(t)dt7ε16 for every N.

L1L2step 1.1algebra
3.1

On [δ,1/2], the integrand is integrable and [L2] gives supt[δ,1δ]FN(t)0. Hence δ1/2(f(x+t)f(x)+f(xt)f(x))FN(t)dt0. Choose N0 so large that this far contribution is <9ε/16 for all NN0. Then step 2.1 yields σNf(x)f(x)<ε(NN0). Thus σNf(x)f(x).

L2step 2.1choosealgebra
4.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.

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

The Poisson kernel on the circle is a positive approximate identity

Statement

For 0r<1, let

Pr(t):=kZrkek(t).

Then

Pr(t)=1r212rcos(2πt)+r2.

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

supt[δ,1δ]Pr(t)0(r1).

In particular,

δ1δPr(t)dt0(r1).

Facts & Assumptions

Given: A parameter r with 0r<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.

Proof

technique · direct
1.1

Let z=e2πit. By [L1], Pr(t)=1+k=1rkzk+k=1rkzk. Both geometric series converge absolutely, so Pr(t)=1+rz1rz+rz11rz1=1r2(1rz)(1rz1). Since z+z1=2cos(2πt), this is exactly Pr(t)=1r212rcos(2πt)+r2.

L1algebra
2.1

Step 1.1 shows Pr(t)0 because 12rcos(2πt)+r2=(1r)2+2r(1cos(2πt))0, and the numerator is positive for r<1. Also the constant Fourier coefficient of Pr is 1, so 01Pr(t)dt=1.

L1step 1.1algebra
3.1

The limit only concerns r1, so it is enough to consider r[1/2,1). If t[δ,1δ], then 12rcos(2πt)+r2=(1r)2+4rsin2(πt)2sin2(πδ). Therefore step 1.1 gives Pr(t)1r22sin2(πδ). As r1, 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.

step 1.1algebra
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:RC be one-periodic with f[0,1]L1([0,1]).

  1. If 1p< and f[0,1]Lp([0,1]), then ArffLp([0,1])0(r1).
  2. If f is continuous, then supxRArf(x)f(x)0(r1).
  3. If x is a Lebesgue point of f, then Arf(x)f(x)(r1).

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=fPr, so Arf(x)=01f(xt)Pr(t)dt for every x and every 0r<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 r1 (The Poisson kernel on the circle is a positive approximate identity).

[L3]

At a Lebesgue point, limh0+12hhhf(xt)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 1p< (Cc(Rn) is dense in Lp(Rn) for 1p<).

Proof

technique · direct
1.1

Let g be one-periodic and in Lp([0,1]) for some 1p<. Using [L1] and the positivity and unit mass in [L2], Jensen's inequality gives Arg(x)p01g(xt)pPr(t)dt. Integrating in x over [0,1] shows ArgLp([0,1])gLp([0,1]), and hence ArgArhLp([0,1])ghLp([0,1]).

L1L2algebra
1.2

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

L1L2givenchoosealgebra
1.3

Assume x is a Lebesgue point of f, and let ε>0. By [L3], choose δ(0,1/2] so that hhf(xt)f(x)dt<ε4h(0<hδ). Define G(h):=0h(f(x+t)f(x)+f(xt)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(xt)f(x))Pr(t)dt. Set ar:=min(δ,1r). On (0,ar), the closed form in [L2] gives Pr(t)2/(1r), so this interval contributes at most ε/2. If ar<δ and r1/2, then sin(πt)2t on [ar,δ], so [L2] gives Pr(t)1r216rt21r4t2. 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 r1 by [L2]. Hence Arf(x)f(x).

L1L2L3chooseconstructalgebra
2.1

Let 1p< 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 fuLp([0,1])<ε/3. Then step 1.1 and the uniform convergence of step 1.2 give ArffLp([0,1])Ar(fu)Lp([0,1])+AruuLp([0,1])+ufLp([0,1])<ε for all r sufficiently close to 1. Hence Arff in Lp([0,1]).

L5step 1.1step 1.2choosealgebra
3.1

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

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

Cesaro summability implies Abel summability

Statement

Let f:RC be one-periodic with f[0,1]L1([0,1]), and let x,sR. If

σNf(x)s(N),

then

Arf(x)s(r1).

Facts & Assumptions

Given: A one-periodic integrable function f, a point xR, 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.1

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

L1algebra
2.1

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

step 1.1algebra
3.1

Let ε>0. Choose N0 so large that σNs<ε/2 for all NN0, and put M:=max0N<N0σNs. By step 2.1, Arf(x)sMN=0N01wN(r)+ε2N=N0wN(r). The tail sum is at most ε/2, and for each fixed N one has wN(r)0 as r1, 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.

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

Fejer means converge to midpoint values at jumps

Statement

Let f:RC 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: A one-periodic function f with f[0,1]L1([0,1]), a point xR, and existing one-sided limits f(x) and f(x+).

[L1]

The Cesaro means satisfy σNf=fFN (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.1

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

L1L2algebra
2.1

Let ε>0. Choose δ(0,1/2] so that f(xt)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 (01f(y)dy+01f(y)dy+f(x)+f(x+)2)supt[δ,1δ]FN(t), which tends to 0 by [L2].

L2step 1.1choosealgebra
3.1

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

L2step 2.1choosealgebra
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:RR 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πsinuudu.

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.08949J.

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.1

Put m:=(f(x0+)+f(x0))/2, and define f~(x):=m when xx0Z 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:nN}{x0n:nN} 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.

givenconstruct
2.1

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.

F1step 1.1algebra
3.1

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

step 2.1algebra
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