Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedSession-authored (Fable 5 assisted)precheck passjudge pass (z-ai/glm-5.2)audited 2026-07-29
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.

In a metric space every closed set is a zero set and a GδG_\delta, and the distance function separates a point from a closed set, so every metrizable space is Tychonoff and perfectly normal

Statement

Let (X,d)(X,d) be a metric space (Metric space: d(x,y)=0d(x,y) = 0 iff x=yx = y, symmetry, and the triangle inequality; pseudometric and ultrametric) with its metric topology (The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement), and write 1/(n+1)1/(n+1) for the inverse of the canonical natural ι(n+1)\iota(n+1) of R\mathbb{R} (The canonical natural ι(n)=n1F\iota(n) = n \cdot 1_F of a field). Then:

  1. Every closed set is a zero set. For closed CXC \subseteq X there is a continuous f:XRf : X \to \mathbb{R} with C=Z(f)C = Z(f) (Zero sets and cozero sets of continuous real-valued functions); for CC \ne \varnothing one may take f(x)=d(x,C)f(x) = d(x,C) (Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space), and for C=C = \varnothing the constant function 11.
  2. Every closed set is a GδG_\delta (GδG_\delta and FσF_\sigma subsets of a topological space, agreeing with the real-line notion): for CC \ne \varnothing, C  =  nN{xX:d(x,C)<1/(n+1)},C \;=\; \bigcap_{n \in \mathbb{N}} \{\, x \in X : d(x,C) < 1/(n+1) \,\}, an intersection of open sets, and \varnothing is open hence a GδG_\delta.
  3. XX is completely regular (Completely regular spaces and Tychonoff (T312T_{3\frac{1}{2}}) spaces): for closed CC and x0Cx_0 \notin C the function f(x):=min{1, d(x,C)/r}f(x) := \min\{1,\ d(x,C)/r\} with r:=d(x0,C)r := d(x_0,C) is continuous, takes the value 11 at x0x_0 and the value 00 on CC, when CC \ne \varnothing; for C=C = \varnothing the constant function 11 serves.
  4. Consequently every metrizable space (Metrizable space: a topological space whose topology is induced by some metric; metrizability is topological, the metric is not) is Tychonoff and perfectly normal, and hence T6T_6, T5T_5, T4T_4, T312T_{3\frac12}, T3T_3, T212T_{2\frac12}, T2T_2, T1T_1 and T0T_0.

No choice principle is used anywhere below.

Facts & Assumptions

Given: A metric space (X,d)(X,d), a closed set CXC \subseteq X, a point x0XCx_0 \in X \setminus C, and R\mathbb{R} with its usual topology.

[L1]

For nonempty SXS \subseteq X the distance d(x,S)d(x,S) is defined, is 0\ge 0, and S={x:d(x,S)=0}\overline{S} = \{\, x : d(x,S) = 0 \,\} (Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space, The closure of a nonempty AA is {x:d(x,A)=0}\{x : d(x,A) = 0\}, equals AA together with its limit points, and is the smallest closed superset, claim 1).

[L2]

d(x,S)d(y,S)d(x,y)|d(x,S) - d(y,S)| \le d(x,y) for nonempty SS (d(x,A)d(y,A)d(x,y)|d(x,A) - d(y,A)| \le d(x,y), so the distance to a fixed nonempty set is 11-Lipschitz).

[L3]

A map between metric spaces satisfying an inequality g(x)g(y)Ld(x,y)|g(x) - g(y)| \le L\, d(x,y) with L>0L > 0 is continuous in the ε\varepsilon-δ\delta sense, by δ:=ε/L\delta := \varepsilon / L, and is therefore continuous as a map of topological spaces (Continuity of a map between metric spaces, at a point and globally, in the ε\varepsilon-δ\delta form, For a map of metric spaces the following agree: ε\varepsilon-δ\delta continuity everywhere, preimages of open sets are open, preimages of closed sets are closed, sequential continuity, and f(A)f(A)f(\overline{A}) \subseteq \overline{f(A)}, clause (b), Metrizable space: a topological space whose topology is induced by some metric; metrizability is topological, the metric is not).

[L5]

For every real ε>0\varepsilon > 0 there is a natural k1k \ge 1 with 1/k<ε1/k < \varepsilon, and every nonzero natural is a successor, so k=n+1k = n+1 for some nNn \in \mathbb{N} (For every ε>0\varepsilon > 0 in a complete ordered field there is a natural n1n \ge 1 with 1/n<ε1/n < \varepsilon, Every nonzero natural number is a successor, The canonical natural ι(n)=n1F\iota(n) = n \cdot 1_F of a field).

[L6]

A two-element set of reals has a maximum and a minimum, each of which is one of the two elements (Maximum and minimum of a set, Every nonempty finite set of reals has a maximum and a minimum); and [0,1][0,1] is the set of reals tt with 0t10 \le t \le 1 (Intervals of R\mathbb{R}: the nine order-convex forms, nondegeneracy, and length).

Proof

technique · direct
1.1

Suppose CC \ne \varnothing and put g(x):=d(x,C)g(x) := d(x,C); then gg is continuous by [L2] and [L3] with L=1L = 1.

L1L2L3assume-hyp
1.2

If C=C = \varnothing then the constant function 11 is continuous and has zero set =C\varnothing = C, since 101 \ne 0.

L3L4
2.1

Under step 1.1: Z(g)={x:d(x,C)=0}=C=CZ(g) = \{\, x : d(x,C) = 0 \,\} = \overline{C} = C, the last equality because CC is closed.

step 1.1L1L4
2.2

Under step 1.1: for each nn the set Wn:={x:d(x,C)<1/(n+1)}W_n := \{\, x : d(x,C) < 1/(n+1) \,\} is open, since for xWnx \in W_n and t:=1/(n+1)d(x,C)>0t := 1/(n+1) - d(x,C) > 0 any yy with d(x,y)<td(x,y) < t has d(y,C)d(x,C)+d(x,y)<1/(n+1)d(y,C) \le d(x,C) + d(x,y) < 1/(n+1) by [L2].

step 1.1L2
3.1

By steps 2.1 and 1.2 every closed subset of XX is a zero set, which is claim 1.

step 2.1step 1.2
3.2

Under step 1.1: CnWnC \subseteq \bigcap_n W_n, since d(x,C)=0<1/(n+1)d(x,C) = 0 < 1/(n+1) for xCx \in C by [L1] and step 2.1.

step 2.1step 2.2L1
3.3

Under step 1.1: if xCx \notin C then d(x,C)>0d(x,C) > 0 by [L1] and step 2.1, so [L5] gives nn with 1/(n+1)<d(x,C)1/(n+1) < d(x,C) and hence xWnx \notin W_n.

step 2.1step 2.2L1L5
3.4

Under step 1.1 with x0Cx_0 \notin C: r:=d(x0,C)>0r := d(x_0,C) > 0 by [L1] and step 2.1, and f(x):=min{1, d(x,C)/r}f(x) := \min\{1,\ d(x,C)/r\} takes values in [0,1][0,1] by [L1] and [L6].

step 2.1L1L6
4.1

Steps 3.2 and 3.3 give C=nWnC = \bigcap_n W_n for nonempty closed CC, and \varnothing is open hence a GδG_\delta by [L4]; this is claim 2.

step 3.2step 3.3L4
4.2

Under step 3.4: min{1,u}min{1,v}uv|\min\{1,u\} - \min\{1,v\}| \le |u - v| for all reals u,vu,v, since if both are at most 11 the two sides are equal, if both exceed 11 the left side is 00, and if u1<vu \le 1 < v then the left side is 1u1 - u, which is at most vuv - u, the remaining case v1<uv \le 1 < u being the same with uu and vv exchanged; hence f(x)f(y)d(x,C)d(y,C)/rd(x,y)/r|f(x) - f(y)| \le |d(x,C) - d(y,C)|/r \le d(x,y)/r and ff is continuous by [L3] with L=1/rL = 1/r.

step 3.4L2L3L6
4.3

Under step 3.4: f(x0)=min{1,r/r}=min{1,1}=1f(x_0) = \min\{1, r/r\} = \min\{1,1\} = 1, and f(y)=min{1,0}=0f(y) = \min\{1, 0\} = 0 for yCy \in C since d(y,C)=0d(y,C) = 0.

step 3.4L1L6
5.1

By steps 4.2 and 4.3, and by step 1.2 for the case C=C = \varnothing, the space XX is completely regular, which is claim 3.

step 1.2step 4.2step 4.3
6.1

A metrizable space YY is completely regular by step 5.1 applied to any inducing metric, and it is T1T_1 by [L7], so it is Tychonoff; it is normal by [L8] and every closed subset of it is a GδG_\delta by step 4.1, so it is perfectly normal.

step 4.1step 5.1L7L8
7.1

Being perfectly normal and T1T_1, such a YY is T6T_6; it is T5T_5 and T4T_4 by [L8] and T1T_1, it is T312T_{3\frac12} by step 6.1, and it is T3T_3, T212T_{2\frac12}, T2T_2, T1T_1 and T0T_0 by the implications already proved on this page; this is claim 4.

step 6.1L7L8

Remarks

Depends on

Used by

Dependency tree · next 3 levels

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