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

Depends on

Used by

Dependency tree · two levels

29 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