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.
Zero set ultrafilters and Stone-Cech points
Statement
Assume the Axiom of Choice (The Axiom of Choice), so that the ultrafilter lemma and Dependent Choice are available. Let be a Tychonoff space (Completely regular spaces and Tychonoff () spaces) and let be its Stone–Čech compactification as supplied by the evaluation theorem (Under the ultrafilter lemma and dependent choice, the closure of the full evaluation image is the Stone–Čech compactification); identify with . Then the map
is a bijection from onto the set of z-ultrafilters on (Zero set filter and zero set ultrafilter).
Facts & Assumptions
Given: The Axiom of Choice, a Tychonoff space , its Stone–Čech compactification with embedding , and the family of zero sets of continuous real functions on .
is closed under finite intersections, , and , ; z-filters and z-ultrafilters are as defined in Zero set filter and zero set ultrafilter (Completely regular spaces and Tychonoff () spaces for Tychonoffness).
is a compact Hausdorff space, is an embedding with dense image, and every continuous has a unique continuous extension ; the compactification is realised as the closure of in a cube, so points of are separated by the coordinate functions (Under the ultrafilter lemma and dependent choice, the closure of the full evaluation image is the Stone–Čech compactification, The Axiom of Choice).
A family of closed subsets of a compact space has nonempty intersection whenever every finite subfamily has nonempty intersection: otherwise the complements form an open cover and a finite subcover exhibits a finite subfamily with empty intersection.
If and , then . If vanishes on , define
Each is continuous: away from the common zero this is a quotient of continuous functions, while at a common zero . Moreover , is -valued, and vanishes on . This is the decomposition used in [step 3.1]. [algebra]
Proof
For define for ; then and is additive, positively homogeneous, multiplicative and lattice-preserving: for and real with again -valued, , , and ; more generally every polynomial identity with nonnegative coefficients valid on passes to .
If is a net in with in , then for every : this is continuity of at together with .
Characterisation of closure points. For one has if and only if for every with . If choose a net with and use [step 1.2]. Conversely, if take a basic neighbourhood of in the cube with and put ; then by [step 1.1], while for every , since means .
For , the family is a z-filter: it contains because is dense in ; it omits because and vanishes on ; it is upward closed because implies ; and it is closed under finite intersections: if with for , take vanishing on and write with vanishing on , respectively , by the construction of [L4]; then by [step 2.1] and by [step 1.1], so by [step 2.1] again.
Injectivity. For and real one has whenever : for a net with one has by [step 1.2], so eventually . Conversely, if then : with one has by [step 1.1] and vanishes on , so [step 2.1] applies. Hence depends only on , and since the coordinates over determine the point of the cube by [L2], the equality forces .
For the z-filter is maximal. Let be a z-filter and let with ; if , then and [step 2.1] provides vanishing on with ; the zero set is disjoint from , because on makes there, and belongs to , because for any net with one has by [step 1.2], so eventually , that is, , whence ; but then give , contradicting that is a z-filter. Hence , and is a z-ultrafilter.
Surjectivity. Let be a z-ultrafilter. The family consists of closed subsets of the compact space and has the finite intersection property, because the intersection of finitely many such closures contains with nonempty; by [L3] there is in the intersection, so for every , that is, ; both are z-filters and is maximal, so by [step 4.1].
By [step 4.1] every is a z-ultrafilter, by [step 5.1] the map is surjective, and by [step 3.2] it is injective; hence it is a bijection onto the set of z-ultrafilters.
Remarks
- The functional is the bridge. It is multiplicative even though a point of the cube is not a multiplicative functional on all of by definition; multiplicativity is obtained from [step 1.2], because all coordinates converge along a single net converging to .
- No new choice principle is hidden. The single point selected in [step 5.1] comes from the nonemptiness of one intersection, not from a family of nonempty sets; the extension of functions to is inherited from the Stone–Čech universal property, whose assumptions (ultrafilter lemma and Dependent Choice) are declared.
Depends on
- Zero set filter and zero set ultrafilter
- Under the ultrafilter lemma and dependent choice, the closure of the full evaluation image is the Stone–Čech compactification
- Completely regular spaces and Tychonoff ($T_{3\frac{1}{2}}$) spaces
- Urysohn's lemma, under the axiom of dependent choice: in a normal space two disjoint closed sets are separated by a continuous function into $[0,1]$, and conversely such a space is normal
- The Axiom of Choice
- AC supplies the countable and dependent choices used in Banach integration
Used by
Dependency tree · two levels
34 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.