Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-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.

Compactly supported Sobolev functions extend by zero in every integer order

Statement

Assume Countable Choice. Let Ω⊆Rn be open with n≥1, let k∈N0, 1≤p≤∞ and K∈{R,C}. Suppose u∈Wk,p(Ω;K) vanishes almost everywhere outside a compact set K0⊂Ω. Let E0u denote the extension of a representative of u by zero to Rn, and for ∣α∣≤k let E0(Dαu) denote the extension by zero of the corresponding derivative representative. Then E0u∈Wk,p(Rn;K),Dα(E0u)=E0(Dαu)almost everywhere, ∣α∣≤k, and every Lp component norm is preserved: ∥E0(Dαu)∥Lp(Rn)=∥Dαu∥Lp(Ω),∥E0u∥Lp(Rn)=∥u∥Lp(Ω), so that ∥E0u∥Wk,p(Rn)=∥u∥Wk,p(Ω). The case k=0 is included, and complex scalars are handled by the same bilinear pairing.

Facts & Assumptions

Given: Countable Choice; an open set Ω⊆Rn; k∈N0; 1≤p≤∞; K∈{R,C}; a class u∈Wk,p(Ω;K) with a representative that vanishes almost everywhere outside a compact K0⊂Ω; a multi-index α with ∣α∣≤k; and a test function φ∈Cc∞(Rn).

[F1]

A class u lies in Wk,p(Ω;K) exactly when u∈Lp(Ω;K) and, for every ∣α∣≤k, there is a class Dαu∈Lp(Ω;K) with a locally integrable representative satisfying the weak test identity on Ω; the norm is the derivative sum for finite p and the maximum of the essential bounds for p=∞ (Integer-order Sobolev spaces and their norms).

[F2]

The defining weak identity reads ∫Ωu Dαψ=(−1)∣α∣∫Ω(Dαu)ψ for every ψ∈Cc∞(Ω;K), with a bilinear pairing and no conjugation; any two locally integrable weak α-derivatives agree almost everywhere (Weak derivative of a locally integrable function, Uniqueness of a weak derivative as an almost-everywhere class).

[F3]

If V⊆Ω is open and v=Dαu weakly on Ω, then v∣V=Dα(u∣V) weakly on V; consequently, if u=0 almost everywhere on an open V⊆Ω, then Dαu=0 almost everywhere on V (Linearity, locality, and commutation of weak derivatives, Uniqueness of a weak derivative as an almost-everywhere class).

[F4]

For compact K0⊆Ω with Ω open there is χ∈Cc∞(Ω) with 0≤χ≤1 and χ=1 on an open neighbourhood U of K0; this cutoff exists in ZF (Test function cutoffs and euclidean localization).

[F5]

If a C∞ function vanishes identically on an open set, then all of its partial derivatives vanish there: along each coordinate direction the function is constant on a small interval, and induction on the order of differentiation gives the assertion.

[F6]

The integral over a measurable set is the integral of the product with its indicator, and a function that vanishes off Ω has the same integral over Rn as over Ω; this applies to ∣u∣p and to ∣Dαu∣p for finite p (Integral over a measurable subset, Complex Lp classes and Euclidean test-function conventions).

[F7]

Changing a locally integrable representative on a null set does not change a weak derivative class or an Lp class (Weak differentiation ignores null-set changes).

Choice use. The declared principle is Countable Choice, used through the locality and uniqueness interfaces of [F2]–[F3] and through the Sobolev well-definedness recorded in [F1]; the cutoff of [F4] is choice-free, and the computation below is otherwise explicit.

Proof

technique · direct
1.1F3F4given

Fix α with ∣α∣≤k and φ∈Cc∞(Rn), and choose χ as in [F4], with χ=1 on a neighbourhood U⊇K0. Since Ω∖K0 is open and u=0 almost everywhere on it, [F3] gives Dαu=0 almost everywhere on Ω∖K0; in particular u and Dαu vanish almost everywhere off K0.

2.1F1F2step 1.1

The function χφ lies in Cc∞(Ω;K), so the weak identity of [F2] on Ω applies to it: ∫Ωu Dα(χφ)=(−1)∣α∣∫Ω(Dαu) χφ.

3.1F5step 1.1step 2.1

Compare the left side of step 2.1 with ∫Ωu Dαφ. The difference is ∫Ωu Dα((χ−1)φ); the smooth function (χ−1)φ vanishes identically on the open set U, so by [F5] all its partial derivatives vanish on U⊇K0, while off K0 the factor u vanishes almost everywhere. Hence the integrand vanishes almost everywhere on Ω and ∫Ωu Dα(χφ)=∫Ωu Dαφ=∫Rn(E0u) Dαφ.

3.2F3step 1.1step 2.1

Compare the right side of step 2.1 with (−1)∣α∣∫Ω(Dαu)φ. The difference is (−1)∣α∣∫Ω(Dαu)(χ−1)φ; here (χ−1)φ vanishes on U and Dαu vanishes almost everywhere off K0, so the integrand vanishes almost everywhere. Therefore ∫Ω(Dαu) χφ=∫Ω(Dαu) φ=∫RnE0(Dαu) φ.

4.1F2step 3.1step 3.2

Steps 3.1 and 3.2 together with step 2.1 give ∫Rn(E0u) Dαφ=(−1)∣α∣∫RnE0(Dαu) φ for the arbitrary test φ∈Cc∞(Rn) fixed in step 1.1. Since φ was arbitrary, E0(Dαu) is a weak α-derivative of E0u on Rn, and it is the unique locally integrable class by [F2].

5.1F6step 4.1

Membership and norms. The extension E0u is measurable with ∣E0u∣=∣u∣ on Ω and E0u=0 off Ω; by [F6], for finite p, ∫Rn∣E0u∣p=∫Ω∣u∣p<∞, while for p=∞ the two essential suprema agree because the two functions agree almost everywhere on Ω and the extension vanishes off Ω. Thus E0u∈Lp(Rn;K) with equal norm, and the same computation applied to each E0(Dαu), ∣α∣≤k, gives E0(Dαu)∈Lp(Rn;K) with ∥E0(Dαu)∥Lp(Rn)=∥Dαu∥Lp(Ω).

6.1F1F7step 4.1step 5.1∎

By step 4.1 and step 5.1 the class E0u has, for every ∣α∣≤k, an Lp weak α-derivative on Rn; [F1] therefore gives E0u∈Wk,p(Rn;K) with Dα(E0u)=E0(Dαu) almost everywhere, and the norm formula of [F1] together with the component equalities of step 5.1 gives ∥E0u∥Wk,p(Rn)=∥u∥Wk,p(Ω). Changing representatives on null sets changes nothing by [F7]; k=0 is the case of the single multi-index α=0; complex scalars use the same bilinear pairing componentwise.

Depends on

Used by

Dependency tree · two levels

41 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