Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-09
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.

Complex finite-simple and smooth compact-support density for finite p

Statement

On every measure space, complex finite simple functions with finite-measure nonzero sets are dense in Lp(μ;C) for 1p<. Assuming countable choice, Cc(Rn;C), and consequently Cc(Rn;C), is dense in Euclidean Lebesgue Lp for n1 and the same finite exponents. The L closure of complex Cc consists exactly of classes with a complex C0 representative. Neither assertion claims density of finite-measure-supported tests or smooth functions in all of L.

Facts & Assumptions

Given: A complex class f=u+iv, an error tolerance η>0, and 1p< for the finite-p assertions; countable choice for smooth Euclidean density.

[F1]

Component projections contract the norm and recombination has norm at most the sum of component norms (Complex Holder, Minkowski, and the quotient norm).

[F2]

On arbitrary measure spaces real finite simple functions of finite-measure support are dense for finite p (Simple functions with finite-measure support are dense in Lp(μ) for 1p<).

[F3]

Under countable choice real smooth compactly supported functions are dense in Euclidean finite-p spaces (Cc(Rn) is dense in Lp(Rn) for 1p<).

[F4]

The real essential-norm closure of Cc is precisely the classes represented by C0 (The L-closure of Cc(Rn) is C0(Rn), not all of L(Rn)).

[F5]

Countable choice is the explicit additional hypothesis for the real smooth-density supplier (The Axiom of Countable Choice (ACω)).

Proof

technique · Approximate each real component and prove both directions of the endpoint closure
1.1

By F1, u,vLp(μ;R). F2 supplies real simple a,b with uap<η/2 and vbp<η/2, each with finite-measure nonzero set. The finite intersections of their fibers form a finite measurable partition on which s=a+ib is constant, and {s0}{a0}{b0} has finite measure. F1 gives fsp<η. This uses only two approximation choices for the specified tolerance, not a simultaneous choice function.

F1F2given
1.2

In Euclidean Lebesgue space, under the countable-choice hypothesis F5, apply F3 to u,v with errors η/2 to obtain a,bCc(Rn;R). Their sum a+ib is smooth componentwise and is supported in the union of the two compact supports, hence is complex Cc. F1 again bounds its error by η. The inclusion CcCc proves continuous compact-support density as well.

F1F3F5
1.3

If a complex L-infinity class f is in the closure of complex Cc, approximating f to any positive tolerance and projecting its approximants gives, by F1, real Cc approximations to both component classes. F4 therefore supplies U,VC0(Rn;R) representing them. The complex function U+iV represents f and vanishes at infinity: outside the union of two compact sets where the separate component errors are below η/2, its modulus is below η.

F1F4
2.1

Conversely, if f has a C0 representative U+iV, F4 supplies real Cc approximants to U,V with essential-norm errors below η/2. Their complex sum lies in Cc and has error below η by F1. Thus precisely the stated classes form the closure. The constant-one class is excluded: any continuous representative equal to one a.e. must equal one everywhere, since a nonzero continuous discrepancy persists on an open ball of positive Lebesgue measure; that constant does not vanish at infinity. The finite-p assertions therefore have no such infinity extension.

F1F4step 1.3

Depends on

Used by

Dependency tree · two levels

33 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