Alphabeta Math
TheoremStatement: 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.

Meyers–Serrin density on an arbitrary open set

Statement

Assume Countable Choice. Let Ω⊆Rn be open with n≥1, let k∈N0, 1≤p<∞ and K∈{R,C}. Then the intersection C∞(Ω;K)∩Wk,p(Ω;K) is dense in Wk,p(Ω;K): for every u∈Wk,p(Ω;K) and every δ>0 there is a function v∈C∞(Ω;K) with v∈Wk,p(Ω;K) and ∥v−u∥Wk,p(Ω)<δ. No regularity of ∂Ω and no extension of u beyond Ω is assumed. The exponent p=∞ is excluded, as the companion remark records.

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); and a tolerance δ>0.

[F1]

Compact exhaustion. Every nonempty open Ω⊆Rn admits compact sets K1⊆K2⊆⋯ with Kj⊂int⁡Kj+1 and ⋃jKj=Ω; the sets Kj={x∈Ω:∣x∣≤j, dist⁡(x,Rn∖Ω)≥1/j} are closed and bounded, hence compact, and satisfy these inclusions (elementary closed-and-bounded compactness in Rn; the sets may be enlarged by finite unions, and for bounded Ω the radius clause is inactive for large j; when Ω=Rn, interpret the distance to the empty complement as +∞).

[F2]

Smooth cutoffs: for compact K⊆Ω with Ω open there is χ∈Cc∞(Ω) with 0≤χ≤1 and χ=1 on a neighbourhood of K; this uses no choice (Test function cutoffs and euclidean localization).

[F3]

Local smooth approximation: for every open U⊂⊂Ω, uε→u in Wk,p(U;K) as ε→0+, where uε is the interior mollification of u; in particular, for any θ>0 there is ε>0 with ∥uε−u∥Wk,p(U)<θ (Local smooth approximation in integer-order Sobolev spaces).

[F4]

Smooth-factor Leibniz rule: for η∈Cc∞(Ω;K) and u∈Wk,p(Ω;K) one has ηu∈Wk,p(Ω;K) with the Leibniz formula for Dα(ηu), ∣α∣≤k (Weak Leibniz rule with a smooth factor).

[F5]

Classical smooth compactly supported functions have their classical derivatives as weak derivatives, hence lie in Wk,p(Ω;K) (Classical derivatives agree with weak derivatives).

[F6]

Norm and linearity: the Wk,p norm of Integer-order Sobolev spaces and their norms is well defined and definite on classes (The Sobolev norm descends to equivalence classes), weak differentiation is linear on classes (Linearity, locality, and commutation of weak derivatives), and ∥S∥Wk,pp=∑∣α∣≤k∥DαS∥Lpp for 1≤p<∞.

[F7]

Fatou's lemma: for nonnegative measurable functions gJ, ∫lim inf⁡JgJ≤lim inf⁡J∫gJ (Fatou's lemma).

[F8]

Mollification on a compactly supported piece stays compactly supported: if ηu is supported in a compact set M⊂Ω and ε<dist⁡(M,Rn∖Ω), then the mollification ρε∗(ηu) (zero extension outside Ω) is supported in the closed ε-neighbourhood of M, which is a compact subset of Ω (Local smooth approximation in integer-order Sobolev spaces).

Choice use. Countable Choice selects the exhaustion cutoffs of [F2] and the dyadic mollification radii below; the published weak, Lp and mollification interfaces of [F3]–[F6] also declare it. All selections are countable and can be made by a least-index rule.

Proof

technique · direct
1.1F1F2given

Fix the compact exhaustion Kj of [F1] and, using [F2] and Countable Choice, cutoffs ψj∈Cc∞(Ω) with 0≤ψj≤1, ψj=1 on a neighbourhood of Kj and supp⁡ψj⊂int⁡Kj+1; set χj:=1−∏i≤j(1−ψi) and η1:=χ1, ηj:=χj−χj−1 for j≥2. Then each ηj∈Cc∞(Ω) is nonnegative with 0≤ηj≤1, satisfies supp⁡ηj⊂int⁡Kj+1 and ηj=0 on a neighbourhood of Kj−1, the supports are locally finite, and ∑jηj=1 on Ω; hence ∑jηju=u as a locally finite sum of classes. The empty case Ω=∅ is trivial because the only class is 0, so assume Ω≠∅.

2.1F3F4F8step 1.1

For each j, [F4] gives ηju∈Wk,p(Ω;K), supported in the compact set supp⁡ηj⊂int⁡Kj+1; using [F3] on the open set Uj:=int⁡Kj+1⊂⊂Ω and [F8] to keep the support inside Ω, choose εj>0 so small that vj:=ρεj∗(ηju) is a smooth function compactly supported in Uj and ∥vj−ηju∥Wk,p(Ω)=∥vj−ηju∥Wk,p(Uj)<δ 2−j−1. For j≥2, also take εj<12dist⁡(supp⁡ηj,Kj−1)>0; then vj vanishes near Kj−1, so the mollified pieces remain locally finite.

3.1F4F5step 1.1step 2.1

Define v:=∑jvj and ej:=vj−ηju. Since the vj have locally finite supports, v is a locally finite sum of smooth compactly supported functions on Ω, hence v∈C∞(Ω;K); and v−u=∑j(vj−ηju)=∑jej as a locally finite sum, with each ej∈Wk,p(Ω;K) and ∥ej∥Wk,p(Ω)<δ2−j−1 by step 2.1.

4.1F6step 2.1step 3.1

For every ∣α∣≤k one has Dα(v−u)=∑jDαej as locally integrable classes: near any point of Ω only finitely many ηj, hence only finitely many ej, are nonzero, and on that neighbourhood the identity follows from the linearity and locality of weak differentiation applied to the finite sum; the identity therefore holds as an Llocp(Ω) identity.

5.1F6F7step 2.1step 4.1

Let SJ:=∑j≤Jej, so that DαSJ→Dα(v−u) pointwise for every ∣α∣≤k by the local finiteness of step 4.1. Fatou's lemma applied to the nonnegative functions gJ:=∑∣α∣≤k∣DαSJ∣p gives ∫Ω∑∣α∣≤k∣Dα(v−u)∣p≤lim inf⁡J→∞∫ΩgJ=lim inf⁡J→∞∥SJ∥Wk,p(Ω)p≤(∑j=1∞∥ej∥Wk,p(Ω))p<δp, where the middle equality is the norm formula of [F6] and the last inequality is the triangle inequality for the norm together with ∑j∥ej∥Wk,p<∑jδ2−j−1≤δ.

6.1F6step 3.1step 5.1given∎

By step 5.1, ∥v−u∥Wk,p(Ω)<δ; by step 3.1, v∈C∞(Ω;K); and v=(v−u)+u∈Wk,p(Ω;K) because v−u and u both are. Since u∈Wk,p(Ω;K) and δ>0 were arbitrary, C∞(Ω;K)∩Wk,p(Ω;K) is dense.

Depends on

Used by

Dependency tree · two levels

37 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