Operator norm

In mathematics, the operator norm is a means to measure the "size" of certain linear operators. Formally, it is a norm defined on the space of bounded linear operators between two given normed vector spaces. In the special case where the domain is the normed vector space V with norm derived from inner product ${\langle \,-\,|\,-\,\rangle }_{V}:\;{{\bar {V}}\times V}\rightarrow \mathbb {K}$ , where $\mathbb {K} \,{\text{ is either }}\,\mathbb {R} \,{\text{ or }}\,\mathbb {C}$ , it corresponds to the magnitude of the largest eigenvalue of the operator.

Introduction and definition

Given two normed vector spaces V and W (over the same base field, either the real numbers R or the complex numbers C), a linear map A : V → W is continuous if and only if there exists a real number c such that

\|Av\|\leq c\|v\|\quad {\mbox{ for all }}v\in V.

The norm on the left is the one in W and the norm on the right is the one in V. Intuitively, the continuous operator A never increases the length of any vector more than by a factor of c. Thus the image of a bounded set under a continuous operator is also bounded. Because of this property, the continuous linear operators are also known as bounded operators. In order to "measure the size" of A, it then seems natural to take the infimum of the numbers c such that the above inequality holds for all v in V. In other words, we measure the "size" of A by how much it "lengthens" vectors in the "biggest" case. So we define the operator norm of A as

\|A\|_{op}=\inf\{c\geq 0:\|Av\|\leq c\|v\|{\mbox{ for all }}v\in V\}.

The infimum is attained as the set of all such c is closed, nonempty, and bounded from below.^[1]

It is important to bear in mind that this operator norm depends on the choice of norms for the normed vector spaces V and W.

Examples

Every real m-by-n matrix corresponds to a linear map from Rⁿ to R^m. Each pair of the plethora of (vector) norms applicable to real vector spaces induces an operator norm for all m-by-n matrices of real numbers; these induced norms form a subset of matrix norms.

If we specifically choose the Euclidean norm on both Rⁿ and R^m, then we obtain the matrix norm which to a given matrix A assigns the square root of the largest eigenvalue of the matrix A^*A (where A^* denotes the conjugate transpose of A). This is equivalent to assigning the largest singular value of A.

Passing to a typical infinite-dimensional example, consider the sequence space $l^2$ defined by

l^2 = \{ (a_n)_{n \geq 1}: \; a_n \in \mathbb{C}, \; \sum_n |a_n|^2 < \infty \}.

This can be viewed as an infinite-dimensional analogue of the Euclidean space Cⁿ. Now take a bounded sequence s = (s_n ). The sequence s is an element of the space l ^∞, with a norm given by

\| s \|_{\infty} = \sup _n |s_n| .

Define an operator T_s by simply multiplication:

(a_n) \stackrel{T_s}{\longrightarrow} (s_n \cdot a_n) .

The operator T _s is bounded with operator norm

\| T_s\|_{op} = \| s \|_{\infty}.

One can extend this discussion directly to the case where l ² is replaced by a general L^p space with p > 1 and l^∞ replaced by L^∞.

Equivalent definitions

One can show that the following definitions are all equivalent:

{\begin{aligned}\|A\|_{{op}}&=\inf\{c\geq 0:\|Av\|\leq c\|v\|{\mbox{ for all }}v\in V\}\\&=\sup\{\|Av\|:v\in V{\mbox{ with }}\|v\|\leq 1\}\\&=\sup\{\|Av\|:v\in V{\mbox{ with }}\|v\|=1\}\\&=\sup \left\{{\frac {\|Av\|}{\|v\|}}:v\in V{\mbox{ with }}v\neq 0\right\}.\end{aligned}}

Properties

The operator norm is indeed a norm on the space of all bounded operators between V and W. This means

\|A\|_{op} \ge 0 \mbox{ and } \|A\|_{op} = 0 \mbox{ if and only if } A = 0 ,

\|aA\|_{op} = |a| \|A\|_{op} \quad\mbox{ for every scalar } a ,

\|A + B\|_{op} \le \|A\|_{op} + \|B\|_{op} .

The following inequality is an immediate consequence of the definition:

\|Av\| \le \|A\|_{op} \|v\| \quad\mbox{ for every } v\in V .

The operator norm is also compatible with the composition, or multiplication, of operators: if V, W and X are three normed spaces over the same base field, and A : V → W and B: W → X are two bounded operators, then it is a sub-multiplicative norm, i.e.:

\|BA\|_{op} \le \|B\|_{op} \|A\|_{op} .

For bounded operators on V, this implies that operator multiplication is jointly continuous.

It follows from the definition that a sequence of operators converge in operator norm means they converge uniformly on bounded sets.

Table of common operator norms

Some common operator norms are easy to calculate, and others are NP-hard. Except for the NP-hard norms, all these norms can be calculated in N² operations (for a N x N matrix), with the exception of the $\ell _{2}-\ell _{2}$ norm (which requires N³ operations for the exact answer, or fewer if you approximate it with the power method or Lanczos iterations).

Computability of Operator Norms^[2]
	Co-domain
		$\ell _{1}$	$\ell _{2}$	$\ell_\infty$
Domain	$\ell _{1}$	Maximum $\ell _{1}$ norm of a column	Maximum $\ell _{2}$ norm of a column	Maximum $\ell _{\infty }$ norm of a column
	$\ell _{2}$	NP-hard	Maximum singular value	Maximum $\ell _{2}$ of a row
	$\ell_\infty$	NP-hard	NP-hard	Maximum $\ell _{1}$ norm of a row

The norm of the adjoint or transpose can be computed as follows. We have that for any $p,q$ , then $\|A\|_{p\rightarrow q}=\|A^{*}\|_{q'\rightarrow p'}$ where $p',q'$ are Hölder conjugate to $p,q$ , i.e., $1/p+1/p'=1$ and $1/q+1/q'=1$ .

Operators on a Hilbert space

Suppose H is a real or complex Hilbert space. If A : H → H is a bounded linear operator, then we have

\|A\|_{op} = \|A^*\|_{op}

and

\|A^*A\|_{op} = \|A\|_{op}^2

where A^* denotes the adjoint operator of A (which in Euclidean Hilbert spaces with the standard inner product corresponds to the conjugate transpose of the matrix A).

In general, the spectral radius of A is bounded above by the operator norm of A:

\rho(A) \le \|A\|_{op}.

To see why equality may not always hold, consider the Jordan canonical form of a matrix in the finite-dimensional case. Because there are non-zero entries on the superdiagonal, equality may be violated. The quasinilpotent operators is one class of such examples. A nonzero quasinilpotent operator A has spectrum {0}. So ρ(A) = 0 while $\|A\|_{op}>0$ .

However, when a matrix N is normal, its Jordan canonical form is diagonal (up to unitary equivalence); this is the spectral theorem. In that case it is easy to see that

\rho(N) = \|N\|_{op}.

The spectral theorem can be extended to normal operators in general. Therefore the above equality holds for any bounded normal operator N. This formula can sometimes be used to compute the operator norm of a given bounded operator A: define the Hermitian operator B = A^*A, determine its spectral radius, and take the square root to obtain the operator norm of A.

The space of bounded operators on H, with the topology induced by operator norm, is not separable. For example, consider the Hilbert space L²[0,1]. For 0 < t ≤ 1, let Ω_t be the characteristic function of [0,t], and P_t be the multiplication operator given by Ω_t, i.e.

P_t (f) = f \cdot \Omega_t .

Then each P_t is a bounded operator with operator norm 1 and

\| P_t - P_s \|_{op} = 1, \quad \mbox{for all} \quad t \neq s .

But {P_t} is an uncountable set. This implies the space of bounded operators on L²[0,1] is not separable, in operator norm. One can compare this with the fact that the sequence space l ^∞ is not separable.

The set of all bounded operators on a Hilbert space, together with the operator norm and the adjoint operation, yields a C*-algebra.

Notes

↑ See e.g. Lemma 6.2 of Aliprantis & Border (2007).
↑ section 4.3.1, Joel Tropp's PhD thesis,

References

Aliprantis, Charalambos D.; Border, Kim C. (2007), Infinite Dimensional Analysis: A Hitchhiker's Guide, Springer, p. 229, ISBN 9783540326960 .
Conway, John B. (1990), "III.2 Linear Operators on Normed Spaces", A Course in Functional Analysis, New York: Springer-Verlag, pp. 67–69, ISBN 0-387-97245-5

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.

[1] See e.g. Lemma 6.2 of Aliprantis & Border (2007).

[2] section 4.3.1, Joel Tropp's PhD thesis,