Assignment 5

Telechargé par Ethan Qi
Question 1:
amust be 0 as no squared terms are allowed in a linear transformation. This means
that (ab+ 1) must also be 0 which means b= 1 so (a, b) = (0,1).
Question 2:
a) A2=
0 0 1
100
01 0
A3=
1 0 0
0 1 0
0 0 1
A4=
01 0
0 0 1
1 0 0
A2020 =
01 0
0 0 1
1 0 0
b) Ais a 120 degrees rotation. This is because after applying the linear
transformation 3 times, we arrive at the same matrix. (A4=A) The rotation is around the
vector v=
1
1
1
which can be found by calculating the eigenvector with an eigenvalue
of 1 so
11 0
011
1 0 1
v= 0 which gives v=
1
1
1
.
Question 3:
Preposition 2.3.7 in the coursebook states that the composition of two linear
transformations is also an linear transformation. This means that applying one linear
transformation, f, after the other, g, (gf) or the other way around (fg) both produce
the same linear transformation.
Question 4:
Adoes not have any left inverses however it does have infinitely many right inverses
in the form of
p q
0 1
1pq
. This is because 1 0 1
0 1 0
p q
0 1
1pq
=1 0
0 1 .
1
Question 5:
If (In+A)1=InA, then that means (In+A)(InA) = In. Expanding gives
(In+A)(InA) = In+AA+A2=In+On=In. This proves that (In+A) is invertible
and that its inverse is (InA).
Question 6:
If A=AT, then AT=A. For all n×nmatrix we have det(M) = det(MT). This
means that for matrix A, det(A)= det(AT) = det(A) = 1n×det(A) = det(A)
((1)n=1 since nis odd). This means that det(A) = -det(A) so 2*det(A) = 0 which
means that det(A) = 0.
Question 7:
If we substitute In= 1, and A=x. The question becomes (1 + x)·A1= 1 so
A1=1
1+x= 1 x+x2x3+x4.... Substituting back gives the inverse for In+Ato be
(In+A)1=InA+A2A3+A4.... (In+Ais definitely invertible as an inverse exists)
2
1 / 2 100%
La catégorie de ce document est-elle correcte?
Merci pour votre participation!

Faire une suggestion

Avez-vous trouvé des erreurs dans linterface ou les textes ? Ou savez-vous comment améliorer linterface utilisateur de StudyLib ? Nhésitez pas à envoyer vos suggestions. Cest très important pour nous !