Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-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.

Dyadic pieces have annular Fourier support and uniformly bounded rescaled kernels

Statement

Assume Countable Choice (The Axiom of Countable Choice (ACω)). With the fixed partition and notation of The inhomogeneous dyadic frequency partition and its Littlewood-Paley operators:

  1. for j≥1 the kernel Kj=F−1φj lies in S(Rn) and satisfies Kj(x)=2(j−1)nK1(2j−1x)(x∈Rn) and ∫RnKj=0; also K~j∈S, with K~j=Kj−1+Kj+Kj+1 (a finite sum of Schwartz kernels; no scaling law for the companions);
  2. for every N≥0 there are constants CN,CN′<∞ depending only on n,ψ,N with ∣Kj(x)∣≤CN2jn(1+2j∣x∣)−N,∣K~j(x)∣≤CN′2jn(1+2j∣x∣)−N for all j≥1 and x∈Rn, while K0,K~0∈S;
  3. consequently ∥Kj∥1≤C and ∥K~j∥1≤C uniformly in j, and for f∈Lp(Rn;C), 1≤p≤∞, ∥f∗Kj∥p≤C∥f∥p,∥f∗K~j∥p≤C∥f∥p uniformly in j≥0, that is ∥Δjf∥p≤C∥f∥p and ∥Δ~jf∥p≤C∥f∥p.

Facts & Assumptions

Given: the fixed partition (φj) of Existence of a smooth inhomogeneous dyadic frequency partition with its companion sequence (φ~j) and the kernels Kj=F−1φj, K~j=F−1φ~j of The inhomogeneous dyadic frequency partition and its Littlewood-Paley operators; an integer N≥0.

[F1]

The symbols satisfy φ0=ψ, φj(ξ)=ψ(2−jξ)−ψ(2−(j−1)ξ) for j≥1 and φ~j=φj−1+φj+φj+1 with φ−1=0; ψ is Schwartz, ψ(0)=1 and ψ=0 for ∣ξ∣≥2; and φj(ξ)=φ1(2−(j−1)ξ) for j≥1 (Existence of a smooth inhomogeneous dyadic frequency partition, The inhomogeneous dyadic frequency partition and its Littlewood-Paley operators).

[F2]

Kj,K~j∈S(Rn), FKj=φj and FK~j=φ~j (Fourier transform acts continuously on Schwartz space); for h∈S(Rn) the inversion formula h(x)=∫Rnh^(ξ)e2πix⋅ξ dξ holds with an absolutely convergent integral (Fourier inversion on Schwartz space), and for L1 functions the distributional transform is the regular distribution of the integral transform (Fourier transform agrees with l one and plancherel transforms), so the integral transform of the integrable function Kj equals φj pointwise.

[F3]

For n≥1, if h∈S(Rn) then h∈L1(Rn) (Schwartz derivatives are integrable), and for every N≥0 the quantity sup⁡u∈Rn(1+∣u∣)N∣h(u)∣ is finite and bounded by a finite sum of the seminorms pα0(h), because (1+∣u∣)N≤CN∑∣α∣≤N∣uα∣ (Schwartz space and its seminorms, Ck maps and multi-index derivative notation in Euclidean space).

[F4]

Young's inequality: for 1≤p≤∞, f∈Lp and g∈L1 the convolution f∗g is defined almost everywhere and ∥f∗g∥p≤∥f∥p∥g∥1 (Young's convolution inequality under Countable Choice).

Proof

technique · direct
1.1F1algebra

Rescaling law for the pieces. For j≥1 and every ξ, φj(ξ)=ψ(2−jξ)−ψ(2−(j−1)ξ)=φ1(2−(j−1)ξ), because φ1(2−(j−1)ξ)=ψ(2−12−(j−1)ξ)−ψ(2−(j−1)ξ), and more generally φk+j−1(ξ)=φk(2−(j−1)ξ) for every k≥1 by the same computation with k in place of 1. The companions are sums, not rescalings: φ~j=φj−1+φj+φj+1, hence K~j=Kj−1+Kj+Kj+1 by linearity of the inverse transform, and no rescaling law is claimed for them.

2.1F1F2step 1.1algebra

Rescaling law for the kernels. Since K1=F−1φ1∈S and Kj=F−1φj=F−1(φ1(2−(j−1)⋅)) by step 1.1, the inversion formula applied at x gives Kj(x)=∫φ1(2−(j−1)ξ)e2πix⋅ξ dξ; substituting ξ=2j−1η, dξ=2(j−1)ndη, this becomes Kj(x)=2(j−1)n∫φ1(η)e2πi(2j−1x)⋅η dη=2(j−1)nK1(2j−1x). For the companions, step 1.1 gives K~j=Kj−1+Kj+Kj+1 (the inverse transform is linear and each Ki lies in S); a finite sum of Schwartz kernels again lies in S.

3.1F1F2step 2.1algebra

Mean zero of the high-frequency kernels. For j≥1 the integral K^j(0)=∫RnKj(x) dx is the value at the origin of the integral transform of Kj, which by [F2] equals φj(0); since ψ(0)=1 by [F1], φj(0)=ψ(0)−ψ(0)=0.

3.2F2F3step 2.1algebra

Pointwise decay. Fix N≥0. By [F3] applied to K1 there is AN<∞, depending only on n,ψ,N, with ∣K1(u)∣≤AN(1+∣u∣)−N for all u; since 1+2j∣x∣≤2(1+2j−1∣x∣) for j≥1, step 2.1 gives, for j≥1, ∣Kj(x)∣=2(j−1)n∣K1(2j−1x)∣≤AN2(j−1)n(1+2j−1∣x∣)−N≤AN2N+n2jn(1+2j∣x∣)−N, so the asserted bound holds with CN:=AN2N+n. For the companions, step 2.1 writes K~j=Kj−1+Kj+Kj+1; summing the bounds just proved for these three kernels, and for j=1 also the Schwartz bound of K0 from [F3], gives ∣K~j(x)∣≤CN′2jn(1+2j∣x∣)−N after absorbing the fixed factors 3, 2N and 2n into CN′. Since K0=F−1ψ and K~0=F−1φ~0 are inverse transforms of Schwartz functions, both lie in S by [F2].

4.1F3step 3.2algebra

Uniform L1 bounds. Take N=n+1 in step 3.2 and substitute u=2jx: for j≥1, ∫∣Kj∣≤CN2jn∫(1+2j∣x∣)−Ndx=CN∫(1+∣u∣)−Ndu=:C<∞, and likewise ∫∣K~j∣≤CN′∫(1+∣u∣)−Ndu≤C after enlarging C; the integrals are finite: on ∣u∣≤1 the integrand is bounded and the ball lies in a finite-volume box; on 2k<∣u∣≤2k+1 its integral is at most 2−k(n+1)(2k+2)n=22n−k, and ∑k≥02−k<∞ (A box in Rn with parameters ai≤bi is Lebesgue measurable of measure ∏i<n(bi−ai), whichever of its faces are included). For j=0, [F3] gives ∥K0∥1+∥K~0∥1<∞, and these two constants are absorbed into C.

5.1F4step 4.1algebra

Uniform Lp bounds. For f∈Lp, 1≤p≤∞, Young's inequality [F4] applied to f and Kj∈L1 gives ∥f∗Kj∥p≤∥Kj∥1∥f∥p≤C∥f∥p, and likewise for K~j, uniformly in j≥0.

6.1step 1.1step 2.1step 3.1step 3.2step 4.1step 5.1∎

Clauses 1, 2 and 3 are steps 2.1 with 3.1, step 3.2 and steps 4.1 with 5.1, respectively.

Depends on

Used by

Dependency tree · two levels

71 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