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 single tree estimate

Statement

Assume AC. For a finite tree T the absolute bilinear tile contribution is <=C density(T) size(T)|I_T|, for |g|<=1_E.

Facts & Assumptions

[F1]

Density uses all tiles above each member, tests their whole frequency intervals with χI=I1(1+xc(I)/I)20, and size bounds every plus subtree and every singleton coefficient Density size and tree count for carleson tiles.

[F2]

The dyadic tile order, plus trees, finite model, normalized Fourier convention and fixed Schwartz packet with transform ψ are as defined Carleson tiles wave packets and tile order.

[F3]

Fourier transformation preserves the complex inner product Plancherel theorem.

[F4]

The centered real-line maximal operator M is bounded on L2 The centered maximal operator is bounded on Lp(Rn) for 1<p<.

[F5]

The complex pairing is sesquilinear and satisfies Cauchy–Schwarz The complex L2 pairing is well-defined and satisfies Cauchy–Schwarz.

[F6]

Schwartz convolution is Schwartz and its transform is the product of the transforms Schwartz convolution and product laws.

[F7]

Fourier inversion holds everywhere for Schwartz functions Fourier inversion on Schwartz space.

[F8]

Nonnegative increasing integrands pass to the limit under the integral Monotone convergence for the integral.

[F9]

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

Proof

Given: A finite tree T with designated top t, measurable selector N, fL2, and measurable g with g1E, m(E)<. Put J0=It, L=J0, δ=densE,N(T), σ=sizef(T) and as=f,ϕs. All constants depend only on the fixed packet.

1.1

The proof establishes the stronger sum of absolute tile contributions. Choose complex numbers εs of modulus one so that εsas1ωs,+(N)ϕs,g is nonnegative real, taking εs=1 for a zero product. Finite sesquilinearity bounds that sum by Esεsas1ωs,+(N(x))ϕs(x)dx. Write bs=εsas. Empty T and sigma=0 give zero. If delta=0, exponent20 packet decay bounds the integral of ϕs on EN1(ωs,+) by CIsδ=0 for each s, so all contributions vanish. Hence assume delta,sigma>0. Singletons give bsσIs. A possible member s=t contributes at most CσLEN1(ωt)χJ0CσδL, by packet decay with exponent20. Remove this one member. Each remaining tile has its top frequency contained in exactly one half of its frequency interval. Split them into the strict plus and strict minus trees according as that half is right or left, retaining the same top t and the bounds delta,sigma.

F1F2F5given
1.2

We record a kernel bound. If Kr satisfies Kr(z)Cr1(1+z/r)20 and h is Schwartz, then for every interval J of length j<=r and every x,y in J, (Krh)(x)CMh(y). Indeed xyr makes the displayed weight at x comparable to that at y. On zy<r its integral against |h| is bounded by twice the centered average times a constant. On the annulus 2nrzy<2n+1r, it is at most C219nMh(y), using the centered interval of radius 2n+1r. The geometric sum proves the bound uniformly in x,y,r.

F4
2.1

For either nonempty strict subtree U, partition the line into maximal dyadic intervals J such that 3J contains no Is, s in U; 3J denotes the concentric interval of triple length. Such intervals cover the line: all sufficiently small dyadic intervals have this property because U is finite with positive minimum spatial length, and sufficiently large ancestors of any fixed interval fail it because their triples eventually contain every fixed bounded interval. The property passes to dyadic subintervals since their triples lie in the larger triple; maximal good intervals are therefore disjoint and cover every point. They form a countable family J. If j=|J| and Jp is its dyadic parent, maximality supplies an sU with Is3Jp. Since this latter interval has length6j, dyadic lengths imply Is4j. In particular dist(J,J0)6j. If j>=L and J meets J0, or if j>=L+dist(J,J_0) when they are disjoint, then J03J, contradicting goodness. Consequently intervals with dist(J,J_0)<L have j<2L and lie in a fixed concentric enlargement of J0; their total length is at most CL. When d=dist(J,J_0)>=L, one has d/6j<d+L2d.

F2step 1.1
2.2

For the strict plus subtree put H=sUbsϕs, a Schwartz function. Then H2CσL. Here are the needed orthogonality details. Lower frequency halves at unequal scales are disjoint: if nested, the full smaller frequency interval lies in the larger lower half, whereas the common top lies in its upper half. Plancherel kills those Gram entries. At equal frequency and spatial scale l, packet decay gives ϕs,ϕsC(1+c(Is)c(Is)/l)20: extract the center-distance factor from the product of exponent40 decay bounds by the triangle inequality, and integrate the remaining normalized exponent20 weight, whose integral is2/19. The row and column sums over the length-l spatial lattice are bounded by CnZ(1+n)20. Using 2bsbsbs2+bs2 proves H22Csbs2Cσ2L, the last bound being the defining plus-tree size inequality.

F1F2F3F5step 1.1
3.1

On each J split the signed tile sum into small tiles Is4j and large tiles Is8j. These are all the possibilities because lengths are dyadic. The integral of the absolute small sum is at most CσδsU:Is4jIs(1+dist(Is,J)/Is)20. To see this for each tile of length l, exponent40 packet decay and the singleton bound give bsϕs(x)CσlχIs(x)(1+xc(Is)/l)20. Take the supremum of the last factor on J and integrate over EN1(ωs,+), a subset of the full-frequency set controlled by delta. At a fixed scale l, there is at most one possible frequency for each spatial interval, the unique ancestor of the top frequency of length1/l. The spatial intervals thus form a subset of the length-l dyadic lattice inside J0. If l<=j, goodness and aligned dyadic endpoints put these intervals outside 3J, at distance at least j from J. Summing the displayed weights over that lattice gives at most Clnj/l(1+n)20Cj(l/j)20 by integral comparison. For l=2j or4j, the full lattice sum is at most Cl<=Cj, with no separation needed. Summing dyadic l<=4j bounds the displayed spatial sum by Cj.

F1F2step 1.1step 2.1
3.2

Let GJ=EJsU:Is8jN1(ωs,+), the support of the large sum on E. Then m(GJ)Cδj. If there is no large tile the claim is immediate. Otherwise 8j<=L. For the witness s' in step 2.1, let v have spatial interval the dyadic ancestor of Is of length4j and frequency the dyadic ancestor of the top frequency of length1/(4j). Then v is a tile above s', so its weighted density integral is at most delta. The center of its spatial interval is within Cj of J, because Is3Jp and its ancestor has length4j. Hence χIvc/j on J for an absolute c>0. Every large tile frequency is contained in ωv, since its length is at most1/(8j) and it also contains the top frequency. This gives GJEJN1(ωv) and proves the measure bound. Moreover 8j<=L and the witness geometry in step 2.1 place all such J in one fixed enlargement of J0. Thus their total length is at most CL and Jm(GJ)CδL. The use of 4j for the density witness is essential: the witness in 3 times the parent need not have length at most j.

F1F2step 2.1
3.3

We construct exact smooth scale projections for this plus subtree. For each dyadic r<=L, let Ωr=[αr,αr+1/r) be the unique dyadic ancestor of the top frequency of length1/r. Set Θ(v)=ψ((v1/2)/5). The exact plateau a=1/9 and support b=1/8 in F2 give Θ=1 on [0,1] and Θ=0 outside [-1/8,9/8]. Its inverse Fourier transform is k(x)=5eπixϕ(5x), as follows by substituting v=5u+1/2 in the absolutely convergent inverse integral. Thus the inverse transform of Θ(r(ξαr)) is Kr(x)=r1e2πiαrxk(x/r), bounded by Cr1(1+x/r)20. For any member with Isr, its Fourier support lies in Ωr, so this multiplier is one on its support. If Is<r, its full frequency is a proper ancestor of Ωr and its lower packet support is separated from its upper half by at least 1/(8Is)1/(4r). Since the top, hence Ωr, lies in that upper half, the enlargement of Ωr by1/(8r) on each side misses that packet support. The multiplier is therefore zero there. By F6 and F7, KrH=sU:Isrbsϕs everywhere, not merely as an unspecified truncation estimate.

F2F6F7step 2.2
4.1

The small terms sum to at most CσδL over all J. For dist(J,J_0)<L this follows from the Cj bound and the total-length bound in step 2.1. For d=dist(J,J_0)>=L, each scale l<=L has total spatial length at most L, so its contribution to the spatial sum of step 3.1 is at most L(1+d/l)20. Summing the dyadic scales gives CL(L/d)20. For 2kLd<2k+1L, step 2.1 gives j2kL/6 and j<2^{k+2}L. The disjoint J in this shell lie in an interval of length C2kL, so their number is bounded by an absolute constant. Summing CL220k for k>=0 completes the estimate. Countable sums of these nonnegative integrals are justified by F8 applied to finite unions of the disjoint J.

F8step 2.1step 3.1
4.2

For each x, the upper frequency halves of a strict plus tree form a nested family, with all tiles at a fixed spatial scale having the same frequency. If N(x) belongs to an upper half, it belongs to all the larger upper halves in this family. Thus the activated spatial scales form an initial segment of the scales present in U. Let tau(x) be their largest spatial length, setting it to zero when none is active. Every strict member has length at most L/2, so 2tau(x)<=L whenever tau(x)>0. On J, if tau(x)>=8j, the large sum equals the scale block 8jIsτ(x), which by step 3.3 is ((K8jK2τ(x))H)(x). If tau(x)<8j the large sum is zero. Both kernel scales are at least j. Step 1.2 therefore bounds the magnitude of the large sum, for x in E intersect J, by C1GJ(x)infyJMH(y). Denote that infimum by q_J; it is an ordinary fixed nonnegative number, not a measurability assertion about uncountably selected points. By F4 and step 3.2, Jm(GJ)qJ2CδJjqJ2CδR(MH)2CδH22. The middle inequality holds because MH(y)qJ on each disjoint J. Countable sums are again obtained from F8; alternatively the inequalities first hold for any finite subfamily.

F2F4F8step 1.2step 3.2step 3.3
5.1

For the strict minus subtree, upper frequency halves at unequal scales are disjoint. If two were nested, the full smaller interval would lie in the larger upper half, but the top frequency is required to lie in its lower half. At a fixed x, the selector N(x) therefore activates at most one spatial scale. At that scale, bsϕs(x)Cσ(1+xc(Is)/Is)20 and the sum over the spatial lattice is at most Cσ, uniformly in x. The large sum on J consequently has magnitude at most Cσ1GJ on E. Its integrals sum to CσδL by step 3.2. Together with step 4.1 this proves the bound for the minus subtree.

F2step 1.1step 4.1step 3.2
6.1

Cauchy–Schwarz on the disjoint union of the GJ, first for finite subfamilies and then by F8, bounds the total integral of the large plus sum by C(Jm(GJ))1/2(Jm(GJ)qJ2)1/2CδLH2CδσL. Combine this with the small contribution from step 4.1, the minus contribution from step 5.1 and the possible top contribution from step 1.1. This proves the stronger absolute sum and hence the stated absolute bilinear bound. All selector and testing-set boundary conventions are half-open and were respected in the frequency inclusions; null modifications leave the integrals unchanged. AC is inherited through F9; the only new choices were finite phase choices and explicitly defined dyadic ancestors. The maximal estimate is used solely on Lebesgue measure on the line, with its valid countable-choice and sigma-finite specialization.

F5F8F9step 1.1step 4.1step 3.2step 5.1step 2.2step 4.2

Depends on

Used by

Dependency tree · two levels

52 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