Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck 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=iIXiP=\prod_{i\in I}X_i of completely regular spaces, a closed CPC\subseteq P, and xPCx\in P\setminus C.

[F2]

Complete regularity gives hi:Xi[0,1]h_i:X_i\to[0,1] with hi(xi)=1h_i(x_i)=1 and hi[XiUi]={0}h_i[X_i\setminus U_i]=\{0\} when xiUix_i\in U_i is open (Completely regular spaces and Tychonoff (T312T_{3\frac{1}{2}}) spaces).

[L1]

A finite pointwise minimum of continuous [0,1][0,1]-valued maps is continuous (Finite pointwise minima of continuous maps to [0,1][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=iJπi1[Ui]B=\bigcap_{i\in J}\pi_i^{-1}[U_i] of xx contained in PCP\setminus C.

F1
1.2

The finite-choice result [L2] selects a map hih_i as in [F2] for every iJi\in J; put h=miniJ(hiπi)h=\min_{i\in J}(h_i\circ\pi_i).

F2L1L2
2.1

The map hh is continuous and h(x)=1h(x)=1. If yCy\in C, then yBy\notin B, so yiUiy_i\notin U_i for some iJi\in J and h(y)=0h(y)=0.

F1L1step 1.1step 1.2
3.1

Thus hh separates xx from CC in the defining sense of complete regularity.

F2step 2.1

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 80 results over 17 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.

Sources