Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-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 filter and zero set ultrafilter

Definition

Let X be a Tychonoff space (Completely regular spaces and Tychonoff (T312) spaces) and let R carry its usual topology. Put

C(X)  :=  C(X,R),

the ring of all continuous real-valued functions on X with pointwise addition and multiplication. No boundedness and no norm is assumed: functions in C(X) may be unbounded, and C(X) is not treated as a Banach algebra anywhere on this page. For fC(X) let

Z(f)  :=  f1[{0}]  =  {xX:f(x)=0}

be the zero set of f (Zero sets and cozero sets of continuous real-valued functions), and call a subset of X a zero set of X when it is Z(f) for some fC(X). Write Z(X) for the family of all zero sets of X.

A z-filter on X is a family FZ(X) of zero sets with

  1. XF;
  2. F;
  3. F is closed under finite intersections: if Z,ZF then ZZF;
  4. F is upward closed inside Z(X): if ZF and ZZ with ZZ(X), then ZF.

A z-ultrafilter on X is a z-filter that is maximal among z-filters with respect to inclusion: a z-filter U such that every z-filter GU satisfies G=U.

Two elementary facts about Z(X) are used repeatedly and are recorded here rather than reproved each time:

  • Z(X) is closed under finite intersections, because Z(f)Z(g)=Z(f2+g2) for all f,gC(X); in particular Z(f)Z(g) is again a zero set and the condition 3 of a z-filter is not vacuous. Similarly X=Z(0) and =Z(1) are zero sets, so the conditions 1 and 2 are meaningful.
  • If Z(f)Z(g), no algebraic formula for g in terms of f is claimed; inclusions of zero sets are handled through maximal ideals in Maximal ideals of C(X) and zero set ultrafilters.

Remarks

  • Why zero sets and not arbitrary closed sets. Arbitrary closed sets are also closed under finite intersections. What is special here is that the intersection remains represented by continuous functions through the explicit identity Z(f)Z(g)=Z(f2+g2); this function-theoretic representation is what connects z-filters to ideals of C(X).
  • Source status. The historical target (the neighbouring deferral is recorded as a remark on the companion examples page) was inaccessible in this run, and the failed recovery record is in the Batch 4 coverage ledger. This definition and its consumers (Maximal ideals of C(X) and zero set ultrafilters, Zero set ultrafilters and Stone-Cech points, Gelfand-Kolmogorov for rings of continuous functions) are complete local proofs, not source citations.

Depends on

Used by

Dependency tree · two levels

16 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