Math 2.0

Linear and multilinear algebra; matrix theory Proof

Proof of the product of a matrix and its adjugate by Laplace expansion

Builds on Adjugate matrixCofactorMatrix multiplicationLaplace expansion along a rowLaplace expansion along a columnDeterminant of a matrix with two equal rowsDeterminant of a transposeIdentity matrix

Proof

We compute each entry of the two products by a Laplace expansion.

  1. Let A=(akl)A = (a_{kl}) be an n×nn \times n matrix over KK with n≥2n \ge 2, and let CklC_{kl} be its cofactors.
  2. By the definition of the adjugate, adj⁡(A)lk=Ckl\operatorname{adj}(A)_{lk} = C_{kl}.
  3. By the definition of the matrix product, (Aadj⁡(A))ik=∑j=1naijCkj(A \operatorname{adj}(A))_{ik} = \sum_{j=1}^{n} a_{ij} C_{kj} for all i,ki, k.
  4. If i=ki = k, the sum in step 3 is det⁡A\det A by the Laplace expansion along row ii.
  5. Let i≠ki \ne k. Let A′A' be the matrix that results when row kk of AA is replaced by row ii of AA.
  6. The cofactor Ckj′C'_{kj} of A′A' deletes row kk, the only row where A′A' and AA differ. So Ckj′=CkjC'_{kj} = C_{kj} for all jj.
  7. Row kk of A′A' has entries aija_{ij}. By the Laplace expansion of A′A' along row kk and step 6, det⁡A′=∑j=1naijCkj\det A' = \sum_{j=1}^{n} a_{ij} C_{kj}.
  8. Rows ii and kk of A′A' are equal. By the rule for two equal rows, det⁡A′=0\det A' = 0.
  9. By steps 3 to 8, (Aadj⁡(A))ik(A \operatorname{adj}(A))_{ik} is det⁡A\det A if i=ki = k and 00 if i≠ki \ne k. So Aadj⁡(A)=det⁡(A) InA \operatorname{adj}(A) = \det(A)\, I_n, with the identity matrix InI_n.
  10. In the same way, (adj⁡(A)A)ik=∑j=1nCjiajk(\operatorname{adj}(A) A)_{ik} = \sum_{j=1}^{n} C_{ji} a_{jk} for all i,ki, k.
  11. If i=ki = k, this sum is det⁡A\det A by the Laplace expansion along column ii.
  12. Let i≠ki \ne k. Let A′′A'' be the matrix that results when column ii of AA is replaced by column kk of AA.
  13. The cofactor Cji′′C''_{ji} of A′′A'' deletes column ii, the only column where A′′A'' and AA differ. So Cji′′=CjiC''_{ji} = C_{ji} for all jj.
  14. Column ii of A′′A'' has entries ajka_{jk}. By the Laplace expansion of A′′A'' along column ii, det⁡A′′=∑j=1najkCji\det A'' = \sum_{j=1}^{n} a_{jk} C_{ji}.
  15. Columns ii and kk of A′′A'' are equal, so the transpose of A′′A'' has two equal rows. By the rule for the determinant of a transpose and step 8's rule, det⁡A′′=0\det A'' = 0.
  16. By steps 10 to 15, adj⁡(A)A=det⁡(A) In\operatorname{adj}(A) A = \det(A)\, I_n. Together with step 9, Aadj⁡(A)=adj⁡(A)A=det⁡(A) InA \operatorname{adj}(A) = \operatorname{adj}(A) A = \det(A)\, I_n.

Idea

An entry of Aadj⁡(A)A \operatorname{adj}(A) pairs one row of AA with the cofactors of another row. For the same row this is the Laplace expansion of det⁡A\det A. For different rows it is the expansion of a matrix with two equal rows, which is 00.

Reading path

To understand this page from the ground up, read these 116 pages in order. The foundations come first. The path takes the proofs Proof of the decomposition of a permutation into transpositions, Proof that the symmetric group is generated by transpositions, Proof of the Laplace expansion along a column by transposition, Proof of the commutativity of addition by induction, Proof that equivalence classes form a partition, Proof that permuting rows multiplies the determinant by the sign, Proof that disjoint cycles commute, Proof that a matrix with two equal rows has determinant zero, Proof of the Laplace expansion along a row by the Leibniz formula, Proof of strong induction from ordinary induction, Proof that the determinant of a transpose equals the determinant, Proof of the laws of exponents in a group, Proof that an intersection of subgroups is a subgroup, Proof that the sign is a homomorphism, Proof that the determinant of the identity matrix is one, Proof of the decomposition of a permutation into disjoint cycles, Proof of the well-ordering principle from strong induction, Proof of the division algorithm, Proof of the sign of a cycle, Proof of the Leibniz formula from the defining properties of the determinant, Proof of the uniqueness of inverses, Proof that the determinant is multilinear in the rows, Proof of the subgroup criterion.

  1. Binary operation definition
  2. Cycle notation concept
  3. Definition by recursion concept
  4. Divisibility definition
  5. Element definition
  6. Group concept
  7. Identity matrix object
  8. Mathematical induction concept
  9. Matrix definition
  10. Multilinear map concept
  11. Natural numbers object
  12. Peano axioms concept
  13. Permutation concept
  14. Permutation definition
  15. Proposition concept
  16. Transposition concept
  17. Vector space definition
  18. Identity element definition
  19. Set definition
  20. Group homomorphism definition
  21. Subgroup definition
  22. Symmetric group definition
  23. Matrix multiplication definition
  24. Square matrix definition
  25. Transpose definition
  26. Successor function definition
  27. Conjunction definition
  28. Disjunction definition
  29. Implication definition
  30. Predicate definition
  31. Linear map definition
  32. Inverse element definition
  33. Empty set object
  34. Family of sets definition
  35. Ordered pair definition
  36. Transposition definition
  37. Proof that an intersection of subgroups is a subgroup proof
  38. Intersection definition
  39. Union definition
  40. Set-builder notation concept
  41. Addition of natural numbers definition
  42. The successor function is injective statement
  43. Zero is not a successor statement
  44. Biconditional definition
  45. Existential quantifier definition
  46. Universal quantifier definition
  47. Multilinear map definition
  48. Proof of the uniqueness of inverses proof
  49. Cartesian product definition
  50. Disjoint sets definition
  51. Union of a family of sets definition
  52. Subset definition
  53. Axiom of extensionality statement
  54. Proof of the commutativity of addition by induction proof
  55. Order on the natural numbers definition
  56. Uniqueness quantifier definition
  57. Alternating multilinear map definition
  58. Uniqueness of inverses statement
  59. Binary relation definition
  60. Partition of a set definition
  61. Determinant definition
  62. Commutativity of addition statement
  63. Proof of strong induction from ordinary induction proof
  64. Reflexive relation definition
  65. Symmetric relation definition
  66. Transitive relation definition
  67. Proof of the laws of exponents in a group proof
  68. Proof of the subgroup criterion proof
  69. Proof that a matrix with two equal rows has determinant zero proof
  70. Function definition
  71. Proof that the determinant of the identity matrix is one proof
  72. Minor definition
  73. Proof that the determinant is multilinear in the rows proof
  74. Strong induction statement
  75. Equivalence relation definition
  76. Subgroup criterion statement
  77. Determinant of a matrix with two equal rows statement
  78. Laws of exponents in a group statement
  79. Determinant of the identity matrix statement
  80. Determinant is multilinear in the rows statement
  81. Injective function definition
  82. Proof of the well-ordering principle from strong induction proof
  83. Cofactor definition
  84. Intersection of subgroups is a subgroup statement
  85. Proof that disjoint cycles commute proof
  86. Equivalence class definition
  87. Well-ordering principle statement
  88. Adjugate matrix definition
  89. Subgroup generated by a subset definition
  90. Disjoint cycles commute statement
  91. Proof that equivalence classes form a partition proof
  92. Proof of the division algorithm proof
  93. Equivalence classes form a partition statement
  94. Division algorithm statement
  95. Proof of the decomposition of a permutation into disjoint cycles proof
  96. Decomposition of a permutation into disjoint cycles statement
  97. Proof of the decomposition of a permutation into transpositions proof
  98. Decomposition of a permutation into transpositions statement
  99. Sign of a permutation definition
  100. Proof that the symmetric group is generated by transpositions proof
  101. The symmetric group is generated by transpositions statement
  102. Proof that the sign is a homomorphism proof
  103. Proof of the sign of a cycle proof
  104. Sign of a cycle statement
  105. Sign is a homomorphism statement
  106. Proof that permuting rows multiplies the determinant by the sign proof
  107. Permuting rows multiplies the determinant by the sign statement
  108. Proof of the Leibniz formula from the defining properties of the determinant proof
  109. Leibniz formula for determinants statement
  110. Proof of the Laplace expansion along a row by the Leibniz formula proof
  111. Proof that the determinant of a transpose equals the determinant proof
  112. Determinant of a transpose statement
  113. Laplace expansion along a row statement
  114. Proof of the Laplace expansion along a column by transposition proof
  115. Laplace expansion along a column statement
  116. Proof of the product of a matrix and its adjugate by Laplace expansion proof

Where this leads

184 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Adjugate_matrix, Important consequence
About this page
TagQ47MWN8W57
URIm2://Q47MWN8W57
Kindproof
WritingW0 stub
MSC15A09, 15A15
ProvesProduct of a matrix and its adjugate
UsesAdjugate matrix, Cofactor, Matrix multiplication, Laplace expansion along a row, Laplace expansion along a column, Determinant of a matrix with two equal rows, Determinant of a transpose, Identity matrix
Changed4 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)

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

What links here

No page links to this page yet.