Abstract
Here we consider the most important metrics on the classical number systems: the semiring \(\mathbb{N}\) of natural numbers, the ring \(\mathbb{Z}\) of integers, and the fields \(\mathbb{Q}\), \(\mathbb{R}\), \(\mathbb{C}\) of rational, real, complex numbers, respectively.
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.
1 Metrics on Numbers
Here we consider the most important metrics on the classical number systems: the semiring \(\mathbb{N}\) of natural numbers, the ring \(\mathbb{Z}\) of integers, and the fields \(\mathbb{Q}\), \(\mathbb{R}\), \(\mathbb{C}\) of rational, real, complex numbers, respectively. We consider also the algebra \(\mathcal{Q}\) of quaternions.
-
Metrics on natural numbers
There are several well-known metrics on the set \(\mathbb{N}\) of natural numbers:
-
1.
| n − m | ; the restriction of the natural metric (from \(\mathbb{R}\)) on \(\mathbb{N}\);
-
2.
p −α, where α is the highest power of a given prime number p dividing m − n, for m ≠ n (and equal to 0 for m = n); the restriction of the p -adic metric (from \(\mathbb{Q}\)) on \(\mathbb{N}\);
-
3.
\(\ln \frac{\mathit{lcm}(m,n)} {\mathit{gcd}(m,n)}\); an example of the lattice valuation metric;
-
4.
w r (n − m), where w r (n) is the arithmetic r-weight of n; the restriction of the arithmetic r -norm metric (from \(\mathbb{Z}\)) on \(\mathbb{N}\);
-
5.
\(\frac{\vert n-m\vert } {\mathit{mn}}\) (cf. M -relative metric in Chap. 5);
-
6.
\(1 + \frac{1} {m+n}\) for m ≠ n (and equal to 0 for m = n); the Sierpinski metric.
Most of these metrics on \(\mathbb{N}\) can be extended on \(\mathbb{Z}\). Moreover, any one of the above metrics can be used in the case of an arbitrary countable set X. For example, the Sierpinski metric is defined, in general, on a countable set \(X =\{ x_{n}: n \in \mathbb{N}\}\) by \(1 + \frac{1} {m+n}\) for all x m , x n ∈ X with m ≠ n (and is equal to 0, otherwise).
-
1.
-
Arithmetic r -norm metric
Let \(r \in \mathbb{N},r \geq 2\). The modified r-ary form of an integer x is a representation
$$\displaystyle{x = e_{n}r^{n} +\ldots +e_{ 1}r + e_{0},}$$where \(e_{i} \in \mathbb{Z}\), and | e i | < r for all \(i = 0,\ldots,n\).
An r-ary form is called minimal if the number of nonzero coefficients is minimal. The minimal form is not unique, in general. But if the coefficients e i , 0 ≤ i ≤ n − 1, satisfy the conditions | e i + e i+1 | < r, and | e i | < | e i+1 | if e i e i+1 < 0, then the above form is unique and minimal; it is called the generalized nonadjacent form.
The arithmetic r-weight w r (x) of an integer x is the number of nonzero coefficients in a minimal r-ary form of x, in particular, in the generalized nonadjacent form. The arithmetic r -norm metric on \(\mathbb{Z}\) (see, for example, [Ernv85]) is defined by
$$\displaystyle{w_{r}(x - y).}$$ -
Distance between consecutive primes
The distance between consecutive primes (or prime gap, prime difference function) is the difference g n = p n+1 − p n between two successive prime numbers.
It holds g n ≤ p n , \(\overline{\lim }_{n\rightarrow \infty }g_{n} = \infty \) and (Zhang, 2013) \(\underline{\lim }_{n\rightarrow \infty }g_{n} < 7 \times 10^{7}\), improved to ≤ 246 (conjecturally, to ≤ 6) by Polymath8, 2014. There is no lim n → ∞ g n but g n ≈ lnp n for the average g n .
Open Polignac’s conjecture: for any k ≥ 1, there are infinitely many n with g n = 2k; the case k = 1 (i.e., that \(\underline{\lim }_{n\rightarrow \infty }g_{n} = 2\) holds) is the twin prime conjecture.
-
Distance Fibonacci numbers
Fibonacci numbers are defined by the recurrence F n = F n−1 + F n−2 for n ≥ 2 with initial terms F 0 = 0 and F 1 = 1. Distance Fibonacci numbers are three following generalizations of them in the distance sense, considered by Wloch et al..
Kwaśnik–Wloch, 2000: F(k, n) = F(k, n − 1) + F(k, n − k) for n > k and F(k, n) = n + 1 for n ≤ k.
Bednarz et al., 2012: Fd(k, n) = Fd(k, n − k + 1) + Fd(k, n − k) for n ≥ k > 1 and Fd(k, n) = 1 for 0 ≤ n < k.
Wloch et al., 2013: F 2(k, n) = F 2(k, n − 2) + F 2(k, n − k) for n ≥ k ≥ 1 and F 2(k, n) = 1 for 0 ≤ n < k.
-
p -adic metric
Let p be a prime number. Any nonzero rational number x can be represented as \(x = p^{\alpha }\frac{c} {d}\), where c and d are integers not divisible by p, and α is a unique integer. The p-adic norm of x is defined by | x | p = p −α. Moreover, | 0 | p = 0 is defined.
The p -adic metric is a norm metric on the set ℚ of rational numbers defined by
$$\displaystyle{\vert x - y\vert _{p}.}$$This metric forms the basis for the algebra of p-adic numbers. The Cauchy completions of the metric spaces \((\mathbb{Q},\vert x - y\vert _{p})\) and \((\mathbb{Q},\vert x - y\vert )\) with the natural metric | x − y | give the fields \(\mathbb{Q}_{p}\) of p-adic numbers and \(\mathbb{R}\) of real numbers, respectively.
The Gajić metric is an ultrametric on the set \(\mathbb{Q}\) of rational numbers defined, for x ≠ y (via the integer part \(\lfloor z\rfloor \) of a real number z), by
$$\displaystyle{\inf \{2^{-n}: n \in \mathbb{Z},\,\,\lfloor 2^{n}(x - e)\rfloor = \lfloor 2^{n}(y - e)\rfloor \},}$$where e is any fixed irrational number. This metric is equivalent to the natural metric | x − y | on \(\mathbb{Q}\).
-
Continued fraction metric on irrationals
The continued fraction metric on irrationals is a complete metric on the set Irr of irrational numbers defined, for x ≠ y, by
$$\displaystyle{ \frac{1} {n},}$$where n is the first index for which the continued fraction expansions of x and y differ. This metric is equivalent to the natural metric | x − y | on Irr which is noncomplete and disconnected. Also, the Baire 0-dimensional space B(ℵ 0) (cf. Baire metric in Chap. 11) is homeomorphic to Irr endowed with this metric.
-
Natural metric
The natural metric (or absolute value metric , line metric , the distance between numbers) is a metric on \(\mathbb{R}\) defined by
$$\displaystyle{\vert x-y\vert = \left \{\begin{array}{ccc} y - x,&\mbox{ if}&x - y < 0,\\ x - y, &\mbox{ if} &x - y \geq 0.\end{array} \right.}$$On \(\mathbb{R}\) all l p -metrics coincide with the natural metric. The metric space \((\mathbb{R},\vert x - y\vert )\) is called the real line (or Euclidean line).
There exist many other metrics on \(\mathbb{R}\) coming from | x − y | by some metric transform (cf. Chap. 4). For example: min{1, | x − y | }, \(\frac{\vert x-y\vert } {1+\vert x-y\vert }\), | x | + | x − y | + | y | (for x ≠ y) and, for a given 0 < α < 1, the generalized absolute value metric | x − y | α.
Some authors use | x − y | as the Polish notation (parentheses-free and computer-friendly) of the distance function in any metric space.
-
Zero bias metric
The zero bias metric is a metric on \(\mathbb{R}\) defined by
$$\displaystyle{1 + \vert x - y\vert }$$if one and only one of x and y is strictly positive, and by
$$\displaystyle{\vert x - y\vert,}$$otherwise, where | x − y | is the natural metric (see, for example, [Gile87]).
-
Sorgenfrey quasi-metric
The Sorgenfrey quasi-metric is a quasi-metric d on \(\mathbb{R}\) defined by
$$\displaystyle{y - x}$$if y ≥ x, and equal to 1, otherwise. Some similar quasi-metrics on \(\mathbb{R}\) are:
-
1.
d 1(x, y) = max{y − x, 0} (in general, max{f(y) − f(x), 0} is a quasi-metric on a set X if \(f: X \rightarrow \mathbb{R}_{\geq 0}\) is an injective function);
-
2.
d 2(x, y) = min{y − x, 1} if y ≥ x, and equal to 1, otherwise;
-
3.
d 3(x, y) = y − x if y ≥ x, and equal to a(x − y) (for fixed a > 0), otherwise;
-
4.
d 4(x, y) = e y − e x if y ≥ x, and equal to e −y − e −x otherwise.
-
1.
-
Real half-line quasi-semimetric
The real half-line quasi-semimetric is defined on the half-line \(\mathbb{R}_{>0}\) by
$$\displaystyle{\max \left \{0,\ln \frac{y} {x}\right \}.}$$ -
Janous–Hametner metric
The Janous–Hametner metric is defined on the half-line \(\mathbb{R}_{>0}\) by
$$\displaystyle{ \frac{\vert x - y\vert } {(x + y)^{t}},}$$where t = −1 or 0 ≤ t ≤ 1, and | x − y | is the natural metric.
-
Extended real line metric
An extended real line metric is a metric on \(\mathbb{R} \cup \{ +\infty \}\cup \{-\infty \}\). The main example (see, for example, [Cops68]) of such metric is given by
$$\displaystyle{\vert f(x) - f(y)\vert,}$$where \(f(x) = \frac{x} {1+\vert x\vert }\) for \(x \in \mathbb{R}\), f(+∞) = 1, and f(−∞) = −1.
Another metric, commonly used on \(\mathbb{R} \cup \{ +\infty \}\cup \{-\infty \}\), is defined by
$$\displaystyle{\vert \arctan x -\arctan y\vert,}$$where \(-\frac{1} {2}\pi <\arctan x < \frac{1} {2}\pi\) for −∞ < x < ∞, and \(\arctan (\pm \infty ) = \pm \frac{1} {2}\pi\).
-
Complex modulus metric
The complex modulus metric on the set \(\mathbb{C}\) of complex numbers is defined by
$$\displaystyle{\vert z - u\vert,}$$where, for any \(z = z_{1} + z_{2}i \in \mathbb{C}\), the number \(\vert z\vert = \sqrt{z\overline{z}} = \sqrt{z_{1 }^{2 } + z_{2 }^{2}}\) is the complex modulus. The complex argument θ is defined by z = | z | (cos(θ) + isin(θ)).
The metric space \((\mathbb{C},\vert z - u\vert )\) is called the complex (or Wessel–Argand) plane. It is isometric to the Euclidean plane \((\mathbb{R}^{2},\vert \vert x - y\vert \vert _{2})\). So, the metrics on \(\mathbb{R}^{2}\), given in Chaps. 19 and 5, can be seen as metrics on \(\mathbb{C}\). For example, the British Rail metric on \(\mathbb{C}\) is | z | + | u | for z ≠ u. The p -relative (if 1 ≤ p < ∞) and relative metric (if p = ∞) on \(\mathbb{C}\) are defined for | z | + | u | ≠ 0 respectively, by
$$\displaystyle{ \frac{\vert z - u\vert } {\root{p}\of{\vert z\vert ^{p} + \vert u\vert ^{p}}}\mbox{ and }\frac{\vert z - u\vert } {\max \{\vert z\vert,\vert u\vert \}}.}$$ -
\(\mathbb{Z}(\eta _{m})\) -related norm metrics
A Kummer (or cyclotomic) ring \(\mathbb{Z}(\eta _{m})\) is a subring of the ring \(\mathbb{C}\) (and an extension of the ring \(\mathbb{Z}\)), such that each of its elements has the form ∑ j = 0 m−1 a j η m j, where η m is a primitive m-th root \(\exp (\frac{2\pi i} {m})\) of unity, and all a j are integers.
The complex modulus | z | of \(z = a + b\eta _{m} \in \mathbb{C}\) is defined by
$$\displaystyle{\vert z\vert ^{2} = z\overline{z} = a^{2} + (\eta _{ m} + \overline{\eta _{m}})\mathit{ab} + b^{2} = a^{2} + 2\mathit{ab}\cos \left (\frac{2\pi i} {m}\right ) + b^{2}.}$$Then (a + b)2 = q 2 for m = 2 (or 1), a 2 + b 2 for m = 4, and a 2 + ab + b 2 for m = 6 (or 3), i.e., for the ring \(\mathbb{Z}\) of usual integers, \(\mathbb{Z}(i)\) of Gaussian integers and \(\mathbb{Z}(\rho )\) of Eisenstein–Jacobi (or EJ) integers.
The set of units of \(\mathbb{Z}(\eta _{m})\) contain η m j, 0 ≤ j ≤ m − 1; for m = 5 and m ≥ 6, units of infinite order appear also, since \(\cos (\frac{2\pi i} {m})\) is irrational. For m = 2, 4, 6, the set of units is { ± 1}, { ± 1, ±i}, { ± 1, ±ρ, ±ρ 2}, where i = η 4 and \(\rho =\eta _{6} = \frac{1+i\sqrt{3}} {2}\).
The norms \(\vert z\vert = \sqrt{a^{2 } + b^{2}}\) and | | z | | i = | a | + | b | for \(z = a + \mathit{bi} \in \mathbb{C}\) give rise to the complex modulus and i -Manhattan metrics on \(\mathbb{C}\). They coincide with the Euclidean (l 2-) and Manhattan (l 1-) metrics, respectively, on \(\mathbb{R}^{2}\) seen as the complex plane. The restriction of the i-Manhattan metric on \(\mathbb{Z}(i)\) is the path metric of the square grid \(\mathbb{Z}^{2}\) of \(\mathbb{R}^{2}\); cf. grid metric in Chap. 19.
The ρ -Manhattan metric on \(\mathbb{C}\) is defined by the norm | | z | | ρ , i.e.,
$$\displaystyle\begin{array}{rcl} & & \min \{\vert a\vert + \vert b\vert + \vert c\vert: z = a + b\rho + c\rho ^{2}\} {}\\ & & =\min \{ \vert a\vert + \vert b\vert,\vert a + b\vert + \vert b\vert,\vert a + b\vert + \vert a\vert: z = a + b\rho \}. {}\\ \end{array}$$The restriction of the ρ-Manhattan metric on \(\mathbb{Z}(\rho )\) is the path metric of the triangular grid of \(\mathbb{R}^{2}\) (seen as the hexagonal lattice \(A_{2} =\{ (a,b,c) \in \mathbb{Z}^{3}: a + b + c = 0\}\)), i.e., the hexagonal metric (Chap. 19).
Let f denote either i or \(\rho = \frac{1+i\sqrt{3}} {2}\). Given a \(\pi \in \mathbb{Z}(f)\setminus \{0\}\) and \(z,z^{{\prime}}\in \mathbb{Z}(f)\), we write \(z \equiv z^{{\prime}}\,(\mod \,\pi )\) if z − z ′ = δ π for some \(\delta \in \mathbb{Z}(f)\). For the quotient ring \(\mathbb{Z}_{\pi }(f) =\{ z\,(\mod \,\pi ): z \in \mathbb{Z}(f)\}\), it holds \(\vert \mathbb{Z}_{\pi }(f)\vert = \vert \vert \pi \vert \vert _{f}^{2}\).
Call two congruence classes \(z\,(\mod \,\pi )\) and \(z^{{\prime}}\,(\mod \,\pi )\) adjacent if \(z - z^{{\prime}}\equiv f^{j}\,(\mod \,\pi )\) for some j. The resulting graph on \(\mathbb{Z}_{\pi }(f)\) called a Gaussian network or EJ network if, respectively, f = i or f = ρ. The path metrics of these networks coincide with their norm metrics, defined (Fan–Gao, 2004) for \(z\,(\mod \,\pi )\) and \(z^{{\prime}}\,(\mod \,\pi )\), by
$$\displaystyle{\min \vert \vert u\vert \vert _{f}: u \in z - z^{{\prime}}\,(\mod \,\pi ).}$$These metrics are different from the previously defined [Hube94a, Hube94b] distance on \(\mathbb{Z}_{\pi }(f)\): | | v | | f , where \(v \in z - z^{{\prime}}\,(\mod \,\pi )\) is selected by minimizing the complex modulus. For f = i, this is the Mannheim distance (Chap. 16), which is not a metric.
-
Chordal metric
The chordal metric d χ is a metric on the set \(\overline{\mathbb{C}} = \mathbb{C} \cup \{\infty \}\) defined by
$$\displaystyle{d_{\chi }(z,u) = \frac{2\vert z - u\vert } {\sqrt{1 + \vert z\vert ^{2}}\sqrt{1 + \vert u\vert ^{2}}}\mbox{ and }d_{\chi }(z,\infty ) = \frac{2} {\sqrt{1 + \vert z\vert ^{2}}}}$$for all \(u,z \in \mathbb{C}\) (cf. M -relative metric in Chap. 5).
The metric space \((\overline{\mathbb{C}},d_{\chi })\) is called the extended complex plane. It is homeomorphic and conformally equivalent to the Riemann sphere, i.e., the unit sphere \(S^{2} =\{ (x_{1},x_{2},x_{3}) \in \mathbb{E}^{3}: x_{1}^{2} + x_{2}^{2} + x_{3}^{2} = 1\}\) (considered as a metric subspace of \(\mathbb{E}^{3}\)), onto which \((\overline{\mathbb{C}},d_{\chi })\) is one-to-one mapped under stereographic projection.
The plane \(\overline{\mathbb{C}}\) can be identified with the plane x 3 = 0 such that the and imaginary axes coincide with the x 1 and x 2 axes. Under stereographic projection, each point \(z \in \mathbb{C}\) corresponds to the point (x 1, x 2, x 3) ∈ S 2, where the ray drawn from the “north pole” (0, 0, 1) to the point z meets the sphere S 2; the “north pole” corresponds to the point at ∞. The chordal (spherical) metric between two points p, q ∈ S 2 is taken to be the distance between their preimages \(z,u \in \overline{\mathbb{C}}\).
The chordal metric can be defined equivalently on \(\overline{\mathbb{R}}^{n} = \mathbb{R}^{n} \cup \{\infty \}\):
$$\displaystyle{d_{\chi }(x,y) = \frac{2\vert \vert x - y\vert \vert _{2}} {\sqrt{1 + \vert \vert x\vert \vert _{2 }^{2}}\sqrt{1 + \vert \vert y\vert \vert _{2 }^{2}}}\mbox{ and }d_{\chi }(x,\infty ) = \frac{2} {\sqrt{1 + \vert \vert x\vert \vert _{2 }^{2}}}.}$$The restriction of the metric d χ on \(\mathbb{R}^{n}\) is a Ptolemaic metric; cf. Chap. 1.
Given α > 0, β ≥ 0, p ≥ 1, the generalized chordal metric is a metric on \(\mathbb{C}\) (in general, on \((\mathbb{R}^{n},\vert \vert.\vert \vert _{2})\) and even on any Ptolemaic space (V, | | . | | )), defined by
$$\displaystyle{ \frac{\vert z - u\vert } {\root{p}\of{\alpha +\beta \vert z\vert ^{p}} \cdot \root{p}\of{\alpha +\beta \vert u\vert ^{p}}}.}$$ -
Metrics on quaternions
Quaternions are members of a noncommutative division algebra \(\mathcal{Q}\) over the field \(\mathbb{R}\), geometrically realizable in \(\mathbb{R}^{4}\) [Hami66]. Formally,
$$\displaystyle{\mathcal{Q} =\{ q = q_{1} + q_{2}i + q_{3}j + q_{4}k: q_{i} \in \mathbb{R}\},}$$where the basic units \(1,i,j,k \in \mathcal{Q}\) satisfy i 2 = j 2 = k 2 = −1 and ij = −ji = k.
The quaternion norm is defined by \(\vert \vert q\vert \vert = \sqrt{q\overline{q}} = \sqrt{q_{1 }^{2 } + q_{2 }^{2 } + q_{3 }^{2 } + q_{4 }^{2}}\), where \(\overline{q} = q_{1} - q_{2}i - q_{3}j - q_{4}k\). The quaternion metric is the norm metric | | q − q ′ | | on \(\mathcal{Q}\).
The set of all Lipschitz integers and Hurwitz integers are defined, respectively, by
$$\displaystyle\begin{array}{rcl} & L =\{ q_{1} + q_{2}i + q_{3}j + q_{4}k: q_{i} \in \mathbb{Z}\}\,\,\mbox{ and } & {}\\ & H =\{ q_{1} + q_{2}i + q_{3}j + q_{4}k:\, \mbox{ all }\,q_{i} \in \mathbb{Z}\,\mbox{ or all }q_{i} + \frac{1} {2} \in \mathbb{Z}\}.& {}\\ \end{array}$$A quaternion q ∈ L is irreducible (i.e., q = q ′ q ′ ′ implies \(\{q^{{\prime}},q^{{\prime\prime}}\}\cap \{\pm 1,\pm i,\pm j,\pm k\}\neq \varnothing \)) if and only if | | q | | is a prime. Given an irreducible π ∈ L and q, q ′ ∈ H, we write \(q \equiv q^{{\prime}}\,(\mod \,\pi )\) if q − q ′ = δ π for some δ ∈ L.
For the rings \(L_{\pi } =\{ q\,(\mod \,\pi ): q \in L\}\) and \(H_{\pi }=\{q\,(\mod \,\pi ): q \in H\}\) it holds | L π | = | | π | | 2 and | H π | = 2 | | π | | 2 − 1.
The quaternion Lipschitz metric on L π is defined (Martinez et al., 2009) by
$$\displaystyle{d_{L}(\alpha,\beta ) =\min \sum _{1\leq s\leq 4}\vert q_{s}\vert:\alpha -\beta \equiv q_{1} + q_{2}i + q_{3}j + q_{4}k\,(\mod \,\pi ).}$$The ring H is additively generated by its subring L and \(w = \frac{1} {2}(1 + i + j + k)\). The Hurwitz metric on the ring H π is defined (Guzëltepe, 2013) by
$$\displaystyle{d_{H}(\alpha,\beta ) =\min \sum _{1\leq s\leq 5}\vert q_{s}\vert:\alpha -\beta \equiv q_{1} + q_{2}i + q_{3}j + q_{4}k + q_{5}w\,(\mod \,\pi ).}$$Cf. the hyper-Kähler and Gibbons–Manton metrics in Sect. 7.3 and the unit quaternions and joint angle metrics in Sect. 18.3.
2 Metrics on Polynomials
A polynomial is a sum of powers in one or more variables multiplied by coefficients. A polynomial in one variable (or monic polynomial) with constant real (complex) coefficients is given by \(P = P(z) =\sum _{ k=0}^{n}a_{k}z^{k}\), \(a_{k} \in \mathbb{R}\) (\(a_{k} \in \mathbb{C}\)). The set \(\mathcal{P}\) of all real (complex) polynomials forms a ring \((\mathcal{P},+,\cdot,0)\). It is also a vector space over \(\mathbb{R}\) (over \(\mathbb{C}\)).
-
Polynomial norm metric
A polynomial norm metric is a norm metric on the vector space \(\mathcal{P}\) of all real (complex) polynomials defined by
$$\displaystyle{\vert \vert P - Q\vert \vert,}$$where | | . | | is a polynomial norm, i.e., a function \(\vert \vert.\vert \vert: \mathcal{P}\rightarrow \mathbb{R}\) such that, for all \(P,Q \in \mathcal{P}\) and for any scalar k, we have the following properties:
-
1.
| | P | | ≥ 0, with | | P | | = 0 if and only if P ≡ 0;
-
2.
| | kP | | = | k | | | P | | ;
-
3.
| | P + Q | | ≤ | | P | | + | | Q | | (triangle inequality).
The l p -norm and L p -norm of a polynomial \(P(z) =\sum _{ k=0}^{n}a_{k}z^{k}\) are defined by
$$\displaystyle{\vert \vert P\vert \vert _{p}=(\sum _{k=0}^{n}\vert a_{ k}\vert ^{p})^{1/p}\mbox{ and }\vert \vert P\vert \vert _{ L_{p}}=(\int _{0}^{2\pi }\vert P(e^{i\theta })\vert ^{p}\frac{d\theta } {2\pi })^{\frac{1} {p} }\mbox{ for }1 \leq p < \infty,}$$$$\displaystyle{\vert \vert P\vert \vert _{\infty } =\max _{0\leq k\leq n}\vert a_{k}\vert \mbox{ and }\vert \vert P\vert \vert _{L_{\infty }} =\sup _{\vert z\vert =1}\vert P(z)\vert \mbox{ for }p = \infty.}$$The values | | P | | 1 and | | P | | ∞ are called the length and height of polynomial P.
-
1.
-
Distance from irreducible polynomials
For any field \(\mathbb{F}\), a polynomial with coefficients in \(\mathbb{F}\) is said to be irreducible over \(\mathbb{F}\) if it cannot be factored into the product of two nonconstant polynomials with coefficients in \(\mathbb{F}\). Given a metric d on the polynomials over \(\mathbb{F}\), the distance (of a given polynomial P(z)) from irreducible polynomials is d ir (P) = infd(P, Q), where Q(z) is any irreducible polynomial of the same degree over \(\mathbb{F}\).
Polynomial conjecture of Turán, 1967, is that there exists a constant C with d ir (P) ≤ C for every polynomial P over \(\mathbb{Z}\), where d(P, Q) is the length | | P − Q | | 1 of P − Q.
Lee–Ruskey–Williams, 2007, conjectured that there exists a constant C with d ir (P) ≤ C for every polynomial P over the Galois field \(\mathbb{F}_{2}\), where d(P, Q) is the Hamming distance between the (0, 1)-sequences of coefficients of P and Q.
-
Bombieri metric
The Bombieri metric (or polynomial bracket metric ) is a polynomial norm metric on the set \(\mathcal{P}\) of all real (complex) polynomials defined by
$$\displaystyle{[P - Q]_{p},}$$where [. ] p , 0 ≤ p ≤ ∞, is the Bombieri p-norm.
For a polynomial \(P(z) =\sum _{ k=0}^{n}a_{k}z^{k}\) it is defined by
$$\displaystyle{[P]_{p} = \left (\sum _{k=0}^{n}(_{ k}^{n})^{1-p}\vert a_{ k}\vert ^{p}\right )^{\frac{1} {p} }.}$$ -
Metric space of roots
The metric space of roots is (Ćurgus–Mascioni, 2006) the space (X, d) where X is the family of all multisets of complex numbers with n elements and the distance between multisets \(U =\{ u_{1},\ldots,u_{n}\}\) and \(V =\{ v_{1},\ldots,v_{n}\}\) is defined by the following analog of the Fréchet metric:
$$\displaystyle{\min _{\tau \in \mathit{Sym}_{n}}\max _{1\leq j\leq n}\vert u_{j} - v_{\tau (j)}\vert,}$$where τ is any permutation of \(\{1,\ldots,n\}\). Here the set of roots of some monic complex polynomial of degree n is considered as a multiset with n elements. Cf. metrics between multisets in Chap. 1.
The function assigning to each polynomial the multiset of its roots is a homeomorphism between the metric space of all monic complex polynomials of degree n with the polynomial norm metric l ∞ and the metric space of roots.
3 Metrics on Matrices
An m × n matrix A = ((a ij )) over a field \(\mathbb{F}\) is a table consisting of m rows and n columns with the entries a ij from \(\mathbb{F}\). The set of all m × n matrices with real (complex) entries is denoted by M m, n or \(\mathbb{R}^{m\times n}\) (\(\mathbb{C}^{m\times n}\)). It forms a group (M m, n , +, 0 m, n ), where \(((a_{\mathit{ij}})) + ((b_{\mathit{ij}})) = ((a_{\mathit{ij}} + b_{\mathit{ij}}))\), and the matrix 0 m, n ≡ 0. It is also an mn-dimensional vector space over \(\mathbb{R}\) (\(\mathbb{C}\)).
The transpose of a matrix A = ((a ij )) ∈ M m, n is the matrix A T = ((a ji )) ∈ M n, m . A m × n matrix A is called a square matrix if m = n, and a symmetric matrix if A = A T. The conjugate transpose (or adjoint) of a matrix A = ((a ij )) ∈ M m, n is the matrix \(A^{{\ast}} = ((\overline{a}_{\mathit{ji}})) \in M_{n,m}\). An Hermitian matrix is a complex square matrix A with A = A ∗.
The set of all square n × n matrices with real (complex) entries is denoted by M n . It forms a ring (M n , +, ⋅ , 0 n ), where + and 0 n are defined as above, and \(((a_{\mathit{ij}})) \cdot ((b_{\mathit{ij}})) = ((\sum _{k=1}^{n}a_{\mathit{ik}}b_{\mathit{kj}}))\). It is also an n 2-dimensional vector space over \(\mathbb{R}\) (over \(\mathbb{C}\)). The trace of a square n × n matrix A = ((a ij )) is defined by \(\mathrm{Tr}(A) =\sum _{ i=1}^{n}a_{\mathit{ii}}\).
The identity matrix is 1 n = ((c ij )) with c ii = 1, and c ij = 0, i ≠ j. An unitary matrix U = ((u ij )) is a square matrix defined by U −1 = U ∗, where U −1 is the inverse matrix of U, i.e., UU −1 = 1 n . A matrix A ∈ M m, n is orthonormal if A ∗ A = 1 n . A matrix \(A \in \mathbb{R}^{n\times n}\) is orthogonal if A T = A −1, normal if A T A = AA T and singular if its determinant is 0.
If for a matrix A ∈ M n there is a vector x such that Ax = λ x for some scalar λ, then λ is called an eigenvalue of A with corresponding eigenvector x. Given a matrix \(A \in \mathbb{C}^{m\times n}\), its singular values s i (A) are defined as \(\sqrt{\lambda (A^{{\ast} } A})\). A real matrix A is positive-definite if v T Av > 0 for all nonzero real vectors v; it holds if and only if all eigenvalues of \(A_{H} = \frac{1} {2}(A + A^{T})\) are positive. An Hermitian matrix A is positive-definite if v ∗ Av > 0 for all nonzero complex vectors v; it holds if and only if all λ(A) are positive.
The mixed states of a n-dimensional quantum system are described by their density matrices, i.e., positive-semidefinite Hermitian n × n matrices of trace 1. The set of such matrices is convex, and its extremal points describe the pure states. Cf. monotone metrics in Chap. 7 and distances between quantum states in Chap. 24.
-
Matrix norm metric
A matrix norm metric is a norm metric on the set M m, n of all real (complex) m × n matrices defined by
$$\displaystyle{\vert \vert A - B\vert \vert,}$$where | | . | | is a matrix norm, i.e., a function \(\vert \vert.\vert \vert: M_{m,n} \rightarrow \mathbb{R}\) such that, for all A, B ∈ M m, n , and for any scalar k, we have the following properties:
-
1.
| | A | | ≥ 0, with | | A | | = 0 if and only if A = 0 m, n ;
-
2.
| | kA | | = | k | | | A | | ;
-
3.
| | A + B | | ≤ | | A | | + | | B | | (triangle inequality).
-
4.
| | AB | | ≤ | | A | | ⋅ | | B | | (submultiplicativity).
All matrix norm metrics on M m, n are equivalent. The simplest example of such metric is the Hamming metric on M m, n (in general, on the set \(M_{m,n}(\mathbb{F})\) of all m × n matrices with entries from a field \(\mathbb{F}\)) defined by | | A − B | | H , where | | A | | H is the Hamming norm of A ∈ M m, n , i.e., the number of nonzero entries in A. Example of a generalized (i.e., not submultiplicative one) matrix norm is the max element norm | | A = ((a ij )) | | max = max i, j | a ij | ; but \(\sqrt{\mathit{mn}}\vert \vert A\vert \vert _{\max }\) is a matrix norm.
-
1.
-
Natural norm metric
A natural (or operator, induced) norm metric is a matrix norm metric on the set M n defined by
$$\displaystyle{\vert \vert A - B\vert \vert _{\mathrm{nat}},}$$where | | . | | nat is a natural (or operator, induced) norm on M n , induced by the vector norm | | x | | , \(x \in \mathbb{R}^{n}\) (\(x \in \mathbb{C}^{n}\)), is a matrix norm defined by
$$\displaystyle{\vert \vert A\vert \vert _{\mathrm{nat}} =\sup _{\vert \vert x\vert \vert \neq 0}\frac{\vert \vert \mathit{Ax}\vert \vert } {\vert \vert x\vert \vert } =\sup _{\vert \vert x\vert \vert =1}\vert \vert \mathit{Ax}\vert \vert =\sup _{\vert \vert x\vert \vert \leq 1}\vert \vert \mathit{Ax}\vert \vert.}$$The natural norm metric can be defined in similar way on the set M m, n of all m × n real (complex) matrices: given vector norms \(\vert \vert.\vert \vert _{\mathbb{R}^{m}}\) on \(\mathbb{R}^{m}\) and \(\vert \vert.\vert \vert _{\mathbb{R}^{n}}\) on \(\mathbb{R}^{n}\), the natural norm | | A | | nat of a matrix A ∈ M m, n , induced by \(\vert \vert.\vert \vert _{\mathbb{R}^{n}}\) and \(\vert \vert.\vert \vert _{\mathbb{R}^{m}}\), is a matrix norm defined by \(\vert \vert A\vert \vert _{\mathrm{nat}} =\sup _{\vert \vert x\vert \vert _{\mathbb{R}^{n}}=1}\vert \vert \mathit{Ax}\vert \vert _{\mathbb{R}^{m}}\).
-
Matrix p -norm metric
A matrix p -norm metric is a natural norm metric on M n defined by
$$\displaystyle{\vert \vert A - B\vert \vert _{\mathrm{nat}}^{p},}$$where | | . | | nat p is the matrix (or operator) p-norm, i.e., a natural norm, induced by the vector l p -norm, 1 ≤ p ≤ ∞:
$$\displaystyle{\vert \vert A\vert \vert _{\mathrm{nat}}^{p} =\max _{ \vert \vert x\vert \vert _{p}=1}\vert \vert \mathit{Ax}\vert \vert _{p},\,\,\mbox{ where }\,\,\vert \vert x\vert \vert _{p} = (\sum _{i=1}^{n}\vert x_{ i}\vert ^{p})^{1/p}.}$$The maximum absolute column and maximum absolute row metric are the matrix 1-norm and matrix ∞ -norm metric on M n . For a matrix A = ((a ij )) ∈ M n , the maximum absolute column and maximum absolute row sum norm are
$$\displaystyle{\vert \vert A\vert \vert _{\mathrm{nat}}^{1} =\max _{ 1\leq j\leq n}\sum _{i=1}^{n}\vert a_{\mathit{ ij}}\vert \,\,\mbox{ and }\,\,\vert A\vert \vert _{\mathrm{nat}}^{\infty } =\max _{ 1\leq i\leq n}\sum _{j=1}^{n}\vert a_{\mathit{ ij}}\vert.}$$The spectral norm metric is the matrix 2-norm metric | | A − B | | nat 2 on M n . The matrix 2-norm | | . | | nat 2, induced by the vector l 2 -norm, is also called the spectral norm and denoted by | | . | | sp . For a symmetric matrix A = ((a ij )) ∈ M n , it is
$$\displaystyle{\vert \vert A\vert \vert _{\mathit{sp}} = s_{\max }(A) = \sqrt{\lambda _{\max }(A^{{\ast} } A)},}$$where \(A^{{\ast}} = ((\overline{a}_{\mathit{ji}}))\), while s max and λ max are largest singular value and eigenvalue.
-
Frobenius norm metric
The Frobenius norm metric is a matrix norm metric on M m, n defined by
$$\displaystyle{\vert \vert A - B\vert \vert _{Fr},}$$where | | . | | Fr is the Frobenius (or Hilbert–Schmidt) norm. For A = ((a ij )), it is
$$\displaystyle{\vert \vert A\vert \vert _{\mathit{Fr}} = \sqrt{\sum _{i,j } \vert a_{\mathit{ij } } \vert ^{2}} = \sqrt{\mathrm{Tr } (A^{{\ast} } A)} = \sqrt{\sum _{1\leq i\leq \mathrm{rank } (A) } \lambda _{i}} = \sqrt{\sum _{1\leq i\leq \mathrm{rank } (A) } s_{i }^{2}},}$$where λ i , s i are the eigenvalues and singular values of A.
This norm is strictly convex, is a differentiable function of its elements a ij and is the only unitarily invariant norm among \(\vert \vert A\vert \vert _{p} = (\sum _{i=1}^{m}\sum _{j=1}^{n}\vert a_{\mathit{ij}}\vert ^{p})^{\frac{1} {p} }\), p ≥ 1.
The trace norm metric is a matrix norm metric on M m, n defined by
$$\displaystyle{\vert \vert A - B\vert \vert _{\mathit{tr}},}$$where | | . | | tr is the trace norm (or nuclear norm) on M m, n defined by
$$\displaystyle{\vert \vert A\vert \vert _{\mathit{tr}} =\sum _{ i=1}^{\min \{m,n\}}s_{ i}(A) = \mathrm{Tr}(\sqrt{A^{{\ast} } A}).}$$ -
Schatten norm metric
Given 1 ≤ p < ∞, the Schatten norm metric is a matrix norm metric on M m, n defined by
$$\displaystyle{\vert \vert A - B\vert \vert _{\mathit{Sch}}^{p},}$$where | | . | | Sch p is the Schatten p-norm on M m, n . For a matrix A ∈ M m, n , it is defined as the p-th root of the sum of the p-th powers of all its singular values:
$$\displaystyle{\vert \vert A\vert \vert _{\mathit{Sch}}^{p} = (\sum _{ i=1}^{\min \{m,n\}}s_{ i}^{p}(A))^{\frac{1} {p} }.}$$For p = ∞, 2 and 1, one obtains the spectral norm metric, Frobenius norm metric and trace norm metric, respectively.
-
(c, p)-norm metric
Let \(k \in \mathbb{N}\), k ≤ min{m, n}, \(c \in \mathbb{R}^{k}\), \(c_{1} \geq c_{2} \geq \ldots \geq c_{k} > 0\), and 1 ≤ p < ∞.
The (c, p)-norm metric is a matrix norm metric on M m, n defined by
$$\displaystyle{\vert \vert A - B\vert \vert _{(c,p)}^{k},}$$where | | . | | (c, p) k is the (c,p)-norm on M m, n . For a matrix A ∈ M m, n , it is defined by
$$\displaystyle{\vert \vert A\vert \vert _{(c,p)}^{k} = (\sum _{ i=1}^{k}c_{ i}s_{i}^{p}(A))^{\frac{1} {p} },}$$where \(s_{1}(A) \geq s_{2}(A) \geq \ldots \geq s_{k}(A)\) are the first k singular values of A.
If p = 1, it is the c-norm. If, moreover, \(c_{1} =\ldots = c_{k} = 1\), it is the Ky Fan k-norm.
-
Ky Fan k -norm metric
Given \(k \in \mathbb{N}\), k ≤ min{m, n}, the Ky Fan k -norm metric is a matrix norm metric on M m, n defined by
$$\displaystyle{\vert \vert A - B\vert \vert _{\mathit{KF}}^{k},}$$where | | . | | KF k is the Ky Fan k-norm on M m, n . For a matrix A ∈ M m, n , it is defined as the sum of its first k singular values:
$$\displaystyle{\vert \vert A\vert \vert _{\mathit{KF}}^{k} =\sum _{ i=1}^{k}s_{ i}(A).}$$For k = 1 and k = min{m, n}, one obtains the spectral and trace norm metrics.
-
Cut norm metric
The cut norm metric is a matrix norm metric on M m, n defined by
$$\displaystyle{\vert \vert A - B\vert \vert _{\mathit{cut}},}$$where | | . | | cut is the cut norm on M m, n defined, for a matrix A = ((a ij )) ∈ M m, n , as:
$$\displaystyle{\vert \vert A\vert \vert _{\mathit{cut}} =\max _{I\subset \{1,\ldots,m\},J\subset \{1,\ldots,n\}}\vert \sum _{i\in I,j\in J}a_{\mathit{ij}}\vert.}$$Cf. in Chap. 15 the rectangle distance on weighted graphs and the cut semimetric, but the weighted cut metric in Chap. 19 is not related.
-
Matrix nearness problems
A norm | | . | | is unitarily invariant on M m, n if | | B | | = | | UBV | | for all B ∈ M m, n and all unitary matrices U, V. All Schatten p-norms are
Given a unitarily invariant norm | | . | | on M m, n , a matrix property \(\mathcal{P}\) defining a subspace or compact subset of M m, n (so that \(d_{\vert \vert.\vert \vert }(A,\mathcal{P})\) below is well defined) and a matrix A ∈ M m, n , then the distance to \(\mathcal{P}\) is the point-set distance on M m, n
$$\displaystyle{d(A) = d_{\vert \vert.\vert \vert }(A,\mathcal{P}) =\min \{ \vert \vert E\vert \vert: A + E\mbox{ has property }\mathcal{P}\}.}$$A matrix nearness problem is [High89] to find an explicit formula for d(A), the \(\mathcal{P}\) -closest matrix (or matrices) X | | . | | (A) = A + E, satisfying the above minimum, and efficient algorithms for computing d(A) and X | | . | | (A). The componentwise nearness problem is to find \(d^{{\prime}}(A) =\min \{\epsilon: \vert E\vert \leq \epsilon \vert A\vert,A + E\mbox{ has property }\mathcal{P}\}\), where | B | = (( | b ij | )) and the matrix inequality is interpreted componentwise.
The most used norms for B = ((b ij )) are the Schatten 2- and ∞-norms (cf. Schatten norm metric): the Frobenius norm \(\vert \vert B\vert \vert _{\mathit{Fr}} = \sqrt{\mathrm{Tr } (B^{{\ast} } B)}\)=\(\sqrt{\sum _{1\leq i\leq \mathrm{rank } (B) } s_{i }^{2}}\) and the spectral norm \(\vert \vert B\vert \vert _{\mathit{sp}} = \sqrt{\lambda _{\max }(B^{{\ast} } B)} = s_{1}(B)\).
Examples of closest matrices \(X = X_{\vert \vert.\vert \vert }(A,\mathcal{P})\) follow.
Let \(A \in \mathbb{C}^{n\times n}\). Then A = A H + A S , where \(A_{H} = \frac{1} {2}(A + A^{{\ast}})\) is Hermitian and \(A_{H} = \frac{1} {2}(A - A^{{\ast}})\) is skew-Hermitian (i.e., A H ∗ = −A H ). Let \(A = U\Sigma V ^{{\ast}}\) be a singular value decomposition (SVD) of A, i.e., U ∈ M m and V ∗ ∈ M n are unitary, while \(\Sigma = \mathrm{diag}(s_{1},s_{2},\ldots,s_{\min \{m,n\}})\) is an m × n diagonal matrix with \(s_{1} \geq s_{2} \geq \ldots \geq s_{\mathrm{rank}(A)} > 0 =\ldots = 0\). Fan and Hoffman, 1955, showed that, for any unitarily invariant norm, A H , A S , UV ∗ are closest Hermitian (symmetric), skew-Hermitian (skew-symmetric) and unitary (orthogonal) matrices, respectively. Such matrix X Fr (A) is a unique minimizer in all three cases.
Let \(A \in \mathbb{R}^{n\times n}\). Gabriel, 1979, found the closest normal matrix X Fr (A). Higham found in 1988 a unique closest symmetric positive-semidefinite matrix X Fr (A) and, in 2001, the closest matrix of this type with unit diagonal (i.e., ab correlation matrix).
Given a SVD \(A = U\Sigma V ^{{\ast}}\) of A, let A k denote \(U\Sigma _{k}V ^{{\ast}}\), where \(\Sigma _{k}\) is a diagonal matrix \(\mathrm{diag}(s_{1},s_{2},\ldots,s_{k},0,\ldots,0)\) containing the largest k singular values of A. Then (Mirsky, 1960) A k achieves minrank(A+E) ≤ k | | E | | for any unitarily invariant norm. So, \(\vert \vert A - A_{k}\vert \vert _{\mathit{Fr}} = \sqrt{\sum _{i=k+1 }^{\mathrm{rank } (A) }s_{i }^{2}}\) (Eckart–Young, 1936) and | | A − A k | | sp = s max(A − A k ) = s k+1(A). A k is a unique minimizer X Fr (A) if s k > s k+1.
Let \(A \in \mathbb{R}^{n\times n}\) be nonsingular. Then its distance to singularity d(A, Sing) = min{ | | E | | : A + E is singular} is, for both above norms, \(s_{n}(A) = \frac{1} {s_{1}(A^{-1})} = \frac{1} {\vert \vert A^{-1}\vert \vert _{\mathit{sp}}} =\sup \{\delta:\delta \mathbb{B}_{\mathbb{R}^{n}} \subseteq A\mathbb{B}_{\mathbb{R}^{n}}\}\); here \(\mathbb{B}_{\mathbb{R}^{n}} =\{ x \in \mathbb{R}^{n}: \vert \vert x\vert \vert \leq 1\}\).
Given a closed convex cone \(C \subseteq \mathbb{R}^{n}\), call a matrix \(A \in \mathbb{R}^{m\times n}\) feasible if \(\{\mathit{Ax}: x \in C\} = \mathbb{R}^{m}\); so, for m = n and \(C = \mathbb{R}^{n}\), feasibly means nonsingularity. Renegar, 1995, showed that, for feasible matrix A, its distance to infeasibility min{ | | E | | nat: A + E is not feasible} is \(\sup \{\delta:\delta \mathbb{B}_{\mathbb{R}^{m}} \subseteq A(\mathbb{B}_{\mathbb{R}^{n}} \cap C)\}\).
Lewis, 2003, generalized this by showing that, given two real normed spaces X, Y and a surjective convex process (or set valued sublinear mapping) F from X to Y, i.e., a multifunction for which {(x, y): y ∈ F(x)} is a closed convex cone, it holds
$$\displaystyle{\min \{\vert \vert E\vert \vert _{\mathrm{nat}}: E\mbox{ is any linear map }X \rightarrow Y,F+E\mbox{ is not surjective}\}= \frac{1} {\vert \vert F^{-1}\vert \vert _{\mathrm{nat}}}.}$$Donchev et al. 2002, extended this, computing distance to irregularity; cf. metric regularity (Chap. 1). Cf. the above four distances to ill-posedness with distance to uncontrollability (Chap. 18) and distances from symmetry (Chap. 21).
-
\(\mathit{Sym}(n, \mathbb{R})^{+}\) and \(\mathit{Her}(n, \mathbb{C})^{+}\) metrics
Let \(\mathit{Sym}(n, \mathbb{R})^{+}\) and \(\mathit{Her}(n, \mathbb{C})^{+}\) be the cones of n × n symmetric real and Hermitian complex positive-definite n × n matrices. The \(\mathit{Sym}(n, \mathbb{R})^{+}\) metric is defined, for any \(A,B \in \mathit{Sym}(n, \mathbb{R})^{+}\), as
$$\displaystyle{(\sum _{i=1}^{n}\log ^{2}\lambda _{ i})^{\frac{1} {2} },}$$where λ 1, …, λ n are the eigenvalues of the matrix A −1 B (the same as those of \(A^{-\frac{1} {2} }\mathit{BA}^{-\frac{1} {2} }\)). It is the Riemannian distance, arising from the Riemannian metric ds 2 = Tr((A −1(dA))2). This metric was rediscovered in Förstner–Moonen, 1999, and Pennec et al., 2004, via generalized eigenvalue problem: det(λ A − B) = 0.
The \(\mathit{Her}(n, \mathbb{C})^{+}\) metric is defined, for any \(A,B \in \mathit{Her}(n, \mathbb{C})^{+}\), by
$$\displaystyle{d_{R}(A,B) = \vert \vert \log (A^{-\frac{1} {2} }\mathit{BA}^{-\frac{1} {2} })\vert \vert _{\mathit{Fr}},}$$where \(\vert \vert H\vert \vert _{\mathit{Fr}} = (\sum _{i,j}\vert h_{\mathit{ij}}\vert ^{2})^{\frac{1} {2} }\) is the Frobenius norm of the matrix H = ((h ij )). It is the Riemannian distance arising from the Riemannian metric of nonpositive curvature, defined locally (at H) by \(\mathit{ds} = \vert \vert H^{-\frac{1} {2} }\,\mathit{dH}\,H^{-\frac{1} {2} }\vert \vert _{\mathit{Fr}}\). In other words, this distance is the geodesic distance
$$\displaystyle{\inf \{L(\gamma ):\gamma \mbox{ is a (differentiable) path from A to B}\},}$$where \(L(\gamma ) =\int _{ A}^{B}\vert \vert \gamma ^{-\frac{1} {2} }(t)\gamma ^{{\prime}}(t)\gamma ^{-\frac{1} {2} }(t)\vert \vert _{\mathit{Fr}}\mathit{dt}\) and the geodesic [A, B] is parametrized by \(\gamma (t) = A^{\frac{1} {2} }(A^{-\frac{1} {2} }\mathit{BA}^{-\frac{1} {2} })^{t}A^{\frac{1} {2} }\) in the sense that d R (A, γ(t)) = td R (A, B) for each t ∈ [0, 1]. In particular, the geodesic midpoint \(\gamma (\frac{1} {2})\) of [A, B] can be seen as the geometric mean of two positive-definite matrices A and B.
The space \((\mathit{Her}(n, \mathbb{C})^{+},d_{R}))\) is an Hadamard (i.e., complete and CAT(0)) space, cf. Chap. 6. But \(\mathit{Her}(n, \mathbb{C})^{+}\) is not complete with respect to matrix norms; it has a boundary consisting of the singular positive-semidefinite matrices.
Above \(\mathit{Sym}(n, \mathbb{R})^{+}\) and \(\mathit{Her}(n, \mathbb{C})^{+}\) metrics are the special cases of the distance d R (x, y) among invariant distances on symmetric cones in Chap. 9.
Cf. also, in Chap. 24, the trace distance on all Hermitian of trace 1 positive-definite n × n matrices and in Chap. 7, the Wigner–Yanase–Dyson metrics on all complex positive-definite n × n matrices.
The Bartlett distance between two matrices \(A,B \in \mathit{Her}(n, \mathbb{C})^{+}\), is defined (Conradsen et al., 2003, for radar applications) by
$$\displaystyle{\ln \left ( \frac{(\mathit{det}(A + B))^{2}} {4\mathit{det}(A)\mathit{det}(B)}\right ).}$$ -
Siegel distance
The Siegel half-plane is the set SH n of n × n matrices Z = X + iY, where X, Y are symmetric or Hermitian and Y is positive-definite. The Siegel–Hua metric (Siegel, 1943, and independently, Hua, 1944) on SH n is defined by
$$\displaystyle{\mathit{ds}^{2} = \mathrm{Tr}(Y ^{-1}(\mathit{dZ})Y ^{-1}(d\overline{Z})).}$$It is unique metric preserved by any automorphism of SH n . The Siegel–Hua metric on the Siegel disk \(\mathit{SD}_{n} =\{ W = (Z -\mathit{iI})(Z + \mathit{iI})^{-1}: Z \in \mathit{SH}_{n}\}\) is defined by
$$\displaystyle{\mathit{ds}^{2} = \mathrm{Tr}((I -\mathit{WW }^{{\ast}})^{-1}\mathit{dW }(I - W^{{\ast}}W)^{-1}\mathit{dW }^{{\ast}}).}$$For n=1, the Siegel–Hua metric is the Poincaré metric (cf. Chap. 6) on the Poincaré half-plane SH 1 and the Poincaré disk SD 1, respectively.
Let A n = { Z = iY: Y > 0} be the imaginary axe on the Siegel half-plane. The Siegel–Hua metric on A n is the Riemannian trace metric \(\mathit{ds}^{2} = \mathrm{Tr}((P^{^{1} }\mathit{dP})^{2})\). The corresponding distances are \(\mathit{Sym}(n, \mathbb{R})^{+}\) metric or \(\mathit{Her}(n, \mathbb{C})^{+}\) metric.
The Siegel distance d Siegel (Z 1, Z 2) on SH n ∖ A n is defined by
$$\displaystyle{d_{\mathit{Siegel}}^{2}(Z_{ 1},Z_{2}) =\sum _{ i=1}^{n}\log ^{2}\left (\frac{1 + \sqrt{\lambda _{i}}} {1 -\sqrt{\lambda _{i}}}\right );}$$λ 1, …, λ n are the eigenvalues of the matrix \((Z_{1} - Z_{2})(Z_{1} -\overline{Z_{2}})-1(\overline{Z_{1}} -\overline{Z_{2}})(\overline{Z_{1}} - Z_{2})^{-1}\).
-
Barbaresco metrics
Let z(k) be a complex temporal (discrete time) stationary signal, i.e., its mean value is constant and its covariance function \(\mathbb{E}[z(k_{1})z^{{\ast}}(k_{2})]\) is only a function of k 1 − k 2. Such signal can be represented by its covariance n × n matrix R = ((r ij )), where \(r_{\mathit{ij}} = \mathbb{E}[z(i),z {\ast} (j)] = \mathbb{E}[z(n)z {\ast} (n - i + j)]\). It is a positive-definite Toeplitz (i.e. diagonal-constant) Hermitian matrix. In radar applications, such matrices represent the Doppler spectra of the signal. Matrices R admit a parametrization (complex ARM, i.e., m-th order autoregressive model) by partial autocorrelation coefficients defined recursively as the complex correlation between the forward and backward prediction errors of the (m − 1)-th order complex ARM.
Barbaresco [Barb12] defined, via this parametrization, a Bergman metric (cf. Chap. 7) on the bounded domain \(\mathbb{R} \times D_{n} \subset \mathbb{C}^{n}\) of above matrices R; here D is a Poincaré disk. He also defined a related Kähler metric on M × S n , where M is the set of positive-definite Hermitian matrices and SD n is the Siegel disk (cf. Siegel distance). Such matrices represent spatiotemporal stationary signals, i.e., in radar applications, the Doppler spectra and spatial directions of the signal.
Cf. Ruppeiner metric (Chap. 7) and Martin cepstrum distance (Chap. 21).
-
Distances between graphs of matrices
The graph G(A) of a complex m × n matrix A is the range (i.e., the span of columns) of the matrix R(A) = ([IA T])T. So, G(A) is a subspace of \(\mathbb{C}^{m+n}\) of all vectors v, for which the equation R(A)x = v has a solution.
A distance between graphs of matrices A and B is a distance between the subspaces G(A) and G(B). It can be an angle distance between subspaces or, for example, the following distance (cf. also the Kadets distance in Chap. 1 and the gap metric in Chap. 18).
The spherical gap distance between subspaces A and B is defined by
$$\displaystyle{\max \{\max _{x\in S(A)}d_{E}(x,S(B)),\max _{y\in S(B)}d_{E}(y,S(A))\},}$$where S(A), S(B) are the unit spheres of the subspaces A, B, d(z, C) is the point-set distance inf y ∈ C d(z, y) and d E (z, y) is the Euclidean distance.
-
Angle distances between subspaces
Consider the Grassmannian space G(m, n) of all n-dimensional subspaces of Euclidean space \(\mathbb{E}^{m}\); it is a compact Riemannian manifold of dimension n(m − n).
Given two subspaces A, B ∈ G(m, n), the principal angles \(\frac{\pi }{2} \geq \theta _{1} \geq \ldots \geq \theta _{n} \geq 0\) between them are defined, for \(k = 1,\ldots,n\), inductively by
$$\displaystyle{\cos \theta _{k} =\max _{x\in A}\max _{y\in B}x^{T}y = (x^{k})^{T}y^{k}}$$subject to the conditions | | x | | 2 = | | y | | 2 = 1, x T x i = 0, y T y i = 0, for 1 ≤ i ≤ k − 1, where | | . | | 2 is the Euclidean norm.
The principal angles can also be defined in terms of orthonormal matrices Q A and Q B spanning subspaces A and B, respectively: in fact, n ordered singular values of the matrix Q A Q B ∈ M n can be expressed as cosines cosθ 1, \(\ldots\), cosθ n .
The geodesic distance between subspaces A and B is (Wong, 1967) defined by
$$\displaystyle{\sqrt{2\sum _{i=1 }^{n }\theta _{i }^{2}}.}$$The Martin distance between subspaces A and B is defined by
$$\displaystyle{\sqrt{\ln \prod _{i=1 }^{n } \frac{1} {\cos ^{2}\theta _{i}}}.}$$In the case when the subspaces represent ARMs (autoregressive models), the Martin distance can be expressed in terms of the cepstrum of the autocorrelation functions of the models. Cf. the Martin cepstrum distance in Chap. 21.
The Asimov distance between subspaces A and B is defined by θ 1. It can be expressed also in terms of the Finsler metric on the manifold G(m, n).
The gap distance between subspaces A and B is defined by sinθ 1. It is the l 2 -norm of the difference of the orthogonal projectors onto A and B. Many versions of this distance are used in Control Theory (cf. gap metric in Chap. 18).
The Frobenius distance between subspaces A and B is defined by
$$\displaystyle{\sqrt{2\sum _{i=1 }^{n }\sin ^{2 } \theta _{i}}.}$$It is the Frobenius norm of the difference of above projectors onto A and B.
Similar distances \(\sqrt{\sum _{i=1 }^{n }\sin ^{2 } \theta _{i}}\), \(2\sin (\frac{\theta _{1}} {2})\), \(\sqrt{1 -\prod _{ i=1 }^{n }\cos ^{2 } \theta _{i}}\) and \(\arccos (\prod _{i=1}^{n}\cos \theta _{i})\) are called the chordal distance, chordal 2-norm distance, Binet–Cauchy distance and Fubini–Study distance (cf. Chap. 7), respectively.
-
Larsson–Villani metric
Let A and B be two arbitrary orthonormal m × n matrices of full rank, and let θ ij be the angle between the i-th column of A and the j-th column of B.
We call Larsson–Villani metric the distance between A and B (used by Larsson and Villani, 2000, for multivariate models) the square of which is defined by
$$\displaystyle{n -\sum _{i=1}^{n}\sum _{ j=1}^{n}\cos ^{2}\theta _{ \mathit{ij}}.}$$The square of usual Euclidean distance between A and B is \(2(1 -\sum _{i=1}^{n}\cos \theta _{\mathit{ii}})\).
For n = 1, above two distances are sinθ and \(\sqrt{2(1-\cos \theta )}\), respectively.
-
Lerman metric
Given a finite set X and real symmetric | X | × | X | matrices ((d 1(x, y))), ((d 2(x, y))) with x, y ∈ X, their Lerman semimetric (cf. Kendall τ distance on permutations in Chap. 11) is defined by
$$\displaystyle{\vert \{(\{x,y\},\{u,v\}): (d_{1}(x,y) - d_{1}(u,v))(d_{2}(x,y) - d_{2}(u,v)) < 0\}\vert {\vert X\vert + 1\choose 2}^{-2},}$$where ({x, y}, {u, v}) is any pair of unordered pairs of elements x, y, u, v from X.
Similar Kaufman semimetric between ((d 1(x, y))) and ((d 2(x, y))) is
$$\displaystyle{\frac{\vert \{(\{x,y\},\{u,v\}): (d_{1}(x,y) - d_{1}(u,v))(d_{2}(x,y) - d_{2}(u,v)) < 0\}\vert } {\vert \{(\{x,y\},\{u,v\}): (d_{1}(x,y) - d_{1}(u,v))(d_{2}(x,y) - d_{2}(u,v))\neq 0\}\vert }.}$$
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). Distances on Numbers, Polynomials, and Matrices. In: Encyclopedia of Distances. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-44342-2_12
Download citation
DOI: https://doi.org/10.1007/978-3-662-44342-2_12
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)