Alphabeta Math
Pipeline-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.

✓ 22 results · all verified · 7 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 15 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Real Hardy Spaces Maximal Functions and Atoms

1 · Prerequisites

2 · Summary

This page develops the real Hardy spaces Hp(Rn) for 0<p<∞. The space is defined by the radial maximal function of a fixed admissible Schwartz kernel φ with ∫φ≠0, and the page compares that definition with the nontangential maximal functions of aperture a≥1 and with the grand maximal function of order N built on the Schwartz test class FN. The atomic objects are the (p,∞,s)-atoms: functions supported in a nondegenerate axis-parallel cube, bounded by ∣Q∣−1/p and with all moments of order at most s=⌊n(1/p−1)⌋ vanishing.

The first part assembles the analytic tools. Dilations and their normalisations preserve Schwartz space with explicit seminorm identities, flat Schwartz functions exist with prescribed vanishing moments, Schwartz approximate identities converge in the tempered-distribution topology, and under Countable Choice, every tempered distribution has a unique local polynomial projection for a nonnegative smooth compactly supported weight of positive integral matching its moments through a prescribed order. Two covering lemmas are proved: a greedy countable cover of a proper open set by balls with controlled radii, sizes and overlap, and the all-generations dyadic Whitney decomposition with pairwise disjoint interiors, comparable touching cubes, a finite touching count and bounded overlap of the small dilates RQj, 1≤R≤2. A smooth deconvolution along dyadic dilations then expresses an arbitrary Schwartz function as a rapidly convergent series in the negative dilates of the fixed kernel φ, with Schwartz-norm coefficients decaying faster than any prescribed power.

The central theorem is the maximal-function characterisation: for each admissible kernel φ there is a finite order threshold N0(n,p,φ) such that for every N≥N0(n,p,φ) the conditions Mφ0f∈Lp, Mφ∗,af∈Lp and MNf∈Lp are equivalent, with equivalent extended quasi-norms. The threshold depends on the kernel through the deconvolution constants, while the thresholds recorded in the sources, N≥⌊n/p⌋+1 and N>n/p+n+1, refer to their own normalised grand maximal functions. The proof follows the truncation route: the truncated maximal functions Mϵ,L are finite and integrable for large L, the grand truncated function is pointwise dominated by the truncated tangential one, the good-set bootstrap with the Hardy-Littlewood maximal theorem closes the a priori estimate, and monotone convergence as ϵ↓0 removes the truncation. Borel measurability of all the maximal functions makes the Lp statements meaningful. A flat compactly supported kernel and the approximate-identity limit yield the Calderon reproducing formula used later.

From the characterisation the page derives that Hp=Lp with equivalent norms for 1<p<∞; the inclusion Hp⊆Lp uses the weak-star sequential compactness of the dual ball and is recorded as assuming the ultrafilter lemma, while the converse uses Countable Choice through the published maximal-function machinery. For 0<p≤1 the Calderon-Zygmund level decomposition of an Hp distribution produces (p,∞,s)-atoms with summable ℓp coefficients, ℓp-sums of atoms converge in S′ and in the Hp quasi-norm, atoms have a uniform Hp bound with a quantitative pairing estimate, and the resulting atomic characterisation identifies Hp with the space of atomic sums and gives the two-sided quasi-norm equivalence. The same route gives the Fourier decay ∣f^(ξ)∣≤C∥f∥Hp∣ξ∣n(1/p−1) with a little-o refinement, and hence the vanishing of all moments through order ⌊n(1/p−1)⌋ for Hp functions whose weighted moments through that order are absolutely integrable. Calderon-Zygmund operators with standard Holder kernels map H1 boundedly into L1; that theorem assumes Countable Choice, and the quasi-Banach remark records that ∥⋅∥Hp is only a quasi-norm for p<1.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicableOpen item page →

Hp atoms with a prescribed moment order

Definition

Let n≥1, let 0<p≤1 and let s∈N∪{0} satisfy s≥⌊n(1/p−1)⌋. A (p,∞,s)-atom is a measurable function a ⁣:Rn→C for which there is a nondegenerate axis-parallel cube Q (Axis-parallel rectangles in Rm and their volume, so all n side lengths are equal and positive) such that

  1. supp⁡a⊆Q, where the support is the closure of {a≠0};
  2. ∣a(x)∣≤∣Q∣−1/p for almost every x∈Rn;
  3. ∫Rna(x)xα dx=0 for every multi-index α with ∣α∣≤s (Ck maps and multi-index derivative notation in Euclidean space).

The exponent 1/p≥1 in the size bound and the order s are part of the datum, not free parameters of the function: a (p,∞,s)-atom is also a (p,∞,s′)-atom for every ⌊n(1/p−1)⌋≤s′≤s, because the moment conditions for the smaller order are among those already imposed. The zero function satisfies all three conditions; zero terms may be omitted from atomic representations.

Under Countable Choice (The Axiom of Countable Choice (ACω)), every moment in condition 3 is an absolutely convergent Lebesgue integral; the supporting cube has its finite volume by A box in Rn with parameters ai≤bi is Lebesgue measurable of measure ∏i<n(bi−ai), whichever of its faces are included. Indeed a vanishes a.e. off the bounded set Q and ∣axα∣≤∣Q∣−1/psup⁡x∈Q∣xα∣ a.e. on Q, a bounded function on a set of finite measure; the monomial xα is continuous and hence Borel measurable by Continuous functions on Euclidean spaces are Borel measurable. Applying Arithmetic and lattice operations preserve measurability whenever they are defined to the real and imaginary parts of a shows that axα is measurable, so the integral is defined and finite. The a.e. bound in condition 2 is an essential supremum bound, ∥a∥∞≤∣Q∣−1/p (The essential supremum of a measurable function with respect to a measure); replacing a by another representative of its a.e. class preserves conditions 2 and 3 but can change the support in condition 1, so the support condition is imposed for the chosen representative.

The page fixes the order sp=⌊n(1/p−1)⌋. This is the least integer compatible with condition 3, and it is the order used by the sources: DKKP require moments through n(p−1−1), Wang and Hiserote through ⌊n(1/p−1)⌋. The threshold moves exactly at the integers: sp=0 for n/(n+1)<p≤1, sp=1 for n/(n+2)<p≤n/(n+1), and so on. For p=1 the definition specialises to the classical L∞ atoms of H1: support in a cube, ∣a∣≤∣Q∣−1 a.e. and ∫a=0 (Conjugate exponents, including the endpoint conventions records the exponent convention used for the dual exponents invoked later on this page).

The ball-supported atoms of the sources differ from this convention only by fixed constants: a cube Q containing a ball B with ∣B∣≤∣Q∣≤cn∣B∣ carries the same conditions up to the dimensional factor cn1/p, and nondegeneracy rules out the degenerate cubes of zero volume that occur in moment conditions. The three conditions define the class without selecting representatives; the accompanying Lebesgue-integrability assertions use Countable Choice.

LemmaStatement: Literature-sourcedProof: Literature-sourcedprecheck passjudge pass (gpt-6.1-sol)Open item page →

Schwartz functions with prescribed flatness of the Fourier transform at the origin

Statement

Assume Countable Choice. Let n≥1. For every integer m≥1 there is a real, even function φ∈Cc∞(Rn) with supp⁡φ⊆B(0,1),∫Rnφ≠0,∫Rnxαφ(x) dx=0  for 0<∣α∣≤m. Equivalently, under the Fourier convention of Fourier differentiation and multiplication identities on tempered distributions, φ^(0)≠0 and ∂αφ^(0)=0 for every multi-index with 0<∣α∣≤m. The construction is uniform in m: a single one-dimensional finite-difference construction achieves every prescribed finite flatness order, and its tensor product is used.

Facts & Assumptions

Given: Countable Choice, an integer n≥1 and an integer m≥1. The multi-index notation is that of Ck maps and multi-index derivative notation in Euclidean space and the seminorms are those of Schwartz space and its seminorms.

[A1]

Countable Choice is assumed, in particular for the Fourier differentiation identity and the Lebesgue change-of-variables formula cited below (The Axiom of Countable Choice (ACω)).

[F1]

There is a smooth bump: with σ the standard smooth step function of The standard smooth step function, which is smooth, vanishes on (−∞,0] and equals 1 on [1,∞), the function θ(x):=σ(116−x2) is smooth (composition of the smooth functions σ and x↦116−x2, The chain rule, in one line from Carathéodory: if g is differentiable at c and f is differentiable at g(c), then f∘g is differentiable at c with (f∘g)′(c)=f′(g(c)) g′(c)), even, positive on (−1/4,1/4) (where 116−x2∈(0,116] and σ>0 on (0,∞)) and supported in [−1/4,1/4] (where 116−x2≥0).

[F2]

Newton-Leibniz with an interior derivative: if G is continuous on [a,b], differentiable on (a,b) and G′=g there with g Riemann integrable, then ∫abg=G(b)−G(a) (Newton–Leibniz needs only continuity on [a,b], differentiability on (a,b), and a Riemann-integrable extension of the interior derivative). Applied inductively this gives, for f∈Cm(R) and h>0, the iterated integral representation Δhmf(x)=∫[−h,h]mf(m)(x+s1+⋯+sm) ds1⋯dsm,Δhf(x)=f(x+h)−f(x−h). There is no factorial prefactor in this representation: each finite-difference factor introduces one integration over [−h,h]. Any factorial below comes from evaluating the derivative f(m), not from the integration formula.

[F3]

Under the Fourier convention of Fourier differentiation and multiplication identities on tempered distributions, for φ∈S and every multi-index α one has ∂αφ^(0)=(−2πi)∣α∣∫Rnxαφ(x) dx; equivalently, if all mixed moments ∫xαφ, 0<∣α∣≤m, vanish then ∂αφ^(0)=0 for those α, and conversely.

[F4]

Riemann Fubini on a product rectangle factors the integral of a continuous compactly supported tensor product; the coordinate dilation uses the change-of-variables formula (Riemann--Fubini on product rectangles, with lower and upper section integrals and content-zero exceptional sections, A C^1 diffeomorphism satisfies the change-of-variables formula for L^1 functions).

Proof technique: finite differences of a bump in one dimension, then tensor product, dilation and normalisation.

Proof

technique · constructive
1.1givenconstruct

Reduction to even order. If m is odd, replace it by m+1: a function whose moments vanish through order m+1 also has all moments vanishing through order m. We may therefore assume m≥2 is even, and we write h=1/(8m). This uses no choice.

1.2F1givenalgebra

The one-dimensional construction. Let θ be the even bump of [F1] and put Θ(x)=θ(x+1/2)−θ(x−1/2). Then Θ∈Cc∞(R) is real, odd, and supported in [−3/4,−1/4]∪[1/4,3/4]; moreover Θ(x)=−θ(x−1/2)<0 on (1/4,3/4) and Θ(x)=θ(x+1/2)>0 on (−3/4,−1/4). Define ϕ(x)=x−1ΔhmΘ(x). Since supp⁡ΔhmΘ⊆[−3/4−mh,3/4+mh]=[−7/8,7/8] and is bounded away from 0, the factor x−1 is smooth on a neighbourhood of that support, so ϕ∈Cc∞(R) with support in [−7/8,7/8]. The reflection operator (Pf)(x)=f(−x) satisfies PΔh=−ΔhP; since Θ is odd and m is even, ΔhmΘ is odd, so ϕ is even and real.

1.3A1algebra

The flatness of the one-dimensional Fourier transform. For 1≤ν≤m, differentiating ϕ^(ξ)=∫e−2πiξxϕ(x) dx under the integral sign and using the polynomial identity Δhm(xν−1)=0 (the m-th finite difference of a polynomial of degree ν−1≤m−1 vanishes) gives ϕ^(ν)(0)=(−2πi)ν∫Rxν−1ΔhmΘ(x) dx=(−2πi)ν∫R(Δhmxν−1)(x) Θ(x) dx=0, where the middle equality is the self-adjointness ∫f (Δhmg)=∫(Δhmf) g of the even-order finite difference, which follows from the translation invariance of Lebesgue measure and (Δh)∗=−Δh.

1.4A1F2algebra

Nonvanishing of the mean. Using self-adjointness again, ∫Rϕ=∫Rx−1ΔhmΘ(x) dx=∫R(Δhmx−1)(x) Θ(x) dx. On the support of Θ one has ∣x∣≥1/4, and all points x+s1+⋯+sm in the iterated integral representation of [F2] stay on the same side of zero. Since m is even, (x−1)(m)=m!x−m−1 has the sign of x, while Θ has the opposite sign on each of its two support components. Thus the integrand (Δhmx−1)Θ has one constant sign and there is no cancellation. By [F2], Δhm(x−1)(x)=m!∫[−h,h]m(x+s1+⋯+sm)−m−1 ds1⋯dsm. The integrand has a constant sign on this box, so its absolute value is the integral of the absolute value. The factor m! comes from (x−1)(m); the iterated integral contributes the box volume (2h)m. Therefore ∣Δhm(x−1)(x)∣=m!∫[−h,h]m∣x+s1+⋯+sm∣−m−1 ds1⋯dsm≥(2h)mm!(7/8)−m−1 for every x∈supp⁡Θ, because ∣x+s1+⋯+sm∣≤3/4+mh=7/8. Hence ∣∫Rϕ∣=∫R∣Δhmx−1∣ ∣Θ∣≥(2h)mm!(7/8)−m−1∫R∣Θ∣>0, since Θ is continuous and not identically zero.

2.1A1step 1.3step 1.4F3F4algebra

The tensor product and its moments. Put ψ(x)=ϕ(x1)ϕ(x2)⋯ϕ(xn) and Ψ(x)=ψ(λx) with λ=n+1>7n/8; then Ψ∈Cc∞(Rn) is real and even and supp⁡Ψ⊆[−7/(8λ),7/(8λ)]n⊆B(0,1), since the euclidean circumradius of that cube is (7/8)n/λ<(7/8)n/(7n/8)=1. For a multi-index α with 0<∣α∣≤m the substitution x=λ−1t gives the factorisation ∫RnxαΨ(x) dx=λ−n−∣α∣∏j=1n∫Rtαjϕ(t) dt. If αj=0 the corresponding factor is ∫ϕ≠0 by step 1.4; if αj≥1 then αj≤∣α∣≤m, and ∫tαjϕ(t) dt=0 by step 1.3 combined with [F3] applied in one dimension. Hence every factor with αj≥1 vanishes and the product is zero.

3.1A1step 2.1F3discharge-construct∎

Normalisation and conclusion. Step 2.1 gives ∫Ψ=λ−n(∫ϕ)n≠0, so φ=(∫RnΨ)−1Ψ is real, even, smooth and compactly supported in B(0,1), with ∫φ=1 and all moments ∫xαφ, 0<∣α∣≤m, still vanishing. The Fourier form of the statement follows from the differentiation identity of [F3] and Ψ^(0)=∫Ψ≠0, together with the linearity of the Fourier transform under the real scalar normalisation. This proves the lemma.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

Local polynomial projections matching moments through order s

Statement

Assume Countable Choice (The Axiom of Countable Choice (ACω)). Let Q⊆Rn be a nondegenerate axis-parallel cube with centre cQ, side length ℓ(Q) and volume ∣Q∣ in the sense of Axis-parallel rectangles in Rm and their volume. Fix λ>1 and write Q∗:={x∈Rn:∥x−cQ∥∞<λℓ(Q)/2} for its open concentric dilation. Let N∈N∪{0}, and let ωQ∈Cc∞(Rn) be real, nonnegative, with ∫RnωQ>0 and supp⁡ωQ⊂Q∗. Then for every tempered distribution f∈S′(Rn) there is a unique moment-matching polynomial PQ of total degree at most N such that ⟨f−PQ, xαωQ⟩=0for every multi-index ∣α∣≤N. The polynomial PQ depends only on the restriction of f to an open neighbourhood of supp⁡ωQ: for every open U⊇supp⁡ωQ, if g∈S′ agrees with f as a distribution on U, then PQg=PQf. When f is represented by a function in L2(ωQ(x) dx), this is the orthogonal projection of f onto the polynomials of degree at most N in that weighted inner product space, with inner product (P,R)ωQ=∫RnP(x)R(x)‾ ωQ(x) dx. This inner product is positive definite on the polynomial subspace because ωQ≥0 and ∫ωQ>0.

Facts & Assumptions

Given: Countable Choice and a nondegenerate axis-parallel cube Q, an integer N≥0, a test function ωQ as in the statement, f∈S′(Rn), and multi-indices with the conventions of Ck maps and multi-index derivative notation in Euclidean space.

[L1]

A nonnegative continuous function on an open set with positive integral is positive at some point, hence positive on a nonempty open subset of that set; a polynomial vanishing on a nonempty open set is zero: at an interior point all its partial derivatives vanish, and its finite expansion about that point, obtained by the binomial formula for each monomial, has precisely those derivatives as coefficients (The spaces Cc(Rn) and Cc∞(Rn) fixes the support convention).

[F1]

xαωQ∈Cc∞(Rn)⊆S(Rn), so the pairings ⟨f,xαωQ⟩ and, for polynomials P, the regular-distribution pairings ⟨P,xαωQ⟩=∫P xαωQ are defined; polynomials are locally integrable and P xαωQ∈S (Schwartz space and its seminorms, Tempered distribution, Regular distribution from a locally integrable function).

[F2]

The space PN of polynomials of total degree at most N has finite dimension d=(N+nn), and the monomials xα, ∣α∣≤N, form a basis (Ck maps and multi-index derivative notation in Euclidean space). A finite-dimensional linear system with invertible matrix has a unique solution.

[F3]

If two distributions agree on an open set U, then their pairings with every test function supported in U agree: this is the definition of agreement of distributions on U (Distribution). In particular, if h∈Cc∞(Rn) is supported in U and f=0 on U, then ⟨f,h⟩=0.

[F4]

Since ωQ is measurable and nonnegative, dμQ=ωQ(x) dx is the measure with density ωQ relative to Lebesgue measure (The measure with density f relative to μ).

[F5]

On the measure space (Rn,μQ) the pairing ([u],[v])↦∫uv‾ dμQ is the well-defined complex L2 inner product (The complex L2 pairing is well-defined and satisfies Cauchy–Schwarz).

Proof technique: positive-definite Gram matrix on the finite-dimensional polynomial space.

Proof

technique · direct
1.1L1F1F2algebra

The Gram matrix. Set Gαβ=∫Rnxα+βωQ(x) dx for ∣α∣,∣β∣≤N. If P=∑∣α∣≤Ncαxα satisfies ∫∣P∣2ωQ=0, then ∣P∣2ωQ=0 Lebesgue-a.e.; since ∣P∣2 is continuous and ωQ is continuous and positive on a nonempty open set by [L1] (using ∫ωQ>0 and ωQ≥0), P vanishes on that open set, hence P=0 and all cα=0 by [L1] and [F2]. Writing ∫∣P∣2ωQ=∑α,βcα‾cβGαβ, positive definiteness follows, so G is invertible.

2.1step 1.1F1F2F4F5algebra

Existence and uniqueness. The vector b=(⟨f,xαωQ⟩)∣α∣≤N∈Cd is well defined by [F1], so [F2] gives a unique coefficient vector c=G−1b and a polynomial PQ=∑∣α∣≤Ncαxα with ⟨PQ,xβωQ⟩=∑αcαGαβ=bβ=⟨f,xβωQ⟩ for every ∣β∣≤N; that is, ⟨f−PQ,xβωQ⟩=0. If f is represented by an element of L2(μQ), then for every polynomial R of degree at most N its conjugate is a linear combination of the real monomials xα, and the moment equations give (f−PQ,R)ωQ=∫(f−PQ)R‾ dμQ=0 by [F4, F5]. Thus PQ is the orthogonal projection onto the polynomial subspace in the weighted L2 inner product space. If P′,P′′ both satisfy the moment equations, then R=P′−P′′ satisfies ⟨R,xαωQ⟩=0 for ∣α∣≤N, so ∫∣R∣2ωQ=∑cα‾⟨R,xαωQ⟩=0 with cα the coefficients of R, because R‾=∑cα‾xα, and step 1.1 gives R=0. This proves existence and uniqueness.

3.1step 2.1F3given

Locality. Let U be the given neighbourhood of supp⁡ωQ on which f and g agree as distributions. For every ∣α∣≤N, the test function xαωQ is supported in supp⁡ωQ⊂U, so [F3] gives ⟨f−g,xαωQ⟩=0. Hence f and g produce the same vector b in step 2.1, and therefore the same PQ=G−1b. This proves the locality statement.

4.1step 1.1step 2.1step 3.1∎

Conclusion. Step 1.1 shows that the Gram matrix is positive definite, step 2.1 constructs the unique moment-matching polynomial and identifies it as the weighted L2 orthogonal projection when that interpretation applies, and step 3.1 records dependence only on the distribution near the support of the weight. This proves the lemma.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

Dilations and their normalisations preserve Schwartz space, with scaling identities

Statement

Let n≥1, φ∈S(Rn) and t>0, and write (Dtφ)(x)=φ(x/t),φt(x)=t−nφ(x/t). Then Dtφ,φt∈S(Rn), with the seminorm identities pαβ(Dtφ)=t∣α∣−∣β∣pαβ(φ),pαβ(φt)=t∣α∣−∣β∣−npαβ(φ) for all multi-indices α,β (Schwartz space and its seminorms, Ck maps and multi-index derivative notation in Euclidean space). Consequently each Dt maps S continuously into itself for the Schwartz topology (Schwartz topology and convergence).

Assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)). Then ∫Rnφt(x) dx=∫Rnφ(x) dx,∫Rn∣x∣m∣φt(x)∣ dx=tm∫Rn∣x∣m∣φ(x)∣ dx for every integer m≥0, both sides finite (Schwartz derivatives are integrable).

The identities are stated for t>0; the normalisation is chosen so that the L1 mass and the first moments scale by the powers tm, which is what the later approximate-identity argument consumes. The unnormalised dilation satisfies Dtφ=tnφt, and the factor t−n does not affect membership in S, which is closed under nonzero scalar multiples.

Facts & Assumptions

Given: n≥1, φ∈S(Rn), t>0, and the seminorms, topology and partial derivatives of Schwartz space and its seminorms, Schwartz topology and convergence and Ck maps and multi-index derivative notation in Euclidean space. Under countable choice, A C^1 diffeomorphism satisfies the change-of-variables formula for L^1 functions gives the substitution formula for the C1 diffeomorphism T(y)=ty of Rn with ∣det⁡DT(y)∣=tn, and Schwartz derivatives are integrable gives xα∂βφ∈L1 for all multi-indices.

[L1]

The j-th partial derivative of a function f at x is ∂jf(x)=lim⁡h→0(f(x+hej)−f(x))/h, and partial derivatives of a Schwartz function exist and are continuous (Ck maps and multi-index derivative notation in Euclidean space, Schwartz space and its seminorms).

[F1]

∣x∣m≤(1+∣x∣2)m/2≤∑∣α∣≤mcα∣xα∣ with finite constants cα, and a nonnegative measurable function dominated by a finite sum of L1 functions lies in L1 (Schwartz derivatives are integrable).

Proof technique: direct computation with the chain rule along coordinate axes, then the change-of-variables formula.

Proof

technique · direct
1.1L1givenalgebra

Differentiation of a dilation. Let f=φ∘A with A(x)=x/t, and fix j≤n and x∈Rn. Writing z=x/t and s=h/t, the one-variable difference quotient of the map h↦f(x+hej) equals t−1(φ(z+sej)−φ(z))/s, and s→0 exactly when h→0, so the limit exists and equals t−1∂jφ(z) by [L1]; there is no division by a vanishing quantity because t>0. Induction on ∣β∣, applying the same computation to the C1 function ∂γφ at the point x with γ the predecessor of β, gives ∂β(Dtφ)(x)=t−∣β∣(∂βφ)(x/t).

1.2F1given

The scaling identities. By [F1] and [L1] the functions φ, ∣φ∣, xα∂βφ and ∣x∣m∣φ∣ are integrable, so the change-of-variables formula applies to them. Applying it to φ with T(y)=ty and ∣det⁡DT∣=tn gives ∫φt(x) dx=t−n∫φ(x/t) dx=∫φ(y) dy, and applying it to the nonnegative integrable function ∣x∣m∣φ(x)∣ gives ∫∣x∣m∣φ(x/t)∣ dx=tn+m∫∣y∣m∣φ(y)∣ dy, whence the moment identity after multiplying by t−n. The factor t−ntn+m=tm is finite for every m≥0 and t>0.

2.1L1step 1.1givenalgebra

Membership and the seminorm identities. Substituting y=x/t in ∣xα∂β(Dtφ)(x)∣=t−∣β∣∣xα(∂βφ)(x/t)∣ gives t∣α∣−∣β∣∣yα∂βφ(y)∣, valid for every x∈Rn; taking suprema over x is taking suprema over y and proves pαβ(Dtφ)=t∣α∣−∣β∣pαβ(φ)<∞. Multiplying by the scalar t−n proves the second identity and makes Dtφ,φt elements of S, since these are finite for all α,β by [L1] and the given. For fixed t the constants t∣α∣−∣β∣−n are finite, so for every basic neighbourhood the finitely many relevant input seminorms of φ control the output seminorms; this is continuity of Dt at zero, hence everywhere by linearity.

3.1step 2.1step 1.2∎

Conclusion. Step 2.1 gives membership, the two seminorm identities, and continuity of Dt on S; step 1.2 gives the integral and moment identities under countable choice, which is inherited from the substitution theorem. This proves the lemma.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

Whitney decomposition of a proper open subset of Euclidean space

Statement

Assume Countable Choice (The Axiom of Countable Choice (ACω)). Let n≥1 and let Ω⊆Rn be nonempty, open and proper. Write ℓ(Q)=2−k  for the generation-k dyadic cube Q,d(Q)=inf⁡{∣x−y∣:x∈Q, y∈Rn∖Ω} for the all-generations dyadic cubes of Dyadic cubes of all generations in R^n. Then there is a countable family W=(Qj)j∈N of dyadic cubes, with pairwise disjoint interiors, such that

  1. Ω=⋃jQj and n ℓ(Qj)≤d(Qj)≤4n ℓ(Qj) for every j;
  2. if Q,Q′∈W have intersecting closures, then 15ℓ(Q)≤ℓ(Q′)≤5ℓ(Q);
  3. every Q∈W has intersecting closures with at most K(n):=2⋅2n+3n+4n+6n cubes of W (the source [K, Remark 1.11] records the sharper count 12n for its construction; only finiteness of K(n) is used below);
  4. for every 1≤R≤2 the dilated cubes RQj:={cj+R(x−cj):x∈Qj}, cj the centre of Qj, have overlap bounded by a constant Cn<∞ depending only on n (the bound is uniform in R∈[1,2]).

In the diametral normalization the published form [W, Theorem 14.5] records diam⁡Qj≤dist⁡(Qj,Ωc)≤4diam⁡Qj for a family with the same covering and disjointness properties. The dilation restriction R≤2 is not a defect of the construction: for the Whitney family of Ω=(0,∞)⊆R the intervals Qk=(2k,2k+1] have R-dilations containing the fixed point x=1 for infinitely many k as soon as R≥3, so no bound uniform in R can hold.

Facts & Assumptions

Given: n≥1, a nonempty proper open set Ω⊆Rn, Countable Choice, and the dyadic cubes of Dyadic cubes of all generations in R^n with the partition, volume and nesting properties of All-generation dyadic cubes: partition, volume and nesting.

[L1]

The dyadic cube Qk,m of generation k is a half-open box of side 2−k and volume 2−kn; cubes at one generation are pairwise disjoint and cover Rn; two dyadic cubes are disjoint or one contains the other (Dyadic cubes of all generations in R^n, All-generation dyadic cubes: partition, volume and nesting). The closed cube Q‾ is contained in the closed ball of radius n2ℓ(Q) about the centre cQ, and its diameter is n ℓ(Q).

[L2]

For a nonempty set A and z∈Rn one has ∣d(z)−d(z′)∣≤∣z−z′∣ where d(z)=dist⁡(z,Ωc); in particular d is continuous on Ω and d(Q)=inf⁡y∈Qd(y) satisfies d(Q)≤d(y) for every y∈Q. If z lies in the closure of Q, then d(z)≥d(Q).

[L3]

The dilation volume identity ∣rE∣=rn∣E∣ holds for measurable E and r>0 (For a nonzero real c, dilation by c multiplies Lebesgue outer measure by ∣c∣n, and reflection in the origin preserves it).

Proof technique: the distance-compatible dyadic rule, then maximal elements and packing estimates.

Proof

technique · constructive
1.1L1givenalgebraconstruct

The distance rule. For x∈Ω put d(x)=dist⁡(x,Ωc)>0; the positivity uses that Ω is open and Ωc closed. Since the dyadic numbers 2−k, k∈Z, partition (0,∞) into the intervals (2−k−1,2−k], there is exactly one k(x)∈Z with 2−k(x)−1<d(x)/(4n)≤2−k(x), and then d(x)/(4n)≤ℓ(x):=2−k(x)<d(x)/(2n). Let Q(x) be the unique dyadic cube of generation k(x) containing x, which exists because generation k(x) partitions Rn by [L1]. Put G={Q(x):x∈Ω}.

2.1step 1.1L1L2algebra

Cubes of the rule are contained in Ω with controlled distance. If y∈Q(x), then ∣y−x∣≤n ℓ(x)<d(x)/2, so d(y)≥d(x)−∣y−x∣>d(x)/2≥n ℓ(x) by [L2], and therefore d(Q(x))=inf⁡y∈Q(x)d(y)≥n ℓ(x)>0. In particular Q(x)∩Ωc=∅, that is, Q(x)⊆Ω, and Q(x)∈G satisfies the lower bound of claim 1. Thus every point of Ω lies in an element of G.

3.1step 1.1step 2.1L1given

Maximal elements. For each fixed Q∈G, let GQ:={Q′∈G:Q⊆Q′}. Choose the witness x∈Ω with Q=Q(x) supplied by the definition of G. Every member Q′ of this particular set GQ contains x. By step 2.1, n ℓ(Q′)≤d(Q′)≤d(x), while dyadic nesting gives ℓ(Q′)≥ℓ(Q). Thus its side length lies in the finite dyadic range [ℓ(Q),d(x)/n]; at each generation there is only one dyadic cube containing this fixed x. Therefore GQ is finite and nonempty. Its members are nested, so it has a unique largest member by side length, which is maximal in G. Let W be the set of all maximal elements of G. Every Q∈G lies in one of them by the preceding finite-superset argument; the set of all dyadic cubes is countable, hence so is W. This construction uses only G-supersets of each fixed cube, not a maximality principle over all cubes.

4.1step 2.1step 3.1L1

Covering, disjointness and the lower bound. Every x∈Ω lies in some Q(x)∈G, hence in a maximal element of G containing it, so Ω=⋃Q∈WQ. Dyadic cubes are nested or disjoint by [L1], and maximality of the elements of W rules out proper inclusion, so distinct elements of W are disjoint (their interiors are disjoint, indeed the cubes themselves are disjoint as half-open sets). Each Q∈W belongs to G, so n ℓ(Q)≤d(Q) by step 2.1.

5.1step 1.1step 4.1L2algebra

The upper bound is built into the rule. Fix Q∈W and x∈Ω with Q=Q(x), which exists because W⊆G. By definition of ℓ(x) one has d(x)≤4n ℓ(x), and d(Q)≤d(x) because x∈Q; with the lower bound of step 4.1 this gives n ℓ(Q)≤d(Q)≤d(x)≤4n ℓ(Q), which proves claim 1.

6.1step 4.1step 5.1L1L2algebra

Touching cubes have comparable sizes. Let Q,Q′∈W have intersecting closures and let z be a common point. Then d(z)≥d(Q)≥n ℓ(Q) by [L2] and step 4.1. Choose y∈Q′ with d(y)<d(Q′)+ε; since z∈Q′‾ one has ∣z−y∣≤diam⁡(Q′)=n ℓ(Q′), so d(z)≤∣z−y∣+d(y)<n ℓ(Q′)+d(Q′)+ε≤n ℓ(Q′)+4n ℓ(Q′)+ε=5n ℓ(Q′)+ε, the last inequality by step 5.1 applied to Q′. Letting ε↓0 gives n ℓ(Q)≤5n ℓ(Q′), hence ℓ(Q)≤5ℓ(Q′); interchanging the roles of the two cubes gives ℓ(Q′)≤5ℓ(Q). This proves claim 2 with the stated factor 5.

6.2step 4.1step 5.1L2L3givenalgebra

Bounded overlap of small dilates. Fix 1≤R≤2 and x∈Rn, and let J be the set of j with x∈RQj; write cj for the centre, ℓj=ℓ(Qj) and Bj=B(cj,ℓj/2). Distinct cubes of the family are disjoint and each contains Bj, so the balls Bj are pairwise disjoint. If x∈RQj, then x=cj+R(y−cj) for some y∈Qj, so dist⁡(x,Qj)≤∣x−y∣=(R−1)∣y−cj∣≤n2ℓj. Since d is 1-Lipschitz and d(z)≥d(Qj) for z∈Qj, this gives d(x)≥d(Qj)−dist⁡(x,Qj)≥n2ℓj>0. For the other direction, for each δ>0 choose u,v∈Qj with ∣x−u∣<dist⁡(x,Qj)+δ and d(v)<d(Qj)+δ. Lipschitz continuity and ∣u−v∣≤diam⁡(Qj) give d(x)≤d(v)+∣x−v∣≤d(Qj)+dist⁡(x,Qj)+diam⁡(Qj)+2δ; letting δ↓0 yields d(x)≤d(Qj)+dist⁡(x,Qj)+diam⁡(Qj). By step 5.1 and diam⁡(Qj)=nℓj, d(x)≤4nℓj+nℓj+n2ℓj=112nℓj, so ℓj≥2d(x)/(11n). The lower bound for d(x) also gives ℓj≤2d(x)/n, hence ∣x−cj∣≤Rn2ℓj≤nℓj≤2d(x). The disjoint balls B(cj,d(x)/(11n))⊆Bj therefore have centres in B(x,3d(x)) and a common radius d(x)/(11n). The packing estimate [L3] bounds their number by (66n+1)n. Thus the dilated cubes have overlap at most Cn=(66n+1)n, uniformly for 1≤R≤2.

7.1step 6.1L1algebra

Counting touching cubes. Fix Q∈W with side ℓ and generation k. By step 6.1, a touching cube has side in [ℓ/5,5ℓ], so its generation lies in {k−2,k−1,k,k+1,k+2}. At generations k,k+1,k+2, at most 3,4,6 coordinate intervals, respectively, have closures meeting a given closed interval of length ℓ; hence the counts are at most 3n,4n,6n. At each of the two coarser generations, the interval of Q lies inside a single dyadic interval of that generation. Its closure can meet at most that interval and one adjacent interval, because ℓ is strictly less than the coarse side length and all endpoints lie on the fine grid. Thus each coarser generation contributes at most 2n cubes. Summing proves claim 3 with K(n)=2⋅2n+3n+4n+6n.

8.1step 4.1step 5.1step 6.1step 7.1step 6.2discharge-construct∎

Conclusion. Steps 4.1 and 5.1 provide a countable family of dyadic cubes with pairwise disjoint interiors, union Ω and the two-sided distance estimate; step 6.1 gives the touching size comparison; step 7.1 gives the explicit touching count K(n)=2⋅2n+3n+4n+6n; step 6.2 gives the bounded overlap of the dilations with 1≤R≤2. This proves the lemma.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

Whitney-type ball cover with disjoint small balls and bounded overlap

Statement

Assume Countable Choice. Let n≥1 and let Ω⊆Rn be nonempty, open and proper. Put ρ(x)=dist⁡(x,Rn∖Ω) for x∈Rn. Then there is a countable family of points ξj∈Ω, j∈N, with ρj:=ρ(ξj), such that

  1. Ω=⋃jB(ξj,ρj/2);
  2. the balls B(ξj,ρj/8) are pairwise disjoint (the source's maximal-selection construction records ρj/5, which the present choice-free greedy selection replaces by the fixed larger constant 8; only the existence of a fixed constant matters below);
  3. if B(ξj,3ρj/4)∩B(ξν,3ρν/4)≠∅, then 17ρj≤ρν≤7ρj;
  4. for every j at most K(n):=785n of the balls B(ξν,3ρν/4) meet B(ξj,3ρj/4).

The family is the greedy subfamily of the countable rational grid {B(q,ρ(q)):q∈Ω∩Qn}: the grid is enumerated by restriction of a fixed enumeration of Qn, and the point q(j) is selected exactly when B(q(j),ρ(q(j))/8) meets none of the balls B(q(i),ρ(q(i))/8) with i<j already selected. In particular no maximality principle and no choice beyond Countable Choice is used.

Facts & Assumptions

Given: n≥1, Ω nonempty, open and proper, and the distance function ρ as in the statement.

[L1]

Since Ω is proper, A=Rn∖Ω is nonempty, so ρ(x)=inf⁡a∈A∣x−a∣ is finite and ∣ρ(x)−ρ(y)∣≤∣x−y∣ by ∣d(x,A)−d(y,A)∣≤d(x,y), so the distance to a fixed nonempty set is 1-Lipschitz. If x∈Ω, openness gives r>0 with B(x,r)⊆Ω, hence ρ(x)≥r>0; if x∉Ω, then x∈A and ρ(x)=0. Here B(x,r)={y:∣y−x∣<r} as in Open ball, closed ball and sphere in a metric space.

[L2]

Qn is countable and dense in Rn, so Qn admits a fixed enumeration q(0),q(1),… and every nonempty open subset of Ω contains a point of Ω∩Qn (Q is countably infinite, Both Q and R∖Q are dense in R, and every nonempty open subset of R is uncountable).

[L3]

For every a∈Rn and r>0, λ(B(a,r))=cnrn with cn=ωn−1/n>0; this follows from the centred-ball formula and translation invariance. Lebesgue measure is finitely additive on disjoint measurable sets and monotone. Hence a finite family of pairwise disjoint open balls of common radius r>0 with centres in a ball of radius R has at most (2R/r+1)n members: they lie in the ball of radius R+r, and comparing the volume of their union with that containing ball gives the bound (Sphere and ball measures scale in Rn, Lebesgue outer measure, Lebesgue measurability and Lebesgue measure are unchanged by translation, Assuming countable choice, L(Rn) is a sigma-algebra containing every elementary set and λn is a complete measure extending elementary volume, Measures are monotone).

Proof technique: greedy selection on the countable rational grid, then the covering, comparison and packing estimates.

Proof

technique · constructive
1.1L1L2algebraconstruct

Grid covers Ω. For x∈Ω and δ=ρ(x)/64>0, density [L2] gives q∈Ω∩Qn with ∣x−q∣<δ. Then [L1] gives ρ(q)≥ρ(x)−∣x−q∣>(63/64)ρ(x), so ρ(q)>0 and ∣x−q∣<ρ(x)/64<ρ(q)/2; hence x∈B(q,ρ(q)/2). Thus {B(q,ρ(q)/2):q∈Ω∩Qn} covers Ω.

1.2L2given

Greedy selection. Enumerate Ω∩Qn as q(0),q(1),… by restriction of the fixed enumeration of Qn. Define J⊆N recursively: j∈J if and only if the ball B(q(j),ρ(q(j))/8) meets none of the balls B(q(i),ρ(q(i))/8) with i<j, i∈J; the decision at step j depends only on finitely many previous data, so this is a deterministic recursion requiring no choice. Writing ξj=q(j) and ρj=ρ(ξj) for j∈J, the selected balls B(ξj,ρj/8) are pairwise disjoint by construction.

2.1step 1.1step 1.2L1L2algebra

Covering property. Let x∈Ω and let q=q(j)∈Ω∩Qn satisfy ∣x−q∣<ρ(x)/64, which exists by density [L2]. If j∈J, then ∣x−ξj∣=∣x−q∣<ρ(x)/64 and ρj=ρ(q)>63ρ(x)/64, so ∣x−ξj∣<ρ(x)/64<ρj/63<ρj/2 and x∈B(ξj,ρj/2). If j∉J, then at step j the ball B(q,ρ(q)/8) met some selected ball B(ξi,ρi/8) with i<j, so ∣q−ξi∣<ρ(q)+ρi8,henceρ(q)≤ρi+∣q−ξi∣<ρi+ρ(q)+ρi8, which gives 78ρ(q)<98ρi, that is ρ(q)<97ρi. Therefore ∣q−ξi∣<18(97+1)ρi=27ρi<12ρi, and, since ∣x−q∣<ρ(x)/64 while ρ(x)≤ρ(q)+∣x−q∣<ρ(q)+ρ(x)/64 gives ρ(x)<6463ρ(q)<6463⋅97ρi=6449ρi, we obtain ∣x−ξi∣≤∣x−q∣+∣q−ξi∣<ρ(x)64+27ρi<149ρi+27ρi=1549ρi<12ρi. Hence x∈B(ξi,ρi/2) in this case as well, which proves claim 1.

2.2step 1.2L1algebra

Comparison of meeting balls. Suppose B(ξj,3ρj/4)∩B(ξν,3ρν/4)≠∅. Then ∣ξj−ξν∣<34(ρj+ρν) and [L1] gives ρj≤ρν+∣ξj−ξν∣<ρν+34ρj+34ρν, hence 14ρj<74ρν, that is ρj<7ρν; interchanging j,ν gives the reverse inequality. This proves claim 3.

3.1step 1.2step 2.2L3algebra

Bounded overlap. Fix j and let N be the set of ν with B(ξν,3ρν/4)∩B(ξj,3ρj/4)≠∅. For ν∈N step 2.2 gives ρν≤7ρj, and ∣ξν−ξj∣<34(ρj+ρν)≤6ρj. The selected balls B(ξν,ρν/8) are pairwise disjoint, and their radii satisfy ρν/8≥r:=ρj/56. Thus the smaller balls B(ξν,r), ν∈N, remain pairwise disjoint. Their centres lie in B(ξj,6ρj), so each smaller ball lies in B(ξj,6ρj+r)⊂B(ξj,7ρj). For any finite subfamily, finite additivity and the ball-volume formula [L3] give #F cnrn≤cn(7ρj)n, so #F≤(7ρj/r)n=392n≤785n. Hence N itself has at most 785n members. This proves claim 4.

4.1step 1.1step 1.2step 2.1step 2.2step 3.1discharge-construct∎

Conclusion. Steps 1.1 and 1.2 provide a countable greedy family with covering property 1 and pairwise disjoint B(ξj,ρj/8); step 2.1 proves the covering property 1, step 2.2 gives the comparison property 3; step 3.1 gives the explicit finite overlap bound of property 4. This proves the lemma.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6.1-sol)Open item page →

Radial and nontangential maximal functions of a tempered distribution

Definition

Fix an integer n≥1, work with S(Rn) and S′(Rn) of Schwartz space and its seminorms and Tempered distribution, and let φ∈S(Rn) satisfy ∫Rnφ≠0. For t>0 write φt(x)=t−nφ(x/t),x∈Rn. For f∈S′(Rn) define the radial maximal function Mφ0f(x)=sup⁡t>0∣(f∗φt)(x)∣,x∈Rn, and, for an aperture a≥1, the nontangential maximal function Mφ∗,af(x)=sup⁡t>0 sup⁡∣y−x∣≤at∣(f∗φt)(y)∣,x∈Rn.

Each convolution is the distributional convolution of Convolution of a tempered distribution with a schwartz function. It is well defined: x↦t−nφ(x/t) again lies in S(Rn) by Dilations and their normalisations preserve Schwartz space, with scaling identities, so the pairing of f with the reflected translate of φt exists at every point. Its values are smooth and of polynomial growth by Tempered convolution is smooth with polynomial growth, so each function x↦(f∗φt)(x) is finite at every point and the suprema displayed above are suprema of a nonempty family of real numbers; the radial case is the diagonal y=x of the nontangential case, so Mφ0f≤Mφ∗,af for every a≥1.

The aperture convention is ∣y−x∣≤at with the closed cone, and the normalisation t−n is the one of the sources. Under Countable Choice (The Axiom of Countable Choice (ACω)), each φt has the same integral as φ by Dilations and their normalisations preserve Schwartz space, with scaling identities. This additional mass identity uses that supplier's stated choice premise. No measurability of Mφ0f or Mφ∗,af is asserted here, and the pointwise convolution and maximal-function definitions use no choice principle; the finiteness of the supremum at a point is not claimed, since the family {(f∗φt)(y)} need not be bounded a priori. Apertures a>1 and the grand maximal function are treated in the following items.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

Schwartz approximate identities converge in the sense of tempered distributions

Statement

Assume Countable Choice. Let n≥1, let Φ∈S(Rn) satisfy ∫RnΦ=1, and for t>0 write Φt(x)=t−nΦ(x/t). Then for every f∈S′(Rn) and every ψ∈S(Rn), ⟨Φt∗f,ψ⟩⟶⟨f,ψ⟩(t↓0), where the pairing is against the smooth convolution function of Convolution of a tempered distribution with a schwartz function; in other words Φt∗f→f in S′ as t↓0. Consequently for every sequence tj↓0 one has Φtj∗f→f in S′. If in addition Φ∗Φ denotes the everywhere-defined Schwartz convolution, then Φt∗Φt∗f=(Φ∗Φ)t∗f→f in S′ as t↓0, the dyadic instance being Φ2−j∗Φ2−j∗f→f.

Facts & Assumptions

Given: Countable Choice, n≥1, Φ∈S with ∫Φ=1, f∈S′, ψ∈S; the seminorms and topology of Schwartz space and its seminorms and Schwartz topology and convergence; the convolution of Convolution of a tempered distribution with a schwartz function.

[F1]

For fixed t>0, Φt∈S, ∫Φt=∫Φ=1, and the translated and reflected family x↦Φt(x−⋅) is smooth into S: derivatives in x correspond to derivatives of Φt (Dilations and their normalisations preserve Schwartz space, with scaling identities, Schwartz parameter pairing and integral interchange).

[F2]

For f∈S′ there are C≥0 and integers N,M with ∣⟨f,h⟩∣≤Cmax⁡∣α∣≤N,∣β∣≤Mpαβ(h) for all h∈S (Finite seminorm bound characterizes tempered distributions).

[F3]

Cc∞⊆S and Schwartz functions and all their polynomial multiples are integrable; in particular ∫∣Φ(w)∣(1+∣w∣)N+1 dw<∞ for every N (Schwartz derivatives are integrable).

[F4]

Substitution preserves Lebesgue integrals under Countable Choice, and ∫Φ=∫Φˇ where Φˇ(u)=Φ(−u) (A C^1 diffeomorphism satisfies the change-of-variables formula for L^1 functions).

Proof technique: reduce the distributional convergence to a Schwartz-norm estimate for the reflected approximate identity, then apply the finite-seminorm bound.

Proof

technique · direct
1.1F1F3F4algebra

The reflected approximate identity converges in Schwartz space. Put Φˇ(u)=Φ(−u) and Kt=Φˇt∗ψ, so that Kt(y)=∫RnΦt(x−y)ψ(x) dx=∫RnΦˇ(w)ψ(y−tw) dw, the last form by the substitution x=y−tw. Then Kt−ψ=∫Φˇ(w)(ψ(⋅−tw)−ψ(⋅)) dw because ∫Φˇ=∫Φ=1 by [F1], [F4]. Fix multi-indices α,β and t≤1. Differentiating under the integral and applying the mean value theorem along the segment from y to y−tw gives ∣∂βKt(y)−∂βψ(y)∣≤∫Rn∣Φˇ(w)∣ t∣w∣∫01∣∇∂βψ(y−stw)∣ ds dw. Since ∣yα∣≤∑γ≤α(αγ)∣(y−stw)γ∣ (t∣w∣)∣α∣−∣γ∣≤(1+t∣w∣)∣α∣∑γ≤α(αγ)∣(y−stw)γ∣, taking the supremum in y and using t≤1 yields pαβ(Kt−ψ)≤t Cα∫Rn∣Φˇ(w)∣(1+∣w∣)∣α∣+1 dw⋅max⁡i≤nmax⁡γ≤αpγ,β+ei(ψ), with Cα=n∑γ≤α(αγ), and the integral is finite by [F3]. Hence pαβ(Kt−ψ)→0 as t↓0: this is convergence in every Schwartz seminorm, i.e. Kt→ψ in S.

2.1F1F2F3step 1.1given

The pairing identity. For every t>0, ⟨Φt∗f,ψ⟩=⟨f,Kt⟩. Indeed, the parameter-pairing lemma applied to H(x)=ψ(x) Φt(x−⋅) and u=f gives ⟨f,∫H(x) dx⟩=∫⟨f,Φt(x−⋅)⟩ψ(x) dx=∫(Φt∗f)(x)ψ(x) dx, and ∫H(x) dx=Kt by the computation of step 1.1; the seminorm majorants required by that lemma are supplied by [F1] and [F3], since ∣ψ(x)∣(1+∣x∣)N is integrable for every N.

3.1F1F2step 1.1step 2.1algebra∎

Conclusion. By step 1.1 Kt→ψ in S, so the finite-seminorm bound of [F2] gives ⟨f,Kt⟩→⟨f,ψ⟩; step 2.1 identifies this with ⟨Φt∗f,ψ⟩→⟨f,ψ⟩ as t↓0, which is convergence Φt∗f→f in S′ by the definition of that convergence. Sequences and the dyadic scale t=2−j are instances. For the convolution form, Φ∗Φ∈S by Schwartz convolution and product laws, ∫(Φ∗Φ)=(∫Φ)2=1, and the substitution z=tw gives (Φ∗Φ)t=Φt∗Φt, so the statement applies to the Schwartz function Φ∗Φ. This proves the lemma.

LemmaStatement: Literature-sourcedProof: Literature-sourcedprecheck passjudge pass (gpt-6.1-sol)Open item page →

Deconvolution of a Schwartz function along the dyadic dilates of a fixed kernel

Statement

Assume Countable Choice. Let n≥1 and let φ∈S(Rn) satisfy ∫Rnφ≠0. Then there is a constant s0>0 (depending only on φ and n) such that for all integers L,N>0 there exist C>0 and M>0 (depending on φ,n,L,N but not on the input function) with the following property: for every ψ∈S there are ηj∈S, j≥0, such that ψ=∑j=0∞ηj∗φs02−jin S(Rn), and ∥ηj∥SN≤C 2−jnL ∥ψ∥SM(j≥0), where φt(x)=t−nφ(x/t) and ∥h∥SN:=sup⁡x∈Rnmax⁡(1,∣x∣)Nmax⁡∣α∣≤N∣∂αh(x)∣. Any smaller positive value of s0 also works, with the same conclusion and constants depending on the chosen value. The point of the estimate is that the coefficients ηj become rapidly small in the strong Schwartz norm as j→∞, uniformly in ψ: this is what makes the deconvolution usable inside maximal-function estimates. Countable Choice is used through the Fourier automorphism, differentiation identities, and Schwartz convolution laws cited below.

Facts & Assumptions

Given: Countable Choice, n≥1, φ∈S with ∫φ≠0, and the seminorms and topology of Schwartz space and its seminorms, Schwartz topology and convergence, Ck maps and multi-index derivative notation in Euclidean space.

[F1]

Fourier transformation is a topological automorphism of S(Rn), with φt^(ξ)=φ^(tξ) for t>0 (Fourier transform is a topological automorphism of Schwartz space, Fourier differentiation and multiplication identities on tempered distributions). In particular, the inverse transform of a compactly supported smooth function is Schwartz, and F(f∗g)=f^g^ for Schwartz f,g (Schwartz convolution and product laws).

[F2]

For every m∈N there is Cm with ∥h^∥Sm≤Cm∥h∥Sm+n+1 for all h∈S: for multi-indices ∣α∣,∣β∣≤m the identity (2πi)∣β∣ξβ∂αh^(ξ)=(−2πi)∣α∣∫Rne−2πix⋅ξ ∂β(xαh(x)) dx combined with the higher product rule and ∫(1+∣x∣)−n−1 dx<∞ bounds ∣ξβ∂αh^(ξ)∣ by a finite sum of Sm+n+1 seminorms of h (Fourier differentiation and multiplication identities on tempered distributions, Basic operations are continuous on Schwartz space).

[F3]

Dilations act on S with pαβ(φt)=t∣α∣−∣β∣−npαβ(φ), so φt∈S for every t>0 (Dilations and their normalisations preserve Schwartz space, with scaling identities).

Proof technique: Fourier-side construction of a smooth dyadic partition and inversion of the symbol φ^ on the annuli where it does not vanish.

Proof

technique · constructive
1.1givenF1construct

Normalisation and scaling of the kernel. The construction below is uniform in the scale: for a fixed parameter s0>0 the annuli {∣ξ∣≍s0−12j} play the role of the annuli {∣ξ∣≍2j} at s0=1, and every estimate keeps the same form with constants depending on s0; in particular the same argument run at a smaller parameter gives the statement for every smaller scale, the constants changing by a fixed factor. Since φ^(0)=∫φ≠0 and φ^ is continuous, after multiplying φ by the nonzero complex multiple (1/∫φ) and then replacing it by a suitable positive dilation δnφ(δ ⋅)=φ1/δ, we may assume ∫Rnφ=1,∣φ^(ξ)∣≥12for ∣ξ∣≤2. We prove the lemma in this normalisation with s0=1; undoing the dilation replaces the scale 1 by the fixed positive number 1/δ and does not change the form of the estimates.

2.1step 1.1givenalgebra

A smooth dyadic partition of unity. With the smooth step σ of The standard smooth step function, take ζ(ξ)=σ((9/4−∣ξ∣2)/(5/4)); it equals one on B(0,1) and its support is contained in the closed ball of radius 3/2, hence in B(0,2), and put ζ0=ζ and ζj(ξ)=ζ(2−jξ)−ζ(2−j+1ξ) for j≥1. Then for every J≥0, ∑j=0Jζj(ξ)=ζ(2−Jξ), so ∑j≥0ζj(ξ)=1 for every ξ: at ξ=0 both sides equal one because ζ(0)=1, and for ξ≠0 the limit ζ(2−Jξ)→ζ(0)=1 as J→∞ gives the identity. If ζj(ξ)≠0, then 2−jξ∈supp⁡ζ or 2−j+1ξ∈supp⁡ζ, so ∣2−jξ∣≤2 in either case; by step 1.1, ∣φ^(2−jξ)∣≥12 on supp⁡ζj.

3.1F1F3step 2.1givenalgebra

The deconvolution coefficients and convergence. For ψ∈S and j≥0 define the compactly supported smooth function ηj^(ξ)=ζj(ξ)φ^(2−jξ) ψ^(ξ). The quotient is well defined and smooth on a neighbourhood of supp⁡ζj by step 2.1, and ηj^∈Cc∞(Rn)⊆S; hence ηj:=F−1ηj^∈S by [F1]. On the Fourier side, for every J≥0, F(∑j=0Jηj∗φ2−j)(ξ)=ψ^(ξ)∑j=0Jζj(ξ)=ψ^(ξ) ζ(2−Jξ), where we used φ2−j^(ξ)=φ^(2−jξ) from [F1]. To prove convergence in S, put χJ(ξ)=ζ(2−Jξ)−1. The multiplier χJ itself is not Schwartz and does not converge to zero in S; instead we prove ψ^χJ→0 in every Schwartz seminorm. Fix multi-indices α,β. Leibniz's rule writes ∂β(ψ^χJ) as a finite sum of terms Cγ,β(∂γψ^)(∂β−γχJ), γ≤β. For the term with γ=β, the cutoff is undifferentiated: χJ=0 on ∣ξ∣≤2J because ζ=1 on B(0,1), and ∣χJ∣≤1+∥ζ∥∞ everywhere. Thus its pαβ contribution is bounded by (1+∥ζ∥∞)sup⁡∣ξ∣≥2J∣ξα∂βψ^(ξ)∣, which tends to zero by Schwartz decay. For every term with γ<β, let δ=β−γ≠0. The chain rule gives ∂δχJ(ξ)=2−J∣δ∣(∂δζ)(2−Jξ), supported in the annulus 2J≤∣ξ∣≤2J+1 since ζ is constant on B(0,1) and vanishes outside B(0,2). Its contribution is therefore bounded by Cδ2−J∣δ∣sup⁡∣ξ∣≥2J∣ξα∂γψ^(ξ)∣, which also tends to zero. There are only finitely many terms for each α,β, so pαβ(ψ^χJ)→0. This proves ψ^ζ(2−J⋅)→ψ^ in S. Since Fourier transformation is a homeomorphism of S [F1], the partial sums converge to ψ in S, and (with ∑j≥0 denoting that limit) ψ=∑j≥0ηj∗φ2−j.

4.1step 2.1step 3.1F1F2algebra

The rapid norm decay. Fix L,N>0; all constants below depend on φ,n,L,N only. For j≥1, on supp⁡ζj one has (1+∣ξ∣)≍2j: if ζj(ξ)≠0 then 2−j∣ξ∣≤2, while 2−j+1∣ξ∣≥1 because otherwise both ζ(2−jξ) and ζ(2−j+1ξ) would equal one, so 12⋅2j≤1+∣ξ∣≤3⋅2j. For j=0, the support lies in a fixed ball and all the following estimates hold by enlarging the constant, since the target factor is 2−0nL=1. The quotient ξ↦ζj(ξ)/φ^(2−jξ) is smooth on the neighbourhood {∣ξ∣<2j+1} of supp⁡ζj, and its derivatives of order at most N+n+1 are bounded by a constant C0=C0(n,N,φ) independent of j: the chain rule contributes the factors 2−j∣β∣≤1 to the derivatives both of ζj and of the composition of 1/φ^ with ξ↦2−jξ, and 1/φ^ is smooth with bounded derivatives on the fixed ball ∣z∣≤2, where ∣φ^∣≥12 by step 1.1. Multiplying by ψ^ with the higher product rule, ∣∂αηj^(ξ)∣≤C1max⁡∣β∣≤N+n+1∣∂βψ^(ξ)∣,∣α∣≤N+n+1, ξ∈supp⁡ζj. Multiplying by (1+∣ξ∣)N+n+1 and using the definition of the SM norm with M≥N+n+1 together with the lower bound just proved, ∥ηj^∥SN+n+1≤C1sup⁡ξ∈supp⁡ζj(1+∣ξ∣)N+n+1−M∥ψ^∥SM≤C2 2−j(M−N−n−1)∥ψ^∥SM, so with M≥N+n+1+nL the right-hand side is at most C2 2−jnL∥ψ^∥SM. Finally [F2] applied with the roles of a function and its transform interchanged gives ∥ηj∥SN≤C3∥ηj^∥SN+n+1 (the Fourier transform of ηj^ is ηj(−⋅), which has the same seminorms), and [F2] gives ∥ψ^∥SM≤CM∥ψ∥SM+n+1. Hence ∥ηj∥SN≤C 2−jnL∥ψ∥SM+n+1 with C=C2C3CM independent of ψ and j, so the statement holds with M replaced by M+n+1.

5.1step 1.1step 2.1step 3.1step 4.1discharge-construct∎

Conclusion. Steps 2.1 and 3.1 construct ηj∈S with ψ=∑j≥0ηj∗φ2−j in S, and step 4.1 gives the estimate ∥ηj∥SN≤C2−jnL∥ψ∥SM with constants independent of ψ. Undoing the normalisation of step 1.1 replaces the scale family 2−j by s02−j with the fixed s0=1/δ and does not affect the convergence or the estimates, and the same construction run at a smaller parameter gives the statement there. This proves the lemma.

DefinitionDefinition: Literature-sourcedProof: Not applicableOpen item page →

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.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

The tangential maximal function is controlled by the aperture-one nontangential maximal function in Lp

Statement

Assume Countable Choice. Let n≥1, 0<q<p<∞, T=n/q and φ∈S(Rn) with ∫φ≠0. For f∈S′(Rn) define the tangential maximal function Mφ,Tf(x)=sup⁡t>0 sup⁡y∈Rn∣(f∗φt)(x−y)∣(1+∣y∣/t)T,x∈Rn. For a nonnegative Borel function g define the extended centered average M~g(x):=sup⁡r>01λ(B(x,r))∫B(x,r)g, where the nonnegative Lebesgue integral may be +∞. If g∈Lloc1, then M~g agrees with the centered Hardy-Littlewood maximal function Mg of The centered and uncentered Hardy-Littlewood maximal functions. The aperture-one nontangential maximal function Mφ∗,1f is the one of Radial and nontangential maximal functions of a tempered distribution. Then, pointwise, Mφ,Tf(x)q≤M~((Mφ∗,1f)q)(x). If ∥Mφ∗,1f∥Lp<∞, then ∥Mφ,Tf∥Lp≤Cn,p,q∥Mφ∗,1f∥Lp, with Cn,p,q depending only on n,p,q. The norm inequality also holds in the extended sense when the right-hand side is infinite, in which case it is trivial.

Facts & Assumptions

Given: Countable Choice, n≥1, 0<q<p<∞, T=n/q, φ∈S with ∫φ≠0, f∈S′ and x∈Rn.

[L1]

For every a∈Rn and r>0, λ(B(a,r))=cnrn with cn=ωn−1/n>0: the centred-ball formula is Sphere and ball measures scale in Rn and translation invariance is Lebesgue outer measure, Lebesgue measurability and Lebesgue measure are unchanged by translation. Hence B(x−y,t)⊆B(x,∣y∣+t) and the volume ratio is (1+∣y∣/t)n.

[F1]

For every z∈B(x−y,t) one has ∣(f∗φt)(x−y)∣≤Mφ∗,1f(z), because ∣z−(x−y)∣<t and the supremum defining Mφ∗,1f(z) runs over t>0 and all points within distance t of z (Radial and nontangential maximal functions of a tempered distribution).

[F2]

The centered Hardy-Littlewood maximal operator satisfies the strong Lr bound ∥Mg∥r≤Cn,r∥g∥r for 1<r<∞ (The centered maximal operator is bounded on Lp(Rn) for 1<p<∞, The centered and uncentered Hardy-Littlewood maximal functions).

[F3]

The tangential maximal function is Borel because it is a supremum, over fixed t,y, of continuous functions of x. The aperture-one nontangential maximal function is Borel for f∈S′ (Measurability and lower semicontinuity of the smooth maximal functions). Also, for every r>1, Lr(Rn)⊂Lloc1(Rn): for compact K, Holder gives ∫K∣g∣≤λ(K)1−1/r∥g∥r, and bounded sets have finite measure (Holder's inequality for integrals, including the endpoint cases, Lebesgue measure is sigma-finite, and every metrically bounded subset of Rn has finite outer measure).

Proof technique: local averaging over the ball of radius t and the Hardy-Littlewood maximal bound.

Proof

technique · direct
1.1L1F1F3algebra

Pointwise bound. Fix x,y,t and put g=(Mφ∗,1f)q, which is nonnegative Borel by [F3]. By [F1], ∣(f∗φt)(x−y)∣q≤g(z) for every z∈B(x−y,t). Averaging (allowing an infinite integral) and enlarging to B(x,∣y∣+t) gives ∣(f∗φt)(x−y)∣q≤1λ(B(x−y,t))∫B(x−y,t)g≤λ(B(x,∣y∣+t))λ(B(x−y,t))⋅1λ(B(x,∣y∣+t))∫B(x,∣y∣+t)g≤(1+∣y∣/t)n M~g(x), by [L1]. Since Tq=n, division by (1+∣y∣/t)Tq and taking the supremum over t,y proves the pointwise inequality.

2.1step 1.1F2F3algebra

Lp bound. If ∥Mφ∗,1f∥Lp=∞, the asserted norm inequality is trivial. Otherwise [F3] gives that g=(Mφ∗,1f)q is Borel and belongs to Lp/q. Since p/q>1, [F3] also gives g∈Lloc1, so M~g=Mg. Apply [F2] with r=p/q and use step 1.1: ∥Mφ,Tf∥Lpq=∥(Mφ,Tf)q∥Lp/q≤∥Mg∥Lp/q≤Cn,p,q∥g∥Lp/q=Cn,p,q∥Mφ∗,1f∥Lpq. Taking q-th roots proves the estimate (with the constant renamed).

3.1step 1.1step 2.1∎

Conclusion. Step 1.1 gives pointwise domination by the extended centered average, which agrees with the ordinary maximal operator on the locally integrable input in step 2.1; the strong Lp/q bound then proves the norm estimate.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

The grand maximal function is pointwise dominated by a tangential maximal function

Statement

Assume Countable Choice. Let n≥1, T>0 and let φ∈S(Rn) with ∫φ≠0. Then there are N=N(n,φ,T) and C=C(n,φ,T)<∞ such that for every f∈S′(Rn) and every x∈Rn, MNf(x)≤C Mφ,Tf(x), where MN is the grand maximal function of Grand maximal test class of order N and the grand maximal function and Mφ,T is the tangential maximal function Mφ,Tf(x)=sup⁡t>0sup⁡y∣(f∗φt)(x−y)∣(1+∣y∣/t)−T. Consequently ∥MNf∥Lp≤C∥Mφ,Tf∥Lp for every 0<p≤∞, both sides extended values.

Facts & Assumptions

Given: Countable Choice, n≥1, T>0, φ∈S with ∫φ≠0, f∈S′.

[F1]

Deconvolution: for every ψ∈S and every choice of positive integer parameters L′,N′ there are Cdec,Mdec,s0 and ηj∈S with ψ=∑j≥0ηj∗φs02−j in S and ∥ηj∥SN′≤Cdec2−jnL′∥ψ∥SMdec (Deconvolution of a Schwartz function along the dyadic dilates of a fixed kernel); here SM is the norm h↦sup⁡w(1+∣w∣)Mmax⁡∣α∣≤M∣∂αh(w)∣. The supplier's weight max⁡(1,∣w∣)M and this weight satisfy max⁡(1,∣w∣)M≤(1+∣w∣)M≤2Mmax⁡(1,∣w∣)M; absorb 2N′ in Cdec.

[F2]

If Ψ∈S and t>0, then (f∗Ψt)(x)=∫Rn(f∗φst)(x−w) ηt(w) dw whenever Ψ=η∗φs in the sense of the decomposition of [F1]: apply Schwartz parameter pairing and integral interchange to H(w)(z)=ηt(w)φst(x−w−z). Each Schwartz seminorm of this family is bounded by C(1+∣w∣)m∣ηt(w)∣, an integrable function because ηt is Schwartz. The interchange proves the identity. Applying continuity of f to the reflected translate of each partial sum in [F1] also justifies passage to the series; the subsequent nonnegative estimates apply to finite sums first, then to their limit.

[F3]

The translated kernel ψv(w)=ψ(w+v) satisfies SM(ψv)≤2MSM(ψ) for ∣v∣≤1, and if PN(ψ)≤1 then SM(ψ)≤1 for M≤N (Grand maximal test class of order N and the grand maximal function, Schwartz space and its seminorms).

Proof technique: insert the dyadic deconvolution identity and sum the rapidly decaying coefficients.

Proof

technique · direct
1.1F1F2F3algebra

Single-kernel estimate. Choose integers L′>T and N′>T+n (for example, L′=⌊T⌋+1 and N′=⌊T+n⌋+1), and apply [F1] with these parameters, obtaining Cdec,Mdec,s0. By the smaller-scale clause of [F1], decrease s0 if necessary so that s0≤1. Take an integer N≥max⁡(Mdec,N′). Fix ψ∈FN, t>0 and x; write the deconvolution of [F1] and set s=s02−j. If Mφ,Tf(x)=+∞, the desired estimate is immediate. Otherwise, by [F2], ∣(f∗ψt)(x)∣≤∑j≥0∫Rn∣(f∗φst)(x−w)∣ ∣ηtj(w)∣ dw≤Mφ,Tf(x)∑j≥0∫Rn(1+∣w∣st)T∣ηtj(w)∣ dw, where we used the definition of Mφ,Tf(x) with the displacement w at scale st. Substituting w=tu and using ηtj(tu)=t−nηj(u) gives ∫Rn(1+∣w∣st)T∣ηtj(w)∣ dw=∫Rn(1+∣u∣s)T∣ηj(u)∣ du≤s−T∫Rn(1+∣u∣)T∣ηj(u)∣ du≤CT,N′s−T∥ηj∥SN′≤C′ 2jT2−jnL′∥ψ∥SMdec, since s≤1, N′>T+n makes (1+∣u∣)T−N′ integrable, and [F1] gives ∥ηj∥SN′≤C2−jnL′∥ψ∥SMdec. Also ∥ψ∥SMdec≤1 by the choice of N. The series converges because nL′>T, so ∣(f∗ψt)(x)∣≤C′′Mφ,Tf(x) with C′′ independent of ψ,t,x.

2.1step 1.1F3givenalgebra

Aperture. For t>0 and y with ∣x−y∣≤t write v=(y−x)/t, so ∣v∣≤1, and let ψv(w)=ψ(w+v); then (f∗ψt)(y)=(f∗ψtv)(x): both equal t−n⟨fw,ψ((y−w)/t)⟩ and t−n⟨fw,ψ((x−w)/t+v)⟩=t−n⟨fw,ψ((y−w)/t)⟩. By [F3], SMdec(ψv)≤2MdecSMdec(ψ)≤2Mdec, so the kernel Ψ=ψv/2Mdec satisfies ∥Ψ∥SMdec≤1; the argument of step 1.1 uses only this bound on the kernel and the deconvolution of [F1] with the kernel φ, so it applies verbatim to Ψ and gives ∣(f∗Ψt)(x)∣≤C′′Mφ,Tf(x). Since (ψv/2Mdec)t=ψtv/2Mdec and (f∗ψt)(y)=(f∗ψtv)(x), multiplying by 2Mdec gives ∣(f∗ψt)(y)∣≤C′′2MdecMφ,Tf(x). Taking the supremum over ψ∈FN, t>0 and ∣x−y∣≤t gives MNf(x)≤CMφ,Tf(x). The Lp statement follows by monotonicity of the integral; for p=∞ it is the pointwise bound.

3.1step 1.1step 2.1∎

Conclusion. Step 1.1 controls a single test kernel by the tangential maximal function with a rapidly convergent deconvolution expansion, and step 2.1 removes the aperture restriction by translating the kernel; the class FN is then dominated pointwise. This proves the lemma.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passOpen item page →

Measurability and lower semicontinuity of the smooth maximal functions

Statement

Let n≥1, f∈S′(Rn) and φ∈S(Rn). Then the function (y,t)↦(f∗φt)(y) is continuous on Rn×(0,∞), where φt(x)=t−nφ(x/t) and the convolution is the distributional convolution of Convolution of a tempered distribution with a schwartz function. If ∫Rnφ≠0, the radial maximal function Mφ0f and every nontangential maximal function Mφ∗,af with a≥1 (Radial and nontangential maximal functions of a tempered distribution) are Borel measurable as [0,∞]-valued functions and may be identically +∞. For every integer N≥1, the grand maximal function MNf of Grand maximal test class of order N and the grand maximal function is also Borel measurable, may be identically +∞, and its definition imposes no integral condition on the tests in FN. Moreover, when ∫φ≠0, Mφ0f and every Mφ∗,af are lower semicontinuous, and every MNf is lower semicontinuous for all N≥1. Thus their strict superlevel sets are open; in particular Ωr={MNf>2r}, r∈Z, used in the level decomposition are open.

Facts & Assumptions

Given: n≥1, f∈S′, φ∈S and an integer N≥1. For the radial and nontangential conclusions, also assume ∫φ≠0 and an aperture a≥1.

[F1]

For every fixed t>0 the function x↦(f∗φt)(x) is smooth (Tempered convolution is smooth with polynomial growth); the convolution is (f∗φt)(x)=⟨fy,φt(x−y)⟩ (Convolution of a tempered distribution with a schwartz function).

[F2]

Translations and dilations preserve S continuously: h↦h(⋅−c) is continuous in every seminorm for fixed c, and the seminorms of φt are pαβ(φt)=t∣α∣−∣β∣−npαβ(φ) (Basic operations are continuous on Schwartz space, Dilations and their normalisations preserve Schwartz space, with scaling identities, Schwartz space and its seminorms).

[F3]

A tempered distribution is continuous on S, so convergence in every seminorm implies convergence of the pairings; this is the definition of tempered distribution and of the Schwartz topology (Tempered distribution, Schwartz topology and convergence).

Proof technique: direct seminorm estimates for the parameter family, then lower semicontinuity of suprema.

Proof

technique · direct
1.1F2algebra

Continuity of the parameter family in Schwartz space. Fix (y0,t0)∈Rn×(0,∞) and a compact interval [a,b]⊆(0,∞) containing t0 in its interior. For hy,t(z)=φt(y−z) and multi-indices α,β, a first-order Taylor expansion of ∂βφ along the segment from (y0−z)/t to (y−z)/t gives, for t∈[a,b] and ε:=∣y−y0∣/a≤1, pαβ(hy,t−hy0,t)≤Ca,b(1+∣y0∣)∣α∣ ∣y−y0∣a∑∣γ∣≤∣α∣∑∣e∣=1pγ,β+e(φ). For the scale variation put u=(y0−z)/t. Differentiating ∂zβhy0,t(z)=(−1)∣β∣t−n−∣β∣∂βφ(u) gives ∂t∂zβhy0,t(z)=(−1)∣β∣+1t−n−∣β∣−1((n+∣β∣)∂βφ(u)+u⋅∇∂βφ(u)). Since z=y0−tu and t∈[a,b], ∣z∣∣α∣≤Ca,b,α(1+∣y0∣)∣α∣(1+∣u∣)∣α∣. The factor u in the scale derivative therefore requires one additional polynomial weight, and the mean-value estimate gives pαβ(hy0,t−hy0,t0)≤Ca,b,n,α,β(1+∣y0∣)∣α∣∣t−t0∣(∑∣γ∣≤∣α∣pγ,β(φ)+∑∣γ∣≤∣α∣+1∑∣e∣=1pγ,β+e(φ)). The two estimates tend to 0 as (y,t)→(y0,t0); hence (y,t)↦hy,t is continuous from Rn×(0,∞) into S.

2.1step 1.1F1F3

Joint continuity of the convolution. Since (f∗φt)(y)=⟨f,hy,t⟩ by [F1] and hy,t→hy0,t0 in S by step 1.1, the continuity of f on S [F3] gives (f∗φt)(y)→(f∗φt0)(y0) as (y,t)→(y0,t0). This proves the first clause, and in particular each function y↦(f∗φt)(y) is continuous on Rn for every fixed t.

3.1step 2.1givenalgebra

Lower semicontinuity. Let λ>0. For the radial and nontangential functions assume ∫φ≠0, and suppose Mφ∗,af(x0)>λ. Since by step 2.1 the function (y,t)↦∣(f∗φt)(y)∣ is continuous and the closed cone {∣y−x0∣≤at} is the closure of the open cone {∣y−x0∣<at}, the supremum over the open cone equals the supremum over the closed one: a witness in the closed cone with value >λ can be moved slightly along the segment towards x0 to a witness with ∣y−x0∣<at and value still >λ. Fix such t>0, y with ∣y−x0∣<at and ∣(f∗φt)(y)∣>λ; by step 2.1 there is a neighbourhood U of y on which ∣(f∗φt)∣>λ. The set of x with ∣y−x∣<at is open and contains x0, so U′={x:∣y−x∣<at} is a neighbourhood of x0 on which Mφ∗,af(x)≥∣(f∗φt)(y)∣>λ for every y∈U∩ the ball of radius at centred at x: more precisely, for x∈U′ choose y′∈U⊂B(x,at) (possible because U is a neighbourhood of y and ∣y−x∣<at, so U∩B(x,at)≠∅), and then Mφ∗,af(x)>λ. Hence {Mφ∗,af>λ} is open and Mφ∗,af is lower semicontinuous. The radial case is identical with y=x and the value ∣(f∗φt)(x0)∣>λ: step 2.1 gives a neighbourhood of x0 on which ∣(f∗φt)∣>λ, so Mφ0f>λ there. For the grand maximal function, with no integral restriction on ψ∈FN, if MNf(x0)>λ, the direct definition gives ψ∈FN, t>0 and y with ∣y−x0∣≤t and ∣(f∗ψt)(y)∣>λ. If ∣y−x0∣=t, continuity from step 2.1 lets us move y slightly toward x0 while keeping the value above λ, so we may assume ∣y−x0∣<t. Then U={x:∣y−x∣<t} is an open neighbourhood of x0, and for every x∈U the same ψ,t,y is admissible in the defining supremum, giving MNf(x)>λ. Thus {MNf>λ} is open and MNf is lower semicontinuous.

4.1step 3.1∎

Measurability. An extended-real lower semicontinuous function is Borel: for each real λ the set {g>λ} is open, hence Borel, and the Borel structure of [0,∞] is generated by the open (or by the intervals (λ,∞] and [0,λ)) sets. Applying this to Mφ0f, Mφ∗,af and MNf by step 3.1 gives the stated Borel measurability, with values in [0,∞]; the value +∞ is not excluded, and if it occurs it occurs on a measurable set. This proves the lemma.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

Truncated maximal functions: finiteness, comparison estimates and the good-set bound

Statement

Assume Countable Choice. Let n≥1, 0<p<∞ and let φ∈S(Rn) with ∫φ≠0. For 0<ϵ≤1/2, L>0, T>0 and f∈S′(Rn) define the truncated maximal functions Mφ,0ϵ,Lf(x)=sup⁡0<t<1/ϵ∣(f∗φt)(x)∣ tL(t+ϵ+ϵ∣x∣)L, Mφ,1ϵ,Lf(x)=sup⁡0<t<1/ϵ sup⁡∣x−y∣<t∣(f∗φt)(y)∣ tL(t+ϵ+ϵ∣y∣)L, Mφ,Tϵ,Lf(x)=sup⁡0<t<1/ϵ sup⁡y∈Rn∣(f∗φt)(x−y)∣(1+∣y∣/t)TtL(t+ϵ+ϵ∣x−y∣)L, MNϵ,Lf(x)=sup⁡ψ∈FNMψ,1ϵ,Lf(x), where Mφ0f, Mφ∗,1f and FN are those of Radial and nontangential maximal functions of a tempered distribution and Grand maximal test class of order N and the grand maximal function. The displayed radial and aperture-one truncation formulas also apply to every Schwartz test ψ, including tests of zero integral; the nonzero-integral hypothesis is needed only for estimates involving the fixed comparison kernel φ. Then:

For a nonnegative Borel function g, write M~g(x) for the supremum of its centered ball averages, with the nonnegative Lebesgue integral allowed to equal +∞. If g∈Lloc1, then M~g=Mg for the centered maximal operator of The centered and uncentered Hardy-Littlewood maximal functions.

  1. For every f∈S′ and every 0<p<∞ there is L0=L0(f,n,φ,p)<∞ such that for every L≥L0 and every 0<ϵ≤1/2 the function Mφ,1ϵ,Lf belongs to Lp(Rn) and satisfies Mφ,1ϵ,Lf(x)≤Cϵ−K(1+∣x∣)−M with some finite C,K,M>0 depending on f,L,p (so the quantity ∥Mφ,1ϵ,Lf∥p is finite).
  2. For every T>0 and L>0 there is N1 such that for every N≥N1, every 0<ϵ≤1/2, every f∈S′ and every x, MNϵ,Lf(x)≤C1 Mφ,Tϵ,Lf(x) with C1=C1(n,φ,T,L) independent of ϵ and f.
  3. For every T>0, setting q=n/T and assuming 0<q<p, one has for every 0<ϵ≤1/2, L>0 and f∈S′ Mφ,Tϵ,Lf(x)q≤M~((Mφ,1ϵ,Lf)q)(x)(x∈Rn),∥Mφ,Tϵ,Lf∥Lp≤C2∥Mφ,1ϵ,Lf∥Lp, where M~ is the extended centered average defined above and C2=C2(n,p,q). The norm inequality is interpreted in the extended sense if its right-hand side is infinite.
  4. For every p0>0, T>0, L>0 and λ>0 there is N2 such that for every N≥N2 there is C3=C3(n,φ,p0,T,L,λ,N)<∞ with the property that for every 0<ϵ≤1/2, every f∈S′ and every x satisfying MNϵ,Lf(x)<λMφ,1ϵ,Lf(x), Mφ,1ϵ,Lf(x)≤C3 M~((Mφ0f)p0)(x)1/p0.
  5. (Untruncated good-set estimate.) For every p0>0 and λ>0 there is N3 such that for every N≥N3 there is C4=C4(n,φ,p0,λ,N)<∞ with the property that for every f∈S′ and every x with MNf(x)≤λMφ∗,1f(x)<∞, Mφ∗,1f(x)≤C4 M~((Mφ0f)p0)(x)1/p0. The finiteness Mφ∗,1f(x)<∞ is part of the hypothesis: no claim is made at points where Mφ∗,1f(x)=+∞. For every f with Mφ∗,1f finite a.e. the estimate therefore holds a.e. on the set F={MNf≤λMφ∗,1f}.

The point of the truncation is that Mφ,1ϵ,Lf is finite and integrable, so the good-set argument of the last item can be run without an a priori finiteness assumption on Mφ∗,1f; as ϵ↓0 the truncated functions increase pointwise to the untruncated ones. Countable Choice is assumed through dyadic deconvolution and the measure-theoretic estimates used below.

Facts & Assumptions

Given: Countable Choice, n≥1, 0<p<∞, φ∈S with ∫φ≠0, 0<ϵ≤1/2, L,T>0, f∈S′; the maximal functions of Radial and nontangential maximal functions of a tempered distribution and Grand maximal test class of order N and the grand maximal function.

[F1]

Finite-seminorm bound: there are integers N0,M≥0 and C with ∣⟨f,h⟩∣≤Cmax⁡∣α∣≤N0,∣β∣≤Msup⁡z∣zα∂βh(z)∣ for all h∈S. Applying this to h(z)=φt(y−z) gives ∣(f∗φt)(y)∣≤Cφt−(n+M)(1+∣y∣)N0 when 0<t≤1 and ∣(f∗φt)(y)∣≤CφtN0−n(1+∣y∣)N0 when t≥1: for small scales the largest derivative seminorm is bounded by t−n−M, while for large scales it is bounded by t−n and the polynomial weight contributes at most tN0 (Finite seminorm bound characterizes tempered distributions, Schwartz space and its seminorms).

[F2]

The centered Hardy-Littlewood maximal operator is defined for Lloc1 inputs and satisfies ∥Mg∥Lr≤Cn,r∥g∥Lr for 1<r<∞; also M(h1+h2)≤Mh1+Mh2 (The centered and uncentered Hardy-Littlewood maximal functions, The centered maximal operator is bounded on Lp(Rn) for 1<p<∞).

[F3]

The deconvolution lemma: for φ with ∫φ≠0 and every pair of positive integers L′,N′, there are Cdec,Mdec,s0>0 such that for every ψ∈S there are ηj∈S with ψ=∑j≥0ηj∗φs02−j in S and ∥ηj∥SN′≤Cdec2−jnL′∥ψ∥SMdec Any smaller positive value of s0 also works, with constants depending on that value (Deconvolution of a Schwartz function along the dyadic dilates of a fixed kernel).

[F4]

For every a∈Rn and r>0, λ(B(a,r))=cnrn with cn=ωn−1/n>0; this follows from the centred-ball formula and translation invariance. Consequently, B(x−y,t)⊆B(x,∣y∣+t) and λ(B(x,∣y∣+t))/λ(B(x−y,t))=(1+∣y∣/t)n (Sphere and ball measures scale in Rn, Lebesgue outer measure, Lebesgue measurability and Lebesgue measure are unchanged by translation, Open ball, closed ball and sphere in a metric space).

[F5]

Translate bound for the test seminorm: for ψ∈S and h∈Rn one has PN(ψ(⋅+h))≤(1+∣h∣)NPN(ψ), because (1+∣w∣)≤(1+∣h∣)(1+∣w+h∣) pointwise; hence for the translated derivative kernel Ψz(w)=(∂jφ)(w+(z−x)/t) and ∣(z−x)/t∣≤r+1 with r≤1 one has PN(Ψz)≤3NPN(∂jφ)≤3NPN+1(φ)<∞. Combining the componentwise bounds for 0≤j<n gives ∣∇(f∗φt)(z)∣≤n times this bound after applying the grand maximal estimate; write cN,φ:=n 3NPN+1(φ) for the resulting gradient constant (Grand maximal test class of order N and the grand maximal function, Schwartz space and its seminorms).

[F6]

For every r>1, Lr(Rn)⊂Lloc1(Rn): if K is compact, it is bounded and has finite measure, and Holder gives ∫K∣g∣≤λ(K)1−1/r∥g∥Lr (Holder's inequality for integrals, including the endpoint cases, Lebesgue measure is sigma-finite, and every metrically bounded subset of Rn has finite outer measure).

[F7]

The radial and aperture-one nontangential maximal functions are Borel measurable for every f∈S′ (Measurability and lower semicontinuity of the smooth maximal functions). For fixed ϵ,L, the truncated aperture-one function is Borel: each strict superlevel set is the union of the open balls B(y,t) indexed by the admissible witnesses whose weighted convolution value exceeds that level. The truncated grand maximal function is Borel by the same open-ball superlevel argument, with tests also indexed over FN. The tangential function is Borel because it is a supremum, over fixed witnesses, of continuous functions of x; smoothness of each convolution is Tempered convolution is smooth with polynomial growth.

Proof technique: weighted distance estimates, the dyadic deconvolution comparison and a mean-value argument on the good set.

Proof

technique · direct
1.1F1F7givenalgebra

Finiteness bound. Let N0,M,Cφ be as in [F1], and choose L0=L0(f,n,φ,p) so large that L0>n+M and L0>N0+n/p. Fix L≥L0. For a witness (y,t) with 0<t<1/ϵ and ∣x−y∣<t, write W=∣(f∗φt)(y)∣tL(t+ϵ+ϵ∣y∣)L. If t≤1, [F1] and t+ϵ+ϵ∣y∣≥ϵ(1+∣y∣) give W≤CφtL−(n+M)ϵ−L(1+∣y∣)N0−L≤Cφϵ−L(1+∣y∣)N0−L, because L>n+M. If t≥1, the large-scale bound in [F1] gives W≤CφtL+N0−nϵ−L(1+∣y∣)N0−L≤Cφϵ−(L+max⁡{0,L+N0−n})(1+∣y∣)N0−L, because when L+N0−n≥0 one has tL+N0−n≤ϵ−(L+N0−n), while when L+N0−n<0 the factor is at most 1. Thus in both cases W≤C′ϵ−K(1+∣y∣)−(L−N0) for some finite K. If ∣x∣≥2/ϵ, then ∣y∣≥∣x∣−t≥∣x∣/2, so this is at most C′′ϵ−K(1+∣x∣)−(L−N0). If ∣x∣≤2/ϵ, then 1+∣x∣≤1+2/ϵ≤3/ϵ; absorbing the resulting factor ϵ−(L−N0) gives the same spatial-decay form with a possibly larger finite power of ϵ−1. Taking the supremum over witnesses yields Mφ,1ϵ,Lf(x)≤Cϵ−K′(1+∣x∣)−(L−N0). Because L>N0+n/p, this bound belongs to Lp(Rn), uniformly for each fixed 0<ϵ≤1/2. By [F7] the maximal function is Borel, so its Lp norm is defined.

1.2F2F4F6F7algebra

Tangential dominated by aperture one. Fix x,y and 0<t<1/ϵ, and put q=n/T>0 and g=(Mφ,1ϵ,Lf)q, which is nonnegative Borel by [F7]. For every z∈B(x−y,t) the definition gives ∣(f∗φt)(x−y)∣tL(t+ϵ+ϵ∣x−y∣)L≤Mφ,1ϵ,Lf(z). Raising to the q-th power, averaging with the integral allowed to be infinite, and enlarging the ball using [F4] gives ∣(f∗φt)(x−y)∣qtLq(t+ϵ+ϵ∣x−y∣)Lq≤1λ(B(x−y,t))∫B(x−y,t)g≤(1+∣y∣t)nM~g(x). Since n=Tq, division by (1+∣y∣/t)Tq and taking the supremum over y,t proves the pointwise estimate for every L>0. For the norm estimate assume q<p. If ∥Mφ,1ϵ,Lf∥p=∞, the extended norm inequality is trivial. Otherwise g∈Lp/q, and [F6] gives g∈Lloc1, so M~g=Mg. Applying [F2] with r=p/q>1 yields ∥Mφ,Tϵ,Lf∥pq≤∥Mg∥p/q≤Cn,p,q∥g∥p/q=Cn,p,q∥Mφ,1ϵ,Lf∥pq. Taking q-th roots and renaming the constant proves assertion 3.

1.3F3F5algebra

Truncated grand maximal dominated by the truncated tangential maximal function. Fix T>0, L>0 and choose integers L′>L+T and N′>L+T+n, for example L′=⌊L+T⌋+1 and N′=⌊L+T+n⌋+1. Apply [F3] with these parameters, obtaining Cdec,Mdec,s0; by the scaling clause of [F3] we may assume s0≤1, and we take an integer N≥max⁡(Mdec,N′) so that st≤t<1/ϵ for every j and ∥ψ∥SMdec≤1 for ψ∈FN. Write M∗=Mdec. For ψ∈FN, t∈(0,1/ϵ) and x write the deconvolution ψ=∑jηj∗φs02−j and set s=s02−j. If Mφ,Tϵ,Lf(x)=+∞, assertion 2 is immediate. Otherwise associativity follows from Schwartz parameter pairing and integral interchange applied to H(w)(z)=ηtj(w)φst(x−w−z): each seminorm is bounded by an integrable polynomial weight times ∣ηtj(w)∣. Continuity of f passes the Schwartz deconvolution partial sums to the scalar limit. Thus, with w the integration variable, ∣(f∗ψt)(x)∣≤∑j∫Rn∣(f∗φst)(x−w)∣ ∣ηtj(w)∣ dw. By definition of Mφ,Tϵ,Lf(x), for every w and s,t>0 with st<1/ϵ, ∣(f∗φst)(x−w)∣≤Mφ,Tϵ,Lf(x)(1+∣w∣st)T(st+ϵ+ϵ∣x−w∣)L(st)L. Multiplying by tL/(t+ϵ+ϵ∣x∣)L and using the triangle inequality ∣x−w∣≤∣x∣+∣w∣, together with ϵ/(t+ϵ)≤1/t (valid since ϵ≤1 and t≤1/ϵ), gives (st+ϵ+ϵ∣x−w∣st)L(tt+ϵ+ϵ∣x∣)L≤(1s+∣w∣st)L. Therefore, substituting w=tu and using N′>L+T+n so (1+∣u∣)L+T−N′ is integrable, ∣(f∗ψt)(x)∣tL(t+ϵ+ϵ∣x∣)L≤Mφ,Tϵ,Lf(x)∑j∫Rn(1+∣u∣s)T(1s+∣u∣s)L∣ηj(u)∣ du≤Mφ,Tϵ,Lf(x)∑jCT,L,N′s−(T+L)∥ηj∥SN′≤C′Mφ,Tϵ,Lf(x)∑j2j(T+L)2−jnL′=CradMφ,Tϵ,Lf(x), since s≤1, [F3] gives ∥ηj∥SN′≤C2−jnL′∥ψ∥SMdec, and nL′>T+L makes the geometric series converge. The constants are independent of N, ϵ, ψ, t and x; the constant is independent of ϵ because no weight with ϵ remains. The same calculation for an arbitrary Schwartz test θ retains the factor ∥θ∥SM∗ on the right. For a cone witness ∣z−x∣<t and ψ∈FN, put h=(z−x)/t and θ(w)=ψ(w+h), so (f∗θt)(x)=(f∗ψt)(z). Since ∣h∣<1 and N≥M∗, the weighted derivative inequality gives ∥θ∥SM∗≤2M∗, independently of N. Also t+ϵ+ϵ∣x∣≤2(t+ϵ+ϵ∣z∣) since ∣x−z∣<t and ϵ≤1. Thus ∣(f∗ψt)(z)∣tL(t+ϵ+ϵ∣z∣)L≤2L+M∗CMφ,Tϵ,Lf(x). Taking the supremum over these cone witnesses and tests proves assertion 2, with C1=C1(n,φ,T,L) independent of N and ϵ.

1.4F5F7F4algebra

Good-set bound. Fix p0>0, λ>0, N large enough for the estimate below, 0<ϵ≤1/2, and x with MNϵ,Lf(x)<λMφ,1ϵ,Lf(x). This condition forces Mφ,1ϵ,Lf(x)<∞: put A=PN(φ)>0 and φ0=φ/A∈FN. For every aperture-one witness (t,y) at x, v=(x−y)/t has ∣v∣<1, and the translated kernel Ψ(w)=φ0(w−v) satisfies PN(Ψ)≤2N by [F5]. Thus Ψ/2N∈FN, (f∗Ψt)(x)=(f∗(φ0)t)(y), and the denominator comparison t+ϵ+ϵ∣x∣≤2(t+ϵ+ϵ∣y∣) gives MNϵ,Lf(x)≥2−N−LA−1Mφ,1ϵ,Lf(x). In particular an infinite right-hand side would force an infinite left-hand side, contrary to the strict good-set inequality. If the aperture-one quantity is positive, its finiteness lets us choose t∈(0,1/ϵ) and y with ∣x−y∣<t such that Mφ,1ϵ,Lf(x)≤2∣h(y)∣tL(t+ϵ+ϵ∣y∣)L,h=f∗φt. If the aperture-one quantity is zero, the strict good-set inequality is impossible because MNϵ,Lf(x)≥0. With c=2LcN,φ, [F5] gives tsup⁡∣z−y∣<rt∣∇h(z)∣≤c MNϵ,Lf(x) (t+ϵ+ϵ∣y∣)LtL(0<r≤1). Indeed, t∂jh(z)=(f∗Ψtz)(x) for the translated derivative test function Ψz, whose translation length is at most 2; its PN seminorm is at most cN,φ. Also t+ϵ+ϵ∣x∣≤2(t+ϵ+ϵ∣y∣) because ∣x−y∣<t and ϵ≤1. The mean value theorem and the good-set hypothesis now give ∣h(x′)−h(y)∣≤crλMφ,1ϵ,Lf(x)(t+ϵ+ϵ∣y∣)LtL(x′∈B(y,rt)). Choose 0<r≤1 so crλ≤1/4. The saturation estimate yields ∣h(x′)∣≥14Mφ,1ϵ,Lf(x)(t+ϵ+ϵ∣y∣)L/tL≥14Mφ,1ϵ,Lf(x) on B(y,rt), and ∣h(x′)∣≤Mφ0f(x′). Thus, using the ball inclusion and [F4], Mφ,1ϵ,Lf(x)p0≤4p0(1+rr)n1λ(B(x,(1+r)t))∫B(x,(1+r)t)(Mφ0f)p0. By [F7], (Mφ0f)p0 is Borel, so the extended average defined before assertion 1 applies even if it is not locally integrable. The displayed average is at most M~((Mφ0f)p0)(x), so assertion 4 follows with C3=4((1+r)/r)n/p0.

1.5givenF7algebra

Removing truncation. For fixed L,T,N and every fixed admissible witness, the weight tL/(t+ϵ+ϵ∣z∣)L increases to 1 as ϵ↓0, and the permitted scale range increases to all t>0. Hence the radial, aperture-one and tangential truncated functions increase to their corresponding untruncated suprema. The same argument, also taking the supremum over ψ∈FN, gives MNϵ,Lf(x)↑MNf(x). The strict cone ∣z−x∣<t has the same supremum as the closed cone ∣z−x∣≤t, because each convolution is continuous and every boundary point is a limit of interior points at fixed t; therefore this limit is precisely the supplied nontangential MN.

2.1step 1.4F5F4algebra

Untruncated good-set estimate. Let x satisfy MNf(x)≤λMφ∗,1f(x)<∞, with N≥1. If Mφ∗,1f(x)=0, the asserted bound is immediate; otherwise, by definition of the supremum choose t>0,y with ∣x−y∣<t and ∣h(y)∣≥12Mφ∗,1f(x), where h=f∗φt. As in step 1.4 but without truncation weights, tsup⁡∣z−y∣<rt∣∇h(z)∣≤cN,φMNf(x) by [F5]. Choose r≤1 so cN,φrλ≤1/4. The mean value theorem gives ∣h(z)∣≥14Mφ∗,1f(x) on B(y,rt), and ∣h(z)∣≤Mφ0f(z). Using [F4], the ball inclusion and the extended average M~ defined in step 1.4 yields Mφ∗,1f(x)p0≤4p0(1+rr)nM~((Mφ0f)p0)(x). This is assertion 5 with N3=1 and C4=4((1+r)/r)n/p0.

3.1step 1.1step 1.3step 1.2step 1.4step 2.1step 1.5∎

Conclusion. Step 1.1 gives the finiteness and pointwise decay of the aperture-one truncated function; step 1.3 gives the pointwise comparison of the truncated grand maximal function with the truncated tangential one, with constants independent of ϵ; step 1.2 gives the tangential-to-aperture-one comparison via the Hardy-Littlewood maximal operator; step 1.4 gives the truncated good-set bound and step 2.1 the untruncated one. Step 1.5 proves the stated monotone limits.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6.1-sol)Open item page →

The real Hardy space Hp defined by a radial maximal function

Definition

Fix n≥1, 0<p<∞ and an admissible kernel φ∈S(Rn) with ∫Rnφ≠0, and let Mφ0f be the radial maximal function of Radial and nontangential maximal functions of a tempered distribution. The real Hardy space is Hp(Rn)={f∈S′(Rn):Mφ0f∈Lp(Rn)}, with the functional ∥f∥Hp:=∥Mφ0f∥Lp(Rn). Here Lp is the quotient by almost-everywhere null functions of The space Lp(μ) as the quotient by null functions with the complex scalar conventions of Complex Lp classes and Euclidean test-function conventions, and Mφ0f is the Borel measurable extended-real function supplied by Measurability and lower semicontinuity of the smooth maximal functions; the membership condition includes that Mφ0f is finite almost everywhere and that its class lies in Lp. Since Mφ0f≥0, the functional takes values in [0,∞] and is finite on Hp; the zero distribution lies in Hp with ∥0∥Hp=0. Under Countable Choice, for p≥1 the functional ∥⋅∥Hp is a norm. For 0<p<1 it is p-subadditive. No Banach-space duality of Hp with a normed dual is asserted here below p=1. The kernel φ is held fixed in the definition; the maximal-characterisation theorem on this page shows that different admissible kernels give the same space with equivalent quasi-norms, so that the notation Hp(Rn) does not depend on the choice up to equivalence. No choice principle is used in the definition itself.

Norm properties

The set defining Hp is specified without a choice principle. Under Countable Choice, positive definiteness holds for every p>0. If ∥f∥Hp=0, then Mφ0f=0 almost everywhere. Lower semicontinuity of the radial maximal function makes it identically zero: if it has a positive value, one of its open strict superlevel sets contains a Euclidean ball, which has positive measure under Countable Choice by Euclidean balls have positive finite Lebesgue measure. Thus f∗φt=0 for every t>0 at every point. Apply Schwartz approximate identities converge in the sense of tempered distributions to Φ=φ/(∫φ) to conclude f=0 in S′. The lower-semicontinuity input is Measurability and lower semicontinuity of the smooth maximal functions, and the approximate-identity limit is as stated. For p≥1, homogeneity and the triangle inequality follow from Mφ0(f+g)≤Mφ0f+Mφ0g and the complex Lp norm properties Complex Holder, Minkowski, and the quotient norm, so the functional is a norm.

For 0<p<1, pointwise sublinearity and (u+v)p≤up+vp for u,v≥0 give ∥f+g∥Hpp≤∥f∥Hpp+∥g∥Hpp. The Hp membership definition itself uses no choice principle.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

The grand maximal function dominates every admissible radial and nontangential maximal function

Statement

Let n≥1, f∈S′(Rn), φ∈S(Rn) with ∫Rnφ≠0, a≥1, and an integer N≥1. Then, with PN and FN as in Grand maximal test class of order N and the grand maximal function and the maximal functions of Radial and nontangential maximal functions of a tempered distribution, Mφ∗,af(x)≤(1+a)NPN(φ) MNf(x)for every x∈Rn, and in particular Mφ0f(x)≤2NPN(φ)MNf(x),∥Mφ0f∥Lp≤2NPN(φ)∥MNf∥Lp whenever 0<p≤∞ and the right-hand side is finite. The constants (1+a)N differ from the source's sharper aN but are equivalent for fixed a,N and are the ones produced by the elementary translate estimate below. Consequently every admissible radial maximal function is pointwise dominated by the grand maximal function of every sufficiently large order, and the space defined by the radial maximal function of one kernel contains the space defined by MN.

Facts & Assumptions

Given: n≥1, φ∈S with ∫φ≠0, a≥1, an integer N≥1, f∈S′, and a point x∈Rn.

[F1]

(f∗Ψt)(y)=⟨fz,Ψt(y−z)⟩ for Ψ∈S and t>0, and MNf(x)=sup⁡Ψ∈FNsup⁡t>0sup⁡∣y−x∣≤t∣(f∗Ψt)(y)∣ (Convolution of a tempered distribution with a schwartz function, Grand maximal test class of order N and the grand maximal function).

[F2]

The test seminorm satisfies PN(Ψ)≤1 exactly for Ψ∈FN, and for every nonzero Ψ, PN(Ψ/PN(Ψ))=1; PN(Ψ)=sup⁡w(1+∣w∣)Nmax⁡∣α∣≤N+1∣∂αΨ(w)∣ (Grand maximal test class of order N and the grand maximal function, Schwartz space and its seminorms).

[F3]

If ∣y−x∣≤at then y=x+tγ with ∣γ∣≤a; the translation identity φt(y−z)=Gt(x−z) for G(w)=φ(w+γ) holds for every z, as both sides equal t−nφ((x−z)/t+γ) (Dilations and their normalisations preserve Schwartz space, with scaling identities).

[F4]

Maximal functions are Borel measurable, so the Lp statement is meaningful (Measurability and lower semicontinuity of the smooth maximal functions).

Proof technique: translate the kernel into the aperture-one cone at the base point, using the translate bound for PN.

Proof

technique · direct
1.1F2F3givenalgebra

The translate bound. Fix γ∈Rn and put G(w)=φ(w+γ). Then G∈S(Rn) and PN(G)≤(1+∣γ∣)NPN(φ): indeed ∂αG(w)=(∂αφ)(w+γ) and (1+∣w∣)≤(1+∣γ∣)(1+∣w+γ∣), so (1+∣w∣)Nmax⁡∣α∣≤N+1∣∂αφ(w+γ)∣≤(1+∣γ∣)NPN(φ) pointwise in w, and taking the supremum proves the claim. If PN(G)=0 then G=0 and f∗Gt=0; otherwise G/PN(G)∈FN by [F2], and t−n normalisation is the same for G.

2.1step 1.1F1F3algebra

Pointwise domination. Fix t>0 and y with ∣y−x∣≤at, and write y=x+tγ with ∣γ∣≤a. By [F3], (f∗φt)(y)=(f∗Gt)(x) for G=φ(⋅+γ). Taking absolute values and applying the definition of MN through [F1] and step 1.1, ∣(f∗φt)(y)∣=∣(f∗Gt)(x)∣≤PN(G)MNf(x)≤(1+a)NPN(φ)MNf(x). Taking the supremum over all such t,y gives Mφ∗,af(x)≤(1+a)NPN(φ)MNf(x).

3.1step 2.1F1F4∎

Radial case and Lp consequence. Since Mφ0f(x)=sup⁡t>0∣(f∗φt)(x)∣ is the diagonal y=x instance of the aperture-one supremum, Mφ0f(x)≤Mφ∗,1f(x)≤2NPN(φ)MNf(x) by step 2.1 with a=1. If ∥MNf∥p<∞, the pointwise inequality and the Borel measurability of [F4] give ∥Mφ0f∥p≤2NPN(φ)∥MNf∥p for every 0<p≤∞ by monotonicity of the integral. This proves the lemma.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

Atoms have uniformly bounded Hp quasi-norm and uniformly bounded test pairings

Statement

Assume Countable Choice. Let n≥1, 0<p≤1, s≥⌊n(1/p−1)⌋, fix the admissible kernel φ defining Hp, and let N≥max⁡(N0(n,p,φ),n+s+1) be an admissible grand-maximal order. There are constants C0=C0(n,p,s)<∞ and C1=C1(n,p,s,N,φ)<∞ such that every (p,∞,s)-atom a supported in an axis-parallel cube Q (Hp atoms with a prescribed moment order) satisfies

  1. ∥MNa∥Lp≤C0 and hence ∥a∥Hp≤C1;
  2. for every ψ∈S(Rn), ∣⟨a,ψ⟩∣≤C0min⁡(∣Q∣1−1/p+(s+1)/n,∣Q∣1−1/p)max⁡(∥ψ∥L∞(Q),∥ψ∥Cs+1(Q)), where ∥ψ∥Cs+1(Q)=max⁡∣β∣≤s+1sup⁡Q∣∂βψ∣;
  3. in particular sup⁡j∣⟨aj,ψ⟩∣<∞ for every fixed ψ∈S and every family (aj) of such atoms.

Facts & Assumptions

Given: Countable Choice, n≥1, 0<p≤1, s≥⌊n(1/p−1)⌋, the fixed admissible kernel φ, an admissible order N≥max⁡(N0(n,p,φ),n+s+1), and a (p,∞,s)-atom a supported in a cube Q with centre cQ and side length ℓ=ℓ(Q).

[L1]

a is measurable, supp⁡a⊆Q, ∣a∣≤∣Q∣−1/p a.e., and ∫a(y)yα dy=0 for every multi-index ∣α∣≤s (Hp atoms with a prescribed moment order).

[F1]

The cube Q has side length ℓ, is contained in the closed ball B(cQ,nℓ/2)‾, and ∣y−cQ∣≤nℓ/2 for y∈Q (Axis-parallel rectangles in Rm and their volume).

[F2]

For Ψ∈FN, Ψt(w)=t−nΨ(w/t) and each derivative through order N+1 satisfies ∣∂βΨ(u)∣≤(1+∣u∣)−N; in particular ∣Ψ(u)∣≤(1+∣u∣)−N and ∥Ψ∥1≤Cn because N≥n+1 (Grand maximal test class of order N and the grand maximal function, Schwartz space and its seminorms).

[F3]

Domination: Mφ0a≤2NPN(φ)MNa for the fixed admissible kernel φ, so ∥a∥Hp≤2NPN(φ)∥MNa∥Lp (The grand maximal function dominates every admissible radial and nontangential maximal function).

[F4]

Taylor remainder: for real G∈Cs+1(Rn), the multivariable Lagrange formula gives G(y)=TsG(c;y−c)+RG(y) and ∣RG(y)∣≤Cn,s∣y−c∣s+1max⁡∣β∣=s+1sup⁡z∈[c,y]∣∂βG(z)∣ (Multivariable Taylor formula with a Lagrange remainder along a line segment, Ck maps and multi-index derivative notation in Euclidean space). For complex G, apply the real formula to Re⁡G and Im⁡G and add the two remainder bounds; each component derivative is bounded by ∣∂βG∣ (Complex Lp classes and Euclidean test-function conventions).

[F5]

Under Countable Choice, a closed axis-parallel box is Lebesgue measurable with measure equal to the product of its side lengths, and Lebesgue measure is monotone (A box in Rn with parameters ai≤bi is Lebesgue measurable of measure ∏i<n(bi−ai), whichever of its faces are included, Measures are monotone, The Axiom of Countable Choice (ACω)).

[F6]

The grand maximal function MNa is Borel measurable (Measurability and lower semicontinuity of the smooth maximal functions).

[F7]

For nonnegative measurable functions, integration over an increasing union of measurable sets is the limit of the integrals over the finite unions (Monotone convergence for the integral).

[F8]

Normalized dilation preserves the L1 norm: ∥Ψt∥1=∥Ψ∥1 by A C^1 diffeomorphism satisfies the change-of-variables formula for L^1 functions applied to T(w)=tw and the integrand ∣Ψ∣.

[F9]

The tempered-distribution test pairing is bilinear: ⟨u,ψ⟩=u(ψ) with no conjugation of ψ (Tempered distribution).

Proof technique: near/far splitting with the Taylor remainder and the moment conditions.

Proof

technique · direct
1.1L1F1F2F5F6F8algebra

Near estimate. For x∈Rn, Ψ∈FN, t>0, and every convolution centre y with ∣y−x∣≤t, the atom bound gives ∣(a∗Ψt)(y)∣≤∥a∥∞∫Q∣Ψt(y−z)∣ dz≤∣Q∣−1/p∥Ψt∥1=∣Q∣−1/p∥Ψ∥1≤C∣Q∣−1/p. The last constant is uniform over Ψ∈FN by [F2] and N≥n+1. By [F8], ∥Ψt∥1=∥Ψ∥1. Taking the suprema over Ψ, t, and all y with ∣y−x∣≤t proves this bound for every x. Let Q∗ be the concentric closed cube of side 4n ℓ. By [F5], ∣Q∗∣=(4n)n∣Q∣, and hence ∫Q∗(MNa)p≤Cp∣Q∣−1∣Q∗∣≤Cp(4n)n.

2.1step 1.1L1F1F2F4F5F7algebra

Far estimate. Set m:=n+s+1. If x∉Q∗, put r:=∣x−cQ∣>2n ℓ. Fix Ψ∈FN, t>0, and any y with ∣y−x∣≤t; all estimates below are uniform in this y, so taking the suprema over y,t,Ψ at the end gives the estimate for MNa(x). For z∈Q, ∣z−cQ∣≤n ℓ/2. When 0<t≤ℓ, the triangle inequality gives ∣y−z∣≥r−t−n ℓ/2≥r/4. Thus [F2] and N≥m imply ∣(a∗Ψt)(y)∣≤∣Q∣−1/p∣Q∣t−n(1+r/(4t))−m≤C∣Q∣−1/p(ℓ/r)m(t/ℓ)s+1≤C∣Q∣−1/p(ℓ/r)m, using ∣Q∣=ℓn and m−n=s+1. When t≥ℓ, expand the complex function z↦Ψt(y−z) about cQ through degree s, applying [F4] to its real and imaginary parts. The Taylor polynomial integrates to zero against a because each (z−cQ)α, ∣α∣≤s, is a linear combination of monomials zβ of degree at most s, whose moments vanish by [L1]. For every remainder point ζ on the segment from cQ to z∈Q, the cone condition and t≥ℓ give r≤∣x−y∣+∣y−ζ∣+∣ζ−cQ∣≤t+∣y−ζ∣+n2ℓ≤(1+n/2)(t+∣y−ζ∣). If ∣β∣=s+1, [F2] yields ∣∂βΨt(y−ζ)∣≤t−n−s−1(1+∣y−ζ∣/t)−m=(t+∣y−ζ∣)−m≤(1+n/2)mr−m. The Taylor remainder and ∣z−cQ∣≤n ℓ/2 now give ∣(a∗Ψt)(y)∣≤C∣Q∣1−1/pℓs+1r−m=C∣Q∣−1/p(ℓ/r)m. These bounds hold for every Ψ,t,y in the grand-maximal supremum. Therefore MNa(x)≤C∣Q∣−1/p(1+r/ℓ)−m. Since s≥⌊n(1/p−1)⌋, pm>n. Cover the far region by shells Ej={x:2jR0≤∣x−cQ∣<2j+1R0}, j≥0, with R0=2n ℓ. Each is contained in a concentric closed cube of side 2j+2R0, so [F5] gives ∣Ej∣≤Cn2jn∣Q∣. By [F7] and the pointwise bound, ∫Rn∖Q∗(MNa)p≤∑j≥0C∣Q∣−12−jmp∣Ej∣≤C∑j≥02−j(pm−n)<∞.

3.1step 1.1step 2.1F3F6algebra

Conclusion of (a). Steps 1.1 and 2.1 give ∫Rn(MNa)p≤C0p after enlarging C0=C0(n,p,s), independently of Q, a and admissible N; measurability is [F6]. Hence ∥MNa∥Lp≤C0, and [F3] gives ∥a∥Hp≤2NPN(φ)C0=:C1(n,p,s,N,φ). This proves assertion 1.

4.1step 3.1L1F4F5F9algebra

Pairing bounds. The atom function induces a tempered distribution by ∣∫Qa(y)ψ(y) dy∣≤∣Q∣1−1/pp00(ψ), and [F9] fixes the bilinear convention. Thus for a complex test ψ, ⟨a,ψ⟩=∫Qa(y)ψ(y) dy; this integral is absolutely convergent by [L1] and boundedness of ψ on Q. The plain estimate is ∣⟨a,ψ⟩∣≤∣Q∣1−1/p∥ψ∥L∞(Q). For the Taylor estimate, apply [F4] separately to Re⁡ψ and Im⁡ψ and use the same moment cancellation as in step 2.1. The combined remainder obeys sup⁡Q∣Rψ∣≤Cn,sℓs+1∥ψ∥Cs+1(Q), hence ∣⟨a,ψ⟩∣=∣∫Qa(y)Rψ(y) dy∣≤Cn,s∣Q∣1−1/p+(s+1)/n∥ψ∥Cs+1(Q). Taking the smaller of the plain and Taylor bounds proves assertion 2 after enlarging C0. Put X=n(1/p−1)≥0: then 1−1/p+(s+1)/n=(s+1−X)/n>0, whereas 1−1/p≤0 (including equality when p=1). Thus the two powers have one positive and one nonpositive exponent, and min⁡(∣Q∣1−1/p+(s+1)/n,∣Q∣1−1/p)≤1 for all ∣Q∣>0. Since a Schwartz test and its derivatives through order s+1 are bounded globally, assertion 3 follows uniformly over every family of atoms.

5.1step 1.1step 2.1step 3.1step 4.1F5F6∎

Conclusion. Steps 1.1 and 2.1 give the uniform grand-maximal estimate, [F3] gives the kernel/order-dependent Hp bound, and step 4.1 proves the uniform pairing estimates. Countable Choice is used for the explicit box measures and maximal-function measurability in [F5]--[F6]. This proves the lemma.

LemmaStatement: Literature-sourcedProof: Literature-sourcedprecheck passOpen item page →

Calderon reproducing pair and the telescoping identity in S′

Statement

Assume Countable Choice. Let K≥0 and let φ∈Cc∞(Rn) satisfy supp⁡φ⊆B(0,1), φ^(0)=1 and ∂αφ^(0)=0 for 0<∣α∣≤K (such a φ exists by Schwartz functions with prescribed flatness of the Fourier transform at the origin). Put ψ=2nφ(2 ⋅)−φ and ψ~=2nφ(2 ⋅)+φ, and for k∈Z write hk(x)=2knh(2kx). Then supp⁡ψk⊆B(0,2−k),supp⁡ψ~k⊆B(0,2−k),∫Rnψ(x)xα dx=0(∣α∣≤K), and for every f∈S′(Rn) and every j∈Z the identity f=φj∗φj∗f+∑k≥jψk∗ψ~k∗fin S′(Rn) holds, the series being the limit of its partial sums in S′. If f∈Hp(Rn) for some 0<p<∞ (with the fixed admissible kernel and the space of The real Hardy space Hp defined by a radial maximal function), then also f=∑k∈Zψk∗ψ~k∗fin S′. The absolute convergence of the scalar series ∑k≥j∣⟨ψk∗ψ~k∗f,χ⟩∣ for every test function χ is proved where it is consumed, in the level-decomposition item, whose quantitative hypotheses are available there. The two-sided identity can fail for general f∈S′: for the constant function f=1 one has φj∗φj∗f=f≠0 for every j, while ψk∗ψ~k∗f=0 for every k because ∫ψ=0.

Facts & Assumptions

[F1]

The Fourier identity ∂αφ^(0)=(−2πi)∣α∣∫Rnxαφ(x) dx holds, so the moment conditions on φ at the origin are equivalent to the vanishing of the positive-order moments of φ; the mean of φ is one, and the mean of ψ is zero (Fourier differentiation and multiplication identities on tempered distributions).

[F2]

For Φ=φ∗φ∈S one has ∫Φ=1 and Φt=φt∗φt, so Φt∗f→f in S′ as t↓0 (Schwartz approximate identities converge in the sense of tempered distributions).

[F3]

By kernel independence in Maximal-function characterisations of real Hardy spaces, membership in Hp gives integrability for the reproducing kernel φ, even when a different admissible kernel defines the given quasi-norm. Thus for f∈Hp the radial maximal function g=Mφ0f belongs to Lp. When p≥1, h=φj∗f satisfies ∣h∣≤g and hence ∥h∥p≤∥g∥p; the regular-distribution convolution formula and Hölder give ∥φj∗h∥∞≤∥φj∥p′∥h∥p (The real Hardy space Hp defined by a radial maximal function, Tempered distribution, Convolution of a tempered distribution with a schwartz function, Schwartz space and its seminorms, Holder's inequality for integrals, including the endpoint cases).

[F4]

Schwartz functions and their polynomial multiples are integrable, so xαψ∈L1 and ∫Rn(1+∣x∣)N∣ψ∣<∞ for every N (Schwartz derivatives are integrable).

[F5]

For f∈Hp, the maximal-characterisation theorem supplies an admissible integer order N with G=MNf∈Lp. Grand-maximal domination gives ∣(f∗φt)(y)∣≤3NPN(φ)G(x) whenever ∣y−x∣≤2t (Maximal-function characterisations of real Hardy spaces, The grand maximal function dominates every admissible radial and nontangential maximal function).

[F6]

Under Countable Choice, translation invariance and the ball-volume formula give λ(B(x,R))=cnRn for every x and R>0, while dilation gives ∥φt∥L1=∥φ∥L1 and, for 1≤q<∞, ∥φj∥q=2jn(1−1/q)∥φ∥q; for q=∞, ∥φj∥∞=2jn∥φ∥∞. Indeed, for finite q, ∫∣φj(x)∣qdx=2jnq2−jn∫∣φ(u)∣qdu under u=2jx (Sphere and ball measures scale in Rn, Lebesgue outer measure, Lebesgue measurability and Lebesgue measure are unchanged by translation, Dilations and their normalisations preserve Schwartz space, with scaling identities, For a nonzero real c, dilation by c multiplies Lebesgue outer measure by ∣c∣n, and reflection in the origin preserves it).

[F7]

The grand maximal function MNf is Borel measurable, so its strict superlevel sets are measurable (Measurability and lower semicontinuity of the smooth maximal functions).

[F8]

If G≥0 is measurable and t>0, then λ({G≥t})≤t−1∫G by the Chebyshev-Markov inequality (Chebyshev-Markov inequality for the integral).

Proof technique: telescoping of the two-scale identity, an elementary limit at −∞, and a moment-Taylor estimate for the absolute convergence.

Proof

technique · constructive
1.1F1F4algebraconstruct

Support and moments. Since supp⁡φ⊆B(0,1), both supp⁡(2nφ(2⋅)) and supp⁡φ lie in B(0,1); hence supp⁡ψ,supp⁡ψ~⊆B(0,1) and, after dilation, supp⁡ψk,supp⁡ψ~k⊆B(0,2−k) for every k. For 0<∣α∣≤K one has ∫xαψ(x)dx=2−∣α∣∫xαφ(x)dx−∫xαφ(x)dx=(2−∣α∣−1)∫xαφ=0 by [F1] and the flatness of φ^; the case α=0 gives ∫ψ=0 as well.

2.1F2step 1.1algebra

Telescoping. For every k∈Z the definitions give ψk=φk+1−φk and ψ~k=φk+1+φk: indeed h=2nφ(2⋅) has hk=φk+1 and φk=φk. Therefore ψk∗ψ~k∗f=(φk+1∗φk+1−φk∗φk)∗f, and the finite sums telescope: φj∗φj∗f+∑k=jNψk∗ψ~k∗f=φN+1∗φN+1∗f=(φ∗φ)N+1∗f for every N≥j. By [F2], (φ∗φ)N+1∗f→f in S′ as N→∞, so the partial sums converge to f−φj∗φj∗f and the displayed one-sided identity holds for every f∈S′ and j∈Z.

3.1F3F4F5F6F7F8step 2.1givenalgebra

The two-sided identity for Hp elements. Let f∈Hp and set g=Mφ0f∈Lp, so ∣φj∗f∣≤g pointwise for every j. If 0<p<1, choose an admissible integer order N with G=MNf∈Lp by [F5], and let CN=3NPN(φ). For r∈Z put Ωr={x:G(x)>2r}; by [F7] it is measurable, and Ωr⊆{Gp≥2rp}, so [F8] applied to Gp at threshold 2rp gives λ(Ωr)≤2−rp∥G∥pp<∞. Fix r. By [F6], λ(B(y,2−j+1))=cn2(−j+1)n→∞ as j→−∞, uniformly in y. Thus for all sufficiently negative j and every y∈Rn there is x∈B(y,2−j+1)∖Ωr; otherwise this ball would be contained in Ωr and have measure at most λ(Ωr). Then ∣y−x∣<2⋅2−j, so [F5] gives ∣(φj∗f)(y)∣≤CNG(x)≤CN2r. Hence ∥φj∗f∥∞≤CN2r, and [F6] gives ∥φj∗φj∗f∥∞≤∥φj∥1∥φj∗f∥∞≤∥φ∥1CN2r. Given ε>0, choose r so negative that the right-hand side is less than ε, and then choose j sufficiently negative. Thus φj∗φj∗f→0 uniformly, hence in S′ because every Schwartz test function is integrable by [F4]. If p≥1, Hölder instead gives ∣φj∗φj∗f(x)∣≤∥φj∥p′∥φj∗f∥p≤2jn/p∥φ∥p′∥g∥p⟶0 as j→−∞. For p>1, [F6] gives this norm scaling since ∫∣φj∣p′=2jnp′2−jn∫∣φ(u)∣p′du, so n(1−1/p′)=n/p; for p=1 it is the supremum scaling ∥φj∥∞=2jn∥φ∥∞. The other bound uses ∣φj∗f∣≤g and [F3]. Hence in every case φj∗φj∗f→0 in S′. Passing to the limit j→−∞ in the one-sided identity of step 2.1 (with the series understood as lim⁡j→−∞∑k≥j, whose partial sums are φN+1∗φN+1∗f−φj∗φj∗f) gives f=∑k∈Zψk∗ψ~k∗f in S′.

4.1step 1.1step 2.1step 3.1discharge-construct∎

Conclusion. Step 1.1 gives the support and moment properties of ψ; step 2.1 gives the one-sided telescoping identity for every tempered distribution; step 3.1 gives the two-sided identity for Hp elements. This proves the lemma.

TheoremStatement: Literature-sourcedProof: Literature-sourcedprecheck passOpen item page →

Maximal-function characterisations of real Hardy spaces

Statement

Assume Countable Choice. Let n≥1, 0<p<∞ and let φ∈S(Rn) with ∫φ≠0. Then there is N0(n,p,φ)<∞, depending only on n, p and the fixed kernel φ, such that for every N≥N0(n,p,φ) and every f∈S′(Rn) the following assertions are equivalent:

  1. Mφ0f∈Lp(Rn);
  2. Mφ∗,af∈Lp(Rn) for some a≥1 (equivalently, for every a≥1);
  3. MNf∈Lp(Rn).

Here Mφ0f, Mφ∗,af are the maximal functions of Radial and nontangential maximal functions of a tempered distribution and MN is the grand maximal function of Grand maximal test class of order N and the grand maximal function. Moreover the extended quantities ∥Mφ0f∥Lp, ∥Mφ∗,af∥Lp and ∥MNf∥Lp are finite exactly on the common set of f satisfying 1-3, and on that set they are equivalent: ∥Mφ0f∥Lp≤∥Mφ∗,af∥Lp≤(1+a)NPN(φ)∥MNf∥Lp,∥MNf∥Lp≤C∥Mφ0f∥Lp, with C=C(n,p,N,φ)<∞ depending only on n,p,N and finitely many Schwartz seminorms of φ together with quantitative nonvanishing data for φ^ near zero (as used in the deconvolution lemma). Consequently the space Hp(Rn) of The real Hardy space Hp defined by a radial maximal function does not depend on the choice of admissible φ, and for each admissible φ the grand maximal function may be used to define the same space with an equivalent quasi-norm for every order N≥N0(n,p,φ); for two admissible kernels φ,ψ the two radial definitions agree because both are equivalent to MN for every N≥max⁡(N0(n,p,φ),N0(n,p,ψ)). The recorded admissible thresholds of the sources are N≥⌊n/p⌋+1 for the nontangential class FN with derivatives through N+1 [DKKP], N>1+n/p for the radial class BN with derivatives through N [MSV, section 1, p. 16, for 0<p≤1], and N>n/p+n+1 [CUW], stated there for the grand maximal functions normalised by the test classes of those papers; the proof below uses an unspecified finite N0(n,p,φ) that is at least as large as the order thresholds consumed by the finitely many comparison estimates for the fixed kernel φ (the deconvolution constants of the comparison lemmas depend on the kernel, so the order threshold asserted here depends on φ as well as on n and p), and the existence of such a finite threshold is what is asserted.

Facts & Assumptions

Given: Countable Choice, n≥1, 0<p<∞, φ∈S with ∫φ≠0, f∈S′, and a fixed order N.

[F1]

Pointwise domination by the grand maximal function: Mφ0f≤Mφ∗,1f≤2NPN(φ)MNf and Mφ∗,af≤(1+a)NPN(φ)MNf for every a≥1, provided N is the order of the grand maximal function (The grand maximal function dominates every admissible radial and nontangential maximal function).

[F2]

Tangential comparison: for 0<q<p and T=n/q, ∥Mφ,Tf∥Lp≤Cn,p,q∥Mφ∗,1f∥Lp (The tangential maximal function is controlled by the aperture-one nontangential maximal function in Lp).

[F3]

Grand dominated by tangential: for every T>0 there are N2(n,φ,T) and C0 with MNf≤C0Mφ,Tf whenever N≥N2 (The grand maximal function is pointwise dominated by a tangential maximal function).

[F4]

Good-set estimates: assertion 5 of Truncated maximal functions: finiteness, comparison estimates and the good-set bound uses the extended centered average M~ of that item for general nonnegative Borel inputs. When Mφ0f∈Lp and q0=p/2, the input (Mφ0f)q0 belongs to L2⊂Lloc1, so M~=M and the standard maximal operator can be used. Assertions 1-4 of the same lemma provide the truncated functions Mφ,jϵ,L and their finiteness, grand/tangential comparison, tangential/aperture-one comparison and good-set bound.

[F5]

Hardy-Littlewood boundedness: ∥Mg∥Lr≤Cn,r∥g∥Lr for 1<r<∞ (The centered maximal operator is bounded on Lp(Rn) for 1<p<∞).

[F6]

The maximal functions are Borel measurable, so all Lp expressions are meaningful with values in [0,∞] (Measurability and lower semicontinuity of the smooth maximal functions).

[F7]

L2(Rn)⊂Lloc1(Rn): on each compact K, Holder gives ∫K∣g∣≤λ(K)1/2∥g∥2, and compact sets have finite measure because they are bounded (Holder's inequality for integrals, including the endpoint cases, Lebesgue measure is sigma-finite, and every metrically bounded subset of Rn has finite outer measure).

[F8]

If nonnegative measurable functions hm increase pointwise to h, then their integrals increase to ∫h by the monotone convergence theorem (Monotone convergence for the integral).

Proof technique: a priori good-set argument, then removal of the a priori finiteness by truncation, then the pointwise domination for the converse.

Proof

technique · direct
1.1F1F2F3F4F5F6F7algebra

A priori estimate. Assume Mφ∗,1f∈Lp and let q0=p/2, T=2n/p, so that T=n/q0 and q0<p. Let N2=N2(n,φ,T) and C0=C0(n,φ,T) be the constants of [F3], let CT=Cn,p,q0 be the norm constant from [F2], and let CH=Cn,21/q0 be the powered Hardy-Littlewood constant from [F5] at r=2. Put C1=C0CT and λ=21/pC1, so that ∥MNf∥Lp≤C1∥Mφ∗,1f∥Lp by [F2], [F3] for every N≥N2. Let N3=N3(n,φ,q0,λ) be the threshold of [F4, assertion 5]; fix N≥max⁡(N2,N3) and let C4=C4(n,φ,q0,λ,N) be the constant of [F4, assertion 5] at this order. Set F={x:MNf(x)≤λMφ∗,1f(x)}. On Fc one has Mφ∗,1f≤λ−1MNf pointwise, hence ∥Mφ∗,1f χFc∥Lpp≤λ−p∥MNf∥Lpp≤(C1/λ)p∥Mφ∗,1f∥Lpp=12∥Mφ∗,1f∥Lpp. On F, [F4, assertion 5] gives Mφ∗,1f≤C4M~((Mφ0f)q0)1/q0 at every point at which Mφ∗,1f is finite, hence almost everywhere. Since [F1] gives Mφ0f≤Mφ∗,1f, we have (Mφ0f)q0∈L2; [F7] gives its local integrability and hence M~=M on this input. Integrating, ∥Mφ∗,1f χF∥Lp≤C4∥M((Mφ0f)q0)1/q0∥Lp=C4∥M((Mφ0f)q0)∥Lp/q01/q0≤C4CH∥(Mφ0f)q0∥Lp/q01/q0=C4CH∥Mφ0f∥Lp by [F5] with r=p/q0=2>1. Combining the two pieces, ∥Mφ∗,1f∥Lpp≤(C4CH)p∥Mφ0f∥Lpp+12∥Mφ∗,1f∥Lpp, so ∥Mφ∗,1f∥Lp≤21/pC4CH∥Mφ0f∥Lp; this is the a priori estimate, with a constant independent of f at each fixed order N≥max⁡(N2,N3).

2.1F4F5F6F7F8step 1.1algebra

Finiteness of Mφ∗,1f when Mφ0f∈Lp. Let f be arbitrary with Mφ0f∈Lp. Choose L≥L0(f,n,φ,p) as in assertion 1 of [F4] for the fixed exponent p of the theorem and then N′=N′(n,φ,T,L) as in assertions 2-4 of [F4], where T=2n/p and q0=p/2 are as above (note that N′ may be much larger than the theorem's fixed N; it is used only to prove finiteness). With 0<ϵ≤1/2 set M1=Mφ,1ϵ,Lf, M0=Mφ,0ϵ,Lf, MT=Mφ,Tϵ,Lf, MG=MN′ϵ,Lf and Fϵ={x:MG(x)<λM1(x)} with λ=21/pC1′, C1′=C1′(n,φ,T,L) the product of the constants in assertions 2 and 3 of [F4]. Assertion 1 of [F4] gives ∥M1∥Lp<∞. On Fϵc one has M1≤λ−1MG, so ∥M1χFϵc∥Lpp≤λ−p∥MG∥Lpp≤(C1′/λ)p∥M1∥Lpp=12∥M1∥Lpp. On Fϵ, assertion 4 of [F4] gives M1≤C3M~((Mφ0f)q0)1/q0 with C3=C3(n,φ,q0,T,L,λ,N′). Since (Mφ0f)q0∈L2, [F7] gives M~=M on this input; integrating as in step 1.1 and using [F5] gives ∥M1χFϵ∥Lp≤C′′∥Mφ0f∥Lp with C′′ independent of ϵ (but depending on the fixed L and hence on f). Hence ∥Mφ,1ϵ,Lf∥Lp≤21/pC′′∥Mφ0f∥Lp for every 0<ϵ≤1/2. Take ϵm=1/(m+2) for m≥0. Then the weights tL/(t+ϵm+ϵm∣y∣)L increase pointwise to 1 and the ranges 0<t<1/ϵm increase to (0,∞). For each fixed witness (t,y), eventually t<1/ϵm and its weight tends to 1, so Mφ,1ϵm,Lf↗Mφ∗,1f pointwise. By [F8], monotone convergence gives ∥Mφ∗,1f∥Lp≤21/pC′′∥Mφ0f∥Lp<∞.

3.1step 1.1step 2.1F2F3F5algebra

The implication 1⇒3 and the norm bound. Let f satisfy 1. By step 2.1, Mφ∗,1f∈Lp, so the a priori estimate of step 1.1 applies at every order N≥N0(n,p,φ):=max⁡(N2(n,φ,2n/p), N3(n,φ,p/2,21/pC1)) and gives ∥Mφ∗,1f∥Lp≤C∥Mφ0f∥Lp with C=21/pC4(n,φ,p/2,21/pC1,N)CH independent of f, where CH=Cn,21/q0 is the constant from [F5] at r=2; then [F2], [F3] give ∥MNf∥Lp≤C1∥Mφ∗,1f∥Lp≤C1C∥Mφ0f∥Lp for the same orders N≥N0(n,p,φ), since the estimates of steps 1.1 and 2.1 hold with the stated constants for every such N. Thus 1 implies 3 for every N≥N0(n,p,φ), with the stated norm bound.

4.1step 3.1F1F6∎

The remaining implications. If 3 holds, then [F1] gives Mφ0f≤2NPN(φ)MNf∈Lp and Mφ∗,af≤(1+a)NPN(φ)MNf∈Lp for every a≥1, so 3 implies 1 and 2 for every aperture, with the displayed bounds (the first inequality ∥M0∥≤∥M∗,a∥ is pointwise since Mφ0f≤Mφ∗,af). If 2 holds for some a, then Mφ0f≤Mφ∗,af∈Lp pointwise, so 2 implies 1. Hence all three assertions are equivalent, the quantities are finite exactly on the common set, and the displayed equivalence of extended norms holds with constants depending only on n,p,N and the kernel data used in the deconvolution comparison and in PN(φ). The last sentence about the kernel-independence of Hp follows by applying the equivalence to two admissible kernels φ,ψ and a common order N≥max⁡(N0(n,p,φ),N0(n,p,ψ)). This proves the theorem.

CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

Hp equals Lp with equivalent norms for 1<p<∞

Statement

Assume Countable Choice and the ultrafilter lemma used in the Hp⊆Lp part of the proof. Let n≥1 and 1<p<∞, and fix an admissible kernel φ∈S(Rn) with ∫φ≠0 as in The real Hardy space Hp defined by a radial maximal function. Then f∈Hp(Rn) if and only if f is (represented by) a function of Lp(Rn), the two classes coincide, and ∥f∥Hp≤C1∥f∥Lp,∥f∥Lp≤C2∥f∥Hp,f∈Hp, with constants depending on n,p, finitely many Schwartz seminorms of φ, and ∣∫φ∣−1. One may take C2=∣∫φ∣−1. The proof of the inclusion Hp⊆Lp assumes the ultrafilter lemma (a consequence of the Axiom of Choice, The Axiom of Choice) through the weak-star sequential compactness of the dual ball; the inclusion Lp⊆Hp is choice-free beyond the published maximal-function machinery. In particular the scale Hp is new only for 0<p≤1.

Facts & Assumptions

Given: Countable Choice and the ultrafilter lemma, n≥1, 1<p<∞, an admissible kernel φ, and f∈S′.

[F2]

If 0≤Φ∈L1(Rn) is radially nonincreasing, then the associated maximal operator is dominated by the centered Hardy-Littlewood maximal operator: (Φ∗∣u∣)(x)≤∥Φ∥1Mu(x) (Radially decreasing kernels are dominated by the maximal function).

[F3]

The centered Hardy-Littlewood maximal operator satisfies the strong Lp bound ∥Mu∥Lp≤Cn,p∥u∥Lp, 1<p<∞ (The centered maximal operator is bounded on Lp(Rn) for 1<p<∞, The centered and uncentered Hardy-Littlewood maximal functions).

[F4]

Let pα,0(φ)=sup⁡x∣xαφ(x)∣ be the Schwartz seminorms of Schwartz space and its seminorms, and set Cφ:=2n(1+n)n+1(p0,0(φ)+∑i=1np(n+1)ei,0(φ))<∞. Since ∣x∣≤nmax⁡i∣xi∣, the elementary inequality (1+r)n+1≤2n(1+rn+1) shows (1+∣x∣)n+1∣φ(x)∣≤Cφ. Thus G(x):=Cφ(1+∣x∣)−n−1 is a radially nonincreasing integrable pointwise majorant of ∣φ∣. If u∈Lp, then ∣(u∗φt)(x)∣≤(∣u∣∗∣φ∣t)(x); normalised dilations Gt are radially nonincreasing with ∥Gt∥1=∥G∥1, so ∣u∣∗∣φ∣t≤∣u∣∗Gt≤∥G∥1Mu (Radially decreasing kernels are dominated by the maximal function).

[F5]

For 1<p<∞ complex Lp is the dual of complex Lp′ by Complex Lp duality from real Lp duality. Separability first applies to the Borel restriction: rational boxes countably generate it (For n at least one, open sets, closed sets, compact sets, open balls, boxes, rational open boxes, and rational half-open boxes generate the Borel sigma-algebra on R^n), and bounded cubes give sigma-finiteness. Completion does not change Lp′: L(Rn) is exactly the completion of the restriction of λn to the Borel sets replaces each measurable set in a sequence of simple approximants by a Borel set modulo a null set; the countable union of these exceptions is null, yielding a Borel representative. Separability on the Borel restriction therefore gives separability of Lebesgue Lp′; hence the unit ball of Lp is weak-star sequentially compact, the weak-star topology on norm-bounded sets is metrised by a countable dense set, and the dual norm is weak-star lower semicontinuous (For 1<p<∞, the same representation theorem holds on arbitrary measure spaces, If μ is sigma-finite and A is countably generated, then Lp(μ) is separable for 1≤p<∞, A separable predual has weak-star sequentially compact dual ball, Conjugate exponents, including the endpoint conventions).

Proof technique: direct domination by the Hardy-Littlewood maximal function, then weak-star sequential compactness for the reverse inclusion.

Proof

technique · direct
1.1F2F3F4algebra

Lp⊂Hp. Let f∈Lp and use the radially nonincreasing integrable majorant G from [F4]. For every t>0 the normalised kernel Gt is again radially nonincreasing with ∥Gt∥1=∥G∥1, and ∣f∗φt∣≤∣f∣∗∣φ∣t≤∣f∣∗Gt≤∥G∥1Mf pointwise by [F2]. Hence Mφ0f≤∥G∥1Mf, and [F3] gives ∥f∥Hp=∥Mφ0f∥Lp≤∥G∥1Cn,p∥f∥Lp, so f∈Hp with the stated bound.

1.2F5givenalgebra

Hp⊂Lp. Let f∈Hp and set Φ=φ/∫φ. Then ∫Φ=1 and MΦ0f=∣∫φ∣−1Mφ0f∈Lp exactly by linearity. The functions ut=f∗Φt, 0<t<1, satisfy ∣ut∣≤MΦ0f pointwise, hence form a bounded family in Lp. By Schwartz approximate identities converge in the sense of tempered distributions, ut→f in S′ as t↓0: for ψ∈S, ⟨ut,ψ⟩=⟨f,Φˇt∗ψ⟩→⟨f,ψ⟩. The space Lp′ is separable for 1<p<∞, so the unit ball of its dual Lp is weak-star sequentially compact, and the bounded sequence utk over a fixed sequence tk↓0 has a subsequence (utkℓ) converging weak-star to some v∈Lp. By weak-star lower semicontinuity of the norm, ∥v∥Lp≤lim inf⁡ℓ∥utkℓ∥Lp≤∥MΦ0f∥Lp≤∣∫φ∣−1∥f∥Hp. For every ψ∈S⊂Lp′ one has ⟨v,ψ⟩=lim⁡ℓ⟨utkℓ,ψ⟩=⟨f,ψ⟩, since ut→f in S′; since equality of tempered distributions is tested against S, the distribution f is represented by the Lp function v. Hence f∈Lp with ∥f∥Lp≤∣∫φ∣−1∥f∥Hp.

2.1step 1.1step 1.2∎

Conclusion. Steps 1.1 and 1.2 show that Hp and Lp have the same elements and equivalent (quasi-)norms for 1<p<∞.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

ℓp sums of atoms converge in S′ and in Hp

Statement

Assume Countable Choice. Let n≥1, 0<p≤1, s≥⌊n(1/p−1)⌋, fix the admissible kernel φ defining Hp, and let N be an admissible order for the grand maximal function with N≥max⁡(N0(n,p,φ),n+s+1). Let (aj) be a sequence of (p,∞,s)-atoms and (λj)∈ℓp. Then the series ∑jλjaj converges absolutely in S′(Rn) to an element g∈S′(Rn); the partial sums converge to g in the Hp quasi-norm of The real Hardy space Hp defined by a radial maximal function; g∈Hp; and with Cp=C(n,p,s,N,φ)<∞ independent of the atoms and coefficients, ∥g∥Hp≤Cp(∑j∣λj∣p)1/p,∥g−∑j≤Jλjaj∥Hp≤Cp(∑j>J∣λj∣p)1/p.

Facts & Assumptions

Given: Countable Choice, n≥1, 0<p≤1, s≥⌊n(1/p−1)⌋, the fixed admissible kernel φ, an admissible order N≥max⁡(N0(n,p,φ),n+s+1), atoms aj, coefficients (λj)∈ℓp.

[F1]

Uniform atom bound: there is C=C(n,p,s) with ∥MNaj∥Lp≤C and ∣⟨aj,ψ⟩∣≤C∥ψ∥Cs+1(Rn),∥ψ∥Cs+1(Rn):=max⁡∣β∣≤s+1sup⁡x∈Rn∣∂βψ(x)∣, for every ψ∈S. The pairing estimate follows from assertion 2 of Atoms have uniformly bounded Hp quasi-norm and uniformly bounded test pairings because its minimum cube-volume factor is at most one; in particular this is a uniform bound by a continuous Schwartz seminorm.

[F2]

Domination: Mφ0g≤2NPN(φ)MNg for every g∈S′ (The grand maximal function dominates every admissible radial and nontangential maximal function).

[F3]

Convergence in S′ of the partial sums implies pointwise convergence of the convolutions: if gJ→g in S′, then (gJ∗φt)(y)→(g∗φt)(y) for every t>0 and y, since (gJ∗φt)(y)=⟨gJ,φt(y−⋅)⟩ and φt(y−⋅)∈S (Convolution of a tempered distribution with a schwartz function, Tempered distribution).

[F4]

MN is Borel measurable and the p-th power inequality ∣∑jzj∣p≤∑j∣zj∣p holds for 0<p≤1; monotone convergence applies to the nonnegative measurable partial sums (Measurability and lower semicontinuity of the smooth maximal functions, Monotone convergence for the integral).

Proof technique: absolute convergence of pairings, monotone maximal control and monotone convergence.

Proof

technique · direct
1.1F1givenalgebra

Absolute convergence in S′. Fix ψ∈S. By [F1], ∣λj⟨aj,ψ⟩∣≤C∥ψ∥Cs+1(Rn)∣λj∣, and ∑j∣λj∣<∞ because (λj)∈ℓp and p≤1. Thus the scalar series ∑jλj⟨aj,ψ⟩ converges absolutely for every ψ. Its limit defines a linear functional g satisfying ∣⟨g,ψ⟩∣≤C∥ψ∥Cs+1(Rn)∑j∣λj∣; this continuous-seminorm bound proves g∈S′, and the partial sums converge to g on every Schwartz test.

1.2F3givenalgebra

Maximal control of the sum. For every J put gJ=∑j≤Jλjaj. For fixed Ψ∈FN, t>0 and y with ∣y−x∣≤t, [F3] gives (g∗Ψt)(y)=lim⁡J(gJ∗Ψt)(y), so ∣(g∗Ψt)(y)∣≤lim sup⁡J∑j≤J∣λj∣∣(aj∗Ψt)(y)∣≤∑j∣λj∣∣(aj∗Ψt)(y)∣. Taking the defining suprema and using ∣(aj∗Ψt)(y)∣≤MNaj(x) for each such Ψ,t,y gives MNg(x)=sup⁡Ψ∈FNsup⁡t>0sup⁡∣y−x∣≤t∣(g∗Ψt)(y)∣≤∑j∣λj∣MNaj(x) pointwise.

2.1step 1.1step 1.2F1F2F4algebra

Hp bound and convergence. By [F4] and the p-power inequality for finite sums, letting the number of terms increase in the display of step 1.2 gives (MNg)p≤∑j∣λj∣p(MNaj)p. The nonnegative partial sums on the right are measurable; monotone convergence and [F1] therefore give ∥MNg∥Lpp≤Cp∑j∣λj∣p, so ∥g∥Hp≤2NPN(φ)C(∑j∣λj∣p)1/p by [F2]. Applying the same argument to the tail g−∑j≤Jλjaj=∑j>Jλjaj gives the stated tail bound; in particular the partial sums converge to g in the Hp quasi-norm.

3.1step 1.1step 1.2step 2.1∎

Conclusion. Steps 1.1 and 1.2 establish the absolute convergence in S′, and step 2.1 establishes the membership g∈Hp, the quasi-norm bound and the tail bound. This proves the lemma.

LemmaStatement: Literature-sourcedProof: Literature-sourcedprecheck passOpen item page →

Level decomposition of an Hp distribution produces atoms

Statement

Assume Countable Choice. Fix the admissible kernel φ defining the Hp quasi-norm. Let n≥1, 0<p≤1, and let f∈Hp(Rn) with the space and quasi-norm of The real Hardy space Hp defined by a radial maximal function. Put s=⌊n(1/p−1)⌋, let K≥n/p be an integer and let Φ,ψ,ψ~ be the Calderon reproducing pair of flatness K from Calderon reproducing pair and the telescoping identity in S′. Fix an admissible grand-maximal order N≥max⁡{N0(n,p,φ), n, ⌊n/p⌋+1}. For r∈Z put Ωr={x:MNf(x)>2r}. Then there are a countable family (aB) of (p,∞,s)-atoms and positive coefficients λB such that

  1. ∑BλBp≤C∥f∥Hpp with C=C(n,p,N,K,φ,Φ)<∞;
  2. f=∑BλBaB with convergence in S′(Rn);
  3. each atom aB is supported in a fixed dilation B⋆=7B of a ball B=B(ξ,ρ(ξ)/2) of the Whitney-type ball cover of Ωr for the corresponding level r, with ∥aB∥L∞≤∣B⋆∣−1/p and vanishing moments through order s, and the balls B cover Ωr with multiplicity at most K(n)=785n;
  4. the centres and radii are those of Whitney-type ball cover with disjoint small balls and bounded overlap applied to each nonempty Ωr.

Facts & Assumptions

Given: Countable Choice, n≥1, 0<p≤1, admissible N≥max⁡(N0(n,p,φ),max⁡(n,⌊n/p⌋+1)), f∈Hp, s=⌊n(1/p−1)⌋, an integer K≥n/p, and the fixed reproducing pair Φ,ψ,ψ~ with ψk(x)=2knψ(2kx), ψ~k(x)=2knψ~(2kx).

[F1]

Maximal characterisation: ∥MNf∥Lp≤C0(n,p,N,φ)∥f∥Hp and MNf is Borel and lower semicontinuous, so each Ωr is open (Maximal-function characterisations of real Hardy spaces, Measurability and lower semicontinuity of the smooth maximal functions).

[F2]

Layer-cake bound: ∑r∈Z2pr∣Ωr∣≤Cp∥MNf∥Lpp, since ∑r2pr∣Ωr∣=∑ν∣Ων∖Ων+1∣∑r≤ν2pr≤Cp∑ν2pν∣Ων∖Ων+1∣≤Cp∫(MNf)p (Measurability and lower semicontinuity of the smooth maximal functions, The real Hardy space Hp defined by a radial maximal function).

[F3]

Reproducing identity: f=∑k∈Zψk∗ψ~k∗f in S′, supp⁡ψk⊆B(0,2−k), and ∫ψ(x)xαdx=0 for ∣α∣≤K; the identity and its justification are in Calderon reproducing pair and the telescoping identity in S′.

[F4]

For every k∈Z one has ∥ψ~k∗f∥L∞≤c2kn/p∥f∥Hp: indeed ∣ψ~k∗f(x)∣p≤inf⁡∣x−y∣≤2−ksup⁡∣y−z∣≤2−k∣ψ~k∗f(z)∣p≤cinf⁡∣x−y∣≤2−kMNf(y)p≤c∣B(x,2−k)∣−1∫B(x,2−k)(MNf)p≤c2kn∥MNf∥pp (Grand maximal test class of order N and the grand maximal function, [F1]).

[F5]

Whitney-type ball cover of each nonempty Ωr: points ξj, radii ρj=ρ(ξj), pairwise disjoint balls B(ξj,ρj/8) with ⋃jB(ξj,ρj/2)=Ωr, comparison ρj/7≤ρν≤7ρj for meeting 3ρ/4-balls and bounded overlap K(n) of the dilated balls B(ξj,3ρj/4) (Whitney-type ball cover with disjoint small balls and bounded overlap).

[F6]

Every x with MNf(x)>2r lies in Ωr; the sets Ωr decrease in r and are open, so dist⁡(⋅,Ωrc) is continuous and positive on Ωr (Measurability and lower semicontinuity of the smooth maximal functions).

[F7]

Moment-tail estimate: if Ψ∈Cc∞ with supp⁡Ψ⊆B(0,1) and ∫Ψ(z)zαdz=0 for ∣α∣≤K, then for every χ∈S and σ>n there is cσ with ∣∫RnΨk(x−y)χ(x)dx∣≤cσ2−k(K+1)(1+∣y∣)−σ for k≥0. This is the Taylor estimate (using Multivariable Taylor formula with a Lagrange remainder along a line segment separately on real and imaginary parts): expand χ about y, use the vanishing moments, bound the remainder by C2−k(K+1)(1+∣y∣)−σ with the Schwartz decay of χ and of its derivatives (Schwartz space and its seminorms, Dilations and their normalisations preserve Schwartz space, with scaling identities).

[F8]

Ball volumes: with ωn=∣B(0,1)∣, one has 0<ωn<∞ and ∣B(x,R)∣=ωnRn for R>0, by Euclidean balls have positive finite Lebesgue measure and For a nonzero real c, dilation by c multiplies Lebesgue outer measure by ∣c∣n, and reflection in the origin preserves it.

[F9]

A tempered distribution u satisfying ∣⟨u,χ⟩∣≤D∥χ∥1 for all Schwartz tests is represented by an L∞ function bounded by D. Indeed, density of complex Cc∞ in L1 (Complex finite-simple and smooth compact-support density for finite p) uniquely extends u to a bounded complex-linear functional on L1. Restrict it to L2([−m,m]n), extending inputs by zero; ∥h∥1≤(2m)n/2∥h∥2. Apply For 1<p<∞, the same representation theorem holds on arbitrary measure spaces at exponent two separately to the real and imaginary parts on real inputs, then combine by complex linearity, to obtain a complex density gm. Testing with gm‾/∣gm∣ times indicators of measurable subsets (zero where gm=0) gives ∫E∣gm∣≤D∣E∣, hence ∣gm∣≤D a.e. Uniqueness of the L2 densities makes them agree on nested cubes; choosing representatives under Countable Choice and discarding their countable union of disagreement null sets glues a globally bounded density. Density and truncation recover the functional on all of L1. All hypotheses of these suppliers hold under the assumed Countable Choice.

Proof technique: level-set decomposition, telescoping cancellation, Whitney covering and atom normalisation.

Proof

technique · constructive
1.1F1F2F4F6F8algebraconstruct

The level sets and scale shells. If f=0, the empty atomic family gives the conclusion, so assume f≠0. Put M=MNf and Ωr={M>2r}. By [F1], [F2], and layer cake (summing nonnegative indicators using Monotone convergence for the integral), ∑r∈Z2pr∣Ωr∣≤Cp∥M∥pp≤C∥f∥Hpp, so every Ωr has finite measure. For k∈Z set ak=2−k+1, Ukr={x∈Ωr:dr(x)>ak},Vkr={x∈Ωr+1:dr+1(x)>ak},Erk=Ukr∖Vkr, where dr(x)=dist⁡(x,Ωrc). The sets Erk are disjoint in r. At a fixed k, they cover every y with 0<M(y)<∞ for which ψ~k∗f(y)≠0: indeed, with η=4nψ~(4 ⋅) and tk=2−k+2 one has ηtk=ψ~k. After division by PN(η) this is a test in FN, so a nonzero value at y gives a positive lower bound for M(z) for all ∣z−y∣≤tk. Choosing r below that bound puts B(y,tk)⊂Ωr, hence y∈Ukr. Since M∈Lp is finite a.e., for a.e. such y it is outside Ωr for all sufficiently large r; the nested sets Ukr therefore give a unique last index r with y∈Erk. Points where M=∞ form a null set, and where M=0 the displayed convolution is zero by the grand-maximal definition. Thus the Erk partition the integrand ψ~k∗f up to a null set, which is all the integral and distributional identities below require. Finally, if Ωr≠∅, choose sr so negative that ωnakn>∣Ωr∣ for k<sr. Then Ukr=Erk=∅ for k<sr, since each point of Ukr would force a ball of radius ak inside Ωr. If Ωr=∅, set all its pieces to zero.

2.1step 1.1F3F4F6F7F9algebra

Local bounds and the two-boundary scale split. For every measurable A⊆Erk, ∥∫Aψk( ⋅−y)(ψ~k∗f)(y) dy∥∞≤C2r,∥∫AΦm( ⋅−y)(Φm∗f)(y) dy∥∞≤C2r(m=k,k+1).(1) To see this, if y∈Erk is outside Ωr+1, use z=y. Otherwise dr+1(y)≤ak<dr(y); choose z∈Ωr+1c with ∣z−y∣<dr+1(y)+ϵ<dr(y) and ∣z−y∣<2ak. Then z∈Ωr∖Ωr+1 and M(z)≤2r+1. Each inner kernel here is exactly a grand-maximal test dilation at cone scale 2ak: use 4nψ~(4⋅) for ψ~k, 4nΦ(4⋅) for Φk, and 8nΦ(8⋅) for Φk+1. The cone definition of MN therefore gives ∣ψ~k∗f(y)∣+∣Φm∗f(y)∣≤C2r. Multiplication by the fixed L1 norms of the outer kernels ψk and Φm proves (1). For sr≤q≤m write Fr,q,m(x)=∑k=qm∫Erkψk(x−y)(ψ~k∗f)(y) dy. Its L∞ norm is at most C2r, uniformly in r,q,m. Here are the scale details. If a summand can be nonzero at x, then x∈Ωr. Choose ℓ with x∈Uℓ+1r∖Uℓr, so 2−ℓ<dr(x)≤2−ℓ+1. If also x∈Ωr+1, choose ν with x∈Vν+1r∖Vνr; since dr(x)≥dr+1(x), ν≥ℓ. For ν≥ℓ+3, the Lipschitz property of distance gives B(x,2−k)∩Erk=∅ (k≤ℓ−1 or k≥ν+2),B(x,2−k)⊂Erk (ℓ+2≤k≤ν−1). Thus, in any finite interval [q,m], at most four non-full boundary terms remain; the consecutive full terms k=u,…,v telescope to ∑k=uvψk∗ψ~k∗f(x)=Φv+1∗Φv+1∗f(x)−Φu∗Φu∗f(x). The support balls of the two endpoint convolutions lie in Erv and Eru, respectively, so (1) bounds both endpoints by C2r. If ℓ≤ν≤ℓ+2, only the at most four indices ℓ,…,ν+1 can contribute, and (1) applies directly. If x∈Ωr∖Ωr+1, choose ℓ as above. There is no interaction for k≤ℓ−1, while B(x,2−k)⊂Erk for every k≥ℓ+2. The latter tail in any finite interval telescopes, with both endpoint convolutions localized in the corresponding Erk and bounded by (1); only the two scales ℓ,ℓ+1 are left. These cases prove the uniform bound for every finite partial sum. For χ∈S, the moment estimate [F7] and [F4] give, for k≥0, ∑r∣⟨grk,χ⟩∣≤Cχ2−k(K+1−n/p)∥f∥Hp,grk(x)=∫Erkψk(x−y)(ψ~k∗f)(y) dy. For k<0, the same sum is at most Cχ2kn/p∥f∥Hp, using ∥ψk∥1=∥ψ∥1 and ∥ψ~k∗f∥∞≤C2kn/p∥f∥Hp. The first bound is summable because K≥n/p, and for each fixed r only finitely many negative k occur because k≥sr. Thus Fr=∑k≥srgrk converges in S′. The uniform bounds for finite partial sums imply ∣⟨Fr,χ⟩∣≤C2r∥χ∥1; by the bounded-distribution representation [F9], Fr is represented by an L∞ function with ∥Fr∥∞≤C2r. No pointwise convergence of the infinite scale series is needed.

3.1step 2.1F3F4F5F7F8F9algebra

Whitney localization, overlap, and atoms. Fix a nonempty Ωr and take the cover [F5], writing Bj=B(ξj,ρj/2) and Wj=B(ξj,3ρj/4). Then Bj⊂Wj, so the Bj cover Ωr with multiplicity at most the exact constant K(n)=785n from [F5]. For each j, let k0(j) be the unique integer with 2−k0(j)<ρj≤2−k0(j)+1. For k≥sr, put Nj,k={y:dist⁡(y,Bj)<ak} and Arjk={Erk∩Nj,k,k≥k0(j),∅,k<k0(j). Put Rrjk=Arjk∖⋃m>jArmk and grjk(x)=∫Rrjkψk(x−y)(ψ~k∗f)(y) dy. These sets are disjoint and cover Erk: if y∈Erk, choose a covering ball Bj containing y. Then dr(y)>ak=2⋅2−k and dr(y)≤dr(ξj)+∣y−ξj∣<3ρj/2, so 2−k<3ρj/4<ρj and k≥k0(j). Hence y∈Arjk, and the greatest eligible index assigns it to exactly one Rrjk, once the finite overlap below is established. The actual localization neighborhoods Nj,k with k≥k0(j) have uniformly finite overlap. For such an index 2−k<ρj, so ak<2ρj and ∣y−ξj∣<ρj/2+ak<5ρj/2 whenever y∈Nj,k. If two eligible neighborhoods meet, the 1-Lipschitz property of dr gives, for R=max⁡(ρj,ρm) and r0=min⁡(ρj,ρm), R−r0≤∣ξj−ξm∣<12(R+r0)+4r0, so R<11r0. For any finite collection of eligible neighborhoods containing one point y, the disjoint balls B(ξj,ρj/8) therefore have radii at least R/88 and lie in B(y,21R/8). Comparing volumes gives multiplicity at most 231n at every fixed scale. If Arjk≠∅, then k≥k0(j) and the support of ψk∗[(ψ~k∗f)1Rrjk] lies in the ball of radius ρj/2+3⋅2−k<7ρj/2 about ξj, hence in 7Bj. It remains to prove a uniform L∞ estimate for FBj:=∑k≥sr∫Rrjkψk(⋅−y)(ψ~k∗f)(y) dy. We use the following explicit localization estimate. For any set S⊆Rn and integers sr≤q≤m, replacing Erk by Erk∩{y:dist⁡(y,S)<ak} in Fr,q,m still gives an L∞ norm at most C2r. If S=∅, the sum is zero. If S≠∅ and dist⁡(x,S)=0, all kernel-support balls B(x,2−k) lie in these neighborhoods and the sum is the full bounded partial sum. If δ=dist⁡(x,S)>0, choose ℓ with 2−ℓ<δ≤2−ℓ+1. Then B(x,2−k) lies in the neighborhood for k≤ℓ−1 and is disjoint from it for k≥ℓ+2, leaving only two boundary scales, each bounded by (1). The same estimate holds for the infinite tail: the preceding absolute pairing bounds give distributional convergence, and the uniform finite-sum bounds pass to the limit by the same bounded-distribution representation [F9] used in step 2.1. Let Jj be all later indices m>j for which Wm∩Wj≠∅. By [F5], #Jj≤K(n) and ρm≥ρj/7. Put ρ∗=min⁡({ρj/7}∪{ρm:m∈Jj})=ρj/7, let k1 be the least integer with ak1<ρ∗/4, and set S=⋃m∈JjBm. Then ρj/7≤ρ∗≤ρj, while ρj/2≤2−k0<ρj and ρ∗/16≤2−k1<ρ∗/8. Hence k0<k1 and 2k1−k0=2−k0/2−k1<112<27, so k1−k0≤7. For every k≥k1 each neighborhood Nm,k with m∈Jj∪{j} lies in Wm. To exclude other later indices without presupposing their radii, a meeting point gives ∣ξm−ξj∣<(ρm+ρj)/2+2ak. Here ak<ρ∗/4≤ρj/28, so this distance is less than 3(ρm+ρj)/4. Thus Wm∩Wj≠∅ and m∈Jj. All indices in Jj are eligible at these scales because 2−k<ρ∗/8≤ρm/8. Consequently the high-scale part is exactly the difference of the two localized sums associated with S∪Bj and S, each bounded by the localization estimate. There are at most seven lower scales k0≤k<k1, each bounded by (1). Thus ∥FBj∥∞≤C♯2r uniformly in r,j. Absolute convergence against Schwartz tests follows by summing [F7] over the disjoint sets Rrjk; for k<0 the bound is Cχ2kn/p∥f∥Hp as above. Each summand is compactly supported in 7Bj and has zero moments through order K by the moments of ψ. Choose the representative of FBj to vanish outside its compact support. That support lies in the closed ball of radius ρj/2+3⋅2−k0(j)<7ρj/2, so it is contained in the open ball 7Bj. For fixed j,k, Rrjk⊂Nj,k is bounded, has finite measure, and ψ~k∗f is bounded by [F4], so absolute integrability and Tonelli's theorem for nonnegative measurable functions on a sigma-finite product applied to the absolute values justify each moment integral. The distributional limit is supported in 7Bj and has the same moments, by testing against a smooth compactly supported test equal to each monomial on a neighborhood of the closed ball 7Bj‾ (construct the cutoff from The standard smooth step function). Finally, the sets Rrjk partition the Erk, and the absolute pairing bounds summed over all r,j,k show f=∑r,jFBjin S′. Indeed, for k≥0 the full sum of absolute pairings is bounded by Cχ2−k(K+1−n/p)∥f∥Hp using [F7]; for k<0 it is bounded by Cχ2kn/p∥f∥Hp. Sum in k and apply the Calderon reproducing identity [F3].

4.1step 3.1F8algebra

Atom normalization. Choose an axis-parallel cube Qj centered at ξj with side length 7ρj; it contains 7Bj, and ∣Qj∣/∣7Bj∣=2n/ωn. Enlarge C♯ if needed so that C♯≥C0(2n/ωn)1/p, where C0 is the constant in the preceding L∞ estimate. Put arj=C♯−1∣7Bj∣−1/p2−rFBj,λrj=C♯∣7Bj∣1/p2r. Then supp⁡arj⊆7Bj, ∥arj∥∞≤∣7Bj∣−1/p, and the choice of C♯ gives ∥arj∥∞≤∣Qj∣−1/p. Its moments vanish through order K, hence through s, because s=⌊n(1/p−1)⌋<n/p≤K. Thus arj is a (p,∞,s)-atom in the cube-supported convention of Hp atoms with a prescribed moment order, and f=∑r,jλrjarj in S′.

5.1step 4.1F1F2F5F8algebra

Coefficient bound. Since ∣7Bj∣=7n∣Bj∣ and Bj⊂Wj with multiplicity at most K(n), ∑r,jλrjp=C♯p7n∑r2pr∑j∣Bj∣≤C♯p7nK(n)∑r2pr∣Ωr∣≤C∥f∥Hpp by the layer-cake estimate and [F1]. This proves the coefficient bound.

6.1step 1.1step 3.1step 4.1step 5.1discharge-construct∎

Conclusion. The zero case was handled at the start. For f≠0, steps 3.1 and 4.1 produce the atoms and coefficients, step 5.1 gives the ℓp estimate, and the absolutely convergent distributional sum in step 3.1 equals f. Hence all four claims hold.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

Atomic characterisation of real Hp for 0<p≤1

Statement

Assume Countable Choice. Let n≥1, 0<p≤1, fix the admissible kernel φ defining Hp, and set s=⌊n(1/p−1)⌋. Fix an integer K≥n/p and the associated reproducing pair from Calderon reproducing pair and the telescoping identity in S′. Fix an admissible grand-maximal order N≥max⁡{N0(n,p,φ),n+s+1} as in the two cited lemmas. For f∈S′(Rn) the following are equivalent:

  1. f∈Hp(Rn) in the sense of The real Hardy space Hp defined by a radial maximal function;
  2. there exist a sequence (λj)∈ℓp and a sequence (aj) of (p,∞,s)-atoms (Hp atoms with a prescribed moment order) with f=∑jλjaj converging in S′(Rn).

In that case ∥f∥Hp≍n,p,N,K,φinf⁡(∑j∣λj∣p)1/p, the infimum being taken over all atomic representations of f, and every such series converges also in the Hp quasi-norm.

Facts & Assumptions

Given: Countable Choice, n≥1, 0<p≤1, the fixed kernel φ and reproducing order K≥n/p, s=⌊n(1/p−1)⌋, an admissible order N≥max⁡{N0(n,p,φ),n+s+1} as in the two cited lemmas, and f∈S′.

[F1]

Level decomposition: if f∈Hp then there are (p,∞,s)-atoms aB and coefficients λB>0 with f=∑BλBaB in S′ and ∑BλBp≤C1∥f∥Hpp, where C1=C(n,p,N,K,φ,Φ) includes the auxiliary flat reproducing kernel Φ (Level decomposition of an Hp distribution produces atoms). For the norm bound, use Countable Choice over the integer pairs (n,K) to fix once one admissible kernel Φn,K from Calderon reproducing pair and the telescoping identity in S′. With this fixed family, C(n,p,N,K,φ,Φn,K) is a function of n,p,N,K,φ. No uniformity over all admissible reproducing kernels is asserted or needed: the atomic class and the infimum over representations do not depend on the auxiliary kernel.

[F2]

ℓp sums: if (aj) are (p,∞,s)-atoms and (λj)∈ℓp, then g=∑jλjaj converges absolutely in S′, lies in Hp and satisfies ∥g∥Hp≤C2(∑j∣λj∣p)1/p with C2 depending on n,p,s,N,φ; the tail bound of that lemma gives convergence in the Hp quasi-norm (ℓp sums of atoms converge in S′ and in Hp).

Proof technique: the two implications supplied by the level decomposition and the ℓp-summation lemma, then the infimum.

Proof

technique · direct
1.1F2algebra

2⇒1 and the upper norm bound. Let f=∑jλjaj with (λj)∈ℓp and atoms aj. By [F2], f∈Hp and ∥f∥Hp≤C2(∑j∣λj∣p)1/p; taking the infimum over all representations gives the inequality ∥f∥Hp≤C2inf⁡(∑j∣λj∣p)1/p.

1.2F1algebra

1⇒2 and the lower norm bound. Let f∈Hp and apply [F1] using the auxiliary kernel Φn,K fixed there, obtaining f=∑BλBaB. Then (λB)∈ℓp with ∑BλBp≤C1∥f∥Hpp, so f has an atomic representation and inf⁡(∑j∣λj∣p)1/p≤C11/p∥f∥Hp.

2.1F2step 1.2

Hp convergence. If f=∑jλjaj with (λj)∈ℓp, the tail estimate of [F2] applied to the partial sums gives ∥f−∑j≤Jλjaj∥Hp≤C2(∑j>J∣λj∣p)1/p→0; hence the series converges in the Hp quasi-norm. This applies in particular to the level-decomposition representation of [F1] and to any atomic representation of f∈Hp.

3.1step 1.1step 1.2step 2.1∎

Conclusion. Steps 1.1-1.2 prove the equivalence and the two-sided norm bound, and step 2.1 gives the quasi-norm convergence. This proves the theorem.

RemarkRemark: Literature-sourcedProof: Not applicablejudge pass (gpt-6.1-sol)Open item page →

For 0<p<1 the Hp functional is a quasi-norm, and Hp is a quasi-Banach space

Statement

Assume Countable Choice. Fix n≥1, 0<p<1 and an admissible kernel φ∈S(Rn) with ∫φ≠0 as in The real Hardy space Hp defined by a radial maximal function. Its functional is p-subadditive, ∥f+g∥Hpp≤∥f∥Hpp+∥g∥Hpp, and fails the ordinary triangle inequality for a pair of elements of this same Hp. It also satisfies ∥f+g∥Hp≤21/p−1(∥f∥Hp+∥g∥Hp). Consequently d(f,g)=∥f−g∥Hpp is a translation-invariant metric on Hp under which Hp is complete. Thus Hp is a quasi-Banach space. No statement is made identifying Hp with the dual of, or a dual of, a Banach space when p<1, and no Banach-space duality theorem is applied to Hp below p=1 on this page; the only duality statement here is Hp=Lp for p>1.

Remarks

The maximal operator is pointwise sublinear: Mφ0(f+g)≤Mφ0f+Mφ0g. Since (u+v)p≤up+vp for u,v≥0 and 0<p<1, integration gives the stated p-subadditivity. The displayed quasi-triangle inequality follows as well because concavity of r↦rp gives ap+bp≤21−p(a+b)p for a,b≥0; take p-th roots after ∥f+g∥Hpp≤∥f∥Hpp+∥g∥Hpp.

Here is an Hp-specific witness that the ordinary triangle inequality fails; the proof does not use the later uniform atom estimate. Put s=⌊n(1/p−1)⌋ and θ(u)={e−1/(1−u2),∣u∣<1,0,∣u∣≥1,ρ(x)=∏j=1nθ(xj),a=∂1s+1ρ. Here θ(u)=β(1−u2) for the standard flat function of The standard flat function; The standard flat function is smooth and flat at zero establishes smoothness through the endpoints. Thus a is a smooth function on Rn supported in [−1,1]n. It is nonzero: otherwise each one-variable section of ρ would have (s+1)st derivative zero, hence would be a polynomial of degree at most s by repeated Newton-Leibniz, impossible for its nonzero compact support. Repeated one-variable integration by parts (obtained from the product rule and Newton–Leibniz needs only continuity on [a,b], differentiability on (a,b), and a Riemann-integrable extension of the interior derivative) has no boundary terms and gives ∫xαa(x) dx=0 for every multi-index ∣α∣≤s: indeed α1≤s, so ∂1s+1xα=0. Let m=Mφ0a. For every x, the convolution estimate gives m(x)≤∥a∥∞∥φ∥1. For ∣x∣>2n, Taylor's formula in the variable y, with the cancellation moments through order s removed, gives for every t>0 ∣(a∗φt)(x)∣≤Cn,s∫∣a(y)∣∣y∣s+1max⁡∣α∣=s+1sup⁡0≤τ≤1∣∂αφt(x−τy)∣ dy. Writing q=n+s+1, Schwartz decay says for any r0>q and ∣α∣=s+1, ∣∂αφt(w)∣≤Cr0,αt−q(1+∣w∣/t)−r0≤Cr0,α′∣w∣−q(w≠0,t>0). Since ∣y∣≤n on the support of a, this proves m(x)≤C∣x∣−q for ∣x∣>2n. The choice of s gives pq=p(n+s+1)>n, so m∈Lp and a∈Hp.

Also m is positive on a nonempty open set. To see this, normalize Φ=φ/(∫φ). By Schwartz approximate identities converge in the sense of tempered distributions, Φt∗a→a in S′, so some t0>0 has a∗φt0≢0; otherwise the distributional limit would be zero. This convolution is continuous, so its absolute value, and hence m, is positive on a nonempty open set. Thus A:=∫Rnm(x)p dx=∥a∥Hpp is finite and positive.

For y∈Rn put ay(x)=a(x−y) and my(x)=m(x−y). Translation invariance of the convolution and Lebesgue measure gives Mφ0ay=my and ∥ay∥Hp=∥a∥Hp. Pointwise sublinearity gives Mφ0(a+ay)≤m+my, so a+ay∈Hp; the reverse triangle inequality for this sublinear maximal operator gives Mφ0(a+ay)(x)≥∣m(x)−my(x)∣. For QR=[−R,R]n, choose R with ∫QRmp>2p−1A, possible since 2p−1<1 and mp∈L1. Take y=Te1 with T>2R; then QR and QR+y are disjoint. The scalar inequality ∣u−v∣p≥up−vp for u,v≥0, applied with the local copy as u on each cube, gives ∫Rn∣m−my∣p dx≥2∫QRmp dx−∫QRmyp dx−∫QR+ymp dx. As y→∞ along a coordinate ray, the last two integrals tend to zero because mp∈L1. The first term is strictly larger than 2pA. Therefore for all sufficiently large such y, ∥a+ay∥Hpp≥∫∣m−my∣p>2pA=(∥a∥Hp+∥ay∥Hp)p, which contradicts the ordinary triangle inequality. This proves the claimed failure within the radial-maximal definition of Hp.

Completeness: a complete argument is sketched here for the record. Let (fk) be Cauchy for d. Passing to a subsequence, assume ∥fk+1−fk∥Hpp≤2−k, and set gk=fk+1−fk. By Atomic characterisation of real Hp for 0<p≤1 each gk has an atomic representation gk=∑jλk,jak,j with ∑j∣λk,j∣≤C∥gk∥Hp≤C2−k/p; the pairing bound for atoms Atoms have uniformly bounded Hp quasi-norm and uniformly bounded test pairings then gives, for every ψ∈S, ∣⟨gk,ψ⟩∣≤C(ψ)∑j∣λk,j∣≤C′(ψ)2−k/p, so ∑kgk defines a continuous linear functional h bounded by a fixed Schwartz seminorm times ∑k2−k/p, and converges to h in S′; put f=f0+h. The same bound applied to the tails shows that fk→f in S′. For fixed φ and (t,x), the convolutions (fk∗φt)(x) converge to (f∗φt)(x); taking the supremum after pointwise convergence of each convolution gives Mφ0(f−fl)≤lim inf⁡kMφ0(fk−fl). Hence Fatou's lemma applied to the measurable functions ∣Mφ0(fk−fl)∣p gives ∥f−fl∥Hpp≤lim inf⁡k∥fk−fl∥Hpp, which tends to 0 as l→∞; hence fl→f in Hp and f∈Hp. The metric d is translation invariant because Mφ0((f+h)−(g+h))=Mφ0(f−g). No Banach duality is used in this argument, and the completion obtained is the space Hp itself.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

Calderon-Zygmund operators map H1 boundedly into L1

Statement

Assume Countable Choice. Let n≥1, 0<δ≤1, fix the kernel φ defining H1 and an admissible order N for its atomic characterisation, and let k:Rn∖{0}→C satisfy the pointwise size bound ∣k(x)∣≤A1∣x∣−n, the standard δ-Holder bound ∣k(x−y)−k(x)∣≤A2′∣y∣δ∣x∣−n−δ for ∣x∣≥2∣y∣>0, and the cancellation bound sup⁡0<r<R∣∫r<∣x∣<Rk(x) dx∣≤A3. Let W be a principal-value distribution for k and let T be the convolution operator with W, assumed L2-bounded with norm B and satisfying the off-support representation of Calderón–Zygmund kernels and their associated operators with kernel k. Then T has a unique extension to a bounded linear operator H1(Rn)→L1(Rn), and there is C=Cn,δ,N,φ with ∥Tf∥L1≤C(A1+A2′+A3+B)∥f∥H1(f∈H1). The extension agrees with the given L2 operator on L2∩H1, and for any fixed sequence δj↓0 realizing W in Calderón–Zygmund kernels and their associated operators, its values are lim⁡jTδjf almost everywhere. A full limit as ε↓0 requires the additional hypothesis that the defining principal-value integrals converge along all radii; sequence-based principal-value existence alone does not imply this.

Facts & Assumptions

Given: Countable Choice, a fixed sequence δj realizing W, n≥1, 0<δ≤1, the fixed H1 kernel φ and atomic order N, the kernel k, the principal-value distribution W, the operator T and the constants as in the statement.

[F1]

The Holder bound makes k continuous at each nonzero point: take y→0 with 2∣y∣≤∣x∣ in the stated difference bound. Thus k is Borel, and its size bound gives integrability on compact sets away from zero. Truncations: for f∈Lp, 1≤p<∞, and 0<ε<∞, Tεf(x)=∫∣y∣>εk(y)f(x−y)dy converges absolutely at every x; the maximal truncations obey the weak (1,1) bound ∣{T∗f>λ}∣≤Cn,δ(A1+A2′+A3+B)λ−1∥f∥1 for f∈L1 and the strong Lp bounds for 1<p<∞ (Maximal truncated singular integrals, Maximal truncations: weak (1,1) and strong Lp bounds, Standard Hölder kernels satisfy the Hörmander condition, Standard (Hölder) Calderón–Zygmund kernels).

[F2]

Fix a sequence δj↓0 realizing W. For g∈Cc∞, the definition of W applied to the Schwartz test g(x−⋅) gives Tδjg(x)→(W∗g)(x) at every x. This extends to a.e. sequential convergence for every f∈L1: for g approximating f in L1, the tail oscillation of (Tδjf) is at most 2T∗(f−g). For every η>0, [F1] therefore bounds the measure of the set where that oscillation exceeds η by 2Cη−1∥f−g∥1. Density (Complex finite-simple and smooth compact-support density for finite p) makes this zero. Taking a countable sequence of η shows that the scalar sequence is Cauchy, hence convergent, a.e. The same argument uses the strong L2 bound for f∈L2. On Cc∞, dominated convergence with majorant T∗g∈L2 gives Tδjg→Tg in L2; density and the uniform L2 bound of T∗ extend this to all L2. If the principal-value integrals converge along all radii on Schwartz tests, the identical oscillation argument over 0<ε<η gives the full a.e. limit. The measurable suprema can be reduced to rational radii by absolute convergence away from zero.

[F3]

Atomic characterisation: every f∈H1 has a representation f=∑jλjaj in S′ with (1,∞,0)-atoms aj and (λj)∈ℓ1; the series also converges in the H1 norm and one may choose ∑j∣λj∣≤Cn,N,φ∥f∥H1 (Atomic characterisation of real Hp for 0<p≤1). A (1,∞,0)-atom is supported in a cube Q, satisfies ∣a∣≤∣Q∣−1 and ∫a=0 (Hp atoms with a prescribed moment order).

[F4]

Complex L1 is complete under Countable Choice (Complex Lp completeness and almost-everywhere subsequences). Norm convergence implies convergence in measure (Convergence in Lp implies convergence in measure). A weak (1,1) difference estimate also gives convergence in measure directly, since ∣{∣uj−u∣>η}∣≤Cη−1∥fj−f∥1→0. Limits in measure are unique: {∣u−v∣>η} lies in the union of the two error sets at threshold η/2, whose measures tend to zero.

[F5]

Under Countable Choice, an L2-norm convergent sequence has a subsequence of representatives converging almost everywhere to a representative of its limit (Assuming Countable Choice, Lp-convergent sequences have almost-everywhere convergent subsequences).

[F6]

Tonelli's theorem permits interchanging the integrals of nonnegative measurable functions on sigma-finite product measure spaces (Tonelli's theorem for nonnegative measurable functions on a sigma-finite product).

[F7]

The Calderon-Zygmund kernel and operator conventions are those of Calderón–Zygmund kernels and their associated operators: conditions (1) and (2) are the annular size and Hormander conditions, and condition (3) is the off-support representation by the kernel.

[F9]

Under Countable Choice, a closed cube of side length L in Rn is Lebesgue measurable and has measure Ln: its volume is the product of its side lengths (A box in Rn with parameters ai≤bi is Lebesgue measurable of measure ∏i<n(bi−ai), whichever of its faces are included, Axis-parallel rectangles in Rm and their volume).

Proof technique: the near/far atom estimate, the a.e. sequential limit of the truncations, and summation over an atomic representation.

Proof

technique · direct
1.1F1F3F6F7F9givenalgebra

Atom estimate. Let a be a (1,∞,0)-atom supported in a cube Q of side length ℓ(Q) and centre cQ, and let Q† be the concentric cube of side length 2n ℓ(Q). Since a∈L2 and T is L2-bounded, Cauchy-Schwarz and [F9] give ∫Q†∣Ta∣≤∣Q†∣1/2∥Ta∥L2≤∣Q†∣1/2B∥a∥L2≤(2n)n/2B, using ∥a∥2≤∣Q∣−1/2. Outside Q†, for almost every x the off-support representation gives Ta(x)=∫Qk(x−y)a(y)dy, and the mean-zero property rewrites this as ∫Q[k(x−y)−k(x−cQ)]a(y)dy. For every y∈Q one has ∣y−cQ∣≤n ℓ(Q)/2, while x∉Q† implies ∣x−cQ∣≥n ℓ(Q); hence ∣x−cQ∣≥2∣y−cQ∣. The standard H"older bound and the H"ormander condition therefore give ∫(Q†)c∣Ta∣≤∫Q∣a(y)∣∫∣x−cQ∣≥2∣y−cQ∣∣k(x−y)−k(x−cQ)∣ dx dy≤A2∥a∥1≤Cn,δA2′, where A2≤Cn,δA2′ by [F1] and ∥a∥1≤1. Thus ∥Ta∥L1≤(2n)n/2B+Cn,δA2′.

1.2F1F2algebra

The almost-everywhere limit extension. Define T~f(x)=lim⁡jTδjf(x) for f∈L1, which exists almost everywhere by [F2]. Then ∣T~f∣≤T∗f pointwise, so T~ is linear on L1 (limits of linear expressions) and ∥T~f∥L1,∞≤Cn,δ(A1+A2′+A3+B)∥f∥1 by the weak (1,1) bound of [F1].

2.1step 1.1F2F3F5

Identification on atoms. Let a be a (1,∞,0)-atom, so a∈L1∩L2. By [F2], the truncations Tδja converge almost everywhere to T~a as j→∞. The L2 convergence in [F2] and the subsequence principle [F5] give a subsequence Tδjℓa→Ta almost everywhere. On the intersection of these two full-measure sets, this subsequence converges to both limits, so T~a=Ta almost everywhere. Step 1.1 therefore gives ∥T~a∥L1≤Cn,δ(A2′+B).

3.1step 1.2step 2.1F3F4algebra

Summation. Let f∈H1 and let f=∑jλjaj be the representation of [F3] with ∑j∣λj∣≤Cn,N,φ∥f∥H1. Since ∥aj∥L1≤1, the series converges absolutely in L1 to f, so f∈L1 and the partial sums gJ=∑j≤Jλjaj satisfy ∥f−gJ∥L1≤∑j>J∣λj∣→0. By step 1.2 and linearity, T~gJ=∑j≤JλjT~aj, and by the L1,∞ bound T~gJ→T~f in measure; on the other hand step 2.1 gives ∑j∣λj∣∥T~aj∥L1≤Cn,δ(A2′+B)∑j∣λj∣<∞, so T~gJ converges absolutely in L1. The L1 limit is also a limit in measure, so it equals T~f a.e., and ∥T~f∥L1≤∑j∣λj∣∥T~aj∥L1≤Cn,δ,N,φ(A2′+B)∥f∥H1≤C(A1+A2′+A3+B)∥f∥H1 after enlarging the constant.

4.1step 1.2step 3.1F2F3F4F5algebra

Agreement and uniqueness. Let f∈L2∩H1. By [F2], Tδjf→Tf in L2, so a subsequence converges almost everywhere to Tf; by [F2] the sequential limit lim⁡jTδjf=T~f exists almost everywhere, hence T~f=Tf a.e. Thus the bounded operator T~:H1→L1 extends the given L2 operator on the dense subspace L2∩H1 of H1 (dense because finite atomic sums lie there and approximate every H1 element in the H1 quasi-norm by [F3]). Any two bounded extensions with the same bound agree on the dense subspace and hence everywhere, so the extension is unique.

5.1step 1.1step 1.2step 2.1step 3.1step 4.1F8∎

Conclusion. Steps 1.1 and 1.2 give the atom estimate and construct the extension as the almost-everywhere sequential limit of the truncations, step 2.1 identifies it with T on atoms, step 3.1 bounds it on H1 by summation over the atomic representation, and step 4.1 proves agreement with the L2 operator and uniqueness. Countable Choice is used through the cited subsequence and atomic-representation results. This proves the theorem.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

Fourier transform decay of real Hp elements

Statement

Assume Countable Choice. Let n≥1, 0<p≤1, fix the admissible kernel φ defining Hp, and set s=⌊n(1/p−1)⌋. Fix an integer K≥n/p and the associated reproducing pair of the atomic decomposition, and an admissible grand-maximal order N≥max⁡{N0(n,p,φ),n+s+1}. There is C=C(n,p,N,K,φ)<∞ such that every f∈Hp(Rn) has a Fourier transform that is a continuous function on Rn∖{0} and satisfies ∣f^(ξ)∣≤C∥f∥Hp∣ξ∣n(1/p−1),ξ≠0, and moreover lim⁡ξ→0∣f^(ξ)∣∣ξ∣n(1/p−1)=0. Here f^ is the tempered-distribution Fourier transform (Fourier transform of a tempered distribution), identified with a continuous function off the origin by the estimate.

Facts & Assumptions

Given: Countable Choice, n≥1, 0<p≤1, the fixed kernel φ, reproducing order K and order N, s=⌊n(1/p−1)⌋, f∈Hp, and multi-indices as in Ck maps and multi-index derivative notation in Euclidean space.

[F1]

Atomic characterisation: f=∑jλjaj in S′ with (p,∞,s)-atoms aj and (λj)∈ℓp; the representation may be chosen with ∑j∣λj∣≤Cn,p,N,K,φ∥f∥Hp (Atomic characterisation of real Hp for 0<p≤1).

[F2]

For an L1 atom the distributional transform agrees with the integral transform: the absolute double integral against a Schwartz test χ is bounded by ∥a∥1∥χ∥1, so Fubini identifies ⟨a,χ^⟩ with ∫a^χ (Fubini's theorem for L^1 functions on a sigma-finite product). Fourier transform is continuous on S′: if gJ→g in S′ then gJ^→g^ in S′ (Fourier transform of a tempered distribution).

[F3]

For an atom a supported in a cube Q with centre cQ, ∥a∥L∞≤∣Q∣−1/p and moments vanishing through order s (Hp atoms with a prescribed moment order), the Taylor expansion of x↦e−2πix⋅ξ about cQ through order s gives ∣a^(ξ)∣≤Cmin⁡(∣Q∣1−1/p,∣ξ∣s+1∣Q∣1−1/p+(s+1)/n)(ξ≠0), with C=C(n,s): the first bound is ∥a∥1≤∥a∥∞∣Q∣≤∣Q∣1−1/p, and the second uses the vanishing moments, the Taylor remainder bound ∣∂βe−2πix⋅ξ∣≤(2π∣ξ∣)∣β∣ and ∫Q∣x−cQ∣s+1dx≤Cℓ(Q)s+1+n. Consequently ∣a^(ξ)∣≤C′∣ξ∣n(1/p−1) for ξ≠0 (split at ∣ξ∣ℓ(Q)≍1 and use s+1>n(1/p−1)) and ∣a^(ξ)∣/∣ξ∣n(1/p−1)→0 as ξ→0 for each fixed atom. [def-multidimensional-rectangle-and-volume, def-ck-and-multi-index-notation-in-several-variables, algebra]

Proof technique: the atomic representation, termwise Fourier transformation and dominated summation.

Proof

technique · direct
1.1F1F2F3algebra

Continuity and decay off the origin. Let f=∑jλjaj be the representation of [F1]. By [F2], f^=∑jλjaj^ in S′; since each aj^ is a continuous function (the atoms are integrable) and, by [F3], ∣λjaj^(ξ)∣≤C∣λj∣∣ξ∣n(1/p−1) for ξ≠0, the numerical series ∑jλjaj^ converges absolutely and locally uniformly on Rn∖{0}. Its sum is therefore a continuous function off the origin and agrees with f^ there as a distribution. There is no additional distribution supported at the origin: define the sum to be zero there. The uniform atom bound holds globally after this assignment, and ∣ξ∣n(1/p−1)∣χ(ξ)∣ is integrable for every Schwartz test χ. Dominated convergence therefore identifies the regular distribution of this sum with the distributional limit of the transformed partial sums on all of Rn; this identifies f^ with that continuous function on Rn∖{0} and gives ∣f^(ξ)∣≤C(∑j∣λj∣)∣ξ∣n(1/p−1)≤C′∥f∥Hp∣ξ∣n(1/p−1).

2.1step 1.1F1F3algebra

The little-o statement. Fix η>0. Choose J so large that C∑j>J∣λj∣<η/2, possible because (λj)∈ℓp⊆ℓ1; then by [F3] the tail satisfies ∑j>J∣λj∣∣aj^(ξ)∣≤(η/2)∣ξ∣n(1/p−1) for every ξ≠0. The finite sum ∑j≤Jλjaj^ is a finite combination of continuous functions each vanishing faster than ∣ξ∣n(1/p−1) at the origin, so there is δ>0 with ∣∑j≤Jλjaj^(ξ)∣<(η/2)∣ξ∣n(1/p−1) for 0<∣ξ∣<δ. Hence ∣f^(ξ)∣≤η∣ξ∣n(1/p−1) for 0<∣ξ∣<δ, which is the stated little-o relation since η>0 was arbitrary.

3.1step 1.1step 2.1∎

Conclusion. Steps 1.1 and 2.1 give the identification of f^ with a continuous function off the origin, the decay estimate and the little-o refinement. This proves the theorem.

CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

Weighted-integrable Hp functions have vanishing moments in the atomic range

Statement

Assume Countable Choice. Let n≥1, 0<p≤1 and s=⌊n(1/p−1)⌋. Suppose f∈Hp(Rn) is represented by a locally integrable function and assume additionally that xαf∈L1(Rn) for every multi-index ∣α∣≤s. Then ∫Rnf(x)xα dx=0(∣α∣≤s). In particular every compactly supported L1 function f∈H1 satisfies ∫Rnf=0, and no compactly supported integrable function of nonzero integral lies in H1.

Facts & Assumptions

Given: Countable Choice, n≥1, 0<p≤1, s=⌊n(1/p−1)⌋, f∈Hp∩Lloc1 with xαf∈L1 for ∣α∣≤s.

[F1]

Fourier decay: for the fixed kernel, reproducing order and grand-maximal order of the Fourier-decay theorem, every f∈Hp has f^ continuous on Rn∖{0} with ∣f^(ξ)∣≤Cn,p,N,K,φ∥f∥Hp∣ξ∣n(1/p−1) and f^(ξ)=o(∣ξ∣n(1/p−1)) as ξ→0 (Fourier transform decay of real Hp elements).

[F2]

If f∈L1 then f^ is bounded and uniformly continuous on Rn, and f^(ξ)=∫f(x)e−2πix⋅ξdx; if moreover xαf∈L1, then ∂αf^(ξ)=∫(−2πix)αf(x)e−2πix⋅ξdx, so ∂αf^(0)=(−2πi)∣α∣∫xαf (The L1 transform is bounded and uniformly continuous, Fourier differentiation and multiplication identities on tempered distributions).

[F3]

If m≥1, the Peano Taylor formula applies to every real Cm function near 0: g(h)=Tmg(0;h)+o(∣h∣m) (Multivariable Taylor formula with o(∥h∥k) remainder). For a complex-valued function, apply this to its real and imaginary parts and combine the two expansions.

[F4]

At p=1, Atomic characterisation of real Hp for 0<p≤1 gives f=∑jλjaj in S′ with ∑j∣λj∣<∞. The size/support conditions of Hp atoms with a prescribed moment order give ∥aj∥1≤1. Thus the partial sums converge in complex L1 by Complex Lp completeness and almost-everywhere subsequences, and their L1 limit has the same distributional limit since ∣⟨h,χ⟩∣≤∥h∥1∥χ∥∞. Injectivity of Locally integrable functions embed in distributions identifies it a.e. with the given locally integrable representative of f. Hence that representative belongs to L1.

Proof technique: the little-o Fourier decay against the Taylor expansion of f^ at the origin.

Proof

technique · direct
1.1F2given

Smoothness of f^ at the origin. For each coordinate, the exponential difference quotient is bounded by 2π∣xj∣, since ∣eiu−1∣≤∣u∣. Iterating dominated convergence with the assumed integrable functions ∣xαf∣ proves the derivative formula in [F2]; dominated convergence applied to each derivative integrand proves its continuity. Since xαf∈L1 for ∣α∣≤s, [F2] gives that f^ is s times continuously differentiable near the origin and that ∂αf^(0) is the Fourier transform of (−2πix)αf at the origin.

2.1F1F2F3step 1.1algebra

A nonvanishing lowest derivative contradicts the little-o decay. Suppose some ∂αf^(0)≠0 with ∣α∣≤s, and choose such an α of minimal total degree m. Put γ=n(1/p−1)≥0. If m=0, then f^(0)≠0; choose any unit vector η. Continuity from [F2] gives ∣f^(tη)∣≥∣f^(0)∣/2 for all sufficiently small t>0, contradicting [F1], which says f^(tη)=o(tγ) and hence tends to zero. If m≥1, every derivative of order below m vanishes. By [F2], f^ is Cm near 0, so [F3] applied to its real and imaginary parts gives, for fixed η∈Rn, f^(tη)=tmQ(η)+o(tm)(t↓0),Q(η)=∑∣β∣=m∂βf^(0)β!ηβ. This complex homogeneous polynomial is not identically zero, so choose a unit vector η with Q(η)≠0. Then ∣f^(tη)∣≥ctm for all sufficiently small t>0. Since m≤s=⌊γ⌋≤γ, one has tm≥tγ for 0<t≤1, contradicting [F1]. Thus every ∂αf^(0) with ∣α∣≤s vanishes.

3.1step 2.1F2algebra

Conclusion. By [F2], ∂αf^(0)=(−2πi)∣α∣∫xαf for every ∣α∣≤s; step 2.1 shows these derivatives all vanish, so ∫xαf=0 for ∣α∣≤s. For p=1 one has s=0, so the integral of f vanishes; applying this to a compactly supported L1 function f∈H1 gives ∫f=0, and a compactly supported L1 function with ∫f≠0 cannot be in H1.

4.1step 3.1F4given∎

Remark on the hypothesis. For p=1 every H1 function that is a locally integrable function automatically has f∈L1 by [F4], so the "compactly supported L1" formulation is a special case; for p<1 the hypothesis xαf∈L1 is a genuine additional assumption. This corollary proves the stated vanishing moments and no more.

5 · Examples, counterexamples and false statements

None yet.

Sources