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 · 4 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 5 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Dirichlet Kernel Localisation and Pointwise Fourier Convergence

1 · Prerequisites

2 · Summary

This page keeps the algebraic Dirichlet-kernel identities separate from the oscillatory arguments that make pointwise convergence local. The route is: period-one Fourier setup, convolution with the Dirichlet kernel, the Riemann-Lebesgue cancellation input, the symmetric-difference formula, then the localisation, Dini, and Dirichlet-Jordan criteria.

The current corpus does not yet supply the earlier Fourier-series setup page that the design originally expected, so this page carries its own period-one torus definitions and the minimal step-function density repair needed for the Riemann-Lebesgue lemma on current bytes. Because that repair presently routes through the published L1(R) density theorem, the Riemann-Lebesgue, localisation, Dini, and Dirichlet-Jordan branch on this page is stated under the Axiom of Countable Choice. The bounded-variation branch is then proved by an honest one-sided Dirichlet argument rather than by folding it into the stronger Dini hypothesis.

3 · Logical flowchart

4 · Definitions, theorems and proofs

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

Period-one Fourier coefficients, partial sums, and convolution on the torus

Definition

Write T:=R/Z and represent a function on T by a one-periodic function on R.

For k∈Z, define the k-th character ek(x):=e2πikx.

The character and finite trigonometric-polynomial clauses are choice-free. For the integral and L1 clauses below, assume the Axiom of Countable Choice, as in The one-dimensional torus and its normalized Haar integral.

If f is integrable on one period, its Fourier coefficients are

f^(k):=∫01f(t)e−2πikt dt(k∈Z).

For N≥0, the N-th Fourier partial sum of f is

SNf(x):=∑∣k∣≤Nf^(k)ek(x).

A trigonometric polynomial on T is a finite linear combination of the characters ek.

If f,g∈L1(T), their convolution is the L1(T) class defined for almost every x by

(f∗g)(x):=∫01f(x−t)g(t) dt,

where f and g are read as one-periodic representatives. More precisely, the integrand is absolutely integrable for almost every x, and the displayed formula gives an almost-everywhere-defined integrable function whose class is independent of the chosen representatives. When one factor is bounded, as for the Dirichlet kernels below, the integral exists at every x for which the other representative is integrable on one period.

Well-definedness

Put m=mT. Take Borel representatives F,G of the two L1 classes on the Borel probability space T and write F~=F∘q and G~=G∘q for their one-periodic Borel lifts. This uses only a finite selection of representatives. The map (x,t)↦[x−t] is continuous on T2: the map (x,t)↦q(x−t) on R2 is continuous and constant on fibres of the open quotient map q×q, so it descends continuously. Thus H(x,t)=F(x−t)G(t) is Borel on T2.

For every nonnegative one-periodic Borel h, the affine reflection t↦x−t preserves Lebesgue measure by A linear map T of Rn sends Lebesgue measurable sets to Lebesgue measurable sets, with λn(T[E])=∣det⁡T∣ λn(E) when T is invertible and T[E] Lebesgue null when it is not and Lebesgue outer measure, Lebesgue measurability and Lebesgue measure are unchanged by translation. It carries a half-open unit interval to another half-open unit interval; splitting the latter at its integer boundary and translating one piece by an integer, using periodicity, gives ∫01h(x−t) dt=∫01h(u) du. The endpoints are null. The same identity is translation invariance of the normalized torus integral. In particular, Tonelli on the finite product probability space gives ∫T2∣H(x,t)∣ dm(x)dm(t)=∫T∣G(t)∣(∫T∣F(x−t)∣ dm(x))dm(t)=∥F∥1∥G∥1<∞. Therefore Fubini's theorem for L^1 functions on a sigma-finite product makes t↦H(x,t) integrable for almost every x, and makes its section integral, set to zero on the measurable exceptional set, an L1 function with norm at most ∥F∥1∥G∥1.

If F=F′ and G=G′ almost everywhere, let NF,NG be their Borel discrepancy sets. For t∉NG, the x-section of the set where the two products differ lies in NF+t and is null by translation invariance. Tonelli applied to its indicator makes the difference set product-null; Fubini then shows that the two section integrals agree for almost every x. Hence the L1 class is independent of representatives. If one chosen representative is bounded, the period-translation identity bounds every section integral by the product of that bound and the other factor's finite L1 norm, proving the final pointwise-existence clause. Countable Choice supplies the torus integral and the Lebesgue reflection interface used above; Tonelli and Fubini then apply on the resulting probability space. No selection over all x is made.

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

Dirichlet and Fejer kernels

Definition

For N≥0, the Dirichlet kernel on T is

DN(t):=∑∣k∣≤Nek(t).

The Fejer kernel is the arithmetic mean

FN(t):=1N+1∑j=0NDj(t).

Equivalently,

DN(t)=1+2∑k=1Ncos⁡(2πkt),

so DN is real-valued and even. Also

∫01DN(t) dt=1,

where this is the ordinary Riemann integral of the continuous finite sum. Every nonconstant character has Riemann integral 0 over one period. Under Countable Choice it agrees with the torus Lebesgue integral in Period-one Fourier coefficients, partial sums, and convolution on the torus.

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

Fourier partial sums are Dirichlet convolutions

Statement

Assume the Axiom of Countable Choice. Let f be a one-period integrable function on R. Then for every N≥0 and every x∈R,

SNf(x)=∫01f(x−t)DN(t) dt=(f∗DN)(x).

Facts & Assumptions

Given: Countable Choice, a one-period integrable function f, an integer N≥0, and a real x.

[L1]

Fourier coefficients, Fourier partial sums, and torus convolution are defined exactly as in Period-one Fourier coefficients, partial sums, and convolution on the torus.

[L2]

The Dirichlet kernel is DN(t)=∑∣k∣≤Nek(t), where ek(t)=e2πikt (Dirichlet and Fejer kernels).

Proof

technique · direct
1.1L1L2algebra

Expanding the convolution against the finite sum [L1, L2, algebra] gives ∫01f(x−t)DN(t) dt=∑∣k∣≤N∫01f(x−t)e2πikt dt.

2.1L1step 1.1algebra

For each k, substitute u=x−t. Then ∫01f(x−t)e2πikt dt=e2πikx∫x−1xf(u)e−2πiku du. The integrand u↦f(u)e−2πiku is one-periodic, so its integral over [x−1,x] equals its integral over [0,1], namely f^(k). Therefore ∫01f(x−t)e2πikt dt=f^(k)ek(x).

3.1L1step 2.1algebra∎

Summing step 2.1 over ∣k∣≤N yields ∫01f(x−t)DN(t) dt=∑∣k∣≤Nf^(k)ek(x)=SNf(x). By [L1], the integral is also (f∗DN)(x).

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-09-04Open item page →

Closed form and size bounds for the Dirichlet kernel

Statement

For every integer N≥0,

DN(t)=1+2∑k=1Ncos⁡(2πkt).

If t∉Z, then

DN(t)=sin⁡((2N+1)πt)sin⁡(πt).

If m∈Z, then DN(m)=2N+1. In particular DN is even and

∣DN(t)∣≤2N+1(t∈R),

while for t∉Z,

∣DN(t)∣≤1∣sin⁡(πt)∣.

Facts & Assumptions

Given: An integer N≥0 and a real t.

[L1]

The Dirichlet kernel is DN(t)=∑∣k∣≤Ne2πikt (Dirichlet and Fejer kernels).

Proof

technique · direct
1.1L1algebra

Pair the terms with indices k and −k in [L1]. This gives DN(t)=1+∑k=1N(e2πikt+e−2πikt)=1+2∑k=1Ncos⁡(2πkt). Hence DN is even. If t=m∈Z, then every exponential equals 1, so DN(m)=2N+1.

1.2L1algebra

Assume t∉Z and put z=e2πit≠1. Then [L1, algebra] DN(t)=z−N∑j=02Nzj=z−N1−z2N+11−z. Rewriting numerator and denominator with half-angle factors yields DN(t)=e−πi(2N+1)t−eπi(2N+1)te−πit−eπit=sin⁡((2N+1)πt)sin⁡(πt).

2.1L1step 1.2algebra∎

The triangle inequality applied to [L1] gives ∣DN(t)∣≤2N+1 for every t. If t∉Z, step 1.2 and ∣sin⁡((2N+1)πt)∣≤1 give ∣DN(t)∣≤1∣sin⁡(πt)∣.

LemmaStatement: AI-adaptedProof: AI-generatedverified 2026-09-23 (gpt-6-sol)Open item page →

Step functions on one period have vanishing Fourier coefficients

Statement

Let s be a step function on [0,1), and extend it one-periodically to R. Then there is a constant C≥0 such that

∣s^(k)∣≤C∣k∣(k≠0).

In particular, s^(k)→0 as ∣k∣→∞.

Facts & Assumptions

Given: A one-period step function s on [0,1).

[L1]

For a step function, the displayed coefficient formula of Period-one Fourier coefficients, partial sums, and convolution on the torus is the ordinary Riemann integral of a finite piecewise-continuous function. This calculation needs no choice premise and agrees with the torus Lebesgue coefficient whenever Countable Choice is assumed.

Proof

technique · direct
1.1L1algebra

Write s=∑j=1maj1[xj−1,xj) for a partition 0=x0<⋯<xm=1. For k≠0, [L1, algebra] 1[xj−1,xj)^(k)=∫xj−1xje−2πikt dt=e−2πikxj−1−e−2πikxj2πik. Therefore ∣1[xj−1,xj)^(k)∣≤1π∣k∣.

2.1step 1.1algebra

By linearity, s^(k)=∑j=1maj1[xj−1,xj)^(k). Step 1.1 then gives ∣s^(k)∣≤1π∣k∣∑j=1m∣aj∣. Taking C:=π−1∑j=1m∣aj∣ proves the displayed bound.

3.1step 2.1algebra∎

Since C/∣k∣→0 as ∣k∣→∞, step 2.1 yields s^(k)→0.

LemmaStatement: AI-adaptedProof: AI-generatedprecheck passaudited 2026-09-04Open item page →

Step functions on one period are dense in L^1 on the torus

Statement

Assume the Axiom of Countable Choice.

Let f be integrable on one period. For every ε>0 there is a step function s on [0,1) such that

∫01∣f(t)−s(t)∣ dt<ε.

Equivalently, one-period step functions are dense in L1(T).

Facts & Assumptions

Given: The Axiom of Countable Choice, a one-period integrable function f, and a real ε>0.

[L1]

The torus conventions identify one-period integrable functions with the L1(T) objects used on this page (Period-one Fourier coefficients, partial sums, and convolution on the torus).

[L2]

Assuming the Axiom of Countable Choice, finite linear combinations of interval indicators are dense in L1(R) (Finite linear combinations of box indicators are dense in Lp(Rn) for 1≤p<∞).

Proof

technique · direct
1.1givenL2choose

Define g:R→R by g(t)=f(t) for 0≤t<1 and g(t)=0 otherwise. Then g∈L1(R). By [L2], choose a finite linear combination of interval indicators u with ∫R∣g(t)−u(t)∣ dt<ε.

2.1L1step 1.1algebra

Restrict u to [0,1) and call the restriction s. Intersecting each interval in u with [0,1) produces only finitely many subintervals, so s is a step function on [0,1). Since g=f on [0,1), ∫01∣f(t)−s(t)∣ dt=∫01∣g(t)−u(t)∣ dt≤∫R∣g(t)−u(t)∣ dt<ε.

3.1step 2.1∎

Step 2.1 is exactly the claimed density statement on one period.

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

Riemann-Lebesgue lemma for Fourier coefficients

Statement

Assume the Axiom of Countable Choice.

Let f be integrable on one period. Then

f^(k)→0as ∣k∣→∞.

Facts & Assumptions

Given: The Axiom of Countable Choice, a one-period integrable function f, and a real ε>0.

[L1]

Fourier coefficients are f^(k)=∫01f(t)e−2πikt dt (Period-one Fourier coefficients, partial sums, and convolution on the torus).

[L2]

One-period step functions have Fourier coefficients tending to 0 as ∣k∣→∞ (Step functions on one period have vanishing Fourier coefficients).

[L3]

Assuming the Axiom of Countable Choice, one-period step functions are dense in L1(T) (Step functions on one period are dense in L^1 on the torus).

Proof

technique · direct
1.1givenL3choose

By [L3], choose a one-period step function s with ∫01∣f(t)−s(t)∣ dt<ε/3.

1.2L2choose

By [L2], choose K≥1 such that ∣k∣≥K implies ∣s^(k)∣<ε/3.

2.1L1step 1.1algebra

For every integer k, [L1, algebra] ∣f^(k)−s^(k)∣≤∫01∣f(t)−s(t)∣ dt<ε/3.

3.1step 2.1step 1.2algebra

If ∣k∣≥K, then step 2.1 and step 1.2 give ∣f^(k)∣≤∣f^(k)−s^(k)∣+∣s^(k)∣<2ε3<ε.

4.1step 3.1∎

Since ε>0 was arbitrary, step 3.1 is exactly f^(k)→0 as ∣k∣→∞.

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

Symmetric difference formula for Fourier partial sums

Statement

Assume the Axiom of Countable Choice. Let f be a one-period integrable function, let x,s∈R, and let N≥0. Then

SNf(x)−s=∫01/2(f(x+t)+f(x−t)−2s)DN(t) dt.

Equivalently,

SNf(x)−s=∫01/2(f(x+t)+f(x−t)−2s)sin⁡((2N+1)πt)sin⁡(πt) dt.

Facts & Assumptions

Given: Countable Choice, a one-period integrable function f, reals x,s, and an integer N≥0.

[L1]

Fourier partial sums are Dirichlet convolutions: SNf(x)=∫01f(x−t)DN(t) dt (Fourier partial sums are Dirichlet convolutions).

[L2]

The Dirichlet kernel is even and ∫01DN(t) dt=1 (Dirichlet and Fejer kernels).

[L3]

For t∉Z, DN(t)=sin⁡((2N+1)πt)/sin⁡(πt) (Closed form and size bounds for the Dirichlet kernel).

Proof

technique · direct
1.1L1L2algebra

By [L1], SNf(x)−s=∫01(f(x−t)−s)DN(t) dt, because [L2] gives ∫01DN(t) dt=1.

2.1step 1.1L2algebra

Split the integral in step 1.1 at 1/2 and substitute u=1−t on [1/2,1]. Since f is one-periodic and DN(1−u)=DN(−u)=DN(u) by [L2], this yields SNf(x)−s=∫01/2(f(x−t)+f(x+t)−2s)DN(t) dt.

3.1step 2.1L3algebra∎

The first displayed formula is step 2.1 with the two summands reordered. Replacing DN(t) by the closed form from [L3] gives the second displayed formula.

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

Riemann localisation principle for Fourier series

Statement

Assume the Axiom of Countable Choice.

Let f and g be one-period integrable functions, and let x∈R. Assume there is δ∈(0,1/2) such that f(y)=g(y) for almost every y∈(x−δ,x+δ). Then

SNf(x)−SNg(x)→0as N→∞.

Facts & Assumptions

Given: The Axiom of Countable Choice, one-period integrable functions f,g, a real x, and a real δ with 0<δ<1/2 such that f(y)=g(y) for almost every y∈(x−δ,x+δ).

[L1]

The Dirichlet kernel satisfies DN(t)=sin⁡((2N+1)πt)/sin⁡(πt) away from the integers (Closed form and size bounds for the Dirichlet kernel).

[L2]

Assuming the Axiom of Countable Choice, Fourier coefficients of an L1(T) function tend to 0 at infinity (Riemann-Lebesgue lemma for Fourier coefficients).

[L3]

For every real s, SNh(x)−s=∫01/2(h(x+t)+h(x−t)−2s)DN(t) dt (Symmetric difference formula for Fourier partial sums).

Proof

technique · direct
1.1givenL3algebra

Apply [L3] to h:=f−g with s=0. Since h(y)=0 for almost every y∈(x−δ,x+δ), the integrand vanishes for almost every t∈(0,δ), so SNh(x)=∫δ1/2(h(x+t)+h(x−t))DN(t) dt.

2.1L1step 1.1algebra

Define a one-period function ψ on [0,1) by ψ(t):=1[δ,1/2](t) (h(x+t)+h(x−t))eiπtsin⁡(πt). Because sin⁡(πt) is bounded away from 0 on [δ,1/2] and h∈L1(T), one has ψ∈L1(T). Using [L1], step 1.1 becomes SNh(x)=Im⁡∫01ψ(t)e2πiNt dt=Im⁡ ψ^(−N).

3.1L2step 2.1algebra∎

By [L2], ψ^(−N)→0 as N→∞. Step 2.1 therefore gives SNh(x)→0. Since h=f−g, this is exactly SNf(x)−SNg(x)→0.

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

Dini pointwise convergence criterion for Fourier series

Statement

Assume the Axiom of Countable Choice.

Let f be a one-period integrable function, let x,s∈R, and assume there is δ∈(0,1/2) such that

∫0δ∣f(x+t)+f(x−t)−2s∣t dt<∞.

Then

SNf(x)→sas N→∞.

Facts & Assumptions

Given: The Axiom of Countable Choice, a one-period integrable function f, reals x,s, and a real δ with 0<δ<1/2 such that ∫0δ∣f(x+t)+f(x−t)−2s∣t dt<∞.

[L1]

For t∉Z, DN(t)=sin⁡((2N+1)πt)/sin⁡(πt) (Closed form and size bounds for the Dirichlet kernel).

[L2]

Assuming the Axiom of Countable Choice, Fourier coefficients of an L1(T) function tend to 0 at infinity (Riemann-Lebesgue lemma for Fourier coefficients).

[L3]

SNf(x)−s=∫01/2(f(x+t)+f(x−t)−2s)DN(t) dt (Symmetric difference formula for Fourier partial sums).

Proof

technique · direct
1.1L3givenalgebra

Put a(t):=f(x+t)+f(x−t)−2s. By [L3], SNf(x)−s=∫0δa(t)DN(t) dt+∫δ1/2a(t)DN(t) dt.

2.1L1L4step 1.1givenalgebra

For 0<t≤δ<1/2, one has 0<πt<π/2<2, so [L4] gives sin⁡(πt)≥πt/3. Define ψ0(t):=1(0,δ](t) a(t)eiπtsin⁡(πt). Then ∣ψ0(t)∣≤3π 1(0,δ](t)∣a(t)∣t, so the hypothesis makes ψ0∈L1(T). Using [L1], ∫0δa(t)DN(t) dt=Im⁡∫01ψ0(t)e2πiNt dt=Im⁡ ψ^0(−N).

2.2L1step 1.1algebra

Define ψ1(t):=1[δ,1/2](t) a(t)eiπtsin⁡(πt). Since sin⁡(πt) is bounded away from 0 on [δ,1/2] and a∈L1([δ,1/2]), one has ψ1∈L1(T). Again [L1] turns the second integral in step 1.1 into ∫δ1/2a(t)DN(t) dt=Im⁡ ψ^1(−N).

3.1L2step 2.1step 2.2algebra∎

By [L2], both ψ^0(−N) and ψ^1(−N) tend to 0. Steps 2.1 and 2.2 therefore make both integrals in step 1.1 tend to 0. Hence SNf(x)−s→0, or equivalently SNf(x)→s.

CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-09-04Open item page →

Local Holder regularity implies Fourier convergence at a point

Statement

Assume the Axiom of Countable Choice.

Let f be a one-period integrable function and let x∈R. Suppose there are constants C>0, α>0, and δ∈(0,1/2) such that

∣f(x+t)−f(x)∣≤Ctαand∣f(x−t)−f(x)∣≤Ctα

for every 0<t<δ. Then

SNf(x)→f(x)as N→∞.

Facts & Assumptions

Given: The Axiom of Countable Choice, a one-period integrable function f, a real x, constants C>0 and α>0, and a real δ with 0<δ<1/2 such that ∣f(x+t)−f(x)∣≤Ctαand∣f(x−t)−f(x)∣≤Ctα for every 0<t<δ.

[L1]

Assuming the Axiom of Countable Choice, if ∫0δ∣f(x+t)+f(x−t)−2s∣t dt<∞, then SNf(x)→s (Dini pointwise convergence criterion for Fourier series).

Proof

technique · direct
1.1L1givenalgebra

For 0<t<δ, the triangle inequality and the hypotheses give ∣f(x+t)+f(x−t)−2f(x)∣≤∣f(x+t)−f(x)∣+∣f(x−t)−f(x)∣≤2Ctα.

2.1step 1.1algebra

Therefore ∫0δ∣f(x+t)+f(x−t)−2f(x)∣t dt≤2C∫0δtα−1 dt=2Cαδα<∞.

3.1L1step 2.1∎

Applying [L1] with s=f(x) and using step 2.1 gives SNf(x)→f(x).

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

Bounded variation gives one-sided Dirichlet integrability

Statement

Assume the Axiom of Countable Choice.

Let 0<δ<1/2, and let u:[0,δ]→R have bounded variation. Assume that u(0)=0 and lim⁡t↓0u(t)=0. Then

∫0δu(t)sin⁡((2N+1)πt)sin⁡(πt) dt→0as N→∞.

Facts & Assumptions

Given: The Axiom of Countable Choice, a real δ with 0<δ<1/2 and a bounded-variation function u:[0,δ]→R such that u(0)=0 and lim⁡t↓0u(t)=0.

[L1]

Jordan decomposition writes u=u(0)+Pu−Nu with Pu,Nu nondecreasing, normalized by Pu(0)=Nu(0)=0, and minimal among such decompositions (Jordan decomposition for functions of bounded variation).

[L2]

The variation identity is Var⁡[0,η](u)=Pu(η)+Nu(η) for every η∈[0,δ] (The positive and negative variations are nondecreasing and give the Jordan identities).

[L3]

The Dirichlet kernel satisfies DN(t)=sin⁡((2N+1)πt)/sin⁡(πt) for t∉Z (Closed form and size bounds for the Dirichlet kernel).

[L6]

Assuming the Axiom of Countable Choice, Fourier coefficients of an L1(T) function tend to 0 at infinity (Riemann-Lebesgue lemma for Fourier coefficients).

Proof

technique · direct
1.1L1L2givencontradiction

By [L1], write u=Pu−Nu with Pu(0)=Nu(0)=0 and Pu,Nu nondecreasing. Let p:=inf⁡0<t≤δPu(t)=lim⁡t↓0Pu(t),q:=inf⁡0<t≤δNu(t)=lim⁡t↓0Nu(t). Since u(t)→0, one has p−q=0. If p=q>0, define P~(0)=N~(0)=0 and P~(t)=Pu(t)−p, N~(t)=Nu(t)−p for t>0. Then P~,N~ are again nondecreasing, nonnegative, normalized, and satisfy u=P~−N~, but P~(t)<Pu(t) for every t>0, contradicting the minimality in [L1]. Hence p=q=0, so Pu(t)→0,Nu(t)→0,Var⁡[0,t](u)=Pu(t)+Nu(t)→0 as t↓0 by [L2].

1.2L3L4L5algebra

For 0≤t≤δ, define HN(t):=∫0tDN(s) ds. Using [L3] and the change of variables y=(2N+1)πs, HN(t)=∫0(2N+1)πtsin⁡y⋅gN(y) dy, where gN(y):=1(2N+1)πsin⁡(y/(2N+1)). If (2N+1)πt≤1, then 0<y/(2N+1)≤1<2, so [L5] and ∣sin⁡y∣≤y give ∣sin⁡y gN(y)∣≤3/π on [0,(2N+1)πt], hence ∣HN(t)∣≤3/π. If (2N+1)πt>1, the same estimate controls the part on [0,1], while on [1,(2N+1)πt] the function gN is positive and decreasing because 0<y/(2N+1)≤π/2. Bonnet's theorem [L4] therefore gives a point ξ with ∫1(2N+1)πtsin⁡y gN(y) dy=gN(1)∫1ξsin⁡y dy+gN((2N+1)πt)∫ξ(2N+1)πtsin⁡y dy. The absolute value is at most 2gN(1)+2gN((2N+1)πt)≤4gN(1)≤12π by monotonicity of gN and [L5]. Thus ∣HN(t)∣≤15π(0≤t≤δ, N≥0).

2.1L2L4step 1.1step 1.2givenchoosealgebra

Fix ε>0. By step 1.1, choose η∈(0,δ) such that Var⁡[0,η](u)<πε60. Applying [L4] to the monotone functions Pu and Nu on [0,η], and using Pu(0)=Nu(0)=0, step 1.2 yields ∣∫0ηPu(t)DN(t) dt∣≤30πPu(η),∣∫0ηNu(t)DN(t) dt∣≤30πNu(η). Therefore ∣∫0ηu(t)DN(t) dt∣≤30π(Pu(η)+Nu(η))=30πVar⁡[0,η](u)<ε2.

3.1L3step 2.1algebra

On [η,δ], define ψ(t):=1[η,δ](t) u(t)eiπtsin⁡(πt). Because sin⁡(πt) is bounded away from 0 on [η,δ] and u is bounded on the compact interval [η,δ], one has ψ∈L1(T). By [L3], ∫ηδu(t)DN(t) dt=Im⁡∫01ψ(t)e2πiNt dt=Im⁡ ψ^(−N).

4.1L3L6step 2.1step 3.1choosealgebra∎

By [L6], ψ^(−N)→0. So step 3.1 gives ∫ηδu(t)DN(t) dt→0. Choose N0 such that the absolute value of this integral is below ε/2 for every N≥N0. Combining with step 2.1 shows that, for N≥N0, ∣∫0δu(t)DN(t) dt∣<ε. Since DN(t)=sin⁡((2N+1)πt)/sin⁡(πt) on (0,δ] by [L3], the stated limit follows.

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

Dirichlet-Jordan pointwise convergence

Statement

Assume the Axiom of Countable Choice.

Let f:R→R be one-periodic and of bounded variation on one period. Then for every x∈R,

SNf(x)→f(x+)+f(x−)2as N→∞.

Facts & Assumptions

Given: The Axiom of Countable Choice, a one-periodic real function f of bounded variation on one period, and a real x.

[L1]

For every real s, SNf(x)−s=∫01/2(f(x+t)+f(x−t)−2s)DN(t) dt (Symmetric difference formula for Fourier partial sums).

[L2]

Assuming the Axiom of Countable Choice, if u:[0,δ]→R is of bounded variation with u(0)=0 and u(t)→0 as t↓0, then ∫0δu(t)sin⁡((2N+1)πt)sin⁡(πt) dt→0 (Bounded variation gives one-sided Dirichlet integrability).

[L3]

A bounded-variation function has both one-sided limits at every point (A bounded-variation function has at most countably many discontinuities, all of the first kind).

[L4]

Assuming the Axiom of Countable Choice, Fourier coefficients of an L1(T) function tend to 0 at infinity (Riemann-Lebesgue lemma for Fourier coefficients).

[L5]

For t∉Z, DN(t)=sin⁡((2N+1)πt)/sin⁡(πt) (Closed form and size bounds for the Dirichlet kernel).

Proof

technique · direct
1.1L3givenchoosealgebra

By [L3], the one-sided limits f(x+) and f(x−) exist. Put s:=f(x+)+f(x−)2. Choose δ∈(0,1/2) and define, on [0,δ], u+(0):=0,u−(0):=0, u+(t):=f(x+t)−f(x+)andu−(t):=f(x−t)−f(x−)(0<t≤δ). Because translations and reflections preserve bounded variation on a compact interval, and changing a function at one point preserves bounded variation, both u+ and u− have bounded variation on [0,δ]. The cited one-sided-limit result [L3] gives u±(t)→0 as t↓0, and by construction u±(0)=0.

2.1L1step 1.1algebra

Applying [L1] with the value s from step 1.1 yields SNf(x)−s=∫0δ(u+(t)+u−(t))DN(t) dt+∫δ1/2(f(x+t)+f(x−t)−2s)DN(t) dt.

3.1L2L5step 1.1algebra

By [L2] applied to u+ and to u−, and then using [L5], ∫0δu+(t)DN(t) dt→0,∫0δu−(t)DN(t) dt→0. Hence the first integral in step 2.1 tends to 0.

3.2L4L5step 2.1algebra

Define ψ(t):=1[δ,1/2](t) (f(x+t)+f(x−t)−2s)eiπtsin⁡(πt). Since sin⁡(πt) is bounded away from 0 on [δ,1/2] and the numerator is integrable there, ψ∈L1(T). By [L5], the second integral in step 2.1 equals Im⁡∫01ψ(t)e2πiNt dt=Im⁡ ψ^(−N), so it tends to 0 by [L4].

4.1step 1.1step 2.1step 3.1step 3.2algebra∎

Steps 3.1 and 3.2 make both integrals in step 2.1 tend to 0. Therefore SNf(x)−s→0, which is exactly SNf(x)→f(x+)+f(x−)2.

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

Piecewise C^1 Fourier series converges to midpoint values

Statement

Assume the Axiom of Countable Choice.

Let f:R→R be one-periodic. Assume there is a partition 0=x0<x1<⋯<xm=1 such that, for each j, the restriction of f to (xj−1,xj) extends to a C1 function on [xj−1,xj]. Then for every x∈R,

SNf(x)→f(x+)+f(x−)2as N→∞.

Facts & Assumptions

Given: The Axiom of Countable Choice, a one-periodic real function f and a partition 0=x0<⋯<xm=1 such that each restriction f∣(xj−1,xj) extends to a C1 function on [xj−1,xj].

[L1]

Assuming the Axiom of Countable Choice, a one-periodic bounded-variation function satisfies the Dirichlet-Jordan convergence theorem (Dirichlet-Jordan pointwise convergence).

Proof

technique · direct
1.1L2givenalgebra

For each j, let fj denote the C1 extension of f∣(xj−1,xj) to [xj−1,xj]. By [L2], each fj has bounded variation on its interval. Summing those finitely many variations and adding the finitely many endpoint jumps shows that the one-period representative of f has bounded variation on [0,1], including the periodic seam between 1− and 0+.

2.1L1step 1.1∎

Apply [L1] to that one-period bounded-variation representative. It yields SNf(x)→f(x+)+f(x−)2 for every x∈R, which is the claimed midpoint-value convergence.

5 · Examples, counterexamples and false statements

None yet.

Sources