Prametric space
From Wikipedia, the free encyclopedia
In mathematics, a prametric space generalizes the concept of a metric space by not requiring the conditions of symmetry, indiscernability and the triangle inequality. Prametric spaces occur naturally as maps between metric spaces.
Contents |
[edit] Definition
A prametric space <math>(M,\mathrm{d})</math> is a set <math>M</math> together with a function <math>\mathrm{d}:M\times M\to\mathbb{R}</math> (called a prametric) which satisfies the following conditions:
- <math>\,\!\mathrm{d}(x,y)\ge0</math> (non-negativity);
- <math>\,\!\mathrm{d}(x,x)=0;</math>
The definition of a prametric allows for the case of <math>\,\!\mathrm{d}(x,y)=0</math> even if <math>x\ne y</math>. A prametric is said to be separating if <math>\,\!\mathrm{d}(x,y)=0</math> implies that <math>x=y</math>, for all <math>x,y\in M</math> (this is the identity of indiscernibles).
A prametric is called symmetric if <math>\,\! \mathrm{d}(x,y)=d(y,x)</math> for all <math>x,y\in M</math>.
A symmetric, separating prametric is called a semimetric, and the corresponding space is a semimetric space.
A prametric which obeys the triangle inequality is called a hemimetric; a separating hemimetric is a quasimetric; a symmetric hemimetric is a pseudometric.
[edit] Examples
If <math>(X,\rho)</math> is a metric space, and <math>f:X\to Y</math> is a map, then
- <math>d(y_1,y_2) = \rho(f^{-1}(y_1),f^{-1}(y_2))</math>
is a symmetric prametric.
Another example is that of the distance between subsets of a metric space. That is, given a metric space <math>(X,\rho)</math> and some collection of subsets <math>\{V_i: V_i\subset X\,, i\in I\}</math> indexed by a set <math>I</math>, one defines
- <math>d(i,j)=\rho(V_i,V_j)</math>
This distance is a symmetric prametric on the index set <math>I</math>.
A third example is the non-symmetric prametric on the reals:
- <math>d(x,y)=\begin{cases}
|x-y| & \mbox{for } x\le y \\
1 & \mbox{for } x > y
\end{cases}</math>
The topology generated by this prametric (as described below) is that of the Sorgenfrey line.
The set <math>\{0,1\}</math> with the prametric <math>d(0,1)=1</math> and <math>d(1,0)=0</math> generates the connected two-point topology or Sierpinski space for this set. Thus, Sierpinski space is prametrizable but not metrizable.
[edit] Topology
For a prametric, define the ball as
- <math>B_r(p) = \{ x \in M \mid d(x,p) < r \}.</math>
At the most basic level, the definition of an open set for a prametric is as one might expect: every point must be an inner point with respect to this ball. That is, a subset <math>U\subset M</math> is defined to be open if and only if, for each point <math>p\in U</math>, there exists an <math>r>0</math> such that <math>B_r(p) \subset U</math>.
What is unusual is that any given ball need not be an open set. The set of balls will not typically be a base for the topology; to obtain a topology, one instead works with the collection of open sets, as defined above.
In general, the interior of a ball <math>B_r(p)</math> may fail to contain p, and the interior may even be empty; this is in sharp contrast to what one expects for a metric space.
Another unusual aspect is that a point in a closed set may have a distance from the closed set that is greater than zero. That is, if <math>\overline{A}\subset M</math> is a closed set, and <math>x\in\overline{A}</math>, it may not be true that <math>d(x,\overline{A})=0</math>. The converse does hold: if <math>d(x,\overline{A})=0</math>, then <math>x\in\overline{A}</math>. The set of points at distance zero from a set defines a kind of closure, a praclosure.
To be clear, in the above, a set <math>C\subset M</math> is defined to be closed if and only if <math>d(p,C)>0</math> for all <math>p\in M\backslash C</math>.
Such topologies do have some nice properties: a topological space with a topology generated by a prametric is a sequential space.
A topological space is said to be a prametrizable topological space if the space can be given a prametric such that the prametric topology coincides with the given topology on the space. With the additional appropriate axioms, one may say that a space is semimetrizable, quasimetrizable, etc.
[edit] Axioms
The following table shows the various special cases, according to applicable axioms:
| Triangle inequality | Distinguishability | Symmetry | Type |
|---|---|---|---|
| No | No | No | prametric space |
| No | No | Yes | symmetric prametric space |
| No | Yes | No | separating prametric space |
| No | Yes | Yes | semimetric space |
| Yes | No | No | hemimetric space |
| Yes | No | Yes | pseudometric space |
| Yes | Yes | No | quasimetric space |
| Yes | Yes | Yes | metric space |
[edit] References
- A.V. Arkhangelskii, L.S.Pontryagin, General Topology I, (1990) Springer-Verlag, Berlin. ISBN 3-540-18178-4

