post by Vladislav Kargin
In his post Roland asked whether the Mai–Speicher formula for the Fuglede–Kadison determinant of a matrix semicircle survives when a constant matrix is added. With and , the proposed formula is
where the infimum is over positive matrices with . It is true, for every real . The proof is in the manuscript (which will appear on arXiv soon). Here I only want to say how I think about it, because the formula looked strange to me at first and now it looks a bit less strange.
There had to be some formula
The logarithmic potential is an integral of the Stieltjes transform. The Stieltjes transform comes from the Dyson equation . And the Dyson equation is the Euler–Lagrange equation of a functional, the Dyson action
If you differentiate the action at its critical point with respect to , only the explicit contributes, and you get . So the action at the Dyson solution is also an integral of the Stieltjes transform, and it is not a surprise that . The shift plays no role here. It rides along with .
So the determinant is a critical value. The trouble is that it is the wrong kind of critical value. The action is holomorphic in , so the Dyson solution is a saddle of its real part, with as many directions going down as going up. A formula with an “” in it cannot come from the action directly.
The idea: free the scale
In the centered case the answer is for the matrix that scales to a doubly stochastic map. This suggested that should come with a positive “scale” also in general. It does: there is a unique with
For scalars this is just and is the phase.
The step that was unexpected for me is to forget that is determined by and treat it as a new independent variable. Write and consider
When is the true scale of this is the real part of the Dyson action (plus ), by a direct computation. And the Dyson solution, together with its scale, is still a critical point of in the three variables. So nothing is lost. What is gained is that the saddle has been taken apart: is concave in and in , so all the descending directions sit in these two variables, and one can remove them by maximizing.
Two things that come for free
The first is the constraint. I had thought of as a condition somebody cleverly imposed. But look at the last term of . Its supremum over is if and otherwise. The feasible set is simply the set of for which the problem makes sense. It is the trace that the imaginary part of leaves behind.
Maximizing over then gives exactly the function in Roland’s formula.
The second is convexity, and this is the heart of the matter. The function of that remains is not convex in the usual sense. It is convex along the geodesics of the positive cone, and it is so precisely on the feasible set. The scalar semicircle shows what this means. There the function is
For positive numbers the geodesics are simply , so geodesic convexity is ordinary convexity in the variable . In this variable
The first term is linear. The second is a reflected : it is convex for and concave for , and its inflection point is at , that is, at , exactly the boundary of the feasible set. So the constraint that came out of the imaginary part is the same as the condition that makes the problem convex. I do not think this is an accident, but I cannot say in one sentence why it must be so.
Once we have convexity, a critical point is a global minimum, and the critical point is the scale of the Dyson solution. This is the whole proof in the upper half-plane. To get to the real axis one adds to , which adds a positive term of order to the function of , and lets . Everything is monotone, and one never needs to know what the minimizers do.
What the picture looks like
In the scalar example the equation is , which is the Dyson equation for . For it has a solution with . For it has none, the minimum sits at the wall , and its value is , as it should be.
The same holds for matrices, at least at points where the density is nondegenerate. Outside the spectrum the minimizer is in the interior of the feasible set. Inside the spectrum it is on the boundary, and the kernel of at the minimizer contains . In other words, the spectrum is where the constraint is active, and the density of states is its Lagrange multiplier. This is the form in which I remember the result.
What I do not understand
Is the infimum attained at spectral edges, and at points where the matrix density is nonzero but singular? I do not know. The scales might run away, and at points where the density blows up they do. It would be nice to read the type of the singularity from how fast they run.
The question I find most interesting is about the Brown measure. By hermitization the formula applies to any with arbitrary matrices and any complex . For each fixed the function under the infimum is a quadratic polynomial in and . So the logarithmic potential of the Brown measure is an infimum of quadratic polynomials over a fixed convex set.
Now we can ask whether the minimizer sits in the interior or on the boundary of the feasible set. By the picture above this should detect the spectrum of : if is invertible, the minimizer is in the interior. Is this enough to detect the support of the Brown measure? That is, is the Brown measure of supported exactly where the constraint is active? For general operators the spectrum can be strictly larger than the support of the Brown measure. Haagerup and Larsen found this for -diagonal elements, where it happens when the element has an inverse which is in but is not bounded. Miyagawa has recently shown that a rational function in free semicirculars which is in is bounded, so this mechanism is not available here, and he asks whether there is any gap at all in that setting. Hall and Ho proved that there is none for a self-adjoint element plus a free elliptic one. For matrix semicirculars I do not know the answer. If there is no gap, the variational problem should show it: one would have to prove that the potential cannot be harmonic at a point where the constraint binds.
While this post was waiting to appear, Sheng Yin sent me a different formula for the same determinant, also found with the help of AI. In his formula the infimum is over all positive matrices, with no constraint, and it is attained exactly when the operator is invertible; in Roland’s formula the minimizer sits on the wall inside the spectrum. For self-adjoint coefficients the two are related by an explicit change of variables, which turns the free variable of one into the constrained variable of the other. His manuscript is on Hexagon (hexagon:2610.00180). How the two pictures fit together in general is something we would like to understand.
I should add that I worked on this in long conversations with language models. It felt like working with a co-author, and I cannot separate who contributed what. The responsibility for the correctness is mine.
