Abstract
Functional Analysis is the branch of Mathematics concerned with the study of spaces of functions. This usage of the word functional goes back to the calculus of variations which studies functions whose argument is a function. In the modern view, Functional Analysis is seen as the study of complete normed vector spaces, i.e., Banach spaces.
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.
Functional Analysis is the branch of Mathematics concerned with the study of spaces of functions. This usage of the word functional goes back to the calculus of variations which studies functions whose argument is a function. In the modern view, Functional Analysis is seen as the study of complete normed vector spaces, i.e., Banach spaces.
For any real number p ≥ 1, an example of a Banach space is given by L p -space of all Lebesgue-measurable functions whose absolute value’s p-th power has finite integral.
A Hilbert space is a Banach space in which the norm arises from an inner product. Also, in Functional Analysis are considered continuous linear operators defined on Banach and Hilbert spaces.
1 Metrics on Function Spaces
Let \(I \subset \mathbb{R}\) be an open interval (i.e., a nonempty connected open set) in \(\mathbb{R}\). A real function \(f: I \rightarrow \mathbb{R}\) is called real analytic on I if it agrees with its Taylor series in an open neighborhood \(U_{x_{0}}\) of every point x 0 ∈ I: \(f(x) =\sum _{ n=0}^{\infty }\frac{f^{(n)}(x_{ 0})} {n!} (x - x_{0})^{n}\) for any \(x \in U_{x_{0}}\). Let \(D \subset \mathbb{C}\) be a domain (i.e., a convex open set) in \(\mathbb{C}\).
A complex function \(f: D \rightarrow \mathbb{C}\) is called complex analytic (or, simply, analytic) on D if it agrees with its Taylor series in an open neighborhood of every point z 0 ∈ D. A complex function f is analytic on D if and only if it is holomorphic on D, i.e., if it has a complex derivative \(f^{^{{\prime}} }(z_{0}) =\lim _{z\rightarrow z_{0}} \frac{f(z)-f(z_{0})} {z-z_{0}}\) at every point z 0 ∈ D.
-
Integral metric
The integral metric is the L 1 -metric on the set C [a, b] of all continuous real (complex) functions on a given segment [a, b] defined by
$$\displaystyle{\int _{a}^{b}\vert f(x) - g(x)\vert \mathit{dx}.}$$The corresponding metric space is abbreviated by C [a, b] 1. It is a Banach space.
In general, for any compact topological space X, the integral metric is defined on the set of all continuous functions \(f: X \rightarrow \mathbb{R}\) (\(\mathbb{C}\)) by ∫ X | f(x) − g(x) | dx.
-
Uniform metric
The uniform metric (or sup metric ) is the L ∞ -metric on the set C [a, b] of all real (complex) continuous functions on a given segment [a, b] defined by
$$\displaystyle{\sup _{x\in [a,b]}\vert f(x) - g(x)\vert.}$$The corresponding metric space is abbreviated by C [a, b] ∞. It is a Banach space.
A generalization of C [a, b] ∞ is the space of continuous functions C(X), i.e., a metric space on the set of all continuous (more generally, bounded) functions \(f: X \rightarrow \mathbb{C}\) of a topological space X with the L ∞ -metric sup x ∈ X | f(x) − g(x) | .
In the case of the metric space C(X, Y ) of continuous (more generally, bounded) functions f: X → Y from one metric compactum (X, d X ) to another (Y, d Y ), the sup metric between two functions f, g ∈ C(X, Y ) is defined by \(\sup _{x\in X}d_{Y }(f(x),g(x))\).
The metric space C [a, b] ∞, as well as the metric space C [a, b] 1, are two of the most important cases of the metric space C [a, b] p, 1 ≤ p ≤ ∞, on the set C [a, b] with the L p -metric \((\int _{a}^{b}\vert f(x) - g(x)\vert ^{p}\mathit{dx})^{\frac{1} {p} }\). The space C [a, b] p is an example of an L p -space.
-
Dogkeeper distance
Given a metric space (X, d), the dogkeeper distance is a metric on the set of all functions f: [0, 1] → X, defined by
$$\displaystyle{\inf _{\sigma }\sup _{t\in [0,1]}d(f(t),g(\sigma (t))),}$$where σ: [0, 1] → [0, 1] is a continuous, monotone increasing function such that σ(0) = 0, σ(1) = 1. This metric is a special case of the Fréchet metric.
For the case, when (X, d) is Euclidean space \(\mathbb{R}^{n}\), this metric is the original (1906) Fréchet distance between parametric curves \(f,g: [0,1] \rightarrow \mathbb{R}^{n}\). This distance can be seen as the length of the shortest leash that is sufficient for the man and the dog to walk their paths f and g from start to end. For example, the Fréchet distance between two concentric circles of radius r 1 and r 2 respectively is | r 1 − r 2 | .
The discrete Fréchet distance (or coupling distance, Eiter and Mannila, 1994) is an approximation of the Fréchet metric for polygonal curves f and g. It considers only positions of the leash where its endpoints are located at vertices of f and g. So, this distance is the minimum, over all order-preserving pairings of vertices in f and g, of the maximal Euclidean distance between paired vertices.
-
Bohr metric
Let \(\mathbb{R}\) be a metric space with a metric ρ. A continuous function \(f: \mathbb{R} \rightarrow \mathbb{R}\) is called almost periodic if, for every ε > 0, there exists l = l(ε) > 0 such that every interval [t 0, t 0 + l(ε)] contains at least one number τ for which ρ(f(t), f(t +τ)) < ε for \(-\infty < t < +\infty \).
The Bohr metric is the norm metric | | f − g | | on the set AP of all almost periodic functions defined by the norm
$$\displaystyle{\vert \vert f\vert \vert =\sup _{-\infty <t<+\infty }\vert f(t)\vert.}$$It makes AP a Banach space. Some generalizations of almost periodic functions were obtained using other norms; cf. Stepanov distance, Weyl distance, Besicovitch distance and Bochner metric.
-
Stepanov distance
The Stepanov distance is a distance on the set of all measurable functions \(f: \mathbb{R} \rightarrow \mathbb{C}\) with summable p-th power on each bounded integral, defined by
$$\displaystyle{\sup _{x\in \mathbb{R}}\left (\frac{1} {l} \int _{x}^{x+l}\vert f(x) - g(x)\vert ^{p}\mathit{dx}\right )^{1/p}.}$$The Weyl distance is a distance on the same set defined by
$$\displaystyle{\lim _{l\rightarrow \infty }\sup _{x\in \mathbb{R}}\left (\frac{1} {l} \int _{x}^{x+l}\vert f(x) - g(x)\vert ^{p}\mathit{dx}\right )^{1/p}.}$$ -
Besicovitch distance
The Besicovitch distance is a distance on the set of all measurable functions \(f: \mathbb{R} \rightarrow \mathbb{C}\) with summable p-th power on each bounded integral defined by
$$\displaystyle{\left (\overline{\lim }_{T\rightarrow \infty } \frac{1} {2T}\int _{-T}^{T}\vert f(x) - g(x)\vert ^{p}\mathit{dx}\right )^{1/p}.}$$The generalized Besicovitch almost periodic functions correspond to this distance.
-
Bochner metric
Given a measure space \((\Omega,\mathcal{A},\mu )\), a Banach space (V, | | . | | V ), and 1 ≤ p ≤ ∞, the Bochner space (or Lebesgue–Bochner space) \(L^{p}(\Omega,V )\) is the set of all measurable functions \(f: \Omega \rightarrow V\) such that \(\vert \vert f\vert \vert _{L^{p}(\Omega,V )} \leq \infty \).
Here the Bochner norm \(\vert \vert f\vert \vert _{L^{p}(\Omega,V )}\) is defined by \((\int _{\Omega }\vert \vert f(\omega )\vert \vert _{V }^{p}d\mu (\omega ))^{\frac{1} {p} }\) for 1 ≤ p < ∞, and, for p = ∞, by \(\mathrm{ess}\sup _{\omega \in \Omega }\vert \vert f(\omega )\vert \vert _{V }\).
-
Bergman p -metric
Given 1 ≤ p < ∞, let \(L_{p}(\Delta )\) be the L p -space of Lebesgue measurable functions f on the unit disk \(\Delta =\{ z \in \mathbb{C}: \vert z\vert < 1\}\) with \(\vert \vert f\vert \vert _{p} = \left (\int _{\Delta }\vert f(z)\vert ^{p}\mu (\mathit{dz})\right )^{\frac{1} {p} } < \infty \).
The Bergman space \(L_{p}^{a}(\Delta )\) is the subspace of \(L_{p}(\Delta )\) consisting of analytic functions, and the Bergman p -metric is the L p -metric on \(L_{p}^{a}(\Delta )\) (cf. Bergman metric in Chap. 7). Any Bergman space is a Banach space.
-
Bloch metric
The Bloch space B on the unit disk \(\Delta =\{ z \in \mathbb{C}: \vert z\vert < 1\}\) is the set of all analytic functions f on \(\Delta \) such that \(\vert \vert f\vert \vert _{B} =\sup _{z\in \Delta }(1 -\vert z\vert ^{2})\vert f^{^{{\prime}} }(z)\vert < \infty \). Using the complete seminorm | | . | | B , a norm on B is defined by
$$\displaystyle{\vert \vert f\vert \vert = \vert f(0)\vert + \vert \vert f\vert \vert _{B}.}$$The Bloch metric is the norm metric | | f − g | | on B. It makes B a Banach space.
-
Besov metric
Given 1 < p < ∞, the Besov space B p on the unit disk \(\Delta =\{ z \in \mathbb{C}: \vert z\vert < 1\}\) is the set of all analytic functions f in \(\Delta \) such that \(\vert \vert f\vert \vert _{B_{p}} = \left (\int _{\Delta }(1 -\vert z\vert ^{2})^{p}\vert f^{^{{\prime}} }(z)\vert ^{p}d\lambda (z)\right )^{\frac{1} {p} } < \infty \), where \(d\lambda (z) = \frac{\mu (\mathit{dz})} {(1-\vert z\vert ^{2})^{2}}\) is the Möbius invariant measure on \(\Delta \). Using the complete seminorm \(\vert \vert.\vert \vert _{B_{p}}\), the Besov norm on B p is defined by
$$\displaystyle{\vert \vert f\vert \vert = \vert f(0)\vert + \vert \vert f\vert \vert _{B_{p}}.}$$The Besov metric is the norm metric | | f − g | | on B p .
It makes B p a Banach space. The set B 2 is the classical Dirichlet space of functions analytic on \(\Delta \) with square integrable derivative, equipped with the Dirichlet metric . The Bloch space B can be considered as B ∞ .
-
Hardy metric
Given 1 ≤ p < ∞, the Hardy space \(H^{p}(\Delta )\) is the class of functions, analytic on the unit disk \(\Delta =\{ z \in \mathbb{C}: \vert z\vert < 1\}\), and satisfying the following growth condition for the Hardy norm \(\vert \vert.\vert \vert _{H^{p}}\):
$$\displaystyle{\vert \vert f\vert \vert _{H^{p}(\Delta )} =\sup _{0<r<1}\left (\frac{1} {2\pi }\int _{0}^{2\pi }\vert f(re^{i\theta })\vert ^{p}d\theta \right )^{\frac{1} {p} } < \infty.}$$The Hardy metric is the norm metric \(\vert \vert f - g\vert \vert _{H^{p}(\Delta )}\) on \(H^{p}(\Delta )\). It makes \(H^{p}(\Delta )\) a Banach space.
In Complex Analysis, the Hardy spaces are analogs of the L p -spaces of Functional Analysis. Such spaces are applied in Mathematical Analysis itself, and also in Scattering Theory and Control Theory (cf. Chap. 18).
-
Part metric
The part metric is a metric on a domain D of \(\mathbb{R}^{2}\) defined for any \(x,y \in \mathbb{R}^{2}\) by
$$\displaystyle{\sup _{f\in H^{+}}\left \vert \ln \left (\frac{f(x)} {f(y)}\right )\right \vert,}$$where H + is the set of all positive harmonic functions on the domain D.
A twice-differentiable real function \(f: D \rightarrow \mathbb{R}\) is called harmonic on D if its Laplacian \(\Delta f = \frac{\partial ^{2}f} {\partial x_{1}^{2}} + \frac{\partial ^{2}f} {\partial x_{2}^{2}}\) vanishes on D.
-
Orlicz metric
Let M(u) be an even convex function of a real variable which is increasing for u positive, and \(\lim _{u\rightarrow 0}u^{-1}M(u) =\lim _{u\rightarrow \infty }u(M(u))^{-1} = 0\). In this case the function \(p(v) = M^{^{{\prime}} }(v)\) does not decrease on [0, ∞), \(p(0) =\lim _{v\rightarrow 0}p(v) = 0\), and p(v) > 0 when v > 0. Writing M(u) = ∫ 0 | u | p(v)dv, and defining \(N(u) =\int _{ 0}^{\vert u\vert }p^{-1}(v)dv\), one obtains a pair (M(u), N(u)) of complementary functions.
Let (M(u), N(u)) be a pair of complementary functions, and let G be a bounded closed set in \(\mathbb{R}^{n}\). The Orlicz space L M ∗(G) is the set of Lebesgue-measurable functions f on G satisfying the following growth condition for the Orlicz norm | | f | | M :
$$\displaystyle{\vert \vert f\vert \vert _{M} =\sup \left \{\int _{G}f(t)g(t)\mathit{dt}:\int _{G}N(g(t))\mathit{dt} \leq 1\right \} < \infty.}$$The Orlicz metric is the norm metric | | f − g | | M on L M ∗(G). It makes L M ∗(G) a Banach space [Orli32].
When M(u) = u p, 1 < p < ∞, L M ∗(G) coincides with the space L p (G), and, up to scalar factor, the L p -norm | | f | | p coincides with | | f | | M .
The Orlicz norm is equivalent to the Luxemburg norm \(\vert \vert f\vert \vert _{(M)} =\inf \{\lambda > 0:\int _{G}M(\lambda ^{-1}f(t))\mathit{dt} \leq 1\}\); in fact, | | f | | (M) ≤ | | f | | M ≤ 2 | | f | | (M).
-
Orlicz–Lorentz metric
Let w: (0, ∞) → (0, ∞) be a nonincreasing function. Let M: [0, ∞) → [0, ∞) be a nondecreasing and convex function with M(0) = 0. Let G be a bounded closed set in \(\mathbb{R}^{n}\).
The Orlicz–Lorentz space L w, M (G) is the set of all Lebesgue-measurable functions f on G satisfying the following growth condition for the Orlicz–Lorentz norm | | f | | w, M :
$$\displaystyle{\vert \vert f\vert \vert _{w,M} =\inf \left \{\lambda > 0:\int _{ 0}^{\infty }w(x)M\left (\frac{f^{{\ast}}(x)} {\lambda } \right )\mathit{dx} \leq 1\right \} < \infty,}$$where f ∗(x) = sup{t: μ( | f | ≥ t) ≥ x} is the nonincreasing rearrangement of f.
The Orlicz–Lorentz metric is the norm metric | | f − g | | w, M on L w, M (G). It makes L w, M (G) a Banach space.
The Orlicz–Lorentz space is a generalization of the Orlicz space L M ∗(G) (cf. Orlicz metric), and the Lorentz space L w, q (G), 1 ≤ q < ∞, of all Lebesgue-measurable functions f on G satisfying the following growth condition for the Lorentz norm:
$$\displaystyle{\vert \vert f\vert \vert _{w,q} = \left (\int _{0}^{\infty }w(x)(f^{{\ast}}(x))^{q}\right )^{\frac{1} {q} } < \infty.}$$ -
Hölder metric
Let L α(G) be the set of all bounded continuous functions f defined on a subset G of \(\mathbb{R}^{n}\), and satisfying the Hölder condition on G. Here, a function f satisfies the Hölder condition at a point y ∈ G with index (or order) α, 0 < α ≤ 1, and with coefficient A(y), if \(\vert f(x) - f(y)\vert \leq A(y)\vert x - y\vert ^{\alpha }\) for all x ∈ G sufficiently close to y.
If A = sup y ∈ G (A(y)) < ∞, the Hölder condition is called uniform on G, and A is called the Hölder coefficient of G. The quantity \(\vert f\vert _{\alpha } =\sup _{x,y\in G}\frac{\vert f(x)-f(y)\vert } {\vert x-y\vert ^{\alpha }}\), 0 ≤ α ≤ 1, is called the Hölder α-seminorm of f, and the Hölder norm of f is defined by
$$\displaystyle{\vert \vert f\vert \vert _{L^{\alpha }(G)} =\sup _{x\in G}\vert f(x)\vert + \vert f\vert _{\alpha }.}$$The Hölder metric is the norm metric \(\vert \vert f - g\vert \vert _{L^{\alpha }(G)}\) on L α(G). It makes L α(G) a Banach space.
-
Sobolev metric
The Sobolev space W k, p is a subset of an L p -space such that f and its derivatives up to order k have a finite L p -norm. Formally, given a subset G of \(\mathbb{R}^{n}\), define
$$\displaystyle{W^{k,p} = W^{k,p}(G) =\{ f \in L_{ p}(G): f^{(i)} \in L_{ p}(G),1 \leq i \leq k\},}$$where \(f^{(i)} = \partial _{x_{1}}^{\alpha _{1}}\ldots \partial _{ x_{n}}^{\alpha _{n}}f\), \(\alpha _{1} +\ldots +\alpha _{n} = i\), and the derivatives are taken in a weak sense. The Sobolev norm on W k, p is defined by
$$\displaystyle{\vert \vert f\vert \vert _{k,p} =\sum _{ i=0}^{k}\vert \vert f^{(i)}\vert \vert _{ p}.}$$In fact, it is enough to take only the first and last in the sequence, i.e., the norm defined by \(\vert \vert f\vert \vert _{k,p} = \vert \vert f\vert \vert _{p} + \vert \vert f^{(k)}\vert \vert _{p}\) is equivalent to the norm above.
For p = ∞, the Sobolev norm is equal to the essential supremum of | f | : \(\vert \vert f\vert \vert _{k,\infty } = \mathit{ess}\sup _{x\in G}\vert f(x)\vert \), i.e., it is the infimum of all numbers \(a \in \mathbb{R}\) for which | f(x) | > a on a set of measure zero.
The Sobolev metric is the norm metric | | f − g | | k, p on W k, p. It makes W k, p a Banach space.
The Sobolev space W k, 2 is denoted by H k. It is a Hilbert space for the inner product \(\langle f,g\rangle _{k} =\sum _{ i=1}^{k}\langle f^{(i)},g^{(i)}\rangle _{L_{2}} =\sum _{ i=1}^{k}\int _{G}f^{(i)}\overline{g}^{(i)}\mu (d\omega )\).
-
Variable exponent space metrics
Let G be a nonempty open subset of \(\mathbb{R}^{n}\), and let \(p: G \rightarrow [1,\infty )\) be a measurable bounded function, called a variable exponent. The variable exponent Lebesgue space L p(. )(G) is the set of all measurable functions \(f: G \rightarrow \mathbb{R}\) for which the modular \(\varrho _{p(.)}(f) =\int _{G}\vert f(x)\vert ^{p(x)}\mathit{dx}\) is finite. The Luxemburg norm on this space is defined by
$$\displaystyle{\vert \vert f\vert \vert _{p(.)} =\inf \{\lambda > 0:\varrho _{p(.)}(f/\lambda ) \leq 1\}.}$$The variable exponent Lebesgue space metric is the norm metric | | f − g | | p(. ) on L p(. )(G).
A variable exponent Sobolev space W 1, p(. )(G) is a subspace of L p(. )(G) consisting of functions f whose distributional gradient exists almost everywhere and satisfies the condition | ∇f | ∈ L p(. )(G). The norm
$$\displaystyle{\vert \vert f\vert \vert _{1,p(.)} = \vert \vert f\vert \vert _{p(.)} + \vert \vert \nabla f\vert \vert _{p(.)}}$$makes W 1, p(. )(G) a Banach space. The variable exponent Sobolev space metric is the norm metric | | f − g | | 1, p(. ) on W 1, p(. ).
-
Schwartz metric
The Schwartz space (or space of rapidly decreasing functions) \(S(\mathbb{R}^{n})\) is the class of all Schwartz functions, i.e., infinitely-differentiable functions \(f: \mathbb{R}^{n} \rightarrow \mathbb{C}\) that decrease at infinity, as do all their derivatives, faster than any inverse power of x. More precisely, f is a Schwartz function if we have the following growth condition:
$$\displaystyle{\vert \vert f\vert \vert _{\alpha \beta } =\sup _{x\in \mathbb{R}^{n}}\left \vert x_{1}^{\beta _{1} }\ldots x_{n}^{\beta _{n} }\frac{\partial ^{\alpha _{1}+\ldots +\alpha _{n}}f(x_{1},\ldots,x_{n})} {\partial x_{1}^{\alpha _{1}}\ldots \partial x_{n}^{\alpha _{n}}} \right \vert < \infty }$$for any nonnegative integer vectors α and β. The family of seminorms | | . | | α β defines a locally convex topology of \(S(\mathbb{R}^{n})\) which is metrizable and complete. The Schwartz metric is a metric on \(S(\mathbb{R}^{n})\) which can be obtained using this topology (cf. countably normed space in Chap. 2).
The corresponding metric space on \(S(\mathbb{R}^{n})\) is a Fréchet space in the sense of Functional Analysis, i.e., a locally convex F-space.
-
Bregman quasi-distance
Let \(G \subset \mathbb{R}^{n}\) be a closed set with the nonempty interior G 0. Let f be a Bregman function with zone G.
The Bregman quasi-distance \(D_{f}: G \times G^{0} \rightarrow \mathbb{R}_{\geq 0}\) is defined by
$$\displaystyle{D_{f}(x,y) = f(x) - f(y) -\langle \nabla f(y),x - y\rangle,}$$where \(\nabla f = ( \frac{\partial f} {\partial x_{1}},\ldots \frac{\partial f} {\partial x_{n}})\). D f (x, y) = 0 if and only if x = y. Also \(D_{f}(x,y) + D_{f}(y,z) - D_{f}(x,z) =\langle \nabla f(z) -\nabla f(y),x - y\rangle\) but, in general, D f does not satisfy the triangle inequality, and is not symmetric.
A real-valued function f whose effective domain contains G is called a Bregman function with zone G if the following conditions hold:
-
1.
f is continuously differentiable on G 0;
-
2.
f is strictly convex and continuous on G;
-
3.
For all \(\delta \in \mathbb{R}\) the partial level sets \(\Gamma (x,\delta ) =\{ y \in G^{0}: D_{f}(x,y) \leq \delta \}\) are bounded for all x ∈ G;
-
4.
If {y n } n ⊂ G 0 converges to y ∗, then D f (y ∗, y n ) converges to 0;
-
5.
If {x n } n ⊂ G and {y n } n ⊂ G 0 are sequences such that {x n } n is bounded, lim n → ∞ y n = y ∗, and \(\lim _{n\rightarrow \infty }D_{f}(x_{n},y_{n}) = 0\), then \(\lim _{n\rightarrow \infty }x_{n} = y^{{\ast}}\).
When \(G = \mathbb{R}^{n}\), a sufficient condition for a strictly convex function to be a Bregman function has the form: \(\lim _{\vert \vert x\vert \vert \rightarrow \infty }\frac{f(x)} {\vert \vert x\vert \vert } = \infty \).
-
1.
2 Metrics on Linear Operators
A linear operator is a function T: V → W between two vector spaces V, W over a field \(\mathbb{F}\), that is compatible with their linear structures, i.e., for any x, y ∈ V and any scalar \(k \in \mathbb{F}\), we have the following properties: \(T(x + y) = T(x) + T(y)\), and T(kx) = kT(x).
-
Operator norm metric
Consider the set of all linear operators from a normed space (V, | | . | | V ) into a normed space (W, | | . | | W ). The operator norm | | T | | of a linear operator T: V → W is defined as the largest value by which T stretches an element of V, i.e.,
$$\displaystyle{\vert \vert T\vert \vert =\sup _{\vert \vert v\vert \vert _{V }\neq 0}\frac{\vert \vert T(v)\vert \vert _{W}} {\vert \vert v\vert \vert _{V }} =\sup _{\vert \vert v\vert \vert _{V }=1}\vert \vert T(v)\vert \vert _{W} =\sup _{\vert \vert v\vert \vert _{V }\leq 1}\vert \vert T(v)\vert \vert _{W}.}$$A linear operator T: V → W from a normed space V into a normed space W is called bounded if its operator norm is finite. For normed spaces, a linear operator is bounded if and only if it is continuous.
The operator norm metric is a norm metric on the set B(V, W) of all bounded linear operators from V into W, defined by
$$\displaystyle{\vert \vert T - P\vert \vert.}$$The space (B(V, W), | | . | | ) is called the space of bounded linear operators. This metric space is complete if W is. If V = W is complete, the space B(V, V ) is a Banach algebra, as the operator norm is a submultiplicative norm.
A linear operator T: V → W from a Banach space V into another Banach space W is called compact if the image of any bounded subset of V is a relatively compact subset of W. Any compact operator is bounded (and, hence, continuous). The space (K(V, W), | | . | | ) on the set K(V, W) of all compact operators from V into W with the operator norm | | . | | is called the space of compact operators.
-
Nuclear norm metric
Let B(V, W) be the space of all bounded linear operators mapping a Banach space (V, | | . | | V ) into another Banach space (W, | | . | | W ). Let the Banach dual of V be denoted by \(V ^{^{{\prime}} }\), and the value of a functional \(x^{^{{\prime}} } \in V ^{^{{\prime}} }\) at a vector x ∈ V by \(\langle x,x^{^{{\prime}} }\rangle\).
A linear operator T ∈ B(V, W) is called a nuclear operator if it can be represented in the form \(x\mapsto T(x) =\sum _{ i=1}^{\infty }\langle x,x_{i}^{^{{\prime}} }\rangle y_{i}\), where \(\{x_{i}^{^{{\prime}} }\}_{i}\) and {y i } i are sequences in \(V ^{^{{\prime}} }\) and W, respectively, such that \(\sum _{i=1}^{\infty }\vert \vert x_{i}^{^{{\prime}} }\vert \vert _{V ^{^{{\prime}}}}\vert \vert y_{i}\vert \vert _{W} < \infty \). This representation is called nuclear, and can be regarded as an expansion of T as a sum of operators of rank 1 (i.e., with one-dimensional range). The nuclear norm of T is defined as
$$\displaystyle{\vert \vert T\vert \vert _{\mathit{nuc}} =\inf \sum _{ i=1}^{\infty }\vert \vert x_{ i}^{^{{\prime}} }\vert \vert _{V ^{^{{\prime}}}}\vert \vert y_{i}\vert \vert _{W},}$$where the infimum is taken over all possible nuclear representations of T.
The nuclear norm metric is the norm metric | | T − P | | nuc on the set N(V, W) of all nuclear operators mapping V into W. The space (N(V, W), | | . | | nuc ), called the space of nuclear operators, is a Banach space.
A nuclear space is defined as a locally convex space for which all continuous linear functions into an arbitrary Banach space are nuclear operators. A nuclear space is constructed as a projective limit of Hilbert spaces H α with the property that, for each α ∈ I, one can find β ∈ I such that H β ⊂ H α , and the embedding operator H β ∋ x → x ∈ H α is a Hilbert–Schmidt operator. A normed space is nuclear if and only if it is finite-dimensional.
-
Finite nuclear norm metric
Let F(V, W) be the space of all linear operators of finite rank (i.e., with finite-dimensional range) mapping a Banach space (V, | | . | | V ) into another Banach space (W, | | . | | W ). A linear operator T ∈ F(V, W) can be represented in the form \(x\mapsto T(x) =\sum _{ i=1}^{n}\langle x,x_{i}^{^{{\prime}} }\rangle y_{i}\), where \(\{x_{i}^{^{{\prime}} }\}_{i}\) and {y i } i are sequences in \(V ^{^{{\prime}} }\) (Banach dual of V ) and W, respectively, and \(\langle x,x^{^{{\prime}} }\rangle\) is the value of a functional \(x^{^{{\prime}} } \in V ^{^{{\prime}} }\) at a vector x ∈ V. The finite nuclear norm of T is defined as
$$\displaystyle{\vert \vert T\vert \vert _{\mathit{fnuc}} =\inf \sum _{ i=1}^{n}\vert \vert x_{ i}^{^{{\prime}} }\vert \vert _{V ^{^{{\prime}}}}\vert \vert y_{i}\vert \vert _{W},}$$where the infimum is taken over all possible finite representations of T.
The finite nuclear norm metric is the norm metric | | T − P | | fnuc on F(V, W). The space (F(V, W), | | . | | fnuc ) is called the space of operators of finite rank. It is a dense linear subspace of the space of nuclear operators N(V, W).
-
Hilbert–Schmidt norm metric
Consider the set of all linear operators from a Hilbert space \((H_{1},\vert \vert.\vert \vert _{H_{1}})\) into a Hilbert space \((H_{2},\vert \vert.\vert \vert _{H_{2}})\). The Hilbert–Schmidt norm | | T | | HS of a linear operator T: H 1 → H 2 is defined by
$$\displaystyle{\vert \vert T\vert \vert _{\mathit{HS}} = \left (\sum _{\alpha \in I}\vert \vert T(e_{\alpha })\vert \vert _{H_{2}}^{2}\right )^{1/2},}$$where (e α ) α ∈ I is an orthonormal basis in H 1. A linear operator T: H 1 → H 2 is called a Hilbert–Schmidt operator if | | T | | HS 2 < ∞.
The Hilbert–Schmidt norm metric is the norm metric | | T − P | | HS on the set S(H 1, H 2) of all Hilbert–Schmidt operators from H 1 into H 2. In Euclidean space | | . | | HS is also called Frobenius norm; cf. Frobenius norm metric in Chap. 12.
For \(H_{1} = H_{2} = H\), the algebra S(H, H) = S(H) with the Hilbert–Schmidt norm is a Banach algebra. It contains operators of finite rank as a dense subset, and is contained in the space K(H) of compact operators. An inner product \(\langle,\rangle _{\mathit{HS}}\) on S(H) is defined by \(\langle T,P\rangle _{\mathit{HS}} =\sum _{\alpha \in I}\langle T(e_{\alpha }),P(e_{\alpha })\rangle\), and \(\vert \vert T\vert \vert _{\mathit{HS}} =\langle T,T\rangle _{\mathit{HS}}^{1/2}\). So, S(H) is a Hilbert space (independent of the chosen basis (e α ) α ∈ I ).
-
Trace-class norm metric
Given a Hilbert space H, the trace-class norm of a linear operator T: H → H is
$$\displaystyle{\vert \vert T\vert \vert _{\mathit{tc}} =\sum _{\alpha \in I}\langle \vert T\vert (e_{\alpha }),e_{\alpha }\rangle,}$$where | T | is the absolute value of T in the Banach algebra B(H) of all bounded operators from H into itself, and (e α ) α ∈ I is an orthonormal basis of H.
An operator T: H → H is called a trace-class operator if | | T | | tc < ∞. Any such operator is the product of two Hilbert–Schmidt operators.
The trace-class norm metric is the norm metric | | T − P | | tc on the set L(H) of all trace-class operators from H into itself.
The set L(H) with the norm | | . | | tc forms a Banach algebra which is contained in the algebra K(H) (of all compact operators from H into itself), and contains the algebra S(H) of all Hilbert–Schmidt operators from H into itself.
-
Schatten p -class norm metric
Let 1 ≤ p < ∞. Given a separable Hilbert space H, the Schatten p-class norm of a compact linear operator T: H → H is defined by
$$\displaystyle{\vert \vert T\vert \vert _{\mathit{Sch}}^{p} = \left (\sum _{ n}\vert s_{n}\vert ^{p}\right )^{\frac{1} {p} },}$$where {s n } n is the sequence of singular values of T. A compact operator T: H → H is called a Schatten p-class operator if | | T | | Sch p < ∞.
The Schatten p -class norm metric is the norm metric | | T − P | | Sch p on the set S p (H) of all Schatten p-class operators from H onto itself. The set S p (H) with the norm | | . | | Sch p forms a Banach space. S 1(H) is the trace-class of H, and S 2(H) is the Hilbert–Schmidt class of H. Cf. Schatten norm metric (in Chap. 12) for which trace and Frobenius norm metrics are cases p = 1 and p = 2, respectively.
-
Continuous dual space
For any vector space V over some field, its algebraic dual space is the set of all linear functionals on V.
Let (V, | | . | | ) be a normed vector space. Let \(V ^{^{{\prime}} }\) be the set of all continuous linear functionals T from V into the base field (\(\mathbb{R}\) or \(\mathbb{C}\)). Let \(\vert \vert.\vert \vert ^{^{{\prime}} }\) be the operator norm on \(V ^{^{{\prime}} }\) defined by
$$\displaystyle{\vert \vert T\vert \vert ^{^{{\prime}} } =\sup _{\vert \vert x\vert \vert \leq 1}\vert T(x)\vert.}$$The space \((V ^{^{{\prime}} },\vert \vert.\vert \vert ^{^{{\prime}} })\) is a Banach space which is called the continuous dual (or Banach dual) of (V, | | . | | ).
The continuous dual of the metric space l p n (l p ∞) is l q n (l q ∞, respectively), where q is defined by \(\frac{1} {p} + \frac{1} {q} = 1\). The continuous dual of l 1 n (l 1 ∞) is l ∞ n (l ∞ ∞, respectively).
-
Distance constant of operator algebra
Let \(\mathcal{A}\) be an subalgebra of B(H), the algebra of all bounded operators on a Hilbert space H. For any operator T ∈ B(H), let P be a projection, P ⊥ be its orthogonal complement and \(\beta (T,\mathcal{A}) =\sup \{ \vert \vert P^{\perp }TP\vert \vert: P^{\perp }\mathcal{A}P = (0)\}\).
Let \(\mathit{dist}(T,\mathcal{A}) =\inf _{A\in \mathcal{A}}\vert \vert T - A\vert \vert \) be the distance of T to algebra \(\mathcal{A}\); cf. matrix nearness problems in Chap. 12. It holds \(\mathit{dist}(T,\mathcal{A}) \geq \beta (T,\mathcal{A})\).
The algebra \(\mathcal{A}\) is reflexive if \(\beta (T,\mathcal{A}) = 0\) implies \(T \in \mathcal{A}\); it is hyperreflexive if there exists a constant C ≥ 1 such that, for any operator T ∈ B(H), it holds
$$\displaystyle{\mathit{dist}(T,\mathcal{A}) \leq C\beta (T,\mathcal{A}).}$$The smallest such C is called the distance constant of the algebra \(\mathcal{A}\).
In the case of a reflexive algebra of matrices with nonzero entries specified by a given pattern, the problem of finding the distance constant can be formulated as a matrix-filling problem: given a partially completed matrix, fill in the remaining entries so that the operator norm of the resulting complete matrix is minimized.
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 in Functional Analysis. In: Encyclopedia of Distances. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-44342-2_13
Download citation
DOI: https://doi.org/10.1007/978-3-662-44342-2_13
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)