Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-31
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.

Arbitrary products of completely regular spaces are completely regular

Statement

An arbitrary product of completely regular spaces is completely regular.

Facts & Assumptions

Given: A product P=∏i∈IXi of completely regular spaces, a closed C⊆P, and x∈P∖C.

[F2]

Complete regularity gives hi:Xi→[0,1] with hi(xi)=1 and hi[Xi∖Ui]={0} when xi∈Ui is open (Completely regular spaces and Tychonoff (T312) spaces).

[L1]

A finite pointwise minimum of continuous [0,1]-valued maps is continuous (Finite pointwise minima of continuous maps to [0,1] are continuous).

[L2]

A family indexed by a natural number whose members are nonempty has a choice function, without any choice axiom (Every natural-number-indexed list of nonempty sets has a choice function on its family of values).

Proof

technique · direct
1.1

Choose a finite-support basic neighbourhood B=⋂i∈Jπi−1[Ui] of x contained in P∖C.

F1
1.2

The finite-choice result [L2] selects a map hi as in [F2] for every i∈J; put h=min⁡i∈J(hi∘πi).

F2L1L2
2.1

The map h is continuous and h(x)=1. If y∈C, then y∉B, so yi∉Ui for some i∈J and h(y)=0.

F1L1step 1.1step 1.2
3.1

Thus h separates x from C in the defining sense of complete regularity.

F2step 2.1∎

Depends on

Used by

Dependency tree · two levels

26 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