Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-22
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 X be a Tychonoff space (Completely regular spaces and Tychonoff (T312) spaces) and let (βX,e) 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 X with e[X]⊆βX. Then the map

p  ⟼  Up:={ Z∈Z(X):p∈Z‾ βX }

is a bijection from βX onto the set of z-ultrafilters on X (Zero set filter and zero set ultrafilter).

Facts & Assumptions

Given: The Axiom of Choice, a Tychonoff space X, its Stone–Čech compactification βX with embedding e, and the family Z(X) of zero sets of continuous real functions on X.

[L1]

Z(X) is closed under finite intersections, Z(f)∩Z(g)=Z(f2+g2), and X=Z(0), ∅=Z(1); z-filters and z-ultrafilters are as defined in Zero set filter and zero set ultrafilter (Completely regular spaces and Tychonoff (T312) spaces for Tychonoffness).

[L2]

βX is a compact Hausdorff space, e:X→βX is an embedding with dense image, and every continuous u:X→[0,1] has a unique continuous extension uˉ:βX→[0,1]; the compactification is realised as the closure of X in a cube, so points of βX are separated by the coordinate functions uˉ (Under the ultrafilter lemma and dependent choice, the closure of the full evaluation image is the Stone–Čech compactification, The Axiom of Choice).

[L3]

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.

[L4]

If Zi=Z(fi) and f~i:=min⁡(1,∣fi∣)∈C(X,[0,1]), then Z(f~i)=Zi. If u∈C(X,[0,1]) vanishes on Z1∩Z2, define

ui=u f~if~1+f~2off Z1∩Z2,ui=0on Z1∩Z2.

Each ui is continuous: away from the common zero this is a quotient of continuous functions, while at a common zero ∣ui∣≤∣u∣→0. Moreover u1+u2=u, ui is [0,1]-valued, and ui vanishes on Zi. This is the decomposition used in [step 3.1]. [algebra]

Proof

technique · direct
1.1L2algebra

For p∈βX define ρp(u):=uˉ(p) for u∈C(X,[0,1]); then ∣ρp(u)∣≤1 and ρp is additive, positively homogeneous, multiplicative and lattice-preserving: for u,v∈C(X,[0,1]) and real λ,μ≥0 with λu+μv again [0,1]-valued, ρp(λu+μv)=λρp(u)+μρp(v), ρp(uv)=ρp(u)ρp(v), and ρp(max⁡(u,v))=max⁡(ρp(u),ρp(v)); more generally every polynomial identity with nonnegative coefficients valid on X passes to ρp.

1.2L2algebra

If (xα) is a net in X with e(xα)→p in βX, then ρp(u)=lim⁡αu(xα) for every u∈C(X,[0,1]): this is continuity of uˉ at p together with uˉ∘e=u.

2.1step 1.1step 1.2L2algebra

Characterisation of closure points. For A⊆X one has p∈e[A]‾ βX if and only if ρp(u)=0 for every u∈C(X,[0,1]) with u∣A=0. If p∈e[A]‾ choose a net aα∈A with e(aα)→p and use [step 1.2]. Conversely, if p∉e[A]‾ take a basic neighbourhood N={q:∣q(ui)−ρp(ui)∣<ε, i≤n} of p in the cube with N∩e[A]=∅ and put w:=max⁡(0, 1−ε−2∑i≤n(ui−ρp(ui))2)∈C(X,[0,1]); then ρp(w)=max⁡(0,1−0)=1 by [step 1.1], while w(a)=0 for every a∈A, since e(a)∉N means ∑i(ui(a)−ρp(ui))2≥ε2.

3.1step 1.1step 2.1L1L4

For p∈βX, the family Up is a z-filter: it contains X because e[X] is dense in βX; it omits ∅ because ρp(1)=1≠0 and 1 vanishes on ∅; it is upward closed because Z⊆Z′ implies e[Z]‾⊆e[Z′]‾; and it is closed under finite intersections: if Zi=Z(fi) with p∈e[Zi]‾ for i=1,2, take u∈C(X,[0,1]) vanishing on Z1∩Z2 and write u=u1+u2 with u1,u2∈C(X,[0,1]) vanishing on Z1, respectively Z2, by the construction of [L4]; then ρp(ui)=0 by [step 2.1] and ρp(u)=0 by [step 1.1], so p∈e[Z1∩Z2]‾ by [step 2.1] again.

3.2step 1.1step 1.2step 2.1L2

Injectivity. For u∈C(X,[0,1]) and real c one has p∈e[{u≤c}]‾ whenever c>ρp(u): for a net xα with e(xα)→p one has u(xα)→ρp(u)<c by [step 1.2], so eventually xα∈{u≤c}. Conversely, if c<ρp(u) then p∉e[{u≤c}]‾: with v:=min⁡(1,(u−c)+) one has ρp(v)=min⁡(1,ρp(u)−c)>0 by [step 1.1] and v vanishes on {u≤c}, so [step 2.1] applies. Hence ρp(u)=inf⁡{c∈R:Z((u−c)+)∈Up} depends only on Up, and since the coordinates ρp(u) over u∈C(X,[0,1]) determine the point p of the cube by [L2], the equality Up=Uq forces p=q.

4.1step 1.2step 2.1step 3.1L1algebra

For p∈βX the z-filter Up is maximal. Let W⊇Up be a z-filter and let Z∈Z(X) with Z∈W; if Z∉Up, then p∉e[Z]‾ and [step 2.1] provides u∈C(X,[0,1]) vanishing on Z with t:=ρp(u)>0; the zero set Z1:=Z((t/2−u)+) is disjoint from Z, because u=0 on Z makes (t/2−u)+=t/2 there, and belongs to Up, because for any net xα∈X with e(xα)→p one has u(xα)→t>t/2 by [step 1.2], so eventually (t/2−u(xα))+=0, that is, xα∈Z1, whence p∈e[Z1]‾; but then Z,Z1∈W give ∅=Z∩Z1∈W, contradicting that W is a z-filter. Hence Z∈Up, and Up is a z-ultrafilter.

5.1step 4.1L1L3

Surjectivity. Let U be a z-ultrafilter. The family {e[Z]‾:Z∈U} consists of closed subsets of the compact space βX and has the finite intersection property, because the intersection of finitely many such closures contains e[Z1∩⋯∩Zn]‾ with Z1∩⋯∩Zn∈U nonempty; by [L3] there is p in the intersection, so p∈e[Z]‾ for every Z∈U, that is, U⊆Up; both are z-filters and U is maximal, so U=Up by [step 4.1].

6.1step 3.2step 4.1step 5.1∎

By [step 4.1] every Up is a z-ultrafilter, by [step 5.1] the map p↦Up is surjective, and by [step 3.2] it is injective; hence it is a bijection onto the set of z-ultrafilters.

Remarks

  • The functional ρp is the bridge. It is multiplicative even though a point of the cube is not a multiplicative functional on all of Cb(X) by definition; multiplicativity is obtained from [step 1.2], because all coordinates converge along a single net converging to p.
  • 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 βX is inherited from the Stone–Čech universal property, whose assumptions (ultrafilter lemma and Dependent Choice) are declared.

Depends on

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.

Sources