The Story of the Determinant: Why the Determinant Formula is True

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 Sa=a⊗1+∑jAj⊗sjS_a=a\otimes1+\sum_jA_j\otimes s_j and η(X)=∑jAjXAj\eta(X)=\sum_jA_jXA_j, the proposed formula is

log⁡Δ(Sa−z)=−12+infb⁡{trm⁡log⁡b+12⟨a−z,(𝒞b+η)−1(a−z)⟩},𝒞b(X)=bXb,\log\Delta(S_a-z)=-\frac12+\inf_{b}\Bigl\{\operatorname{tr}_m\log b +\frac12\langle a-z,(\mathcal C_b+\eta)^{-1}(a-z)\rangle \Bigr\}, \qquad \mathcal C_b(X)=bXb,

where the infimum is over positive matrices bb with 𝒞b−η⪰0\mathcal C_b-\eta\succeq0. It is true, for every real zz. 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 G−1+η(G)=z−aG^{-1}+\eta(G)=z-a. And the Dyson equation is the Euler–Lagrange equation of a functional, the Dyson action

𝒜z(M)=−trm⁡log⁡M−12trm⁡(Mη(M))+trm⁡((z−a)M)−1.\mathcal A_z(M)=-\operatorname{tr}_m\log M-\frac12\operatorname{tr}_m\bigl(M\eta(M)\bigr) +\operatorname{tr}_m\bigl((z-a)M\bigr)-1 .

If you differentiate the action at its critical point with respect to zz, only the explicit zz contributes, and you get trm⁡G\operatorname{tr}_mG. So the action at the Dyson solution is also an integral of the Stieltjes transform, and it is not a surprise that log⁡Δ(Sa−z)=Re⁡𝒜z(G(z))\log\Delta(S_a-z)=\operatorname{Re}\mathcal A_z(G(z)). The shift aa plays no role here. It rides along with zz.

So the determinant is a critical value. The trouble is that it is the wrong kind of critical value. The action is holomorphic in MM, so the Dyson solution is a saddle of its real part, with as many directions going down as going up. A formula with an “inf⁡\inf” in it cannot come from the action directly.

The idea: free the scale

In the centered case the answer is det⁡b\det b for the matrix bb that scales η\eta to a doubly stochastic map. This suggested that GG should come with a positive “scale” also in general. It does: there is a unique b≻0b\succ0 with

G=b−1/2Ub−1/2,U unitary.G=b^{-1/2}\,U\,b^{-1/2},\qquad U\ \text{unitary}.

For scalars this is just b=1/|G|b=1/|G| and UU is the phase.

The step that was unexpected for me is to forget that bb is determined by GG and treat it as a new independent variable. Write G=−u−iγG=-u-i\gamma and consider

𝒦(b,u,γ)=trm⁡log⁡b+⟨a−z,u⟩−12⟨u,(𝒞b+η)u⟩−12⟨γ,(𝒞b−η)γ⟩.\mathcal K(b,u,\gamma)=\operatorname{tr}_m\log b+\langle a-z,u\rangle -\frac12\langle u,(\mathcal C_b+\eta)u\rangle -\frac12\langle \gamma,(\mathcal C_b-\eta)\gamma\rangle .

When bb is the true scale of −u−iγ-u-i\gamma this is the real part of the Dyson action (plus 12\frac12), by a direct computation. And the Dyson solution, together with its scale, is still a critical point of 𝒦\mathcal K in the three variables. So nothing is lost. What is gained is that the saddle has been taken apart: 𝒦\mathcal K is concave in uu and in γ\gamma, 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 𝒞b−η⪰0\mathcal C_b-\eta\succeq0 as a condition somebody cleverly imposed. But look at the last term of 𝒦\mathcal K. Its supremum over γ⪰0\gamma\succeq0 is 00 if 𝒞b−η⪰0\mathcal C_b-\eta\succeq0 and +∞+\infty otherwise. The feasible set is simply the set of bb for which the problem makes sense. It is the trace that the imaginary part of GG leaves behind.

Maximizing over uu then gives exactly the function in Roland’s formula.

The second is convexity, and this is the heart of the matter. The function of bb that remains is not convex in the usual sense. It is convex along the geodesics b1/2etXb1/2b^{1/2}e^{tX}b^{1/2} of the positive cone, and it is so precisely on the feasible set. The scalar semicircle shows what this means. There the function is

Fx(b)=log⁡b+x22(b2+1),b≥1.F_x(b)=\log b+\frac{x^2}{2(b^2+1)},\qquad b\ge1 .

For positive numbers the geodesics are simply t↦bett\mapsto be^{t}, so geodesic convexity is ordinary convexity in the variable s=log⁡bs=\log b. In this variable

Fx=s+x24(1−tanh⁡s).F_x=s+\frac{x^2}{4}\,\bigl(1-\tanh s\bigr).

The first term is linear. The second is a reflected tanh⁡\tanh: it is convex for s>0s>0 and concave for s<0s<0, and its inflection point is at s=0s=0, that is, at b=1b=1, 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 εtrm⁡γ\varepsilon\operatorname{tr}_m\gamma to 𝒦\mathcal K, which adds a positive term of order ε2\varepsilon^2 to the function of bb, and lets ε→0\varepsilon\to0. Everything is monotone, and one never needs to know what the minimizers do.

What the picture looks like

In the scalar example the equation Fx′(b)=0F_x'(b)=0 is b+1/b=|x|b+1/b=|x|, which is the Dyson equation for b=1/|G|b=1/|G|. For |x|>2|x|>2 it has a solution with b>1b>1. For |x|<2|x|<2 it has none, the minimum sits at the wall b=1b=1, and its value is x2/4x^2/4, 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 𝒞b−η\mathcal C_b-\eta at the minimizer contains γ=−Im⁡G\gamma=-\operatorname{Im}G. 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 bεb_\varepsilon 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 S=a0⊗1+∑ai⊗siS=a_0\otimes1+\sum a_i\otimes s_i with arbitrary matrices aia_i and any complex zz. For each fixed bb the function under the infimum is a quadratic polynomial in Re⁡z\operatorname{Re} z and Im⁡z\operatorname{Im}z. 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 bzb_z sits in the interior or on the boundary of the feasible set. By the picture above this should detect the spectrum of SS: if S−zS-z 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 SS 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 RR-diagonal elements, where it happens when the element has an inverse which is in L2L^2 but is not bounded. Miyagawa has recently shown that a rational function in free semicirculars which is in L2L^2 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.

Leave a Reply