Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generated
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.

Restriction Bessel-potential spaces on polyhedral domains

Definition

Assume Countable Choice. Let s≥0 and let D⊂Rd be a nonempty open set. Use Hs(Rd) with the Bessel-potential completion convention of Real-order Bessel-potential completion H^s. Realize this completion in L2(Rd) by the canonical injection ιsU:=F2−1(⟨ξ⟩−sJsU), where Js:Hs(Rd)→L2(Rd) is the weighted Fourier isometry of The Bessel completion embeds canonically in tempered distributions and F2 is the unitary transform of Plancherel theorem. Since s≥0, multiplication by ⟨ξ⟩−s is bounded on L2 with norm at most one and is injective. Hence ιs is linear, injective, and satisfies ∥ιsU∥2≤∥U∥Hs; it sends each canonical Schwartz class to that function's almost-everywhere class. Equivalently, for a Cauchy representative [uj], ιs[uj]=lim⁡juj in L2, because u^j=⟨ξ⟩−sJsuj converges in L2 and F2−1 is continuous. Identify U with this L2 class, and write U∣D:=(ιsU)∣D. Define the restriction space Hs(D):={U∣D:U∈Hs(Rd)},∥u∥Hs(D):=inf⁡{∥U∥Hs(Rd):U∣D=u a.e. on D}. Two extensions represent the same element exactly when their restrictions agree almost everywhere on D. This is the convention for fractional-order spaces on the polyhedral domain and its affine simplex cells used in the Nitsche items on this page. No C1 boundary or trace theorem is part of this definition.

Depends on

Used by

Dependency tree · two levels

26 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