The single ring theorem
Alice Guionnet, Manjunath Krishnapur, Ofer Zeitouni
The problem
Horn asked the question of describing the eigenvalues of a square matrix with prescribed singular values. If is a matrix with singular values and eigenvalues in decreasing order of absolute values, then the inequalities
were shown by Weyl to hold. Horn established that these were all the relationships between singular values and eigenvalues.
In this paper we study the natural probabilistic version of this problem and show that for “typical matrices”, the singular values almost determine the eigenvalues. To frame the problem precisely, fix and consider matrices with these singular values. They are of the form , where is diagonal with entries on the diagonal, and are arbitrary unitary matrices.
We make into a random matrix by choosing and independently from Haar measure on , the unitary group of matrices, and independent from . Let be the (random) eigenvalues of . The following natural questions arise.
Are there deterministic or random sets , for which one can find the exact distribution of ?
For finite , for fixed , is concentrated in the space of probability measures on the plane?
In this paper, we concentrate on the second question and answer it in the affirmative, albeit with some restrictions. In this context, we note that Fyodorov and Wei [8, Theorem 2.1] gave a formula for the mean eigenvalues density of , yet in terms of a large sum which does not offer an easy handle on asymptotic properties (see also for the case where is a projection). The authors of explicitely state the second question as an open problem.
Of course, questions 1–3. above are not new, and have been studied in various formulations. We now describe a partial and necessarily brief history of what is known concerning questions 1. and 2.; partial results concerning question 3. will be discussed elsewhere.
The most famous case of a positive answer to question 1. is the Ginibre ensemble, see , and its asymmetric variant, see . (There are some pitfalls in the standard derivation of Ginibre’s result. We refer to for a discussion.) Another situation is the truncation of random unitary matrices, described in .
Concerning question 2., the convergence of the empirical measure of eigenvalues in the Ginibre ensemble (and other ensembles related to question 1.) is easy to deduce from the explicit formula for the joint distribution of eigenvalues. Generalizations of this convergence in the absence of such explicit formula, for matrices with iid entries, is covered under Girko’s circular law, which is described in ; the circular law was proved under some conditions in and finally, in full generality, in and . Such matrices, however, do not possess the invariance properties discussed in connection of question 2. The single ring theorem of Feinberg and Zee is, to our knowledge, the first example where a partial answer to this question is offered. (Various issues of convergence are glossed over in and, as it turns out, require a significant effort to overcome.) As we will see in Section 3, the asymptotics of the spectral measure appearing in question 2. are described by the Brown measure of -diagonal operators. (The Brown measure is a continuous analogue of the spectral distribution of non-normal operators, introduced in .) -diagonal operators were introduced by Nica and Speicher in the context of free probability; they represent the weak*-limit (or more precisely, the limit in -moments) of operators of the form with unitary with size going to infinity and diagonal, and were intensively studied in the last decade within the theory of free probability, in particular in connection with the problem of classifying invariant subspaces .
Limiting spectral density of a non-normal matrix
is analytic off the support of . We let denote the Haar measure on the -dimensional unitary group . Let denote a sequence of independent, -distributed matrices. Let denote a sequence of diagonal matrices, independent of , with real positive entries on the diagonal, and introduce the empirical measure of the symmetrized version of as
Let , let denote the set of eigenvalues of , and set
There exist constants such that
converges in probability to a limiting probability measure .
The support of is a single ring: there exist constants so that
Further, if and only if .
See Remark 7 for an explicit characterization of the free convolution appearing in Theorem 1, and [1, Ch. 5] for general background. A different characterization of , borrowed from and instrumental in the proof of part (c) of Theorem 1, is provided in Remark 8 in Section 3.1.
As a corollary of Theorem 1, we prove the Feinberg-Zee “single ring theorem”.
Let denote a polynomial with positive leading coefficient. Let the -by- complex matrix be distributed according to the law
where is a normalization constant and the Lebesgue measure on -by- complex matrices. Let be the ESD of . Then satisfies the conclusions of Theorem 1 with the unique minimizer of the functional
Theorem 3 will follow by checking that the assumptions of Theorem 1 are satisfied for the spectral decomposition , see Section 6.
The second hypothesis in Theorem 1 may seem difficult to verify in general; we show in the next proposition that adding a small Gaussian matrix guarantees it.
Let be a sequence of matrices satisfying the assumptions of Theorem 1 except for (3) and assume that is uniformly bounded. Let be a matrix with independent (complex) Gaussian entries of zero mean and covariance equal identity. Let follow the Haar measure on unitary matrices, independently of . Then, the empirical measure of the eigenvalues of converges weakly in probability to as in Theorem 1 for any .
satisfies the hypotheses of Proposition 4.
A rather straightforward generalization of Theorem 1 concerns the limiting spectral measure of , where is distributed and the sequence of matrices converges in -moments to an operator in a non-commutative probability space . (The latter means that for all polynomial in two non-commutative variables,
An example of matrices which satisfy the hypotheses of Proposition 6 is given by the diagonal matrices with entries satisfying the hypotheses of Example 5. This is easily verified from the fact that the eigenvalues of are given by .
The main difficulty in studying the ESD is that is not a normal matrix, that is , almost surely. For normal matrices, the limit of ESDs can be found by the method of moments or by the method of Stieltjes’ transforms. For non-normal matrices, the only known method of proof is more indirect and follows an idea of Girko that we describe now (the details are a little different from what is presented in Girko or Bai ).
From Green’s formula, for any polynomial , we have
It will be convenient for us to introduce the matrix
It may be checked easily that eigenvalues of are the positive and negative of the singular values of . Therefore, if we let denote the ESD of ,
This is Girko’s formula in a different form and its utility lies in the following attack on finding the limit of .
Justify that for (almost every) . But for the fact that “” is not a bounded function, this would have followed from the weak convergence of to . As it stands, this is the hardest technical part of the proof.
A standard weak convergence argument is then used in order to convert the convergence for (almost every) of to a convergence of integrals over . Indeed, setting , we will get from (6) that
Show that is smooth enough so that one can integrate the previous equation by parts to get
which identifies as the density (with respect to Lebesgue measure) of the limit of .
Identify the function sufficiently precisely to be able to deduce properties of . In particular, show the single ring phenomenon, which states that the support of the limiting spectral measure is a single annulus (the surprising part being that it cannot consist of several disjoint annuli).
Girko’s equation (6) and these five steps give a general recipe for finding limiting spectral measures of non-normal random matrices. Whether one can overcome the technical difficulties depends on the model of random matrix one chooses. For the model of random matrices with i.i.d. entries having zero mean and finite variance, this has been achieved in stages by Bai , Götze and Tikhomirov , Pan and Zhou and Tao and Vu . While we heavily borrow from that sequence, a major difficulty in the problem considered here is that there is no independence between entries of the matrix . Instead, we will rely on properties of the Haar measure, and in particular on considerations borrowed from free probability and the so called Schwinger–Dyson (or master-loop) equations. Such equations were already the key to obtaining fine estimates on the Stieltjes transform of Gaussian generalized band matrices in . In , they were used to study the asymptotics of matrix models on the unitary group. Our approach combines ideas of to estimate Stieltjes transforms and the necessary adaptations to unitary matrices as developped in . The main observation is that one can reduce attention to the study of the ESD of matrices of the form where is real diagonal and is Haar distributed. In the limit (i.e., when and are replaced by operators in a -algebra that are freely independent, with bounded and self adjoint and unitary), the limit ESD has been identified by Haagerup and Larsen . The Schwinger–Dyson equations give both a characterization of the limit and, more important to us, a discrete approximation that can be used to estimate the discrepancy between the pre-limit ESD and its limit. These estimates play a crucial role in integrating the singularity of the log in Step two above, but only once an a-priori (polynomial) estimate on the minimal singular value has been obtained. The latter is deduced from assumption 3. In the context of the Feinberg–Zee single ring theorem, the latter assumption holds due to an adaptation of the analysis of .
Notation
We describe our convention concerning constants. Throughout, by the word constant we mean quantities that are independent of (or of the complex variables , ). Generic constants denoted by the letters , or , have values that may change from line to line, and they may depend on other parameters. Constants denoted by , , and are fixed and do not change from line to line.
where is unitary and distributed. Throughout, we will write . We also will assume in this section that the sequence is deterministic. We are thus led to the study of the ESD for a sequence of matrices of the form
with , being a real, diagonal matrix of uniformly bounded norm, and a unitary matrix. Because is uniformly bounded, it will be enough to consider throughout uniformly bounded.
where we used the notation .
By the invariance of under unitary conjugation, see [27, Proposition 5.17] or [1, (5.4.31)], we have the Schwinger–Dyson equation
We continue to use the notation , and in a way similar to (17) and (18). So, we let with
We extend to the algebra generated by and by putting for any ,
Observe that this extension is still tracial.
The non-commutative derivative in (20) extends naturally to the algebra generated by the matrix-valued , using the Leibniz rule (19) together with the relations
where . Further, (21) extends also in this context.
We apply the derivative to the analytic function while noticing that, by (19) and (23),
Applying (21), with and , we find
Note that and thus . Further, for any smooth function , equals due to the traciality of and . By symmetry (note that and are given by the same formula up to replacing by , which has the same law) we get that equals
The first equality holds without the last factor , thus implying that and so we get from (26) that
Noticing that is the limit of as , we find by (28) that
and therefore, as goes to zero as ,
(Again, here and in the rest of this subsection, the proper branch of the square root is determined by analyticity.) Let denote the -transform of the Bernoulli law , that is,
see [1, Definition 5.3.22 and Exercise 5.3.27], so that we have
Repeating the computation with , we have . Algebraic manipulations yield
Therefore, we get by substituting (31) and (32) into (33) that
and has an analytic continuation to a neighborhood of , and on . Further, with as above, and it holds that
Finally, has an analytic continuation to a neighborhood of , and is a probability measure, see [13, Pg 333].
In the next section, we will need the following estimate.
If on then on .
2 Finite n𝑛n equations and convergence
We next turn to the evaluation of the law of . We assume throughout that the sequence is uniformly bounded by some constant , that weakly in probability, and further that (4) is satisfied. All constants in this section are independent of , but depend implicitly on , the uniform bound on and on .
We get by taking that
with the Lipschitz constant of given by
if is the cyclic derivative given by with and denotes the operator norm. (The appearance of the cyclic derivative in the evaluation of the Lipshitz constant can be seen by approximating by polynomials.) Applying (41) to each term of (recall formula (25)), we get that for , and with ,
(The inequality uses that for any Hermitian matrix, .) Multiplying by and taking the limit as we deduce from (40) that
with again the choice of the square root determined by analyticity and behavior at infinity.
and therefore, as for all
Moreover, since , we deduce from (42) that for some constant independent of and all large,
Combining this estimate and (48), we get that
as soon as for an appropriate , and . The conclusion follows.
There exists a constant such that if , then
Then, for any , and whatever choice of branch of the square root made in (43), if is small enough (smaller than is fine), then that choice can be extended to include a neighborhood of the point such that with this choice, the function is Lipschitz in the sense that
Combining the last display with the relation , (50) and (48), one obtains that for ,
Since the above right hand side is smaller than for , we conclude that for
as, regardless of the branch taken in the definition of , .
We thus conclude from the last display and (51) the existence of a constant such that if then
We have made all preparatory steps in order to state the main result of this subsection.
There exist positive finite constants such that, for and all ,
Proof This is immediate from Lemma 11, Lemma 12, the definition of , the assumption (4) on , and the equality (46). ∎
in probability. (ii) Fix . For any smooth compactly supported deterministic function on ,
Before bringing the proof of Proposition 14, we recall the following elementary lemma.
We can now provide the Proof of Proposition 14
(i) Assume for some . By (3), we can replace the lower limit of integration in (53) with . Let denote the Stieltjes transform of . By Lemma 13 and Lemma 9, there exist positive constants such that whenever , it holds that . We may and will assume that .
Since is the Stieltjes transform of , by Lemma 15, we have for any that
Thus, we get that for any and with ,
where . Note that by Lemma 15 and the estimate on , for ,
where the constant . To obtain the estimate (53), we will consider and argue as follows. Due to (3), for we have
by Hölder’s inequality. The first factor goes to zero because
By (3), the second factor is bounded by . We thus get (53) from (57). By Chebycheff’s inequality, the convergence in expectation implies the convergence in probability and therefore for any there exists small enough so that
On the other hand, converges to by the weak convergence of to in probability for any , and converges to as since has a bounded density by Lemma 9. Hence, we get (54).
and set . Because is supported in on for all , is bounded above by . By (57), is bounded, uniformly in . On the other hand, by (3), again uniformly in , , and therefore
is bounded in probability. This uniform integrability and the weak convergence (54) are enough to conclude, using dominated convergence (see [25, Lemma 3.1] for a similar argument). ∎
Proof of Theorem 1
in probability. Since the sequence is tight, it thus follows that it converges, in the sense of distribution, to the measure
From Remark 8 (based on [13, Corollary 4.5]), we have that is a probability measure that possesses a radially symmetric density satisfying the properties stated in parts b and c of the theorem. ∎
Proof of Theorem 3
which goes to zero for . Together with [22, Equation (2.32)], this proves point 3 of the assumptions. Thus, it remains only to check point 2 of the assumptions. Toward this end, define and note that we may and will restrict attention to when checking (3). We begin with the following proposition, due to .
Let be an arbitrary -by- matrix, and let where is a matrix with independent (complex) Gaussian entries of zero mean and unit variances. Let denote the minimal singular value of . Then, there exists a constant independent of , or such that
The proof of Proposition 16 is identical to [23, Theorem 3.3], with the required adaptation in moving from real to complex entries. (Specifically, in the right side of the display in [23, Lemma A.2], is replaced by its square.) We omit further details.
On the event , all entries of the matrix are bounded by a constant multiple of . Let be a Gaussian matrix as in Proposition 16. With a constant to be determined below, set
Turning to the construction, observe first that from (59),
Let . Let and denote the eigenvalues of and of , respectively, arranged in decreasing order. Note that the density of is of the form
where the variable is matrix valued and , while that of is of the form
where denotes expectation with respect to the law of , and is the same in both expressions. Note that . Because is locally Lipschitz, we have that if either or , then there exists a constant independent of so that
where the Cauchy–Schwarz inequality was used in the third inequality and the Hoffman–Wielandt inequality in the next (see e.g. [1, Lemma 2.1.19]). On the event , all entries of are bounded by . Therefore,
where the constant does not depend on . In particular, if we obtain that on , the ratio of the functions and is bounded e.g. by ; in particular, it holds that
Therefore, the variational distance between the law of conditioned on and that of conditioned on , is bounded by
It follows that one can construct a matrix of law identical to the law of conditioned on , together with , on the same probability space so that
where was chosen as function of . This yields immediately point 2 of the assumptions of Theorem 1, if .
We have checked now that in the setup of Theorem 3, all the assumptions of Theorem 1 hold. Applying now the latter theorem completes the proof of Theorem 3. ∎
The proof of Theorem 3 carries over to more general situations; indeed, does not need to be a polynomial, it is enough that its growth at infinity is polynomial and that it is locally Lipschitz, so that the results of still apply. We omit further details.
Proof of Proposition 4
with a finite constant depending only on which we assumed bounded. (In deriving the last estimate, we used that when .) As a consequence, the third condition is satisfied since
with and . Hence, the results of Lemma 13 hold and we need only check, as in Proposition 14, that with the empirical measure of the singular values of ,
where we finally used that is Hölder continuous with index . ∎
Extension to orthogonal conjugation
In this section, we generalize Theorem 1 to the case where we conjugate by orthogonal matrices instead of unitary matrices.
Proof of Proposition 6
whereas our hypotheses allow us to bound uniformly the Stieltjes transform of on as in Lemma 13, hence providing a control of the integral on the interval . The control of the integral for uses a regularization by the Gaussian matrix as in Proposition 4 .∎
Acknowledgments: We thank Greg Anderson for many fruitful and encouraging discussions. We thank Yan Fyodorov for pointing out the paper and Philippe Biane for suggesting that our technique could be applied to the examples in . We thank the referee for a careful reading of the manuscript.