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.
Carleson hunt maximal inequality on the torus
Statement
Assume AC. For every 1<p<infinity, ||sup_{N>=0}|S_N f|||{Lp(T)}<=C_p||f||{Lp(T)} for all complex f in Lp(T), with normalized measure.
Facts & Assumptions
The finite models are uniformly restricted weak type (q,q) for every1<q<infinity Hunt exceptional set and distribution estimates.
Restricted weak bounds at1<r<p<s<infinity give uniform strong(p,p) finite-model bounds Carleson restricted weak interpolation.
Uniform finite-model strong(p,p) bounds imply the real-line Carleson maximal bound on Schwartz input Wave packet model dominates the linearised carleson operator.
Real-line bounds on Schwartz inputs imply the symmetric partial-sum maximal bound on normalized Lp(T), including all complex inputs and the infinite supremum Carleson real line to torus transfer.
The torus convention is period one, and Period-one Fourier coefficients, partial sums, and convolution on the torus.
Assume AC The Axiom of Choice, supplying the countable-choice Fourier, maximal and Fejer interfaces used by these suppliers.
Proof
Given: An arbitrary exponent1<p<infinity and a complex class f in with the normalized measure and coefficients of F5.
Choose and s=2p, so1<r<p<s<infinity. Apply F1 at r and s, then F2. The resulting finite-model strong(p,p) constant B_p depends only on p and the fixed packet, not on the finite family or measurable selector.
F3 transfers this uniform bound to for every complex Schwartz u, with and the positive reconstruction constant defined there. No passage from weak type at the same exponent is used. Since p was arbitrary, these real-line bounds hold separately for every exponent strictly between one and infinity.
Apply F4 at the chosen p. It gives a finite constant , depending only on p and the real-line bound , such that with precisely the coefficients and normalized measure in F5. The countable supremum is measurable, and the estimate holds for the actual partial sums of every complex Lp representative class; changing the representative does not change any coefficient. The case f=0 and the cutoff N=0 are included by F4. The argument uses no p=1 or p=infinity assertion. AC is inherited exactly through F6 and its suppliers.
Depends on
Used by
Dependency tree · two levels
27 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
- Lacey, Carleson’s Theorem: Proof, Complements, Variations (standard reference, not scraped)