Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-09-01
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.

Cc(Rn) is dense in Lp(Rn) for 1p<

Statement

Assume the Axiom of Countable Choice.

Let 1p<. Then Cc(Rn) is dense in Lp(Rn).

Facts & Assumptions

Given: The Axiom of Countable Choice, 1p<, ε>0, and fLp(Rn).

[L1]

Cc(Rn) is dense in Lp(Rn) (Cc(Rn) is dense in Lp(Rn) for 1p<).

[L2]

Mollifier families are L1 approximate identities, and convolution with a mollifier is smooth (A unit-mass smooth bump generates an L1 approximate identity, Convolution with a mollifier is smooth, and derivatives pass under the integral sign).

[L3]

Approximate identities converge in Lp, and for bounded continuous functions the convergence is uniform on compacta (Every L1 approximate identity converges to the identity in Lp for 1p<, L1 approximate identities converge uniformly on compacta for bounded continuous functions).

[L4]

The support of a convolution lies in the closure of the support sumset (The support of a convolution lies in the closure of the support sumset).

Proof

technique · direct
1.1

By [L1], choose gCc(Rn) with fgp<ε/2. [L1, L2, given, choose] Let (φδ) be a mollifier family as in [L2].

L1L2givenchoose
2.1

By [L3], choose δ>0 so small that [L2, L3, L4, step 1.1, choose] gφδgp<ε/2. The function gφδ is smooth by [L2]. Because g has compact support and φδ has compact support, [L4] gives compact support for gφδ, so gφδCc(Rn).

L2L3L4step 1.1choose
3.1

Therefore [step 1.1, step 2.1, algebra] fgφδpfgp+ggφδp<ε. Hence Cc(Rn) is dense in Lp(Rn).

step 1.1step 2.1algebra

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

25 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