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.

L2 almost orthogonality of the dyadic pieces

Statement

Assume Countable Choice (The Axiom of Countable Choice (ACω)). For every f∈L2(Rn;C), ∑j≥0∥Δjf∥L22≤∥f∥L22≤3∑j≥0∥Δjf∥L22. In particular ∑j≥0∥Δjf∥L22<∞. The constants 1 and 3 depend on no parameter beyond the fixed partition.

Facts & Assumptions

Given: the fixed partition (φj) and operators Δj of The inhomogeneous dyadic frequency partition and its Littlewood-Paley operators; a function f∈L2(Rn;C); the Plancherel isometry F2 and the complex L2 conventions of Complex Lp classes and Euclidean test-function conventions.

[F1]

Each φj∈Cc∞(Rn) satisfies 0≤φj≤1, the pointwise bounds 13≤∑j≥0φj(ξ)2≤1 with a locally finite sum, and for f∈S the function Δjf lies in S with Δjf^=φjf^ (Existence of a smooth inhomogeneous dyadic frequency partition, The inhomogeneous dyadic frequency partition and its Littlewood-Paley operators).

[F2]

Plancherel: F2:L2(Rn;C)→L2(Rn;C) is a surjective isometry preserving the first-variable-linear inner product, so ∥g∥22=∫∣F2g∣2 and ⟨g,h⟩=⟨F2g,F2h⟩ (Plancherel theorem).

[F3]

The multiplier by a symbol m with ∥m∥∞≤M that belongs to Cc∞ extends uniquely from S to a bounded operator on L2 of norm at most M, given by F2−1(m F2g) (Exact L2 Fourier multiplier norm).

[F4]

For g∈L2 and j≥0, the convolution representative Δjg=g∗Kj lies in L2 with ∥Δjg∥2≤∥Kj∥1∥g∥2≤C∥g∥2, the constant being uniform in j (Young's convolution inequality under Countable Choice, Dyadic pieces have annular Fourier support and uniformly bounded rescaled kernels).

[F5]

The smooth compactly supported functions are dense in L2(Rn;C) (Complex finite-simple and smooth compact-support density for finite p): there is a sequence fk∈Cc∞⊂S with fk→f in L2.

[F6]

Tonelli's theorem for nonnegative measurable functions on sigma-finite products, in particular for summation in a discrete index against Lebesgue measure (Tonelli's theorem for nonnegative measurable functions on a sigma-finite product).

Proof

technique · direct
1.1F1F2algebra

The Schwartz case. Let f∈S. For every j, [F1] gives Δjf∈S with Δjf^=φjf^; by Plancherel [F2] applied to g=Δjf and to f, ∥Δjf∥22=∫Rn∣Δjf^∣2=∫Rnφj2∣f^∣2 and ∥f∥22=∫∣f^∣2.

2.1F1F2F6step 1.1algebra

Summing the Schwartz identity. With f∈S as in step 1.1, the series ∑jφj(ξ)2 is locally finite with ∑jφj2∈[1/3,1] pointwise by [F1], so Tonelli's theorem [F6] applied to the nonnegative functions ∣φjf^∣2 gives ∑j≥0∥Δjf∥22=∫Rn(∑j≥0φj(ξ)2)∣f^(ξ)∣2 dξ, and the pointwise bounds sandwich this between 13∫∣f^∣2=13∥f∥22 and ∫∣f^∣2=∥f∥22. This proves the two-sided estimate, and the finiteness of ∑j∥Δjf∥22, for Schwartz f.

2.2F3F4F5step 1.1algebra

The identity Δjg^=φjg^ passes to L2. For j≥0 both maps g↦Δjg=g∗Kj and g↦F2−1(φjF2g) are bounded linear operators on L2 by [F3] and [F4], and they agree on the dense subspace S by step 1.1 and [F3]; given g∈L2 and a sequence gk∈S with gk→g from [F5], both operators applied to gk converge in L2 to their values at g, so Δjg=F2−1(φjF2g) and hence ∥Δjg∥22=∫φj2∣F2g∣2 for every j.

3.1F1F2F6step 2.2algebra∎

Conclusion. For g∈L2, step 2.2 gives ∥Δjg∥22=∫φj2∣F2g∣2 for every j, and Tonelli [F6] then gives ∑j≥0∥Δjg∥22=∫(∑jφj2)∣F2g∣2; the pointwise bounds 13≤∑jφj2≤1 and ∥g∥22=∫∣F2g∣2 from Plancherel [F2] yield 13∥g∥22≤∑j∥Δjg∥22≤∥g∥22, which is the stated two-sided estimate, and the finiteness of the sum.

Depends on

Used by

Dependency tree · two levels

76 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