Alphabeta Math
RemarkRemark: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-6.1-sol)
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.

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.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

75 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