Lebanese University Correction of the partial exam 2018-2019
Faculty of Sciences V M1103
Exercise 1
i. We have A is invertible, then A−1 .A = In
AB = (0) ⇒ A−1 AB = (0) ⇒ In .B = (0) ⇒ B = (0).
ii. If AB + BA = (0), then:
We multiply by A on the right, we obtain: ABA + BA2 = (0) ⇔ ABA = −BA2
We multiply by B on the left, we obtain: BAB + B 2 A = (0) ⇔ −BAB = B 2 A
So ABA − BAB = B 2 A − BA2 .
iii. Let A and B be two nilpotent matrices, then ∃ k, ` ∈ N such that Ak = (0) and B ` = (0).
Let n = k + `, by the binomial formula, we have:
n
X n
X n
X n
X n
X
(A + B)n = Cni Ai B n−i = Cni Ai B n−i + Cni Ai B n−i = Cni Ai (0) + Cni 0B n−i = (0)
i=0 i6k i>k i6k i>k
In fact, i 6 k ⇔ n − i > ` and B n−i = (0), and k > i implies Ak = (0)
So (A + B) is nilpotent.
Exercise 2
1 2 1 −1 1 2 1 −1
Ma,b = 3 0 1 0 −→ 0 −6 −2 3
a b 0 1 0 b − 2a −a 1 + a
First of all, the rank of a matrix M is the number of non zero rows in a row echelon form of M .
if rk (Ma,b ) = 2, then R2 and R3 are proportionnal, since R1 and R2 are not proportionnals.
Let R2 = R3 , we have:
1+a=3
a=2
−a = −2
⇔ a=2
b − 2a = −6
b = −2
0=0
So for a = 2, b = −2, rk (M2,−2 ) = 2.
Exercise 3
n1 n
a) Hypothesis: ∀n > 1, A = ?
0 1
1 1 1
For n = 1, We have A = A = .
0 1
So it’s true for n = 1.
Suppose that the property is true up to n − 1, let’s show it for n:
n n−1 1 n−1 1 1 1 n
A = A .A = . = .
0 1 0 1 0 1
So it’s true for n. Therefore it’s true ∀n > 1
b) ∀n > 1, det(B n ) = det(B)n = (−3)n .
−1 1 −3 −2
c) Since det(B) = −3 6= 0 then B is invertible. B = det(B)
.
0 1
1 1 1 2
0 1 0 −3
d) Let C =
0
.
0 1 2
0 0 0 3
i. The matrix C is in row echelon form, since: C 6= (0) and,
The number of non zero rows of C equal 4, and they are the first four rows.
∀1 6 i 6 4, the leading entries are: c11 = 1, c22 = 1, c33 = 1, c44 = −3, and 1 < 2 < 3 < 4.
ii.
1 1 1 2 | 1 0
0 0
0 1 0 −3 | 0 1
0 0
(C|I4 ) −→R4 → 1 R4 −→R2 →R2 +3R4 ,R3 →R3 −2R4
3 0 0 1 2 | 0 0
1 0
0 0 0 1 | 0 0 13
0
1 1 1 2 | 1 0 0 0 1 0 0 0 | 1 −1 −1 −1
0 1 0 0 | 0 1 0 1 0 1 0 0 | 0 1 0 1
−2 −→R1 →R1 −R2 −R3 −2R4 −2
0 0 1 0 | 0 0 1 3
0 0 1 0 | 0 0 1 3
1 1
0 0 0 1 | 0 0 0 3
0 0 0 1 | 0 0 0 3
1 −1 −1 −1
0 1 0 1
So C −1 = 0 −2 .
0 1 3
1
0 0 0 3
iii. Tr(C −1 ) = the sum of all diagonal entries of the matrix C −1 = 10
3