Bing metrization theorem

Bing metrization theorem In topology, the Bing metrization theorem, named after R. H. Bing, characterizes when a topological space is metrizable.

Contents 1 Formal statement 2 History 3 Comparison with other metrization theorems 4 See also 5 References Formal statement The theorem states that a topological space {displaystyle X} is metrizable if and only if it is regular and T0 and has a σ-discrete basis. A family of sets is called σ-discrete when it is a union of countably many discrete collections, where a family {displaystyle {mathcal {F}}} of subsets of a space {displaystyle X} is called discrete, when every point of {displaystyle X} has a neighborhood that intersects at most one member of {displaystyle {mathcal {F}}.} History The theorem was proven by Bing in 1951 and was an independent discovery with the Nagata–Smirnov metrization theorem that was proved independently by both Nagata (1950) and Smirnov (1951). Both theorems are often merged in the Bing-Nagata-Smirnov metrization theorem. It is a common tool to prove other metrization theorems, e.g. the Moore metrization theorem – a collectionwise normal, Moore space is metrizable – is a direct consequence.

Comparison with other metrization theorems Unlike the Urysohn's metrization theorem which provides a sufficient condition for metrization, this theorem provides both a necessary and sufficient condition for a topological space to be metrizable.

See also Metrizable topological vector space – A topological vector space whose topology can be defined by a metric Nagata–Smirnov metrization theorem – Characterizes when a topological space is metrizable References "General Topology", Ryszard Engelking, Heldermann Verlag Berlin, 1989. ISBN 3-88538-006-4 Categories: Theorems in topology

Si quieres conocer otros artículos parecidos a Bing metrization theorem puedes visitar la categoría Theorems in topology.

Deja una respuesta

Tu dirección de correo electrónico no será publicada.


Utilizamos cookies propias y de terceros para mejorar la experiencia de usuario Más información