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 signed tree weak one one estimate

Statement

Assume AC. Let T be a finite plus tree with designated top t, J0=It, and L=J0. Put wJ0(y)=(1+yc(J0)/L)20. For every measurable complex f with fwJ0<, all coefficients f,ϕs converge absolutely. For every choice of complex εs with εs1, define the signed packet projection PT,εf=sTεsf,ϕsϕs. There is a constant C depending only on the fixed packet, independent of T, its top, the coefficients epsilon, f and lambda, such that for every λ>0, m{x:PT,εf(x)>λ}CλRf(y)wJ0(y)dy. In the normalized bump notation of Lacey (3.4), specialized to the exponent twenty used here, χJ0(y)=L1(1+yc(J0)/L)20=L1wJ0(y). Thus the right-hand side is exactly the fLχJ01 localization in Lacey (7.11), and the estimate includes arbitrary signs.

Facts & Assumptions

[F1]

The dyadic packet construction gives Schwartz packets, their exact modulation/dilation formula, Fourier support in the lower halves, and the plus-tree order Carleson tiles wave packets and tile order.

[F2]

Plancherel preserves the complex inner product Plancherel theorem.

[F3]

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

[F4]

A locally integrable complex function has vanishing averaged absolute oscillation at almost every point Almost every point is a Lebesgue point of a locally integrable function.

[F5]

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

[F6]

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

Proof

Given: T,t,J0,L and coefficients epsilon as in the Statement. All constants below are uniform in these data and depend only on the fixed Schwartz packet.

1.1

Empty T gives the zero operator. Otherwise put ξ0=c(ωt) and qs(x)=e2πiξ0xϕs(x). Because ξ0ωs, direct differentiation of the explicit packet formula and the Schwartz bounds for phi and its derivative give, for every integer M>=0 and l=|I_s|, qs(x)CMl1/2(1+xc(Is)/l)M,qs(x)CMl3/2(1+xc(Is)/l)M. Indeed the remaining modulation frequency c(ωs,)ξ0 has absolute value at most1/l. The conjugated operator Qh=sεsh,qsqs satisfies Pf=e2πiξ0xQ(e2πiξ0f), so modulation changes none of the input norms or output level sets.

F1F3given
1.2

We prove the unweighted bound m{Qh>λ}Ch1/λ for every complex h in L1. Choose the maximal dyadic intervals J with J1Jh>λ. Their lengths are bounded above by h1/λ, so each such interval lies in a maximal one. The selected intervals are disjoint and countable, and JJh1/λ. Maximality of J and its parent give Jh2λJ. Outside their union, every dyadic average at the point is at most lambda. At a Lebesgue point of h, its average oscillation on the shrinking dyadic intervals is bounded by twice the average oscillation on the centered interval of radius equal to their length, hence tends to zero by F4. Thus hλ almost everywhere outside the union. If no such interval exists the same conclusion applies on the whole line.

F4F5given
2.1

The operator Q has a uniform L2 bound. First omit a possible member t. The remaining plus tree is strict. Its lower frequency halves at unequal scales are disjoint: nesting would put the full smaller frequency interval in the larger lower half, while the common top frequency must lie in the upper half. At equal frequency and scale l, the Gram entries satisfy qs,qsC(1+c(Is)c(Is)/l)20. To verify this, use exponent40 in step 1.1, extract the inverse twentieth power of the center distance using 1+cc/l(1+xc/l)(1+xc/l), and integrate the remaining normalized weight, with integral2/19. The spatial intervals of a fixed scale form a subset of a dyadic lattice, so the row and column sums are bounded by CnZ(1+n)20<. Plancherel kills the other entries. Expanding a finite synthesis sum and applying 2zszszs2+zs2 gives zsqs22Czs2. The possible top adds a single term of fixed norm; u+v222u22+2v22 preserves a uniform synthesis bound. For as=h,qs and A=(as2)1/2>0, pair h with (as/A)qs and use F3 to get ACh2. If A=0 this is immediate. The synthesis bound applied to εsas therefore proves Qh2Ch2.

F1F2F3step 1.1
2.2

The finite smooth kernel K(x,y)=sεsqs(x)qs(y) satisfies K(x,y)Cxy1 and yK(x,y)Cxy2 for x unequal to y. At each scale l there is only one possible frequency interval, the unique ancestor of the top frequency of length1/l. The spatial centers are a subset of the length-l lattice. Put d=|x-y|. Using exponent6 in step 1.1, extract (1+d/l)3 from the product of the two decay weights and sum the remaining weight over this lattice. The latter sum is bounded uniformly, by comparison with nZ(1+n)3. The scale-l kernel and derivative sums are thus bounded by Cl1(1+d/l)3 and Cl2(1+d/l)3. For l<=d, the derivative bound is at most Cl/d3, whose dyadic sum is at most C/d2; for l>d sum Cl2. The kernel estimate follows identically, summing Cl2/d3 below d and Cl1 above d. All actual scale sets are finite subsets of these geometric sums.

F1step 1.1
3.1

Set hJ=J1Jh, bJ=(hhJ)1J, and let g equal hJ on J and h elsewhere. Then bJ=0, bJ12Jh, g1h1 and g2λ almost everywhere. Hence g222λh1. By step 2.1 and the elementary inequality u21u>aa21u>a, m{Qg>λ/2}Ch1/λ. The union B of the concentric triple intervals 3J has measure at most 3h1/λ. Outside 3J, cancellation gives QbJ(x)=J(K(x,y)K(x,c(J)))bJ(y)dy. For y in J and x outside 3J, every point between y and c(J) is at distance at least (2/3)xc(J) from x. Integrating the derivative bound in step 2.2 along that segment gives K(x,y)K(x,c(J))CJ/xc(J)2. Its x-integral outside 3J is at most an absolute constant. Consequently R3JQbJCbJ1.

F3step 2.1step 2.2step 1.2
4.1

The sum b=JbJ converges in L1, since JbJ12h1. Each packet is bounded and the operator sum has finitely many packets, so convergence in L1 implies coefficient convergence and pointwise convergence of Q applied to partial sums. The triangle inequality and F5 therefore give RBQbCh1. Markov's inequality, here the direct bound uam{u>a} for nonnegative u, bounds the measure where Qb>λ/2 outside B by Ch1/λ. Since h=g+b, step 3.1 and the measure bound on B prove the desired unweighted weak estimate. The same bound holds for P by the modulation identity.

F5step 1.1step 3.1
5.1

Now assume only the weighted integrability in the Statement and split f=f0+f on 3J0 and its complement. On 3J0 the weight is at least (5/2)20, so f01CfwJ0 and step 4.1 applies. For y outside 3J0, put d=dist(y,J0)>=L. Exponent40 packet decay gives sTϕs1ϕs(y)ClL, l dyadic(L/l)(1+d/l)40C(L/d)40CwJ0(y). Here ϕs1=lϕ1 and there are at most L/l spatial intervals at scale l. The middle bound is the geometric sum of (l/L)39 after extracting (L/d)40; the last uses yc(J0)=d+L/2. The same estimates show ϕs(y)CswJ0(y) on the line for each fixed s, with a finite constant Cs: on 3J0 both the positive lower bound for w and boundedness of the packet suffice, and outside it the displayed estimate applies. Thus all coefficient integrals are absolute, as claimed. Finite summation and the displayed bound yield Pf1CfwJ0.

F1step 4.1
6.1

Use the unweighted weak estimate for Pf0 at threshold lambda/2 and the L1 bound for Pf with Markov's inequality at the same threshold. Since PfPf0+Pf, their two exceptional sets cover the desired one and give the stated weighted weak estimate. The proof covers a singleton top, empty tree, zero input class and all zero coefficients epsilon; lambda is required positive only for the displayed divisions. All decompositions are explicitly dyadic and countable; AC is inherited through F6 and is not used for a new arbitrary-index selection.

F6step 4.1step 5.1

Depends on

Used by

Dependency tree · two levels

46 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