Use block matrix elimination with the invertible square block :
The left multiplier is block triangular with identity diagonal blocks, so its determinant is . Taking the determinant of the block-triangular product proves
The matrix is the Schur complement of . The proof needs invertible, but does not assume the Schur complement or the full matrix is invertible.
Take off the real axis, or more generally require both and to be invertible. The spectral theorem for real symmetric matrices guarantees these inverses for nonreal . Move coordinate to the first position by a simultaneous row and column permutation. With , the permuted matrix is
Solve its equation against the first coordinate vector: if its solution is , then the lower block equation gives . Substitution into the first equation gives . The component is the requested diagonal entry of the matrix inverse, proving the Schur complement formula for a diagonal resolvent entry:
The product is bilinear, with transpose, because is real and is real symmetric, even when the inverse is complex. In a complex Hermitian matrix version the row is instead. The final belongs inside the denominator, as in the original PDF; the converted TeX misplaces it outside the fraction.
The inverse hypotheses matter if is real: is invertible at , while its one-by-one principal minor is not. Thus existence of the full inverse alone is not sufficient to use this formula.
Work with in the upper half-plane. Write the Stieltjes matrix resolvents and their normalized matrix traces as
The minor trace is normalized by , not by . This sign convention is the negative of the convention used in the general resolvent of an operator article. Here is the Stieltjes transform of a measure of the empirical spectral measure, with kernel .
The diagonal entries of are zero, so the preceding Schur complement formula gives . Taking the matrix trace, subtracting the comparison value , and combining fractions gives the resolvent self-consistency defect
The positive numerator sign is fixed by this subtraction. All denominators are nonzero in the upper half-plane, as the imaginary-part estimate in the next part shows. The identity is deterministic and does not use entry independence or moment assumptions.
Put . For a real eigenvalue ,
The spectral theorem for real symmetric matrices therefore gives and , since is a sum of with nonnegative coefficients given by squared eigenvector coordinates of . This is the positive imaginary part of a Stieltjes matrix resolvent. Hence
Apply the triangle inequality to the identity above, and add and subtract the minor trace:
The allowed principal minor resolvent trace bound, with the printed normalization, bounds the second average by . Thus the explicit conclusion is
In particular, the final term is with a constant independent of . The upper-half-plane restriction gives the displayed positive denominators; in the lower half-plane the analogous bound uses .
The chosen centering also has a probabilistic meaning. The column vector is independent of the minor, has mean zero and coordinate variance , so its conditional expectation satisfies
This explains why the bound isolates fluctuations of a quadratic form around the minor trace. Mean centering alone is not a concentration estimate; no unrequested limiting assertion is being assumed.

Articles by others on the same topic (0)

There are currently no matching articles.