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.
Real Stone–Weierstrass theorem for compact Hausdorff spaces
Statement
Let be a compact Hausdorff space. Every unital point-separating real function algebra is uniformly dense in .
Facts & Assumptions
Given: A compact Hausdorff space and a unital point-separating real function algebra .
The uniform closure of a real function algebra on a compact Hausdorff space is itself a real function algebra and a real vector sublattice of (The uniform closure of a real function algebra is a vector lattice).
On a compact Hausdorff space, a unital point-separating real vector sublattice of contains, for every and every , a member within of at every point; that is, it is uniformly dense (Lattice Stone–Weierstrass theorem on a compact Hausdorff space).
Proof
If , then contains only the empty function, which is a constant function and therefore belongs to the unital algebra ; thus .
Assume and let be the uniform closure. By [L1], is a real vector sublattice and a real function algebra; it is unital and point-separating because it contains .
By [L2], the vector sublattice is dense in , while by definition is closed; hence , which says exactly that is uniformly dense.
Depends on
Used by
- The polynomial algebra is dense but not closed on a nondegenerate compact interval Example
- A closed unital real function algebra is C(Y,ℝ) on its indistinguishability quotient Theorem
- A separating real function algebra is dense or its closure consists exactly of the functions vanishing at one point Theorem
- Brownian positive occupation time has the arcsine law Theorem
Dependency tree · two levels
9 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
- J. M. Erdman, A Companion to Real Analysis, Theorem 21.2.6 (standard reference, not scraped)
- M. Xu, Math 205B notes from a course by R. Mazzeo (Stanford), Theorem 9.3 (standard reference, not scraped)
- E. Carlen, Notes on Topology and the Stone-Weierstrass Theorem, Theorem 1.26 (standard reference, not scraped)