{
  "aliases": null,
  "backlinks": null,
  "body": "\n## Definition\n\nLet $F$ be a field and let $A$ be an $n \\times n$ matrix over $F$.\nThe *spectrum* of $A$ is the set\n$$\\sigma(A) = \\{\\lambda \\in F : A - \\lambda I_n \\text{ is not invertible}\\}.$$\nIt is the set of [[eigenvalues|0BQAA2BK3Q]] of $A$.\n\n## Remarks\n\nThe spectrum has at most $n$ elements, because each eigenvalue is a root of the characteristic polynomial of degree $n$.\nOver $\\C$, the spectrum of each square matrix is nonempty.\nThe spectrum depends on the field: the real matrix $\\begin{pmatrix} 0 \u0026 -1 \\\\ 1 \u0026 0 \\end{pmatrix}$ has empty spectrum over $\\R$ and spectrum $\\{i, -i\\}$ over $\\C$.\nSome authors count the eigenvalues with their multiplicities and call this list the spectrum.\n\n## Explanations\n\n### L1 human\n\nThe spectrum is the list of all eigenvalues of a matrix.\nIt tells us the scaling factors that the matrix shows in special directions.\nFor a diagonal matrix, it is the set of diagonal entries.\n",
  "commit": "545acf83a9b75c8ddc375ef8b23d2ae101a4d7e4",
  "front": {
    "defines": "0XPX5NC67E",
    "kind": "definition",
    "msc": [
      "15A18"
    ],
    "name": "Spectrum of a matrix",
    "sources": [
      {
        "locator": "Definition",
        "url": "https://en.wikipedia.org/wiki/Spectrum_of_a_matrix"
      }
    ],
    "tag": "04EHB7YDQS",
    "uses": [
      "0ZND7NQ970"
    ]
  },
  "kind": "definition",
  "link": "https://math2.tamnd.com/node/04EHB7YDQS/",
  "links": [
    {
      "field": "defines",
      "target": "0XPX5NC67E"
    },
    {
      "field": "uses",
      "target": "0ZND7NQ970"
    }
  ],
  "markdown": "https://math2.tamnd.com/node/04EHB7YDQS.md",
  "msc": [
    "15A18"
  ],
  "name": "Spectrum of a matrix",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/04E/04EHB7YDQS.md",
  "status": null,
  "tag": "04EHB7YDQS",
  "uri": "m2://04EHB7YDQS",
  "url": "https://math2.tamnd.com/wiki/spectrum-of-a-matrix-definition/",
  "writing": {
    "tag": "04EHB7YDQS",
    "kind": "definition",
    "level": "W1",
    "next": [
      {
        "what": "edge instance_of in",
        "note": "one example",
        "have": 0,
        "want": 1
      },
      {
        "what": "edge not_instance_of in",
        "note": "one non-example that fails one clause",
        "have": 0,
        "want": 1
      }
    ]
  }
}
