Alphabeta Math
RemarkRemark: Literature-sourcedProof: Not suppliedPipeline-generated sources checked 2026-09-07 not proved here
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.

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 almost-everywhere divergence — recorded theorem

Recorded theorem

There exists fL1(T), where T=R/Z has Haar mass one, such that

supN0SNf(x)=for almost every xT.

Equivalently, the function in Carleson maximal partial-sum operator is infinite almost everywhere for this f. Every individual partial sum is finite. The Fourier series therefore diverges almost everywhere.

This records Grafakos, Theorem 4.2.1 and the explicit conclusion (4.2.13). No local proof is supplied, and the claim is not strengthened to divergence at every point.

Source architecture

The source forms a summable weighted series of the polynomials in Kolmogorov polynomial blocks — recorded construction lemma . It chooses weights and polynomial degrees recursively. The large contribution of the current polynomial must exceed both the contribution of earlier polynomials and the tail; those two errors require separate estimates. A full-measure limsup of the good sets supplies arbitrarily large partial sums of the final integrable function. The polynomial construction and this summation argument remain external, so the linked record is a bibliographic mention rather than a logical prerequisite.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

2 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