Linear and multilinear algebra; matrix theory Proof
Proof of the decomposition into generalised eigenspaces
Builds on Generalised eigenspaceDirect sum of subspacesPolynomial of an endomorphismCayley–Hamilton theorem for linear mapsK[x] is a Euclidean domainEuclidean domains are principal ideal domainsPrincipal ideal domainPID implies UFDUnique factorisation domainIrreducible polynomialIdeal generated by a subsetKernel of a linear mapInvariant subspaceRestriction of an endomorphism to an invariant subspaceMatrix of a linear mapBlock diagonal matrixDeterminant of a block triangular matrixCharacteristic polynomial of a linear mapEigenvalues are the roots of the characteristic polynomialBasis
Proof
We split with polynomials in that add up to the identity, as in the primary decomposition. Then we compute the dimensions from the characteristic polynomial.
- Write , and , so for each . Let , a kernel in .
- The ring is a Euclidean domain, hence a principal ideal domain, hence a unique factorisation domain. Each is an irreducible polynomial, since it has degree . Distinct monic polynomials are not associates.
- By step 2 and the uniqueness of factorisations, each monic divisor of has the form with . The same holds for monic divisors of , with a single factor.
- The ideal generated by is principal and nonzero, so it is generated by a monic . Then divides each and .
- By step 3, . Since divides , and does not occur in the factorisation of , uniqueness gives . This holds for each , so .
- Hence there are with . Let . Evaluation at respects sums and products, so , by the definition of the value at .
- Polynomials in commute with each other. So each is mapped into itself by every polynomial in . In particular, is -invariant.
- Let . Then by the Cayley–Hamilton theorem. So , and lies in .
- Let and . Then divides , so . With step 6, .
- Let with . Applying and using step 9 gives for each . With step 8, as a direct sum.
- We show , the generalised eigenspace. If , the definition gives with exponent . If , then .
- Conversely, let , with . Let and . By step 7, . Also by step 8.
- The ideal generated by and has a monic generator . By step 3, divides , so . It also divides , so uniqueness gives and .
- So for some . Applying this to gives by step 12.
- Hence for , and by step 8. So , and .
- Let , and choose a basis of each . Their concatenation spans by step 8. It is linearly independent, because a relation splits into vectors with sum , so each by step 10.
- Let be the restriction, and let be its matrix in the chosen basis of . By step 7, the matrix of in is the block diagonal matrix . Blocks with are omitted, and we set for them.
- The matrix is block diagonal with blocks . Using the determinant of a block triangular matrix times, , by the definition of .
- Let be nonzero with . Then , so . Thus is the only possible eigenvalue of .
- The polynomial is monic of degree and divides by step 18. By step 3, .
- If for some , then is a root of . By the roots of the characteristic polynomial, it is an eigenvalue of . This contradicts step 19, since .
- So , by comparing degrees. Then step 18 gives .
- The are pairwise non-associate irreducible elements by step 2. Uniqueness of factorisation in the unique factorisation domain gives for each .
- So , which completes the proof.
Idea
The polynomials have no common factor, so a combination of them equals . Plugging in gives maps that add up to the identity, and Cayley–Hamilton shows that lands in . For the dimensions, is block diagonal with one block for each eigenvalue. Each block has characteristic polynomial a power of , and unique factorisation matches the exponents.
Reading path
To understand this page from the ground up, read these 285 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 of cancellation in an integral domain, 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 R/P is an integral domain iff P is prime, Proof that equivalence classes form a partition, Proof that every principal ideal domain is a unique factorisation domain, 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 R[x] is an integral domain iff R is, Proof that a matrix is invertible iff its determinant is a unit, Proof of the determinant of a block triangular matrix by the Leibniz formula, 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 that maximal ideals are prime, Proof of the Laplace expansion along a row by the Leibniz formula, Proof of the degree of a product over an integral domain, 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 of the correspondence theorem for rings, Proof that R/M is a field iff M is maximal, Proof that an injective endomorphism of a finite-dimensional space is surjective, Proof that the only ideals of a field are zero and the whole field, 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 Cayley–Hamilton theorem for linear maps, Proof of the uniqueness of inverses, Proof that a subspace of a finite-dimensional space has smaller or equal dimension, Proof that in a PID a nonzero element is irreducible iff it generates a maximal ideal, 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 of the Cayley–Hamilton theorem with the adjugate, Proof that Euclidean domains are principal ideal domains, Proof that K[x] is a Euclidean domain, Proof that similar matrices have the same characteristic polynomial.
- Basis concept
- Binary operation definition
- Composition of linear maps concept
- Coordinate space object
- Coordinate vector concept
- Cycle notation concept
- Definition by recursion concept
- Dimension concept
- Divisibility definition
- Element definition
- Group concept
- Identity matrix object
- Image of a linear map concept
- Kernel of a linear map concept
- Linear independence concept
- Linear isomorphism concept
- Linear map concept
- Linear subspace concept
- Mathematical induction concept
- Matrix definition
- Matrix multiplication concept
- Matrix of a linear map concept
- Multilinear map concept
- Natural numbers object
- Nullity concept
- Peano axioms concept
- Permutation concept
- Permutation definition
- Proof of Zorn's lemma proof
- Proposition concept
- Rank of a linear map concept
- Spanning set concept
- Transposition concept
- Vector space definition
- Identity element definition
- Set definition
- Group homomorphism definition
- Ring definition
- Subgroup definition
- Symmetric group definition
- Proof that the matrix of a composition is the product of the matrices proof
- Proof that a linear map is injective iff its kernel is trivial proof
- Block matrix definition
- Matrix addition definition
- Matrix multiplication definition
- Square matrix definition
- Transpose definition
- Successor function definition
- Conjunction definition
- Disjunction definition
- Implication definition
- Predicate definition
- Linear combination definition
- Linear map definition
- Linear subspace definition
- Inverse element definition
- Empty set object
- Family of sets definition
- Ordered pair definition
- Commutative ring definition
- Polynomial ring definition
- Ring homomorphism definition
- Unit of a ring definition
- Zero divisor definition
- Transposition definition
- Ideal definition
- Proof of the associativity of matrix multiplication proof
- Proof that an intersection of subgroups is a subgroup proof
- Proof of the distributivity of matrix multiplication proof
- Block diagonal matrix definition
- Intersection definition
- Union definition
- Set-builder notation concept
- Invertible matrix definition
- Addition of natural numbers definition
- Biconditional definition
- Existential quantifier definition
- Universal quantifier definition
- Linear independence definition
- Composition of linear maps definition
- Endomorphism definition
- Image of a linear map definition
- Kernel of a linear map definition
- Linear isomorphism definition
- Linear span definition
- Multilinear map definition
- The successor function is injective statement
- Zero is not a successor statement
- Sum of subspaces definition
- Cartesian product definition
- Divisibility in a commutative ring definition
- Degree of a polynomial definition
- Polynomial evaluation definition
- Proof of the uniqueness of inverses proof
- Field definition
- Integral domain definition
- Ideal generated by a subset definition
- Prime ideal definition
- Disjoint sets definition
- Maximal ideal definition
- Two-sided ideal definition
- Associativity of matrix multiplication statement
- Distributivity of matrix multiplication statement
- Subset definition
- Axiom of extensionality statement
- Union of a family of sets definition
- Proof of the commutativity of addition by induction proof
- A linear map is injective iff its kernel is trivial statement
- Similar matrices definition
- Order on the natural numbers definition
- Uniqueness quantifier definition
- Invariant subspace definition
- Eigenvalue definition
- Polynomial of an endomorphism definition
- Spanning set definition
- Alternating multilinear map definition
- Direct sum of subspaces definition
- Leading coefficient definition
- Associate elements definition
- Prime element definition
- Proof of cancellation in an integral domain proof
- Evaluation homomorphism definition
- Uniqueness of inverses statement
- Euclidean domain definition
- Irreducible element definition
- Binary relation definition
- Principal ideal definition
- Quotient ring definition
- Proof that the only ideals of a field are zero and the whole field proof
- Partition of a set definition
- Determinant definition
- Commutativity of addition statement
- Restriction of an endomorphism to an invariant subspace definition
- Proof of strong induction from ordinary induction proof
- Eigenvector definition
- Basis definition
- Proof of the Steinitz exchange lemma by induction proof
- Finite-dimensional vector space definition
- Monic polynomial definition
- Proof of the degree of a product over an integral domain proof
- Cancellation in an integral domain statement
- Unique factorisation domain definition
- Irreducible polynomial definition
- Proof of the subgroup criterion proof
- Principal ideal domain definition
- Proof of the laws of exponents in a group proof
- Proof that R/P is an integral domain iff P is prime proof
- Proof that R/M is a field iff M is maximal proof
- Antisymmetric relation definition
- Reflexive relation definition
- Symmetric relation definition
- Transitive relation definition
- The only ideals of a field are zero and the whole field statement
- Characteristic polynomial definition
- Proof that the determinant of the identity matrix is one proof
- Proof that a matrix with two equal rows has determinant zero proof
- Function definition
- Minor definition
- Proof that the determinant is multilinear in the rows proof
- Coordinate vector definition
- Dimension theorem for vector spaces statement
- Strong induction statement
- Dimension definition
- Generalised eigenvector definition
- Steinitz exchange lemma statement
- Degree of a product statement
- Division algorithm for polynomials statement
- Subgroup criterion statement
- Proof that in a PID a nonzero element is irreducible iff it generates a maximal ideal proof
- R/P is an integral domain iff P is prime statement
- Laws of exponents in a group statement
- Equivalence relation definition
- Preorder definition
- Determinant of the identity matrix statement
- Determinant of a matrix with two equal rows statement
- Image of a set definition
- Preimage of a set definition
- Determinant is multilinear in the rows statement
- Choice function definition
- Proof of the well-ordering principle from strong induction proof
- Codomain definition
- Function composition definition
- Identity function definition
- Injective function definition
- Cofactor definition
- Matrix of a linear map definition
- Proof that a subspace of a finite-dimensional space has smaller or equal dimension proof
- Proof that n independent or n spanning vectors in an n-dimensional space form a basis proof
- Generalised eigenspace definition
- Rank of a linear map definition
- Nullity definition
- Proof that R[x] is an integral domain iff R is proof
- Intersection of subgroups is a subgroup statement
- In a PID a nonzero element is irreducible iff it generates a maximal ideal statement
- Partial order definition
- Proof that disjoint cycles commute proof
- Equivalence class definition
- Matrix of a composition is the product of matrices statement
- Adjugate matrix definition
- Axiom of choice statement
- Left inverse definition
- Right inverse definition
- Surjective function definition
- Well-ordering principle statement
- Characteristic polynomial of a linear map definition
- Dimension of a subspace statement
- Linearly independent set of the right size is a basis statement
- Subgroup generated by a subset definition
- R[x] is an integral domain iff R is statement
- Maximal element definition
- Total order definition
- Upper bound definition
- Disjoint cycles commute statement
- Proof that Euclidean domains are principal ideal domains proof
- Proof that equivalence classes form a partition proof
- Proof of the division algorithm proof
- Bijective function definition
- Proof that a subspace of full dimension is the whole space proof
- Proof that K[x] is a Euclidean domain proof
- Chain definition
- Euclidean domains are principal ideal domains statement
- Division algorithm statement
- Equivalence classes form a partition statement
- Proof of the correspondence theorem for rings proof
- Proof that a function is bijective iff it has a two-sided inverse proof
- A subspace of full dimension is the whole space statement
- K[x] is a Euclidean domain statement
- Proof of the decomposition of a permutation into disjoint cycles proof
- Correspondence theorem for rings statement
- Bijective iff it has a two-sided inverse statement
- Zorn's lemma statement
- Decomposition of a permutation into disjoint cycles statement
- Proof that the coordinate map is a linear isomorphism proof
- R/M is a field iff M is maximal statement
- Proof that every linearly independent set extends to a basis, by Zorn's lemma proof
- Proof of the decomposition of a permutation into transpositions proof
- Proof that maximal ideals are prime proof
- Every linearly independent set extends to a basis statement
- Isomorphism with the coordinate space statement
- Decomposition of a permutation into transpositions statement
- Maximal ideals are prime statement
- Proof of the rank–nullity theorem by extending a basis of the kernel proof
- Sign of a permutation definition
- Proof that the symmetric group is generated by transpositions proof
- Proof that every principal ideal domain is a unique factorisation domain proof
- Rank–nullity theorem statement
- The symmetric group is generated by transpositions statement
- Proof that the sign is a homomorphism proof
- PID implies UFD statement
- Proof of the sign of a cycle proof
- Proof that an injective endomorphism of a finite-dimensional space is surjective proof
- Sign is a homomorphism statement
- Sign of a cycle statement
- An injective endomorphism of a finite-dimensional space is surjective statement
- Proof that permuting rows multiplies the determinant by the sign proof
- Permuting rows multiplies the determinant by the sign statement
- Proof of the Leibniz formula from the defining properties of the determinant proof
- Leibniz formula for determinants statement
- Proof of the determinant of a block triangular matrix by the Leibniz formula proof
- Proof of the Laplace expansion along a row by the Leibniz formula proof
- Proof that the determinant is multiplicative by expanding the rows proof
- Proof that the determinant of a transpose equals the determinant proof
- Determinant of a block triangular matrix statement
- Determinant is multiplicative statement
- Determinant of a transpose statement
- Laplace expansion along a row statement
- Proof of the determinant of the inverse proof
- Proof of the Laplace expansion along a column by transposition proof
- Proof that similar matrices have the same characteristic polynomial proof
- Determinant of the inverse statement
- Laplace expansion along a column statement
- Characteristic polynomial does not depend on the basis statement
- Proof of the product of a matrix and its adjugate by Laplace expansion proof
- Product of a matrix and its adjugate statement
- Proof of the inverse in terms of the adjugate proof
- Proof of the Cayley–Hamilton theorem with the adjugate proof
- Inverse in terms of the adjugate statement
- Cayley–Hamilton theorem statement
- Proof that a matrix is invertible iff its determinant is a unit proof
- Proof of the Cayley–Hamilton theorem for linear maps proof
- A matrix is invertible iff its determinant is a unit statement
- Cayley–Hamilton theorem for linear maps statement
- Proof that the eigenvalues are the roots of the characteristic polynomial proof
- Eigenvalues are the roots of the characteristic polynomial statement
- Proof of the decomposition into generalised eigenspaces proof
Where this leads
1 page builds on this one.
Further reading
- Web https://kconrad.math.uconn.edu/blurbs/linmultialg/minpolyandappns.pdf, Proof of Theorem 4.17
About this page
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.