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.

Local smooth approximation in integer-order Sobolev spaces

Statement

Assume Countable Choice. Let Ω⊆Rn be open with n≥1, let k∈N0, 1≤p<∞ and K∈{R,C}, and let u∈Wk,p(Ω;K). Fix a nonnegative ρ∈Cc∞(Rn) of unit mass with supp⁡ρ⊆B‾1(0), put ρε(x)=ε−nρ(x/ε), and define the interior mollification uε(x)=(ρε∗u~)(x)=∫Rnu~(y) ρε(x−y) dy, where u~ is a representative of u extended by zero to Rn. Then uε→u in Wk,p(U;K) for every open U⊂⊂Ω; equivalently uε→u in Wlock,p(Ω;K). The exponent p=1 is included, and no assertion about density or convergence in the Wk,∞ norm is made.

Facts & Assumptions

Given: Countable Choice; an open set Ω⊆Rn with n≥1; k∈N0; 1≤p<∞; K∈{R,C}; a class u∈Wk,p(Ω;K); a nonnegative unit-mass ρ∈Cc∞(Rn) with support in B‾1(0); and an open set U⊂⊂Ω, so that U‾ is a compact subset of Ω.

[F1]

Interior mollification commutes with weak derivatives: with Ωε={x∈Ω:dist⁡(x,Rn∖Ω)>ε} and Dαu extended by zero, one has Dαuε=ρε∗(Dαu) on Ωε for every ∣α∣≤k, and uε is smooth there (Interior mollification commutes with weak derivatives).

[F2]

The family ρε is the mollifier family generated by the unit-mass bump ρ (The mollifier family generated by a unit-mass smooth bump).

[F3]

Approximate identity convergence: the family (ρε) is an L1 approximate identity (A unit-mass smooth bump generates an L1 approximate identity); if f∈Lp(Rn) and 1≤p<∞, then ∥f∗ρε−f∥Lp(Rn)→0 as ε→0+ (Every L1 approximate identity converges to the identity in Lp for 1≤p<∞), and the same holds for complex-valued f with the complex convolution conventions, including the case of a complex scalar field (Complex translation, convolution, approximate identities, and mollification).

[F4]

For w∈Lp(Ω;K) the extension by zero E0w lies in Lp(Rn;K) with ∥E0w∥Lp(Rn)=∥w∥Lp(Ω), because the integral over a measurable set is the integral of the indicator product (Integral over a measurable subset, Complex Lp classes and Euclidean test-function conventions).

[F5]

The Wk,p norm is the ℓp sum of the Lp norms of all derivative classes Dαu with ∣α∣≤k; for p=∞ it is the maximum of the essential bounds (Integer-order Sobolev spaces and their norms).

[F6]

Compact containment: U‾⊆Ω compact with Ω open implies d:=dist⁡(U‾,Rn∖Ω)>0, and for 0<ε<d every x∈U satisfies dist⁡(x,Rn∖Ω)≥d>ε, i.e. U⊆Ωε; Here distance to the empty set is +∞, including when U=∅ or Ω=Rn; the containment still holds. This is elementary metric topology and uses no choice.

Choice use. Countable Choice is used through the approximate-identity and mollification interfaces of [F1] and [F3]; the compact-containment constant of [F6] is explicit and choice-free.

Proof

technique · direct
1.1F4F6given

Fix U⊂⊂Ω and put d:=dist⁡(U‾,Rn∖Ω)>0 as in [F6]; then U⊆Ωε for every 0<ε<d. Also, for each ∣α∣≤k the zero extension E0(Dαu) belongs to Lp(Rn;K) with ∥E0(Dαu)∥Lp(Rn)=∥Dαu∥Lp(Ω) by [F4], since Dαu∈Lp(Ω;K).

2.1F1step 1.1

By [F1], for every 0<ε<d and every ∣α∣≤k the identity Dαuε=ρε∗(E0Dαu)on U holds as an identity of smooth functions, since U⊆Ωε.

3.1F2F3step 1.1step 2.1

For each ∣α∣≤k the right-hand side of step 2.1 converges to E0Dαu in Lp(Rn;K): by [F2] and [F3] applied to the Lp class f=E0Dαu, ∥ρε∗f−f∥Lp(Rn)→0 as ε→0+. Hence ∥Dαuε−Dαu∥Lp(U)≤∥ρε∗(E0Dαu)−E0Dαu∥Lp(Rn)⟶0.

4.1F3F5step 3.1given∎

Summing the finitely many convergences of step 3.1 over ∣α∣≤k, the norm formula of [F5] gives ∥uε−u∥Wk,p(U)→0; since U⊂⊂Ω was arbitrary, this is convergence in Wlock,p(Ω). The proof uses p<∞ exactly through the approximate-identity convergence in step 3.1, makes no claim for p=∞, and the case k=0 is the single multi-index α=0, namely convergence in Llocp.

Depends on

Used by

Dependency tree · two levels

59 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