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 for . Assuming countable choice, , and consequently , is dense in Euclidean Lebesgue for and the same finite exponents. The closure of complex consists exactly of classes with a complex representative. Neither assertion claims density of finite-measure-supported tests or smooth functions in all of .
Facts & Assumptions
Given: A complex class , an error tolerance , and for the finite-p assertions; countable choice for smooth Euclidean density.
Component projections contract the norm and recombination has norm at most the sum of component norms (Complex Holder, Minkowski, and the quotient norm).
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 for ).
Under countable choice real smooth compactly supported functions are dense in Euclidean finite-p spaces ( is dense in for ).
The real essential-norm closure of Cc is precisely the classes represented by C0 (The -closure of is , not all of ).
Countable choice is the explicit additional hypothesis for the real smooth-density supplier (The Axiom of Countable Choice ()).
Proof
By F1, . F2 supplies real simple with and , each with finite-measure nonzero set. The finite intersections of their fibers form a finite measurable partition on which is constant, and has finite measure. F1 gives . This uses only two approximation choices for the specified tolerance, not a simultaneous choice function.
In Euclidean Lebesgue space, under the countable-choice hypothesis F5, apply F3 to with errors to obtain . Their sum is smooth componentwise and is supported in the union of the two compact supports, hence is complex . F1 again bounds its error by . The inclusion proves continuous compact-support density as well.
If a complex L-infinity class is in the closure of complex , approximating to any positive tolerance and projecting its approximants gives, by F1, real approximations to both component classes. F4 therefore supplies representing them. The complex function represents and vanishes at infinity: outside the union of two compact sets where the separate component errors are below , its modulus is below .
Conversely, if has a representative , F4 supplies real approximants to with essential-norm errors below . Their complex sum lies in 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.
Depends on
- Complex Holder, Minkowski, and the quotient norm
- Simple functions with finite-measure support are dense in $L^p(\mu)$ for $1 \le p < \infty$
- $C_c^\infty(\mathbb{R}^n)$ is dense in $L^p(\mathbb{R}^n)$ for $1 \le p < \infty$
- The $L^\infty$-closure of $C_c(\mathbb{R}^n)$ is $C_0(\mathbb{R}^n)$, not all of $L^\infty(\mathbb{R}^n)$
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
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
- Gerald Teschl, Topics in Real and Functional Analysis (standard reference, not scraped)