Difference between revisions of "Discrete metric and topology/Metric space definition"
From Maths
m |
m (Added ref) |
||
Line 1: | Line 1: | ||
− | Let {{M|X}} be a set. The ''discrete'' | + | Let {{M|X}} be a set. The ''discrete''{{rITTGG}} metric, or ''trivial metric''<ref>Functional Analysis - George Bachman and Lawrence Narici</ref> is the [[Metric space|metric]] defined as follows: |
* {{MM|d:X\times X\rightarrow \mathbb{R}_{\ge 0} }} with {{MM|1=d:(x,y)\mapsto\left\{0if x=y1otherwise\right. }} | * {{MM|d:X\times X\rightarrow \mathbb{R}_{\ge 0} }} with {{MM|1=d:(x,y)\mapsto\left\{0if x=y1otherwise\right. }} | ||
However any strictly positive value will do for the {{M|x\ne y}} case. For example we could define {{M|d}} as: | However any strictly positive value will do for the {{M|x\ne y}} case. For example we could define {{M|d}} as: |
Latest revision as of 06:08, 27 November 2015
Let X be a set. The discrete[1] metric, or trivial metric[2] is the metric defined as follows:
- d:X×X→R≥0 with d:(x,y)↦{0if x=y1otherwise
However any strictly positive value will do for the x≠y 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.
- 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
Notes
- Jump up ↑ Note the strictly greater than 0 requirement for v
References
- Jump up ↑ Introduction to Topology - Theodore W. Gamelin & Robert Everist Greene
- Jump up ↑ Functional Analysis - George Bachman and Lawrence Narici