Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedPipeline-generatedaudited 2026-09-22
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.

A sigma-cellular base metrizes a normal Moore space

Statement

Assume ZFC. Let X be a normal Moore space carrying a base of the form ⋃n∈NBn (Basis and subbasis for a topology, and the topology generated by a family of sets) in which every Bn is a pairwise disjoint family of open sets. Then X is metrizable.

The normality and development hypotheses are essential to this conclusion: a T1 space with a sigma-disjoint base need not be metrizable.

Facts & Assumptions

Given: A normal Moore space X, a development (Gi)i∈N, and a base ⋃nBn whose levels are pairwise disjoint open families.

[F1]

A Moore space is regular and T1 and has a development: every Gi covers X, and for every open O∋x some i satisfies St⁡(x,Gi)⊆O (Moore spaces and developments).

[F2]

For every open O∋x, some member of the displayed base contains x and is contained in O (Basis and subbasis for a topology, and the topology generated by a family of sets).

[F4]

A family is discrete when every point has a neighbourhood meeting at most one member; a sigma-discrete open basis of a regular T1 space yields a compatible metric in ZFC (Discrete families and σ-locally-finite and σ-discrete bases, Under choice, a space is metrizable if and only if it is regular, T1, and has a σ-discrete basis, The Axiom of Choice).

Proof

technique · direct
1.1givenF1

For n,i∈N, put Bn∗=⋃Bn, Wn=X∖Bn∗, and Xn,i=X∖⋃{G∈Gi:G∩Wn≠∅}. The set Wn is closed and Xn,i is closed. Also Xn,i⊆Bn∗: a member of the cover Gi containing a point of Xn,i is disjoint from Wn.

2.1F1step 1.1

Every point of Bn∗ belongs to some Xn,i. Indeed, if x∈B∈Bn, choose i with St⁡(x,Gi)⊆B by [F1]. Every member of Gi containing x is then disjoint from Wn, which is precisely x∈Xn,i. Empty levels cause no exception: then Bn∗=Xn,i=∅.

2.2F3step 1.1

Apply [F3] to the closed set Xn,i inside the open set Bn∗ and obtain open Dn,i with Xn,i⊆Dn,i⊆Dn,i‾⊆Bn∗.

3.1givenF4step 2.2

The family Hn,i={Dn,i∩B:B∈Bn} is a discrete family of open sets. A point outside Dn,i‾ has an open neighbourhood missing every member. A point of Dn,i‾ lies in Bn∗ by step 2.2 and hence in a unique B0∈Bn; the open neighbourhood B0 meets no Dn,i∩B with B≠B0.

4.1F2F4step 2.1step 2.2step 3.1

The countable union ⋃n,iHn,i is an open sigma-discrete basis. To verify the basis property, let O be open and x∈O. By [F2] choose n and B∈Bn with x∈B⊆O. Step 2.1 gives i with x∈Xn,i⊆Dn,i, so x∈Dn,i∩B⊆O and this set belongs to Hn,i.

5.1F1F4step 4.1∎

By [F1], X is regular and T1. The sigma-discrete basis of step 4.1 therefore satisfies the reverse direction of Bing's metrization theorem [F4], so X admits a compatible metric.

Remarks

  • Why the naive block metric fails. Although Bn∗ is open, its complement Wn need not be open. Thus Bn∪{Wn} need not be an open partition, and agreement on those blocks does not directly define the original topology. Normality and the development are exactly what replace each cellular level by the countable family of discrete open families in step 3.1.

  • Source route. Step 3.1 is Bing's normal-development conversion from screenable to strongly screenable (Theorem 8). Step 5.1 uses the sigma-discrete-basis form of his metrization theorem (Theorem 3).

Depends on

Used by

Dependency tree · two levels

23 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