Bing metrization theorem

Bing Metrization Theorem

Bing metrization theorem

to get instant updates about 'Bing Metrization Theorem' on your MyPage. Meet other similar minded people. Its Free!


All Updates

In topology, the Bing metrization theorem, named after R. H. Bing, characterizes when a topological space is metrizable. The theorem states that a topological space <math>X</math> is metrizable if and only if it is regular and T<sub>0</sub> and has a &sigma;-discrete basis. A family of sets is called &sigma;-discrete when it is a union of countably many discrete collections, where a family <math>F</math> of subsets of a space <math>X</math> is called discrete, when every point of <math>X</math> has a neighborhood that intersects at most one member of <math>F</math>.

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.

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.


  • "General Topology", Ryszard Engelking, Heldermann Verlag Berlin, 1989. ISBN 3-88538-006-4

Read More

No feeds found

wait Posting your question. Please wait!...

No updates available.
No messages found
Suggested Pages
Tell your friends >
about this page
 Create a new Page
for companies, colleges, celebrities or anything you like.Get updates on MyPage.
Create a new Page
 Find your friends
  Find friends on MyPage from