Part 1
Since 0 is an eigenvalue, there exists an eigenvector v such that Lv=0v=0. But then v∈ker(L), so dimker(L)≥1. Since ker(L)≠0, L can not be injective.
By the rank-nullity theorem, we must also have 5=dimker(L)+dimim(L). But then dimim(L)≤5=dimR5, so L can not be surjective either.
Part 2
Since all eigenvalues are roots of the minimal polynomial and complex roots occur in conjugate pairs, we must have Spec(L)={0,1±i,1±2i}.
Moreover, since this is a 5×5 matrix and we have 5 eigenvalues, this is all of them, and we have the characteristic polynomial χL(x)=x(x2−2x+2)(x2−2x+5)∈R[x]
Since the minimal polynomial pL(x) must divide the characteristic polynomial and have every eigenvalue as a root, this forces pL(x)=χL(x).
Part 3
If Lx=x, then x is an eigenvector with eigenvalue λ=1. Since 1∉Spec(L), such an x can not exist, so L has only one fixed point: namely x=0.
Problem 2
Let M be an n×n matrix such that Mij=1 for all i,j, and consider the possible eigenvectors of M.
We have M[1,1,⋯,1]t=[n,n,⋯,n]t=n[1,1,⋯,1]t,
which exhibits x=[1,1,⋯,1] as an eigenvector with eigenvalue λ=n.
Now consider xj:=e1−ej=[1,0,0,⋯,0,−1,0,⋯,0] which has a 1 in the 1st coordinate and a −1 in the jth coordinate.
Then
\begin{align*} M \mathbf{x}_j = \left[\begin{array}{c} 1 + 0 + \cdots + 0 + (-1) + 0 + \cdots + 0 \\ 1 + 0 + \cdots + 0 + (-1) + 0 + \cdots + 0 \\ \vdots \end{array}\right] = [0,0,\cdots, 0]^t ,\end{align*}
which exhibits each xj as an eigenvector with eigenvalue λ=0.
But the set {xj|2≤j≤n} with eigenvalue 0 contains n−1 distinct eigenvectors, and we have an additional 1 eigenvector with eigenvalue 1, which yields n distinct eigenvectors.
So M is fact diagonalizable and given by JCF(M)=(n−1)J10⊕J1n=[000⋯0000⋯0000⋯0⋮⋮⋮⋱⋮000⋯n]
Problem 3
Part 1
Note that we can’t have Tj=0 for any j≤4, since then T5=T5−kTk=T5−k0=0, contradicting T5≠0.
So in fact pT(x)=x6 is the minimal polynomial of T, and since V is 6 dimensional, the degree of the characteristic polynomial χT(x) is 6. Since pT∣χT, and both are monic polynomials of degree 6, we in fact have pT(x)=χT(x)=x6.
But this means T has eigenvalue λ=0 with multiplicity 6. This means
- The size of the largest Jordan block associated to λ=0 is size 6, since 0 has multiplicity 6 in pT, and
- The sum of the sizes of all Jordan blocks associated to λ=0 is 6, since 0 has multiplicity 6 in χT
which forces JCF(T) to have a single Jordan block of size 6, i.e. JCF(T)=J60=[010000001000000100000010000001000000]
Part 2
By part (1), we know that these conditions uniquely specify their Jordan forms, so we have M:=JCF(T)=JCF(S).
Moreover, since M=JCF(T), we know there is a matrix P such that T=PMP−1.
Similarly, we know there is a matrix Q such that S=QMQ−1.
But then P−1TP=M, and so S=QMQ−1=Q(P−1TP)Q−1=(QP−1)T(QP−1)−1:=ATA−1
where A=QP−1 is a product of invertible matrices and thus invertible.