On the Nuclear Norm and the Singular Value Decomposition of Tensors
Harm Derksen
Introduction
Suppose that is the tensor product of finite dimensional Hilbert spaces. For some applications, we would like to find a decomposition of a given tensor as a sum of pure tensors:
is small. As pointed out in , there may not always be an optimal solution for which this norm is minimal. The problem of finding a low-rank approximation is known as the PARAFAC () or CANDECOMP () model. There are many applications of this model, for example fluorescence spectroscopy, statistics, psychometrics, geophysics and magnetic resonance imaging.
2. The nuclear and spectral norms
yields the sparsest solution. A sparse relaxation of the rank of a matrix is the nuclear norm , which is also the sum of the singular values of . In this context, this relaxation technique has been successfully applied to matrix completion problems in .
The nuclear norm can be generalized to higher order tensors (see [23, Definition 3.2]). The nuclear norm of a tensor is the smallest possible value of over all possible decompositions (1). The nuclear norm for tensors has been used for tensor completion problems in .
The spectral norm of is defined as the maximum value of where ranges over all pure tensors of unit length. For a matrix, the spectral norm is just the largest singular value. More generally, if is an -tuple of tensors, then we define as the maximum of
over all pure tensors of unit length. The following theorem is useful for obtaining lower bounds for the spectral norm:
If is a tensor, is an -tuple of tensors and then we have
The proof of Theorem 1.1 is in Section 5. If just consists of a single tensor, then and we have:
Corollary 1.2 can also easily be proven directly without using Theorem 1.1. If we set then we obtain
3. Singular Value Decomposition
The Singular Value Decomposition (SVD) can be generalized to higher-dimensional arrays. One such generalization was given in . Given a tensor , one can choose an orthonormal bases for for all and express in these bases:
where the sum runs over all -tuples with . For a proper choice of the bases, the tensors are orthogonal for all and
These numbers are called the singular values in mode . The decomposition (2) is called the higher order single value decomposition (HOSVD).
In this paper, we will give a different generalization of the SVD, which we call the diagonal singular value decomposition (DSVD). A given tensor may not have a diagonal singular value decomposition (see Section 7), but if it does, then the decomposition has many nice properties.
Suppose that is a real number. An -tuple of tensors of unit length is called -orthogonal if .
If is an -tuple of pure tensors of unit length, then -orthogonality implies orthogonality in the usual sense. Also, is orthogonal if and only if it is -orthogonal.
If are real, and is a -orthogonal -tuple of pure tensors of unit length, then a decomposition
is called a diagonal singular value decomposition (DSVD) of , and are called the singular values of .
For a tensor that has a diagonal singular value decomposition, we have the following results:
The singular values of are uniquely determined by (and do not depend on the choice of the diagonal singular value decomposition).
Suppose that has a singular value decomposition with singular values . Then we have
If the singular values of are distinct, then the diagonal singular value decomposition is unique.
If is a diagonal singular value decomposition and is -orthogonal for some , then the diagonal singular value decomposition of is unique.
The proofs of Theorems 1.5–1.8 are in Section 6.
4. Tensors and multi-linear maps
We will apply this correspondence to matrix multiplication.
5. Matrix multiplication
From this formula it is clear that . Strassen proved that (see ) by giving a decomposition
and used this to show that two matrices can be multiplied by using only arithmetic where . The usual way of multiplying two matrices takes arithmetic operations. More generally, define
If , then two matrices can be multiplied using only arithmetic operations (see and ). Coppersmith and Winograd proved that in . Only recently, this bound was improved by Stothers () to and the current record is by Williams ().
For most values of the rank of is unknown. It is easy to see that . Bläser gave a better, nontrivial lower bound in . A sharper lower bound was given by Landsberg in , and using the same techniques, Massarenti and Raviolo (see ) improved this lower bound to
The decomposition (4) is a diagonal singular value decomposition. In particular, the singular values of are
The proof of the theorem is in Section 4. The following corollary follows from Theorem 1.9 and Theorem 1.6.
We have and .
Note that the sum of the lengths of the pure tensors in the decomposition (5) is . This shows that minimization of the rank, and minimization of the nuclear norm do not always coincide.
6. The discrete Fourier transform and group algebras
If is a group of order , are the dimensions of the irreducible representations of , then the tensor has a diagonal singular value decomposition and its singular values are
The proof of Theorem 1.11 can be found in Section 4. From Theorem 1.11 and Theorem 1.6 we get the following result.
We have and .
The following Theorem follows from Theorems 1.11 and 1.8.
The decomposition (7) is the unique diagonal singular value decomposition. In particular, the singular values of are
7. The determinant and the permanent
The determinant and permanent are multilinear functions
From these formulas it is clear that and . The upper bound for the rank of the determinant is not sharp for (see Section 8). The bound for the permanent is far from optimal. Another formula for the permanent was given by Glynn :
where runs over all vectors with . From this formula follows that and . Some easy lower bounds for the rank of the the permanent and determinant are given in Section 8.
We have .
The formula (8) minimizes the sum of the lengths of the pure tensors, but these pure tensors are not -orthogonal (or even orthogonal) for . In fact, for the tensor does not have a diagonal singular value decomposition (see Section 7).
The proofs of Theorems 1.15 and 1.14 are in Section 5.
Orthogonality of vectors
In this section we will study various measures of orthogonality of vectors in a Hilbert space . It is convenient to deal with unit vectors. Suppose that is an -tuple of unit vectors.
Notice that . So we may think of as .
Suppose that and are -tuples of unit vectors. We define the horizontal tensor product of and by
If and then we define
If and are tuples of unit vectors, then we have
We will need a slightly more general version of the Hölder inequality.
If are nonnegative real numbers, and are positive real numbers with , then we have
The usual Hölder inequality states that, if , then we have
with equality if and only if the vectors and are dependent. Now take and , and replace and by and respectively:
Taking the -th root gives the desired inequality. ∎
For horizontal tensor products we have a Hölder inequality:
If , then we have
for all . Taking the maximum over all on both sides gives the desired inequality. ∎
If we take we get the inequalities
If then and is an -tuple of unit vectors, then we have
If we take the limit we get
For an -tuple of vectors we define
For an -tuple of unit vectors we have .
Taking the maximum over all on both sides gives the desired result. ∎
Orthogonality of tensors
In this section, we study another measure for the orthogonality of pure tensors, which takes into account the tensor product structure of the vector space. It is important, when discussing pure tensors, to be clear which tensor product structure we are talking about. To be unambiguous, we make the following definition. An -th order tensor space is a pair where are finite dimensional Hilbert spaces and
A pure tensor (with respect to this tensor space) is an element in of the form
with for . Suppose that and are tensor product spaces. Then their horizontal tensor product is the tensor space
If and then we define
For the horizontal tensor product we have a Hölder inequality.
If , then we have
Taking the supremum over all unit pure tensors and yields the desired inequality. ∎
The inequality in the other direction follows from Lemma 3.1. ∎
If and are tensor product spaces, then their vertical tensor product is
If and we define as , viewed inside the tensor product space . If and , then we define
The measure also behaves multiplicatively with respect to the vertical tensor product.
Suppose that and are tensor product spaces, and and . Then we have
First, we will assume that . For a complex vector we have
Suppose that is a pure tensor in . We can write
with and for all . Using the singular value decomposition, we can write
where and are (finite) sequences of orthonormal vectors for all , and for all . Since is a unit vector, we have . We define , for all , and
Note that and are unit vectors, and and are pure tensors of unit length. For a -tuple we define
This is a singular value decomposition of , if is viewed as a tensor in
Using the inequality (9) and the Cauchy-Schwarz inequality, we get
Since the pure tensor was arbitrary, we have and .
If , choose such that . By Corollary 3.2 we have
so we get .
Suppose that . There exists unit pure tensors and such that
So it follows that . We conclude that .
The norm is hard to compute in practice because we have to solve a optimization problem. But is easier to compute. Fortunately, can be estimated in terms of :
For an -tuple of pure tensors of unit length and we have
Suppose that . For every we have
Taking the maximum over all gives the desired inequality. ∎
For an -tuple of pure tensors of unit length and we have
Suppose that . Choose a unit pure tensor such that
Let be the diagonal matrix with and define
where are viewed as column vectors with respect to some orthonormal basis. Consider the Hermitian matrix
be an eigenvector of with eigenvalue . We have
for . Choose such that is maximal. Then we have
If we set and , then and by Hölder’s inequality we get
So we conclude that .
is attained for . So we have
t𝑡t-orthogonality
In this section we will discuss a notion of orthogonality for pure tensors that is stronger than the usual notion of orthogonality. Recall that an -tuple of unit tensors is -orthogonal if .
Suppose that is -orthogonal -tuple of unit tensors, and is an -orthogonal -tuple of unit tensors. Then is -orthogonal.
From and follows that
by Hölder’s inequality. So and is -orthogonal. ∎
Orthogonality is also stable under taking vertical tensor products.
If is an -tuple of unit tensors, is an -tuple of unit tensors, and and are both -orthogonal, then is also -orthogonal.
Using horizontal and vertical tensor product, we can easily see that the tensor has a Diagonal Singular Value Decomposition.
are -orthogonal. We will write instead of . Now the tuple
This follows immediately from the definition of the diagonal singular value decomposition and Proposition 4.4. ∎
Let be the irreducible representations of . We have an isomorphism
where is the projection onto . The decomposition (10) is orthogonal. The multiplication tensor
is the tensor for multiplication in . We have
Note that is -orthogonal. The tensor corresponds to matrix multiplication in . We can write
Suppose that is a tensor product space, and is a -orthogonal -tuple of pure tensors of unit length. Then we have .
Let , and let be the body defined by
Then and is a product of an -dimensional ball with radius and a disk of radius . We have
where we use the formula . It follows that
Suppose that is a fixed unit pure tensor in and is a random unit pure tensor. Let and for all . Then we have
is also -orthogonal, and it has vectors in an -dimensional vector space. So we have
The following lemma justifies the term -orthogonality.
If is -orthogonal, where and , then we have for at least values of .
Suppose that is a unit pure tensor. Then we have
Choose with and such that and are dependent. If and are orthogonal, then , because . If and are not orthogonal, then . If is the number of for which and are orthogonal, then we have
for some constant . We must have , otherwise the inequality is not satisfied for small . ∎
Consider the following triple of pure tensors
Then every pair of vectors of is -orthogonal. However, itself is not -orthogonal, because it violates Proposition 4.5:
be a list of vectors. We claim that is -orthogonal. Suppose that
is a pure tensor with . Using the inequality we get
This proves that is -orthogonal. For , cannot be -orthogonal because otherwise this would violate Proposition 4.5.
Lower bounds for the nuclear norm
Suppose that , is a tensor, and is an -tuple of tensors. We can write
where are positive real numbers such that and are pure unit tensors. Define
We now study the determinant tensor and the permanent tensor .
If are vectors of unit length, then Hadamard’s inequality yields
Therefore, we have . It follows from Corollary 1.2 that
The following theorem proven in is the permanent analog of Hadamard’s inequality.
For vectors of unit length,we get
So we have From Corollary 1.2 follows that
We conclude that . ∎
The Diagonal Singular Value Decomposition
For an -tuple and we write for . We start with the most general, main theorem.
Suppose that is a tensor product space, and consists of pure tensors in of unit length, , and
Also, suppose that , such that where . Then we have
Here we use the conventions that and .
because whenever . Using this, we get
Let if and . We have
where . We also have
If we maximalize the functional under the constraints for and , then an optimal solution is , and , and the optimal value is
The following result gives a lower bound for the nuclear norm:
If is an orthogonal -tuple of pure tensors of unit length, and , then we have
We can write where is a pure tensor of unit length for all , and . We have
and because is orthogonal. From Theorem 6.1 follows that
Suppose that and are -orthogonal tuples of pure tensors of unit length, and
such that and . We apply Theorem 6.1 with , and get
for all . If we switch the roles of the ’s and ’s we also get inequalities in the other directions as well. We conclude that and for all . ∎
Suppose that the diagonal singular value decomposition of is
Then we have . If we take , and in Theorem 6.2 then we get
so we conclude that .
Since is 2-orthogonal, we have
If is a pure tensor of unit length, then
Clearly . So we conclude that . ∎
Suppose that has a diagonal singular value decomposition with singular values . We can write . Suppose that we have another singular value decomposition . (Note that the singular values are determined by because of Theorem 1.5).
Let . Then and . Fix and let . From the proof of Theorem 6.1 follows that
Since are distinct, we must have and . This implies that if and . So for and by symmetry, for . This proves that for all . So is equal to up to a unit scalar, say . It follows that
and because are linearly independent, it follows that and for all .
Suppose that is a tensor with 2 diagonal singular value decompositions
with , and that is -orthogonal with . Let .
From the proof of Theorem 6.1 follows that
where , because is -orthogonal. Subtracting gives
It follows that for all . The column sums of are . So every column has exactly one . So the matrix has exactly ’s. Since the row sums are also , it follows that every row has exactly one 1 as well. So is a permutation matrix. There exists a permutation of such that
where is a unit for all . We have
Since is linearly independent, it follows that for all . So and for all . This shows that
So the diagonal singular value decomposition is unique. ∎
Tensors without a diagonal singular value decomposition
Consider the permanent . Suppose that it has a DSVD and that its singular values are . Then we have
so it follows that . So
For , is not an integer (the denominator is divisible by ), so cannot have a diagonal singular value decomposition.
Consider the determinant . Suppose that has a DSVD. A similar argument as in the previous example shows that has a singular value with multiplicity , where
So there exists a -orthogonal -tuple of pure tensors of unit length. This implies that by Proposition 4.5. For we have , so cannot have a diagonal singular value decomposition.
Appendix: The tensor rank of the determinant and the permanent
For a subset with define
We have the following generalized Laplace expansion
where runs over all subsets of with cardinality .
We get the best lower bound if :
We have a similar Laplace expansion for the permanent, so we also get
So the ranks of the determinant and permanent grow at least exponentially. We also have an exponential lower bound for the permanent. An exponential upper bound for the rank of the determinant seems not to be known. However, the obvious bound is not sharp for .
So . Zach Teitler pointed out that this implies that the Waring rank of a matrix is at most 20. He also pointed out that one can show that . If , then we can again use the generalized Laplace expansion
where runs over all subsets of with 3 elements. This proves that
Homogeneous polynomials can be thought of as symmetric tensors. For symmetric tensors there is also a notion of rank, the so-called symmetric rank. The symmetric rank is different from, but closely related to the tensor rank. The determinant and permanent can be thought of as homogeneous polynomials. Lower bounds for the symmetric tensor rank of the determinant and permanent can be found in and .
The author thanks Zach Teitler for useful comments and a correction.