Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedverified 2026-09-24 (gpt-6-sol)
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.

Under choice, a space is metrizable if and only if it is regular, T1, and has a σ-locally-finite basis

Statement

Assume the Axiom of Choice. A space is metrizable if and only if it is regular, T1, and has a σ-locally-finite basis. Here regularity and T1 are separate hypotheses.

Facts & Assumptions

Given: The Axiom of Choice and a topological space X.

[L1]

Under choice every metric space has a σ-locally-finite basis (Under choice, every metric space has a σ-locally-finite basis).

[L2]

For a locally finite family, taking closures preserves local finiteness and the closure of its union is the union of its closures (Locally finite families remain locally finite after taking closures, closure commutes with their union, and a locally finite union of closed sets is closed).

[L3]

Under DC, disjoint closed sets of a normal space admit a continuous separating function into [0,1] (Urysohn's lemma, under the axiom of dependent choice: in a normal space two disjoint closed sets are separated by a continuous function into [0,1], and conversely such a space is normal). AC supplies DC and the indexed function choices below (The Axiom of Choice).

Proof

technique · cases
1.1assume-case forwardL1

If X is metrizable, it is regular and T1, and [L1] gives the required basis.

1.2assume-case reverseL2construct

Conversely write the supplied basis as B=⋃n≥0Bn with every Bn locally finite. We first prove normality, rather than assuming it. For disjoint closed F,H, let Un be the union of those B∈Bn with B‾∩H=∅, and define Vn symmetrically for H against F. Regularity and the basis property say the Un cover F and the Vn cover H: each point outside a closed set has a basis neighborhood whose closure misses it. By [L2], Un‾ misses H and Vn‾ misses F. Now put U=⋃n≥0(Un∖⋃k≤nVk‾),V=⋃n≥0(Vn∖⋃k≤nUk‾). Both are open, F⊆U, and H⊆V. If a point belonged to the nth piece of U and the mth piece of V, then m≤n would contradict its exclusion from Vm‾, while n≤m would contradict its exclusion from Un‾. Thus U∩V=∅ and X is normal.

2.1L2L3step 1.2

Every basis member B is the cozero set of a continuous function. For each n, let FB,n be the union of C‾ over C∈Bn with C‾⊆B. It is closed and contained in B by [L2]. The union of these FB,n over n is B: for x∈B, regularity gives an open O with x∈O⊆O‾⊆B, and some basis member C∋x lies in O. By [L3] applied to the disjoint closed sets FB,n and X∖B, choose fB,n:X→[0,1] equal to 1 on FB,n and 0 outside B. AC makes these simultaneous choices for all (B,n). The uniformly convergent sum uB=∑n≥02−n−1fB,n is continuous, zero outside B, and positive at every point of B. Hence B={uB>0}.

3.1step 2.1algebra

Index repeated basis members by their layer, writing i=(n,B) with B∈Bn. At each x, only finitely many members of Bn contain x, so the finite sum Sn(x)=∑B∈BnuB(x)2 is well defined. It is continuous: around any x, local finiteness makes all but finitely many summands identically zero. Define anB(x)=2−n−1uB(x)1+Sn(x). Each coordinate is continuous and ∑B∈BnanB(x)2≤4−n−1 uniformly in x. Consequently the nonnegative generalized sum d(x,y)2=∑n≥0∑B∈Bn(anB(x)−anB(y))2 is finite. It is the squared ℓ2 distance of the two coordinate vectors; the triangle inequality follows from finite-sum Cauchy--Schwarz and passage to the supremum over finite index sets. Symmetry and d(x,x)=0 are immediate. If x≠y, T1 and the basis give a B with x∈B, y∉B; then anB(x)>0=anB(y) for a layer containing B. Thus d is a metric.

4.1step 3.1

The metric induces the original topology. Given x∈O open, choose a basis member B with x∈B⊆O and a layer n containing it. If d(x,y)<anB(x)/2, then anB(y)>0, so y∈B⊆O. Conversely fix x and ε>0. Choose N so that 4∑n>N4−n−1<ε2/2. For each of the finitely many layers n≤N, take a neighborhood of x meeting only finitely many B∈Bn. On the intersection of these neighborhoods, every other coordinate in those layers vanishes both at x and at nearby y. Continuity of the remaining finitely many coordinates makes their squared-difference sum <ε2/2 on a smaller neighborhood. The tail estimate (a−b)2≤2a2+2b2 and the uniform layer bound make its contribution <ε2/2. Thus d(x,y)<ε there.

5.1step 1.1step 1.2step 4.1cases-exhaustive∎

Step 1.1 proves the forward implication, and steps 1.2--3.1 construct a compatible metric for the reverse implication under the stated AC.

Depends on

Used by

Dependency tree · two levels

44 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