research32 min studyLesson 854 in Mathematics

Resolvents and self-consistent equations

Use exact inverse identities to organize spectral estimates before making probabilistic approximations.

On this page

What you’ll understand

  • Derive resolvent bounds and positivity from Hermitian spectral calculus.
  • Apply Schur complements with the correct sign convention.
  • Separate exact self-consistency identities from concentration-based approximations.

A resolvent replaces a discontinuous eigenvalue count with an inverse matrix evaluated off the real axis. This regularization permits exact algebraic identities, perturbation bounds, and concentration estimates. Random-matrix proofs then exploit independence between one row and a complementary minor. A self-consistent equation emerges only after a random quadratic form has been controlled; the Schur complement by itself is an identity, not a limiting theorem.

Imaginary regularization controls the inverse

For a Hermitian matrix HH and z=E+iηz=E+i\eta with η>0\eta>0, define GH(z)=(H−zI)−1G_H(z)=(H-zI)^{-1}. Real eigenvalues ensure the inverse exists and its operator norm is at most the reciprocal of eta. The normalized trace is precisely the empirical Stieltjes transform with the denominator convention used throughout this module. The imaginary part of the matrix resolvent is positive semidefinite and equals eta times its adjoint product, giving a useful entrywise summation identity as well as a sign check.

For two Hermitian matrices, multiplying the inverse difference on both sides yields the displayed perturbation identity. At the same spectral parameter, its operator norm is at most the matrix perturbation norm divided by eta squared. This can be a coarse but deterministic estimate; it does not need any randomness. As the imaginary part shrinks, the bound worsens, reflecting the greater sensitivity of a finely resolved spectral question. A small perturbation at a fixed smoothing scale need not remain negligible at every microscopic scale.

∥GH(E+iη)∥op≤η−1,Im⁡GH=ηGH∗GH,GA−GB=GA(B−A)GB.\|G_H(E+i\eta)\|_{\mathrm{op}}\leq\eta^{-1},\qquad \operatorname{Im}G_H=\eta G_H^*G_H,\qquad G_A-G_B=G_A(B-A)G_B.
All resolvents in the last identity use the same upper-half-plane argument; the order and sign follow from inverse multiplication.↔ Scroll wide equations horizontally.

Removing a row gives a Schur complement

Delete one index and denote the complementary minor by H(i)H^{(i)}, with the removed column off that diagonal denoted by aia_i. Block inversion gives the diagonal resolvent entry as the reciprocal of its diagonal entry minus the spectral parameter minus the quadratic form involving the minor resolvent. For a Wigner matrix, the removed free column is independent of the minor. Conditional on the minor, its covariance converts the quadratic form’s conditional mean into the minor trace divided by matrix dimension.

The quadratic form is not equal to its conditional mean on each realization. Bounding their difference requires assumptions on entry tails or moments and estimates on the minor resolvent. Comparing the minor trace with the full trace introduces another controlled error, usually via interlacing or a resolvent relation. At fixed positive imaginary part these ingredients can lead to the scalar closure m≈−1/(z+m)m\approx-1/(z+m). The approximation sign records genuine probabilistic work that must be supplied rather than erased by formal manipulation.

Gii(z)=1hii−z−ai∗G(i)(z)ai,E ⁣[ai∗G(i)ai∣H(i)]=1NTr⁡G(i)for independent column covariance I/N.G_{ii}(z)=\frac1{h_{ii}-z-a_i^*G^{(i)}(z)a_i},\qquad \mathbb E\!\left[a_i^*G^{(i)}a_i\mid H^{(i)}\right]=\frac1N\operatorname{Tr}G^{(i)}\quad\text{for independent column covariance }I/N.
The first formula is exact block algebra. The second is a conditional expectation under the specified centered covariance and independence.↔ Scroll wide equations horizontally.

Stability and shrinking spectral scales

Once an approximate equation is obtained, one must show its solution remains near the intended semicircle branch. The derivative of the scalar quadratic at that branch becomes small near a spectral edge, so a small residual need not yield the same solution error everywhere. The positive imaginary part and normalization at infinity help select the correct root, while stability estimates quantify the remaining comparison. More general variance profiles can lead to coupled vector self-consistency equations rather than a single scalar equation.

A local law permits the imaginary part to decrease with matrix dimension, under specific tail and geometry assumptions. Its scale and error must be stated before using it to count eigenvalues in shrinking intervals or compare neighboring levels. The exact resolvent identities remain true at every positive imaginary part, but estimates derived with constants depending on a fixed lower bound for that part do not become local laws automatically. This separation of algebra, concentration, and stability is central to avoiding circular spectral arguments.

Check a Schur complement exactly

For H=(0110)H=\begin{pmatrix}0&1\\1&0\end{pmatrix} and z=iz=i, compute the resolvent directly and through its first Schur complement. Check the imaginary-part identity.

  1. The complementary one-by-one minor is zero, so its resolvent is (−i)−1=i(-i)^{-1}=i. The off-diagonal column is one, giving Schur denominator −i−i=−2i-i-i=-2i and diagonal entry i/2i/2.

  2. Direct inversion gives GH(i)=(i/21/21/2i/2)G_H(i)=\begin{pmatrix}i/2&1/2\\1/2&i/2\end{pmatrix}. Its normalized trace is i/2i/2, in agreement with averaging the scalar transforms of the two eigenvalues minus one and one.

  3. The adjoint product is GH∗GH=I/2G_H^*G_H=I/2, while the matrix imaginary part is also I/2I/2. With eta one the identity holds exactly, and the norm is 1/21/\sqrt2, below the general upper bound one.

The result

Direct inversion, the Schur complement, and Hermitian resolvent positivity agree with the same sign convention.

Explore the model

Interactive lab

Interactive lab · matrix

A small singular direction amplifies an inverse

Pause/Reset, set diagonal scale 0.25 and shear 0. Predict smallest singular value 0.25 and inverse norm 4. For a fresh comparison Pause/Reset, set both scale 1 and shear 0; the inverse norm is 1. Readouts describe the selected matrix even during its geometric interpolation.

A small singular direction amplifies an inverseThe selected matrix is A = [[a,b],[0,1]]. Playback interpolates geometry between the identity and A; readouts always describe A. Its determinant is a and its singular values come from AᵀA. Positive a makes every supported matrix invertible. This two-dimensional family is not a general eigensolver or a learned network. Current readings: Area scale · det A: 1.4; Singular values · σmax, σmin: 1.597, 0.876; Condition number · κ₂(A): 1.823. All parameters are adjustable with the labeled controls below.Matrix A with first row 1.4, 0.6 and second row zero, one; display interpolates between identity and A while final determinant remains 1.4.−4−2024−2−1012x · equal geometric scaleyA = [ 1.4 0.6 ; 0 1 ]Display blend: 0% · final values below
Interpolated geometryOriginal unit squareSelected final transform
Area scale · det A
1.4
Singular values · σmax, σmin
1.597, 0.876
Condition number · κ₂(A)
1.823
t = 0 s

The selected matrix is A = [[a,b],[0,1]]. Playback interpolates geometry between the identity and A; readouts always describe A. Its determinant is a and its singular values come from AᵀA. Positive a makes every supported matrix invertible. This two-dimensional family is not a general eigensolver or a learned network. Parameter changes pause playback and recompute the model at the current elapsed time. Reset restores both parameters and returns time to zero. Playback starts paused. Adjust either parameter, then choose Play or Step.

Look forInverse sensitivity is governed by distance from singularity. This real matrix family shows unregularized inversion; it does not evaluate a complex resolvent or a local random-matrix law.

Check your understanding

Which step in deriving a Wigner self-consistency equation requires probabilistic control rather than exact block algebra?

Try it yourself

For the worked matrix, set B=H+0.2IB=H+0.2I and keep z=iz=i. Bound ∥GH(i)−GB(i)∥op\|G_H(i)-G_B(i)\|_{\mathrm{op}} by the resolvent identity, then calculate the actual norm using their common eigenvectors.

Take a moment to make a prediction or work it out on paper. Open a hint when you need one.

Give me a hint

The deterministic bound uses eta one and perturbation norm 0.2. Compare the scalar inverse differences at eigenvalues minus one and one.

Compare with the solution

The general bound is 0.20.2. On the eigenvalue-minus-one direction, the difference has magnitude 0.2/(21.64)=1/820.2/(\sqrt2\sqrt{1.64})=1/\sqrt{82}; on the eigenvalue-one direction it is 1/1221/\sqrt{122}. Hence the actual operator norm is 1/82≈0.1104321/\sqrt{82}\approx0.110432, below the bound. Simultaneous diagonalization makes this an exact finite calculation. The gap between the actual value and the bound does not invalidate the bound, whose purpose is to work without computing individual eigenvalues.

Take it with you

  • Hermitian resolvents have a controlled inverse norm and positive imaginary part.
  • Schur complements are exact; replacing quadratic forms by traces requires concentration.
  • Self-consistency also needs branch stability and explicit scale-dependent errors.

Read further

Original sources and deeper explanations to follow at your own pace.

Optional progress, saved in this browser when available. Revisit any lesson at any time.

Lesson not marked complete.