Difference between revisions of "Discrete metric and topology"

From Maths
Jump to: navigation, search
m
m
Line 32: Line 32:
 
* {{M|(X,\mathcal{P}(X))}} where {{M|\mathcal{P} }} denotes [[Power set|power set]]
 
* {{M|(X,\mathcal{P}(X))}} where {{M|\mathcal{P} }} denotes [[Power set|power set]]
 
{{Todo|find reference - even though it is obvious as I show above that every subset is open}}
 
{{Todo|find reference - even though it is obvious as I show above that every subset is open}}
 +
 +
==Related theorems==
 +
* [[Every map from a space with the discrete topology is continuous]]
 
==Notes==
 
==Notes==
 
<references group="Note"/>
 
<references group="Note"/>

Revision as of 23:34, 23 July 2015

Metric space definition

Let X be a set. The discrete[1] metric, or trivial metric[2] is the metric defined as follows:

  • d:X×XR0 with d:(x,y){0if x=y1otherwise

However any strictly positive value will do for the xy case. For example we could define d as:

  • d:(x,y){0if x=yvotherwise
    • Where v is some arbitrary member of R>0[Note 1] - traditionally (as mentioned) v=1 is used.

Note: however in proofs we shall always use the case v=1 for simplicity

Open balls

The open balls of X with the discrete topology are entirely X or a single point, that is:

[Expand]
  • Br(x):={pX| d(x,p)<r}={{x}for r1Xotherwise

Open sets

The open sets of (X,d_\text{discrete}) consist of every subset of X (the power set of X) - this is how the topology induced by the metric may be denoted (X,\mathcal{P}(X))

[Expand]

Every subset of X is an open set


Discrete topology

The discrete topology on X is the topology that considers every subset to be open. We may write X imbued with the discrete topology as:

  • (X,\mathcal{P}(X)) where \mathcal{P} denotes power set

TODO: find reference - even though it is obvious as I show above that every subset is open



Related theorems

Notes

  1. Jump up Note the strictly greater than 0 requirement for v

References

  1. Jump up Introduction to Topology - Theodore W. Gamelin & Robert Everist Greene
  2. Jump up Functional Analysis - George Bachman and Lawrence Narici