Math 2.0

statement theorem

Gershgorin circle theorem

Statement

Let A=(aij)A = (a_{ij}) be an n×nn \times n matrix over C\C. For 1≤i≤n1 \le i \le n, let Ri=∑j≠i∣aij∣R_i = \sum_{j \ne i} \abs{a_{ij}}, and let Di={z∈C:∣z−aii∣≤Ri}D_i = \{z \in \C : \abs{z - a_{ii}} \le R_i\} be the closed disc with centre aiia_{ii} and radius RiR_i. Then each eigenvalue of AA lies in at least one of the discs D1,…,DnD_1, \dots, D_n.

Remarks

The discs are called Gershgorin discs. The proof takes an eigenvector xx and an index ii with ∣xi∣\abs{x_i} maximal, and estimates row ii of Ax=λxAx = \lambda x. Since AA and ATA^T have the same eigenvalues, the same holds with column sums. A strictly diagonally dominant matrix, with ∣aii∣>Ri\abs{a_{ii}} > R_i for all ii, has no eigenvalue 00, so it is invertible.

Explanations

L1 human

The eigenvalues of a matrix lie near its diagonal entries, when the other entries are small. Each row gives a disc around its diagonal entry, with the radius equal to the sum of the other absolute values of the row. Every eigenvalue lies in one of these discs.

What this node needs for W2
  • edge about out: the concepts that the statement is about (0 of 1)
  • edge proves in: at least one proof node (0 of 1)
  • edge instance_of or illustrates in: one example that shows the statement at work (0 of 1)
  • explanation L2 (0 of 1)

The writing levels say how complete the text of a node is. They do not measure its truth.

What this needs

To read this node, read these 5 nodes in this order. The foundations come first, and the list ends with this node.

Each node uses the nodes above it. The colour of the bar on a box shows the evidence level, and the box also gives it as text. The list below has the same nodes.
  • no evidence level
  1. Vector space definition
  2. Linear map definition
  3. Endomorphism definition
  4. Eigenvalue definition
  5. Gershgorin circle theorem statement

Sources

  1. Web https://en.wikipedia.org/wiki/Gershgorin_circle_theorem, Statement and proof