Professional Documents
Culture Documents
(` +`)
1
if ` +` is nonsingular
0 if ` +` is singular
In general, (` +`)
1
6= `
1
+`
1
and so 1 is not linear.
An Example: For
` =
1 2
3 4
. ` =
1 0
1 1
(` +`)
1
=
2 2
4 5
1
=
1
2
5 2
4 2
and `
1
+`
1
=
1
2
4 2
3 1
1 0
1 1
=
1
2
2 2
1 1
Solution 2
(a) Since 1(0) = 0. 0 2 Im1 and so Im1 is non empty.
Let
1
.
2
2 Im1. There exists r
1
. r
2
2 \ such that
1(r
1
) =
1
and 1(r
2
) =
2
Now,
/
1
1
+/
2
2
= /
1
1(r
1
) +/
2
1(r
2
)
= 1(/
1
r
1
) +1(/
2
r
2
)
= 1(/
1
r
1
+/
2
r
2
)
So /
1
1
+/
2
2
2 Im1 and hence Im1 is a subspace of \.
(b) Let 1 : \ ! \ be a linear transformation.
(i) Prove that dim\ = dim(ker 1) + dim(Im1)
Let dim\ = : and dim(ker 1) = /. If / = : then ker 1 = \ and
so 1(r) = 0 for all r 2 \. Hence Im1 = f0g and dim(Im1) = 0.
So the result holds when / = :.
Now suppose 1 < / < : and let fr
1
. r
2
. . r
k
g be basis for ker 1.
We may extend this basis to forma basis for \. fr
1
. r
2
. . r
k
. r
k+1
. r
n
g.
Let 2 Im1. There exists r 2 \ such that 1(r) = and since
r 2 \ , r may be written as
r =
n
X
i=1
c
i
r
i
M20B Solution to Problem Paper 04 3
Therefore
= 1(r)
= 1(c
1
r
1
+c
2
r
2
+ +c
k
r
k
+c
k+1
r
k+1
+ +c
n
r
n
)
= c
1
1(r
1
) +c
2
1(r
2
) + +c
k
1(r
k
) +c
k+1
1(r
k+1
) + +c
n
1(r
n
)
= c
k+1
1(r
k+1
) + +c
n
1(r
n
)
Hence 1(r
k+1
). 1(r
k+2
). . 1(r
n
) span Im1.
We now show that this set is linearly independent.
Suppose
c
k+1
1(r
k+1
) +c
k+2
1(r
k+2
) + +c
n
1(r
n
) = 0
then
1(c
k+1
r
k+1
+c
k+2
r
k+2
+ +c
n
r
n
) = 0
and so c
k+1
r
k+1
+c
k+2
r
k+2
+ +c
n
r
n
2 ker 1 and therefore it
may be expressed as
c
k+1
r
k+1
+c
k+2
r
k+2
+ +c
n
r
n
= ,
1
r
1
+,
2
r
2
+ +,
k
r
k
and so
,
1
r
1
+,
2
r
2
+ +,
k
r
k
c
k+1
r
k+1
c
k+2
r
k+2
c
n
r
n
= 0
Since fr
1
. r
2
. . r
k
. r
k+1
. r
n
g is a basis for \.
,
1
= ,
2
= = ,
k
= c
k+1
= c
k+2
= c
n
= 0
So the vectors
1(r
k+1
). 1(r
k+2
). . 1(r
n
)
are linearly independent.
We conclude that
dim(Im1) = : /
and so
dim\ = dim(ker 1) + dim(Im1)
(ii) If 1 is one-one, ker 1 = f0g or dim(ker 1) = 0 and dim\ =
dim(Im1).
Conversely, if dim\ = dim(Im1) then from the above result,
dim(ker 1) = 0 or ker 1 = f0g implying that 1 is one to one.
M20B Solution to Problem Paper 04 4
(c) To nd ker 1 we solve
0
@
4 2 2
2 3 1
1 1 2
1
A
0
@
r
.
1
A
=
0
@
0
0
0
1
A
1
1
$ 1
3
0
@
1 1 2
2 3 1
4 2 2
1
A
0
@
r
.
1
A
=
0
@
0
0
0
1
A
1
2
! 1
2
+ 21
1
1
3
! 1
3
+ 41
1
0
@
1 1 2
0 5 5
0 6 6
1
A
0
@
r
.
1
A
=
0
@
0
0
0
1
A
1
3
! 51
3
61
2
0
@
1 1 2
0 5 5
0 0 0
1
A
0
@
r
.
1
A
=
0
@
0
0
0
1
A
Put . = t to get = t and r = t
ker 1 =
8
<
:
0
@
t
t
t
1
A
: t 2 R
9
=
;
Since dim(ker 1) = 1, 1 is not 1 : 1.
Since dim\ = dim(ker 1) + dim(Im1). dim(Im1) = 2
Solution 3
(a) Since
1
=
0
@
r + 3
r
2r + 5
1
A
1
1
0
=
0
@
1
1
2
1
A
= 1
0
@
1
0
0
1
A
+ 1
0
@
0
1
0
1
A
+ 2
0
@
0
0
1
1
A
and 1
0
1
=
0
@
3
1
5
1
A
= 3
0
@
1
0
0
1
A
1
0
@
0
1
0
1
A
+ 5
0
@
0
0
1
1
A
Therefore the matrix of transformation is
=
1 1 2
3 1 5
1 0 0
0 1 0
Solution 4
(a) We choose
1
= (1. 1. 0. 1). We next choose
2
such that
1
2
= 0
and
2
= c(1. 1. 0. 1) + (2. 0. 0. 1)
2
1
= 0 = c(1. 1. 0. 1) (1. 1. 0. 1) + (2. 0. 0. 1) (1. 1. 0. 1)
0 = 3c + 1
c =
1
3
2
=
1
3
(1. 1. 0. 1) + (2. 0. 0. 1)
= (
5
3
.
1
3
.
0
3
.
4
3
)
or take
2
= (5. 1. 0. 4)
We choose
3
= c
1
+,
2
+r
3
such that
3
is orthogonal to both
1
and
2
3
1
= 0 = c(1. 1. 0. 1) (1. 1. 0. 1) +,(5. 1. 0. 4) (1. 1. 0. 1)
+(0. 0. 1. 0) (1. 1. 0. 1)
So 0 = 3c + 0 + 0
c = 0
3
2
= 0 = c(1. 1. 0. 1) (5. 1. 0. 4) +,(5. 1. 0. 4) (5. 1. 0. 4)
+(0. 0. 1. 0) (5. 1. 0. 4)
0 = 0 + 42, + 0
, = 0
Therefore
3
= 0(1. 1. 0. 1) + 0(5. 1. 0. 4) + (0. 0. 1. 0)
= (0. 0. 1. 0)
M20B Solution to Problem Paper 04 6
An orthogonal basis for this space is
1 = f(1. 1. 0. 1). (5. 1. 0. 4). (0. 0.1. 0)g
An orthonormal basis is
1 = f(
1
p
3
.
1
p
3
. 0.
1
p
3
). (
5
p
42
.
1
p
42
. 0.
4
p
42
). (0. 0. 1. 0)g
(b) Since r and are orthogonal
r = 0
1
p
2
. 0.
1
p
2
c.
1
p
2
. /
=
c
p
2
/
p
2
and so c = /.
Since is a unit vector
c
2
+
1
2
+c
2
= 1
Solving
2c
2
=
1
2
c =
1
2
Solution pairs are
(
1
2
.
1
2
) and (
1
2
.
1
2
).
Please report all typographical errors to: sammcdan@yahoo.com
Thanks,
S.A.M