Alphabeta Math
Remark‡ sources checked 2026-07-26‡ not proved here
‡ Recorded, not proved here. This statement is included so the library can refer to it honestly, with a citation to the literature. It is not proved anywhere in this library: the track that would prove it has not been developed here yet.

Kolmogorov 1926: an L1 function whose Fourier series diverges everywhere

Statement

There is f∈L1(T) whose Fourier series diverges at every point: for every x∈T,

lim sup⁡N→∞∣SNf(x)∣=+∞,SNf(x)=∑∣n∣≤Nf^(n)einx.

Kolmogorov proved almost everywhere divergence in 1923 and everywhere divergence in 1926. The result is sharp in the scale of Lp spaces: by Carleson's theorem (1966) and Hunt's extension (1968), the Fourier series of a function in Lp(T) with 1<p≤∞ converges almost everywhere, so p=1 is exactly where everywhere divergence becomes possible.

Remarks

Not proved in this library. It is recorded with citations and used in no proof here.

What would prove it. The construction is a lacunary sum of concentrated kernels, and it is genuinely hard: the difficulty is in arranging the partial sums to blow up at every point simultaneously, not merely on a large set. Beyond the construction, the statement itself cannot even be made here, since it quantifies over L1(T) and uses Fourier coefficients defined by a Lebesgue integral (Lebesgue measure and the Lebesgue integral ‡).

Which page it serves. The same future Fourier series page as du Bois-Reymond: a continuous function whose Fourier series diverges at a point ‡, and any future Lp page. The two results are the boundary markers of the subject: continuity does not give pointwise convergence anywhere in particular, and L1 membership does not give it anywhere at all, while Lp for p>1 gives it almost everywhere.

Attribution. The 1923 paper in Fundamenta Mathematicae gives divergence almost everywhere, and the 1926 note in the Comptes Rendus gives it everywhere. Both are Kolmogorov's, and the everywhere result is the one recorded above; only the 1923 paper has a freely readable scan, which is the link given.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · one level

1 result within one dependency step 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