DEPARTMENT OF MATHEMATICS AND STATISTICS

MTH 415/A: MATRIX THEORY & LINEAR ESTIMATION

(SESSION: 2018-19 SEMESTER: I)

Problem Set 3

1(a) Find 2 × 2 non-null matrices A, B, C satisfying (a) 𝐴2 = 𝐴 but 𝐴 ≠ 𝐼2 ; and (b) 𝐴𝐵 =

𝐴𝐶 but 𝐵 ≠ 𝐶.
(b) Prove or disprove that for any matrix A (of appropriate dimensions) (a) 𝐴2 = 0 ⇒ 𝐴 = 0;
and (b) 𝐴/ 𝐴 = 0 ⇒ 𝐴 = 0.
(c) Find 𝑛 × 𝑛 matrices A and B such that 𝐴𝐵 − 𝐵𝐴 = 𝑐𝐼𝑛 for any 𝑐 ≠ 0.

2. Let A, B and C represent any n × n matrices. Prove or disprove the following statements:
(a) 𝑇𝑟𝑎𝑐𝑒(𝐴𝐵𝐶) = 𝑇𝑟𝑎𝑐𝑒(𝐶𝐴𝐵) is true in general;
(b) 𝑇𝑟𝑎𝑐𝑒(𝐴𝐵𝐶) = 𝑇𝑟𝑎𝑐𝑒(𝐵𝐴𝐶) is never true.

1 0 0 1 0 0 0 0
3(a) Show that the set S = �� �,� �,� �,� � � is linearly independent in
0 0 0 0 1 0 0 1
𝕄2×2 , the space of all 2 × 2 real matrices.
2×3
(b) Determine whether the set below is linearly independent in 𝕄 :
−2 3 4 4 −2 2 −1 −2 −2 −1 1 0 −1 2 −2
S = �� �,� �,� �,� �,� ��.
−1 3 −2 0 −1 1 2 2 2 −1 0 −2 0 −1 −2

4. Find the dimension of the space of 𝑛 × 𝑛 symmetric matrices and a basis for it.

5. Prove or disprove that for any matrix A, AA′ will be idempotent if A′A is idempotent.

1 1 3 1
6. For the matrix 𝐴 = � 2 1 5 4 � find a basis each for ℭ(𝐴), the column space of 𝐴 and
1 2 4 −1
𝒩(𝐴), the null space of 𝐴.

𝐴
7. Prove that (a) ℭ(𝐴) = ℭ(𝐴 𝐵) ⇔ ℭ(𝐵) ⊆ ℭ(𝐴) ; (b) ℛ(𝐴) = ℛ � � ⇔ ℛ(𝐶) ⊆ ℛ(𝐴).
𝐶

8. Let A , B and C represent any q × p , p × n and m × q matrices, respectively. Prove or

disprove:
(a) if rank (CAB) = rank (C ) , then rank (CA) = rank (C ) ; and
(b) if rank (CAB) = rank ( B) , then rank ( AB) = rank ( B) .

9. If 𝑟𝑎𝑛𝑘(A − I) = 𝑝 and 𝑟𝑎𝑛𝑘(B − I) = 𝑞, prove or disprove that that 𝑟𝑎𝑛𝑘(AB − I) ≤

𝑝 + 𝑞.
10(a) 𝐴 is an 𝑛 × 𝑛 matrix with 𝑎𝑖𝑗 = 0 when 𝑖 + 𝑗 is even and 𝑎𝑖𝑗 = 1 when 𝑖 + 𝑗 is odd.
What is the rank of 𝐴?
(b) Let 𝐴 be an 𝑛 × 𝑛 matrix with 𝑎𝑖𝑗 = 𝑖 + 𝑗. What is the minimum and maximum possible
ranks of 𝐴?

11. Find the rank of the following matrix for every real value of 𝛼:
1 4 α 4 
2 − 6 7 1 
 
3 2 − 6 7 
 
2 2 − 5 5 

12(a) For any two matrices 𝐴𝑚×𝑛 and 𝐵𝑛×𝑝 prove that
𝑟(𝐴𝐵) ≥ 𝑟(𝐴) + 𝑟(𝐵) − 𝑛 (Sylvester's inequality).
(b) For any three matrices 𝐴𝑚×𝑛 , 𝐶𝑛×𝑝 and 𝐵𝑝×𝑞 prove that
𝑟(𝐴𝐶𝐵) ≥ 𝑟(𝐴𝐶) + 𝑟(𝐶𝐵) − 𝑟(𝐶) (Frobenius' inequality).