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.
On a finite compact Hausdorff space a unital separating algebra contains every scalar-valued function
Example
Let be a finite compact Hausdorff space and let be either or . If is a unital point-separating -function algebra, then Thus on a finite Hausdorff space uniform approximation strengthens to exact interpolation. In the complex case no self-adjointness hypothesis is needed.
Facts & Assumptions
Given: A finite compact Hausdorff space , a scalar field , and a unital point-separating -function algebra .
A real function algebra is a real vector subspace closed under pointwise multiplication; unitality supplies all constants and point separation supplies a member distinguishing each distinct pair (Unital, point-separating, and nowhere-vanishing real function algebras on a compact Hausdorff space).
A complex function algebra is a complex vector subspace closed under pointwise multiplication, with the same literal unitality and point-separation clauses; self-adjointness is a separate condition (Self-adjoint complex function algebras, unitality, and point separation).
Every natural-number-indexed list of nonempty sets has a choice function on its family of values, and this finite choice uses no form of the Axiom of Choice (Every natural-number-indexed list of nonempty sets has a choice function on its family of values).
In this library, a finite family is empty or has an explicit finite listing; in particular, a finite space is listable (Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right, finiteness convention).
In a Hausdorff space, any two distinct points have disjoint open neighbourhoods (Hausdorff space: distinct points have disjoint open neighbourhoods; every metrizable space is Hausdorff and the indiscrete topology on two points is not).
Verification
If , then has only the empty function, which is the zero element of . If , every function is constant, so unitality gives .
Assume has at least two points and use [L4] to list its points. For a fixed , [L5] supplies, for each listed , a nonempty set of open neighbourhoods of missing ; [L3] chooses one from each member of this finite list. Their intersection is the open singleton . Hence every singleton is open and every function is continuous.
For every ordered pair , point separation in [L1] or [L2] gives with ; by [L3] and the finite listing in [L4], choose these over the finite list of ordered pairs and define . Then and .
For each , the finite product belongs to , equals at , and equals at every other point because the factor indexed by that point vanishes.
For any function , the finite sum belongs to and agrees with at every point. By step 1.2 every such is continuous, so .
Depends on
- Unital, point-separating, and nowhere-vanishing real function algebras on a compact Hausdorff space
- Self-adjoint complex function algebras, unitality, and point separation
- Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right
- Hausdorff space: distinct points have disjoint open neighbourhoods; every metrizable space is Hausdorff and the indiscrete topology on two points is not
- Every natural-number-indexed list of nonempty sets has a choice function on its family of values
Used by
Nothing in the library uses this result yet.
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 95 results over 18 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.