{
  "id": "eigenspace",
  "title": "Eigenspace",
  "lang": "en",
  "source_lang": "en",
  "summary": "An eigenspace is the linear subspace consisting of the zero vector and all eigenvectors associated with a particular eigenvalue of a linear operator.",
  "category": "mathematics",
  "subcategory": "algebra",
  "type": "concept",
  "aliases": [
    "Eigenvalue subspace",
    "Characteristic subspace"
  ],
  "generated_at": "2026-10-04",
  "model": "pro/gpt-6.1-sol",
  "url": "https://aiwiki.page/en/eigenspace/",
  "translations": {
    "zh-Hans": {
      "url": "https://aiwiki.page/zh/eigenspace/",
      "json": "https://aiwiki.page/zh/eigenspace.json"
    }
  },
  "sections": [
    {
      "heading": "",
      "text": "An eigenspace is a linear subspace on which a linear operator acts as multiplication by a single scalar. It contains all eigenvectors associated with a specified eigenvalue, together with the zero vector. In linear algebra, eigenspaces describe directions and higher-dimensional collections of vectors that undergo the same scalar action, providing the underlying structure for diagonalization and spectral decomposition. (math.brown.edu)"
    },
    {
      "heading": "Definition and basic properties",
      "text": "Let \\(T:V\\to V\\) be a linear map on a vector space over a field \\(F\\). For a scalar \\(\\lambda\\in F\\), define\n\n\\[E_\\lambda(T)=\\{v\\in V:T(v)=\\lambda v\\} =\\ker(T-\\lambda I),\\]\n\nwhere \\(I\\) denotes the identity operator and \\(\\ker\\) denotes the kernel. The scalar \\(\\lambda\\) is an eigenvalue precisely when this subspace contains a nonzero vector. The zero vector belongs to every kernel but is not an eigenvector. (math.brown.edu)\n\nThe subspace property follows directly from linearity. If \\(u,v\\in E_\\lambda(T)\\) and \\(a,b\\in F\\), then\n\n\\[T(au+bv)=a\\lambda u+b\\lambda v =\\lambda(au+bv).\\]\n\nThus every linear combination remains in the same eigenspace. When \\(\\lambda=0\\) is an eigenvalue, its eigenspace is simply \\(\\ker T\\): the vectors that the operator sends to zero. (textbooks.math.gatech.edu)"
    },
    {
      "heading": "Computing an eigenspace",
      "text": "For an \\(n\\times n\\) matrix \\(A\\), the eigenspace is the null space of \\(A-\\lambda I\\), with \\(I\\) now the identity matrix. Computing it requires solving the homogeneous system of linear equations\n\n\\[(A-\\lambda I)x=0.\\]\n\nGaussian elimination identifies the free variables and expresses the solutions as the span of a basis. Finding one eigenvector is insufficient when the eigenspace has dimension greater than one. (math.mit.edu)\n\nThe rank–nullity theorem gives\n\n\\[\\dim E_\\lambda(A)=n-\\operatorname{rank}(A-\\lambda I),\\]\n\nconnecting its dimension to the rank of the shifted matrix. (homepages.ucl.ac.uk)\n\nFor example, direct calculation for\n\n\\[A=\\begin{pmatrix}2&0&0\\\\0&2&0\\\\0&0&3\\end{pmatrix}\\]\n\ngives\n\n\\[E_2(A)=\\{(x,y,0):x,y\\in F\\},\\qquad E_3(A)=\\{(0,0,z):z\\in F\\}.\\]\n\nThe first is a coordinate plane; the second is a coordinate line. Every nonzero vector in the plane is an eigenvector for \\(2\\), not merely the two coordinate vectors chosen as a basis."
    },
    {
      "heading": "Multiplicity and diagonalization",
      "text": "The dimension of \\(E_\\lambda(A)\\) is the geometric multiplicity of \\(\\lambda\\). Its algebraic multiplicity is its multiplicity as a root of the characteristic polynomial\n\n\\[p_A(t)=\\det(tI-A),\\]\n\nwhere \\(\\det\\) is the determinant. For any eigenvalue of a finite-dimensional operator,\n\n\\[1\\leq\\dim E_\\lambda(A) \\leq\\text{algebraic multiplicity of }\\lambda.\\]\n\nRepeated roots therefore need not produce equally many independent eigenvectors. (textbooks.math.gatech.edu)\n\nEigenvectors belonging to distinct eigenvalues are linearly independent. More generally, the sum of the distinct eigenspaces is a direct sum. Diagonalization is possible over \\(F\\) exactly when these eigenspaces together span the whole space:\n\n\\[V=E_{\\lambda_1}(T)\\oplus\\cdots\\oplus E_{\\lambda_r}(T).\\]\n\nEquivalently, the characteristic polynomial must split into linear factors over \\(F\\), and geometric and algebraic multiplicities must agree for every eigenvalue. A repeated eigenvalue does not, by itself, prevent diagonalization. (textbooks.math.gatech.edu)"
    },
    {
      "heading": "Dependence on the scalar field",
      "text": "The choice of field matters. A matrix with real entries can have no eigenvalues over the real numbers while possessing eigenvalues and eigenspaces over the complex numbers. For example,\n\n\\[R=\\begin{pmatrix}0&-1\\\\1&0\\end{pmatrix}\\]\n\nrepresents a quarter-turn rotation. It has no nonzero real eigenvectors, but over \\(\\mathbb C\\) its eigenvalues are \\(i\\) and \\(-i\\), with eigenspaces\n\n\\[E_i(R)=\\operatorname{span}_{\\mathbb C}\\{(1,-i)\\},\\qquad E_{-i}(R)=\\operatorname{span}_{\\mathbb C}\\{(1,i)\\}.\\]\n\nFor real matrices, nonreal eigenvalues and their eigenvectors occur in complex-conjugate pairs. (textbooks.math.gatech.edu)"
    },
    {
      "heading": "Coordinate independence",
      "text": "Although matrix coordinates change with the basis, the eigenspace of an operator is intrinsically defined. If\n\n\\[B=P^{-1}AP\\]\n\nfor an invertible matrix \\(P\\), then\n\n\\[E_\\lambda(B)=P^{-1}E_\\lambda(A).\\]\n\nIndeed, \\(Bx=\\lambda x\\) is equivalent to \\(A(Px)=\\lambda(Px)\\). Thus similar matrices represent the same operator in different coordinate systems, and corresponding eigenspaces have equal dimensions. (textbooks.math.gatech.edu)"
    },
    {
      "heading": "Orthogonality and spectral decomposition",
      "text": "For a self-adjoint operator on a finite-dimensional inner product space, distinct eigenspaces are mutually orthogonal. The spectral theorem guarantees an orthonormal basis of eigenvectors. This applies to real symmetric matrices and complex Hermitian matrices; complex symmetry alone is insufficient. (math.brown.edu)\n\nWriting \\(P_\\lambda\\) for the orthogonal projection onto \\(E_\\lambda(T)\\), the operator has the decomposition\n\n\\[T=\\sum_\\lambda\\lambda P_\\lambda,\\qquad I=\\sum_\\lambda P_\\lambda.\\]\n\nWithin a multidimensional eigenspace, the orthonormal basis is not unique, but the eigenspace and its orthogonal projection are fixed. (math.brown.edu)"
    },
    {
      "heading": "Generalized eigenspaces",
      "text": "Ordinary eigenspaces may not span the space. For an operator on an \\(n\\)-dimensional space, the generalized eigenspace associated with \\(\\lambda\\) is\n\n\\[G_\\lambda(T)=\\ker(T-\\lambda I)^n.\\]\n\nIt contains vectors annihilated by some positive power of \\(T-\\lambda I\\), rather than necessarily by its first power. When the characteristic polynomial splits, generalized eigenspaces form a direct-sum decomposition of \\(V\\), and their dimensions equal the respective algebraic multiplicities. (math.brown.edu)\n\nFor example, direct calculation for\n\n\\[J=\\begin{pmatrix}2&1\\\\0&2\\end{pmatrix}\\]\n\nshows that \\(E_2(J)=\\operatorname{span}\\{(1,0)\\}\\), whereas \\((J-2I)^2=0\\), so \\(G_2(J)=F^2\\). The ordinary eigenspace is one-dimensional despite the eigenvalue’s algebraic multiplicity being two."
    }
  ],
  "links": [
    "linear-subspace",
    "eigenvalues-and-eigenvectors",
    "linear-algebra",
    "linear-map",
    "vector-space",
    "field-mathematics",
    "kernel-linear-map",
    "linear-combination",
    "matrix",
    "null-space",
    "identity-matrix",
    "system-of-linear-equations",
    "gaussian-elimination",
    "linear-span",
    "basis-linear-algebra",
    "rank-nullity-theorem",
    "dimension-vector-space",
    "matrix-rank",
    "characteristic-polynomial",
    "determinant",
    "linear-independence",
    "direct-sum",
    "matrix-diagonalization",
    "real-number",
    "complex-number",
    "matrix-similarity",
    "self-adjoint-operator",
    "inner-product",
    "spectral-theorem",
    "orthonormal-basis",
    "orthogonal-projection"
  ],
  "sources": [
    {
      "title": "math.brown.edu/streil/papers/LADW/HTML_2026_08-31/Ch4.html",
      "url": "https://www.math.brown.edu/streil/papers/LADW/HTML_2026_08-31/Ch4.html"
    },
    {
      "title": "textbooks.math.gatech.edu/ila/1553/eigenvectors.html",
      "url": "https://www.textbooks.math.gatech.edu/ila/1553/eigenvectors.html"
    },
    {
      "title": "math.mit.edu/~poonen/03/notes.pdf",
      "url": "https://math.mit.edu/~poonen/03/notes.pdf"
    },
    {
      "title": "homepages.ucl.ac.uk/~ucahmto/0005_2021/Ch4.S16.html",
      "url": "https://www.homepages.ucl.ac.uk/~ucahmto/0005_2021/Ch4.S16.html"
    },
    {
      "title": "textbooks.math.gatech.edu/ila/diagonalization.html",
      "url": "https://textbooks.math.gatech.edu/ila/diagonalization.html"
    },
    {
      "title": "textbooks.math.gatech.edu/ila/complex-eigenvalues.html",
      "url": "https://textbooks.math.gatech.edu/ila/complex-eigenvalues.html"
    },
    {
      "title": "textbooks.math.gatech.edu/ila/similarity.html",
      "url": "https://textbooks.math.gatech.edu/ila/similarity.html"
    },
    {
      "title": "math.brown.edu/streil/papers/LADW/HTML_2026_08-31/Ch6.html",
      "url": "https://www.math.brown.edu/streil/papers/LADW/HTML_2026_08-31/Ch6.html"
    },
    {
      "title": "math.brown.edu/streil/papers/LADW/HTML_2026_08-31/Ch9.html",
      "url": "https://www.math.brown.edu/streil/papers/LADW/HTML_2026_08-31/Ch9.html"
    }
  ],
  "license": "https://creativecommons.org/licenses/by/4.0/"
}