Difference between revisions of "Metric space"
m |
m |
||
(4 intermediate revisions by the same user not shown) | |||
Line 1: | Line 1: | ||
A [[Normed space|normed space]] is a special case of a metric space, to see the relationships between metric spaces and others see: [[Subtypes of topological spaces]] | A [[Normed space|normed space]] is a special case of a metric space, to see the relationships between metric spaces and others see: [[Subtypes of topological spaces]] | ||
==Definition of a metric space== | ==Definition of a metric space== | ||
− | A metric space is a set <math>X</math> coupled with a "distance function"<ref name="Topology">Introduction to Topology - Bert Mendelson</ref>: | + | A metric space is a set <math>X</math> coupled with a "distance function"<ref name="Topology">Introduction to Topology - Bert Mendelson</ref>{{rITTGG}}: |
* <math>d:X\times X\rightarrow\mathbb{R}</math> or sometimes | * <math>d:X\times X\rightarrow\mathbb{R}</math> or sometimes | ||
− | * <math>d:X\times X\rightarrow\mathbb{R}_+</math><ref name="Analysis">Analysis - Part 1: Elements - Krzysztof Maurin</ref> | + | * <math>d:X\times X\rightarrow\mathbb{R}_+</math><ref name="Analysis">Analysis - Part 1: Elements - Krzysztof Maurin</ref>, Note that here I prefer the notation <math>d:X\times X\rightarrow\mathbb{R}_{\ge 0}</math> |
With the properties that for <math>x,y,z\in X</math>: | With the properties that for <math>x,y,z\in X</math>: | ||
− | # <math>d(x,y)\ge 0</math> | + | # <math>d(x,y)\ge 0</math> (This is implicit with the {{M|1=d:X\times X\rightarrow\mathbb{R}_{\ge 0} }} definition) |
# <math>d(x,y)=0\iff x=y</math> | # <math>d(x,y)=0\iff x=y</math> | ||
# <math>d(x,y)=d(y,x)</math> - Symmetry | # <math>d(x,y)=d(y,x)</math> - Symmetry | ||
# <math>d(x,z)\le d(x,y)+d(y,z)</math> - the [[Triangle inequality]] | # <math>d(x,z)\le d(x,y)+d(y,z)</math> - the [[Triangle inequality]] | ||
− | We will denote a metric space as <math>(X,d)</math> (as <math>(X,d:X\times X\rightarrow\mathbb{R})</math> is too long and [[Mathematicians are lazy]]) or simply <math>X</math> if it is obvious which metric we are talking about on <math>X</math> | + | We will denote a metric space as <math>(X,d)</math> (as <math>(X,d:X\times X\rightarrow\mathbb{R}_{\ge 0})</math> is too long and [[Mathematicians are lazy]]) or simply <math>X</math> if it is obvious which metric we are talking about on <math>X</math> |
==Examples of metrics== | ==Examples of metrics== | ||
Line 24: | Line 24: | ||
{{End Proof}}{{End Theorem}} | {{End Proof}}{{End Theorem}} | ||
− | === | + | ===[[Discrete metric and topology|Discrete Metric]]=== |
− | + | {{:Discrete metric and topology/Metric space definition}} | |
− | + | ====Notes==== | |
− | + | {{:Discrete metric and topology/Summary}} | |
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
==See also== | ==See also== | ||
+ | * [[Topology induced by a metric]] | ||
+ | * [[Connected space]] | ||
* [[Topological space]] | * [[Topological space]] | ||
− | + | ==Notes== | |
+ | <references group="Note"/> | ||
==References== | ==References== | ||
<references/> | <references/> | ||
{{Definition|Topology|Metric Space}} | {{Definition|Topology|Metric Space}} |
Latest revision as of 06:07, 27 November 2015
A normed space is a special case of a metric space, to see the relationships between metric spaces and others see: Subtypes of topological spaces
Contents
[hide]Definition of a metric space
A metric space is a set X
- d:X×X→Ror sometimes
- d:X×X→R+[3], Note that here I prefer the notation d:X×X→R≥0
With the properties that for x,y,z∈X
- d(x,y)≥0(This is implicit with the d:X×X→R≥0 definition)
- d(x,y)=0⟺x=y
- d(x,y)=d(y,x)- Symmetry
- d(x,z)≤d(x,y)+d(y,z)- the Triangle inequality
We will denote a metric space as (X,d)
Examples of metrics
Euclidian Metric
The Euclidian metric on Rn
dEuclidian(x,y)=√n∑i=1((xi−yi)2)
Proof that this is a metric
Discrete Metric
Let X be a set. The discrete[2] metric, or trivial metric[4] is the metric defined as follows:
- d:X×X→R≥0with 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
Property | Comment |
---|---|
induced topology | discrete topology - which is the topology (X,P(X)) (where P denotes power set) |
Open ball | Br(x):={p∈X| d(p,x)<r}={{x}if r≤1Xotherwise |
Open sets | Every subset of X is open. Proof outline: as for a subset A⊆X we can show ∀x∈A∃r[Br(x)⊆A] by choosing say, that is A contains an open ball centred at each point in A. |
Connected | The topology generated by (X,ddiscrete) is not connected if X has more than one point. Proof outline:
|
See also
Notes
- Jump up ↑ Note the strictly greater than 0 requirement for v
References
- Jump up ↑ Introduction to Topology - Bert Mendelson
- ↑ Jump up to: 2.0 2.1 Introduction to Topology - Theodore W. Gamelin & Robert Everist Greene
- Jump up ↑ Analysis - Part 1: Elements - Krzysztof Maurin
- Jump up ↑ Functional Analysis - George Bachman and Lawrence Narici