Alphabeta Math
CorollaryStatement: 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.

The choice of admissible dyadic partition does not change the Lp square-function space

Statement

Assume Countable Choice. Call an inhomogeneous dyadic frequency partition admissible when it is obtained as in Existence of a smooth inhomogeneous dyadic frequency partition from some radial cutoff satisfying the standing hypotheses. Let (φj) and (ψj) be two admissible partitions with associated square functions S(φ) and S(ψ). Then for every 1<p<∞ there are constants 0<c≤C<∞, depending only on n,p and the two cutoffs, such that for every f∈Lp(Rn;C) c ∥S(ψ)f∥p≤∥S(φ)f∥p≤C ∥S(ψ)f∥p. Moreover the mixed pieces are almost orthogonal: Δj(φ)Δk(ψ)=0 whenever ∣j−k∣≥3, and each mixed operator Δj(φ)Δk(ψ) is the Fourier multiplier with symbol φjψk supported in supp⁡φj∩supp⁡ψk. For j,k≥1 these are intersections of the corresponding annular supports; if either index is zero, use the actual low-frequency ball support of that block.

Facts & Assumptions

Given: Countable Choice, two admissible partitions (φj), (ψj) with cutoffs ψφ,ψψ and operators Δj(φ),Δk(ψ); a real 1<p<∞; a function f∈Lp(Rn;C).

[F1]

Littlewood-Paley square-function equivalence on Lp for 1<p<infinity applies to each admissible partition separately: for the partition (φj) there are constants 0<c1≤C1<∞ depending only on n,p and the cutoff ψφ with c1∥g∥p≤∥S(φ)g∥p≤C1∥g∥p for all g∈Lp, and for the partition (ψj) there are constants 0<c2≤C2<∞ depending only on n,p and ψψ with c2∥g∥p≤∥S(ψ)g∥p≤C2∥g∥p.

[F2]

For each of the two admissible partitions, every fixed dyadic piece is a bounded operator on Lp and agrees with its convolution representative; the composition on S has symbol φjψk (Dyadic pieces are uniformly Mihlin multipliers and uniformly Lp-bounded, The inhomogeneous dyadic frequency partition and its Littlewood-Paley operators). Also Cc∞ is dense in Lp for 1<p<∞ (Cc∞(Rn) is dense in Lp(Rn) for 1≤p<∞). For j,k≥1 the supports satisfy supp⁡φj⊂{2j−1≤∣ξ∣≤2j+1} and supp⁡ψk⊂{2k−1≤∣ξ∣≤2k+1}; the low blocks satisfy supp⁡φ0⊂{∣ξ∣≤2} and supp⁡ψ0⊂{∣ξ∣≤2} (The inhomogeneous dyadic frequency partition and its Littlewood-Paley operators, Existence of a smooth inhomogeneous dyadic frequency partition).

Proof

technique · direct
1.1F1algebra

Comparability of the two square functions. By [F1] applied to f, c1∥f∥p≤∥S(φ)f∥p≤C1∥f∥p and c2∥f∥p≤∥S(ψ)f∥p≤C2∥f∥p; eliminating ∥f∥p gives c1C2∥S(ψ)f∥p≤∥S(φ)f∥p≤C1c2∥S(ψ)f∥p, with constants depending only on n,p and the two cutoffs.

1.2F2algebra

The mixed pieces and their supports. For f∈S the composition rule [F2] gives Δj(φ)Δk(ψ)f=Tφjψkf, whose symbol is supported in supp⁡φj∩supp⁡ψk. If ∣j−k∣≥3, say k≥j+3, then supp⁡φj⊂{∣ξ∣≤2j+1} (including j=0, since its support lies in the radius-two ball) and supp⁡ψk⊂{∣ξ∣≥2k−1}, with 2j+1<2k−1, so the supports are disjoint and φjψk≡0. Thus the mixed operator vanishes on S; by [F2] each fixed dyadic piece is bounded on Lp, so its composition is bounded, and Cc∞⊂S is dense in Lp. Hence the identity Δj(φ)Δk(ψ)=0 extends to all of Lp. The same argument applies when j≥k+3 after interchanging the partitions. When j,k≥1 the support intersection is the intersection of their annuli; if a low block occurs it is the intersection with that block's actual ball support from [F2].

2.1step 1.1step 1.2∎

Conclusion. Step 1.1 is the stated two-sided comparability with constants depending only on n,p and the two cutoffs, and step 1.2 is the almost-orthogonality and support statement for the mixed pieces.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

52 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