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.
The uniform closure of a real function algebra is a vector lattice
Statement
Let be a compact Hausdorff space and let be a real function algebra, not necessarily unital. Let consist of the continuous functions that can be approximated uniformly by members of . Then is a real function algebra and a real vector sublattice of .
Facts & Assumptions
Given: A compact Hausdorff space , a real function algebra , and its uniform closure .
For , every continuous real function on is a uniform limit of polynomials (Polynomials are uniformly dense in for every closed interval).
If for every a function has a continuous approximant with for every , then is continuous (A uniform limit of continuous functions is continuous, so is closed in under the uniform metric, clause 1).
If is compact and nonempty and is continuous, then has a maximum and a minimum (A continuous image of a compact space is compact; a continuous real-valued map on a nonempty compact space attains a maximum and a minimum; and a continuous bijection from a compact space to a Hausdorff space is a homeomorphism, clause 2).
A real function algebra is a real vector subspace of closed under pointwise multiplication (Unital, point-separating, and nowhere-vanishing real function algebras on a compact Hausdorff space).
Proof
If , then consists of the unique empty function, which is the zero element of the vector subspace ; hence and the claim is immediate.
Assume . By the definition of uniform closure, every has, for every positive error, a continuous approximant from , so [L2] confirms that all such uniform limits remain continuous.
The set is a real vector subspace: approximants to and add to an approximant to , scalar multiples approximate scalar multiples, and the zero function belongs to .
The set is closed under multiplication. Indeed, for , [L3] gives finite bounds and . Given , choose with Then and pointwise. Thus products of members of again lie in .
Fix and . By [L3], has a maximum ; if then and .
If , apply [L1] on to choose a polynomial with there, and put . Then , on , and steps 1.3 and 2.1 give . Hence is uniformly approximable by members of , and therefore belongs to the closed set . Together with the case in step 2.2, this proves for every .
For , the pointwise identities and , together with steps 1.3 and 3.1, put both functions in ; hence is a real vector sublattice.
Depends on
- Unital, point-separating, and nowhere-vanishing real function algebras on a compact Hausdorff space
- Polynomials are uniformly dense in $C([a,b],\mathbb R)$ for every closed interval
- A uniform limit of continuous functions is continuous, so $C(X,Y)$ is closed in $Y^{X}$ under the uniform metric
- A continuous image of a compact space is compact; a continuous real-valued map on a nonempty compact space attains a maximum and a minimum; and a continuous bijection from a compact space to a Hausdorff space is a homeomorphism
Used by
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 114 results over 17 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.
Sources
- J. M. Erdman, A Companion to Real Analysis, Proposition 21.2.4 (standard reference, not scraped)
- M. Xu, Math 205B notes from a course by R. Mazzeo (Stanford), Lemma 9.5 (standard reference, not scraped)
- E. Carlen, Notes on Topology and the Stone-Weierstrass Theorem, Lemma 1.28 (standard reference, not scraped)