Math 2.0

Linear and multilinear algebra; matrix theory Proof

Proof of the existence of an eigenvalue over an algebraically closed field

Builds on Characteristic polynomial of a linear mapTrace is a coefficient of the characteristic polynomialAlgebraically closed fieldDegree of a polynomialRoot of a polynomialEigenvalues are the roots of the characteristic polynomialEigenvalue

Proof

We find a root of the characteristic polynomial.

  1. Let n=dim⁡Vn = \dim V. Since V≠0V \ne 0, n≥1n \ge 1. Fix a basis BB of VV and let A=[T]BA = [T]_B.
  2. By the definition of the characteristic polynomial of TT, pT(t)=pA(t)=det⁡(tIn−A)p_T(t) = p_A(t) = \det(t I_n - A).
  3. By the rule for the trace as a coefficient, pA(t)=tn−(tr⁡A) tn−1+⋯p_A(t) = t^n - (\tr A)\, t^{n-1} + \cdots. So pTp_T has leading coefficient 11 and degree n≥1n \ge 1.
  4. The field FF is algebraically closed, so pTp_T has a root λ∈F\lambda \in F. That is, pT(λ)=0p_T(\lambda) = 0.
  5. By the theorem that eigenvalues are the roots of the characteristic polynomial, λ\lambda is an eigenvalue of TT.

Idea

The characteristic polynomial of TT has degree dim⁡V\dim V, which is at least 11. Over an algebraically closed field such a polynomial has a root, and each root is an eigenvalue.

Reading path

To understand this page from the ground up, read these 233 pages in order. The foundations come first. The path takes the proofs Proof of the Steinitz exchange lemma by induction, Proof of the associativity of matrix multiplication, Proof that a subspace of full dimension is the whole space, 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 of the distributivity of matrix multiplication, Proof that the matrix of a composition is the product of the matrices, 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 is invertible iff its determinant is a unit, Proof that a function is bijective iff it has a two-sided inverse, 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 coordinate map is a linear isomorphism, 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 the trace is a coefficient of the characteristic polynomial by the Leibniz formula, Proof that an injective endomorphism of a finite-dimensional space is surjective, 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 that a linear map is injective iff its kernel is trivial, Proof that every linearly independent set extends to a basis, by Zorn's lemma, Proof of Zorn's lemma, 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 that n independent or n spanning vectors in an n-dimensional space form a basis, 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 a subspace of a finite-dimensional space has smaller or equal dimension, Proof that the determinant is multilinear in the rows, Proof that the eigenvalues are the roots of the characteristic polynomial, Proof of the rank–nullity theorem by extending a basis of the kernel, Proof of the subgroup criterion, Proof that similar matrices have the same characteristic polynomial.

  1. Basis concept
  2. Binary operation definition
  3. Composition of linear maps concept
  4. Coordinate space object
  5. Coordinate vector concept
  6. Cycle notation concept
  7. Definition by recursion concept
  8. Dimension concept
  9. Divisibility definition
  10. Element definition
  11. Group concept
  12. Identity matrix object
  13. Image of a linear map concept
  14. Kernel of a linear map concept
  15. Linear independence concept
  16. Linear isomorphism concept
  17. Linear map concept
  18. Linear subspace concept
  19. Mathematical induction concept
  20. Matrix definition
  21. Matrix multiplication concept
  22. Matrix of a linear map concept
  23. Multilinear map concept
  24. Natural numbers object
  25. Nullity concept
  26. Peano axioms concept
  27. Permutation concept
  28. Permutation definition
  29. Proof of Zorn's lemma proof
  30. Proposition concept
  31. Rank of a linear map concept
  32. Spanning set concept
  33. Transposition concept
  34. Vector space definition
  35. Identity element definition
  36. Set definition
  37. Group homomorphism definition
  38. Ring definition
  39. Subgroup definition
  40. Symmetric group definition
  41. Proof that the matrix of a composition is the product of the matrices proof
  42. Proof that a linear map is injective iff its kernel is trivial proof
  43. Matrix addition definition
  44. Matrix multiplication definition
  45. Square matrix definition
  46. Transpose definition
  47. Successor function definition
  48. Conjunction definition
  49. Disjunction definition
  50. Implication definition
  51. Predicate definition
  52. Linear combination definition
  53. Linear map definition
  54. Linear subspace definition
  55. Inverse element definition
  56. Empty set object
  57. Family of sets definition
  58. Ordered pair definition
  59. Commutative ring definition
  60. Polynomial ring definition
  61. Ring homomorphism definition
  62. Unit of a ring definition
  63. Zero divisor definition
  64. Transposition definition
  65. Proof of the associativity of matrix multiplication proof
  66. Proof of the distributivity of matrix multiplication proof
  67. Proof that an intersection of subgroups is a subgroup proof
  68. Intersection definition
  69. Union definition
  70. Set-builder notation concept
  71. Invertible matrix definition
  72. Trace of a matrix definition
  73. Addition of natural numbers definition
  74. Biconditional definition
  75. Existential quantifier definition
  76. Universal quantifier definition
  77. Linear independence definition
  78. Composition of linear maps definition
  79. Endomorphism definition
  80. Image of a linear map definition
  81. Kernel of a linear map definition
  82. Linear isomorphism definition
  83. Linear span definition
  84. Multilinear map definition
  85. The successor function is injective statement
  86. Zero is not a successor statement
  87. Cartesian product definition
  88. Degree of a polynomial definition
  89. Polynomial evaluation definition
  90. Proof of the uniqueness of inverses proof
  91. Field definition
  92. Integral domain definition
  93. Disjoint sets definition
  94. Distributivity of matrix multiplication statement
  95. Associativity of matrix multiplication statement
  96. Subset definition
  97. Union of a family of sets definition
  98. Axiom of extensionality statement
  99. Proof of the commutativity of addition by induction proof
  100. Similar matrices definition
  101. A linear map is injective iff its kernel is trivial statement
  102. Order on the natural numbers definition
  103. Uniqueness quantifier definition
  104. Eigenvalue definition
  105. Spanning set definition
  106. Alternating multilinear map definition
  107. Root of a polynomial definition
  108. Evaluation homomorphism definition
  109. Uniqueness of inverses statement
  110. Binary relation definition
  111. Irreducible element definition
  112. Partition of a set definition
  113. Determinant definition
  114. Commutativity of addition statement
  115. Finite-dimensional vector space definition
  116. Basis definition
  117. Proof of strong induction from ordinary induction proof
  118. Proof of the Steinitz exchange lemma by induction proof
  119. Split polynomial definition
  120. Antisymmetric relation definition
  121. Reflexive relation definition
  122. Symmetric relation definition
  123. Transitive relation definition
  124. Irreducible polynomial definition
  125. Proof of the subgroup criterion proof
  126. Proof of the laws of exponents in a group proof
  127. Proof that a matrix with two equal rows has determinant zero proof
  128. Characteristic polynomial definition
  129. Dimension definition
  130. Proof that the determinant of the identity matrix is one proof
  131. Coordinate vector definition
  132. Dimension theorem for vector spaces statement
  133. Function definition
  134. Minor definition
  135. Proof that the determinant is multilinear in the rows proof
  136. Strong induction statement
  137. Steinitz exchange lemma statement
  138. Algebraically closed field definition
  139. Equivalence relation definition
  140. Preorder definition
  141. Subgroup criterion statement
  142. Determinant of a matrix with two equal rows statement
  143. Laws of exponents in a group statement
  144. Determinant of the identity matrix statement
  145. Determinant is multilinear in the rows statement
  146. Choice function definition
  147. Matrix of a linear map definition
  148. Codomain definition
  149. Function composition definition
  150. Identity function definition
  151. Injective function definition
  152. Proof of the well-ordering principle from strong induction proof
  153. Cofactor definition
  154. Proof that a subspace of a finite-dimensional space has smaller or equal dimension proof
  155. Rank of a linear map definition
  156. Proof that n independent or n spanning vectors in an n-dimensional space form a basis proof
  157. Nullity definition
  158. Partial order definition
  159. Intersection of subgroups is a subgroup statement
  160. Proof that disjoint cycles commute proof
  161. Equivalence class definition
  162. Axiom of choice statement
  163. Left inverse definition
  164. Right inverse definition
  165. Matrix of a composition is the product of matrices statement
  166. Surjective function definition
  167. Adjugate matrix definition
  168. Characteristic polynomial of a linear map definition
  169. Linearly independent set of the right size is a basis statement
  170. Dimension of a subspace statement
  171. Well-ordering principle statement
  172. Maximal element definition
  173. Total order definition
  174. Upper bound definition
  175. Subgroup generated by a subset definition
  176. Disjoint cycles commute statement
  177. Proof that equivalence classes form a partition proof
  178. Bijective function definition
  179. Proof of the division algorithm proof
  180. Proof that a subspace of full dimension is the whole space proof
  181. Chain definition
  182. Equivalence classes form a partition statement
  183. Division algorithm statement
  184. Proof that a function is bijective iff it has a two-sided inverse proof
  185. A subspace of full dimension is the whole space statement
  186. Bijective iff it has a two-sided inverse statement
  187. Proof of the decomposition of a permutation into disjoint cycles proof
  188. Zorn's lemma statement
  189. Decomposition of a permutation into disjoint cycles statement
  190. Proof that the coordinate map is a linear isomorphism proof
  191. Proof that every linearly independent set extends to a basis, by Zorn's lemma proof
  192. Proof of the decomposition of a permutation into transpositions proof
  193. Every linearly independent set extends to a basis statement
  194. Isomorphism with the coordinate space statement
  195. Decomposition of a permutation into transpositions statement
  196. Proof of the rank–nullity theorem by extending a basis of the kernel proof
  197. Sign of a permutation definition
  198. Proof that the symmetric group is generated by transpositions proof
  199. Rank–nullity theorem statement
  200. The symmetric group is generated by transpositions statement
  201. Proof that the sign is a homomorphism proof
  202. Proof of the sign of a cycle proof
  203. Proof that an injective endomorphism of a finite-dimensional space is surjective proof
  204. Sign of a cycle statement
  205. Sign is a homomorphism statement
  206. An injective endomorphism of a finite-dimensional space is surjective statement
  207. Proof that permuting rows multiplies the determinant by the sign proof
  208. Permuting rows multiplies the determinant by the sign statement
  209. Proof of the Leibniz formula from the defining properties of the determinant proof
  210. Leibniz formula for determinants statement
  211. Proof that the determinant is multiplicative by expanding the rows proof
  212. Proof of the Laplace expansion along a row by the Leibniz formula proof
  213. Proof that the trace is a coefficient of the characteristic polynomial by the Leibniz formula proof
  214. Proof that the determinant of a transpose equals the determinant proof
  215. Determinant is multiplicative statement
  216. Determinant of a transpose statement
  217. Laplace expansion along a row statement
  218. Trace is a coefficient of the characteristic polynomial statement
  219. Proof of the determinant of the inverse proof
  220. Proof that similar matrices have the same characteristic polynomial proof
  221. Proof of the Laplace expansion along a column by transposition proof
  222. Determinant of the inverse statement
  223. Characteristic polynomial does not depend on the basis statement
  224. Laplace expansion along a column statement
  225. Proof of the product of a matrix and its adjugate by Laplace expansion proof
  226. Product of a matrix and its adjugate statement
  227. Proof of the inverse in terms of the adjugate proof
  228. Inverse in terms of the adjugate statement
  229. Proof that a matrix is invertible iff its determinant is a unit proof
  230. A matrix is invertible iff its determinant is a unit statement
  231. Proof that the eigenvalues are the roots of the characteristic polynomial proof
  232. Eigenvalues are the roots of the characteristic polynomial statement
  233. Proof of the existence of an eigenvalue over an algebraically closed field proof

Where this leads

52 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Eigenvalues_and_eigenvectors, Eigenvalues and characteristic polynomial
About this page
TagJZQEV913ZV
URIm2://JZQEV913ZV
Kindproof
WritingW0 stub
MSC15A18
ProvesExistence of an eigenvalue over an algebraically closed field
UsesCharacteristic polynomial of a linear map, Trace is a coefficient of the characteristic polynomial, Algebraically closed field, Degree of a polynomial, Root of a polynomial, Eigenvalues are the roots of the characteristic polynomial, Eigenvalue
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.