The singular values are non-negativereal numbers, usually listed in decreasing order (σ1(T),σ2(T), …). The largest singular valueσ1(T) is equal to theoperator norm ofT (seeMin-max theorem).
Visualization of asingular value decomposition (SVD) of a 2-dimensional, realshearing matrixM. First, we see theunit disc in blue together with the twocanonical unit vectors. We then see the action ofM, which distorts the disc to anellipse. The SVD decomposesM into three simple transformations: arotationV*, ascaling Σ along the rotated coordinate axes and a second rotationU. Σ is a (square, in this example)diagonal matrix containing in its diagonal the singular values ofM, which represent the lengthsσ1 andσ2 of thesemi-axes of the ellipse.
IfT acts on Euclidean space, there is a simple geometric interpretation for the singular values: Consider the image by of theunit sphere; this is anellipsoid, and the lengths of its semi-axes are the singular values of (the figure provides an example in).
The singular values are the absolute values of theeigenvalues of anormal matrixA, because thespectral theorem can be applied to obtain unitary diagonalization of as. Therefore,.
Mostnorms on Hilbert space operators studied are defined using singular values. For example, theKy Fan-k-norm is the sum of firstk singular values, the trace norm is the sum of all singular values, and theSchatten norm is thepth root of the sum of thepth powers of the singular values. Note that each norm is defined only on a special class of operators, hence singular values can be useful in classifying different operators.
If has full rank, the product of singular values is.
If has full rank, the product of singular values is.
If is square and has full rank, the product of singular values is.
If isnormal, then, that is, its singular values are the absolute values of its eigenvalues.
For a generic rectangular matrix, let be its augmented matrix. It has eigenvalues (where are the singular values of) and the remaining eigenvalues are zero. Let be the singular value decomposition, then the eigenvectors of are for[1]: 52
The smallest singular value of a matrixA isσn(A). It has the following properties for a non-singular matrix A:
The 2-norm of the inverse matrix A−1 equals the inverseσn−1(A).[2]: Thm.3.3
The absolute values of all elements in the inverse matrix A−1 are at most the inverseσn−1(A).[2]: Thm.3.3
Intuitively, ifσn(A) is small, then the rows of A are "almost" linearly dependent. If it isσn(A) = 0, then the rows of A are linearly dependent and A is not invertible.
This concept was introduced byErhard Schmidt in 1907. Schmidt called singular values "eigenvalues" at that time. The name "singular value" was first quoted by Smithies in 1937. In 1957, Allahverdiev proved the following characterization of thenth singular number:[6]
This formulation made it possible to extend the notion of singular values to operators inBanach space. Note that there is a more general concept ofs-numbers, which also includes Gelfand and Kolmogorov width.
^Tao, Terence (2012).Topics in random matrix theory. Graduate studies in mathematics. Providence, R.I: American Mathematical Society.ISBN978-0-8218-7430-1.
^R. Bhatia. Matrix Analysis. Springer-Verlag, New York, 1997. Prop. III.5.1
^I. C. Gohberg andM. G. Krein. Introduction to the Theory of Linear Non-selfadjoint Operators. American Mathematical Society, Providence, R.I.,1969. Translated from the Russian by A. Feinstein. Translations of Mathematical Monographs, Vol. 18.