{
  "id": "adjugate-matrix",
  "title": "Adjugate Matrix",
  "lang": "en",
  "source_lang": "en",
  "summary": "The adjugate of a square matrix is the transpose of its cofactor matrix, relating determinants, matrix inverses, and solutions of linear systems.",
  "category": "mathematics",
  "subcategory": "algebra",
  "type": "concept",
  "aliases": [
    "Classical adjoint",
    "Adjoint matrix"
  ],
  "generated_at": "2026-11-04",
  "model": "pro/gpt-6.1-sol",
  "url": "https://aiwiki.page/en/adjugate-matrix/",
  "translations": {
    "zh-Hans": {
      "url": "https://aiwiki.page/zh/adjugate-matrix/",
      "json": "https://aiwiki.page/zh/adjugate-matrix.json"
    }
  },
  "sections": [
    {
      "heading": "",
      "text": "The adjugate matrix of a square matrix is the transpose of its cofactor matrix. Denoted by \\(\\operatorname{adj}(A)\\), it satisfies\n\n\\[A\\operatorname{adj}(A)=\\operatorname{adj}(A)A=\\det(A)I,\\]\n\nwhere \\(\\det(A)\\) is the determinant of \\(A\\) and \\(I\\) is the identity matrix. This identity gives a formula for the inverse of an invertible matrix, but the adjugate itself is defined even when the matrix is singular. It is a standard construction in linear algebra, particularly in determinant identities, symbolic computation, and the study of singular matrices."
    },
    {
      "heading": "Definition and terminology",
      "text": "Let \\(A=(a_{ij})\\) be an \\(n\\times n\\) matrix. Delete row \\(i\\) and column \\(j\\) to obtain the \\((n-1)\\times(n-1)\\) matrix \\(A_{\\widehat{i},\\widehat{j}}\\). Its determinant is a minor of \\(A\\). The corresponding cofactor is\n\n\\[C_{ij}=(-1)^{i+j}\\det\\!\\left(A_{\\widehat{i},\\widehat{j}}\\right).\\]\n\nThe adjugate is the transpose of the matrix of cofactors:\n\n\\[\\operatorname{adj}(A)=(C_{ij})^{\\mathsf T}, \\qquad \\bigl(\\operatorname{adj}(A)\\bigr)_{ij}=C_{ji}.\\]\n\nThe transposition is essential: the \\((i,j)\\) entry of the adjugate is the cofactor associated with the \\((j,i)\\) entry of the original matrix.\n\nEach entry of \\(\\operatorname{adj}(A)\\) is a polynomial of degree \\(n-1\\) in the entries of \\(A\\). Thus, its definition involves no division. It applies to matrices over a field, such as the real or complex numbers, and more generally over any commutative ring with identity.\n\nFor a \\(1\\times1\\) matrix \\(A=[a]\\), the convention that the determinant of the empty \\(0\\times0\\) matrix is \\(1\\) gives\n\n\\[\\operatorname{adj}([a])=[1],\\]\n\nincluding when \\(a=0\\).\n\nThe older term classical adjoint is common in textbooks. It should not be confused with the conjugate transpose, also called the adjoint in complex inner-product spaces. These are different operations."
    },
    {
      "heading": "Examples",
      "text": "For a \\(2\\times2\\) matrix,\n\n\\[A= \\begin{pmatrix} a&b\\\\ c&d \\end{pmatrix}, \\qquad \\operatorname{adj}(A)= \\begin{pmatrix} d&-b\\\\ -c&a \\end{pmatrix}.\\]\n\nConsequently,\n\n\\[A\\operatorname{adj}(A) = \\begin{pmatrix} ad-bc&0\\\\ 0&ad-bc \\end{pmatrix}.\\]\n\nFor example,\n\n\\[A= \\begin{pmatrix} 1&2\\\\ 3&4 \\end{pmatrix} \\quad\\Longrightarrow\\quad \\operatorname{adj}(A)= \\begin{pmatrix} 4&-2\\\\ -3&1 \\end{pmatrix}.\\]\n\nSince \\(\\det(A)=-2\\), their product is \\(-2I\\).\n\nFor a general \\(3\\times3\\) matrix,\n\n\\[A= \\begin{pmatrix} a&b&c\\\\ d&e&f\\\\ g&h&i \\end{pmatrix},\\]\n\nthe adjugate is\n\n\\[\\operatorname{adj}(A)= \\begin{pmatrix} ei-fh&ch-bi&bf-ce\\\\ fg-di&ai-cg&cd-af\\\\ dh-eg&bg-ah&ae-bd \\end{pmatrix}.\\]"
    },
    {
      "heading": "Fundamental identity and inverse formula",
      "text": "The defining identity is\n\n\\[A\\operatorname{adj}(A) = \\operatorname{adj}(A)A = \\det(A)I.\\]\n\nTo see why, consider the \\((i,j)\\) entry of the first product:\n\n\\[\\bigl(A\\operatorname{adj}(A)\\bigr)_{ij} = \\sum_{k=1}^{n}a_{ik}C_{jk}.\\]\n\nWhen \\(i=j\\), this is the cofactor expansion of \\(\\det(A)\\) along row \\(i\\). When \\(i\\ne j\\), it is the determinant of a matrix in which row \\(j\\) has been replaced by row \\(i\\). That matrix has two identical rows, so its determinant is zero. Expansion by columns proves the identity with the factors reversed.\n\nOver a field, if \\(\\det(A)\\ne0\\), division gives the inverse matrix:\n\n\\[A^{-1}=\\frac{\\operatorname{adj}(A)}{\\det(A)}.\\]\n\nEquivalently,\n\n\\[\\operatorname{adj}(A)=\\det(A)A^{-1}.\\]\n\nOver a general commutative ring, the corresponding criterion is that \\(\\det(A)\\) must be a unit, meaning that it has a multiplicative inverse in the ring. A nonzero determinant alone need not suffice. For example, \\([2]\\) has no inverse over the integers, although it is invertible over the rational numbers."
    },
    {
      "heading": "Singular matrices and rank",
      "text": "Unlike the inverse, the adjugate remains defined at singular matrices. For \\(n\\ge2\\), its rank is determined by the rank of \\(A\\):\n\n\\[\\operatorname{rank}(\\operatorname{adj}(A))= \\begin{cases} n,&\\operatorname{rank}(A)=n,\\\\ 1,&\\operatorname{rank}(A)=n-1,\\\\ 0,&\\operatorname{rank}(A)\\le n-2. \\end{cases}\\]\n\nIf \\(\\operatorname{rank}(A)\\le n-2\\), all \\((n-1)\\times(n-1)\\) minors vanish, so every adjugate entry is zero.\n\nIf \\(\\operatorname{rank}(A)=n-1\\), at least one such minor is nonzero, hence \\(\\operatorname{adj}(A)\\ne0\\). Meanwhile,\n\n\\[A\\operatorname{adj}(A)=0.\\]\n\nEvery column of the adjugate therefore lies in the one-dimensional null space of \\(A\\), giving the adjugate rank one.\n\nMore precisely, if nonzero vectors \\(u\\) and \\(v\\) satisfy\n\n\\[Au=0,\\qquad v^{\\mathsf T}A=0,\\]\n\nthen\n\n\\[\\operatorname{adj}(A)=\\gamma uv^{\\mathsf T}\\]\n\nfor some nonzero scalar \\(\\gamma\\). Thus, the columns encode right null vectors, while the rows encode left null vectors.\n\nFor example,\n\n\\[A= \\begin{pmatrix} 1&2\\\\ 2&4 \\end{pmatrix}, \\qquad \\operatorname{adj}(A)= \\begin{pmatrix} 4&-2\\\\ -2&1 \\end{pmatrix}.\\]\n\nBoth matrices have rank one, and their product is zero."
    },
    {
      "heading": "Algebraic identities",
      "text": "For square matrices \\(A,B\\) of the same size over a commutative ring,\n\n\\[\\operatorname{adj}(AB) = \\operatorname{adj}(B)\\operatorname{adj}(A).\\]\n\nThe order of the factors is reversed, as in the inverse-of-a-product formula. This identity also holds when either matrix is singular.\n\nOther useful identities include\n\n\\[\\operatorname{adj}(A^{\\mathsf T}) = \\operatorname{adj}(A)^{\\mathsf T},\\]\n\nand, for \\(n\\ge2\\) and any scalar \\(\\lambda\\),\n\n\\[\\operatorname{adj}(\\lambda A) = \\lambda^{n-1}\\operatorname{adj}(A).\\]\n\nFor \\(n\\ge2\\),\n\n\\[\\det(\\operatorname{adj}(A)) = \\det(A)^{n-1},\\]\n\nand\n\n\\[\\operatorname{adj}(\\operatorname{adj}(A)) = \\det(A)^{n-2}A.\\]\n\nWhen \\(n=2\\), the latter identity is simply\n\n\\[\\operatorname{adj}(\\operatorname{adj}(A))=A.\\]\n\nThe adjugate also respects matrix similarity. If \\(S\\) is invertible, then\n\n\\[\\operatorname{adj}(SAS^{-1}) = S\\operatorname{adj}(A)S^{-1}.\\]"
    },
    {
      "heading": "Linear systems and Cramer's rule",
      "text": "For a system of linear equations\n\n\\[Ax=b\\]\n\nwith \\(\\det(A)\\ne0\\), multiplication by the adjugate gives\n\n\\[x=\\frac{\\operatorname{adj}(A)b}{\\det(A)}.\\]\n\nThe componentwise form is Cramer's rule:\n\n\\[x_i=\\frac{\\det(A_i)}{\\det(A)},\\]\n\nwhere \\(A_i\\) is obtained by replacing column \\(i\\) of \\(A\\) with \\(b\\). Expanding \\(\\det(A_i)\\) along the replaced column yields exactly the \\(i\\)-th component of \\(\\operatorname{adj}(A)b\\).\n\nIf \\(A\\) is singular, the same multiplication gives the necessary consistency condition\n\n\\[\\operatorname{adj}(A)b=0.\\]\n\nFor rank \\(n-1\\), this condition is also sufficient. For rank at most \\(n-2\\), the adjugate vanishes, so it provides no information about consistency."
    },
    {
      "heading": "Derivatives of the determinant",
      "text": "The adjugate describes how the determinant changes with individual matrix entries:\n\n\\[\\frac{\\partial\\det(A)}{\\partial a_{ij}} = C_{ij} = \\bigl(\\operatorname{adj}(A)\\bigr)_{ji}.\\]\n\nWith the entrywise gradient convention, this becomes\n\n\\[\\nabla_A\\det(A)=\\operatorname{adj}(A)^{\\mathsf T}.\\]\n\nFor a differentiable matrix-valued function \\(A(t)\\), Jacobi's formula states\n\n\\[\\frac{d}{dt}\\det(A(t)) = \\operatorname{tr}\\!\\left( \\operatorname{adj}(A(t))A'(t) \\right),\\]\n\nwhere \\(\\operatorname{tr}\\) denotes the matrix trace. This version remains valid at singular matrices. When \\(A(t)\\) is invertible, it can instead be written as\n\n\\[\\frac{d}{dt}\\det(A(t)) = \\det(A(t)) \\operatorname{tr}\\!\\left(A(t)^{-1}A'(t)\\right).\\]\n\nOver the real or complex numbers, the cofactor derivatives also characterize the singular points of the determinant-zero hypersurface: for \\(n\\ge2\\), all first derivatives vanish exactly at matrices of rank at most \\(n-2\\). This connects the adjugate with algebraic geometry."
    },
    {
      "heading": "Computation and numerical limitations",
      "text": "Computing every cofactor separately is straightforward for small matrices but becomes inefficient as dimension increases. Recursive determinant expansion is especially costly.\n\nIn numerical linear algebra, the adjugate formula is generally not the preferred method for solving systems or computing inverses. Factorization methods such as LU decomposition typically require less work and offer better control of rounding error. Separately computed cofactors and determinants can involve cancellation, overflow, or underflow, particularly near singularity.\n\nThese computational limitations do not diminish the adjugate's exact algebraic role. Its entries remain polynomial functions of the matrix entries, making it useful in symbolic calculations and in identities that must remain valid when an inverse does not exist."
    }
  ],
  "links": [
    "matrix",
    "determinant",
    "identity-matrix",
    "linear-algebra",
    "matrix-transpose",
    "polynomial",
    "field-mathematics",
    "ring-mathematics",
    "conjugate-transpose",
    "inverse-matrix",
    "matrix-rank",
    "null-space",
    "matrix-similarity",
    "system-of-linear-equations",
    "cramers-rule",
    "gradient",
    "matrix-trace",
    "algebraic-geometry",
    "numerical-linear-algebra",
    "lu-decomposition"
  ],
  "sources": [],
  "license": "https://creativecommons.org/licenses/by/4.0/"
}