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 tiles wave packets and tile order
Definition
Assume The Axiom of Choice for the countable-choice Fourier suppliers. A dyadic interval is with ; its length is positive. A tile is with both intervals dyadic and . Their centers are denoted c. Write and for the left and right half-open halves. The midpoint belongs only to the right half.
Here is an explicit nonzero packet convention. Define for and for . Here is the complete smoothness justification. Put and recursively . The exponential derivative, chain rule and product/quotient rules (The exponential function is smooth and , The chain rule, in one line from Carathéodory: if is differentiable at and is differentiable at , then is differentiable at with , Sums, scalar multiples, products and quotients: , , , and when ) show on that the kth derivative is . For each polynomial P and each integer r>=0, as : expand P into finitely many monomials, put u=1/t, and apply The exponential dominates every fixed nonnegative integer power at with parameter one and The exponential is positive and satisfies . Extend each displayed kth-derivative formula by zero on . Each extension is continuous at zero (r=0); its difference quotient at zero tends to zero (r=1), so its derivative there equals the next extension's value. On the two open half-lines differentiation already gives the next extension. Induction therefore proves and for every k. Positivity of the exponential makes exactly when . Set , and The denominator is positive: for its first term is positive, for its second term is positive, and between a and b both are positive. Thus is smooth, , equals one on and vanishes outside . Every derivative is bounded on its compact support, so it is Schwartz under Schwartz space and its seminorms. Define . The transform theorem Fourier transform acts continuously on Schwartz space makes this Schwartz, and Fourier inversion on Schwartz space gives . In detail inversion applied to says ; changing gives the claimed transform. All integrals are absolute by Schwartz derivatives are integrable. In particular is not zero. No unspecified zero packet is allowed.
Use , and for . Define The translation, modulation and dilation laws Translation, modulation, linear dilation and reflection laws give Its support lies strictly inside , since its half-width is whereas that half-interval has half-width . For every integer M there is a finite constant with , directly from the Schwartz seminorms. The pairing is , linear in f. The fixed packet is not assumed to have norm one; its fixed norm and seminorms enter constants.
Set when and . This is a partial order: reflexivity and transitivity follow from inclusions, and mutual comparability gives equality of both intervals. A finite tree is a set T with a designated top tile t such that for every ; the top need not belong to T and is part of the data. A plus tree has, in addition, for every . The top alone is allowed. Empty trees have no contribution; any assigned top is retained only when a forest count is explicitly specified. For a finite tile set S, a measurable selector and , define the finite model The coefficients exist by Cauchy–Schwarz The complex pairing is well-defined and satisfies Cauchy–Schwarz and Schwartz integrability. Each summand is measurable, the sum is finite and for fixed S,N it is linear in f. Its testing form for , , is the sum of ; these integrals exist since the packets are integrable and g is bounded. These definitions do not assert orthogonality of overlapping packets.
Depends on
- Schwartz space and its seminorms
- Fourier inversion on Schwartz space
- The exponential dominates every fixed nonnegative integer power at $+\infty$
- The exponential function is smooth and $(\exp)'=\exp$
- The chain rule, in one line from Carathéodory: if $g$ is differentiable at $c$ and $f$ is differentiable at $g(c)$, then $f \circ g$ is differentiable at $c$ with $(f \circ g)'(c) = f'(g(c))\,g'(c)$
- Sums, scalar multiples, products and quotients: $(f+g)'(c) = f'(c) + g'(c)$, $(\alpha f)'(c) = \alpha f'(c)$, $(fg)'(c) = f'(c)g(c) + f(c)g'(c)$, and $(f/g)'(c) = \bigl(f'(c)g(c) - f(c)g'(c)\bigr)/g(c)^{2}$ when $g(c) \ne 0$
- The exponential is positive and satisfies $\exp(-x)=1/\exp(x)$
- Fourier transform acts continuously on Schwartz space
- Translation, modulation, linear dilation and reflection laws
- Schwartz derivatives are integrable
- The Axiom of Choice
- The complex $L^2$ pairing is well-defined and satisfies Cauchy–Schwarz
Used by
- Density size and tree count for carleson tiles Definition
- Two comparable and two incomparable carleson tiles Example
- Carleson real line to torus transfer Lemma
- Carleson restricted weak interpolation Lemma
- Carleson signed tree weak one one estimate Lemma
- Carleson single tree estimate Lemma
- Carleson size selection Lemma
- Hunt exceptional set and distribution estimates Lemma
- Wave packet model dominates the linearised carleson operator Lemma
Dependency tree · two levels
60 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
- Lacey, Carleson’s Theorem: Proof, Complements, Variations (standard reference, not scraped)