{
  "id": "cayley-hamilton-theorem",
  "title": "Cayley–Hamilton Theorem",
  "lang": "en",
  "source_lang": "en",
  "summary": "The Cayley–Hamilton theorem states that every square matrix satisfies its own characteristic polynomial, linking determinants, matrix powers, and the algebraic structure of linear operators.",
  "category": "mathematics",
  "subcategory": "algebra",
  "type": "concept",
  "aliases": [
    "Cayley–Hamilton identity",
    "characteristic equation theorem"
  ],
  "generated_at": "2026-11-04",
  "model": "pro/gpt-6.1-sol",
  "url": "https://aiwiki.page/en/cayley-hamilton-theorem/",
  "translations": {
    "zh-Hans": {
      "url": "https://aiwiki.page/zh/cayley-hamilton-theorem/",
      "json": "https://aiwiki.page/zh/cayley-hamilton-theorem.json"
    }
  },
  "sections": [
    {
      "heading": "",
      "text": "The Cayley–Hamilton theorem is a fundamental result in linear algebra stating that every square matrix satisfies its own characteristic polynomial. If \\(A\\) is an \\(n\\times n\\) matrix and\n\n\\[p_A(t)=\\det(tI-A)=t^n+c_{n-1}t^{n-1}+\\cdots+c_1t+c_0,\\]\n\nthen\n\n\\[p_A(A)=A^n+c_{n-1}A^{n-1}+\\cdots+c_1A+c_0I=0.\\]\n\nHere \\(I\\) denotes the identity matrix, and the right-hand side is the zero matrix. The theorem expresses every sufficiently high power of \\(A\\) as a linear combination of lower powers, making it central to the study of linear operators, polynomial identities, and matrix functions."
    },
    {
      "heading": "Statement and interpretation",
      "text": "The theorem holds for square matrices over any field, including the real numbers, complex numbers, and finite fields. More generally, it holds for matrices over any commutative ring with identity.\n\nFor a scalar polynomial\n\n\\[f(t)=a_0+a_1t+\\cdots+a_mt^m,\\]\n\nevaluation at a matrix means\n\n\\[f(A)=a_0I+a_1A+\\cdots+a_mA^m.\\]\n\nThe constant term must therefore be interpreted as a scalar multiple of \\(I\\), not as a scalar added directly to a matrix.\n\nThe characteristic polynomial is defined using the determinant. Its leading coefficient is \\(1\\), while\n\n\\[c_{n-1}=-\\operatorname{tr}(A), \\qquad c_0=(-1)^n\\det(A),\\]\n\nwhere \\(\\operatorname{tr}(A)\\) is the trace.\n\nThere is also a basis-independent formulation. If \\(T:V\\to V\\) is a linear map on a finite-dimensional vector space, then\n\n\\[p_T(T)=0.\\]\n\nThe polynomial \\(p_T\\) is computed from the matrix of \\(T\\) in any basis. It is independent of that choice because similar matrices have the same characteristic polynomial."
    },
    {
      "heading": "Examples",
      "text": "A two-dimensional identity\n\nFor\n\n\\[A=\\begin{pmatrix}a&b\\\\c&d\\end{pmatrix},\\]\n\nthe characteristic polynomial is\n\n\\[p_A(t)=t^2-(a+d)t+(ad-bc).\\]\n\nThe theorem gives\n\n\\[A^2-(a+d)A+(ad-bc)I=0,\\]\n\nor equivalently,\n\n\\[A^2-\\operatorname{tr}(A)A+\\det(A)I=0.\\]\n\nFor example, let\n\n\\[A=\\begin{pmatrix}1&2\\\\3&4\\end{pmatrix}.\\]\n\nSince \\(\\operatorname{tr}(A)=5\\) and \\(\\det(A)=-2\\),\n\n\\[p_A(t)=t^2-5t-2.\\]\n\nDirect calculation gives\n\n\\[A^2=\\begin{pmatrix}7&10\\\\15&22\\end{pmatrix}=5A+2I.\\]\n\nThus \\(p_A(A)=0\\).\n\nMultiplying this identity by further powers of \\(A\\) produces\n\n\\[A^{k+2}=5A^{k+1}+2A^k \\qquad(k\\geq 0).\\]\n\nEvery matrix entry in the sequence \\(I,A,A^2,\\ldots\\) consequently satisfies the same scalar recurrence relation.\n\nA matrix with repeated eigenvalues\n\nConsider\n\n\\[N=\\begin{pmatrix}0&1\\\\0&0\\end{pmatrix}.\\]\n\nIts characteristic polynomial is \\(t^2\\), and the theorem gives \\(N^2=0\\), even though \\(N\\neq0\\).\n\nThis example illustrates why the theorem is not merely a statement about eigenvalues. A polynomial that vanishes at every eigenvalue need not vanish at the matrix: the polynomial \\(t\\) vanishes at the only eigenvalue of \\(N\\), but \\(N\\) itself is nonzero."
    },
    {
      "heading": "Proof using the adjugate identity",
      "text": "A standard proof uses the adjugate matrix, the transpose of the matrix of cofactors. This proof works over any commutative ring with identity and does not require eigenvalues or division.\n\nFor an \\(n\\times n\\) matrix \\(A\\), write\n\n\\[\\operatorname{adj}(tI-A) = B_0+B_1t+\\cdots+B_{n-1}t^{n-1},\\]\n\nwhere each \\(B_j\\) is a matrix over the coefficient ring. The adjugate identity gives\n\n\\[(tI-A)\\operatorname{adj}(tI-A)=p_A(t)I.\\]\n\nComparing coefficients of powers of \\(t\\) yields\n\n\\[B_{n-1}=I,\\]\n\n\\[B_{k-1}-AB_k=c_kI \\qquad(1\\leq k\\leq n-1),\\]\n\nand\n\n\\[-AB_0=c_0I.\\]\n\nMultiply the equation indexed by \\(k\\) on the left by \\(A^k\\), and multiply \\(B_{n-1}=I\\) on the left by \\(A^n\\). Adding all these equations, including the constant-term equation, gives\n\n\\[\\begin{aligned} p_A(A) &=A^nB_{n-1} +\\sum_{k=1}^{n-1} \\left(A^kB_{k-1}-A^{k+1}B_k\\right) -AB_0\\\\ &=0. \\end{aligned}\\]\n\nEvery term cancels with an adjacent term.\n\nA tempting shortcut is to “put \\(t=A\\)” directly into \\(\\det(tI-A)\\). Without a carefully defined evaluation procedure, that argument confuses scalar polynomial evaluation with a determinant expression involving matrix-valued substitutions. The coefficient proof avoids this problem."
    },
    {
      "heading": "Relationship to the minimal polynomial",
      "text": "Over a field \\(F\\), the minimal polynomial \\(m_A(t)\\) is the unique monic polynomial of least positive degree satisfying\n\n\\[m_A(A)=0.\\]\n\nEvery polynomial that annihilates \\(A\\) is divisible by \\(m_A\\). Indeed, polynomial division gives\n\n\\[f(t)=q(t)m_A(t)+r(t), \\qquad \\deg r<\\deg m_A.\\]\n\nIf \\(f(A)=0\\), then \\(r(A)=0\\); the minimality of \\(m_A\\) forces \\(r=0\\).\n\nThe Cayley–Hamilton theorem therefore implies\n\n\\[m_A(t)\\mid p_A(t), \\qquad \\deg m_A\\leq n.\\]\n\nThe characteristic polynomial need not be the annihilating polynomial of smallest degree. For example, for the \\(n\\times n\\) identity matrix,\n\n\\[p_I(t)=(t-1)^n, \\qquad m_I(t)=t-1.\\]\n\nThe minimal polynomial also characterizes diagonalizability: a matrix is diagonalizable over \\(F\\) precisely when its minimal polynomial splits over \\(F\\) into distinct linear factors. This condition is stronger than the Cayley–Hamilton identity, which holds whether or not the matrix is diagonalizable."
    },
    {
      "heading": "Consequences and applications",
      "text": "Reduction of powers and polynomials\n\nRearranging the characteristic identity gives\n\n\\[A^n=-c_{n-1}A^{n-1}-\\cdots-c_1A-c_0I.\\]\n\nRepeated use of this relation reduces every nonnegative power of \\(A\\) to a linear combination of\n\n\\[I,A,\\ldots,A^{n-1}.\\]\n\nMore generally, if polynomial division gives\n\n\\[f(t)=q(t)p_A(t)+r(t), \\qquad \\deg r<n,\\]\n\nthen\n\n\\[f(A)=r(A).\\]\n\nUsing the minimal polynomial instead can reduce the required degree further.\n\nThe algebra\n\n\\[F[A]=\\{f(A):f\\in F[t]\\}\\]\n\nis consequently spanned by \\(I,A,\\ldots,A^{n-1}\\). Its dimension is exactly \\(\\deg m_A\\), because the powers below that degree are linearly independent.\n\nInverses\n\nIf \\(A\\) is invertible, then \\(c_0\\neq0\\) over a field. Multiplication of the characteristic identity by \\(A^{-1}\\) gives\n\n\\[A^{-1} = -\\frac{1}{c_0} \\left( A^{n-1}+c_{n-1}A^{n-2}+\\cdots+c_2A+c_1I \\right).\\]\n\nThus the inverse is a polynomial in \\(A\\).\n\nFor a \\(2\\times2\\) invertible matrix, this becomes\n\n\\[A^{-1} = \\frac{\\operatorname{tr}(A)I-A}{\\det(A)}.\\]\n\nOver a commutative ring, the same formula applies when \\(c_0\\) is a unit. Merely being nonzero is insufficient there.\n\nMatrix functions and differential equations\n\nFor real or complex matrices, the matrix exponential is defined by the convergent power series\n\n\\[e^{tA}=\\sum_{k=0}^{\\infty}\\frac{t^kA^k}{k!}.\\]\n\nBecause all powers of \\(A\\) lie in a finite-dimensional span, this exponential can be represented as\n\n\\[e^{tA}=a_0(t)I+a_1(t)A+\\cdots+a_{d-1}(t)A^{d-1},\\]\n\nwhere \\(d=\\deg m_A\\).\n\nThis representation is useful in solving constant-coefficient ordinary differential equations of the form\n\n\\[x'(t)=Ax(t), \\qquad x(t)=e^{tA}x(0).\\]\n\nThe scalar coefficient functions encode the exponential and, where required by repeated factors of the minimal polynomial, polynomial dependence on time.\n\nLinear recurrences\n\nFor fixed vectors \\(u,v\\), define\n\n\\[s_k=u^{\\mathsf T}A^kv.\\]\n\nMultiplying the characteristic identity by \\(A^k\\), then by these vectors, yields\n\n\\[s_{k+n}+c_{n-1}s_{k+n-1}+\\cdots+c_0s_k=0.\\]\n\nThis connects matrix iteration with linear recurrences, including those arising from transition matrices and finite-state systems."
    },
    {
      "heading": "Historical development",
      "text": "The theorem is named after Arthur Cayley and William Rowan Hamilton. Hamilton obtained a related identity through his work on quaternions. Cayley stated the general matrix theorem in his 1858 memoir on matrix theory and verified low-dimensional cases, rather than supplying the general proof now customary in textbooks.\n\nIts development formed part of the nineteenth-century emergence of matrices as algebraic objects in their own right, rather than merely arrays of coefficients used to solve equations."
    },
    {
      "heading": "Scope and computational limitations",
      "text": "The finite-dimensional hypothesis is essential. An operator on an infinite-dimensional vector space need not satisfy any nonzero polynomial identity. For example, on the space of polynomials \\(F[x]\\), multiplication by \\(x\\) defines an operator \\(T\\) for which\n\n\\[q(T)1=q(x)\\neq0\\]\n\nfor every nonzero polynomial \\(q\\). Thus \\(T\\) has no nonzero annihilating polynomial.\n\nThe commutativity assumption on the coefficient ring is also important. For matrices with entries in a noncommutative ring, the ordinary determinant and characteristic polynomial do not generally retain the properties used in the proof.\n\nAlthough the theorem gives exact formulas for powers, inverses, and matrix functions, it does not by itself provide the best numerical algorithms. Computing characteristic coefficients and combining large matrix powers can introduce substantial rounding error and cancellation in floating-point arithmetic. Practical numerical linear algebra therefore generally uses methods tailored to the desired computation, such as matrix factorizations for solving linear systems and specialized algorithms for matrix exponentials."
    }
  ],
  "links": [
    "linear-algebra",
    "matrix",
    "characteristic-polynomial",
    "identity-matrix",
    "field-mathematics",
    "ring-mathematics",
    "polynomial",
    "determinant",
    "matrix-trace",
    "linear-map",
    "vector-space",
    "matrix-similarity",
    "recurrence-relation",
    "eigenvalues-and-eigenvectors",
    "adjugate-matrix",
    "minimal-polynomial",
    "matrix-diagonalization",
    "linear-combination",
    "dimension-vector-space",
    "inverse-matrix",
    "power-series",
    "ordinary-differential-equation",
    "transition-matrix",
    "quaternion",
    "floating-point-arithmetic",
    "numerical-linear-algebra"
  ],
  "sources": [],
  "license": "https://creativecommons.org/licenses/by/4.0/"
}