Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generated
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.

The inhomogeneous dyadic frequency partition and its Littlewood-Paley operators

Definition

Assume Countable Choice (The Axiom of Countable Choice (ACω)). Fix a function ψ and its partition (φj)j≥0 as in Existence of a smooth inhomogeneous dyadic frequency partition. Define the companion sequence by φ~j:=φj−1+φj+φj+1(j≥0), with φ−1:=0. For f∈S′(Rn) define Δjf:=F−1(φj⋅Ff),Δ~jf:=F−1(φ~j⋅Ff), where φj⋅Ff and φ~j⋅Ff are the products of the tempered distribution Ff with the smooth polynomially bounded symbols φj,φ~j (transposition, Smooth polynomially bounded multipliers on schwartz space); for f∈S these operators are the translation-invariant Fourier multipliers Tφjf, Tφ~jf of Translation-invariant Fourier multiplier on the Schwartz core; for f∈Lp(Rn;C), 1≤p<∞, define Δjf:=f∗Kj and Δ~jf:=f∗K~j, where Kj:=F−1φj,K~j:=F−1φ~j are the inverse transforms of the symbols (Fourier transform of a tempered distribution). The following well-definedness and compatibility facts are part of the definition and are recorded with their cited suppliers.

  1. Domains. Each φj and each φ~j is smooth, compactly supported and bounded together with all its derivatives, hence a smooth polynomially bounded multiplier: for f∈S(Rn) the products φjf^ and φ~jf^ lie in S(Rn) (Smooth polynomially bounded multipliers on schwartz space), so S⊂Dφj∩Dφ~j and Tφjf, Tφ~jf are well-defined tempered distributions. Because φ0=ψ and φj(ξ)=ψ(2−jξ)−ψ(2−(j−1)ξ) for j≥1, the pieces satisfy the rescaling law φk+j−1(ξ)=φk(2−(j−1)ξ) for every k≥1 and j≥1 (so φj(ξ)=φ1(2−(j−1)ξ) for j≥1); the companion symbols are sums of neighbouring pieces, and no single rescaling law for all j≥0 is used. They have the recorded supports supp⁡φ~j⊂{∣ξ∣≤2j+2} for every j≥0, with supp⁡φ~j⊂{2j−2≤∣ξ∣≤2j+2} for j≥2, together with supp⁡φ~0⊂{∣ξ∣≤4}. The vanishing is strict: for j≥1, since ψ=1 on the unit ball, φj(ξ)=0 whenever ∣ξ∣≤2j−1 (both arguments of ψ have modulus at most 1), and since ψ=0 for ∣ξ∣≥2, φj(ξ)=0 whenever ∣ξ∣≥2j+1; thus for j≥1 its nonzero set is contained in the open annulus 2j−1<∣ξ∣<2j+1, while its closed support lies in 2j−1≤∣ξ∣≤2j+1. Boundary points can belong to the support even though the function vanishes there, and φ0=0 for ∣ξ∣≥2.
  2. The Lp definition. Kj,K~j∈S(Rn) (Fourier transform acts continuously on Schwartz space), hence Kj,K~j∈L1(Rn), and Young's inequality (Young's convolution inequality under Countable Choice) shows that for f∈Lp, 1≤p<∞, the convolutions f∗Kj, f∗K~j are defined almost everywhere, lie in Lp and satisfy ∥f∗Kj∥p≤∥Kj∥1∥f∥p, ∥f∗K~j∥p≤∥K~j∥1∥f∥p; the convolution is the one of Convolution of two functions on Rn.
  3. Agreement on S and composition. For f∈S the convolution Kj∗f is Schwartz by Schwartz convolution and product laws, hence lies in L1, its integral transform is Kj∗f^=K^jf^=φjf^ by the convolution theorem (Fourier transform turns L1 convolution into multiplication), and Fourier inversion (Fourier inversion on Schwartz space) gives Kj∗f=F−1(φjf^) as functions; since Tφjf=F−1(uφjf^) and the right side is the regular distribution of F−1(φjf^), the two definitions of Δjf agree on S, and Δjf^=φjf^ as tempered distributions (using that the distributional transform agrees with the integral transform on L1 functions, Fourier transform agrees with l one and plancherel transforms); the same holds for the companions. Moreover, if m,n are smooth polynomially bounded symbols with S⊂Dm∩Dn, then TmTn=Tmn on S: for f∈S the density nf^ lies in S, so Tnf is the regular distribution of F−1(nf^)∈S and Tm(Tnf)=Tmnf by the same computation.
  4. The companion identity and the low-frequency block. Because φjφk=0 pointwise whenever ∣j−k∣≥2 (the annular supports meet at most at the endpoint spheres, where both factors vanish), expanding 1=(∑jφj)2 gives 1=∑jφj2+2∑jφjφj+1=∑j(φj−1+φj+φj+1)φj=∑jφ~jφj, the sums being locally finite. Neither the low-frequency block Δ0 nor its companion Δ~0 is assigned mean zero: indeed ∫RnKj=φj(0) and ∫RnK~j=φ~j(0), so ∫K0=ψ(0)=1 and ∫K~0=φ0(0)+φ1(0)=1, and no cancellation is claimed for these blocks.

This partition is fixed once and for all on this page. The operator norms of Δj on L2 are at most ∥φj∥∞≤1 (Exact L2 Fourier multiplier norm), and all constants below refer to this fixed partition.

Depends on

Used by

Dependency tree · two levels

69 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