Locally discrete collection

Locally discrete collection

In mathematics, particularly topology, collections of subsets are said to be locally discrete if they look like they have precisely one element from a local point of view. The study of locally discrete collections is worthwile as Bing's metrization theorem shows.

Formal definition

Let "X" be a topological space. A collection {Ga} of subsets of "X" is said to be locally discrete, if each point of the space has a neighbourhood intersecting at most one element of the collection. A collection of subsets of "X" is said to be countably locally discrete, if it is the countable union of locally discrete collections.

Properties and examples

1. Locally discrete collections are always locally finite. See the page on local finiteness.

2. If a collection of subsets of a topological space X is locally discrete, it must satisfy the property that each point of the space belongs to at most one element of the collection. This means that only collections of pairwise disjoint sets can be locally discrete.

3. A Hausdorff space cannot have a locally discrete basis unless it is itself discrete. The same property holds for a T1 space.

4. The following is known as Bing's metrization theorem:

A space "X" is metrizable iff it is regular and has a basis that is countably locally discrete.

5. A countable collection of sets is necessarily countably locally discrete. Therefore, if X is a metrizable space with a countable basis, one implication of Bing's metrization theorem holds. In fact, Bing's metrization theorem is almost a corollary of the Nagata-Smirnov theorem.

ee also

*Locally finite collection
*Nagata-Smirnov metrization theorem
*Bing metrization theorem

References

*James Munkres (1999). Topology, 2nd edition, Prentice Hall. ISBN 0-13-181629-2.


Wikimedia Foundation. 2010.

Игры ⚽ Нужно решить контрольную?

Look at other dictionaries:

  • List of mathematics articles (L) — NOTOC L L (complexity) L BFGS L² cohomology L function L game L notation L system L theory L Analyse des Infiniment Petits pour l Intelligence des Lignes Courbes L Hôpital s rule L(R) La Géométrie Labeled graph Labelled enumeration theorem Lack… …   Wikipedia

  • Reciprocal lattice — In physics, the reciprocal lattice of a lattice (usually a Bravais lattice) is the lattice in which the Fourier transform of the spatial function of the original lattice (or direct lattice) is represented. This space is also known as momentum… …   Wikipedia

  • Ising model — The Ising model, named after the physicist Ernst Ising, is a mathematical model in statistical mechanics. It has since been used to model diverse phenomena in which bits of information, interacting in pairs, produce collectiveeffects.Definition… …   Wikipedia

  • List of algorithms — The following is a list of the algorithms described in Wikipedia. See also the list of data structures, list of algorithm general topics and list of terms relating to algorithms and data structures.If you intend to describe a new algorithm,… …   Wikipedia

  • Paranormal space — In mathematics, in the realm of topology, a topological space is said to be paranormal if every countable discrete collection of closed sets has a locally finite open expansion …   Wikipedia

  • Glossary of topology — This is a glossary of some terms used in the branch of mathematics known as topology. Although there is no absolute distinction between different areas of topology, the focus here is on general topology. The following definitions are also… …   Wikipedia

  • Fourier transform — Fourier transforms Continuous Fourier transform Fourier series Discrete Fourier transform Discrete time Fourier transform Related transforms The Fourier transform is a mathematical operation that decomposes a function into its constituent… …   Wikipedia

  • Covering space — A covering map satisfies the local triviality condition. Intuitively, such maps locally project a stack of pancakes above an open region, U, onto U. In mathematics, more specifically algebraic topology, a covering map is a continuous surjective… …   Wikipedia

  • Orbifold — This terminology should not be blamed on me. It was obtained by a democratic process in my course of 1976 77. An orbifold is something with many folds; unfortunately, the word “manifold” already has a different definition. I tried “foldamani”,… …   Wikipedia

  • Mathematical optimization — For other uses, see Optimization (disambiguation). The maximum of a paraboloid (red dot) In mathematics, computational science, or management science, mathematical optimization (alternatively, optimization or mathematical programming) refers to… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”