You are on page 1of 28

MATH1231/1241 Algebra Test 1 2007 S2

v1B
Full Solutions
August 15, 2016

These solutions were written by Treves Li, typed up by Brendan Trinh and edited by Henderson
Koh. Please be ethical with this resource. It is for the use of MathSoc members, so do not
repost it on other forums or groups without asking for permission. If you appreciate this
resource, please consider supporting us by coming to our events and buying our T-shirts! Also,
happy studying :)

We cannot guarantee that our working is correct, or that it would obtain full marks - please
notify us of any errors or typos at unswmathsoc@gmail.com, or on our Facebook page. There
are sometimes multiple methods of solving the same question. Remember that in the real class
test, you will be expected to explain your steps and working out.

Please note quiz papers that are NOT in your course pack will not necessarily reflect the style
& difficulty of questions in your quiz.

(i) Rewrite the set as S =



x R4 |x1 5x3 2x4 = 0 .

1.



Clearly, 0 S, since 0 5 (0) 2 (0) = 0.

Now, suppose that



x,

y S, where

x = (x1 , x2 , x3 , x4 )T and

y = (y1 , y2 , y3 , y4 )T .
Then we have the two conditions,

x1 5x3 2x4 = 0 and y1 5y3 2y4 = 0.

1
Now, for

x +

y to lie in set S, the following condition must be true,

(x1 + y1 ) 5 (x3 + y3 ) 2 (x4 + y4 ) = 0.

Considering the LHS,

(x1 + y1 ) 5 (x3 + y3 ) 2 (x4 + y4 ) = (x1 5x3 2x4 ) + (y1 5y3 2y4 )


=0+0 (using the conditions above)
= 0.

Hence,

x +

y S, and so set S is closed under addition.

Suppose that R. Now, for



x to lie in set S, the following condition must
be true,
(x1 ) 5 (x3 ) 2 (x4 ) = 0.

Considering the LHS,

(x1 ) 5 (x3 ) 2 (x4 ) = (x1 5x3 2x4 )


= (0) (using the condition above)
= 0.

Hence,

x S, and so set S is closed under scalar multiplication.

Thus, by the Subspace Theorem, S is a subspace of R4 .

(ii) There are an infinite possible number of choices. For example, we can pick a simple
one by choosing x2 = 0, x3 = 0, x4 = 1 such that x1 = 2. Thus, one non-zero element
in S is (2, 0, 0, 1).

2. For these polynomials to span P2 , every polynomial in P2 in the form b0 + b1 t + b2 t2 where


b0 , b1 , b2 R must be expressable as a linear combination of p1 (t), p2 (t) and p3 (t). Let
, , , R such that

p1 (t) + p2 (t) + p3 (t) + p4 (t) = b0 + b1 t + b2 t2 .

Substituting in the polynomials and grouping the terms, we obtain

( + 2 ) + ( + 5 + ) t + (2 + 3 5 2) t2 = b0 + b1 t + b2 t2 .

By equating the coefficients, we can obtain 4 simultaneous equations which can be written
in an augmented matrix,
1 2 1 0 b0
1 1 5 1 b1 .

2 3 5 2 b2

2
Perform the row operations R2 R2 + R1 and R3 R3 2R1 ,

1 2 1 0 b0
0 1 b0 + b1 .
4 1

0 1 3 2 2b0 + b2

Next, R3 R3 + R2 ,
1 2 1 0 b0
0 1 4 1 b0 + b1 .

0 0 1 1 b0 + b1 + b2
If we let = c where c can take any value from R, back-substitution can be performed to
find expressions for , and in terms of c, b0 , b1 , b2 . We observe that a solution always
exists for the system, and hence the polynomials form a spanning set for P2 .
Alternatively, for these polynomials to span P2 , exactly three of these polynomials must
be linearly independent. Use this fact to construct a matrix to show that three of them
are linearly independent.

3. Let , , R. For these vectors to be linearly independent, the following must only be
true for = = = 0,

1 2 1 0
4 + 5 + 3 = 0 .

2 5 1 0

Rewriting this in matrix form,


1 2 1 0
4 5 3 0 .

2 5 1 0
Row-reducing, we first perform the row operations R2 R2 4R1 and R3 R3 + 2R1 ,

1 0 2 1
0 3 1 0 .

0 9 3 0

Next, R3 R3 + 3R2 ,
1 0 2 1
0 3 1 0 .

0 0 0 0
We observe that there are infinitely many solutions for , and as not all columns are
leading, and hence the vectors are linearly dependent.

3
MATH1231/1241 Algebra Test 1 2009 S2
v2B
Answers/Hints
August 15, 2016

These answers were written and typed up by Brendan Trinh and edited by Henderson Koh.
Please be ethical with this resource. It is for the use of MathSoc members, so do not repost it
on other forums or groups without asking for permission. If you appreciate this resource, please
consider supporting us by coming to our events and buying our T-shirts! Also, happy studying
:)

We cannot guarantee that our answers are correct - please notify us of any errors or typos at
unswmathsoc@gmail.com, or on our Facebook page. There are sometimes multiple methods of
solving the same question. Remember that in the real class test, you will be expected to explain
your steps and working out.

Please note quiz papers that are NOT in your course pack will not necessarily reflect the style
& difficulty of questions in your quiz.

1. To show that this set is not a subspace of R2 , we need to show that either it is not closed
under addition or not closed under scalar multiplication. We choose to show that it is not
closed under addition in this solution.
! !
a c
Let x1 , x2 S such that x1 = and x2 = .
b d
This implies that we have

3a 2b = 1 (1)
3c 2d = 1. (2)

4
Adding (1) and (2), we obtain,

3a 2b + 3c 2d = 2
= 3 (a + c) 2 (b + d) = 2.

We know that for x1 + x2 to lie in the set S, 3 (a + c) 2 (b + d) = 1 must be true.


However, we have found that 3 (a + c) 2 (b + d) = 2 6= 1.
Therefore, as x1 + x2
/ S, the set is not closed under addition and thus cannot be a
subspace of R2 .

2. We first need to establish whether the set containing these polynomials is linearly inde-
pendent or not. Noticing that we are working with quadratic polynomials, if it is linearly
independent, there can only be at most 3 polynomials in the set. But since we are working
with 4 polynomials, the set containing these polynomials is thus linearly dependent .
Next, to find which one of these polynomials can be written as a linear combination of
the others, we let , , , R such that

p1 (x) + p2 (x) + p3 (x) + p4 (x) = 0.

Substituting in the polynomials, we obtain

1 3x + 2x2 + 3 8x + 5x2 + 1 + x 2x2 + x + 8x2 = 0.


   

Grouping together like terms,

( + 3 + ) + (3 8 + ) x + (2 + 5 2 + 8) x2 = 0.

By equating the coefficients, we see that

+ 3 + = 0

3 8 + = 0

2 + 5 2 + 8 = 0.

We set up an augmented matrix,



1 3 1 0 0
3 8 1 1 0 .

2 5 2 8 0

5
Row-reducing, we perform the operations R2 R2 + 3R1 and R3 R3 2R1 ,

1 0
3 1 0
0 1 4 1 0 .

0 1 4 8 0

Next, R3 R3 + R2 ,
1 3 1 0 0
0 1 4 1 0 .

0 0 0 7 0
As the first, second and fourth columns are leading, p1 , p2 , p4 are linearly independent
polynomials. This implies that we can express p3 as a linear combination of p1 , p2 and p4 .
So now we consider p1 + p2 + p4 = p3 . Substituting in the polynomials and grouping
like terms, we see that

( + 3) + (3 8 ) x + (2 + 5 + 8) x2 = 1 + x 2x2 .

Equating the coefficients, we have


+ 3 = 1

3 8 = 1

2 + 5 + 8 = 2.

Setting up an augmented matrix to solve for , , R,



1 3 0 1
3 8 1 1 .

2 5 8 2

Performing the row operations R2 R2 + 3R1 and R3 R3 2R1 ,



1 3 0 1
0 1 1 4 .

0 1 8 4

Next, R3 R3 + R2 ,
1 3 0 1
0 1 1 4 .

0 0 7 0

Upon back substitution, we can see that = 0, = 4 and = 1 3 (4) = 11.


Thus, 11p1 (x) + 4p2 (x) = p3 (x).

6
3. The vectors form a basis if they are linearly independent. This is true since dim R3 = 3,


and thus the number of linearly independent vectors vectors required for a basis is 3.
To check if they are linearly independent, let , , R such that

v1 + v2 + v3 = 0.

Setting this up as an augmented matrix,



1 3 0 4
1 5 3 0 .

2 4 7 0

Row-reducing by performing the row operations R2 R2 R1 and R3 R3 + 2R1 ,



1 3 4 0
0 2 1 0 .

0 10 1 0

Next, R3 R3 5R2 ,
1 3 4 0
0 2 1 0 .

0 0 6 0
Clearly, = 0 which can be back substituted to find that all the constants are 0. This
implies that v1 , v2 and v3 are linearly independent, and thus form a basis for R3 .

4. (i) False. If they are linearly dependent (or they do not span R5 ), it cannot be a basis.

(ii) True. A basis contains the smallest number of linearly independent vectors to span
the set, that is, there can only be 5 vectors in a basis for R5 .

(iii) False. 5 of the vectors must be linearly independent to span R5 .

7
MATH1231/1241 Algebra Test 1 2011 S2
v1A
Full Solutions
August 15, 2016

These solutions were written and typed up by Brendan Trinh, and edited by Henderson Koh
and Aaron Hassan. Please be ethical with this resource. It is for the use of MathSoc members,
so do not repost it on other forums or groups without asking for permission. If you appreciate
this resource, please consider supporting us by liking our Facebook page and coming to our
events. Also, happy studying :).

We cannot guarantee that our working is correct, or that it would obtain full marks - please
notify us of any errors or typos at unswmathsoc@gmail.com, or on our Facebook page. There
are sometimes multiple methods of solving the same question. Remember that in the real class
test, you will be expected to explain your steps and working out.

Please note quiz papers that are NOT in your course pack will not necessarily reflect the style
& difficulty of questions in your quiz.

1. To show that S is a subspace of R3 , we must show three things: that S is non-empty,


closed under addition and closed under scalar multiplication.

Clearly 0 = (0, 0, 0)T S as 7 (0) + 3 (0) = 0 and (0) 4 (0) = 0. So S is non-empty.

To show that it is closed under addition, let x, y S where x = (x1 , x2 , x3 )T and

8
y = (y1 , y2 , y3 )T (note x + y = (x1 + y1 , x2 + y2 , x3 + y3 )T ). That is,

7x1 + 3x2 = 0 (1)


x2 4x3 = 0 (2)
7y1 + 3y2 = 0 (3)
y2 4y3 = 0 (4).

Adding (1) and (2) together, and (3) and (4) together, we obtain

(1) + (3) : 7x1 + 3x2 + 7y1 + 3y2 = 0


= 7 (x1 + y1 ) + 3 (x2 + y2 ) = 0. ()
(1) + (4) : x2 4x3 + y2 4y3 = 0
= (x2 + y2 ) 4 (x3 + y3 ) = 0 ().

Hence, from () and (), x + y S and so, S is closed under addition.

Next, to show that it is closed under scalar multiplication, let R, with x S


as before. So x = (x1 , x2 , x3 )T and Equations (1) and (2) (from the previous
part) hold again. Now, consider the following,

(1) : (7x1 + 3x2 ) = 0


= 7 (x1 ) + 3 (x2 ) = 0
(2) : (x2 4x3 ) = 0
= (x2 ) 4 (x3 ) = 0.

Hence, x S and so, S is closed under scalar multiplication.

As S is non-empty, closed under addition and closed uner scalar multiplication, it follows
from the Subspace Theorem that S is a subspace of R3 .

2. For b to be an element of span (v1 , v2 , v3 ), there must exist , , R such that

v1 + v2 + v3 = b.

Substituting in the vectors writing this as an augmented matrix as usual,



1 2 2 b1

1 3 1 b2
.
2 4 1 b3

1 1 6 b4

For b to be in the span, we must be able to row-reduce to find solutions for , and
which will be in terms of b1 , b2 , b3 and b4 .

9
Row-reducing, R2 R2 R1 , R3 R3 2R1 and R4 R4 + R1 ,

1 2 2 b1

0
1 3 b1 + b2 .
0
0 5 2b1 + b3

0 3 4 b1 + b4

Next, R4 R4 3R2 ,
1 2 2 b1

0
1 3 b1 + b2
.
0
0 5 2b1 + b3

0 0 5 4b1 3b2 + b4
Finally, R4 R4 + R3 ,

1 2 2 b1

0
1 3 b1 + b2
.
0
0 5 2b1 + b3

0 0 0 2b1 3b2 + b3 + b4

Hence, from row 4, the necessary and sufficient condition for b to be an element of
span(v1 , v2 , v3 , v4 ) (i.e. for a solution to exist) is that

2b1 3b2 + b3 + b4 = 0.

Note: the reason this is the condition for b to be in the span of the vectors is that once this
is true, we can perform back substitution for the rest of the values of , and without any
problems (thus we can find a solution). In other words, there will be a solution if and only
if the right-hand column in the row-echelon form is non-leading, as you learnt in Semester
1. The right-hand column here will be non-leading if and only if 2b1 3b2 + b3 + b4 = 0.)

3. (i) False. A basis for P4 requires five linearly independent polynomials in P4 . Suppose
the set of five polynomials were linearly dependent (a simple counterexample would
be the set {1, x, x2 , x4 , 2x4 }, which is clearly not a basis for P4 ). Then it would be
untrue.

(ii) True. We require five linearly independent polynomials in P4 for a basis in P4 . An


example is the standard basis for P4 , namely 1, x, x2 , x3 , x4 .


4. To show that T is not a linear transformation, we simply need to show that it does not
satisfy a property of linear transformations. Knowing that linear transformations satisfy
the scalar multiplication condition, i.e.

T (x) = T (x) , for all , x

10
(and noticing that the expression is not going to satisfy this), we try apply this to the
given transformation.

Let = 2 R and x = 2 R. Consider T (x):

T (x) = (x) cos (x)


 
= 2 cos 2
2 2
= cos
= ,


cos 2 = 0). Thus, T is not a linear

whereas T (x) = 0 (since T (x) = T 2 = 2
transformation as it does not satisfy the scalar multiplication condition, since T 2 2 6=


2T 2 .


As the above solution demonstrates, to show that a function T is not a linear map, it
suffices to come up with a specific example where a property of linear maps is not satisfied.
Note: that you could have chosen many other numbers for and x, as long as in the end,
you find that T (x) 6= T (x).

11
MATH1231/1241 Algebra Test 1 2011 S2
v1B
Answers/Hints & Worked Sample Solutions
August 15, 2016

These answers/hints were originally written and typed up by Brendan Trinh, with edits and
worked sample solutions provided by Aaron Hassan and Henderson Koh. Please be ethical with
this resource. It is for the use of MathSoc members, so do not repost it on other forums or
groups without asking for permission. If you appreciate this resource, please consider supporting
us by coming to our events and buying our T-shirts! Also, happy studying !

We cannot guarantee that our answers are correct or would obtain full marks please notify
us of any errors or typos at unswmathsoc@gmail.com, or on our Facebook page. There are
sometimes multiple methods of solving the same question. Remember that in the real class
test, you will be expected to explain your steps and working out.

Please note quiz papers that are NOT in your course pack will not necessarily reflect the style
& difficulty of questions in your quiz.

1. (i) Hints
Many, many (infinitely many in fact) choices for your answer. Choose a nice and
easy value for x1 or x2 and solve for the other. (E.g. set x2 = 0 and solve for x1 ,
which will
! then obviously have to be 5 for x to be in S.) An example answer is
5
x= .
0
Sample Answer
!
5
An example is the vector x = R2 , since 5 3 (0) = 5.
0
(ii) Hints

12
To prove that S is not closed under multiplication (or addition), you can
! do this
x1
generally by finding a counterexample, i.e. naming a specific x = S, for
x2
example using your answer in part (i). Take a specific R and consider x and
go from there to show that it is not closed under scalar multiplication. Here is a
sample answer.
Worked Sample Solution
! !
5 10
Let x = , so x S from part (i). Now, 2x = , but 10 3 (0) = 10 6=
0 0
5 2x / S. So S is not closed under scalar multiplication.

2. (i) Hints
For q to be in span (p1 , p2 , p3 ), there must exist , , R such that p1 +p2 +p3 =
q. Form an augmented matrix and row-reduce to eventually find that q does lie in the
span (because the right-hand column will be leading)! Here is the sample working.
Worked Sample Solution
Let S = {p1 , p2 , p3 }. We try solving the equation

p1 (x) + p2 (x) + p3 (x) = q (x) (1)

for real scalars , and . As usual, we place the polynomials (as coordinate vectors
with respect to the standard basis for P2 ) as columns of an augmented matrix and
row-reduce. Place p1 s coordinate vector in column 1, and similarly for p2 , p3 in
column 2 and 3. We place the coordinate vector of q in the augmented part. (The
reason why we do all this is that we equate coefficients of like powers of x in Equation
(1) and obtain simultaneous equations represented by such an augmented matrix.)
We get

1 4 1 2 1 4 1 2
R2 R2 R2
1 3 2 1 0 1 11

R3 R3 +2R2
2 3 7 1 0 5 5 5

1 4 1 2
R3 R3 +5R2
0 1 1 1 .

0 0 0 0

This is now in row-echelon form, and since the right-hand column is non-leading
here, there is a solution for , , R such that p1 + p2 + p3 = q, so q is in the
span of S.

(ii) Hints
Recall that the process to decide whether the given set S is a basis for P2 is to

13
place the polynomials (as vectors) into the columns of a matrix, and row-reduce.
Then the set S will be a basis for P2 if and only if this matrix has every row and
column leading in the row-echelon form. (Since S has 3 members and is a subset of
a three-dimensional vector space, P2 , the matrix in question will be square, so it is
equivalent to say that S will be a basis if and only if the row-echelon form of the
matrix has no zero rows, or equivalently has every column leading.) Here is a sample
answer.
Sample Solution
From the working out of the previous question, the left-hand matrix above has a
zero row in the row echelon form. Hence the given set S is not a basis for P2 (as this
zero row means S is not spanning, so cannot be a basis). And so, the set does not
span P2 .

3. (a) Hints
To evaluate this, recall the property of linear transformations that for scalars ,
R, we have
! ! !! ! !
1 2 1 2 1
T =T + = T + T ().
0 3 2 3 2
! ! !
2 1 1
That is, all we really need to do is find and such that + = .
3 2 0
We can find using Gaussian Elimination (or
! inspection)
! that the solution is = 2
1 3
and = 3. From this, we find that T = , using Equation (). Here is
0 2
a worked sample solution.
Worked Sample Solution
We solve for and in the equation
! ! !
2 1 1
+ = .
3 2 0

By inspection, the solution is = 2, = 3. (The motivation for trying this


as a solution comes from looking at the second elements. An obvious solution to
3 + 2 = 0 is = 2, = 3, and we observe that the first entries match up too in

14
this case, so this is the solution.) Thus
! ! !!
1 2 1
T =T 2 3
0 3 2
! !
2 1
= 2T 3T (linearity of T )
3 2
! !
9 5
=2 3 (given data)
8 6
!
18 15
=
16 18
!
3
= .
2

(b) Hints
We want to find the matrix of T (with respect to standard bases). The standard
method to do this is to apply T to the standard basis vectors and place ! them in as
1
columns of the matrix. In other words, column 1 of A should be T and column
0
! ! !
0 1 3
2 should be T . We have already calculated T = earlier. We just
1 0 2
! !
0 0
need to find this second column, which is simply T . To calculate T , do a
1 1
similar process to the first part of the question. A sample solution is below.
Worked Sample Solution
! !
1 3
We have already calculated T = earlier, so this is column 1 of A, so A
0 2
!
3 ?
is of the form .
2 ?
! ! !
0 2 1
Observe that = 1 +2 (find this either by inspection or Gaussian
1 3 2

15
Elimination etc.). So
! ! !!
0 2 1
T =T 1 +2
1 3 2
! !
2 1
= T + 2T (linearity)
3 2
! !
9 5
= +2 (given data)
8 6
!
1
= .
4

!
3 1
So this is the second column, and thus the required matrix is A = .
2 4

16
MATH1231/1241 Algebra Test 1 2011 S2
v2A
Answers/Hints & Worked Sample Solutions
August 15, 2016

These answers/hints were originally written and typed up by Brendan Trinh, with edits and
worked sample solutions provided by Henderson Koh and Aaron Hassan. Please be ethical with
this resource. It is for the use of MathSoc members, so do not repost it on other forums or
groups without asking for permission. If you appreciate this resource, please consider supporting
us by coming to our events and buying our T-shirts! Also, happy studying :)!

We cannot guarantee that our answers are correct or would obtain full marks please notify
us of any errors or typos at unswmathsoc@gmail.com, or on our Facebook page. There are
sometimes multiple methods of solving the same question. Remember that in the real class
test, you will be expected to explain your steps and working out.

Please note quiz papers that are NOT in your course pack will not necessarily reflect the style
and difficulty of questions in your quiz.

1. Hints
To show that S is a subspace of R2 , we need to show that S is non-empty, is closed under
addition and closed under scalar multiplication. From there, we can use the Subspace
Theorem.
Recall matrix properties such as Ax + Ay = A (x + y) to help answer the question. Here
is a sample answer.
Worked Sample Solutions
Note that S is a subset of R2!, which is a vector space. Now, clearly S is nonempty, as the
0
zero vector of R2 , 0R2 = , indeed satisfies A0R2 = 0R3 , where 0R3 is the zero vector
0

17

0
3
of R , i.e. 0 (since any matrix times the relevant zero vector results in a zero vector).

0
Now, suppose x, y are vectors in S. Then x + y R2 and

A (x + y) = Ax + Ay (Distributive Law of matrix multiplication)


= 0R3 + 0R3 (as x, y S)
= 0R3
x + y S.

Hence S is closed under addition.


Finally, suppose x is a vector in S, and let be a scalar. Then x is a vector in R2
satisfying

A (x) = (Ax)
= 0R3 (as x S)
= 0R3
x S.

Hence S is closed under scalar multiplication. It follows from the Subspace Theorem that
S is a subspace of R2 .

2. Hints
1 4

1 3
The column space of A is the span of the columns, i.e. if v1 =
0 and v2 = 2 ,


2 7
then we want to see if b span (v1 , v2 ).
To do this, we need to check if there exists , R such that v1 + v2 = b.
You will find that no solutions exist for and such that v1 + v2 = b, and so b is
not in the column space of A. Here is a sample answer.
Worked Sample Solutions
Note that b is in the columnspace
of A if and
only
if there exist scalars , such that
1 4

1
and v2 = 3.

v1 + v2 = b, where v1 = 0 2

2 7

18

1 14

1 3 5
So we try and solve
0 + 2 = 5 .


2 7 6
Comparing the third entry of each vector (0 + 2 = 5), it is evident that must be 2.5.
So comparing fourth entries now, we have

2 + 7 = 6
2 + 7 2.5 = 6
2 = 23.5
= 11.75.

But now the first entries tell us that

+ 4 = 1
11.75 + 4 2.5 = 1
11.75 + 10 = 1
1.75 = 1,

which is a contradiction. So there is no solution for , , so b is not in the column space


of A.

Alternatively, you can create the corresponding augmented matrix:



1 1 4

1 3 5

0 2 5

2 7 6

and after row-reducing, realise that no solutions exist for and .

3. (i) Sample Answer


If S is a basis for V , then it is a set of linearly independent vectors, and so m n.
But also, span (S) = V , and so n m. This implies that m = n.

Alternative answer: Recall that the definition of the dimension of a vector space is
the number of vectors in any basis for it (provided this is finite). Hence by definition,
m and n are equal.

(ii) Sample Answer


If S is linearly dependent, no relationship can be inferred between m and n. S can
be linearly dependent no matter what value m takes, so long as another one of the
vectors in S can be written as a linear combination of the others.

19
Alternative answer: Note that for any positive integer m 2, the following set
is linearly dependent: {0, v2 , . . . , vm }, where v2 , . . . , vm are any vectors from V .
(Recall that any set with the zero vector is linearly dependent.)
For the case when S only has one vector, S can still be linearly dependent if its only
vector is the zero vector, 0.
This shows that there is no relation between m and n, since for any m, there exist
linearly dependent sets.

4. Hints
Very similar to MATH1231/1241 Algebra 2011 S2 Test 1 v1B Q3.
To check if T is a linear transformation, it would be easiest to check if the following
property holds: that T (x + y) = T (x) + T (y) where , R. A sample answer is
provided below.
Worked Sample Solutions
We will answer this question with a proof
! by contradiction.
! !
1 0 5
Suppose that T is linear. Let e1 = , e2 = and w = . Note w = 5e1 e2 .
0 1 1
So we have

T (w) = T (5e1 e2 )
= 5T (e1 ) T (e2 ) (linearity)

1 2
= 5 1 3 (using given values)

1 2

3
= 2 .

7

4 3
But we were told that T (w) = 1, which is not equal to 2 . So we have a

3 3
contradiction. Hence T is not linear.

20
MATH1231/1241 Algebra Test 1 2012 S2
v1A
Hints & Sample Answers
August 15, 2016

These hints were originally written and typed up by Hub Wa, with edits and worked sample
solutions added by Aaron Hassan and Henderson Koh. Please be ethical with this resource.
It is for the use of MathSoc members, so do not repost it on other forums or groups without
asking for permission. If you appreciate this resource, please consider supporting us by coming
to our events and buying our T-shirts! Also, happy studying :)!

We cannot guarantee that our answers are correct please notify us of any errors or typos at
unswmathsoc@gmail.com, or on our Facebook page. There are sometimes multiple methods of
solving the same question. Remember that in the real class test, you will be expected to clearly
explain your steps and working out.

Please note quiz papers that are NOT in your course pack will not necessarily reflect the style
or difficulty of questions in your quiz.

1. Hints
To show that S is a subspace of R3 , you need to show that it is non-empty, is closed
under addition and under scalar multiplication. A core step youll be required to make is
x = (x1 , x2 , x3 )T R3 such that x1 2x2 = 0 and 5x2 + x3 = 0.
Worked Sample Solution
Note that clearly S is a subset of R3 , which is
a vector
space. Since 0 2 0 = 0 and
0
5 0 + 0 = 0, the zero vector from R3 , namely 0, is in S, so S is non-empty.

21

x1 y1 x 1 + y1
Let x = x2 and y = y2 be in S. Then x + y = x2 + y2 is an element of R3

x3 y3 x 3 + y3
since

(x1 + y1 ) 2 (x2 + y2 ) = (x1 2x2 ) + (y1 2y2 ) (rearranging terms)


=0+0 (since x, y S)
= 0,

and

5 (x2 + y2 ) + (x3 + y3 ) = (5x2 + x3 ) + (5y2 + y3 ) (rearranging terms)


=0+0 (since x, y S)
= 0.

Thus S is closed under


addition.
x1 x1
Now, suppose x = x2 S and R, then x = x2 is a vector in R3 . Moreover,

x3 x3

x1 2 (x2 ) = (x1 2x2 )


=0 (as x S)
= 0,

and

5 (x2 ) + x3 = (5x2 + x3 )
=0 (as x S)
= 0.

Hence S is closed under scalar multiplication.


It follows by the Subspace Theorem that S is a subspace of R3 .

2. Hints
Set up an augmented matrix and row-reduce. Your conditions on b to lie in the span(v1 , v2 , v3 )
should look like
15b1 + 6b2 b3 + b4 = 0.

Worked Sample Solution


 
As usual we set up the relevant augmented matrix, namely v1 v2 v3 b , and row-
reduce. Note that this matrix corresponds to the equation 1 v1 +2 v2 +3 v3 +4 v4 = b.

22
This is because (by definition of span) b span(v1 , v2 , v3 ) if and only if this equation
has a solution for 1 , 2 and 3 .
b1

b2
We can represent b in the augmented matrix either as b or by creating a column each

3
b4
for b1 , b2 , b3 , b4 . Here, we do the latter. And so, we have

1 3 2 1 0 0 0 1 3 2 1 0 0 0

2 5 5 0 1 0 0 R2 R2 +2R1 0 1 1 2 1 0 0

0 7 1 0 0 1 0 R4 R4 +3R1 0
7 1 0 0 1 0

3 8 1 0 0 0 1 0 1 5 3 0 0 1

1 3 2 1 0 0 0

R 0
R 7R2
33
1 1 20 0
1
R4 R4 R2 0 0 6 14 7 1 0

0 0 6 1 1 0 1

1 3 2 1 0 0 0

R R R3 0
1 1 2 1 0 0
44 .
0
0 6 14 7 1 0
0 0 0 15 6 1 1

Recall that b will be in the span if and only if the columns on the right-hand side of the
augmented matrix in row-echelon form are all non-leading. We see that from row 4 (the
only row with a zero row in the left-hand part), the necessary and sufficient condition on
b1 , b2 , b3 , b4 for b to be in the span of {v1 , v2 , v3 } is 15b1 + 6b2 b3 + b4 = 0.

3. Sample Answers

(i) False. A counterexample will be a set of six polynomials that are all constant poly-
nomials. Then, this set will not span P5 , and so will not be a basis.

(ii) True, as the dimension of P5 is 6 and so six linearly independent polynomials


in P5 will form a basis for P5 . For example, the standard basis for P5 the set
1, t, t2 , t3 , t4 , t5 is a set of six polynomials in P5 that form a basis for P5 .
 

4. Hints
We need to check which properties of linear transformations do not hold. Remember,
to show that a map T is not linear, we just need to produce a single example that
demonstrates that T does not satisfy a condition of linearity.
Worked Sample Solution
2 2
Note that T 2 = 2 sin 2 = 2 . Also, T 2 2 = T () = 0. Hence T 2
   
2 6=
2T 2 , and so T is not closed under scalar multiplication, i.e. T is not linear.


23
MATH1231/1241 Algebra Test 1 2012 S2
v1B
Hints & Sample Answers
August 15, 2016

These answers were written and typed up by Hub Wa and edited by Henderson Koh. Please be
ethical with this resource. It is for the use of MathSoc members, so do not repost it on other
forums or groups without asking for permission. If you appreciate this resource, please consider
supporting us by coming to our events and buying our T-shirts! Also, happy studying :)

We cannot guarantee that our answers are correct - please notify us of any errors or typos at
unswmathsoc@gmail.com, or on our Facebook page. There are sometimes multiple methods of
solving the same question. Remember that in the real class test, you will be expected to explain
your steps and working out.

Please note quiz papers that are NOT in your course pack will not necessarily reflect the style
& difficulty of questions in your quiz.

1

1. (i) There are many, many different choices. But one easy example you can try is 0 ,
since 1 5 0 < 2.

(ii) Hints
To show that a set is not closed under scalar multiplication, we need to find a vector
in the set, such that when we multiply this vector by a scalar, the resulting vector
will not be in S.
Sample Answers
!
1
Using the vector in part (i) , we can multiply it by 2, so that the resulting vector
0
!
2
is . Clearly, 2 5(0) = 2. So the resulting vector is not in S. Hence, S is not
0

24
closed under scalar multiplication.

2. (i) Hints
To check if a particular polynomial is an element of the span of the given 3 vectors, we
just need to see if we can express this particular polynomial as a linear combination
of these 3 vectors, i.e. if there exist 1 , 2 and 3 such that 1 p1 (x) + 2 p2 (x) +
3 p3 (x) = q(x).
Sample Answers
We construct the corresponding augmented matrix to represent this equation.

1 3 1 1
1 1 0 2 .

2 0 1 7

After row-reducing, youll find that the result will be



1 3 1 1
0 2 1 3 .

0 0 0 0

Hence, there are infinitely many solutions to the equation for 1 , 2 and 3 . There-
fore, q is indeed an element of span(p1 , p2 , p3 ). In fact, from this result, we can
determine even further that q is an element of span(p1 , p2 ).

(ii) Hints
Note that the number of elements in the set is equal to the dimension of P2 . So, if
the set also spans P2 , then the set forms a basis for P2 . So we can just check if the
set is linearly independent.
Sample Answers
We will answer this question with a proof by contradiction. Suppose that the set
{p1 , p2 , p3 } spans P2 . Then, these polynomials form a basis for P2 since the number
of elements equals to the dimension of P2 . We now check for linearly independence,
i.e. that p1 (x) + p2 (x) + p3 (x) = 0 if and only if = = = 0.
We can set up an augmented matrix

1 3 1 0
1 1 0 0

2 0 1 0

and row-reduce. However, we can save time and effort by looking at our working
out from the previous part. The only difference is that the right hand side of the
augmented matrix is slightly different. But everything we did on the left hand side
stays the same, regardless of what numbers are on the right hand side, so we can see

25
straight away that the result will be

1 3 1 0
0 2 1 0 .

0 0 0 0

From this, we can see that there are infinitely many solutions to the equation, with
1 , 2 and 3 all not necessarily equal to 0. Hence, the set is not linearly independent.
But this is a contradiction. Hence, the set does not span P2 .

3. (a) Hints
To evaluate this, recall the property of linear transformations that for scalars ,
R, we have
! ! !! ! !
1 5 2 5 2
T =T + = T + T ().
0 3 1 3 1
! !
5 2
Were already given what T and T are. So, all we really need to do is find
3 1
! ! !
5 2 1
and such that + = . We can find using Gaussian Elimination
3 1 0
(or inspection)
! !that the solution is = 1 and = 3. From this, we find that
1 1
T = , using Equation (). Here is a worked sample solution.
0 2
Worked Sample Solution
We solve for and in the equation
! ! !
5 2 1
+ = .
3 1 0

After row-reducing the augmented matrix


! !
5 2 1 R2 R2 35 R1 5 2 1

3 1 0 0 15 35

we know that 51 = 53 and 5 + 2 = 1. Solving these simultaneously, we find


that = 1 and = 3.

26
Thus
! ! !!
1 5 2
T =T +3
0 3 1
! !
5 2
= T + 3T (linearity of T )
3 1
! !
8 3
= +3 (given data)
1 1
!
8 + 9
=
13
!
1
= .
2

(b) Hints
We want to find the matrix of T (with respect to standard bases). The standard
method to do this is to apply T to the standard basis vectors and place ! them in as
1
columns of the matrix. In other words, column 1 of A should be T and column
0
! ! !
0 1 1
2 should be T . We have already calculated T = earlier. We just
1 0 2
! !
0 0
need to find the second column, which is simply T . To calculate T , do a
1 1
similar process to the first part of the question. A sample solution is below.
Worked Sample Solution
! !
1 1
We have already calculated T = earlier, so this is column 1 of A, so A
0 2
!
1 ?
is of the form .
2 ?
! ! !
0 2 1
Observe that = 2 5 (find this either by inspection or Gaussian
1 3 2

27
Elimination similar to the previous part). So
! ! !!
0 5 2
T =T 2 5
1 3 1
! !
5 2
= 2T 5T (linearity)
3 1
! !
8 3
=2 5 (given data)
1 1
!
1
= .
3

!
1 1
So this is the second column, and thus the required matrix is A = .
2 3

28

You might also like