Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck pass
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

The 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.

Depends on

Used by

Dependency tree · two levels

16 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources