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.
C_c(X) is dense in L^p(mu) for a Radon measure
Statement
Assume Dependent Choice (The axiom of dependent choice: a relation in which every element is related to something admits an -indexed chain). If is a Radon measure on an LCH space and , then is dense in .
Facts & Assumptions
Given: DC, is Radon and .
Finite-measure-support simple functions are dense in . (Simple functions with finite-measure support are dense in for )
Under the stated DC premise, LCH cutoffs exist between compact and open sets (LCH Urysohn cutoff). Proof 2.1 is the exact use of DC.
Proof
It suffices by [L1] to approximate when . [L1, choose] Given , outer regularity gives open with , and inner regularity of gives compact with .
Choose with by [L2]. [step 1.1, L2] Then Since both indicators take only the values zero and one and their union is , while , the error is bounded by the indicator of that union. Hence Thus .
Approximate the finitely many indicator terms of a simple function separately and sum the resulting functions. Then use [L1] and the triangle inequality.