MAST10008 Accelerated Mathematics 1 Version 2 MAST10008 Accelerated Mathematics 1 Version 2

Tutorial 7: Solutions The leading entries are in the first 3 columns so thecoordinate
  vectors of the basis are taken
2 3 1
1 0 1
Q1. (a) A basis for the row space consists of the vectors in the non-zero rows of B, the row echelon from the first 3 columns of the original matrix, i.e. 
 0 , −1 and 1.
    
form of A: {(1, 0, −1, 0, 0, −1), (0, 1, 4, 0, 0, 0), (0, 0, 0, 1, 0, 2), (0, 0, 0, 0, 1, −1)}.
−1 2 1
(b) These are the vectors in the columns of A corresponding to the columns of B containing
leading entries. These are columns 1, 2, 4, 5 and so a basis for the column space is Thus the required basis is {2 + x − x3 , 3 − x2 + 2x3 , 1 + x + x2 + x3 }.
{(2, −11, −3, 2, 1), (0, 8, −1, −1, 2), (3, 9, 0, 1, 0), (0, 12, 0, −1, 2)}.
Q3. We start by finding the reduced row echelon form of A using F2 arithmetic.
(c) These vectors are some of the columns in the matrix A so the dimension of their span is      
less than or equal to dimension of the column space of A. As there are only four vectors 1 0 0 1 1 0 1 1 0 0 1 1 0 1 1 0 0 1 1 0 1
0 1 1 1 1 1 1 0 1 1 1 1 1 1
in the basis for the column space,  ∼ 0 1 1 1 1 1 1

A =  ∼  
dim Span{(2, −11, −3, 2, 1), (0, 8, −1, −1, 2), (3, 9, 0, 1, 0), (0, 12, 0, −1, 2), (4, 17, 3, 1, −3)} ≤ 1 1 1 0 0 1 0 0 1 1 1 1 1 1 0 0 0 0 0 0 0
4. 1 0 0 1 0 1 1 0 0 0 0 1 1 0 0 0 0 0 1 1 0
But R5 has dimension 5(> 4) so the vectors cannot span R5 .
   
1 0 0 1 1 0 1 1 0 0 1 0 1 1
(d) We have 0 1 1 1 1 1 1 0 1 1 1 0 0 1
∼   ∼  =B
0 0 0 0 1 1 0 0 0 0 0 1 1 0
rank(A) + nullity(A) = #columns of A ⇒ 4 + nullity(A) = 6 ⇒ nullity(A) = 2 0 0 0 0 0 0 0 0 0 0 0 0 0 0

(e) Let the variables be denoted x1 , x2 , x3 , x4 , x5 , x6 . There are no leading entries in the (a) A basis for the row space consists of the vectors in the non-zero rows of B, the row
reduced row echelon form of A in columns 3 or 6 so we set x3 = s, x6 = t t, s ∈ R and echelon form of A: {(1, 0, 0, 1, 0, 1, 1), (0, 1, 1, 1, 0, 0, 1), (0, 0, 0, 0, 1, 1, 0)}. The dimension
we have is 3. There are 23 = 8 elements.
(b) These are the vectors in the columns of A corresponding to the columns of B contain-
x5 − x6 =0 ⇒ x5 =t
ing leading entries. These are columns 1, 2, 5 and so a basis for the column space is
x4 + 2x6 =0 ⇒ x4 = −2t {(1, 0, 1, 1), (0, 1, 1, 0), (1, 1, 0, 0)}. The dimension is 3. There are 23 = 8 elements.
x2 + 4x3 =0 ⇒ x2 = −4s (c) Let the variables be denoted x1 , x2 , x3 , x4 , x5 , x6 , x7 . Let x3 = s, x4 = t, x6 = u and
x 1 − x3 − x6 =0 ⇒ x1 =s+t x7 = v, s, t, u, v ∈ F2 . Then we have
Hence the solution space is the set of vectors x5 + x6 = 0 ⇒ x5 = x6 = u
x2 + x3 + x4 + x7 = 0 ⇒ x2 = x3 + x4 + x7 = s + t + v
(x1 , x2 , x3 , x4 , x5 , x6 ) = (s + t, −4s, s, −2t, t, t) = s(1, −4, 1, 0, 0, 0) + t(1, 0, 0, −2, 1, 1)
x1 + x4 + x6 + x7 = 0 ⇒ x1 = x4 + x6 + x7 = t + u + v
A basis for the solutions space is {(1, −4, 1, 0, 0, 0), (1, 0, 0, −2, 1, 1)}.
(f) From the reduced row-echelon form we read off that
Hence the solution space is the set of vectors
(−2, 43, −1, −6, 7) = (−1)(2, −11, −3, 2, 1) + 4(0, 8, −1, −1, 2)
(x1 , x2 , x3 , x4 , x5 , x6 ) =(t + u + v, s + t + v, s, t, u, u, v)
(4, 17, 3, 1, −3) = (−1)(2, −11, −3, 2, 1) + 2(3, 9, 0, 1, 0) + (−1)(0, 12, 0, −1, 2)
=s(0, 1, 1, 0, 0, 0, 0) + t(1, 1, 0, 1, 0, 0, 0)
Q2. We use the coordinate vectors with respect to the standard basis and place these in the columns + u(1, 0, 0, 0, 1, 1, 0) + v(1, 1, 0, 0, 0, 0, 1)
of a matrix. Then find the row reduced form of the matrix.
A basis for the solution space is
     
2 3 1 1 1 0 1 0 1 0 1 0
{(0, 1, 1, 0, 0, 0, 0), (1, 1, 0, 1, 0, 0, 0), (1, 0, 0, 0, 1, 1, 0), (1, 1, 0, 0, 0, 0, 1)}.
 0 3 −1 1 
1 0 1 0  2 3 1 1
  
 0 −1 1 −1 ∼  0 −1 1 −1 ∼ 0 −1 1 −1

The dimension is 4. There are 24 = 16 elements.
−1 2 1 −2 −1 2 1 −2 0 2 2 −2
     
1 0 1 0 1 0 1 0 1 0 1 0
0 −1 1 −1 0 −1 1 −1 0 −1 1 −1
∼ 0 3 −1 1  ∼ 0 0 2 −2 ∼ 0 0 2 −2
    

0 2 2 −2 0 0 4 −4 0 0 0 0

Mathematics and Statistics 1 University of Melbourne Mathematics and Statistics 2 University of Melbourne
MAST10008 Accelerated Mathematics 1 Version 2 MAST10008 Accelerated Mathematics 1 Version 2

 
Q4. (a) (i). T (1) = 12, T (x) = 10x, T (x2 ) = 2 + 6x2 and T (x3 ) = 6x. 5 −3
Q5. (a) A =
 
12
 
0
 
2
 
0 6 −4
0 10 2
0 3
6 (b) T (2, 2) = (4, 4) = 2(2, 2) and T (1, 2) = (−1, −2) = −1(1, 2) so λ1 = 2 and λ2 = −1.
(ii). [T (1)]B =  , [T (x)]B =  , [T (x )]B =   and [T (x )]B =  
       .
0 0 6 0 (c) T (2, 0) = T (2(2, 2)) + T (−2(1, 2)) = 2T (2, 2) − 2T (1, 2) = 2(4, 4) − 2(−1, −2) = (10, 12).
0 0 0 0
 
12 0 2 0
 0 10 0 6
(iii). A =   0 0 6 0 .


0 0 0 0
   
6 0 1 0 6 0 0 0
0 5 0 3 0 5 0 3
(b) A ∼  0 0 1 0 ∼ 0 0 1 0.
  

0 0 0 0 0 0 0 0
 
α1
α2 
Solving A  α3  = 0 we let α4 = 5t. Then α2 = 3t, α1 = α3 = 0.


α4
Thus ker T = {3tx − 5tx3 | t ∈ R} and a basis for ker T is {3x − 5x3 }.
We note that the leading entries in the row reduced form of A are in columns 1, 2 and 3,
so a basis for imT is the image of the first three basis vectors, i.e. {12, 10x, 2 + 6x2 }, that
is, the polynomials whose coordinate vectors are in the first 3 columns of A.
(c) (i). The solutions are just ker T = {3tx − 5tx3 | t ∈ R}.
(ii). There is no p(x) satisfying T (p(x)) = x3 as clearly there are no βi such that

x3 = β1 × 12 + β2 × 10x + β3 × (2 + 6x2 ).

However
10
10 = × 12 + 0 × 10x + 0 × (2 + 6x2 )
12
 
10 (d)
so there is a solution to T (p(x)) = 10. In fact T = 10.
12 
2 1

(e) PS←B =
2 2
Remark: Of course, where a solution exists, it is possible to solve the equation by  
using the matrix A augmented with [x3 ]B or [10]B as appropriate. −1 1 2 −1
PB←S = PS←B =
2 −2 2
     
1 2 −1 5 −3 2 1 2 0
(f) [T ]B = PB←S [T ]S PS←B = =
2 −2 2 6 −4 2 2 0 −1
(g) The values of λ1 and λ2 in (b) match the values along the diagonal of [T ]B .

Mathematics and Statistics 3 University of Melbourne Mathematics and Statistics 4 University of Melbourne