0% found this document useful (0 votes)
9 views

TD ch1

The document contains 7 exercises involving matrix algebra. The exercises involve properties of matrices such as invertibility, transposes, powers, and nilpotent matrices. Key steps are shown to prove various matrix equations and properties.

Uploaded by

mohamada.lakis1
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
9 views

TD ch1

The document contains 7 exercises involving matrix algebra. The exercises involve properties of matrices such as invertibility, transposes, powers, and nilpotent matrices. Key steps are shown to prove various matrix equations and properties.

Uploaded by

mohamada.lakis1
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 8

Exercise 1

0 1
5 3 0
1 1 3
A= and B = @ 2 1 1 A
2 0 1
1 0 4
0 1
5 3 0
1 1 3 @ 10 2 11
AB = 2 1 1 A=
2 0 1 11 6 4
0 1 100 4 1 0 1
5 3 0 5 3 0 19 18 3
B 2 = B:B = @ 2 1 1 A@ 2 1 1 A = @ 13 5 3 A
1 0 4 1 0 4 1 3 16
BA not de…ne
A2 not de…ne 0 1
1 2
A, transpose: @ 1 0 A
0 3 1
1 0 1
1 2 5 1 5
@ A 1 1 3 @
T
A A= 1 0 = 1 1 3 A
2 0 1
0 3 1 10 1 05 3 10 1
5 3 0 1 2 2 10
BAT = @ 2 1 1 A@ 1 0 A = @ 6 5 A
1 0 40 3 11 11 2
1 2
1 1 3 @ 11 5
AAT = 1 0 A=
2 0 1 5 5
3 1

Exercise 2 0 1
1 1 1
A=@ 0 1 1 A
0 0 1

B = A I3
0 1 0 1
1 1 1 1 0 0
= @ 0 1 1 A @ 0 1 0 A
0 0 1 0 0 1
0 1
0 1 1
B = @ 0 0 1 A
0 0 0

1
0 1 0 1 0 1
0 1 1 0 1 1 0 0 1
B2 = @ 0 0 1 A : @ 0 0 1 A = @ 0 0 0 A
0 0 0 0 0 0 0 0 0
0 1 0 1
0 0 1 0 1 1
B3 = @ 0 0 0 A:@ 0 0 1 A
0 0 0 0 0 0
0 1
0 0 0
= @ 0 0 0 A
0 0 0
then B n = 0 for n 3
A = B + I3 then

n
X
n
n
A = (B + I3 ) = Cnk I3n k B k
k=0
X
n
= Cnk B k
k=0

X
n
n
A = Cnk B k = Cn0 B 0 + Cn1 B 1 + Cn2 B 2
k=0
n (n 1) 2
= I3 + nB + B
0 1 2 0 1 0 1
1 0 0 0 1 1 0 0 1
n (n 1) @
= @ 0 1 0 A + n@ 0 0 1 A + 0 0 0 A
2
0 0 1 0 0 0 0 0 0
0 1
1
1 n n + 2 n (n 1)
An = @ 0 1 n An 2 N
0 0 1

Exercise 3 A + AT = B
T
BT = A + AT
= AT + A
= A + AT
= B

2
1
so B is symetric so 2
A + AT
A AT = C
T
CT = A AT
= AT A
= A + AT
= C
1
so C is antisymetric so 2
A AT

1 1
A = A + AT + A AT
2 2
1 1 1 1 T
= A + AT + A A
2 2 2 2
= A
A = B+C
Exercise 4 A = (aij ) and AT = (aji )

1. Suppose that AAT = 0 et A 6= 0 then AT 6= 0


AAT = C
X
n
cij = aik bkj
k=1
Xn
= aik ajk
k=1

A 6= 0 then 9 apq 6= 0
X
n
cpp = apk apk
k=1
Xn
= a2pk
k=1
= a2pq + nbr
|{z}
0
6= 0
contradiction

3
2.

D = BA
DT = (BA)T = AT B T
BAAT = 0 ) BAAT B T = 0
) BA (BA)T = 0
) DDT = 0
) D=0
) BA = 0:

3 2
Exercise 5 A = .
1 1

1. Prove that A2 4A + I2 = 0.

11 8
A2 =
4 3

3 2 12 8
4 =
1 1 4 4
1 0 0 0
A2 4A + =
0 1 0 0

2. Deduce that A is invertible and determine A 1 .

A2
4A + I2 = 0
A2 4A = I2
A ( A + 4I2 ) = I2

then A is invertible and


1
A = A + 4I2
3 2 1 0
= +4
1 1 0 1
1 2
=
1 3

4
Exercise 6 0 1
0 1 1
A=@ 4 3 4 A
3 3 4

1. Prove that A2 = I3 .
0 1 0 1
0 1 1 0 1 1
A2 = @ 4 3 4 A @
: 4 3 4 A
3 3 4 3 3 4
0 1
1 0 0
= @ 0 1 0 A
0 0 1
= I3

2. Deduce that A is invertible and calculate A 1 .

A2 = I3
1
Then A is invertible and A = A.

3. Determine (AT ) 1 .

(AT ) 1
= (A 1 )T
T
= A
0 1
0 4 3
= @ 1 3 3 A
1 4 4

Exercise 7 Let A be a square matrix of order n that is nilpotent, i.e there


exists an integer p such that Ap = 0. Prove that the matrix In A is invertible
and give its inverse.
B = In A

5
p 1
X
Bp 1
= (In A)p 1
= Cpk 1 Inp 1 k
Ak
k=0
p 1
X
= Cpk 1 Ak
k=0

= Cp0 1 In + Cp1 1 A + Cp2 1 A2 + ::: + Cpp 11 Ap 1

= In + Cp1 1 A + Cp2 1 A2 + ::: + Ap 1

Inp Ap = (In A) Inp 1 + Inp 2 A + A2 + A3 + ::: + Ap 1

In = (In A) In + A + A2 + A3 + ::: + Ap 1
In = (In A) (In A) 1
(In A) 1 = In + A + A2 + A3 + ::: + Ap 1

Exercise 8 0 1
1 2 3 1
A=@ 2 1 2 2 A
3 1 2 3

0 1
1 2 3 1 !
@ 2 1 2 2 A R2 ! R2 2R1
3 1 2 3 R3 ! R3 3R1
0 1
1 2 3 1 !
@ 0 3 4 4 A
0 7 7 6 R3 ! 3R3 7R2
0 1
1 2 3 1
@ 0 3 4 4 A r.e.f of A
0 0 7 10

rank(A) = 3

Exercise 9
0 1 0 1
1 2 3 1 1 1
B 2 1 0 CC B 1 x 1 x C
A=B
@ 2 ; B=B C
1 3 A @ 1 2x 1 x + 1 A
1 4 2 0 x x 1

6
0 1
1 2 3 !
B 2 1 C
0 C R2 ! R2 2R1
B
@ 2 1 3 A R3 ! R3 + 2R1
1 4 2 R4 ! R4 + R1
0 1
1 2 3 !
B 0 3 6 CC
B
@ 0 3 3 A R3 ! R3 + R2
0 6 5 R4 ! R4 + 2R2
0 1
1 2 3 !
B 0 3 6 CC
B
@ 0 0 3 A
0 0 7 R4 ! 3R4 7R3
0 1
1 2 3
B 0 3 6 C
B C r.e.f of A
@ 0 0 3 A
0 0 0

rank(A) = 0
0 1
1 1 1
B 1 x 1 !
B x C C R2 ! R2 + R1
@ 1 2x 1 x + 1 A
R3 ! R3 + R1
0 x x 1
0 1
1 1 1 !
B 0 x x 1 C
B C
@ 0 2x x A R3 ! R3 2R2
0 x x 1 R4 ! R4 R2
0 1
1 1 1
B 0 x x 1 C
B C=T
@ 0 0 x+2 A
0 0 0

let =1 x ( x + 2)

F if 6= 0 then T is a r.e.f. of B and rank(B) = 3

7
F if x = 2 then 0 1
1 1 1
B 0 2 1 C
T =B
@ 0
C
0 0 A
0 0 0
its a r.e.f of B and rank(B) = 2

F f x = 0 then
0 1
1 1 1
B 0 0 1 C
T = B
@ 0
C
0 2 A
0 0 0
0 1
1 1 1
B 0 !
B 0 1 C
C
@ 0 0 2 A
R3 ! R3 + 2R2
0 0 0
0 1
1 1 1
B 0 0 1 C
B C
@ 0 0 0 A
0 0 0

its a r.e.f of B and rank(B) = 2

You might also like