Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passaudited 2026-09-30
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.

Real-order H^s as weighted Fourier distributions

Statement

Assume Countable Choice, let n≥1 and s∈R, and let Hs(Rn) be the real-order Bessel-potential completion of Real-order Bessel-potential completion H^s with its canonical embedding Es:Hs(Rn)→S′(Rn) (The Bessel completion embeds canonically in tempered distributions). Write ⟨ξ⟩=(1+∣ξ∣2)1/2 for the Japanese bracket, F for the negative-sign 2π-normalized Fourier transform, and ug(ϕ)=∫Rng(ξ)ϕ(ξ) dξ for the regular tempered distribution of g∈Lloc1(Rn). Define Ws={u∈S′(Rn):⟨ξ⟩sFu=ug in S′(Rn) for some g∈L2(Rn)}. Then:

  1. The canonical embedding restricts to a bijection Es:Hs(Rn)→Ws. Thus, after identifying a completion class with its image under Es, Hs(Rn) is exactly the set of tempered distributions whose bracket-weighted Fourier transform is the regular distribution of an L2 class, and that class g is unique.
  2. The norm identity is exact: ∥U∥Hs=∥g∥2=∥⟨ξ⟩sF(EsU)∥2(U∈Hs), where the last expression means the L2 norm of the unique density g of the distributional product ⟨ξ⟩sF(EsU), and the defining completion norm qs(ϕ)=∥⟨ξ⟩sϕ^∥2 of Real-order Bessel-potential completion H^s is not renormalized.
  3. The product ⟨ξ⟩sFu is distributional multiplication of Fu by the smooth polynomially bounded bracket weight, not an a priori pointwise product; and Hs elements are completion classes, not initially assumed to be functions.

Nothing here replaces the bracket weight by the Laplacian weight (1+4π2∣ξ∣2)s/2, and no pointwise value of g at an individual frequency is asserted before g is obtained from the defining condition.

Facts & Assumptions

Given: Countable Choice, n≥1, s∈R, the Japanese bracket ⟨ξ⟩≥1, and the canonical embedding Es:Hs(Rn)→S′(Rn).

[A1]

Countable Choice permits one selection from each nonempty set in a countable family (The Axiom of Countable Choice (ACω)).

[F1]

For every n≥1 and s∈R, with Ms={u∈S′(Rn):⟨ξ⟩sFu=ug in S′(Rn) for some g∈L2(Rn)}, the canonical embedding Es restricts to a bijection Es:Hs(Rn)→Ms; the class g is unique; and if u=EsU corresponds to g, then ∥U∥Hs=∥g∥2. The product is multiplication of a tempered distribution by the smooth bracket multiplier (Weighted tempered-distribution characterization of H^s).

[F2]

Hs(Rn) is the normed-space completion of S in the positive-definite norm qs(ϕ)=∥⟨ξ⟩sϕ^∥2: its elements are Cauchy-sequence classes [uj] modulo zero limiting distance, ∥[uj]∥Hs=lim⁡jqs(uj), and the constant-sequence map is the canonical dense linear isometry (Real-order Bessel-potential completion H^s).

[F3]

Weighted Fourier transformation extends to a surjective linear isometry Js:Hs(Rn)→L2(Rn), Js([uj])=lim⁡j⟨ξ⟩sF(uj), and Es([uj])=F−1(u⟨ξ⟩−sJs[uj]) defines a well-defined continuous linear injection that is independent of the representing Cauchy sequence (The Bessel completion embeds canonically in tempered distributions).

[F4]

For real s the multipliers ⟨ξ⟩s and ⟨ξ⟩−s act continuously and invertibly on S′(Rn) by transposition, so ⟨ξ⟩sFu is defined for every tempered distribution u (Real powers of the Japanese bracket act on Schwartz space).

[F5]

Multiplication of a tempered distribution by a smooth polynomially bounded symbol a is ⟨au,φ⟩=⟨u,aφ⟩; with the regular distribution ⟨uh,φ⟩=∫hφ of a locally integrable h (Regular distribution from a locally integrable function) the same display with u=uh gives a uh=uah; the bracket weights ⟨ξ⟩±s are such symbols (Smooth polynomially bounded multipliers on schwartz space).

Proof

technique · unfold the two definitions of the same weighted set and transfer the batch-12 bijection, uniqueness and isometry
1.1F1F4given

The set displayed in the statement is exactly the set Ms of [F1]: both consist of the tempered u for which ⟨ξ⟩sFu=ug for some g∈L2, with the same convention that the product is the distributional multiplication of [F4]; hence Ws=Ms as subsets of S′(Rn).

2.1F1F3F5step 1.1

For U∈Hs put g:=JsU∈L2 and u:=EsU. By [F3] and [F1] one has Fu=u⟨ξ⟩−sg, and h:=⟨ξ⟩−sg is locally integrable, so [F5] applied with the smooth symbol a=⟨ξ⟩s gives ⟨ξ⟩sFu=⟨ξ⟩su⟨ξ⟩−sg=u⟨ξ⟩s⟨ξ⟩−sg=ug. Hence the unique L2 class attached to u by [F1] is g itself, and the batch-12 norm identity gives ∥U∥Hs=∥g∥2=∥⟨ξ⟩sF(EsU)∥2, the last norm being that of the density g of the product.

3.1F2step 2.1

The case s=0 is the instance ⟨ξ⟩0=1: the defining condition becomes Fu=ug for some g∈L2, the norm identity reads ∥U∥H0=∥F(E0U)∥2, and the completion norm is q0(ϕ)=∥ϕ^∥2 by [F2]. Nothing in steps 1.1 and 2.1 divides by a vanishing weight or degenerates; the instance is included in the general claims.

4.1F1F4step 1.1step 2.1step 3.1

The bijection. By [F1] the map Es:Hs→Ms is a bijection, and by step 1.1 Ms=Ws; hence the canonical embedding restricts to the bijection Es:Hs→Ws, and uniqueness of the class g is part of [F1]. Reading Es as the canonical identification, Hs consists exactly of the tempered distributions whose bracket-weighted Fourier transform is a regular L2 distribution, with the exact norm of statement 2. In particular no element of Hs is assumed to be a function, and the product is the distributional multiplication of [F4] rather than a pointwise product.

5.1A1F1F2F3step 1.1step 2.1step 3.1step 4.1∎

Conclusion. Step 4.1 gives the set identity, the canonical bijection and uniqueness; step 2.1 gives the exact norm; step 3.1 covers s=0; and step 1.1 records the distributional-product convention. This proves statements 1-3 for arbitrary n≥1 and s∈R. Countable Choice is used exactly through the completion, embedding and characterization interfaces [F1]-[F3], which carry it as their hypothesis.

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