Alphabeta Math
CorollaryStatement: AI-adaptedProof: AI-adaptedprecheck passverified 2026-09-09 (gpt-6-astra)
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, every regular T1 second-countable space is metrizable

Statement

Assume the Axiom of Choice. Every regular T1 second-countable space is metrizable.

Facts & Assumptions

Given: A regular T1 space with a countable basis (Bn)n∈N, and the Axiom of Choice.

[L3]

AC selects the separators below and implies DC: choose one successor for each point of an entire relation and iterate that function. (The Axiom of Choice)

Proof

technique · direct
1.1

First X is normal. Given disjoint closed A,B, enumerate the basis members whose closures avoid B as (Un) and those whose closures avoid A as (Vn), padding by empty sets if necessary. By [L1] and the basis property, the first family covers A and the second covers B. Put U=⋃n(Un∖⋃i≤nV‾i) and V=⋃n(Vn∖⋃i≤nU‾i). Each summand is open because only finitely many closed sets are removed. The sets contain A,B respectively. They are disjoint: a point in the nth summand of U and mth summand of V would contradict the removal of V‾m if m≤n, and of U‾n if n≤m. This proves normality.

L1givenconstruct
2.1

For every pair (i,j) with B‾i⊆Bj, [L2] gives a continuous fij:X→[0,1] equal to 1 on B‾i and 0 on X∖Bj. Use AC to select all these functions, and list them as a sequence (fk)k≥1, adding zero functions when necessary. For every point x and open neighbourhood O, choose Bj with x∈Bj⊆O, shrink inside Bj using [L1], and choose Bi containing x inside that shrinking. Then B‾i⊆Bj, so one listed function is 1 at x and vanishes outside O. This also separates distinct points because T1 makes X∖{y} open.

L1L2L3step 1.1choose
3.1

Define d(x,y)=∑k≥12−k∣fk(x)−fk(y)∣. Each term is at most 2−k, so the sum converges. Symmetry and the triangle inequality follow termwise, and step 2.1 gives d(x,y)>0 for x≠y. Thus d is a metric (including the empty-space case).

step 2.1constructalgebra
4.1

For fixed x and ε>0, choose N with ∑k>N2−k<ε/2. Continuity of the first N functions gives an original open neighbourhood W of x where their weighted differences from their values at x sum to less than ε/2. Hence W⊆Bd(x,ε). Conversely, for an original open O containing x, take the index k supplied by step 2.1. If d(x,y)<2−k, then fk(y)>0, so y∈O. Thus every original neighbourhood contains a metric ball and every metric ball contains an original neighbourhood at its centre; the topologies coincide. Hence X is metrizable.

step 2.1step 3.1algebra∎

Depends on

Used by

Dependency tree · two levels

40 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