Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-12
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 [j2k,(j+1)2k) with j,k∈Z; its length is positive. A tile is s=Is×ωs with both intervals dyadic and ∣Is∣∣ωs∣=1. Their centers are denoted c. Write ωs,− and ωs,+ for the left and right half-open halves. The midpoint belongs only to the right half.

Here is an explicit nonzero packet convention. Define ρ(t)=exp⁡(−1/t) for t>0 and ρ(t)=0 for t≤0. Here is the complete smoothness justification. Put P0(u)=1 and recursively Pk+1(u)=u2(Pk(u)−Pk′(u)). The exponential derivative, chain rule and product/quotient rules (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∘g is differentiable at c with (f∘g)′(c)=f′(g(c)) g′(c), Sums, scalar multiples, products and quotients: (f+g)′(c)=f′(c)+g′(c), (αf)′(c)=αf′(c), (fg)′(c)=f′(c)g(c)+f(c)g′(c), and (f/g)′(c)=(f′(c)g(c)−f(c)g′(c))/g(c)2 when g(c)≠0) show on t>0 that the kth derivative is Pk(1/t)exp⁡(−1/t). For each polynomial P and each integer r>=0, t−rP(1/t)exp⁡(−1/t)→0 as t↓0: 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 exp⁡(−x)=1/exp⁡(x). Extend each displayed kth-derivative formula by zero on t≤0. 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 ρ∈C∞(R) and ρ(k)(0)=0 for every k. Positivity of the exponential makes ρ(t)>0 exactly when t>0. Set a=1/9, b=1/8 and ψ(ξ)=ρ(b2−ξ2)ρ(b2−ξ2)+ρ(ξ2−a2). The denominator is positive: for ∣ξ∣≤a its first term is positive, for ∣ξ∣≥b its second term is positive, and between a and b both are positive. Thus ψ is smooth, 0≤ψ≤1, equals one on [−a,a] and vanishes outside [−b,b]. Every derivative is bounded on its compact support, so it is Schwartz under Schwartz space and its seminorms. Define ϕ(x)=ψ^(−x). 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 ∫ψ^(y)e2πiyξ dy=ψ(ξ); changing y=−x 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 Tr⁡yh(x)=h(x−y), Mod⁡ξh(x)=e2πiξxh(x) and Dil⁡ℓ2h(x)=ℓ−1/2h(x/ℓ) for ℓ>0. Define ϕs(x)=∣Is∣−1/2e2πic(ωs,−)xϕ((x−c(Is))/∣Is∣). The translation, modulation and dilation laws Translation, modulation, linear dilation and reflection laws give ϕs^(ξ)=∣Is∣1/2e−2πic(Is)(ξ−c(ωs,−))ψ(∣Is∣(ξ−c(ωs,−))). Its support lies strictly inside ωs,−, since its half-width is 1/(8∣Is∣) whereas that half-interval has half-width 1/(4∣Is∣). For every integer M there is a finite constant CM with ∣ϕs(x)∣≤CM∣Is∣−1/2(1+∣x−c(Is)∣/∣Is∣)−M, directly from the Schwartz seminorms. The pairing is ⟨f,h⟩=∫fh‾, linear in f. The fixed packet is not assumed to have norm one; its fixed norm and seminorms enter constants.

Set s≤t when Is⊆It and ωt⊆ωs. 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 s≤t for every s∈T; the top need not belong to T and is part of the data. A plus tree has, in addition, ωt⊆ωs,+ for every s∈T∖{t}. 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 N:R→R and f∈L2, define the finite model CS,Nf(x)=∑s∈S⟨f,ϕs⟩1ωs,+(N(x))ϕs(x). The coefficients exist by Cauchy–Schwarz The complex L2 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 ∣g∣≤1E, m(E)<∞, is the sum of ⟨f,ϕs⟩⟨1ωs,+(N)ϕs,g⟩; these integrals exist since the packets are integrable and g is bounded. These definitions do not assert orthogonality of overlapping packets.

Depends on

Used by

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