Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)
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 real line to torus transfer

Statement

Assume AC. Uniform real-line Carleson Lp bounds for 1<p<infinity imply the symmetric Fourier partial-sum maximal Lp bound on T with normalized Haar measure.

Facts & Assumptions

[F1]

Real-line one-sided cutoffs and their maximal operator have the stated normalized Fourier integral convention on Schwartz input Carleson operator and measurable linearisation.

[F2]

The fixed nonzero Schwartz packet phi has transform psi supported in [-1/8,1/8] Carleson tiles wave packets and tile order.

[F3]

The torus is R/Z with characters ek(x)=e2πikx, coefficients integrated on [0,1], and SNf=kNf^(k)ek Period-one Fourier coefficients, partial sums, and convolution on the torus.

[F4]

Schwartz Fourier inversion holds pointwise Fourier inversion on Schwartz space.

[F5]

Under countable choice, Fejer means converge in complex Lp(T) for1<=p<infinity Fejer means converge in L^p for 1 <= p < infinity.

[F6]

Each Fejer mean is the finite average of the partial sums and hence a trigonometric polynomial Cesaro and Abel means of a Fourier series.

[F7]

Complex Hölder and Minkowski hold Complex Holder, Minkowski, and the quotient norm.

[F9]

Fubini applies to absolutely integrable functions on sigma-finite products Fubini's theorem for L^1 functions on a sigma-finite product.

[F10]

Increasing nonnegative integrands pass to the integral limit Monotone convergence for the integral.

[F11]

Assume AC The Axiom of Choice, supplying the countable choice in the Fourier and Fejer interfaces.

Proof

Given: Fix 1<p<infinity and suppose CRuLp(R)DpuLp(R) for every Schwartz u. This weaker Schwartz-input hypothesis suffices for the asserted transfer.

1.1

Let P(x)=kmake2πikx be a trigonometric polynomial. Its Fourier coefficients are a_k: the integral of e2πi(kj)t on [0,1] is one for k=j and zero otherwise, by direct integration for the nonzero integer k-j. For 0<epsilon<1 put uε(x)=ϕ(εx)P(x), a Schwartz function: the derivatives of P are bounded and the scaled phi and all its derivatives decay to every order, so the Leibniz formula proves every Schwartz seminorm finite. Direct substitution in the absolutely convergent Fourier integral gives uε^(ξ)=kmakε1ψ((ξk)/ε). The kth summand is supported in [kε/8,k+ε/8]. Thus for every integer N>=0 the interval [N1/2,N+1/2] contains exactly the entire summands with |k|<=N and misses the other ones. F4 then gives the exact identity TN+1/2uε(x)TN1/2uε(x)=ϕ(εx)SNP(x). The half-integer cutoffs avoid every endpoint frequency; no half-weight term occurs.

F1F2F3F4given
1.2

We prove the precise periodic averaging limit used below. Let w be continuous, nonnegative and bounded by C(1+x)2, and let G be continuous and one-periodic. Then εRw(εx)G(x)dx(Rw)01G(t)dt. Decomposing the line into n+[0,1) and substituting gives the left side as 01G(t)Rε(t)dt, where Rε(t)=εnZw(ε(n+t)). This rearrangement is absolute: G is bounded, w<, and F8 followed by F9 applies. These Riemann sums converge uniformly for t in [0,1] to w. To verify uniformity, partition the line into cells [ε(n+t),ε(n+t+1)). For cells meeting [-R,R], the difference between the left-endpoint sum and the integral is at most (2R+2)ωR(ε), where ωR is the modulus of continuity of w on [-R-1,R+1], and 0<epsilon<=1. For the remaining cells the sum and integral of the decay majorant are at most C/(1+R), uniformly in t and epsilon, by comparison of the monotone tails of (1+x)2 with their integrals. First choose R large and then epsilon small. The resulting uniform convergence allows integration against bounded G and proves the displayed limit.

F8F9
2.1

For every finite cutoff bound J, the identity in step 1.1 implies ϕ(εx)max0NJSNP(x)2CRuε(x). Raise to p, integrate and use the assumed real-line bound to obtain εRϕ(εx)p(max0NJSNP(x))pdx(2Dp)pεRϕ(εx)pP(x)pdx. Both periodic factors in this display are bounded and continuous.

F1step 1.1given
3.1

Apply step 1.2 with w=ϕp. Its hypotheses hold by Schwartz decay and continuity, choosing a decay exponent M with Mp>=2. Also 0<ϕp<, since phi is a nonzero continuous Schwartz function. Taking epsilon to zero in step 2.1 and dividing by this positive window integral yields max0NJSNPLp([0,1])2DpPLp([0,1]). This has normalized Haar measure exactly: the periodic averaging limit contains 01, with no interval-length factor. The constant is independent of J and the degree of P.

F2step 1.2step 2.1
4.1

For any fLp(T), normalized measure and F7 give f1fp, so its coefficients and partial sums in F3 are defined. By F5 and F6, the polynomials Pj=σjf converge to f in Lp. For each fixed J, max0NJSN(Pjf)(2J+1)Pjf1(2J+1)Pjfp0, because every Fourier coefficient difference has magnitude at most its L1 norm and every character has modulus one. Hence the finite maxima for P_j converge uniformly to the finite maximum for f. Step 3.1 and Minkowski's norm continuity give the same bound 2Dpfp for that finite maximum. Finally these nonnegative maxima increase as J tends to infinity; F10 gives supN0SNfLp(T)2DpfLp(T). Their countable supremum is measurable. The zero input and zero polynomial cases follow directly, and N=0 was included in the exact cutoff identity. Apply this argument separately to each p strictly between one and infinity. AC is inherited through F11; the approximants here are the explicitly specified Fejer means. This proves the conditional transfer without assuming that the real-line bound has already been established elsewhere.

F3F5F6F7F10F11step 3.1

Depends on

Used by

Dependency tree · two levels

54 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