Operator norm

From HandWiki
Short description: Measure of the "size" of linear operators

In mathematics, the operator norm measures the "size" of certain linear operators by assigning each a real number called its operator norm. Formally, it is a norm defined on the space of bounded linear operators between two given normed vector spaces. Informally, the operator norm T of a linear map T:XY is the maximum factor by which it "lengthens" vectors.

Introduction and definition

Given two normed vector spaces V and W (over the same base field, either the real numbers or the complex numbers ), a linear map A:VW is continuous if and only if there exists a real number c such that[1] Avcv for all vV.

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 by more than 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, one can take the infimum of the numbers c such that the above inequality holds for all vV. This number represents the maximum scalar factor by which A "lengthens" vectors. In other words, the "size" of A is measured by how much it "lengthens" vectors in the "biggest" case. So we define the operator norm of A as Aop=inf{c0:Avcv for all vV}.

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

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 n to 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 n and m, then the matrix norm given to a matrix A is the square root of the largest eigenvalue of the matrix A*A (where A* denotes the conjugate transpose of A).[3] This is equivalent to assigning the largest singular value of A.

Passing to a typical infinite-dimensional example, consider the sequence space 2, which is an Lp space, defined by l2={(an)n1:an,n|an|2<}.

This can be viewed as an infinite-dimensional analogue of the Euclidean space n. Now consider a bounded sequence s=(sn)n=1. The sequence s is an element of the space , with a norm given by s=supn|sn|.

Define an operator Ts by pointwise multiplication: (an)n=1Ts (snan)n=1.

The operator Ts is bounded with operator norm Tsop=s.

This discussion extends directly to the case where 2 is replaced by a general Lp space with p>1 and replaced by L.

Equivalent definitions

Let A:VW be a linear operator between normed spaces. The first four definitions are always equivalent, and if in addition V{0} then they are all equivalent:

Aop=inf{c0:Avcv for all vV}=sup{Av:v1 and vV}=sup{Av:v<1 and vV}=sup{Av:v{0,1} and vV}=sup{Av:v=1 and vV} this equality holds if and only if V{0}=sup{Avv:v0 and vV} this equality holds if and only if V{0}.

If V={0} then the sets in the last two rows will be empty, and consequently their supremums over the set [,] will equal instead of the correct value of 0. If the supremum is taken over the set [0,] instead, then the supremum of the empty set is 0 and the formulas hold for any V.

Importantly, a linear operator A:VW is not, in general, guaranteed to achieve its norm Aop=sup{Av:v1,vV} on the closed unit ball {vV:v1}, meaning that there might not exist any vector uV of norm u1 such that Aop=Au (if such a vector does exist and if A0, then u would necessarily have unit norm u=1). R.C. James proved James's theorem in 1964, which states that a Banach space V is reflexive if and only if every bounded linear functional fV* achieves its norm on the closed unit ball.[4] It follows, in particular, that every non-reflexive Banach space has some bounded linear functional (a type of bounded linear operator) that does not achieve its norm on the closed unit ball.

If A:VW is bounded then[5] Aop=sup{|w*(Av)|:v1,w*1 where vV,w*W*} and[5] Aop=tAop where tA:W*V* is the transpose of A:VW, which is the linear operator defined by w*w*A.

Properties

The operator norm is indeed a norm on the space of all bounded operators between V and W. This means Aop0 and Aop=0 if and only if A=0, aAop=|a|Aop for every scalar a, A+BopAop+Bop.

The following inequality is an immediate consequence of the definition: AvAopv  for every  vV.

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:VW and B:WX are two bounded operators, then it is a sub-multiplicative norm, that is: BAopBopAop.

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

It follows from the definition that if a sequence of operators converges in operator norm, it converges uniformly on bounded sets.

Table of common operator norms

By choosing different norms for the codomain, used in computing Av, and the domain, used in computing v, we obtain different values for the operator norm. 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 N2 operations (for an N×N matrix), with the exception of the 22 norm (which requires N3 operations for the exact answer, or fewer if you approximate it with the power method or Lanczos iterations).

Computability of Operator Norms[6]
Co-domain
1 2
Domain 1 Maximum 1 norm of a column Maximum 2 norm of a column Maximum norm of a column
2 NP-hard Maximum singular value Maximum 2 norm of a row
NP-hard NP-hard Maximum 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 Apq=A*qp where p,q are Hölder conjugate to p,q, that is, 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:HH is a bounded linear operator, then we have Aop=A*op and A*Aop=Aop2, where A* denotes the adjoint operator of A (which in Euclidean 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: ρ(A)Aop.

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 Aop>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 ρ(N)=Nop.

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 Lp space L2[0,1], which is a Hilbert space. For 0<t1, let Ωt be the characteristic function of [0,t], and Pt be the multiplication operator given by Ωt, that is, Pt(f)=fΩt.

Then each Pt is a bounded operator with operator norm 1 and PtPsop=1 for all ts.

But {Pt:0<t1} is an uncountable set. This implies the space of bounded operators on L2([0,1]) is not separable, in operator norm. One can compare this with the fact that the sequence space is not separable.

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

See also

Notes

  1. Kreyszig, Erwin (1978), Introductory functional analysis with applications, John Wiley & Sons, p. 97, ISBN 9971-51-381-1 
  2. See e.g. Lemma 6.2 of (Aliprantis Border).
  3. Weisstein, Eric W.. "Operator Norm" (in en). https://mathworld.wolfram.com/OperatorNorm.html. 
  4. Diestel 1984, p. 6.
  5. 5.0 5.1 Rudin 1991, pp. 92-115.
  6. section 4.3.1, Joel Tropp's PhD thesis, [1]

References