Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedprecheck passjudge pass (gpt-6.1-sol)audited 2026-10-02
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.

Sobolev extension domains and extension operators

Definition

Assume Countable Choice. Fix k∈N0, 1≤p≤∞, an open set Ω⊆Rn with n≥1, and K∈{R,C}.

Restriction. Let F∈Wk,p(Rn;K) and let α∈N0n with ∣α∣≤k. By the restriction and locality clause of Linearity, locality, and commutation of weak derivatives, applied with V=Ω, the class F∣Ω lies in Wk,p(Ω;K) and Dα(F∣Ω)=(DαF)∣Ω almost everywhere on Ω; by the uniqueness of weak derivatives the derivative class of the restriction is determined by the class of F alone. So restriction is a well-defined operation on Sobolev classes, and the norm formula of Integer-order Sobolev spaces and their norms gives ∥F∣Ω∥Wk,p(Ω)≤∥F∥Wk,p(Rn), since each restricted derivative has no larger Lp norm.

Extension domain. For fixed k,p,Ω and scalar field K, call Ω a Wk,p-extension domain if there is a bounded linear operator E:Wk,p(Ω;K)⟶Wk,p(Rn;K) such that, for every u∈Wk,p(Ω;K), (Eu)∣Ω=uas an almost-everywhere class on Ω. Equivalently, the restriction map in the first paragraph possesses a bounded linear right inverse. Boundedness of E is the finiteness of the operator norm ∥E∥=sup⁡{∥Eu∥Wk,p(Rn):u∈Wk,p(Ω;K),∥u∥Wk,p(Ω)≤1}; the displayed right-inverse identity is an identity of Lp(Ω) classes, not of pointwise values.

The operator, and the numerical bound ∥E∥, may depend on k, p, Ω and K. This definition asserts no common operator for all indices at once, no linearity of some canonically selected extension, and no control of pointwise values on ∂Ω; in particular it does not define a trace operator. No claim is made here that zero extension is an extension operator for a general open set, and none that any particular open set fails to be an extension domain; both assertions belong to later items of this page and to its companion.

Source notes

Kinnunen, Definition 3.42, printed p. 84, introduces the extension domain and the bounded right inverse of the restriction map; Theorem 3.43 there transfers whole-space Sobolev inequalities through such an operator. Laugesen, Theorem 3.12, printed pp. 60–62, constructs such an operator for bounded C1 graph domains and finite p, and Corollary 3.13 extends the first-order result to p=∞ by direct local bounds.

Depends on

Used by

Dependency tree · two levels

20 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