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.

Wave packet model dominates the linearised carleson operator

Statement

Assume AC and let 1<p<. If every finite linearised tile model has strong type (p,p) bound B, uniformly in its finite family and measurable selector, then for Schwartz input CRfpκ1Bfp. If instead these finite models have a uniform weak type (p,p) bound B, then m{CRf>λ}(pκ1Bfp/λ)p(λ>0),p=p/(p1). The same conclusions hold when the hypothesis is formulated for all translated and reciprocally dilated grids. Such grid bounds already follow from the original-grid bounds by conjugating translations, modulations and dilations. The fixed reconstruction constant is κ=1log20H(t)dtt>0,H(t)=1/43/4ψ(ut)2du, where psi is the exact fixed packet transform. This transfers in particular weak L2 and every strong Lp bound needed for the real-line Carleson theorem. No pointwise bound by one unaveraged model is asserted.

Facts & Assumptions

[F1]

One-sided Schwartz Fourier cutoffs are absolutely defined, continuous in the cutoff parameter, and finite rational maxima have measurable least-index linearising selectors Carleson operator and measurable linearisation.

[F2]

The exact packets, grid order, finite models, nonnegative even transform psi, plateau a=1/9 and support b=1/8 have the stated conventions Carleson tiles wave packets and tile order.

[F3]

Schwartz convolution has transform equal to the product of the transforms Schwartz convolution and product laws.

[F4]

Schwartz Fourier inversion holds everywhere Fourier inversion on Schwartz space.

[F5]

Tonelli applies to nonnegative product-measurable functions on sigma-finite products Tonelli's theorem for nonnegative measurable functions on a sigma-finite product.

[F6]

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

[F7]

Dominated convergence passes integrals to almost-everywhere limits under one integrable majorant Dominated convergence.

[F8]

Monotone convergence passes increasing nonnegative integrands to their integral limit Monotone convergence for the integral.

[F9]

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

[F11]

Assume AC The Axiom of Choice, supplying the countable-choice Fourier and measure interfaces.

Proof

Given: The stated uniform finite-model bound, a Schwartz input f, and an arbitrary measurable real selector N. All averages below use probability measures, and all product spaces are Euclidean Lebesgue spaces, finite parameter intervals or countable counting spaces, hence sigma-finite.

1.1

A transformed grid has spatial intervals y+rI and frequency intervals η+r1ω for r>0 and fixed y,eta. Use the same packet formula at their actual centers and lengths. Let Uf(x)=r1/2e2πiηxf((xy)/r). Substitution in the packet formula shows that U sends each original packet to its transformed packet times a unimodular constant; that constant cancels in its coefficient times packet. Thus the transformed model is UCS,NU1, where N(z)=r(N(y+rz)η). This selector is measurable. The Lp norm of U is the scalar factor r1/p1/2, and that of its inverse is reciprocal, so the strong norm B is preserved. The distribution change of variables gives the same assertion for the weak norm. Therefore the hypothesis covers every transformed grid used below.

F1F2F9given
1.2

A weak bound m{v>t}(K/t)p implies EvpKm(E)11/p for each finite-measure E: by F10 with exponent one, its left side is at most 0min(m(E),(K/t)p)dt, which equals the stated expression after splitting at Km(E)1/p. The zero cases give zero directly. Consequently the weak model hypothesis implies the testing bound Cf,gpBfpm(E)11/p for g1E. The strong hypothesis implies Cf,gBfpgp by F9. We will preserve these two testing inequalities through probability averages, first for bounded g supported in a bounded interval.

F9F10given
2.1

Fix an integer K>=0 and r in [1,2]. Retain only spatial scales l=r2k, -K<=k<=K. Average transformed grids over 0y<Y=r2K and 0η<W=2K/r, with normalized measures dy/Y and deta/W. At each fixed scale retain initially only spatial indices i and frequency indices j with |i|,|j|<=M, so the operator is a finite model covered by steps 1.1 and 1.2. Let M increase. For each x and each scale, the upper-half selector condition activates at most one frequency index. Every coefficient has magnitude at most f2ϕ2 by F9, and the sum of the packet absolute values over its spatial lattice is at most Cl1/2 by Schwartz decay. Thus all truncated outputs and their pointwise limits are bounded by CKf2, uniformly in x,y,eta,r. The spatial series is absolutely convergent, and the unique active frequency index is eventually retained, so the limits exist for every x and parameter. Coefficients are continuous in the packet parameters, by domination on each compact parameter set; the selector indicators are measurable in x and the parameters. Hence all the functions being averaged are product-measurable. For bounded compactly supported g, F7 and this uniform bound pass both testing inequalities through M to the full-index, finite-scale average.

F2F7F9step 1.1step 1.2
3.1

We compute its spatial average exactly. Fix l and a frequency interval with lower center nu. Write pl,c,ν(x)=l1/2e2πiνxϕ((xc)/l). The spatial centers are c=y+l(i+1/2). Since Y/l is an integer, averaging their lattice over y gives density dc/l on the line. Therefore the averaged rank-one sum has kernel 1le2πiν(xz)R((xz)/l),R(v)=ϕ(v+u)ϕ(u)du. Indeed insert the coefficient integral and replace the averaged sum over c by l^(-1) times its integral; then substitute c=z-lu. These exchanges are absolute: at fixed x, the integral over z,c of the absolute integrand after averaging is at most l1f1ϕϕ1. F5 establishes absolute product integrability and F6 exchanges the integrals and the counting sum. Since psi is real and even, its inverse phi is real and even by the cosine integral, so R=phi*phi and F3 gives R^=ψ2. F3 and F4 now identify the averaged output as f^(ξ)e2πixξψ(l(ξν))2dξ. All these are Schwartz convolution identities at a fixed frequency.

F2F3F4F5F6step 2.1
4.1

Average next over eta. For a fixed x let a=N(x). At spatial length l, the frequency intervals have length1/l. The interval containing a is active exactly when the fractional position v=l(aη)j lies in [1/2,1). Its lower center is ν=η+(j+1/4)/l, so l(ξν)=l(ξa)+v1/4. Because W is an integer multiple of1/l, the eta average makes v uniform on [0,1]. It follows that the frequency-averaged multiplier at scale l is 1/21ψ(l(ξa)+v1/4)2dv=H(l(aξ)). The half-open endpoints make a unique interval convention; their eta measure is zero and they do not alter the integral. Since 0ψ1 and f^L1, the Fourier integral and finite eta average interchange absolutely by F6. Crucially, this calculation holds at every fixed x for its actual value N(x); N is not frozen to a constant across the spatial variable.

F1F2F6step 3.1
5.1

Finally average r over [1,2] with probability measure dr/(rlog2). The resulting finite-scale average AK,Nf has the exact representation AK,Nf(x)=f^(ξ)e2πixξmK(N(x)ξ)dξ,mK(d)=1log22K2K+1H(td)dtt. This follows by changing variables t=r2^k in the finite scale sum: the intervals [2^k,2^(k+1)] partition the displayed integration range. The measure in r and the normalized measures in y,eta form a probability measure; they can equivalently be parameterized by y/Y,eta/W in [0,1]. Thus step 2.1 passes the testing bounds to AK,Nf. All integrations here are on compact parameter ranges with the stated uniform majorant.

F6step 2.1step 4.1
6.1

The function H is nonnegative, bounded by1/2, and supported in [1/8,7/8]. Moreover H(t)2/9 for 3/8t5/8: the interval [t1/9,t+1/9] lies inside [1/4,3/4] and its integrand is one. Consequently 0<2log(5/3)9log2κlog72log2<. For d<=0, m_K(d)=0. For d>0, the substitution u=td and expansion of the integration range give mK(d)κ. Thus 0mKκ for every K. Since f^L1, F7 gives, pointwise for every finite N(x), AK,Nf(x)κN(x)f^(ξ)e2πixξdξ=κTN(x)f(x). The isolated frequency xi=N(x) has zero Lebesgue measure, so the endpoint does not change this identity. This proves both convergence and a strictly positive reconstruction constant without classifying translation-invariant operators or invoking distributions.

F1F2F7step 5.1
7.1

Since AK,Nfκf^1, F7 passes its testing inequalities to the limit against any bounded compactly supported g. Under the strong hypothesis this yields TNf,gκ1Bfpgp for every such g. To recover the norm, use the following bounded truncations: put gn,R=1[R,R]1{TNf>1/n}TNfp2TNf for integers n,R1, defined as zero where TNf vanishes. Each gn,R is bounded and compactly supported, so the testing inequality applies to it. Indeed its magnitude is at most TNfp1f^1p1, since p>1, with value zero at zeros of TNf. The same bound also holds without the lower level cutoff; the cutoff is a permissible convenience, not a remedy for a singularity. Writing Jn,R=[R,R]{TNf>1/n}TNfp, the definition gives both TNf,gn,R=Jn,R and gn,Rp=Jn,R1/p, because (p1)p=p. Hence Jn,Rκ1BfpJn,R1/p and Jn,R1/pκ1Bfp. If Jn,R=0 the second inequality holds trivially; otherwise divide. The level sets increase with n and R, so F8 gives TNfpκ1Bfp. Under the weak hypothesis, take g to be the phase of T_Nf on E={TNf>λ}[R,R], a bounded compactly supported function. The limiting testing inequality gives λm(E)pκ1Bfpm(E)11/p and hence the stated weak bound for T_Nf after increasing R, also when m(E)=0. These bounds are uniform in the arbitrary measurable selector.

F1F7F8step 1.2step 5.1step 6.1
8.1

Enumerate the rational cutoffs and apply F1's least-index selector to each finite maximum. Step 7.1 gives the same strong or weak bound for every finite maximum. These maxima increase to CRf because the cutoff is continuous in its parameter. F8 gives the strong norm estimate; continuity from below of their level sets gives the weak estimate, equivalently another use of F8 on their indicators. This proves the Statement. The finite-to-infinite index limits, parameter averages and cutoff limits were justified separately with explicit majorants. AC is inherited through F11; there is no selector for an unattained infinite supremum and no new arbitrary-index choice.

F1F8F11step 7.1

Depends on

Used by

Dependency tree · two levels

63 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