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.

Grand maximal test class of order N and the grand maximal function

Definition

Fix an integer n≥1 and let S(Rn) carry the seminorms and topology of Schwartz space and its seminorms and Schwartz topology and convergence, with multi-indices as in Ck maps and multi-index derivative notation in Euclidean space. For each integer N≥1 and φ∈S(Rn) define the Schwartz test seminorm of order N PN(φ)=sup⁡x∈Rn(1+∣x∣)Nmax⁡∣α∣≤N+1∣∂αφ(x)∣ and the grand maximal test class of order N FN={φ∈S(Rn):PN(φ)≤1}.

For f∈S′(Rn) the grand maximal function of order N is MNf(x)=sup⁡φ∈FNsup⁡t>0sup⁡∣y−x∣≤t∣(f∗φt)(y)∣,x∈Rn, where φt(u)=t−nφ(u/t) and convolution is the distributional convolution of Convolution of a tempered distribution with a schwartz function. The dilated test φt is Schwartz for every t>0 (Dilations and their normalisations preserve Schwartz space, with scaling identities), so each displayed convolution is defined even when ∫φ=0. Thus the full class FN, including its zero-integral tests, is used. Each convolution has a finite scalar value and the supremum is a well-defined function with values in [0,∞]; the value +∞ is allowed and no measurability is asserted here. The class FN contains the zero function, is symmetric under φ↦−φ and under complex conjugation, and is nonempty for every N. No choice principle is used in this definition.

The order N is a parameter. The characterisation theorem on this page fixes a finite admissible order N0(n,p,φ)<∞ depending only on n, p and the fixed kernel φ and works for every N≥N0(n,p,φ); the value of N0 is whatever the accumulated comparison estimates of that proof require, and its existence, not an explicit formula, is what the page uses. The sources record the explicit sufficient choices N≥⌊n/p⌋+1 for the nontangential class FN in [DKKP, Proposition 1, p. 60], N>1+n/p for the radial class BN (with derivatives through order N) in [MSV, section 1, p. 16], and N>n/p+n+1 in [CUW, Theorem 3.1, p. 8]; these recorded choices are not used as the definition of N0 below. If N′≥N then (1+∣x∣)N′max⁡∣α∣≤N′+1∣∂αφ(x)∣≥(1+∣x∣)Nmax⁡∣α∣≤N+1∣∂αφ(x)∣ pointwise, so FN′⊆FN and hence MN′f≤MNfpointwise on Rn for every f∈S′: the grand maximal functions are monotone in the order. The aperture is fixed to one; the comparison with larger apertures is the subject of the domination lemma on this page.

Depends on

Used by

Dependency tree · two levels

19 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