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.

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.

Depends on

Used by

Dependency tree · two levels

91 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