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 Littlewood-Paley square function

Definition

Assume Countable Choice (The Axiom of Countable Choice (ACω)). With the fixed partition and operators of The inhomogeneous dyadic frequency partition and its Littlewood-Paley operators, for f∈Lp(Rn;C) with 1≤p<∞ and N≥0 define, for x∈Rn, SNf(x):=(∑j=0N−1∣Δjf(x)∣2)1/2,Sf(x):=(∑j≥0∣Δjf(x)∣2)1/2∈[0,∞]. The functions Δjf in these formulae are the convolution representatives f∗Kj of Dyadic pieces have annular Fourier support and uniformly bounded rescaled kernels. The following conventions and well-definedness facts are part of the definition.

  1. Each Δjf=f∗Kj lies in Lp by Dyadic pieces have annular Fourier support and uniformly bounded rescaled kernels. Its integral is defined at every x: Holder gives ∫∣f(u)Kj(x−u)∣du≤∥f∥p∥Kj∥p′, with p′=∞ when p=1 (Complex Holder, Minkowski, and the quotient norm). Translations of a Schwartz kernel are continuous in Lp′: for finite p′ use dominated convergence with a common Schwartz majorant, and for p′=∞ use its bounded first derivatives. Holder therefore makes this everywhere convolution representative continuous, hence Borel measurable (Dominated convergence, Borel measurable and Lebesgue measurable functions on Rn). Finite sums, products and the square root of nonnegative measurable functions preserve measurability (Arithmetic and lattice operations preserve measurability whenever they are defined), so every SNf is measurable and SNf≤SN+1f pointwise.
  2. Sf=sup⁡NSNf is measurable as the increasing limit of measurable functions, with values in [0,∞]; no finiteness is asserted, that is Sf(x)=+∞ is allowed a priori.
  3. Replacing f by an almost everywhere equal function in Lp replaces every convolution representative Δjf by an almost everywhere equal function, hence replaces Sf by an almost everywhere equal function; the functional is therefore defined on almost everywhere classes, and Sf is recorded as an almost everywhere function, exactly as the Lp classes of Complex Lp classes and Euclidean test-function conventions are.
  4. One writes ∥Sf∥p for the Lp norm of the class of Sf when Sf∈Lp; the norm is that of Lp(Rn;C), with Sf interpreted as the complex-valued function x↦Sf(x) (it is real-valued and nonnegative). The notation SFf for a finite set F⊂{0,1,2,… } means (∑j∈F∣Δjf∣2)1/2, so that SNf=S{0,…,N−1}f.

The operator-theoretic counterpart of S for functions on the frequency side is not asserted here: the definition names only the pointwise square function of the convolution representatives, and the strict-range equivalence with ∥f∥p is a theorem proved later on this page.

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