Spectral Norm
Get Spectral Norm essential facts below. View Videos or join the Spectral Norm discussion. Add Spectral Norm to your PopFlock.com topic list for future reference or share this resource on social media.
Spectral Norm

In mathematics, a matrix norm is a vector norm in a vector space whose elements (vectors) are matrices (of given dimensions).

Definition

Given a field ${\displaystyle K}$ of either real or complex numbers, and the vector space ${\displaystyle K^{m\times n}}$ of all matrices of size ${\displaystyle m\times n}$ (with ${\displaystyle m}$ rows and ${\displaystyle n}$ columns) with entries in the field ${\displaystyle K}$, a matrix norm is a norm on the vector space ${\displaystyle K^{m\times n}}$ (with individual norms denoted using double vertical bars such as ${\displaystyle \|A\|}$[1]). Thus, the matrix norm is a function ${\displaystyle \|\cdot \|:K^{m\times n}\to \mathbb {R} }$ that must satisfy the following properties:[2][3]

For all scalars ${\displaystyle \alpha \in K}$ and for all matrices ${\displaystyle A,B\in K^{m\times n}}$,

• ${\displaystyle \|\alpha A\|=|\alpha |\|A\|}$ (being absolutely homogeneous)
• ${\displaystyle \|A+B\|\leq \|A\|+\|B\|}$ (being sub-additive or satisfying the triangle inequality)
• ${\displaystyle \|A\|\geq 0}$ (being positive-valued)
• ${\displaystyle \|A\|=0\iff A=0_{m,n}}$ (being definite)

Additionally, in the case of square matrices (matrices with ), some (but not all) matrix norms satisfy the following condition, which is related to the fact that matrices are more than just vectors:[2]

• ${\displaystyle \|AB\|\leq \|A\|\|B\|}$ for all matrices ${\displaystyle A}$ and ${\displaystyle B}$ in ${\displaystyle K^{n\times n}.}$

A matrix norm that satisfies this additional property is called a submultiplicative norm[4][3] (in some books, the terminology matrix norm is used only for those norms which are submultiplicative[5]). The set of all ${\displaystyle n\times n}$ matrices, together with such a submultiplicative norm, is an example of a Banach algebra.

The definition of submultiplicativity is sometimes extended to non-square matrices, as in the case of the induced p-norm, where for ${\displaystyle A\in {K}^{m\times n}}$ and ${\displaystyle B\in {K}^{n\times k}}$ holds that ${\displaystyle \|AB\|_{q}\leq \|A\|_{p}\|B\|_{q}}$. Here, ${\displaystyle \|\cdot \|_{p}}$ and ${\displaystyle \|\cdot \|_{q}}$ are the norms induced from ${\displaystyle K^{p}}$ and ${\displaystyle K^{q}}$, respectively, where .

There are three types of matrix norms which will be discussed below:

• Matrix norms induced by vector norms,
• Entrywise matrix norms, and
• Schatten norms.

Matrix norms induced by vector norms

Suppose a vector norm ${\displaystyle \|\cdot \|}$ on ${\displaystyle K^{m}}$ is given. Any ${\displaystyle m\times n}$ matrix A induces a linear operator from ${\displaystyle K^{n}}$ to ${\displaystyle K^{m}}$ with respect to the standard basis, and one defines the corresponding induced norm or operator norm on the space ${\displaystyle K^{m\times n}}$ of all ${\displaystyle m\times n}$ matrices as follows:

{\displaystyle {\begin{aligned}\|A\|&=\sup\{\|Ax\|:x\in K^{n}{\text{ with }}\|x\|=1\}\\&=\sup \left\{{\frac {\|Ax\|}{\|x\|}}:x\in K^{n}{\text{ with }}x\neq 0\right\}.\end{aligned}}}

In particular, if the p-norm for vectors (1 ≤ p ≤ ∞) is used for both spaces ${\displaystyle K^{n}}$ and ${\displaystyle K^{m}}$, then the corresponding induced operator norm is:[3]

${\displaystyle \|A\|_{p}=\sup _{x\neq 0}{\frac {\|Ax\|_{p}}{\|x\|_{p}}}.}$

These induced norms are different from the "entrywise" p-norms and the Schatten p-norms for matrices treated below, which are also usually denoted by ${\displaystyle \|A\|_{p}.}$

Note: The above description pertains to the induced operator norm when the same vector norm was used in the "departure space" ${\displaystyle K^{n}}$ and the "arrival space" ${\displaystyle K^{m}}$ of the operator ${\displaystyle A\in K^{m\times n}}$. This is not a necessary restriction. More generally, given a norm ${\displaystyle \|\cdot \|_{\alpha }}$ on ${\displaystyle K^{n}}$ and a norm ${\displaystyle \|\cdot \|_{\beta }}$ on ${\displaystyle K^{m}}$, one can define a matrix norm on ${\displaystyle K^{m\times n}}$ induced by these norms:
${\displaystyle \|A\|_{\alpha ,\beta }=\max _{x\neq 0}{\frac {\|Ax\|_{\beta }}{\|x\|_{\alpha }}}.}$
The matrix norm ${\displaystyle \|A\|_{\alpha ,\beta }}$ is sometimes called a subordinate norm. Subordinate norms are consistent with the norms that induce them, giving
${\displaystyle \|Ax\|_{\beta }\leq \|A\|_{\alpha ,\beta }\|x\|_{\alpha }.}$

Any induced operator norm is a submultiplicative matrix norm: ${\displaystyle \|AB\|\leq \|A\|\|B\|;}$ this follows from

${\displaystyle \|ABx\|\leq \|A\|\|Bx\|\leq \|A\|\|B\|\|x\|}$

and

${\displaystyle \max _{\|x\|=1}\|ABx\|=\|AB\|.}$

Moreover, any induced norm satisfies the inequality

${\displaystyle \|A^{r}\|^{1/r}\geq \rho (A)\quad }$ (1)

for all positive integers r, where ρ(A) is the spectral radius of A. For symmetric or hermitian A, we have equality in (1) for the 2-norm, since in this case the 2-norm is precisely the spectral radius of A. For an arbitrary matrix, we may not have equality for any norm; a counterexample would be

${\displaystyle A={\begin{bmatrix}0&1\\0&0\end{bmatrix}},}$

which has vanishing spectral radius. In any case, for square matrices we have the spectral radius formula:

${\displaystyle \lim _{r\to \infty }\|A^{r}\|^{1/r}=\rho (A).}$

Special cases

In the special cases of ${\displaystyle p=1,2,\infty ,}$ the induced matrix norms can be computed or estimated by

${\displaystyle \|A\|_{1}=\max _{1\leq j\leq n}\sum _{i=1}^{m}|a_{ij}|,}$

which is simply the maximum absolute column sum of the matrix;

${\displaystyle \|A\|_{\infty }=\max _{1\leq i\leq m}\sum _{j=1}^{n}|a_{ij}|,}$

which is simply the maximum absolute row sum of the matrix;

${\displaystyle \|A\|_{2}=\sigma _{\max }(A),}$

where ${\displaystyle \sigma _{\max }(A)}$ represents the largest singular value of matrix ${\displaystyle A}$. There is an important inequality for the case ${\displaystyle p=2}$:

${\displaystyle \|A\|_{2}=\sigma _{\max }(A)\leq \|A\|_{\rm {F}}=\left(\sum _{i=1}^{m}\sum _{j=1}^{n}|a_{ij}|^{2}\right)^{\frac {1}{2}},}$

where ${\displaystyle \|A\|_{\rm {F}}}$ is the Frobenius norm. Equality holds if and only if the matrix ${\displaystyle A}$ is a rank-one matrix or a zero matrix. This inequality can be derived from the fact that the trace of a matrix is equal to the sum of its eigenvalues.

When ${\displaystyle p=2}$ we have an equivalent definition for ${\displaystyle \|A\|_{2}}$ as ${\displaystyle \sup\{x^{T}Ay:x,y\in K^{n}{\text{ with }}\|x\|_{2}=\|y\|_{2}=1\}}$. It can be shown to be equivalent to the above definitions using the Cauchy-Schwarz inequality.

For example, for

${\displaystyle A={\begin{bmatrix}-3&5&7\\2&6&4\\0&2&8\\\end{bmatrix}},}$

we have that

${\displaystyle \|A\|_{1}=\max(|{-3}|+2+0;5+6+2;7+4+8)=\max(5,13,19)=19,}$
${\displaystyle \|A\|_{\infty }=\max(|{-3}|+5+7;2+6+4;0+2+8)=\max(15,12,10)=15.}$

In the special case of ${\displaystyle p=2}$ (the Euclidean norm or ${\displaystyle \ell _{2}}$-norm for vectors), the induced matrix norm is the spectral norm. The spectral norm of a matrix ${\displaystyle A}$ is the largest singular value of ${\displaystyle A}$ (i.e., the square root of the largest eigenvalue of the matrix ${\displaystyle A^{*}A}$, where ${\displaystyle A^{*}}$ denotes the conjugate transpose of ${\displaystyle A}$):[6]

${\displaystyle \|A\|_{2}={\sqrt {\lambda _{\max }\left(A^{*}A\right)}}=\sigma _{\max }(A).}$

In this case, ${\displaystyle \|A^{*}A\|_{2}=\|AA^{*}\|_{2}=\|A\|_{2}^{2}}$ since ${\displaystyle \|A^{*}A\|_{2}=\sigma _{\max }(A^{*}A)=\sigma _{\max }(A)^{2}=\|A\|_{2}^{2}}$ and similarly ${\displaystyle \|AA^{*}\|_{2}=\|A\|_{2}^{2}}$ by singular value decomposition (SVD).

"Entrywise" matrix norms

These norms treat an ${\displaystyle m\times n}$ matrix as a vector of size ${\displaystyle m\cdot n}$, and use one of the familiar vector norms. For example, using the p-norm for vectors, , we get:

${\displaystyle \|A\|_{p,p}=\|\mathrm {vec} (A)\|_{p}=\left(\sum _{i=1}^{m}\sum _{j=1}^{n}|a_{ij}|^{p}\right)^{1/p}}$

This is a different norm from the induced p-norm (see above) and the Schatten p-norm (see below), but the notation is the same.

The special case p = 2 is the Frobenius norm, and p = ∞ yields the maximum norm.

L2,1 and Lp,q norms

Let ${\displaystyle (a_{1},\ldots ,a_{n})}$ be the columns of matrix ${\displaystyle A}$. The ${\displaystyle L_{2,1}}$ norm[7] is the sum of the Euclidean norms of the columns of the matrix:

${\displaystyle \|A\|_{2,1}=\sum _{j=1}^{n}\|a_{j}\|_{2}=\sum _{j=1}^{n}\left(\sum _{i=1}^{m}|a_{ij}|^{2}\right)^{\frac {1}{2}}}$

The ${\displaystyle L_{2,1}}$ norm as an error function is more robust, since the error for each data point (a column) is not squared. It is used in robust data analysis and sparse coding.

For , the ${\displaystyle L_{2,1}}$ norm can be generalized to the ${\displaystyle L_{p,q}}$ norm as follows:

${\displaystyle \|A\|_{p,q}=\left(\sum _{j=1}^{n}\left(\sum _{i=1}^{m}|a_{ij}|^{p}\right)^{\frac {q}{p}}\right)^{\frac {1}{q}}.}$

Frobenius norm

When for the ${\displaystyle L_{p,q}}$ norm, it is called the Frobenius norm or the Hilbert-Schmidt norm, though the latter term is used more frequently in the context of operators on (possibly infinite-dimensional) Hilbert space. This norm can be defined in various ways:

${\displaystyle \|A\|_{\text{F}}={\sqrt {\sum _{i=1}^{m}\sum _{j=1}^{n}|a_{ij}|^{2}}}={\sqrt {\operatorname {trace} \left(A^{*}A\right)}}={\sqrt {\sum _{i=1}^{\min\{m,n\}}\sigma _{i}^{2}(A)}},}$

where ${\displaystyle \sigma _{i}(A)}$ are the singular values of ${\displaystyle A}$. Recall that the trace function returns the sum of diagonal entries of a square matrix.

The Frobenius norm is an extension of the Euclidean norm to ${\displaystyle K^{n\times n}}$ and comes from the Frobenius inner product on the space of all matrices.

The Frobenius norm is submultiplicative and is very useful for numerical linear algebra. The submultiplicativity of Frobenius norm can be proved using Cauchy-Schwarz inequality.

Frobenius norm is often easier to compute than induced norms, and has the useful property of being invariant under rotations (and unitary operations in general). That is, ${\displaystyle \|A\|_{\text{F}}=\|AU\|_{\text{F}}=\|UA\|_{\text{F}}}$ for any unitary matrix ${\displaystyle U}$. This property follows from the cyclic nature of the trace (${\displaystyle \operatorname {trace} (XYZ)=\operatorname {trace} (ZXY)}$):

${\displaystyle \|AU\|_{\text{F}}^{2}=\operatorname {trace} \left((AU)^{*}AU\right)=\operatorname {trace} \left(U^{*}A^{*}AU\right)=\operatorname {trace} \left(UU^{*}A^{*}A\right)=\operatorname {trace} \left(A^{*}A\right)=\|A\|_{\text{F}}^{2},}$

and analogously:

${\displaystyle \|UA\|_{\text{F}}^{2}=\operatorname {trace} \left((UA)^{*}UA\right)=\operatorname {trace} \left(A^{*}U^{*}UA\right)=\operatorname {trace} \left(A^{*}A\right)=\|A\|_{\text{F}}^{2},}$

where we have used the unitary nature of ${\displaystyle U}$ (that is, ${\displaystyle U^{*}U=UU^{*}=\mathbf {I} }$).

It also satisfies

${\displaystyle \|A^{*}A\|_{\text{F}}=\|AA^{*}\|_{\text{F}}\leq \|A\|_{\text{F}}^{2}}$

and

${\displaystyle \|A+B\|_{\text{F}}^{2}=\|A\|_{\text{F}}^{2}+\|B\|_{\text{F}}^{2}+2\langle A,B\rangle _{\text{F}},}$

where ${\displaystyle \langle A,B\rangle _{\text{F}}}$ is the Frobenius inner product.

Max norm

The max norm is the elementwise norm with p = q = ∞:

${\displaystyle \|A\|_{\max }=\max _{ij}|a_{ij}|.}$

This norm is not submultiplicative.

Note that in some literature (such as Communication complexity), an alternative definition of max-norm, also called the ${\displaystyle \gamma _{2}}$-norm, refers to the factorization norm:

${\displaystyle \gamma _{2}(A)=\min _{U,V:A=UV^{T}}\|U\|_{2,\infty }\|V\|_{2,\infty }=\min _{U,V:A=UV^{T}}\max _{i,j}\|U_{i,:}\|_{2}\|V_{j,:}\|_{2}}$

Schatten norms

The Schatten p-norms arise when applying the p-norm to the vector of singular values of a matrix.[3] If the singular values of the ${\displaystyle m\times n}$ matrix ${\displaystyle A}$ are denoted by σi, then the Schatten p-norm is defined by

${\displaystyle \|A\|_{p}=\left(\sum _{i=1}^{\min\{m,n\}}\sigma _{i}^{p}(A)\right)^{\frac {1}{p}}.}$

These norms again share the notation with the induced and entrywise p-norms, but they are different.

All Schatten norms are submultiplicative. They are also unitarily invariant, which means that ${\displaystyle \|A\|=\|UAV\|}$ for all matrices ${\displaystyle A}$ and all unitary matrices ${\displaystyle U}$ and ${\displaystyle V}$.

The most familiar cases are p = 1, 2, ∞. The case p = 2 yields the Frobenius norm, introduced before. The case p = ∞ yields the spectral norm, which is the operator norm induced by the vector 2-norm (see above). Finally, p = 1 yields the nuclear norm (also known as the trace norm, or the Ky Fan 'n'-norm[8]), defined as

${\displaystyle \|A\|_{*}=\operatorname {trace} \left({\sqrt {A^{*}A}}\right)=\sum _{i=1}^{\min\{m,n\}}\sigma _{i}(A),}$

where ${\displaystyle {\sqrt {A^{*}A}}}$ denotes a positive semidefinite matrix ${\displaystyle B}$ such that ${\displaystyle BB=A^{*}A}$. More precisely, since ${\displaystyle A^{*}A}$ is a positive semidefinite matrix, its square root is well-defined. The nuclear norm ${\displaystyle \|A\|_{*}}$ is a convex envelope of the rank function ${\displaystyle {\text{rank}}(A)}$, so it is often used in mathematical optimization to search for low rank matrices.

Consistent norms

A matrix norm ${\displaystyle \|\cdot \|}$ on ${\displaystyle K^{m\times n}}$ is called consistent with a vector norm ${\displaystyle \|\cdot \|_{a}}$ on ${\displaystyle K^{n}}$ and a vector norm ${\displaystyle \|\cdot \|_{b}}$ on ${\displaystyle K^{m}}$, if:

${\displaystyle \|Ax\|_{b}\leq \|A\|\|x\|_{a}}$

for all ${\displaystyle A\in K^{m\times n},x\in K^{n}}$. All induced norms are consistent by definition.

Compatible norms

A matrix norm ${\displaystyle \|\cdot \|}$ on ${\displaystyle K^{n\times n}}$ is called compatible with a vector norm ${\displaystyle \|\cdot \|_{a}}$ on ${\displaystyle K^{n}}$, if:

${\displaystyle \|Ax\|_{a}\leq \|A\|\|x\|_{a}}$

for all ${\displaystyle A\in K^{n\times n},x\in K^{n}}$.

Induced norms are compatible with the inducing vector norm by definition. Also, any submultiplicative matrix norm on ${\displaystyle K^{n\times n}}$ induces a vector norm on ${\displaystyle K^{n}}$ with which it is compatible, simply by defining ${\displaystyle \|v\|:=\|\left(v,v,...v\right)\|}$.

Monotone norms

A matrix norm ${\displaystyle \|\cdot \|}$ is called monotone if it is monotonic with respect to the Loewner order. Thus, a matrix norm is increasing if

${\displaystyle A\preccurlyeq B\Rightarrow \|A\|\leq \|B\|.}$

The Frobenius norm and spectral norm are examples of monotone norms.[9]

Equivalence of norms

For any two matrix norms ${\displaystyle \|\cdot \|_{\alpha }}$ and ${\displaystyle \|\cdot \|_{\beta }}$, we have that:

${\displaystyle r\|A\|_{\alpha }\leq \|A\|_{\beta }\leq s\|A\|_{\alpha }}$

for some positive numbers r and s, for all matrices ${\displaystyle A\in K^{m\times n}}$. In other words, all norms on ${\displaystyle K^{m\times n}}$ are equivalent; they induce the same topology on ${\displaystyle K^{m\times n}}$. This is true because the vector space ${\displaystyle K^{m\times n}}$ has the finite dimension ${\displaystyle m\times n}$.

Moreover, for every vector norm ${\displaystyle \|\cdot \|}$ on ${\displaystyle \mathbb {R} ^{n\times n}}$, there exists a unique positive real number ${\displaystyle k}$ such that ${\displaystyle l\|\cdot \|}$ is a submultiplicative matrix norm for every ${\displaystyle l\geq k}$.

A submultiplicative matrix norm ${\displaystyle \|\cdot \|_{\alpha }}$ is said to be minimal, if there exists no other submultiplicative matrix norm ${\displaystyle \|\cdot \|_{\beta }}$ satisfying ${\displaystyle \|\cdot \|_{\beta }<\|\cdot \|_{\alpha }}$.

Examples of norm equivalence

Let ${\displaystyle \|A\|_{p}}$ once again refer to the norm induced by the vector p-norm (as above in the Induced Norm section).

For matrix ${\displaystyle A\in \mathbb {R} ^{m\times n}}$ of rank ${\displaystyle r}$, the following inequalities hold:[10][11]

• ${\displaystyle \|A\|_{2}\leq \|A\|_{F}\leq {\sqrt {r}}\|A\|_{2}}$
• ${\displaystyle \|A\|_{F}\leq \|A\|_{*}\leq {\sqrt {r}}\|A\|_{F}}$
• ${\displaystyle \|A\|_{\max }\leq \|A\|_{2}\leq {\sqrt {mn}}\|A\|_{\max }}$
• ${\displaystyle {\frac {1}{\sqrt {n}}}\|A\|_{\infty }\leq \|A\|_{2}\leq {\sqrt {m}}\|A\|_{\infty }}$
• ${\displaystyle {\frac {1}{\sqrt {m}}}\|A\|_{1}\leq \|A\|_{2}\leq {\sqrt {n}}\|A\|_{1}.}$

Another useful inequality between matrix norms is

${\displaystyle \|A\|_{2}\leq {\sqrt {\|A\|_{1}\|A\|_{\infty }}},}$

which is a special case of Hölder's inequality.

References

1. ^ "Comprehensive List of Algebra Symbols". Math Vault. 2020-03-25. Retrieved .
2. ^ a b Weisstein, Eric W. "Matrix Norm". mathworld.wolfram.com. Retrieved .
3. ^ a b c d "Matrix norms". fourier.eng.hmc.edu. Retrieved .
4. ^ Malek-Shahmirzadi, Massoud (1983). "A characterization of certain classes of matrix norms". Linear and Multilinear Algebra. 13 (2): 97-99. doi:10.1080/03081088308817508. ISSN 0308-1087.
5. ^ Horn, Roger A. (2012). Matrix analysis. Johnson, Charles R. (2nd ed.). Cambridge: Cambridge University Press. pp. 340-341. ISBN 978-1-139-77600-4. OCLC 817236655.
6. ^ Carl D. Meyer, Matrix Analysis and Applied Linear Algebra, §5.2, p.281, Society for Industrial & Applied Mathematics, June 2000.
7. ^ Ding, Chris; Zhou, Ding; He, Xiaofeng; Zha, Hongyuan (June 2006). "R1-PCA: Rotational Invariant L1-norm Principal Component Analysis for Robust Subspace Factorization". Proceedings of the 23rd International Conference on Machine Learning. ICML '06. Pittsburgh, Pennsylvania, USA: ACM. pp. 281-288. doi:10.1145/1143844.1143880. ISBN 1-59593-383-2.
8. ^ Fan, Ky. (1951). "Maximum properties and inequalities for the eigenvalues of completely continuous operators". Proceedings of the National Academy of Sciences of the United States of America. 37 (11): 760-766. Bibcode:1951PNAS...37..760F. doi:10.1073/pnas.37.11.760. PMC 1063464. PMID 16578416.
9. ^ Ciarlet, Philippe G. (1989). Introduction to numerical linear algebra and optimisation. Cambridge, England: Cambridge University Press. p. 57. ISBN 0521327881.
10. ^ Golub, Gene; Charles F. Van Loan (1996). Matrix Computations - Third Edition. Baltimore: The Johns Hopkins University Press, 56-57. ISBN 0-8018-5413-X.
11. ^ Roger Horn and Charles Johnson. Matrix Analysis, Chapter 5, Cambridge University Press, 1985. ISBN 0-521-38632-2.

Bibliography

• James W. Demmel, Applied Numerical Linear Algebra, section 1.7, published by SIAM, 1997.
• Carl D. Meyer, Matrix Analysis and Applied Linear Algebra, published by SIAM, 2000. [1]
• John Watrous, Theory of Quantum Information, 2.3 Norms of operators, lecture notes, University of Waterloo, 2011.
• Kendall Atkinson, An Introduction to Numerical Analysis, published by John Wiley & Sons, Inc 1989