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

Ambient smooth restrictions are dense on bounded C^k domains

Statement

Assume the Axiom of Choice. Let k≥1, 1≤p<∞, K∈{R,C}, and let Ω⊂Rn be a bounded Ck domain in the graph sense of Bounded C^k domains and boundary charts. Then the set of restrictions to Ω of functions in Cc∞(Rn;K) is dense in Wk,p(Ω;K): for every u∈Wk,p(Ω;K) and every δ>0 there is φ∈Cc∞(Rn;K) with ∥φ∣Ω−u∥Wk,p(Ω)<δ.

The exponent range is 1≤p<∞; the result asserts no density in the Wk,∞ norm, and it does not hold on arbitrary open sets, as the companion examples page shows.

Facts & Assumptions

Given: the Axiom of Choice; k≥1; 1≤p<∞; K∈{R,C}; a bounded Ck domain Ω⊂Rn; and a class u∈Wk,p(Ω;K).

[F1]

Extension: for every open V with Ω‾⊆V there is a bounded linear extension operator E:Wk,p(Ω;K)→Wk,p(Rn;K) with (Eu)∣Ω=u almost everywhere and supp⁡(Eu) a compact subset of V, for the given k≥1 and 1≤p<∞ (Bounded C^k domains admit integer-order Sobolev extension).

[F2]

Smooth bumps: for 0<r<R there is a smooth η:Rn→[0,1] equal to one on B‾r(0) with supp⁡η⊆BR(0) (A smooth bump between concentric Euclidean balls).

[F3]

Interior commutation: for u∈Wk,p(Ω;K), a nonnegative unit-mass ρ∈Cc∞(Rn) with supp⁡ρ⊆B‾1(0), and ρε(x)=ε−nρ(x/ε), the convolution ρε∗u is defined and smooth on Ωε={x∈Ω:dist⁡(x,Rn∖Ω)>ε}, which equals Rn when Ω=Rn, and Dα(ρε∗u)=ρε∗(Dαu) there for every ∣α∣≤k, as almost-everywhere classes (Interior mollification commutes with weak derivatives).

[F4]

The family ρε generated by a smooth unit-mass ρ with supp⁡ρ⊆B‾1(0) is an L1 approximate identity (A unit-mass smooth bump generates an L1 approximate identity).

[F5]

Real convergence: an L1 approximate identity (Kε) on Rn satisfies ∥f∗Kε−f∥p→0 for 1≤p<∞ and f∈Lp(Rn) (Every L1 approximate identity converges to the identity in Lp for 1≤p<∞).

[F6]

Complex interface: for complex K∈L1(Rn;C) and f∈Lp, ∥K∗f∥p≤∥K∥1∥f∥p, and if ∫Kε=1, sup⁡ε>0∥Kε∥1<∞ and ∫∣y∣≥δ∣Kε∣→0 for every δ>0, then Kε∗f→f in Lp for p<∞; the rescalings ε−nK(x/ε) of a unit-mass K∈L1 have these properties (Complex translation, convolution, approximate identities, and mollification).

[F7]

Restriction is a contraction: for open U⊆Ω, restriction defines a contraction Wk,p(Ω;K)→Wk,p(U;K) (Bounded restriction and cutoff localisation in Sobolev spaces).

[F8]

Sobolev norm: for 1≤p<∞, ∥w∥Wk,p(U)=(∑∣α∣≤k∥Dαw∥Lp(U)p)1/p (Integer-order Sobolev spaces and their norms).

Choice use. The assumed Axiom of Choice supplies the hypotheses of the extension interface [F1] in step 1.1 and the restriction interface [F7] in step 5.1. It also implies the Countable Choice assumed by [F3]–[F6], [F8] and the bounded Ck-domain definition. Fixing one bump from [F2] and normalising it in step 1.2 requires no further choice.

Proof

technique · direct
1.1F1given

Fix u∈Wk,p(Ω;K). Since Ω is bounded, choose a bounded open V with Ω‾⊆V, and let E be the extension operator supplied by [F1] for this V; put F:=Eu∈Wk,p(Rn;K). Then F∣Ω=u almost everywhere on Ω and supp⁡F is a compact subset of V.

1.2F2given

Let η be a bump as in [F2] with r=1/2, R=1, so that η=1 on B‾1/2(0) and supp⁡η⊆B1(0); then 0<∫Rnη<∞ and ρ:=η/∫η is nonnegative, of class Cc∞(Rn), of unit mass, with supp⁡ρ⊆B1(0)⊆B‾1(0). Put ρε(x)=ε−nρ(x/ε) for ε>0, so ρε is nonnegative with ∫ρε=1 and supp⁡ρε⊆B‾ε(0).

2.1F3step 1.1step 1.2

For every multi-index α with ∣α∣≤k, the class DαF∈Lp(Rn;K) exists, and the commutation clause of [F3] applied with Ω=Rn (so that Ωε=Rn for every ε) gives Dα(ρε∗F)=ρε∗(DαF) as almost-everywhere classes on Rn.

2.2F3step 1.1step 1.2

For each ε>0 the convolution vε:=ρε∗F is of class C∞ on Rn by the smoothness clause of [F3], and supp⁡vε⊆supp⁡F+supp⁡ρε⊆supp⁡F+B‾ε(0) is compact, first because the support of a convolution is contained in the sum of the supports and then because supp⁡F is compact; hence vε∈Cc∞(Rn;K) and its restriction is an admissible approximant.

3.1F4F5F6step 2.1

For each α with ∣α∣≤k, ∥ρε∗(DαF)−DαF∥Lp(Rn)→0 as ε→0+: for K=R this is the real convergence of [F5] applied to the L1 approximate identity of [F4] and the class DαF∈Lp; for K=C the complex interface of [F6] applies to DαF directly, a real class being a complex class.

4.1F8step 2.1step 3.1

By the norm formula of [F8] and step 3.1, the smooth convolutions converge in the whole-space Sobolev norm: ∥ρε∗F−F∥Wk,p(Rn)p=∑∣α∣≤k∥ρε∗(DαF)−DαF∥Lp(Rn)p→0.

5.1F7step 1.1step 4.1step 2.2

By the restriction contraction [F7] applied to vε−F∈Wk,p(Rn;K) and the identity F∣Ω=u of step 1.1, ∥vε∣Ω−u∥Wk,p(Ω)≤∥vε−F∥Wk,p(Rn), which tends to zero by step 4.1; given δ>0 choose ε>0 with ∥vε∣Ω−u∥Wk,p(Ω)<δ.

6.1F5F6step 5.1given∎

Therefore the restrictions of Cc∞(Rn;K) functions are dense in Wk,p(Ω;K) for 1≤p<∞, while nothing is asserted at p=∞: the convergence inputs [F5] and [F6] are stated for finite exponents only, and step 3.1 fails for the essential-supremum norm.

Depends on

Used by

Dependency tree · two levels

65 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