Alphabeta Math
DefinitionDefinition: AI-generatedProof: Not applicable
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.

Complex integer-order Sobolev notation

Definition

Assume Countable Choice: every sequence of nonempty sets has a choice function. Let D⊆Rn be open, with n≥1, and let k be a nonnegative integer. All functions below are complex-valued and identified when equal almost everywhere. For 1≤p≤∞, Wk,p(D;C) is the space of Lp classes whose weak derivatives Dαu of every multi-index α∈N0n with ∣α∣≤k belong to Lp(D;C). A weak derivative is defined by integration against smooth compactly supported test functions, with the usual factor (−1)∣α∣; D0u=u.

Write Hk(D)=Wk,2(D;C), with norm ∥u∥Hk(D)=(∑∣α∣≤k∥Dαu∥L2(D)2)1/2. Write Wk,∞(D) for Wk,∞(D;C), equipped with ∥u∥Wk,∞(D)=max⁡∣α∣≤k∥Dαu∥L∞(D). In particular, the order-zero derivative requires u itself to be essentially bounded.

Let Cc∞(D;C) denote the complex-valued smooth functions on D whose supports are compact subsets of D. Define H0k(D)=W0k,2(D;C) as their closure in the Hk(D) norm: u∈H0k(D) exactly when, for every ε>0, there is φ∈Cc∞(D;C) with ∥u−φ∥Hk(D)<ε. This definition asserts no trace characterization.

Justification

The complex Sobolev supplier defines the derivative classes and displayed finite-sum and maximum conventions under Countable Choice; the assumption is used in its representative-independence and weak-derivative uniqueness interface. The Sobolev norm descends to equivalence classes establishes that these expressions are norms on the classes. Zero-boundary Sobolev space as a norm closure supplies the inclusion of the test functions in the Sobolev space and the resulting metric closure, so the stated approximation condition defines a subset without requiring boundary traces.

Remarks

Fractional or negative ordinary Sobolev spaces, Dirichlet spectral spaces, identifications between domains, norm equivalences and trace characterizations require separate statements.

Depends on

Used by · 28

Dependency tree · 2 levels

Each result is drawn at its shortest distance from this item. Arrows run from prerequisites to the items that use them; this item has a heavier outline. External source nodes link directly to the cited text. The view shows up to two dependency steps; open a prerequisite to continue.