Math 2.0

Linear and multilinear algebra; matrix theory Proof

Proof that a matrix is invertible iff its determinant is a unit

Builds on Determinant of the inverseInverse in terms of the adjugateInvertible matrixDeterminant is multilinear in the rowsDeterminant of the identity matrixUnit of a ring

Proof

  1. Suppose AA is invertible. By the result on the determinant of the inverse, det⁡A\det A is a unit of KK.
  2. Conversely, suppose det⁡A\det A is a unit of KK. If n≥2n \ge 2, the adjugate formula for the inverse shows that AA is invertible.
  3. Let n=1n = 1 and A=(a)A = (a). Then AA is aa times the 1×11 \times 1 identity matrix I1=(1)I_1 = (1).
  4. By multilinearity in the only row and the determinant of the identity, det⁡A=adet⁡I1=a\det A = a \det I_1 = a.
  5. So aa is a unit. The matrix (a−1)(a^{-1}) satisfies (a)(a−1)=(a−1)(a)=(1)=I1(a)(a^{-1}) = (a^{-1})(a) = (1) = I_1, so AA is invertible.
  6. By steps 1 to 5, AA is invertible if and only if det⁡A\det A is a unit.
  7. Let KK be a field. By the definition of a field, every nonzero element has a multiplicative inverse, and 00 has none since 0⋅x=0≠10 \cdot x = 0 \ne 1.
  8. So the units of a field are its nonzero elements. Hence over a field, AA is invertible if and only if det⁡A≠0\det A \ne 0.

Idea

One direction uses the product rule: an inverse matrix forces det⁡A⋅det⁡(A−1)=1\det A \cdot \det(A^{-1}) = 1. For the other direction, the adjugate gives an explicit inverse, namely the adjugate divided by det⁡A\det A, and this division needs det⁡A\det A to be a unit.

Reading path

To understand this page from the ground up, read these 127 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 the determinant is multiplicative by expanding the rows, 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 of the inverse in terms of the adjugate, Proof that an intersection of subgroups is a subgroup, Proof that the sign is a homomorphism, Proof of the determinant of the inverse, Proof that the determinant of the identity matrix is one, Proof of the decomposition of a permutation into disjoint cycles, Proof of the product of a matrix and its adjugate by Laplace expansion, 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. Ring definition
  22. Subgroup definition
  23. Symmetric group definition
  24. Matrix multiplication definition
  25. Square matrix definition
  26. Transpose definition
  27. Successor function definition
  28. Conjunction definition
  29. Disjunction definition
  30. Implication definition
  31. Predicate definition
  32. Linear map definition
  33. Inverse element definition
  34. Empty set object
  35. Family of sets definition
  36. Ordered pair definition
  37. Transposition definition
  38. Unit of a ring definition
  39. Proof that an intersection of subgroups is a subgroup proof
  40. Intersection definition
  41. Union definition
  42. Invertible matrix definition
  43. Addition of natural numbers definition
  44. Set-builder notation concept
  45. The successor function is injective statement
  46. Zero is not a successor statement
  47. Biconditional definition
  48. Existential quantifier definition
  49. Universal quantifier definition
  50. Multilinear map definition
  51. Proof of the uniqueness of inverses proof
  52. Cartesian product definition
  53. Disjoint sets definition
  54. Subset definition
  55. Union of a family of sets definition
  56. Proof of the commutativity of addition by induction proof
  57. Axiom of extensionality statement
  58. Order on the natural numbers definition
  59. Uniqueness quantifier definition
  60. Alternating multilinear map definition
  61. Uniqueness of inverses statement
  62. Binary relation definition
  63. Partition of a set definition
  64. Commutativity of addition statement
  65. Determinant definition
  66. Proof of strong induction from ordinary induction proof
  67. Reflexive relation definition
  68. Symmetric relation definition
  69. Transitive relation definition
  70. Proof of the laws of exponents in a group proof
  71. Proof of the subgroup criterion proof
  72. Proof that a matrix with two equal rows has determinant zero proof
  73. Function definition
  74. Proof that the determinant of the identity matrix is one proof
  75. Minor definition
  76. Strong induction statement
  77. Proof that the determinant is multilinear in the rows proof
  78. Equivalence relation definition
  79. Laws of exponents in a group statement
  80. Subgroup criterion statement
  81. Determinant of a matrix with two equal rows statement
  82. Determinant of the identity matrix statement
  83. Injective function definition
  84. Determinant is multilinear in the rows statement
  85. Proof of the well-ordering principle from strong induction proof
  86. Cofactor definition
  87. Proof that disjoint cycles commute proof
  88. Intersection of subgroups is a subgroup statement
  89. Equivalence class definition
  90. Well-ordering principle statement
  91. Adjugate matrix definition
  92. Disjoint cycles commute statement
  93. Proof that equivalence classes form a partition proof
  94. Subgroup generated by a subset definition
  95. Proof of the division algorithm proof
  96. Equivalence classes form a partition statement
  97. Division algorithm statement
  98. Proof of the decomposition of a permutation into disjoint cycles proof
  99. Decomposition of a permutation into disjoint cycles statement
  100. Proof of the decomposition of a permutation into transpositions proof
  101. Decomposition of a permutation into transpositions statement
  102. Sign of a permutation definition
  103. Proof that the symmetric group is generated by transpositions proof
  104. The symmetric group is generated by transpositions statement
  105. Proof that the sign is a homomorphism proof
  106. Proof of the sign of a cycle proof
  107. Sign of a cycle statement
  108. Sign is a homomorphism statement
  109. Proof that permuting rows multiplies the determinant by the sign proof
  110. Permuting rows multiplies the determinant by the sign statement
  111. Proof of the Leibniz formula from the defining properties of the determinant proof
  112. Leibniz formula for determinants statement
  113. Proof of the Laplace expansion along a row by the Leibniz formula proof
  114. Proof that the determinant is multiplicative by expanding the rows proof
  115. Proof that the determinant of a transpose equals the determinant proof
  116. Determinant is multiplicative statement
  117. Laplace expansion along a row statement
  118. Determinant of a transpose statement
  119. Proof of the determinant of the inverse proof
  120. Proof of the Laplace expansion along a column by transposition proof
  121. Determinant of the inverse statement
  122. Laplace expansion along a column statement
  123. Proof of the product of a matrix and its adjugate by Laplace expansion proof
  124. Product of a matrix and its adjugate statement
  125. Proof of the inverse in terms of the adjugate proof
  126. Inverse in terms of the adjugate statement
  127. Proof that a matrix is invertible iff its determinant is a unit proof

Where this leads

152 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Determinant, Invertibility
About this page
Tag91NHW201A1
URIm2://91NHW201A1
Kindproof
WritingW0 stub
MSC15A15
ProvesA matrix is invertible iff its determinant is a unit
UsesDeterminant of the inverse, Inverse in terms of the adjugate, Invertible matrix, Determinant is multilinear in the rows, Determinant of the identity matrix, Unit of a ring
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.