Math 2.0

Linear and multilinear algebra; matrix theory Proof

Proof that the minimal polynomial divides the characteristic polynomial

Builds on Minimal polynomialCharacteristic polynomialPolynomial of an endomorphismCayley–Hamilton theoremMinimal polynomial divides every annihilating polynomialDegree of a productR[x] is an integral domain iff R is

Proof

We combine the Cayley–Hamilton theorem with the divisibility property of the minimal polynomial.

  1. Let pAp_A be the characteristic polynomial of AA. It is monic of degree nn. Let mAm_A be the minimal polynomial of AA.
  2. Let L ⁣:Fn→FnL \colon F^n \to F^n be the endomorphism L(x)=AxL(x) = A x. For p∈F[x]p \in F[x], the value p(L)p(L) is the map x↦p(A)xx \mapsto p(A) x, because Lk(x)=AkxL^k(x) = A^k x for all kk.
  3. A matrix CC is zero if and only if Cx=0C x = 0 for all x∈Fnx \in F^n. So by step 2, p(L)=0p(L) = 0 if and only if p(A)=0p(A) = 0.
  4. By step 3, LL and AA have the same annihilating polynomials, so mA=mLm_A = m_L.
  5. By the Cayley–Hamilton theorem, pA(A)=0p_A(A) = 0. By step 3, pA(L)=0p_A(L) = 0.
  6. Since the minimal polynomial divides every annihilating polynomial, mLm_L divides pAp_A. By step 4, mAm_A divides pAp_A.
  7. Write pA=mAqp_A = m_A q with q∈F[x]q \in F[x]. Since pA≠0p_A \ne 0, also q≠0q \ne 0, so deg⁡q≥0\deg q \ge 0.
  8. The ring F[x]F[x] is an integral domain, since FF is a field. By the degree of a product, n=deg⁡pA=deg⁡mA+deg⁡q≥deg⁡mAn = \deg p_A = \deg m_A + \deg q \ge \deg m_A.
  9. So mAm_A divides pAp_A, and deg⁡mA≤n\deg m_A \le n.

Idea

The Cayley–Hamilton theorem says that pAp_A annihilates AA. Every annihilating polynomial is a multiple of the minimal polynomial. A nonzero multiple has at least the same degree, which gives deg⁡mA≤n\deg m_A \le n.

Reading path

To understand this page from the ground up, read these 140 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 R[x] is an integral domain iff R is, Proof that a matrix with two equal rows has determinant zero, Proof of the Laplace expansion along a row by the Leibniz formula, Proof that the minimal polynomial divides every annihilating polynomial, Proof of the degree of a product over an integral domain, 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 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, Proof of the Cayley–Hamilton theorem with the adjugate.

  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. Commutative ring definition
  38. Polynomial ring definition
  39. Transposition definition
  40. Zero divisor definition
  41. Proof that an intersection of subgroups is a subgroup proof
  42. Intersection definition
  43. Union definition
  44. Addition of natural numbers definition
  45. Set-builder notation concept
  46. The successor function is injective statement
  47. Zero is not a successor statement
  48. Biconditional definition
  49. Existential quantifier definition
  50. Universal quantifier definition
  51. Endomorphism definition
  52. Multilinear map definition
  53. Proof of the uniqueness of inverses proof
  54. Cartesian product definition
  55. Degree of a polynomial definition
  56. Disjoint sets definition
  57. Integral domain definition
  58. Subset definition
  59. Proof of the commutativity of addition by induction proof
  60. Axiom of extensionality statement
  61. Union of a family of sets definition
  62. Order on the natural numbers definition
  63. Uniqueness quantifier definition
  64. Polynomial of an endomorphism definition
  65. Alternating multilinear map definition
  66. Uniqueness of inverses statement
  67. Leading coefficient definition
  68. Binary relation definition
  69. Partition of a set definition
  70. Commutativity of addition statement
  71. Determinant definition
  72. Proof of strong induction from ordinary induction proof
  73. Annihilating polynomial definition
  74. Monic polynomial definition
  75. Reflexive relation definition
  76. Symmetric relation definition
  77. Transitive relation definition
  78. Proof of the laws of exponents in a group proof
  79. Proof of the degree of a product over an integral domain proof
  80. Proof of the subgroup criterion proof
  81. Proof that a matrix with two equal rows has determinant zero proof
  82. Proof that the determinant of the identity matrix is one proof
  83. Characteristic polynomial definition
  84. Function definition
  85. Minor definition
  86. Minimal polynomial definition
  87. Proof that the determinant is multilinear in the rows proof
  88. Strong induction statement
  89. Equivalence relation definition
  90. Division algorithm for polynomials statement
  91. Degree of a product statement
  92. Laws of exponents in a group statement
  93. Subgroup criterion statement
  94. Determinant of a matrix with two equal rows statement
  95. Determinant of the identity matrix statement
  96. Determinant is multilinear in the rows statement
  97. Proof of the well-ordering principle from strong induction proof
  98. Injective function definition
  99. Cofactor definition
  100. Proof that R[x] is an integral domain iff R is proof
  101. Proof that disjoint cycles commute proof
  102. Intersection of subgroups is a subgroup statement
  103. Equivalence class definition
  104. Proof that the minimal polynomial divides every annihilating polynomial proof
  105. Well-ordering principle statement
  106. Adjugate matrix definition
  107. Disjoint cycles commute statement
  108. R[x] is an integral domain iff R is statement
  109. Subgroup generated by a subset definition
  110. Proof that equivalence classes form a partition proof
  111. Proof of the division algorithm proof
  112. Minimal polynomial divides every annihilating polynomial statement
  113. Equivalence classes form a partition statement
  114. Division algorithm statement
  115. Proof of the decomposition of a permutation into disjoint cycles proof
  116. Decomposition of a permutation into disjoint cycles statement
  117. Proof of the decomposition of a permutation into transpositions proof
  118. Decomposition of a permutation into transpositions statement
  119. Sign of a permutation definition
  120. Proof that the symmetric group is generated by transpositions proof
  121. The symmetric group is generated by transpositions statement
  122. Proof that the sign is a homomorphism proof
  123. Proof of the sign of a cycle proof
  124. Sign of a cycle statement
  125. Sign is a homomorphism statement
  126. Proof that permuting rows multiplies the determinant by the sign proof
  127. Permuting rows multiplies the determinant by the sign statement
  128. Proof of the Leibniz formula from the defining properties of the determinant proof
  129. Leibniz formula for determinants statement
  130. Proof of the Laplace expansion along a row by the Leibniz formula proof
  131. Proof that the determinant of a transpose equals the determinant proof
  132. Determinant of a transpose statement
  133. Laplace expansion along a row statement
  134. Proof of the Laplace expansion along a column by transposition proof
  135. Laplace expansion along a column statement
  136. Proof of the product of a matrix and its adjugate by Laplace expansion proof
  137. Product of a matrix and its adjugate statement
  138. Proof of the Cayley–Hamilton theorem with the adjugate proof
  139. Cayley–Hamilton theorem statement
  140. Proof that the minimal polynomial divides the characteristic polynomial proof

Where this leads

1 page builds on this one.

Further reading

  1. Web https://kconrad.math.uconn.edu/blurbs/linmultialg/minpolyandappns.pdf, Section 4, after Example 4.5
About this page
TagPPC7ZEFPQE
URIm2://PPC7ZEFPQE
Kindproof
WritingW0 stub
MSC15A18
ProvesMinimal polynomial divides the characteristic polynomial
UsesMinimal polynomial, Characteristic polynomial, Polynomial of an endomorphism, Cayley–Hamilton theorem, Minimal polynomial divides every annihilating polynomial, Degree of a product, R[x] is an integral domain iff R is
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.