Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-09-04
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.

Riemann localisation principle for Fourier series

Statement

Assume the Axiom of Countable Choice.

Let f and g be one-period integrable functions, and let xR. 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(xt)2s)DN(t)dt (Symmetric difference formula for Fourier partial sums).

Proof

technique · direct
1.1

Apply [L3] to h:=fg 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(xt))DN(t)dt.

givenL3algebra
2.1

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

L1step 1.1algebra
3.1

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

L2step 2.1algebra

Depends on

Used by

Dependency tree · two levels

8 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