Abstract
In this chapter we consider a special class of metrics defined on some normed structures, as the norm of the difference between two given elements. This structure can be a group (with a group norm), a vector space (with a vector norm or, simply, a norm), a vector lattice (with a Riesz norm), a field (with a valuation), etc.
Access provided by Autonomous University of Puebla. Download chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
In this chapter we consider a special class of metrics defined on some normed structures, as the norm of the difference between two given elements. This structure can be a group (with a group norm), a vector space (with a vector norm or, simply, a norm), a vector lattice (with a Riesz norm), a field (with a valuation), etc.
Any norm is subadditive, i.e., triangle inequality \(\vert \vert x + y\vert \vert \leq \vert \vert x\vert \vert + \vert \vert y\vert \vert\) holds. A norm is submultiplicative if multiplicative triangle inequality | | xy | | ≤ | | x | | | | y | | holds.
-
Group norm metric
A group norm metric is a metric on a group (G, +, 0) defined by
$$\displaystyle{\vert \vert x + (-y)\vert \vert = \vert \vert x - y\vert \vert,}$$where | | . | | is a group norm on G, i.e., a function \(\vert \vert.\vert \vert: G \rightarrow \mathbb{R}\) such that, for all x, y ∈ G, we have the following properties:
-
1.
| | x | | ≥ 0, with | | x | | = 0 if and only if x = 0;
-
2.
\(\vert \vert x\vert \vert = \vert \vert - x\vert \vert\);
-
3.
\(\vert \vert x + y\vert \vert \leq \vert \vert x\vert \vert + \vert \vert y\vert \vert\) (triangle inequality).
Any group norm metric d is right-invariant, i.e., \(d(x,y) = d(x + z,y + z)\) for any x, y, z ∈ G. Conversely, any right-invariant (as well as any left-invariant, and, in particular, any bi-invariant) metric d on G is a group norm metric, since one can define a group norm on G by | | x | | = d(x, 0).
-
1.
-
F -norm metric
A vector space (or linear space) over a field \(\mathbb{F}\) is a set V equipped with operations of vector addition \(+: V \times V \rightarrow V\) and scalar multiplication \(\cdot: \mathbb{F} \times V \rightarrow V\) such that (V, +, 0) forms an Abelian group (where 0 ∈ V is the zero vector), and, for all vectors x, y ∈ V and any scalars \(a,b \in \mathbb{F}\), we have the following properties: 1 ⋅ x = x (where 1 is the multiplicative unit of \(\mathbb{F}\)), (ab) ⋅ x = a ⋅ (b ⋅ x), \((a + b) \cdot x = a \cdot x + b \cdot x\), and \(a \cdot (x + y) = a \cdot x + a \cdot y\).
A vector space over the field \(\mathbb{R}\) of real numbers is called a real vector space. A vector space over the field \(\mathbb{C}\) of complex numbers is called complex vector space.
A F-norm metric is a metric on a real (complex) vector space V defined by
$$\displaystyle{\vert \vert x - y\vert \vert _{F},}$$where | | . | | F is an F-norm on V, i.e., a function \(\vert \vert.\vert \vert _{F}: V \rightarrow \mathbb{R}\) such that, for all x, y ∈ V and for any scalar a with | a | = 1, we have the following properties:
-
1.
| | x | | F ≥ 0, with | | x | | F = 0 if and only if x = 0;
-
2.
\(\vert \vert \mathit{ax}\vert \vert _{F} \leq \vert \vert x\vert \vert _{F}\) if | a | ≤ 1;
-
3.
\(\lim _{a\rightarrow 0}\vert \vert \mathit{ax}\vert \vert _{F} = 0\);
-
4.
\(\vert \vert x + y\vert \vert _{F} \leq \vert \vert x\vert \vert _{F} + \vert \vert y\vert \vert _{F}\) (triangle inequality).
An F-norm is called p-homogeneous if \(\vert \vert \mathit{ax}\vert \vert _{F} = \vert a\vert ^{p}\vert \vert x\vert \vert _{F}\) for any scalar a.
Any F-norm metric d is a translation invariant metric , i.e., \(d(x,y) = d(x + z,y + z)\) for all x, y, z ∈ V. Conversely, if d is a translation invariant metric on V, then | | x | | F = d(x, 0) is an F-norm on V.
-
1.
-
F ∗ -metric
An F ∗ -metric is an F-norm metric | | x − y | | F on a real (complex) vector space V such that the operations of scalar multiplication and vector addition are continuous with respect to | | . | | F . Thus | | . | | F is a function \(\vert \vert.\vert \vert _{F}: V \rightarrow \mathbb{R}\) such that, for all x, y, x n ∈ V and for all scalars a, a n , we have the following properties:
-
1.
| | x | | F ≥ 0, with | | x | | F = 0 if and only if x = 0;
-
2.
\(\vert \vert \mathit{ax}\vert \vert _{F} = \vert \vert x\vert \vert _{F}\) for all a with | a | = 1;
-
3.
\(\vert \vert x + y\vert \vert _{F} \leq \vert \vert x\vert \vert _{F} + \vert \vert y\vert \vert _{F}\);
-
4.
\(\vert \vert a_{n}x\vert \vert _{F} \rightarrow 0\) if a n → 0;
-
5.
\(\vert \vert \mathit{ax}_{n}\vert \vert _{F} \rightarrow 0\) if x n → 0;
-
6.
\(\vert \vert a_{n}x_{n}\vert \vert _{F} \rightarrow 0\) if a n → 0, x n → 0.
The metric space (V, | | x − y | | F ) with an F ∗-metric is called a nF ∗ -space . Equivalently, an F ∗-space is a metric space (V, d) with a translation invariant metric d such that the operation of scalar multiplication and vector addition are continuous with respect to this metric.
A complete F ∗-space is called an F -space . A locally convex F-space is known as a Fréchet space (cf. Chap. 2) in Functional Analysis.
A modular space is an F ∗-space (V, | | . | | F ) in which the F-norm | | . | | F is defined by
$$\displaystyle{\vert \vert x\vert \vert _{F} =\inf \{\lambda> 0:\rho \left (\frac{x} {\lambda } \right ) <\lambda \},}$$and ρ is a metrizing modular on V, i.e., a function ρ: V → [0, ∞] such that, for all x, y, x n ∈ V and for all scalars a, a n , we have the following properties:
-
1.
ρ(x) = 0 if and only if x = 0;
-
2.
ρ(ax) = ρ(x) implies | a | = 1;
-
3.
\(\rho (\mathit{ax} + \mathit{by}) \leq \rho (x) +\rho (y)\) implies \(a,b \geq 0,a + b = 1\);
-
4.
ρ(a n x) → 0 if a n → 0 and ρ(x) < ∞;
-
5.
ρ(ax n ) → 0 if ρ(x n ) → 0 (metrizing property);
-
6.
For any x ∈ V, there exists k > 0 such that ρ(kx) < ∞.
-
1.
-
Norm metric
A norm metric is a metric on a real (complex) vector space V defined by
$$\displaystyle{\vert \vert x - y\vert \vert,}$$where | | . | | is a norm on V, i.e., a function \(\vert \vert.\vert \vert: V \rightarrow \mathbb{R}\) such that, for all x, y ∈ V and for any scalar a, we have the following properties:
-
1.
| | x | | ≥ 0, with | | x | | = 0 if and only if x = 0;
-
2.
| | ax | | = | a | | | x | | ;
-
3.
\(\vert \vert x + y\vert \vert \leq \vert \vert x\vert \vert + \vert \vert y\vert \vert\) (triangle inequality).
Therefore, a norm | | . | | is a 1-homogeneous F-norm. The vector space (V, | | . | | ) is called a normed vector space or, simply, normed space.
Any metric space can be embedded isometrically in some normed vector space as a closed linearly independent subset. Every finite-dimensional normed space is complete, and all norms on it are equivalent.
In general, the norm | | . | | is equivalent (Maligranda, 2008) to the norm
$$\displaystyle{\vert \vert x\vert \vert _{u,p} = (\vert \vert x + \vert \vert x\vert \vert \cdot u\vert \vert ^{p} + \vert \vert x -\vert \vert x\vert \vert \cdot u\vert \vert ^{p})^{\frac{1} {p} },}$$introduced, for any u ∈ V and p ≥ 1, by Odell and Schlumprecht, 1998.
The norm-angular distance between x and y is defined (Clarkson, 1936) by
$$\displaystyle{d(x,y) = \vert \vert \frac{x} {\vert \vert x\vert \vert }- \frac{y} {\vert \vert y\vert \vert }\vert \vert.}$$The following sharpening of the triangle inequality (Maligranda, 2003) holds:
$$\displaystyle\begin{array}{rcl} & & \frac{\vert \vert x - y\vert \vert -\vert \vert \vert x\vert \vert -\vert \vert y\vert \vert \vert } {\min \{\vert \vert x\vert \vert,\vert \vert y\vert \vert \}} \leq d(x,y) \leq \frac{\vert \vert x - y\vert \vert + \vert \vert \vert x\vert \vert -\vert \vert y\vert \vert \vert } {\max \{\vert \vert x\vert \vert,\vert \vert y\vert \vert \}},\mbox{ i.e.,} {}\\ & & \qquad \quad (2 - d(x,-y))\min \{\vert \vert x\vert \vert,\vert \vert y\vert \vert \}\leq \vert \vert x\vert \vert + \vert \vert y\vert \vert -\vert \vert x + y\vert \vert {}\\ &&\qquad \qquad \qquad \quad \leq (2 - d(x,-y))\max \{\vert \vert x\vert \vert,\vert \vert y\vert \vert \}. {}\\ \end{array}$$Dragomir, 2004, call \(\vert \int _{a}^{b}f(x)\mathit{dx}\vert \leq \int _{a}^{b}\vert f(x)\vert \mathit{dx}\) continuous triangle inequality.
-
1.
-
Reverse triangle inequality
The triangle inequality \(\vert \vert x + y\vert \vert \leq \vert \vert x\vert \vert + \vert \vert y\vert \vert\) in a normed space (V, | | . | | ) is equivalent to the following inequality, for any \(x_{1},\ldots,x_{n} \in V\) with n ≥ 2:
$$\displaystyle{\vert \vert \sum _{i=1}^{n}x_{ i}\vert \vert \leq \sum _{i=1}^{n}\vert \vert x_{ i}\vert \vert.}$$If in the normed space (V, | | . | | ), for some C ≥ 1 one has
$$\displaystyle{C\vert \vert \sum _{i=1}^{n}x_{ i}\vert \vert \geq \sum _{i=1}^{n}\vert \vert x_{ i}\vert \vert,}$$then this inequality is called the reverse triangle inequality.
This term is used, sometimes, also for the inverse triangle inequality (cf. kinematic metric in Chap. 26) and for the eventual inequality Cd(x, z) ≥ d(x, y) + d(y, z) with C ≥ 1 in a metric space (X, d).
The triangle inequality \(\vert \vert x + y\vert \vert \leq \vert \vert x\vert \vert + \vert \vert y\vert \vert\), for any x, y ∈ V, in a normed space (V, | | . | | ) is, for any number q > 1, equivalent (Belbachir, Mirzavaziri and Moslenian, 2005) to the following inequality:
$$\displaystyle{\vert \vert x + y\vert \vert ^{q} \leq 2^{q-1}(\vert \vert x\vert \vert ^{q} + \vert \vert y\vert \vert ^{q}).}$$The parallelogram inequality \(\vert \vert x + y\vert \vert ^{2} \leq 2(\vert \vert x\vert \vert ^{2} + \vert \vert y\vert \vert ^{2})\) is the case q = 2 of above.
Given a number q, 0 < q ≤ 1, the norm is called q-subadditive if \(\vert \vert x + y\vert \vert ^{q} \leq \vert \vert x\vert \vert ^{q} + \vert \vert y\vert \vert ^{q}\) holds for x, y ∈ V.
-
Seminorm semimetric
A seminorm semimetric on a real (complex) vector space V is defined by
$$\displaystyle{\vert \vert x - y\vert \vert,}$$where | | . | | is a seminorm (or pseudo-norm) on V, i.e., a function \(\vert \vert.\vert \vert: V \rightarrow \mathbb{R}\) such that, for all x, y ∈ V and for any scalar a, we have the following properties:
-
1.
| | x | | ≥ 0, with | | 0 | | = 0;
-
2.
| | ax | | = | a | | | x | | ;
-
3.
\(\vert \vert x + y\vert \vert \leq \vert \vert x\vert \vert + \vert \vert y\vert \vert\) (triangle inequality).
The vector space (V, | | . | | ) is called a seminormed vector space. Many normed vector spaces, in particular, Banach spaces, are defined as the quotient space by the subspace of elements of seminorm zero.
A quasi-normed space is a vector space V, on which a quasi-norm is given. A quasi-norm on V is a nonnegative function \(\vert \vert.\vert \vert: V \rightarrow \mathbb{R}\) which satisfies the same axioms as a norm, except for the triangle inequality which is replaced by the weaker requirement: there exists a constant C > 0 such that, for all x, y ∈ V, the following C-triangle inequality (cf. near-metric in Chap. 1) holds:
$$\displaystyle{\vert \vert x + y\vert \vert \leq C(\vert \vert x\vert \vert + \vert \vert y\vert \vert )}$$An example of a quasi-normed space, that is not normed, is the Lebesgue space \(L_{p}(\Omega )\) with 0 < p < 1 in which a quasi-norm is defined by
$$\displaystyle{\vert \vert f\vert \vert = \left (\int _{\Omega }\vert f(x)\vert ^{p}\mathit{dx}\right )^{1/p},f \in L_{ p}(\Omega ).}$$ -
1.
-
Banach space
A Banach space (or B-space) is a complete metric space (V, | | x − y | | ) on a vector space V with a norm metric | | x − y | | . Equivalently, it is the complete normed space (V, | | . | | ). In this case, the norm | | . | | on V is called the Banach norm. Some examples of Banach spaces are:
-
1.
l p n -spaces, l p ∞ -spaces, 1 ≤ p ≤ ∞, \(n \in \mathbb{N}\);
-
2.
The space C of convergent numerical sequences with the norm \(\vert \vert x\vert \vert =\sup _{n}\vert x_{n}\vert\);
-
3.
The space C 0 of numerical sequences which converge to zero with the norm \(\vert \vert x\vert \vert =\max _{n}\vert x_{n}\vert\);
-
4.
The space C [a, b] p, 1 ≤ p ≤ ∞, of continuous functions on [a, b] with the L p -norm \(\vert \vert f\vert \vert _{p} = (\int _{a}^{b}\vert f(t)\vert ^{p}\mathit{dt})^{\frac{1} {p} }\);
-
5.
The space C K of continuous functions on a compactum K with the norm | | f | | = max t ∈ K | f(t) | ;
-
6.
The space (C [a, b])n of functions on [a, b] with continuous derivatives up to and including the order n with the norm \(\vert \vert f\vert \vert _{n} =\sum _{ k=0}^{n}\max _{a\leq t\leq b}\vert f^{(k)}(t)\vert\);
-
7.
The space \(C^{n}[I^{m}]\) of all functions defined in an m-dimensional cube that are continuously differentiable up to and including the order n with the norm of uniform boundedness in all derivatives of order at most n;
-
8.
The space M [a, b] of bounded measurable functions on [a, b] with the norm
$$\displaystyle{\vert \vert f\vert \vert = \mathit{ess}\sup _{a\leq t\leq b}\vert f(t)\vert =\inf _{e,\mu (e)=0}\sup _{t\in [a,b]\setminus e}\vert f(t)\vert;}$$ -
9.
The space \(A(\Delta )\) of functions analytic in the open unit disk \(\Delta =\{ z \in \mathbb{C}: \vert z\vert <1\}\) and continuous in the closed disk \(\overline{\Delta }\) with the norm \(\vert \vert f\vert \vert =\max _{z\in \overline{\Delta }}\vert f(z)\vert\);
-
10.
The Lebesgue spaces \(L_{p}(\Omega )\), 1 ≤ p ≤ ∞;
-
11.
The Sobolev spaces \(W^{k,p}(\Omega )\), \(\Omega \subset \mathbb{R}^{n}\), \(1 \leq p \leq \infty\), of functions f on \(\Omega\) such that f and its derivatives, up to some order k, have a finite L p -norm, with the norm \(\vert \vert f\vert \vert _{k,p} =\sum _{ i=0}^{k}\vert \vert f^{(i)}\vert \vert _{p}\);
-
12.
The Bohr space AP of almost periodic functions with the norm
$$\displaystyle{\vert \vert f\vert \vert =\sup _{-\infty <t<+\infty }\vert f(t)\vert.}$$
A finite-dimensional real Banach space is called a Minkowskian space. A norm metric of a Minkowskian space is called a Minkowskian metric (cf. Chap. 6). In particular, any l p -metric is a Minkowskian metric.
All n-dimensional Banach spaces are pairwise isomorphic; the set of such spaces becomes compact if one introduces the Banach–Mazur distance by \(d_{\mathit{BM}}(V,W) =\ln \inf _{T}\vert \vert T\vert \vert \cdot \vert \vert T^{-1}\vert \vert\), where the infimum is taken over all operators which realize an isomorphism \(T: V \rightarrow W\).
-
1.
-
l p -metric
The l p -metric \(d_{l_{p}}\), 1 ≤ p ≤ ∞, is a norm metric on \(\mathbb{R}^{n}\) (or on \(\mathbb{C}^{n}\)), defined by
$$\displaystyle{\vert \vert x - y\vert \vert _{p},}$$where the l p -norm | | . | | p is defined by
$$\displaystyle{\vert \vert x\vert \vert _{p} = (\sum _{i=1}^{n}\vert x_{ i}\vert ^{p})^{\frac{1} {p} }.}$$For p = ∞, we obtain \(\vert \vert x\vert \vert _{\infty } =\lim _{p\rightarrow \infty }\root{p}\of{\sum _{i=1}^{n}\vert x_{i}\vert ^{p}} =\max _{1\leq i\leq n}\vert x_{i}\vert\). The metric space \((\mathbb{R}^{n},d_{l_{p}})\) is abbreviated as \(l_{p}^{n}\) and is called l p n -space.
The l p -metric, 1 ≤ p ≤ ∞, on the set of all sequences \(x =\{ x_{n}\}_{n=1}^{\infty }\) of real (complex) numbers, for which the sum \(\sum _{i=1}^{\infty }\vert x_{i}\vert ^{p}\) (for p = ∞, the sum \(\sum _{i=1}^{\infty }\vert x_{i}\vert\)) is finite, is
$$\displaystyle{(\sum _{i=1}^{\infty }\vert x_{ i} - y_{i}\vert ^{p})^{\frac{1} {p} }.}$$For p = ∞, we obtain \(\max _{i\geq 1}\vert x_{i} - y_{i}\vert\). This metric space is abbreviated as \(l_{p}^{\infty }\) and is called l p ∞ -space.
Most important are l 1-, l 2- and l ∞ -metrics. Among l p -metrics, only l 1- and l ∞ -metrics are crystalline metrics , i.e., metrics having polygonal unit balls. On \(\mathbb{R}\) all l p -metrics coincide with the natural metric (cf. Chap. 12) | x − y | .
The l 2-norm \(\vert \vert (x_{1},x_{2})\vert \vert _{2} = \sqrt{x_{1 }^{2 } + x_{2 }^{2}}\) on \(\mathbb{R}^{2}\) is also called Pythagorean addition of the numbers x 1 and x 2. Under this commutative operation, \(\mathbb{R}\) form a semigroup, and \(\mathbb{R}_{\geq 0}\) form a monoid (semigroup with identity, 0).
-
Euclidean metric
The Euclidean metric (or Pythagorean distance , as-the-crow-flies distance , beeline distance ) d E is the metric on \(\mathbb{R}^{n}\) defined by
$$\displaystyle{\vert \vert x - y\vert \vert _{2} = \sqrt{(x_{1 } - y_{1 } )^{2 } +\ldots +(x_{n } - y_{n } )^{2}}.}$$It is the ordinary l 2 -metric on \(\mathbb{R}^{n}\). The metric space \((\mathbb{R}^{n},d_{E})\) is abbreviated as \(\mathbb{E}^{n}\) and is called Euclidean space “Euclidean space” stands for the case n = 3, as opposed, for n = 2, to Euclidean plane and, for n = 1, Euclidean (or real) line.
In fact, \(\mathbb{E}^{n}\) is an inner product space (and even a Hilbert space), i.e., \(d_{E}(x,y) = \vert \vert x - y\vert \vert _{2} = \sqrt{\langle x - y, x - y\rangle }\), where \(\langle x,y\rangle\) is the inner product on \(\mathbb{R}^{n}\) which is given in the Cartesian coordinate system by \(\langle x,y\rangle =\sum _{ i=1}^{n}x_{i}y_{i}\). In a standard coordinate system one has \(\langle x,y\rangle =\sum _{i,j}g_{ij}x_{i}y_{j}\), where \(g_{\mathit{ij}} =\langle e_{i},e_{j}\rangle\), and the metric tensor ((g ij )) (cf. Chap. 7) is a positive-definite symmetric n × n matrix.
In general, a Euclidean space is defined as a space, the properties of which are described by the axioms of Euclidean Geometry.
-
Norm transform metric
A norm transform metric is a metric d(x, y) on a vector space (V, | | . | | ), which is a function of | | x | | and | | y | . Usually, \(V = \mathbb{R}^{n}\) and, moreover, \(\mathbb{E}^{n} = (\mathbb{R}^{n},\vert \vert.\vert \vert _{2})\).
Some examples are (p,q)-relative metric, M-relative metric and, from Chap. 19, the British Rail metric | | x | | + | | y | | for x ≠ y, (and equal to 0, otherwise), the radar screen metric min{1, | | x − y | | } and max{1, | | x − y | | } for x ≠ y. Cf. t-truncated and t-uniformly discrete metrics in Chap. 4.
-
(p,q)-relative metric
Let 0 < q ≤ 1, and \(p \geq \max \{ 1 - q, \frac{2-q} {3} \}\). Let (V, | | . | | ) be a Ptolemaic space, i.e., the norm metric | | x − y | | is a Ptolemaic metric (cf. Chap. 1).
The (p,q)-relative metric on (V, | | . | | ) is defined, for x or y ≠ 0, by
$$\displaystyle{ \frac{\vert \vert x - y\vert \vert } {(\frac{1} {2}(\vert \vert x\vert \vert ^{p} + \vert \vert y\vert \vert ^{p}))^{\frac{q} {p} }}}$$(and equal to 0, otherwise). In the case of p = ∞, it has the form
$$\displaystyle{ \frac{\vert \vert x - y\vert \vert } {(\max \{\vert \vert x\vert \vert,\vert \vert y\vert \vert \})^{q}}.}$$(p, 1)-, (∞, 1)- and the original (1, 1)-relative metric on \(\mathbb{E}^{n}\) are called p-relative (or Klamkin–Meir metric ), relative metric and Schattschneider metric .
-
M-relative metric
Let f: [0, ∞) → (0, ∞) be a convex increasing function such that \(\frac{f(x)} {x}\) is decreasing for x > 0. Let (V, | | . | | ) be a Ptolemaic space, i.e., | | x − y | | is a Ptolemaic metric.
The M-relative metric on (V, | | . | | ) is defined by
$$\displaystyle{ \frac{\vert \vert x - y\vert \vert } {f(\vert \vert x\vert \vert ) \cdot f(\vert \vert y\vert \vert )}.}$$ -
Unitary metric
The unitary (or complex Euclidean) metric is the l 2 -metric on \(\mathbb{C}^{n}\) defined by
$$\displaystyle{\vert \vert x - y\vert \vert _{2} = \sqrt{\vert x_{1 } - y_{1 } \vert ^{2 } +\ldots +\vert x_{n } - y_{n } \vert ^{2}}.}$$For n = 1, it is the complex modulus metric \(\vert x - y\vert = \sqrt{(x - y)\overline{(x - y)}}\) on the Wessel–Argand plane (cf. Chap. 12).
-
L p -metric
An L p -metric \(d_{L_{p}}\), 1 ≤ p ≤ ∞, is a norm metric on \(L_{p}(\Omega,\mathcal{A},\mu )\) defined by
$$\displaystyle{\vert \vert f - g\vert \vert _{p}}$$for any \(f,g \in L_{p}(\Omega,\mathcal{A},\mu )\). The metric space \((L_{p}(\Omega,\mathcal{A},\mu ),d_{L_{p}})\) is called the L p -space (or Lebesgue space ).
Here \(\Omega\) is a set, and \(\mathcal{A}\) is n σ-algebra of subsets of \(\Omega\), i.e., a collection of subsets of \(\Omega\) satisfying the following properties:
-
1.
\(\Omega \in \mathcal{A}\);
-
2.
If \(A \in \mathcal{A}\), then \(\Omega \setminus A \in \mathcal{A}\);
-
3.
If \(A = \cup _{i=1}^{\infty }A_{i}\) with \(A_{i} \in \mathcal{A}\), then \(A \in \mathcal{A}\).
A function \(\mu: \mathcal{A}\rightarrow \mathbb{R}_{\geq 0}\) is called a measure on \(\mathcal{A}\) if it is additive, i.e., \(\mu (\cup _{i\geq 1}A_{i}) =\sum _{i\geq 1}\mu (A_{i})\) for all pairwise disjoint sets \(A_{i} \in \mathcal{A}\), and satisfies \(\mu (\varnothing ) = 0\). A measure space is a triple \((\Omega,\mathcal{A},\mu )\).
Given a function \(f: \Omega \rightarrow \mathbb{R}(\mathbb{C})\), its L p -norm is defined by
$$\displaystyle{\vert \vert f\vert \vert _{p} = \left (\int _{\Omega }\vert f(\omega )\vert ^{p}\mu (d\omega )\right )^{\frac{1} {p} }.}$$Let \(L_{p}(\Omega,\mathcal{A},\mu ) = L_{p}(\Omega )\) denote the set of all functions \(f: \Omega \rightarrow \mathbb{R}\) (\(\mathbb{C}\)) such that | | f | | p < ∞. Strictly speaking, \(L_{p}(\Omega,\mathcal{A},\mu )\) consists of equivalence classes of functions, where two functions are equivalent if they are equal almost everywhere, i.e., the set on which they differ has measure zero. The set \(L_{\infty }(\Omega,\mathcal{A},\mu )\) is the set of equivalence classes of measurable functions \(f: \Omega \rightarrow \mathbb{R}\) (\(\mathbb{C}\)) whose absolute values are bounded almost everywhere.
The most classical example of an L p -metric is \(d_{L_{p}}\) on the set \(L_{p}(\Omega,\mathcal{A},\mu )\), where \(\Omega\) is the open interval (0, 1), \(\mathcal{A}\) is the Borel σ-algebra on (0, 1), and μ is the Lebesgue measure. This metric space is abbreviated by L p (0, 1) and is called L p (0,1)-space.
In the same way, one can define the L p -metric on the set C [a, b] of all real (complex) continuous functions on [a, b]: \(d_{L_{p}}(f,g) = (\int _{a}^{b}\vert f(x) - g(x)\vert ^{p}\mathit{dx})^{\frac{1} {p} }\). For p = ∞, \(d_{L_{\infty }}(f,g) =\max _{a\leq x\leq b}\vert f(x) - g(x)\vert\). This metric space is abbreviated by C [a, b] p and is called \(C_{[a,b]}^{p}\) -space.
If \(\Omega = \mathbb{N}\), \(\mathcal{A} = 2^{\Omega }\) is the collection of all subsets of \(\Omega\), and μ is the cardinality measure ( i.e., μ(A) = | A | if A is a finite subset of \(\Omega\), and \(\mu (A) = \infty\), otherwise), then the metric space \((L_{p}(\Omega,2^{\Omega },\vert.\vert ),d_{L_{p}})\) coincides with the space l p ∞.
If \(\Omega = V _{n}\) is a set of cardinality n, \(\mathcal{A} = 2^{V _{n}}\), and μ is the cardinality measure, then the metric space \((L_{p}(V _{n},2^{V _{n}},\vert.\vert ),d_{L_{ p}})\) coincides with the space l p n.
-
1.
-
Dual metrics
The l p -metric and the l q -metric, 1 < p, q < ∞, are called dual if \(1/p + 1/q = 1\).
In general, when dealing with a normed vector space (V, | | . | | V ), one is interested in the continuous linear functionals from V into the base field (\(\mathbb{R}\) or \(\mathbb{C}\)). These functionals form a Banach space \((V ^{{\prime}},\vert \vert.\vert \vert _{V ^{{\prime}}})\), called the continuous dual of V. The norm \(\vert \vert.\vert \vert _{V ^{{\prime}}}\) on \(V ^{{\prime}}\) is defined by \(\vert \vert T\vert \vert _{V ^{{\prime}}} =\sup _{\vert \vert x\vert \vert _{V }\leq 1}\vert T(x)\vert\).
The continuous dual for the metric space l p n (\(l_{p}^{\infty }\)) is \(l_{q}^{n}\) (\(l_{q}^{\infty }\), respectively). The continuous dual of l 1 n (\(l_{1}^{\infty }\)) is \(l_{\infty }^{n}\) (\(l_{\infty }^{\infty }\), respectively). The continuous duals of the Banach spaces C (consisting of all convergent sequences, with l ∞ -metric) and C 0 (consisting of the sequences converging to zero, with l ∞ -metric) are both naturally identified with \(l_{1}^{\infty }\).
-
Inner product space
An inner product space (or pre-Hilbert space) is a metric space (V, | | x − y | | ) on a real (complex) vector space V with an inner product 〈x, y〉 such that the norm metric | | x − y | | is constructed using the inner product norm \(\vert \vert x\vert \vert = \sqrt{\langle x, x\rangle }\).
An inner product 〈, 〉 on a real (complex) vector space V is a symmetric bilinear (in the complex case, sesquilinear) form on V, i.e., a function \(\langle,\rangle: V \times V \longrightarrow \mathbb{R}\) (\(\mathbb{C}\)) such that, for all x, y, z ∈ V and for all scalars α, β, we have the following properties:
-
1.
〈x, x〉 ≥ 0, with 〈x, x〉 = 0 if and only if x = 0;
-
2.
\(\langle x,y\rangle = \overline{\langle y,x\rangle }\), where the bar denotes complex conjugation;
-
3.
\(\langle \alpha x +\beta y,z\rangle =\alpha \langle x,z\rangle +\beta \langle y,z\rangle\).
For a complex vector space, an inner product is called also a Hermitian inner product, and the corresponding metric space is called a Hermitian inner product space.
A norm | | . | | in a normed space (V, | | . | | ) is generated by an inner product if and only if, for all x, y ∈ V, we have: \(\vert \vert x + y\vert \vert ^{2} + \vert \vert x - y\vert \vert ^{2} = 2(\vert \vert x\vert \vert ^{2} + \vert \vert y\vert \vert ^{2})\).
In an inner product space, the triangle equality (Chap. 1) \(\vert \vert x - y\vert \vert = \vert \vert x\vert \vert + \vert \vert y\vert \vert\), for x, y ≠ 0, holds if and only if \(\frac{x} {\vert \vert x\vert \vert } = \frac{y} {\vert \vert y\vert \vert }\), i.e., x − y ∈ [x, y].
-
1.
-
Hilbert space
A Hilbert space is an inner product space which, as a metric space, is complete. More precisely, a Hilbert space is a complete metric space (H, | | x − y | | ) on a real (complex) vector space H with an inner product 〈, 〉 such that the norm metric | | x − y | | is constructed using the inner product norm \(\vert \vert x\vert \vert = \sqrt{\langle x, x\rangle }\). Any Hilbert space is a Banach space.
An example of a Hilbert space is the set of all sequences \(x =\{ x_{n}\}_{n}\) of real (complex) numbers such that \(\sum _{i=1}^{\infty }\vert x_{i}\vert ^{2}\) converges, with the Hilbert metric defined by
$$\displaystyle{(\sum _{i=1}^{\infty }(x_{ i} - y_{i})^{2})^{\frac{1} {2} }.}$$Other examples of Hilbert spaces are any L 2 -space, and any finite-dimensional inner product space. In particular, any Euclidean space is a Hilbert space.
A direct product of two Hilbert spaces is called a Liouville space (or line space, extended Hilbert space).
Given an infinite cardinal number τ and a set A of the cardinality τ, let \(\mathbb{R}_{a}\), a ∈ A, be the copies of \(\mathbb{R}\). Let \(H(A) =\{\{ x_{a}\} \in \prod _{a\in A}\mathbb{R}_{a}:\sum _{a}x_{a}^{2} <\infty \}\); then H(A) with the metric defined for \(\{x_{a}\},\{y_{a}\} \in H(A)\) as
$$\displaystyle{(\sum _{a\in A}(x_{a} - y_{a})^{2})^{\frac{1} {2} },}$$is called the generalized Hilbert space of weight τ.
-
Erdös space
The Erdös space (or rational Hilbert space) is the metric subspace of l 2 consisting of all vectors in l 2 with only rational coordinates. It has topological dimension 1 and is not complete. Erdös space is homeomorphic to its countable infinite power, and every nonempty open subset of it is homeomorphic to whole space.
The complete Erdös space (or irrational Hilbert space) is the complete metric subspace of l 2 consisting of all vectors in l 2 the coordinates of which are all irrational.
-
Riesz norm metric
A Riesz space (or vector lattice) is a partially ordered vector space (V Ri , ⪯) in which the following conditions hold:
-
1.
The vector space structure and the partial order structure are compatible, i.e., from x⪯ y it follows that \(x + z\preceq y + z\), and from x ≻ 0, \(a \in \mathbb{R}\), a > 0 it follows that ax ≻ 0;
-
2.
For any two elements x, y ∈ V Ri , there exist the join \(x \vee y \in V _{\mathit{Ri}}\) and meet x ∧ y ∈ V Ri (cf. Chap. 10).
The Riesz norm metric is a norm metric on V Ri defined by
$$\displaystyle{\vert \vert x - y\vert \vert _{\mathit{Ri}},}$$where | | . | | Ri is a Riesz norm on V Ri , i.e., a norm such that, for any x, y ∈ V Ri , the inequality | x | ⪯ | y | , where \(\vert x\vert = (-x) \vee (x)\), implies | | x | | Ri ≤ | | y | | Ri .
The space (V Ri , | | . | | Ri ) is called a normed Riesz space. In the case of completeness, it is called a Banach lattice.
-
1.
-
Banach–Mazur compactum
The Banach–Mazur distance d BM between two n-dimensional normed spaces (V, | | . | | V ) and (W, | | . | | W ) is defined by
$$\displaystyle{\ln \inf _{T}\vert \vert T\vert \vert \cdot \vert \vert T^{-1}\vert \vert,}$$where the infimum is taken over all isomorphisms T: V → W. It is a metric on the set X n of all equivalence classes of n-dimensional normed spaces, where V ∼ W if and only if they are isometric. Then the pair (X n, d BM ) is a compact metric space which is called the Banach–Mazur compactum.
-
Quotient metric
Given a normed space (V, | | . | | V ) with a norm | | . | | V and a closed subspace W of V, let \((V/W,\vert \vert.\vert \vert _{V/W})\) be the normed space of cosets \(x + W =\{ x + w: w \in W\}\), x ∈ V, with the quotient norm \(\vert \vert x + W\vert \vert _{V/W} =\inf _{w\in W}\vert \vert x + w\vert \vert _{V }\).
The quotient metric is a norm metric on V∕W defined by
$$\displaystyle{\vert \vert (x + W) - (y + W)\vert \vert _{V/W}.}$$ -
Tensor norm metric
Given normed spaces (V, | | . | | V ) and (W, | | . | | W ), a norm | | . | | ⊗ on the tensor product V ⊗ W is called tensor norm (or cross norm) if \(\vert \vert x \otimes y\vert \vert _{\otimes } = \vert \vert x\vert \vert _{V }\vert \vert y\vert \vert _{W}\) for all decomposable tensors x ⊗ y.
The tensor product metric is a norm metric on V ⊗ W defined by
$$\displaystyle{\vert \vert z - t\vert \vert _{\otimes }.}$$For any z ∈ V ⊗ W, \(z =\sum _{j}x_{j} \otimes y_{j}\), x j ∈ V, y j ∈ W, the projective norm (or π-norm) of z is defined by \(\vert \vert z\vert \vert _{\mathit{pr}} =\inf \sum _{j}\vert \vert x_{j}\vert \vert _{V }\vert \vert y_{j}\vert \vert _{W}\), where the infimum is taken over all representations of z as a sum of decomposable vectors. It is the largest tensor norm on V ⊗ W.
-
Valuation metric
A valuation metric is a metric on a field \(\mathbb{F}\) defined by
$$\displaystyle{\vert \vert x - y\vert \vert,}$$where | | . | | is a valuation on \(\mathbb{F}\), i.e., a function \(\vert \vert.\vert \vert: \mathbb{F} \rightarrow \mathbb{R}\) such that, for all \(x,y \in \mathbb{F}\), we have the following properties:
-
1.
| | x | | ≥ 0, with | | x | | = 0 if and only if x = 0;
-
2.
| | xy | | = | | x | | | | y | | ,
-
3.
\(\vert \vert x + y\vert \vert \leq \vert \vert x\vert \vert + \vert \vert y\vert \vert\) (triangle inequality).
If | | x + y | | ≤ max{ | | x | | , | | y | | }, the valuation | | . | | is called non-Archimedean. In this case, the valuation metric is an ultrametric. The simplest valuation is the trivial valuation \(\vert \vert.\vert \vert _{\mathit{tr}}\): \(\vert \vert 0\vert \vert _{\mathit{tr}} = 0\), and | | x | | tr = 1 for \(x \in \mathbb{F}\setminus \{0\}\). It is non-Archimedean.
There are different definitions of valuation in Mathematics. Thus, the function \(\nu: \mathbb{F} \rightarrow \mathbb{R} \cup \{\infty \}\) is called a valuation if ν(x) ≥ 0, ν(0) = ∞, \(\nu (\mathit{xy}) =\nu (x) +\nu (y)\), and ν(x + y) ≥ min{ν(x), ν(y)} for all \(x,y \in \mathbb{F}\). The valuation | | . | | can be obtained from the function ν by the formula | | x | | = α ν(x) for some fixed 0 < α < 1 (cf. p-adic metric in Chap. 12).
The Kürschäk valuation | . | Krs is a function \(\vert.\vert _{\mathit{Krs}}: \mathbb{F} \rightarrow \mathbb{R}\) such that | x | Krs ≥ 0, | x | Krs = 0 if and only if x = 0, \(\vert \mathit{xy}\vert _{\mathit{Krs}} = \vert x\vert _{\mathit{Krs}}\vert y\vert _{\mathit{Krs}}\), and \(\vert x + y\vert _{\mathit{Krs}} \leq C\max \{\vert x\vert _{\mathit{Krs}},\vert y\vert _{\mathit{Krs}}\}\) for all \(x,y \in \mathbb{F}\) and for some positive constant C, called the constant of valuation. If C ≤ 2, one obtains the ordinary valuation | | . | | which is non-Archimedean if C ≤ 1. In general, any | . | Krs is equivalent to some | | . | | , i.e., | . | Krs p = | | . | | for some p > 0.
Finally, given an ordered group (G, ⋅ , e, ≤ ) equipped with zero, the Krull valuation is a function \(\vert.\vert: \mathbb{F} \rightarrow G\) such that | x | = 0 if and only if x = 0, | xy | = | x | | y | , and | x + y | ≤ max{ | x | , | y | } for any \(x,y \in \mathbb{F}\). It is a generalization of the definition of non-Archimedean valuation | | . | | (cf. generalized metric in Chap. 3).
-
1.
-
Power series metric
Let \(\mathbb{F}\) be an arbitrary algebraic field, and let \(\mathbb{F}\langle x^{-1}\rangle\) be the field of power series of the form \(w =\alpha _{-m}x^{m} +\ldots +\alpha _{0} +\alpha _{1}x^{-1}+\ldots\), \(\alpha _{i} \in \mathbb{F}\). Given l > 1, a non-Archimedean valuation | | . | | on \(\mathbb{F}\langle x^{-1}\rangle\) is defined by
$$\displaystyle{\vert \vert w\vert \vert = \left \{\begin{array}{ccc} l^{m},&\mbox{ if }& w\neq 0, \\ 0, &\mbox{ if }&w = 0.\end{array} \right.}$$The power series metric is the valuation metric | | w − v | | on \(\mathbb{F}\langle x^{-1}\rangle\).
References
Abels H. The Gallery Distance of Flags, Order, Vol. 8, pp. 77–92, 1991.
Aichholzer O., Aurenhammer F. and Hurtado F. Edge Operations on Non-crossing Spanning Trees, Proc. 16-th European Workshop on Computational Geometry CG’2000, pp. 121–125, 2000.
Aichholzer O., Aurenhammer F., Chen D.Z., Lee D.T., Mukhopadhyay A. and Papadopoulou E. Voronoi Diagrams for Direction-sensitive Distances, Proc. 13th Symposium on Computational Geometry, ACM Press, New York, 1997.
Akerlof G.A. Social Distance and Social Decisions, Econometrica, Vol. 65-5, pp. 1005–1027, 1997.
Amari S. Differential-geometrical Methods in Statistics, Lecture Notes in Statistics, Springer-Verlag, 1985.
Ambartzumian R. A Note on Pseudo-metrics on the Plane, Z. Wahrsch. Verw. Gebiete, Vol. 37, pp. 145–155, 1976.
Arnold R. and Wellerding A. On the Sobolev Distance of Convex Bodies, Aeq. Math., Vol. 44, pp. 72–83, 1992.
Baddeley A.J. Errors in Binary Images and an L p Version of the Hausdorff Metric, Nieuw Archief voor Wiskunde, Vol. 10, pp. 157–183, 1992.
Baier R. and Farkhi E. Regularity and Integration of Set-Valued Maps Represented by Generalized Steiner Points Set-Valued Analysis, Vol. 15, pp. 185–207, 2007.
Barabási A.L. The Physics of the Web, Physics World, July 2001.
Barbaresco F. Information Geometry of Covariance Matrix: Cartan-Siegel Homogenous Bounded Domains, Mostow-Berger Fibration and Fréchet Median, in Matrix Information Geometry, Bhatia R. and Nielsen F. (eds.) Springer, 2012.
Barbilian D. Einordnung von Lobayschewskys Massenbestimmung in either Gewissen Allgemeinen Metrik der Jordansche Bereiche, Casopis Mathematiky a Fysiky, Vol. 64, pp. 182–183, 1935.
Barceló C., Liberati S. and Visser M. Analogue Gravity, Living Rev. Rel. Vol. 8, 2005; arXiv: gr-qc/0505065, 2005.
Bartal Y., Linial N., Mendel M. and Naor A. Some Low Distortion Metric Ramsey Problems, Discrete and Computational Geometry, Vol. 33, pp. 27–41, 2005.
Basseville M. Distances measures for signal processing and pattern recognition, Signal Processing, Vol. 18, pp. 349–369, 1989.
Basseville M. Distances measures for statistical data processing – An annotated bibliography, Signal Processing, Vol. 93, pp. 621–633, 2013.
Batagelj V. Norms and Distances over Finite Groups, J. of Combinatorics, Information and System Sci., Vol. 20, pp. 243–252, 1995.
Beer G. On Metric Boundedness Structures, Set-Valued Analysis, Vol. 7, pp. 195–208, 1999.
Bennet C.H., Gács P., Li M., Vitánai P.M.B. and Zurek W. Information Distance, IEEE Transactions on Information Theory, Vol. 44-4, pp. 1407–1423, 1998.
Berrou C., Glavieux A. and Thitimajshima P. Near Shannon Limit Error-correcting Coding and Decoding: Turbo-codes, Proc. of IEEE Int. Conf. on Communication, pp. 1064–1070, 1993.
Blanchard F., Formenti E. and Kurka P. Cellular Automata in the Cantor, Besicovitch and Weyl Topological Spaces, Complex Systems, Vol. 11, pp. 107–123, 1999.
Bloch I. On fuzzy distances and their use in image processing under unprecision, Pattern Recognition, Vol. 32, pp. 1873–1895, 1999.
Block H.W., Chhetry D., Fang Z. and Sampson A.R. Metrics on Permutations Useful for Positive Dependence, J. of Statistical Planning and Inference, Vol. 62, pp. 219–234, 1997.
Blumenthal L.M. Theory and Applications of Distance Geometry, Chelsea Publ., New York, 1970.
Borgefors G. Distance Transformations in Digital Images, Comp. Vision, Graphic and Image Processing, Vol. 34, pp. 344–371, 1986.
Bramble D.M. and Lieberman D.E. Endurance Running and the Evolution of Homo, Nature, Vol. 432, pp. 345–352, 2004.
O’Brien C. Minimization via the Subway metric, Honor Thesis, Dept. of Math., Ithaca College, New York, 2003.
Broder A.Z., Kumar S. R., Maaghoul F., Raghavan P., Rajagopalan S., Stata R., Tomkins A. and Wiener G. Graph Structure in the Web: Experiments and Models, Proc. 9-th WWW Conf., Amsterdam, 2000.
Brualdi R.A., Graves J.S. and Lawrence K.M. Codes with a Poset Metric, Discrete Math., Vol. 147, pp. 57–72, 1995.
Bryant V. Metric Spaces: Iteration and Application, Cambridge Univ. Press, 1985.
Buckley F. and Harary F. Distance in Graphs, Redwood City, CA: Addison-Wesley, 1990.
Bullough E. “Psychical Distance” as a Factor in Art and as an Aesthetic Principle, British J. of Psychology, Vol. 5, pp. 87–117, 1912.
Burago D., Burago Y. and Ivanov S. A Course in Metric Geometry, Amer. Math. Soc., Graduate Studies in Math., Vol. 33, 2001.
Busemann H. and Kelly P.J. Projective Geometry and Projective Metrics, Academic Press, New York, 1953.
Busemann H. The Geometry of Geodesics, Academic Press, New York, 1955.
Busemann H. and Phadke B.B. Spaces with Distinguished Geodesics, Marcel Dekker, New York, 1987.
Cairncross F. The Death of Distance 2.0: How the Communication Revolution will Change our Lives, Harvard Business School Press, second edition, 2001.
Calude C.S., Salomaa K. and Yu S. Metric Lexical Analysis, Springer-Verlag, 2001.
Cameron P.J. and Tarzi S. Limits of cubes, Topology and its Appl., Vol. 155, pp. 1454–1461, 2008.
Carmi S., Havlin S., Kirkpatrick S., Shavitt Y. and Shir E. A model of internet topology using k-shell decomposition, Proc. Nat. Acad. Sci., Vol. 104, pp. 11150–11154, 2007.
Cha S.-H. Taxonomy of nominal type histogram distance measures, Proc. American Conf. on Appl, Math., World Scientific and Engineering Academy and Society (WREAS) Stevens Point, Wisconsin, US, pp. 325–330, 2008.
Cheng Y.C. and Lu S.Y. Waveform Correlation by Tree Matching, IEEE Trans. Pattern Anal. Machine Intell., Vol. 7, pp. 299–305, 1985.
Chentsov N.N. Statistical Decision Rules and Optimal Inferences, Nauka, Moscow, 1972.
Chepoi V. and Fichet B. A Note on Circular Decomposable Metrics, Geom. Dedicata, Vol. 69, pp. 237–240, 1998.
Choi S.W. and Seidel H.-P. Hyperbolic Hausdorff Distance for Medial Axis Transform, Research Report MPI-I-2000-4-003 of Max-Planck-Institute für Informatik, 2000.
Coifman R.R., Lafon S., A.B., Maggioni M., Nadler B., Warner F., Zucker S.W. Geometric diffusions as a tool for harmonic analysis and structure definition of data: Diffusion maps, Proc. of the National Academy of Sciences, Vol. 102, No. 21, pp. 7426–7431, 2005.
Collado M.D., Ortuno-Ortin I. and Romeu A. Vertical Transmission of Consumption Behavior and the Distribution of Surnames, mimeo, Universidad de Alicante, 2005.
Copson E.T. Metric Spaces, Cambridge Univ. Press, 1968.
Corazza P. Introduction to metric-preserving functions, Amer. Math. Monthly, Vo. 104, pp. 309–323, 1999.
Cormode G. Sequence Distance Embedding, PhD Thesis, Univ. of Warwick, 2003.
Critchlow D.E., Pearl D.K. and Qian C. The Triples Distance for Rooted Bifurcating Phylogenetic Trees, Syst. Biology, Vol. 45, pp. 323–334, 1996.
Croft W. B., Cronon-Townsend S. and Lavrenko V. Relevance Feedback and Personalization: A Language Modeling Perspective, in DELOS-NSF Workshop on Personalization and Recommender Systems in Digital Libraries, pp. 49–54, 2001.
Cuijpers R.H., Kappers A.M.L and Koenderink J.J. The metrics of visual and haptic space based on parallelity judgements, J. Math. Psychology, Vol. 47, pp. 278–291, 2003.
Das P.P. and Chatterji B.N. Knight’s Distance in Digital Geometry, Pattern Recognition Letters, Vol. 7, pp. 215–226, 1988.
Das P.P. Lattice of Octagonal Distances in Digital Geometry, Pattern Recognition Letters, Vol. 11, pp. 663–667, 1990.
Das P.P. and Mukherjee J. Metricity of Super-knight’s Distance in Digital Geometry, Pattern Recognition Letters, Vol. 11, pp. 601–604, 1990.
Dauphas N. The U/Th Production Ratio and the Age of the Milky Way from Meteorites and Galactic Halo Stars, Nature, Vol. 435, pp. 1203–1205, 2005.
Day W.H.E. The Complexity of Computing Metric Distances between Partitions, Math. Social Sci., Vol. 1, pp. 269–287, 1981.
Deza M.M. and Dutour M. Voronoi Polytopes for Polyhedral Norms on Lattices, arXiv:1401.0040 [math.MG], 2013.
Deza M.M. and Dutour M. Cones of Metrics, Hemi-metrics and Super-metrics, Ann. of European Academy of Sci., pp. 141–162, 2003.
Deza M. and Huang T. Metrics on Permutations, a Survey, J. of Combinatorics, Information and System Sci., Vol. 23, Nrs. 1–4, pp. 173–185, 1998.
Deza M.M. and Laurent M. Geometry of Cuts and Metrics, Springer, 1997.
Deza M.M., Petitjean M. and Matkov K. (eds) Mathematics of Distances and Applications, ITHEA, Sofia, 2012.
Ding L. and Gao S. Graev metric groups and Polishable subgroups, Advances in Mathematics, Vol. 213, pp. 887–901, 2007.
Ehrenfeucht A. and Haussler D. A New Distance Metric on Strings Computable in Linear Time, Discrete Appl. Math., Vol. 20, pp. 191–203, 1988.
Encyclopedia of Math., Hazewinkel M. (ed.), Kluwer Academic Publ., 1998. Online edition: http://eom.springer.de/default.htm
Ernvall S. On the Modular Distance, IEEE Trans. Inf. Theory, Vol. 31-4, pp. 521–522, 1985.
Estabrook G.F., McMorris F.R. and Meacham C.A. Comparison of Undirected Phylogenetic Trees Based on Subtrees of Four Evolutionary Units, Syst. Zool, Vol. 34, pp. 193–200, 1985.
Farrán J.N. and Munuera C. Goppa-like Bounds for the Generalized Feng-Rao Distances, Discrete Appl. Math., Vol. 128, pp. 145–156, 2003.
Fazekas A. Lattice of Distances Based on 3D-neighborhood Sequences, Acta Math. Academiae Paedagogicae Nyiregyháziensis, Vol. 15, pp. 55–60, 1999.
Feng J. and Wang T.M. Characterization of protein primary sequences based on partial ordering, J. Theor. Biology, Vol. 254, pp. 752–755, 2008.
Fellous J-M. Gender Discrimination and Prediction on the Basis of Facial Metric Information, Vision Research, Vol. 37, pp. 1961–1973, 1997.
Ferguson N. Empire: The Rise and Demise of the British World Order and Lessons for Global Power, Basic Books, 2003.
Foertsch T. and Schroeder V. Hyperbolicity, CAT( − 1)-spaces and the Ptolemy Inequality, Math. Ann., Vol. 350, pp. 339–356, 2011.
Frankild A. and Sather-Wagstaff S. The set of semidualizing complexes is a nontrivial metric space, J. Algebra, Vol. 308, pp. 124–143, 2007.
Frieden B.R. Physics from Fisher information, Cambridge Univ. Press, 1998.
Gabidulin E.M. and Simonis J. Metrics Generated by Families of Subspaces, IEEE Transactions on Information Theory, Vol. 44-3, pp. 1136–1141, 1998.
Giles J.R. Introduction to the Analysis of Metric Spaces, Australian Math. Soc. Lecture Series, Cambridge Univ. Press, 1987.
Godsil C.D. and McKay B.D. The Dimension of a Graph, Quart. J. Math. Oxford Series (2), Vol. 31, pp. 423–427, 1980.
Goh K.I., Oh E.S., Jeong H., Kahng B. and Kim D. Classification of Scale Free Networks, Proc. Nat. Acad. Sci. US, Vol. 99, pp. 12583–12588, 2002.
Goppa V.D. Rational Representation of Codes and (L,g)-codes, Probl. Peredachi Inform., Vol. 7-3, pp. 41–49, 1971.
Gotoh O. An Improved Algorithm for Matching Biological Sequences, J. of Molecular Biology, Vol. 162, pp. 705–708, 1982.
Grabowski R., Khosa P. and Choset H. Development and Deployment of a Line of Sight Virtual Sensor for Heterogeneous Teams, Proc. IEEE Int. Conf. on Robotics and Automation, New Orleans, 2004.
Gruber P.M. The space of Convex Bodies in Handbook of Convex Geometry, Gruber P.M. and Wills J.M. (eds.), Elsevier Sci. Publ., 1993.
Hafner J., Sawhney H.S., Equitz W., Flickner M. and Niblack W. Efficient Color Histogram Indexing for Quadratic Form Distance Functions, IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 17-7, pp. 729–736, 1995.
Hall E.T. The Hidden Dimension, Anchor Books, New York, 1969.
Hamilton W.R. Elements of Quaternions, second edition 1899–1901 enlarged by C.J. Joly, reprinted by Chelsea Publ., New York, 1969.
Harispe S., Ranwez S., Janaqi S. and Montmain J. Semantic Measures for the Comparison of Units of Language, Concepts or Instances from Text and Knowledge Base Analysis, arXiv:1310.1285[cs.CL], 2013.
Head K. and Mayer T. Illusory Border Effects: Distance mismeasurement inflates estimates of home bias in trade, CEPII Working Paper No 2002-01, 2002.
Hemmerling A. Effective Metric Spaces and Representations of the Reals, Theoretical Comp. Sci., Vol. 284-2, pp. 347–372, 2002.
Higham N.J. Matrix Nearness Problems and Applications, in Applications of Matrix Theory, Gover M.J.C. and Barnett S. (eds.), pp. 1–27. Oxford University Press, 1989.
Hofstede G. Culture’s Consequences: International Differences in Work-related Values, Sage Publ., California, 1980.
Huber K. Codes over Gaussian Integers, IEEE Trans. Inf. Theory, Vol. 40-1, pp. 207–216, 1994.
Huber K. Codes over Eisenstein-Jacobi Integers, Contemporary Math., Vol. 168, pp. 165–179, 1994.
Huffaker B., Fomenkov M., Plummer D.J., Moore D. and Claffy K., Distance Metrics in the Internet, Proc. IEEE Int. Telecomm. Symp. (ITS-2002), 2002.
Indyk P. and Venkatasubramanian S. Approximate Congruence in Nearly Linear Time, Proc. 11th ACM-SIAM symposium on Discrete Algorithms, pp. 354–260, San Francisco, 2000.
Isbell J. Six Theorems about Metric Spaces, Comment. Math. Helv., Vol. 39, pp. 65–74, 1964.
Isham C.J., Kubyshin Y. and Penteln P. Quantum Norm Theory and the Quantization of Metric Topology, Class. Quantum Gravity, Vol. 7, pp. 1053–1074, 1990.
Ivanova R. and Stanilov G. A Skew-symmetric Curvature Operator in Riemannian Geometry, in Symposia Gaussiana, Conf. A, Behara M., Fritsch R. and Lintz R. (eds.), pp. 391–395, 1995.
Jiang T., Wang L. and Zhang K. Alignment of Trees – an Alternative to Tree Edit, in Combinatorial Pattern Matching, Lecture Notes in Comp. Science, Vol. 807, Crochemore M. and Gusfield D. (eds.), Springer-Verlag, 1994.
Klein R. Voronoi Diagrams in the Moscow Metric, Graphtheoretic Concepts in Comp. Sci., Vol. 6, pp. 434–441, 1988.
Klein R. Concrete and Abstract Voronoi Diagrams, Lecture Notes in Comp. Sci., Springer-Verlag, 1989.
Klein D.J. and Randic M. Resistance distance, J. of Math. Chemistry, Vol. 12, pp. 81–95, 1993.
Koella J.C. The Spatial Spread of Altruism Versus the Evolutionary Response of Egoists, Proc. Royal Soc. London, Series B, Vol. 267, pp. 1979–1985, 2000.
Kogut B. and Singh H. The Effect of National Culture on the Choice of Entry Mode, J. of Int. Business Studies, Vol. 19-3, pp. 411–432, 1988.
Kosheleva O., Kreinovich V. and Nguyen H.T. On the Optimal Choice of Quality Metric in Image Compression, Fifth IEEE Southwest Symposium on Image Analysis and Interpretation, 7–9 April 2002, Santa Fe, IEEE Comp. Soc. Digital Library, Electronic edition, pp. 116–120, 2002.
Larson R.C. and Li V.O.K. Finding Minimum Rectilinear Distance Paths in the Presence of Barriers, Networks, Vol. 11, pp. 285–304, 1981.
Li M., Chen X., Li X., Ma B. and Vitányi P. The Similarity Metric, IEEE Trans. Inf. Theory, Vol. 50-12, pp. 3250–3264, 2004.
Luczak E. and Rosenfeld A. Distance on a Hexagonal Grid, IEEE Trans. on Comp., Vol. 25-5, pp. 532–533, 1976.
Mak King-Tim and Morton A.J. Distances between Traveling Salesman Tours, Discrete Appl. Math., Vol. 58, pp. 281–291, 1995.
Martin K. A foundation for computation, Ph.D. Thesis, Tulane University, Department of Math., 2000.
Martin W.J. and Stinson D.R. Association Schemes for Ordered Orthogonal Arrays and (T, M, S)-nets, Can. J. Math., Vol. 51, pp. 326–346, 1999.
Mascioni V. Equilateral Triangles in Finite Metric Spaces, The Electronic J. Combinatorics, Vol. 11, 2004, R18.
S.G. Matthews, Partial metric topology, Research Report 212, Dept. of Comp. Science, University of Warwick, 1992.
McCanna J.E. Multiply-sure Distances in Graphs, Congressus Numerantium, Vol. 97, pp. 71–81, 1997.
Melter R.A. A Survey of Digital Metrics, Contemporary Math., Vol. 119, 1991.
Monjardet B. On the Comparison of the Spearman and Kendall Metrics between Linear Orders, Discrete Math., Vol. 192, pp. 281–292, 1998.
Morgan J.H. Pastoral ecstasy and the authentic self: Theological meanings in symbolic distance, Pastoral Psychology, Vol. 25-2, pp. 128–137, 1976.
Mucherino A., Lavor C., Liberti L. and Maculan N. (eds.) Distance Geometry, Springer, 2013.
Murakami H. Some Metrics on Classical Knots, Math. Ann., Vol. 270, pp. 35–45, 1985.
Needleman S.B. and Wunsh S.D. A general Method Applicable to the Search of the Similarities in the Amino Acids Sequences of Two Proteins, J. of Molecular Biology, Vol. 48, pp. 443–453, 1970.
Nishida T. and Sugihara K. FEM-like Fast Marching Method for the Computation of the Boat-Sail Distance and the Associated Voronoi Diagram, Technical Reports, METR 2003-45, Dept. Math. Informatics, The University of Tokyo, 2003.
Okabe A., Boots B. and Sugihara K. Spatial Tessellation: Concepts and Applications of Voronoi Diagrams, Wiley, 1992.
Okada D. and M. Bingham P.M. Human uniqueness-self-interest and social cooperation, J. Theor. Biology, Vol. 253-2, pp. 261–270, 2008.
Oliva D., Samengo I., Leutgeb S. and Mizumori S. A Subjective Distance between Stimuli: Quantifying the Metric Structure of Representations, Neural Computation, Vol. 17-4, pp. 969–990, 2005.
Ong C.J. and Gilbert E.G. Growth distances: new measures for object separation and penetration, IEEE Transactions in Robotics and Automation, Vol. 12-6, pp. 888–903, 1996.
Ophir A. and Pinchasi R. Nearly equal distances in metric spaces, Discrete Appl. Math., Vol. 174, pp. 122–127, 2014.
Orlicz W. Über eine Gewisse Klasse von Raumen vom Typus B ′, Bull. Int. Acad. Pol. Series A, Vol. 8–9, pp. 207–220, 1932.
Ozer H., Avcibas I., Sankur B. and Memon N.D. Steganalysis of Audio Based on Audio Quality Metrics, Security and Watermarking of Multimedia Contents V (Proc. of SPIEIS and T), Vol. 5020, pp. 55–66, 2003.
Page E.S. On Monte-Carlo Methods in Congestion Problem. 1. Searching for an Optimum in Discrete Situations, J. Oper. Res., Vol. 13-2, pp. 291–299, 1965.
Petz D. Monotone Metrics on Matrix Spaces, Linear Algebra Appl., Vol. 244, 1996.
PlanetMath.org, http://planetmath.org/encyclopedia/
Rachev S.T. Probability Metrics and the Stability of Stochastic Models, Wiley, New York, 1991.
Requardt M. and Roy S. Quantum Spacetime as a Statistical Geometry of Fuzzy Lumps and the Connection with Random Metric Spaces, Class. Quantum Gravity, Vol. 18, pp. 3039–3057, 2001.
Resnikoff H.I. On the geometry of color perception, AMS Lectures on Math. in the Life Sciences, Vol. 7, pp. 217–232, 1974.
Ristad E. and Yianilos P. Learning String Edit Distance, IEEE Transactions on Pattern Recognition and Machine Intelligence, Vol. 20-5, pp. 522–532, 1998.
Rocher T., Robine M., Hanna P. and Desainte-Catherine M. A Survey of Chord Distances With Comparison for Chord Analysis, Proc. Int. Comp. Music Conf., pp. 187–190, New York, 2010.
Rosenfeld A. and Pfaltz J. Distance Functions on Digital Pictures, Pattern Recognition, Vol. 1, pp. 33–61, 1968.
Rubner Y., Tomasi C. and Guibas L.J. The Earth Mover’s Distance as a Metric for Image Retrieval, Int. J. of Comp. Vision, Vol. 40-2, pp. 99–121, 2000.
Rummel R.J. Understanding Conflict and War, Sage Publ., California, 1976.
Schweizer B. and Sklar A. Probabilistic Metric Spaces, North-Holland, 1983.
Selkow S.M. The Tree-to-tree Editing Problem, Inform. Process. Lett., Vol. 6-6, pp. 184–186, 1977.
Sharma B.D. and Kaushik M.L. Limits intensity random and burst error codes with class weight considerations, Elektron. Inform.-verarb. Kybernetik, Vol. 15, pp. 315–321, 1979.
Tai K.-C. The Tree-to-tree Correction Problem, J. of the Association for Comp. Machinery, Vol. 26, pp. 422–433, 1979.
Tailor B. Introduction: How Far, How Near: Distance and Proximity in the Historical Imagination, History Workshop J., Vol. 57, pp. 117–122, 2004.
Tymoczko D. The Geometry of Musical Chords, Science, Vol. 313, Nr. 5783, pp. 72–74, 2006.
Tomimatsu A. and Sato H. New Exact Solution for the Gravitational Field of a Spinning Mass, Phys. Rev. Letters, Vol. 29, pp. 1344–1345, 1972.
Vardi Y. Metrics Useful in Network Tomography Studies, Signal Processing Letters, Vol. 11-3, pp. 353–355, 2004.
Veltkamp R.C. and Hagendoorn M. State-of-the-Art in Shape Matching, in Principles of Visual Information Retrieval, Lew M. (ed.), pp. 87–119, Springer-Verlag, 2001.
Watts D.J. Small Worlds: The Dynamics of Networks between Order and Randomness, Princeton Univ. Press, 1999.
Weinberg S. Gravitation and Cosmology: Principles and Applications of the General Theory of Relativity, Wiley, New York, 1972.
Weisstein E.W. CRC Concise Encyclopedia of Math., CRC Press, 1999.
Weiss I. Metric 1-spaces, arXiv:1201.3980[math.MG], 2012.
Wellens R.A. Use of a Psychological Model to Assess Differences in Telecommunication Media, in Teleconferencing and Electronic Communication, Parker L.A. and Olgren O.H. (eds.), pp. 347–361, Univ. of Wisconsin Extension, 1986.
Wikipedia, the Free Encyclopedia, http://en.wikipedia.org
Wilson D.R. and Martinez T.R. Improved Heterogeneous Distance Functions, J. of Artificial Intelligence Research, Vol. 6, p. 134, 1997.
Wolf S. and Pinson M.H. Spatial-Temporal Distortion Metrics for In-Service Quality Monitoring of Any Digital Video System, Proc. of SPIE Int. Symp. on Voice, Video, and Data Commun., September 1999.
Yianilos P.N. Normalized Forms for Two Common Metrics, NEC Research Institute, Report 91-082-9027-1, 1991.
Young N. Some Function-Theoretic Issues in Feedback Stabilisation, Holomorphic Spaces, MSRI Publication, Vol. 33, 1998.
Yutaka M., Ohsawa Y. and Ishizuka M. Average-Clicks: A New Measure of Distance on the World Wide Web, J. Intelligent Information Systems, Vol. 20-1, pp. 51–62, 2003.
Zelinka B. On a Certain Distance between Isomorphism Classes of Graphs, Casopus. Pest. Mat., Vol. 100, pp. 371–373, 1975.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Deza, M.M., Deza, E. (2014). Metrics on Normed Structures. In: Encyclopedia of Distances. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-44342-2_5
Download citation
DOI: https://doi.org/10.1007/978-3-662-44342-2_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-44341-5
Online ISBN: 978-3-662-44342-2
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)