Arshad Khan

Chinese Name: 艾沙德

Student Id :2019730022
Q 11
Prove that the vector subspaces U and W in the previous problem are uniquely
characterized by (i) through (iv).

SOLUTION:
1. Let V = U1 ⊕ · · · ⊕ Uk be the primary decomposition, with U1
corresponding to the prime X.by (ii) U = (U1 ∩ U) ⊕ · · · ⊕ (Uk ∩ U) and
similarly for W. Then Uj ∩ U = 0 for j ≥ 2 by (iii), and hence U ⊆ U1. By (iv), U1
∩ W = 0, so that W ⊆ U2 ⊕ · · · ⊕ Uk . By (i), U = U1 and W = U2 ⊕ · · · ⊕
Uk .
Question 16
𝟒 𝟏 −𝟏
For the complex matrix A = (−𝟖 −𝟐 𝟐 ), find a Jordan form matrix J and
𝟖 −𝟐 −𝟐
an invertible matrix C such that J= 𝑪−𝟏 AC.

Solution:
The characteristic polynomial is P(X) = det (XI − A) =𝑋 3 . Thus, A is nilpotent and
0 1 0
2
in fact 𝐴 =0. Then J=(0 0 0) and we get results from computation proceeds
0 0 0
1
0 0
4 1 −1 8
1 1
As a result, we get C= (−8 0 4 ) and 𝐶 −1 = (0 4
− ).
4
8 0 0 1 1
0
4 4
Q # 5:
(a) Suppose that D and D’ are in Mn(K), are similar to diagonal matrices, and
have DD’ = D ‘D. Prove that there is a matrix C such that 𝑪−𝟏 , DC and 𝑪−𝟏 D’
C are both diagonal.
(b) Give an example of two nilpotent matrices N and N’ in Mn(K) with N N’=
N ‘N such that there is no C with 𝑪−𝟏 NC and 𝑪−𝟏 N’C both in Jordan form

SOLUTION:
As we have To write (𝐾)𝑛 = U1 ⊕· · ·⊕ Uk and (𝐾)𝑛 = W1 ⊕· · ·⊕ Wl,
where the Uj are the eigenspaces for the distinct eigenvalues of D and the Wj are the
eigenspaces for the distinct eigenvalues of D’. These decompositions are the primary
decompositions shows that Wj = (Wj ∩ U1) · · · ⊕ (Wj ∩ Uk ) for 1 ≤ j ≤
l. Summing on j, we see that ( 𝐾)𝑛 is the direct sum of all Ui ∩ Wj . Each of D and
D’ is scalar on Ui ∩ Wj , and
(a) follows by translating this result into a statement about matrices.
The matrices N = (0 1 0 0) and N’ = (0 0 0 0) commute, and both have N
uniquely as Jordan form. If C were to exist with 𝐶−1NC and 𝐶−1N’ C both in
Jordan form, we would have 𝐶−1NC 𝐶−1N’ C and N = N’ , contradiction. This
answers (b).
Question 18:

For 𝑴𝟑 (C), prove that any two matrices with the same minima polynomial and
the same characteristics polynomial must be similar.

Solution:
(a) if every prime-power factor of the minimal polynomial is of degree 1, then the
matrix is similar to a diagonal matrix, and the multiplicities of the eigenvalues
can be seen from the characteristic polynomial. If the minimal polynomial
𝑐 1 0
2
is (𝑋 − 𝑐) , then the matrix has similar to (0 𝑐 0 ).If the minimal
0 0 𝑐
2
polynomial instead is (𝑋 − 𝑐) (𝑋 − 𝑑) , then
𝑐 1 0
the matrix has to similar to (0 𝑐 0).If the minimal polynomial is (𝑋 − 𝑐)3 ,
0 0 𝑑
𝑐 1 𝑐
then the matrix has to similar to (0 𝑐 1). There are no other possibilities.
0 0 𝑐
Question 19

Suppose that K has characteristics 0 and that J is a Jordan block with non-zero
eigen value and with size >1. Prove that there is no n ≥ 1 such that 𝑱𝒏 is diagonal.
Solution:
If the diagonal entries are c and N denotes the strictly upper -triangular part, then
𝑘
𝐽𝑘 =(𝑋 = (𝑐𝐼 + 𝑁)𝑘 =∑𝑘𝑗=0 ( )𝑐 𝑘−𝑗 𝑁 𝑗 .The term from j=1 is not canceled by any
𝑗
𝑘
other term and hence 𝐽 is not diagonal.
Q # 10
. Let L : V → V be linear. Prove that there exist vector subspaces U and W of
V such that
(i) V = U ⊕ W,
(ii) L(U) ⊆ U and L(W) ⊆ W,
(iii) L is nilpotent on U
(iv) (iv) L is nonsingular on W.

SOLUTION:
As we know that
To take U to be the primary subspace for the prime polynomial X and W to be the
sum of the remaining primary subspaces. Then (i), (ii), and (iii) are immediate from
the theorem. For (iv), let Uj be the primary subspace for some other prime
polynomial P(X). The theorem shows that L│ Uj has a power of P(X) as minimal
polynomial. Since X does not divide P(X), shows that L│ Uj is invertible. Hence
L│ Uj is invertible on the direct sum of the Uj’s other than the one for the
polynomial X.
Q # 11
Prove that the vector subspaces U and W in the previous problem are uniquely
characterized by (i) through (iv).

SOLUTION:
1. Let V = U1 ⊕ · · · ⊕ Uk be the primary decomposition, with U1
corresponding to the prime X.by (ii) U = (U1 ∩ U) ⊕ · · · ⊕ (Uk ∩ U) and
similarly for W. Then Uj ∩ U = 0 for j ≥ 2 by (iii), and hence U ⊆ U1. By (iv), U1
∩ W = 0, so that W ⊆ U2 ⊕ · · · ⊕ Uk . By (i), U = U1 and W = U2 ⊕ · · · ⊕
Uk .
Question 21
How many similarity classes are there of 3-by-3 matrices A with entries in C
such that 𝑨𝟑 = 𝑨 ? Explain.
Solution:
The minimal polynomial has to divide (𝑋 = (𝑋 2 − 1) = X (X + 1) (X − 1). Hence
there is a basis of eigenvectors, the allowable eigenvalues being 1, −1, and 0. A
similarity class is therefore given by an unordered triple of elements from the set {1,
−1, 0}. There are three possibilities for a single eigenvalue, six possibilities for one
eigenvalue of multiplicity 2 and one of multiplicity 1, and one possibility with all
three eigenvalues present. So, the answer is ten.
Q # 20:
Classify up to similarity all members A of Mn(C) with 𝑨𝒏 =I.

SOLUTION:
We know that Choose J in Jordan form and C invertible with J =𝐶 −1 𝐴𝐶.Then 𝐽𝑛 =
𝐶𝐴𝑛 𝐶 −1 = C𝐽𝑛 = I. By Problem 19, every Jordan block in J is of size 1-by-1. Thus, A
is similar to a diagonal matrix D, and each diagonal entry of D must be an 𝑛𝑡ℎ root
of unity. Any n-tuple of𝑛𝑡ℎ roots of unity can form the diagonal entries, and the
corresponding matrices are similar if and only if one is a permutation of the other.
Question 22
Let n≥2 and let N be a member of 𝑴𝒏 (𝑲) with 𝑵𝒏 =0 but 𝑵𝒏−𝟏 ≠0.Prove that
there is no n-by-n matrix A with 𝑨𝟐 = 𝑵
If 𝐴2 = 𝑁 = N and 𝑁 𝑛 = 0, then 𝐴2𝑛 = 0. So, A is nilpotent and 𝐴𝑛 = 0. Since
𝑁 𝑛 − 1≠0 , 𝐴2𝑛−2 ≠0.Therefore n > 2n-2 and n=1.