Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-generatedjudge pass (gpt-6-sol)audited 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 Bessel-potential completion H^s

Definition

Assume Countable Choice (The Axiom of Countable Choice (ACω)). For n≥1 and s∈R, define Hs(Rn) to be the normed-space completion of S(Rn) with the positive-definite norm qs(u)=∥⟨ξ⟩su^∥2 from Weighted Fourier candidate norm on Schwartz space and The weighted Fourier seminorm separates Schwartz functions.

Concretely, its elements are equivalence classes [uj] of norm-Cauchy sequences (uj)j∈N in Schwartz space, where (uj)∼(vj) exactly when lim⁡j→∞qs(uj−vj)=0. The metric completion carries the unique compatible Banach-space structure supplied by Completion of a normed space and The metric completion of a normed space carries a unique compatible Banach-space structure; its norm is ∥[uj]∥Hs=lim⁡jqs(uj). The constant-sequence map u↦[(u,u,…)] is the canonical dense linear isometry from Schwartz space. At this definition stage Hs is an abstract completion; no identification with a subset of S′(Rn) is implicit.

The only choice assumption is Countable Choice, used by the cited metric completion theorem in its countable-sequence construction and completeness argument. No full Axiom of Choice or dependent choice is assumed.

Depends on

Used by

Dependency tree · two levels

23 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