Past Question Paper With Answers On Linear Algebra 1 MAT 213 - Theory

Download as docx, pdf, or txt
Download as docx, pdf, or txt
You are on page 1of 20

Past Question Paper with answers on Linear Algebra 1 MAT

213
1. A square (n × n) matrix A is said to be orthogonal if it satisfies the condition
A . A T = A T . A=I n
(a). Show that the following (3 ×3)- matrices are each orthogonal

[ ] [ ] [ ]
4 7 −4 cosθ sin θ 0 cos 2θ sin 2θ 0
1
A= 9 1 4 8 , B= −sin θ cos θ 0 , C = sin θ −cos2 θ 0
8 −4 1 0 0 1 0 0 1

(b). Let A and B be any (n × n) -matrices


T
A(¿ B) is said to be symmetric if A=A ; A ( or B ) is said to be skew-symmetric if
A=−A T , Show that if A is any square matrix, then A+ A T is symmetric, and
A−A T is skew-symmetric.

2. (a) Let

A=¿ [ a b c ¿ ][ 0 1 2 ¿ ] ¿ ¿¿
¿
det ( A )∧det(B)
(i) Find
(ii) Show that det ( A B )=det ( A ) . det (B)

(b). Write the following system of linear equations in matrix form:

2x−y = 1¿} x+3y+z = 0¿}¿¿ ( A) ¿


(c). State the (4) properties of Transpose operation in Matrix.

3. (a). Define a vector space over a field K .


(b). Give and explain 3 examples of Vector Space.

4. (a) Reduce the Matrix 𝐴 to row canonical form and determine its rank.

( )
5 −9 6
A= 0 2 3
0 0 7

(b) Suppose B= [ 2 x−3


4 x +2
x +1]is symmetric. Find the value x and B.

5(a)(i) Define a field?


(ii) Define a Vector space (over a field κ ) and list the properties associated with its definition
(iii) Given A= (53 1
−2 )
& B=
2 0
4 3 ( )
, show that the matrix multiplication is not
1
commutative 17 marks
2
6(a)(i). When is a vector said to be linearly independent or linearly dependent? 1
(ii) Define a basis and dimension of a Vector space. 17 marks
2
(b) Let A= [ 1 −3
−2 4 ] 5
[]
and X = . Compute (i) ( AX )T (ii) X T A T (iii) X T X
3

7(a). Given v 1 & v 2 in a Vector space V , let H=span { v 1 , v 2} . Show that H is a Subspace of V
.
(b). Let H be the set of all vectors of the form ( a−3 b , b−a , a , b ) where a , b are arbitrary
scalars, that is, let H= { ( a−3 b , b−a , a ,b ) ; a∧b∈ R } .
1
Show that H is a Subspace of R4 . 17 marks
2
8(a)(i). Define a matrix? (ii) List four types of matrices you know.

(b)(i) Given A= (30 1 2


5 −2 ) (
, B=
−1 4 1
2 −3 1 )
,find (i) 2 A−3 B(ii) A+2 B
(ii) Define T : R 2 → R 2 by the formula

( )
3x−y
T
x
y
= ()y
x
1
Find the standard matrix for T . 17 marks
2

9(a)(i) When is a matrix said to be invertible(nonsingular).


Write short notes on the following
(ii) Symmetric and Skew-symmetric Matrices (iii) Orthogonal Matrices
(iv) Normal Matrices
(b) Find the inverse of A= [ 42 35 ] & B=[ 12 36] 17
1
2
marks

10(a) Define a Linear Transformation (Linear Mapping).


(b) Show that T : E 2 → E1 be defined by
T ( ( x 1 , x 2 ) )=x 1 + x 2
2 2

is not linear?
(c) Do the following matrices have inverse and why?
A= ( ) 2 5
1 3 (& B= )
3 −5
−1 2
17
1
2
marks

11(a)(i) Define a Vector space and list the properties associated with its definition
(ii) Define a Subspace?
(iii) Given A= (53 1
−2 )
& B=
2 0
4 3 ( )
, show that the matrix multiplication is not
commutative
12(a)(i). When is a vector said to be linearly independent or linearly dependent?
(ii) Define a basis and dimension of a Vector space.

(b) Let A= [ 1 −3
−2 4 ] 5
[]
and X = . Compute (i) ( AX )T (ii) X T A T (iii) X T X
3

13(a). Given v 1 & v 2 in a Vector space V , let H=span { v 1 , v 2} . Show that H is a Subspace of
V.
(b) Is the set H of all matrices of the form
2a
[ b
3 a+b 3 b ]
a subspace od M 2 ×2 ? Explain.

14(a)(i). Define a matrix? (ii) List four types of matrices you know.

(b)(i) Given A= (30 1 2


5 −2 ) (
, B=
−1 4 1
2 −3 1 )
,find (i) 2 A−3 B(ii) A+2 B
(ii) Prove the Lemma: Let V be a vector space over a field Ϝ , and take
S= { α 1 u1 +…+ α m um :α 1 , … α m ∈ Ϝ } then U ≤ V .

15(a)(i) When is a matrix said to be invertible(nonsingular).


Write short notes on the following
(iii)Symmetric and Skew-symmetric Matrices (iii) Orthogonal Matrices
(v) Normal Matrices
(b) Find the inverse of A= [ 42 35 ] & B=[ 12 36]
16(a) Define a Linear Transformation (Linear Mapping).
(b) Consider the function T : P2 → P2 which is defined by T ( f ( x ) )=f (x+ 1) . Use the
standard basis 1 , x , x 2 for P2.
(c) Do the following matrices have inverse and why?
A= ( )
2 5
1 3
& B= (3 −5
−1 2 )
ANSWERS/ MARKING SCHEME

[ ] [ ]
4 7 −4 4 1 8
1 T
1. (a) A= 1 4 8 A = 7 4 −4
9
8 −4 1 −4 8 1

[ ]
4.4 +7.7+ (−4 ) . (−4 ) 4.1+7.4+ (−4 ) .8 4.8+7 (−4 )−4.1
T 1
A. A = 1.4 +4.7 +8.−4 1.1+ 4.4+ 8.8 1.8+ 4.−4+ 8.1
81
8.4±4.7+1.−4 8.1±4.4 +1.8 8.8±4.4 +1.1

[ ]
16+ 49+16 4 +28−32 32−28−4
T
A . A = 4 +28−32 1+16+64 8−16+8
32−28−4 8−16+8 64 +16+1

[ ][ ]
81 0 0 1 0 0
T 1
A. A = 0 81 0 = 0 1 0 (3 mrks)
81
0 0 81 0 0 1

[ ] [ ]
cos θ sinθ 0 cos θ −sinθ 0
T
B= −sin θ cos θ 0 , B = sinθ cos θ 0
0 0 1 0 0 1

B.B =
T
[−sin θ . cos θ+ ¿ coscosθ . θsinθ.cos+0.0
θ +sin θ . sinθ+ 0.0
¿−sinθ .−sin θ+cos θ . cos θ+ 0.0
cos θ−sinθ+ sin θ .cos θ+0.0 cos
¿
[ ]
cos2 θ+sin2 θ+0 −cos θsinθ +cos θ sinθ +0 0+0+0
¿ −sin θ cos θ+sin θcosθ+0 2
+sin θ+cos θ
2
0+0+0
0+0+0 0+ 0+0 0+0+1

[ ]
1 0 0
¿ 0 1 0 (3mrks)
0 0 1

[ ] [ ]
cos 2θ sin 2 θ 0 cos 2 θ −sin θ 0
T
C= sin θ −cos 2θ 0 , C = sin 2θ −cos 2θ 0
0 0 1 0 0 1

T
C.C =
[ cos 2 θ . cos 2θ+ sin¿ 2θ . sin 2 θ+0.0 cos 2 θ .sin θ+ sin 2θ .−cos 2 θ+0.0 cos 2 θ .0+sin 2θ .0+ 0.1
0.cos 2θ+ 0.sin 2 θ+1.0 ¿
0.0+ 0.

[ ]
cos2 2θ +sin2 θ 0 0
T
C.C = 0
2 2
sin θ+ cos θ 0
0 0 1

[ ]
1 0 0
T
C.C = 0 1 0 (3mrks)
0 0 1

(1b)
A is any square matrix

A=
[ a 11 a12
a 21 a22 ] [
T a a
, A = 11 21
a12 a22 ]
T
A+ A =
[ a11 + a12 a12+ a21
a21 +a22 a22+ a22 ]
Let A+ A T =B

B=
[ a11 + a11 a12+ a21
a12+ a21 a22+ a22 ]
T
B =
[ a11 +a 11 a12+ a21
a12 +a 21 a22 +a22 ] (3mrks)

hence
B is symmetric B=BT
A−A =
T
[ a11−a11 a 12−a21
a 12−a21 a 22−a22 ]
¿
[ 0
a12−a21
a12−a21
0 ]
let A−A T =C

C =
T
[ 0
a21−a12
a21−a12
0 ] (3 mrks)

C is skew-symmetric C=C T

(2a(i))

[ ] [ ]
a b c 2 3 −4
A= 0 1 2 , B= 1 2 2
0 0 d 1 2 1

det ( A )=a
[ 10 2d ]−b [ 00 2d] +c [ 00 10]
¿ a [ d .1−2.0 ]−b [ 0.d −0.2 ] +c [ 0.0−0.1 ]

¿ a ( d −2 )−b ( 0−0 ) + c ( 0−0 )

¿ a ( d −0 )

¿ ad (3mrks)

det ( B )=2
[ 22 11]−3[ 11 11]+ (−4 ) [ 11 22]
¿ 2 [ 2.1−2.1 ] −3 [ 1.1−1.1 ] +4 [ 2.1−2.1 ]

¿ 2 ( 2−2 )−3 ( 1−1 )−4 ( 2−2 )


¿0 (3mrks)

(2(a)ii)

[ ][ ]
a b c 2 3 −4
AB= 0 1 2 . 1 2 2
0 0 d 1 2 1
[ ]
a ×2+b × 1+c × 1 a ×3+ b ×2+c ×2 a ×−4 +b ×1+c ×1
AB= 0 ×2+1 ×1+2 ×1 0 × 3+1× 2+2× 2 0 ×−4 +1× 1+2× 1
0× 2+0 ×1+d ×1 0 ×3+0 ×2+ d × 2 0 ×−4+0 ×1+ d × 1

[ ]
2 a+ b+c 3 a+2 b+2 c −4 a+ b+c
AB= 0+1+2 0+2+ 4 0+1+2
0+0+ d 0+0+ 2d 0+ 0+d

[ ]
2 a+ b+c 3 a+2 b+2 c −4 a+ b+c
AB= 3 6 3
d 2d d

det ( AB ) =2 a+b+ c
[26d 3d ]−( 3 a+ 2b +2 c ) [ 3d 3d ]+(−4 a+ b+c ) [ 3d −6d ]
det ( AB ) =2 a+b+ c [ 6 d−6 d ] −( 3 a+2 b+2 c ) [ 3 d−3 d ] + (−4 a+b+ c ) [ 6 d−6 d ]
¿ 0−0+0

det ( AB)=0

det A . det B=¿ ( a . d−2d ) .0 ¿

∴ det ( AB )=det A . det B

0=0 (6mrks)

(2b)

2 x − y +0 z=1
x+ 3 y+ z =0 (4mrks)
0 x +2 y+ 3 z=−2

[] [ ] [] [ ]
2 −1 0 1
1 x+ 3 y + 1 z= 0
0 2 3 −2

(2c)
Four properties on Transpose operation in matrix form:
( A+ B )T = AT + BT
T
( AT ) =A
( KA )T =K A T
( AB )T = A T B T (4mrks)
TOTAL 20 MARKS

(3a)
A vector space is a collection V , of vectors and two operations ( +. ) such that the following
axioms holds for x , y , z ∈ V and α , β , γ ∈ R
(i) x+ y∈V
(ii) x + y= y + x
(iii) x + ( y + z )=( x + y ) + z
(iv) 0 ∈V where 0+ z =x+ 0=z
(v) ∀ x ∈ V ,∃ a (−x ) such that x + (−x )=0
(vi) αx ∈ V
(vii) α ( x + y ) =αx+αy
(viii) ( α + β ) x=αx+ βx
(ix) α ( βx ) =( αβ ) x
(x) 1. x=x .1=x

We say that ( V ,+, . ) is a vector space (10 mrks)

(3b)

(4a)

( )( )( )( )( )( )
5 −9 6 5 −9 6 5 −9 0 5 −9 0 5 0 0 1 0 0
A= 0 2 3 0 2 3 0 2 0 0 1 0 0 1 0 0 1 0
0 0 7 0 0 1 0 0 1 0 0 1 0 0 1 0 0 1

(4b)
Set the symmetric element x +2 and 2 x−3 equal to each other, obtaining
x +2=2 x−3
x−2 x=−3−2

x=5.
Hence, B= (47 76)
5(a)(i)

A field is a set of elements in which a pair of operations such as addition and


multiplication is defined +: F × F → F∧¿: F × F → F 2 marks
(ii)
A vector space is a non-empty set V of objects, called vectors which are defined over

a field κ. 2 marks
(iii)
For any vector u , v , w ∈V ,∧k ∈κ , the following axioms holds
Vector addition
[ A1 ] u+v ∈V
[ A2 ] u+v =v +u
[ A3 ] u+ ( v+ w ) =( u+v ) + w
[ A 4 ] u+ 0=u
[ A5 ] u+ (−u ) =(−u+u ) =0 9 marks

Vector Multiplication
[ M 1 ] αu ∈V [ M 2 ] k ( u+ v )=ku +kv

[ M 3 ] ( a+b ) u=au+bu
[ M 4 ]=( αβu )=αβ ( u )
[ M 5 ] 1 v=v

(iii)

(53
A=
1
−2) ( )
, B=
2 0
4 3
AB= ( 53 −21 )( 24 03)=(3(2)+(−2)
5(2)+(1)4
4
5(0)+1 (3)
3(0)+(−2)3 )
AB= (−2 −6 )
14 3
4
1
2
marks

BA= ( 24 03)(53 −21 )=( 2(5)+ 0(3)


4(5)+3(3)
2(1)+0(−2)
4 (1)+3 (−2) )
BA= (1029 −22 )
Since the matrix multiplication AB≠ BA , it’s not commutative.

6(a)(i)
A set of vectors { v 1 , v2 , … , v m } in V are linearly independent if the vector equation
x 1 v 1+ x 2 v 2 +…+ x m v m=0 has trivial solution, x 1=x 2=… x m=0 . Hence if only one possible
solution of the vector equation, it is linearly independent.
The same set of vectors are linearly dependent if there exist a scalar a 1 , a2 , … am in κ,
not of them are zero such that
1
a 1 v1 + a2 v 2+ …+a m v m=0 2 Marks
2

or
Two vectors v 1∧v 2 are linearly dependent if one of them is a multiple of the other.

7(a)(ii)
Basis
Defn 1
Let V be a vector space. Then the subset b={ v 1 , v 2 , … , v n } of V is said to be a basis for
(or of) V if
(a) B is linearly independent set of vectors & (b) B spans V (i.e.) V =lin ( B )
Defn 2
B= { v 1 , v 2 , … , v n } is a basis of V if and only if any v ∈ V is a unique linear combination
of v 1 , v 2 , … v n. 3 Marks
Dimension: The number of n vectors in a finite basis of a vector space V is the
dimension of V & denoted as dim(V). Eg. The vector space V = { 0 } is defined to have
dimension 0 3 marks

A= (−21 −34 ) , X =(53).


A =
T
(−31 −24 ) , X =( 5 T
3 ).

(i) ( AX ) =
T
(−21 −34 )(53)=( 1(5)+
(−2)5+¿ 4 (3) ) ( 2 )
¿(−3)(3) −4
= 3 marks

( )
( ii ) X T A T =( 5 3 ) 1 −2 =( 5 ∙ 1+3 ∙(−3) 5(−2)+3 ∙ 4 )=(−4 2 ).
−3 4
3 marks

T 5
()
(iii) X X= 3 ( 5 3 )= ( 5∙ 5+¿ 3 ∙3 )=(34). 3 Marks

(8)(a)
H ⊆ V needs satisfy (non-empty set) needs satisfy three axioms
1
(a) 0 ∈V 0 ∈ H (b) u , v ∈ H , u+ v ∈ H (c) u ∈ H , k ∈ κ , ku ∈ H 2 marks
2

Therefore
Let u=s 1 v 1+ s 2 v 2 and w=t 1 v 1+ t 2 v 2
0=0 v 1 +0 v2 2 marks
u+ w=( s 1 v 1+ s 2 v 2 ) + t 1 v 1 +t 2 v 2

¿ ( s1 +t 1 ) v 1+ ( s 2 +t 2 ) v 2 4 marks
∴ u+w ∈ H
cu=c ( s 1 v 1+ s 2 v 2 )=( c s1 ) v 1 + ( c s 2 ) v 2 4 marks
cu ∈ H

H is a subspace of V

(b)
[ ][][]
a−3 b 1 −3
b−a −1 1
=a +b
a 1 0
b 0 1

H=span { v 1 , v 2} . H is a subspace of R4 by theorem? 5 marks

9(a)(i)
A Matrix is a rectangular array of numbers or symbols represented by

( )
a11 a12 ⋯ a1 n
A∨aij
a21 a22 ⋯ a2 n 1
4 marks
⋮ ⋮ ⋮ ⋮ 2
am1 am2 ⋯ a mn

We say matrix A has m ×nsize, m rows and n columns. Also, the notation a ij has
subscript i representing ithrow and j representing jth column, called ( i , j ) entry.
(a)(ii)
Symmetric Matrices, Orthogonal Matrices, Normal Matrices, Zero Matrix, Identity
Matrix 4 marks
(b)(i)

A= (30 1 2
5 −2 ) (
, B=
−1 4 1
2 −3 1 )
2 A−3 B=2 (30 51 −22 )−3(−12 −34 11)
¿( )−(
6 −9 9 )
6 2 4 −3 −10 1
0 10 −4

¿(
−6 19 −7 )
9 −10 1
7 marks

A+2 B=(
0 5 −2 ) ( 2 −3 1 )
3 1 2 −1 4 1
+2

¿(
0 5 −2 ) ( 4 −6 2 )
3 1 2 −2 8 2
+

¿(
4 −1 0 )
1 9 4

(ii)
( ) ()
3 ( 1 )−0 3
T ( e1 ) = 0 = 0 Notice that e 1=( 1 , 0 ) basis of the matrix T
1 1

( )( )
3 ( 0 )−1 −1
T ( e2 ) = 1 = 1 e 2=( 0 , 1 ) basis of the matrix T
0 0

( )
3 −1
A= 0 1 T ={ e 1 , e2 } and x∧ y are the coordinate in e 1 ,e 2 2 marks
1 0

10(a)(i)
An n × n matrix A is said to be invertible or nonsingular if there exist a matrix B such
that
AB=BA=I 3 marks
(ii)
1
A matrix A is symmetric if AT = A , while skew-symmetric if AT =− A 2 marks
2

( ) ( )
2 −3 5 2 −3 5
T
Example A= −3 6 7 , A = −3 6 7 Symmetric
5 7 −8 5 7 −8

( )
0 3 −4
A= −3 0 5 ,Skew-symmetric
4 −5 0

(iii)
A real matrix (square matrix) A is orthogonal if AT = A−1 that is AT A=I 2 marks

( )
1/9 8/9 −4/9
A= 4 /9 −4/9 −7 /9
8/9 1/9 4/9

(iv)
A real matrix A is normal if it commutes with its transpose AT i.e. A AT = AT A
2 marks
(b)
( )
−5 3
A =
−1
( )
2 3
=
1 5 −3
= (
1 5 −3
= 2 2 ) ( ) 4 marks
4 5
det
4 5 ( )
2 3 −4 2 −2 −4 2
2 −1

Matrix is singular, hence only be inverted if it is non-singular.


1 3
( )
That is det 2 6 ≠ 0 4 marks

11(a)
Suppose that V and W are vector spaces. A function T :V → W is a linear
transformation if for all u , v ∈V & α ∈ R; the following condition exist
1. T ( u+ v )=T ( u ) +T ( v ) 6 marks
2. T ( αu ) =αT ( u )
(b)
For the equation to be a linear it must the conditions above in 6(a)(i) 1 & 2, if one fails
then it is not linear
Condition 1
T ( x + y )=T ( ( x 1 , x 2 ) + ( y 1 , y 2 ) )

¿ T ( ( x 1+ y 1 ) + ( x 2 + y 2 ) ) = ( x 1+ y 1 ) + ( x 2+ y 2 )
2 2

2 2 2 2
T ( x + y )=x 1 +2 x 1 y 1 + y 2 + x 2+2 x 2 y 2 + y 2 6 marks
2 2 2 2
T ( x ) +T ( y )=x 1+ x 2 + y 1 + y 2

T ( x + y ) ≠T ( x )+T ( y ) , T is not linear.

(c)
For a matrix to have an inverse, its determinant must not be equal to zero
det ( A ) ≠0
det ( A )=2 ( 5 )−3 ( 4 )=−2

det ( B )=1 ( 6 )−3 ( 2 )=0

[ ]
5
A−1=
[
1 5 −3
2 −4 2
= 2
3 /2
2 −1
]
, Matrix B has no inverse, because det ( B )=0 5
1
2
marks
12(a)(i)

A field is a set of elements in which a pair of operations such as addition and


multiplication is defined +: F × F → F∧¿: F × F → F
A vector space is a non-empty set V of objects, called vectors which are defined over

a field κ.
For any vector u , v , w ∈V ,∧k ∈κ , the following axioms holds
Vector addition
[ A1 ] u+v ∈V 1 mark

[ A2 ] u+v =v +u 1 mark

[ A3 ] u+ ( v+ w ) =( u+v ) + w 1 mark

[ A 4 ] u+ 0=u 1 mark

[ A5 ] u+ (−u ) =(−u+u ) =0 1 mark


Vector Multiplication
[ M 1 ] αu ∈V 1 mark[ M 2 ]
k ( u+ v )=ku +kv 1 mark
[ M 3 ] ( a+b ) u=au+bu 1 mark

[ M 4 ]=( αβu )=αβ ( u ) 1 mark

[ M 5 ] 1 v=v
(ii)
Let V be a vector space over F . A subspace of V is a non-empty set subset of V that is
closed under addition & scalar multiplication (i.e a subset U ≤ V ¿ such that
 V ≠ ∅ (V is non-empty set)
 u1 +u2 ∈V , ∀ u 1 , u2 ∈V (V is closed under addition)
 λv ∈V , ∀ u ∈ V , λ ∈ F ( U is closed under scalar multiplication)
mark
(iii)

A=(53 1
−2) ( )
, B=
2 0
4 3
AB= ( 53 −21 )( 24 03)=(3(2)+(−2)
5(2)+(1)4
4
5(0)+1 (3)
3(0)+(−2)3 ) marks

AB= (−2 −6 )
14 3
mark

BA= ( 24 03)(53 −21 )=( 2(5)+ 0(3)


4(5)+3(3)
2(1)+0(−2)
4 (1)+3 (−2) ) mark

BA= (1029 −22 ) marks

Since the matrix multiplication AB≠ BA , it’s not commutative.

12(a)(i)
A set of vectors { v 1 , v2 , … , v m } in V are linearly independent if the vector equation
x 1 v 1+ x 2 v 2 +…+ x m v m=0 has trivial solution, x 1=x 2=… x m=0 . Hence if only one possible
solution of the vector equation, it is linearly independent.
The same set of vectors are linearly dependent if there exist a scalar a 1 , a2 , … am in κ,
not of them are zero such that
a 1 v1 + a2 v 2+ …+a m v m=0 Marks
or
Two vectors v 1∧v 2 are linearly dependent if one of them is a multiple of the other.
13(a)(ii)
Basis
Defn 1
Let V be a vector space. Then the subset b={ v 1 , v 2 , … , v n } of V is said to be a basis for
(or of) V if
(a) B is linearly independent set of vectors & (b) B spans V (i.e.) V =lin ( B )
Defn 2
B= { v 1 , v 2 , … , v n } is a basis of V if and only if any v ∈ V is a unique linear combination
of v 1 , v 2 , … v n. Marks
Dimension: The number of n vectors in a finite basis of a vector space V is the
dimension of V & denoted as dim(V). Eg. The vector space V = { 0 } is defined to have
dimension 0 marks
A= (−21 −34 ) , X =(53).
A =
T
(−31 −24 ) , X =( 5 T
3 ).

(i) ( AX ) =
T
(−21 −34 )(53)=( 1(5)+
(−2)5+¿ 4 (3) ) ( 2 )
¿(−3)(3) −4
= marks

( )
( ii ) X T A T =( 5 3 ) 1 −2 =( 5 ∙ 1+3 ∙(−3) 5(−2)+3 ∙ 4 )=(−4 2 ).
−3 4
marks

T 5
()
(iii) X X= 3 ( 5 3 )= ( 5∙ 5+¿ 3 ∙3 )=(34). Marks

(14)(a)
H ⊆ V needs satisfy (non-empty set) needs satisfy three axioms

(a) 0 ∈V 0 ∈ H (b) u , v ∈ H , u+ v ∈ H (c) u ∈ H , k ∈ κ , ku ∈ H


Therefore
Let u=s 1 v 1+ s 2 v 2 and w=t 1 v 1+ t 2 v 2
0=0 v 1 +0 v2 marks
u+ w=( s 1 v 1+ s 2 v 2 ) + t 1 v 1 +t 2 v 2

¿ ( s1 +t 1 ) v 1+ ( s 2 +t 2 ) v 2 marks
∴ u+w ∈ H
cu=c ( s 1 v 1+ s 2 v 2 )=( c s1 ) v 1 + ( c s 2 ) v 2 marks
cu ∈ H

H is a subspace of V

(b)

[ 3 2aa+b 3bb]=[ 23 aa 00]+[ 0b 3bb]


¿a
[32 00]+ b[ 01 13]
Therefore H=span {[ 3 0 ] , [ 1 3 ]} & so H is a subspace of M
2 0 0 1
2 ×2
15(a)(i)
A Matrix is a rectangular array of numbers or symbols represented by

( )
a11 a12 ⋯ a1 n
A∨aij
a21 a22 ⋯ a2 n
marks
⋮ ⋮ ⋮ ⋮
am1 am2 ⋯ a mn

We say matrix A has m ×nsize, m rows and n columns. Also, the notation a ij has
subscript i representing ithrow and j representing jth column, called ( i , j ) entry.
(a)(ii)
Symmetric Matrices, Orthogonal Matrices, Normal Matrices, Zero Matrix, Identity
Matrix marks
(b)(i)

A= (30 1 2
5 −2 ) (
, B=
−1 4 1
2 −3 1 )
2 A−3 B=2 (30 51 −22 )−3(−12 −34 11)
¿(
0 10 −4 ) ( 6 −9 9 )
6 2 4 −3 −10 1

¿(
−6 19 −7 )
9 −10 1
marks

A+2 B=(
0 5 −2 ) ( 2 −3 1 )
3 1 2 −1 4 1
+2

¿(
0 5 −2 ) ( 4 −6 2 )
3 1 2 −2 8 2
+

¿(
4 −1 0 )
1 9 4
marks

(ii)
Applying the subspace test, we note
0 v ∈U , we have 0 v=0 u1 +…+0 u m ∈ U
λ v 1+ v 2 ∈ U : take v 1 , v 2 ∈U , say

V 1=α 1 u 1+ …+α m u m & V 2=β 1 u1+ …+ β m u m


Where α 1=… , α m , β 1 , … β m take λ ∈ F . Then
λ v 1+ v 2=( λ α 1 + β 1 ) u 1+ …+ ( λ α m + β m ) um ∈U so by the subspace test U ≤ V

15(a)(i)
An n × n matrix A is said to be invertible or nonsingular if there exist a matrix B such
that
AB=BA=I marks
(ii)
A matrix A is symmetric if AT = A , while skew-symmetric if AT =− A marks

( ) ( )
2 −3 5 2 −3 5
T
Example A= −3 6 7 , A = −3 6 7 Symmetric
5 7 −8 5 7 −8

( )
0 3 −4
A= −3 0 5 ,Skew-symmetric
4 −5 0

(iii)
A real matrix (square matrix) A is orthogonal if AT = A−1 that is AT A=I marks

( )
1/9 8/9 −4/9
A= 4 /9 −4/9 −7 /9
8/9 1/9 4/9

(iv)
A real matrix A is normal if it commutes with its transpose AT i.e. A AT = AT A
marks
(b)

( )
−5 3
−1
A = ( )
2 3
=
1 5 −3
(
= )
1 5 −3
= 2 2 ( ) marks
4 5
( )
det
2 3 −4 2
4 5
−2 −4 2
2 −1

Matrix is singular, hence only be inverted if it is non-singular.

( )
1 3
That is det 2 6 ≠ 0 marks
16(a)
Suppose that V and W are vector spaces. A function T :V → W is a linear
transformation if for all u , v ∈V & α ∈ R; the following condition exist
3. T ( u+ v )=T ( u ) +T ( v ) marks
4. T ( αu ) =αT ( u )
(b)
2
T ( 1 ) =1=1.1+0. x+ 0. x
2
T ( x )=x +1=1+ 1+1. x +0. x

T ( x 2 ) =( x+1 ) =1.1+ 2. x +1. x2


2

The matrix of T w.r.t t to the standard basis is the

[ ]
1 1 1
A= 0 1 2
0 0 1

(c)
For a matrix to have an inverse, its determinant must not be equal to zero
det ( A ) ≠0

det ( A )=2 ( 5 )−3 ( 4 )=−2

det ( B )=1 ( 6 )−3 ( 2 )=0

[ ]
5
−1
A =
[
1 5 −3
2 −4 2
= 2
2
] 3 /2
−1
, Matrix B has no inverse, because det ( B )=0 marks

You might also like