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.

Carleson–Hunt maximal bound and almost-everywhere convergence — recorded theorem

Recorded theorem

On the period-one torus with normalized Haar measure, for every 1<p< there is a finite constant Cp such that

CfpCpfp(fLp(T)),

where C is Carleson maximal partial-sum operator. Consequently,

SNf(x)f(x)for almost every xT.

Carleson's original result concerns p=2; Hunt obtained the full open range. This is recorded literature, with no local proof of the maximal estimate. Laugesen's Theorem 8.7 and its omitted-proof discussion give the torus convergence statement and the required strong maximal estimate; the source's period 2π is rescaled by t=2πx with normalized measure.

The norm here is supNSNfp. Uniformly bounding the separate numbers SNfp does not supply this estimate. The endpoint p=1 is excluded.

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