Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-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.

Dyadic Mihlin pieces sum to an off-support kernel representation

Statement

Assume Countable Choice (The Axiom of Countable Choice (ACω)). In the setting of Dyadic Mihlin pieces: uniform L1 and first-difference bounds — m a Mihlin symbol with constants Cα (Mihlin smoothness convention above half the dimension), ζ the annulus cutoff with ∑j∈Zζ(2−jξ)=1 for ξ≠0, mj=m ζ(2−j⋅), Kj=F−1(umj) — the following hold, with W:=m∨ and A≥max⁡{∥m∥∞,max⁡∣α∣≤n0Cα}:

  1. ∑∣j∣≤NKj→W in S′(Rn) as N→∞;
  2. the series ∑j∈ZKj(x) converges for almost every x∈Rn∖{0} to a function k that coincides with W on Rn∖{0}; and
  3. that function k satisfies the annular size bound sup⁡δ>0∫δ≤∣x∣≤2δ∣k(x)∣ dx≤CnA and Hörmander's condition sup⁡y≠0∫∣x∣≥2∣y∣∣k(x−y)−k(x)∣ dx≤CnA.

Facts & Assumptions

Given: Countable Choice; the Mihlin symbol m with constants Cα and q=n0=⌊n/2⌋+1; the cutoff ζ and the pieces mj,Kj; a finite A≥max⁡{∥m∥∞,max⁡∣α∣≤n0Cα}; a scale δ>0; a dyadic integer k and a vector y≠0.

[F1]

S′ is endowed with the pairing ⟨u,φ⟩; the Fourier transform F is a linear automorphism of S′ with inverse F−1, and F maps S into S; and for every ψ∈S the regular distribution umj of the L1 function mj satisfies ⟨umj,ψ⟩=∫mjψ. Hence ⟨Kj,φ⟩=⟨F−1umj,φ⟩=⟨umj,F−1φ⟩=∫mj(ξ) (F−1φ)(ξ) dξ for φ∈S (Fourier transform of a tempered distribution).

[F2]

m agrees with a Cn0 function off the origin, ∣m∣≤∥m∥∞≤A almost everywhere, and the cutoff ζ is nonnegative, supported in 1/2≤∣ξ∣≤2, bounded by 1, with ∑j∈Zζ(2−jξ)=1 for ξ≠0; consequently ∑∣j∣≤Nmj(ξ)=m(ξ)∑∣j∣≤Nζ(2−jξ)→m(ξ) for every ξ≠0, with ∣∑∣j∣≤Nmj∣≤∥m∥∞ (Mihlin smoothness convention above half the dimension, Dyadic Mihlin pieces: uniform L1 and first-difference bounds).

[F3]

sup⁡j∫∣Kj(x)∣(1+2j∣x∣)1/4dx≤CnA and sup⁡j2−j∫∣∇Kj(x)∣(1+2j∣x∣)1/4dx≤CnA (Dyadic Mihlin pieces: uniform L1 and first-difference bounds).

[F4]

Dominated convergence permits passage to an almost-everywhere limit under an integrable majorant, and Tonelli permits interchange of nonnegative sums and integrals on the sigma-finite Euclidean product. (Dominated convergence, Tonelli's theorem for nonnegative measurable functions on a sigma-finite product)

Proof

technique · direct
1.1F1F2F4algebra

Transposition of the inverse Schwartz transform is the inverse distribution transform: composing either way tests against FF−1φ=φ. Thus the inverse in [F1] uses F−1 on tests. The partial sums converge in S′: for φ∈S, using [F1] and [F2], ⟨∑∣j∣≤NKj,φ⟩=∫Rn(∑∣j∣≤Nmj(ξ))(F−1φ)(ξ) dξ⟶∫Rnm(ξ)(F−1φ)(ξ) dξ=⟨W,φ⟩, by dominated convergence with majorant ∥m∥∞∣F−1φ∣∈L1 and pointwise convergence ∑∣j∣≤Nmj(ξ)=m(ξ)∑∣j∣≤Nζ(2−jξ)→m(ξ) for ξ≠0; the limit pairing is ⟨m∨,φ⟩=⟨W,φ⟩.

1.2F2F3givenalgebra

Two elementary estimates. First, from Kj(x)=∫mj(ξ)e2πix⋅ξdξ, which is absolutely convergent because mj is supported in the annulus 2j−1≤∣ξ∣≤2j+1 and bounded by ∥m∥∞, one has the pointwise bound ∣Kj(x)∣≤2jnCζA for every j and every x. Second, for every δ>0 and j>0, [F3] gives ∫∣x∣≥δ∣Kj(x)∣ dx≤CnA(1+2jδ)−1/4, so ∑j>0∫∣x∣≥δ∣Kj∣ is finite for every fixed δ>0, and for j≤0 the pointwise bound gives ∫δ≤∣x∣≤2δ∣Kj∣≤2jnCζA ∣B(0,2δ)∣≤CnAδn2jn, whose sum over j≤0 is at most CnAδn, finite for every fixed δ.

2.1F4step 1.2algebra

Almost everywhere convergence. By step 1.2, ∑j≤0∣Kj(x)∣<∞ for every x; for each fixed δ>0, ∑j>0∫∣x∣≥δ∣Kj∣<∞ implies ∑j>0∣Kj(x)∣<∞ for almost every x with ∣x∣≥δ. Taking the union of the exceptional sets over δ=1/m, m≥1, the series ∑j∈ZKj(x) converges absolutely for almost every x∈Rn∖{0}; denote its sum by k(x), a measurable function on Rn∖{0}.

3.1F4step 1.1step 1.2step 2.1algebra

On every compact K⊂Rn∖{0} the dominating function ∑j∣Kj∣ is integrable: K lies in some annulus δ≤∣x∣≤2mδ, and the two estimates of step 1.2 (the second applied after covering the outer annulus by finitely many dyadic annuli of the same type) give ∫K∑j∣Kj∣<∞. Hence for φ∈Cc∞(Rn∖{0}), dominated convergence with the partial sums bounded by ∑j∣Kj∣ gives ⟨W,φ⟩=lim⁡N⟨∑∣j∣≤NKj,φ⟩=∫kφ by step 1.1, so k coincides with W on Rn∖{0}.

3.2F3step 1.2step 2.1algebra

Annular size bound. Fix δ>0. Split ∑j∫δ≤∣x∣≤2δ∣Kj∣ according to whether 2jδ>1. For 2jδ≤1 the pointwise bound of step 1.2 gives ∫δ≤∣x∣≤2δ∣Kj∣≤2jnCζA∣B(0,2δ)∣, so the sum over these j is at most CnAδn∑2j≤1/δ2jn≤CnA. For 2jδ>1, ∫δ≤∣x∣≤2δ∣Kj∣≤(2jδ)−1/4∫∣Kj∣(1+2j∣x∣)1/4≤CnA(2jδ)−1/4 by [F3], Put j0=min⁡{j∈Z:2jδ>1}, so 1<2j0δ≤2 by minimality. The high-frequency sum is therefore bounded by CnA∑j≥j0(2jδ)−1/4=CnA(2j0δ)−1/4/(1−2−1/4)≤CnA/(1−2−1/4), independent of δ. Hence ∫δ≤∣x∣≤2δ∣k∣≤∑j∫δ≤∣x∣≤2δ∣Kj∣≤CnA, uniformly in δ.

3.3F3step 1.2step 2.1algebra

Hörmander's condition. Fix y≠0 and choose k∈Z with 2−k≤∣y∣≤21−k. For j>k the triangle inequality and [F3] give ∫∣x∣≥2∣y∣∣Kj(x−y)−Kj(x)∣ dx≤2∫∣x∣≥∣y∣∣Kj(x)∣ dx≤2CnA(1+2j∣y∣)−1/4, and summing over j>k yields at most CnA, since 2j∣y∣≥2j−k. For j≤k, the mean value theorem and translation of the integral give ∫∣x∣≥2∣y∣∣Kj(x−y)−Kj(x)∣ dx≤∣y∣∫Rn∣∇Kj(u)∣ du≤CnA∣y∣2j by [F3]. Hence the sum over j≤k is bounded by CnA∣y∣∑j≤k2j=2CnA∣y∣2k≤4CnA, using the upper dyadic inequality ∣y∣≤21−k. Summing in j yields the asserted Hörmander bound, uniformly in y≠0.

4.1step 1.1step 3.1step 3.2step 3.3∎

Steps 1.1, 3.1, 3.2 and 3.3 are the four assertions: S′ convergence, the a.e. convergent series defining k, its coincidence with W off the origin, and the two kernel bounds with constant CnA.

Depends on

Used by

Dependency tree · two levels

40 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