Hubbry Logo
Operator normOperator normMain
Open search
Operator norm
Community hub
Operator norm
logo
7 pages, 0 posts
0 subscribers
Be the first to start a discussion here.
Be the first to start a discussion here.
Operator norm
Operator norm
from Wikipedia

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 of a linear map is the maximum factor by which it "lengthens" vectors. It is also called the bound norm.[1]

Introduction and definition

[edit]

Given two normed vector spaces and (over the same base field, either the real numbers or the complex numbers ), a linear map is continuous if and only if there exists a real number such that[2]

The norm on the left is the one in and the norm on the right is the one in . Intuitively, the continuous operator never increases the length of any vector by more than a factor of 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 one can take the infimum of the numbers such that the above inequality holds for all This number represents the maximum scalar factor by which "lengthens" vectors. In other words, the "size" of is measured by how much it "lengthens" vectors in the "biggest" case. So we define the operator norm of as

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

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

Examples

[edit]

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

If we specifically choose the Euclidean norm on both and then the matrix norm given to a matrix is the square root of the largest eigenvalue of the matrix (where denotes the conjugate transpose of ).[4] This is equivalent to assigning the largest singular value of

Passing to a typical infinite-dimensional example, consider the sequence space which is an Lp space, defined by

This can be viewed as an infinite-dimensional analogue of the Euclidean space Now consider a bounded sequence The sequence is an element of the space with a norm given by

Define an operator by pointwise multiplication:

The operator is bounded with operator norm

This discussion extends directly to the case where is replaced by a general space with and replaced by

Equivalent definitions

[edit]

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

If 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 If the supremum is taken over the set instead, then the supremum of the empty set is and the formulas hold for any

Importantly, a linear operator is not, in general, guaranteed to achieve its norm on the closed unit ball meaning that there might not exist any vector of norm such that (if such a vector does exist and if then would necessarily have unit norm ). R.C. James proved James's theorem in 1964, which states that a Banach space is reflexive if and only if every bounded linear functional achieves its norm on the closed unit ball.[5] 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 is bounded then[6] and[6] where is the transpose of which is the linear operator defined by

Properties

[edit]

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

The following inequality is an immediate consequence of the definition:

The operator norm is also compatible with the composition, or multiplication, of operators: if , and are three normed spaces over the same base field, and and are two bounded operators, then it is a sub-multiplicative norm, that is:

For bounded operators on , 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

[edit]

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

Computability of Operator Norms[7]
Co-domain
Domain Maximum norm of a column Maximum norm of a column Maximum norm of a column
NP-hard Maximum singular value Maximum norm of a row
NP-hard NP-hard Maximum norm of a row

The norm of the adjoint or transpose can be computed as follows. We have that for any then where are Hölder conjugate to that is, and

Operators on a Hilbert space

[edit]

Suppose is a real or complex Hilbert space. If is a bounded linear operator, then we have and where denotes the adjoint operator of (which in Euclidean spaces with the standard inner product corresponds to the conjugate transpose of the matrix ).

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

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 has spectrum So while

However, when a matrix 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

This formula can sometimes be used to compute the operator norm of a given bounded operator : define the Hermitian operator determine its spectral radius, and take the square root to obtain the operator norm of

The space of bounded operators on with the topology induced by operator norm, is not separable. For example, consider the Lp space which is a Hilbert space. For let be the characteristic function of and be the multiplication operator given by that is,

Then each is a bounded operator with operator norm 1 and

But is an uncountable set. This implies the space of bounded operators on 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

[edit]

Notes

[edit]

References

[edit]
Revisions and contributorsEdit on WikipediaRead on Wikipedia
from Grokipedia
In mathematics, particularly in , the operator norm is a measure of the "size" or magnitude of a bounded linear operator T:XYT: X \to Y between normed vector spaces XX and YY, defined as T=sup{TxY:xX,xX1}\|T\| = \sup \{ \|Tx\|_Y : x \in X, \|x\|_X \leq 1 \}, which is equivalently the infimum of all constants M0M \geq 0 such that TxYMxX\|Tx\|_Y \leq M \|x\|_X for all xXx \in X. This norm captures the supremum stretching factor of the operator on the unit ball of XX, and a linear operator admits an operator norm if and only if it is bounded, which is equivalent to being continuous. The operator norm endows the space B(X,Y)B(X, Y) of all bounded linear operators from XX to YY with the structure of a , and if YY is a , then B(X,Y)B(X, Y) becomes a itself under this norm. Key properties include homogeneity (cT=cT\|cT\| = |c| \|T\| for scalars cc), non-negativity (T=0\|T\| = 0 T=0T = 0), and submultiplicativity (STST\|ST\| \leq \|S\| \|T\| for composable operators SS and TT), making it compatible with the of operator composition. In Hilbert spaces, additional characterizations arise, such as for operators where T=sup{Tx,x:x=1}\|T\| = \sup \{ |\langle Tx, x \rangle| : \|x\| = 1 \}, linking the norm to quadratic forms. Operator norms play a central role in spectral theory, where the spectral radius satisfies r(T)=limnTn1/nTr(T) = \lim_{n \to \infty} \|T^n\|^{1/n} \leq \|T\|, providing bounds on eigenvalues and invertibility criteria, such as the Neumann series for T<1\|T\| < 1 yielding (IT)1=n=0Tn(I - T)^{-1} = \sum_{n=0}^\infty T^n. They are also essential in the study of compact operators, adjoints (with T=T\|T^*\| = \|T\| in Hilbert spaces), and semigroups of operators, where growth bounds like S(t)Meωt\|S(t)\| \leq M e^{\omega t} ensure stability and well-posedness of evolution equations. These features underpin theorems like the uniform boundedness principle and open mapping theorem, facilitating the analysis of infinite-dimensional phenomena in applications from partial differential equations to quantum mechanics.

Fundamentals

Definition

In functional analysis, the operator norm of a bounded linear operator T:XYT: X \to Y between normed vector spaces (X,X)(X, \|\cdot\|_X) and (Y,Y)(Y, \|\cdot\|_Y) is defined as T=sup{TxYxX:xX,x0}.\|T\| = \sup \left\{ \frac{\|Tx\|_Y}{\|x\|_X} : x \in X, \, x \neq 0 \right\}. This quantity represents the maximum factor by which TT can amplify the norm of input vectors from XX, providing a measure of the operator's "size" or sensitivity to inputs. An equivalent formulation is T=sup{TxY:xX,xX1},\|T\| = \sup \left\{ \|Tx\|_Y : x \in X, \, \|x\|_X \leq 1 \right\}, which is the least upper bound of the norms of images of vectors in the closed unit ball of XX. To see the equivalence, note that the homogeneity of norms (λz=λz\|\lambda z\| = |\lambda| \|z\| for scalars λ\lambda) implies that for any x0x \neq 0, the unit vector u=x/xXu = x / \|x\|_X satisfies TuY=TxY/xX\|Tu\|_Y = \|Tx\|_Y / \|x\|_X, so the supremum over ratios equals the supremum over the unit ball (or precisely the unit sphere, as the maximum on the boundary extends to the ball by subadditivity). The operator TT is bounded if and only if T<\|T\| < \infty, meaning there exists a constant C=TC = \|T\| such that TxYTxX\|Tx\|_Y \leq \|T\| \|x\|_X for all xXx \in X. The collection of all such bounded operators, denoted B(X,Y)B(X, Y), forms a normed vector space under pointwise addition and scalar multiplication, equipped with the operator norm \|\cdot\|.

Motivation

In the context of normed vector spaces, linear operators play a central role in functional analysis, where continuity of such operators is equivalent to boundedness. This equivalence underscores the importance of quantifying the "boundedness" of a linear map from one normed space to another, providing a foundation for studying how these maps preserve or distort the structure of vectors under the given norms. The concept of the operator norm emerged as a natural generalization of matrix norms from finite-dimensional spaces to infinite-dimensional settings, driven by the need to handle operators on spaces like those of continuous functions or integrable functions. This development originated in the early 20th-century work of Stefan Banach, who in his 1920 doctoral thesis introduced complete normed linear spaces—now known as —and laid the groundwork for operator theory through publications in the 1920s, culminating in his 1932 monograph Théorie des opérations linéaires. Banach's motivation stemmed from applications in solving integral equations and spectral problems, where finite-dimensional tools proved insufficient for infinite-dimensional phenomena. Operator norms are essential for endowing the space of bounded linear operators between with a natural topology, which facilitates the analysis of convergence, approximation, and compactness in operator sequences. Without such a norm, studying the behavior of operators in infinite dimensions—such as their limits or compositions—would lack the metric structure needed for rigorous proofs and applications in areas like partial differential equations and quantum mechanics. Intuitively, the operator norm captures the "size" of a linear operator by measuring its maximum amplification effect on vectors, much like a vector norm quantifies length in the space. This stretching factor provides a scalar benchmark for the operator's influence, enabling comparisons and bounds in theoretical and computational contexts.

Induced Norms

General induced norms

The induced norm on a linear operator between normed vector spaces arises naturally from the vector norms on the domain and codomain, providing a measure of the operator's "amplification" effect relative to those norms. Consider normed vector spaces XX and YY over the same field (typically R\mathbb{R} or C\mathbb{C}), equipped with vector norms α\|\cdot\|_\alpha on XX and β\|\cdot\|_\beta on YY. For a linear operator T:XYT: X \to Y, the (α,β)(\alpha, \beta)-induced norm, also called the subordinate norm, is defined as Tα,β=sup{Txβxα  |  xX{0}}.\|T\|_{\alpha,\beta} = \sup\left\{ \frac{\|Tx\|_\beta}{\|x\|_\alpha} \;\middle|\; x \in X \setminus \{0\} \right\}.
Add your contribution
Related Hubs
User Avatar
No comments yet.