Assume , so the corner entry is separate from the superdiagonal. For , the row radii are
Thus every eigenvalue lies in the union . The discs with centers remain mutually disjoint. The expanding disc centered at one meets the disc centered at exactly when .
Let . Then the union of discs indexed by contains exactly eigenvalues; every other disc contains exactly one. Every isolated eigenvalue is real by conjugation and obeys . Once discs merge, the second Gershgorin circle theorem gives a bound and count for their whole component, rather than one eigenvalue per original disc. Eigenvalue branches coming from that component stay in its union, but may no longer be distinguished by individual discs. These statements describe the bounds through all merger thresholds as increases.
For each row, a Gershgorin disc has centre and radius . Here and , so the Gershgorin circle theorem gives
Since is a real symmetric matrix, its eigenvalues are real. Intersecting the union of these Gershgorin discs with the real axis yields
This bound permits zero but does not assert a zero eigenvalue. The fixed-end Dirichlet boundary conditions exclude it: for any nonzero real vector , extend by and calculate
Indeed, equality would force every adjacent value to agree with the zero endpoint. Thus is a symmetric positive-definite matrix, is a negative-definite matrix, and the eigenvalues satisfy . The same argument works for any number of interior grid points, with prefactor in the sum. The fixed string has no zero-frequency rigid translation.
Strictly diagonally dominant matrix Created 2026-09-24 Updated 2026-10-03
A matrix is strictly diagonally dominant when every diagonal-dominance inequality is strict. A real symmetric strictly diagonally dominant matrix with positive diagonal is positive definite by the Gershgorin circle theorem.