Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck pass
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<∞, ∥sup⁡N≥0∣SNf∣∥Lp(T)≤Cp∥f∥Lp(T) for all complex f in Lp(T), with normalized measure.

Facts & Assumptions

[F1]

The finite models are uniformly restricted weak type (q,q) for every 1<q<∞ Hunt exceptional set and distribution estimates.

[F2]

Restricted weak bounds at 1<r<p<s<∞ give uniform strong (p,p) finite-model bounds Carleson restricted weak interpolation.

[F3]

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.

[F4]

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.

[F5]

The torus convention is period one, f^(k)=∫01f(t)e−2πiktdt and SNf=∑∣k∣≤Nf^(k)e2πikx Period-one Fourier coefficients, partial sums, and convolution on the torus.

[F6]

Assume AC The Axiom of Choice, supplying the countable-choice Fourier, maximal and Fejer interfaces used by these suppliers.

Proof

Given: An arbitrary exponent 1<p<∞ and a complex class f in Lp(T) with the normalized measure and coefficients of F5.

1.1F1F2given

Choose r=(p+1)/2 and s=2p, so 1<r<p<s<∞. Apply F1 at r and s, then F2. The resulting finite-model strong (p,p) constant Bp depends only on p and the fixed packet, not on the finite family or measurable selector.

2.1F3step 1.1

F3 transfers this uniform bound to ∥CRu∥p≤Dp∥u∥p for every complex Schwartz u, with Dp=κ−1Bp<∞ 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.

3.1F4F5F6step 2.1∎

Apply F4 at the chosen p. It gives a finite constant Cp, depending only on p and the real-line bound Dp, such that ∥sup⁡N≥0∣SNf∣∥Lp(T)≤Cp∥f∥Lp(T) 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=∞ assertion. AC is inherited exactly through F6 and its suppliers.

Depends on

Used by

Dependency tree · two levels

32 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