Alphabeta Math
LemmaStatement: AI-adaptedProof: 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.

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.

Depends on

Used by

Dependency tree · two levels

22 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