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.
The Carleson–Hunt Time–Frequency Theorem: Examples
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Areas of Elementary Plane Figures
- Binary Operations, Monoids, Groups and Subgroups
- Bounded Linear Operators and Quotient Spaces
- Compactness
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Complex Lp Spaces and Test-Function Conventions
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Darboux, L'Hôpital, and Taylor's Theorem
- Density Separability and Convolution in Lᵖ
- Determinants of Matrices over a Commutative Ring
- Dirichlet Kernel Localisation and Pointwise Fourier Convergence
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Fejer and Poisson Summability of Fourier Series
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Probability and the Probabilistic Method
- Foundations of the Real Numbers for Analysis
- Fourier Transform Convolution and Approximate Identities
- Fubini and Change of Variables
- Fundamental Trigonometric Identities
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Improper and Parameter-Dependent Multiple Integrals
- Improper Integrals
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Kolmogorov’s Block Construction and Almost-Everywhere Divergence
- Lebesgue Measure on Euclidean Space
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Mixed Partials, Taylor Formulae, and Extrema
- Modes of Convergence Egorov and Lusin
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Normed and Banach Spaces
- Order, Zorn's Lemma, and the Axiom of Choice
- Outer Measure and the Caratheodory Extension Theorem
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Product Measures and the Fubini Tonelli Theorems
- Properties of the Integral and the Working FTC
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Schwartz Space and the Plancherel Theorem
- Separation Axioms: the Hierarchy
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Sigma Algebras and Borel Sets
- Simple Field Extensions and the Construction of the Complex Numbers
- Sine, Cosine, and the Definition of Pi
- Subspaces, Products, and Quotients
- Suprema and Infima
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Carleson–Hunt Time–Frequency Theorem
- The Complex Exponential and Euler's Formula
- The Derivative and the Mean Value Theorems
- The Exponential Function
- The Inverse and Implicit Function Theorems
- The Lebesgue and Riemann Integrals Compared
- The Lebesgue Integral and the Convergence Theorems
- The Logarithm and General Powers
- The Lᵖ Spaces Holder Minkowski and Riesz Fischer
- The Maximal Function and Lebesgue Differentiation
- The Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
Two explicit tiles illustrate the reversed frequency inclusion in the tile order. A second pair has equal frequency intervals and disjoint spatial intervals, and is incomparable in both directions. Half-open endpoints make each inclusion and non-inclusion unambiguous.
The numerical series displays the two summable tails that motivate balancing size and density levels. The forest lemma proves the stopping decomposition whose final sum is bounded by this identity. The endpoint remark applies the earlier Kolmogorov witness to exclude a bound on all of ; the positive Carleson–Hunt bounds concern the strict range 1<p<infinity.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
Two comparable and two incomparable carleson tiles
Example
Let and . Then . The tiles and are incomparable.
Facts & Assumptions
Given: The four explicitly specified rectangles in the example.
The finite interval and tile-order conventions are those of Carleson tiles wave packets and tile order. Only these combinatorial clauses are used; no Fourier or choice-dependent construction is used.
Proof
All four displayed intervals are half-open dyadic intervals. The area products are for s,u,v and for t. Moreover and , so by the two defining inclusions. The reverse order fails because but .
For u,v the frequency intervals agree, but neither spatial interval contains the other: and . Thus both possible order relations fail, while every tile is comparable to itself.
Steps 1.1 and 1.2 verify the claimed comparable pair and the two failures for the incomparable pair, with midpoint and endpoint membership fixed by the half-open convention.
Balancing density and size levels in the carleson sum
Example
The nonnegative two-sided series satisfies .
Facts & Assumptions
Given: The displayed explicitly indexed nonnegative series, interpreted as the supremum of its finite subsums.
Proof
For the minimum is , whereas for it is . Finite geometric cancellation therefore gives, for integers and , . In particular the index zero is counted once and contributes one.
Every finite set of integer indices lies in an interval of the above form, and all summands are nonnegative. Thus the supremum of finite subsums is bounded above by three by step 1.1. Taking in that same formula gives the lower bound three, since . The series is therefore three.
Carleson hunt does not include the lone endpoint
Statement
Assume AC as in the Kolmogorov construction. Its witness excludes a bound for the Fourier partial-sum maximal operator on all of . The proposed Carleson–Hunt theorem concerns only ; this endpoint observation does not establish any of those positive bounds.
Facts & Assumptions
Given: Normalized Haar measure on the circle and the Kolmogorov witness f.
The locally authored conclusion of Kolmogorov lone fourier series diverges almost everywhere gives with unbounded symmetric partial sums almost everywhere. The unavailable original backing was separately resolved by the owner using the complete local proof; no original-source retrieval is claimed.
The Axiom of Choice is inherited from the countable construction of that witness.
Proof
Put . Each finite partial sum is measurable, hence this countable supremum is measurable. By F1 it equals infinity outside a null set on a space of measure one. For every positive integer k, the nonnegative simple function k on that conull set is bounded above by Mf, so the definition of the nonnegative integral gives . Consequently .
Since by F1, step 1.1 contradicts every proposed finite-constant inequality for all . It also contradicts every finite weak-(1,1) constant: for all t, whereas for sufficiently large t. Thus neither assertion follows by adjoining the endpoint to the proposed positive-p range.