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

Smooth functions are dense in finite-order Sobolev spaces on a reference simplex

Statement

Assume Countable Choice. Let d≥2, k∈N0, 1≤p<∞, and let S^d be the reference simplex. Then restrictions of functions smooth on a neighbourhood of S^d‾ are dense in Wk,p(S^d) in its Sobolev norm. No density assertion for p=∞ is made.

Facts & Assumptions

Given: The affine reference simplex and Sobolev conventions of Matching affine simplicial meshes and shape regularity and Integer-order Sobolev spaces and their norms, with finite p and Countable Choice.

[F1]

For an invertible affine map F(x)=Ax+b, weak derivatives obey Dj(u∘F)=∑iAij(Diu)∘F; higher derivatives follow by iterating this constant-matrix rule, with the corresponding determinant norm factors. For a homothety with A=tI, this gives Dα(u∘F)=t∣α∣(Dαu)∘F. (Affine pullback of weak derivatives and Sobolev seminorms)

[F2]

For finite p, Cc∞(Rd) is dense in Wk,p(Rd); in particular its order-zero case gives density in Lp(Rd). (Compactly supported smooth functions are dense in W^{k,p}(R^n))

[F3]

Smooth cutoffs equal to one near a compact subset of an open set exist; multiplication by a smooth function with bounded derivatives preserves Wk,p; and a compactly supported Wk,p function on an open set extends by zero to Rd. (Test function cutoffs and euclidean localization, Weak Leibniz rule with a smooth factor, Compactly supported Sobolev functions extend by zero in every integer order)

[F4]

Countable Choice is the explicit assumption in the cited Sobolev, weak-derivative and density interfaces. (The Axiom of Countable Choice (ACω))

Proof

1.1F1givenalgebra

Let a be the barycenter of S^d and, for 0<t<1, set Ft(x)=a+t(x−a). The set St:=Ft−1(S^d) is open and contains S^d‾: each point of the closure is carried to a strict convex combination of that point and the interior point a, which lies in the open simplex. Thus ut:=u∘Ft is defined on St for u∈Wk,p(S^d), and [F1] gives Dαut=t∣α∣(Dαu)∘Ft.

2.1F1F2step 1.1given

For every g∈Lp(S^d), g∘Ft→g in Lp(S^d) as t↑1. To see this, extend g by zero to Rd and approximate that extension in Lp by ϕ∈Cc∞(Rd) using [F2]. For t≥1/2, change of variables bounds the pullback error by t−d/p∥g−ϕ∥Lp(Rd)≤2d/p∥g−ϕ∥p; for fixed ϕ, uniform continuity on the compact closure gives ϕ∘Ft→ϕ uniformly there. First choosing ϕ with arbitrarily small error and then taking t↑1 proves the claim. Applying it to each of the finitely many Dαu and using [F1] shows ut∣S^d→u in Wk,p(S^d).

2.2F2F3step 1.1

Fix t<1. Since S^d‾ is compactly contained in St, choose η∈Cc∞(St) equal to one near that closure by [F3]. Then ηut∈Wk,p(St) has compact support in St, so its zero extension Ut belongs to Wk,p(Rd) by [F3]. By [F2], choose ϕj∈Cc∞(Rd) converging to Ut in that norm. Since Ut=ut on a neighbourhood of the closed simplex, the restrictions ϕj∣S^d converge to ut∣S^d in Wk,p(S^d).

3.1F4step 2.1step 2.2algebra∎

Given ε>0, choose t close enough to one that ∥ut−u∥Wk,p(S^d)<ε/2 by step 2.1, and then choose j in step 2.2 with ∥ϕj−ut∥Wk,p(S^d)<ε/2. The triangle inequality gives ∥ϕj−u∥Wk,p(S^d)<ε. The choices are finite for each u,ε; Countable Choice is only the declared background of [F4], and no p=∞ density is used.

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