Alphabeta Math

The Carleson–Hunt Time–Frequency Theorem

About this page
Pipeline-generated
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.

✓ 8 results · all verified · 0 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 8 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.
1 · Prerequisites
Abstract Algebra
Combinatorics
Coxeter Groups
Fourier Analysis
Functional Analysis
Linear Algebra
Measure Theory
Real Analysis
Set Theory
Topology
2 · Logical flowchart

3 · Items

Definition

Carleson operator and measurable linearisation

Definition

Carleson tiles wave packets and tile order

Lemma

Wave packet model dominates the linearised carleson operator

Definition

Density size and tree count for carleson tiles

Lemma

Carleson density selection

Lemma

Carleson size selection

Lemma

Carleson single tree estimate

Lemma

Carleson forest summation gives restricted weak L²

Lemma

Carleson signed tree weak one one estimate

Lemma

Hunt exceptional set and distribution estimates

Lemma

Carleson restricted weak interpolation

Theorem

Carleson maximal operator is strong L²

Lemma

Carleson real line to torus transfer

Theorem

Carleson hunt maximal inequality on the torus

Sources