ASSIGNMENT 2

JARON LEE

1. The existence and uniqueness of solutions

1.a. If consistent, the linear system can have either one solution or infinite solutions. If the first 8 equations produce a unique solution and the 9th equation is
a zero row, then one solution exists. If there is no zero row, then the system has
no solution (hence the matrix is inconsistent). If there is also more than one zero
row there are infinite solutions as at least some of the variables will be free.
1.b. This is a trick question. It is not possible to have more pivot columns than
there are rows or columns (whichever is fewer). This is because each pivot position
must occupy its own row and column.
1.c. The matrix has a zero right hand side column. This means that no inconsistent rows (zero rows with the right hand side entry not zero) can ever exist so the
system is always consistent. As there are more unknowns than equations, there
will always be free variables meaning that the system can only ever have infinite
solutions.
1.d. A reduced row echelon form matrix of 19 19 with 19 pivot positions would
be a matrix with the leading diagonal consisting only of 1s and every other entry
being zero. This is because each pivot position can be used to clear the other
coefficients in its column by making them equal to zero, and then the row containing this pivot position can be scaled to equal 1. This system would have a solution
as each variable is fixed.
2. Linear combinations of vectors
2.a. To describe Span{v~1 , v~2 , v~3 } we need to check several things. First, we must
identify whether any of the vectors are scalar multiples of each other.
Let v~1 =< 1, 1, 2 >, v~2 =< 2, 3, 7 >, v~3 =< 1, 6, 1 >. Is v~1 = v~2 ?
< 1, 1, 2 >= < 2, 3, 7 > = 1 = 2, 1 = 3, 2 = 7.
Hence no consistent solution for exists so v~1 is not parallel to v~2 .

Is v~1 = v~3 ?
< 1, 1, 2 >= < 1, 6, 1 > = 1 = , 1 = 6, 2 = .
1

JARON LEE

Hence no consistent solution for exists so v~1 is not parallel to v~3 .

Is v~2 = v~3 ?
< 2, 3, 7 >= < 1, 6, 1 > = 2 = , 3 = 6, 7 = .
Hence no consistent solution for exists so v~2 is not parallel to v~3 . We conclude
that none of the vectors are scalar multiples of each other.
We now check to see if the vectors can be defined in terms of each other. This
would imply that they all lie in the same plane. Let ~b =< a, b, c > exist such that
~b is a vector in the span.
This gives us the matrix:

1 2 1 a
3 6 b R3 = 2R1 + R3
M atrix = 1
2 7 1 c

1 2 1
a
b R2 = R1 R2
= 1 3 6
0 3 3 2a + c

1 2 1
2
1
= 0 5 5 a b R2 = 0.2R2 , R3 = R3
3
0 3
3 2a + b

1 2 1
2
R3 = R3 + R2
= 0 1 1 ab
5
2a+c
0 1
1
3

1 2 1
2
ab
R3 = R3 + R2
= 0 1 1
5
2a+c
ab
0 0
0
+ 5
3
Hence the constraint on ~b in the span is:
2a + c a b
+
=0
3
5
5(2a + c) + 3(a b)
=0
3
10a + 5c + 3a 3b = 0
13a 3b + 5c = 0
i.e. the span is a plane whose equation in R3 is 13x 3y + 5z = 0.

ASSIGNMENT 2

2.b.
Span isgiven
of vectors: c1 v~1 + c2 v~2 + c3 v~3 = ~u i.e.

by the
linear
combination

1
2
1
2
c1 1 + c2 3 + c3 6 = h. We wish to solve for h:
7
1
4
2

c1 + 2c2 + c3 = 2
c1 + 3c2 + 6c3 = h

2c + 7c + c = 4
1
2
3
Thus:

1 2 1 2
3 6 h R2 = 2R1 + R2 , R3 = 2R1 + R3
M atrix = 1
2 7 1 4

2
1 2 1
1
= 0 5 5 h 2 R2 = 0.5R2 , R3 = R3
3
8
0 3 3

1 2 1 2
R1 = 2R2 + R1 , R3 = R2 R3
= 0 1 1 h2
5
8
0 1 1 3

1 0 3 2(h2)
+
2
5
h2
R2 = 0.5R2 , R3 = 1 R3
= 0 1 1
5
3
38
0 0 0 h2
5

For ~u to lie in Span{v~1 , v~2 , v~3 } the coefficients c1 , c2 , c3 must have some solution.
Thus:
8
h2
=
5
3
40
h2=
3
46
h=
3
2.c. If h =

46
,
3

matrix is given by:

1 0 3
0 1 1
0 0 0

22

c1 = 3 3c3
c2 = 83 c3

c = f ree
3

22
3

+2

8
3

JARON LEE

3. Domain
Recall that the domain of a function f (x) is the set of numbers x such that f (x)
is defined. f (x) is clearly not defined at x = 0, as this entails division by zero. By
similar logic, x is not defined at x = 1. Note also the square root of a number is
only real if the term under the square root is positive. Hence:
x
2

x 1+x
2(1 + x) x2
x(1 + x)
x2 + 2x + 2
x(1 + x)

(x (1 3))(x (1 + 3))
x(1 + x)

(x (1 3))(x (1 + 3))

x(1 + x)

0
0

1 3<x<0
+ve
-ve
-ve

0<x1+
+ve
-ve
-ve

-ve
+ve
-ve

-ve
+ve
-ve

+ve
+ve
+ve

+ve
+ve
+ve

-ve

+ve

-ve

+ve

x (1 3)

x (1 + 3)
Top:

x < 1
-ve
-ve
+ve

1 < x 1
-ve
-ve
+ve

x
(1 + x)
Bottom:

-ve
-ve
+ve

Net:

+ve

x>1+
+ve
+ve
+ve

Note that the points x = 1 and x = 0 are not in the domain of the function,
and so they are excluded from our analysis. We are solving for
the expression

above to be less than zero. Thus the solution is: x R : (1, 1 3] (0, 1 + 3].
4. Convergence of Sequences
We want to find |an | |bn |n, bn 0. Let  > 0 be given. Then N, n N
where |bn | < . Hence |an | < .
We know by the triangle inequality that:
(1)n
1
|an | | | + | 2 |
n
n
1
1
+ 2
n n
1
1
We also know that n2 > n for n 6= 0. By Axiom 10, 2 < .This means that
n
n
1
1
|an | + .
n n

ASSIGNMENT 2

1
1
2
2
2
+ .Then |bn | = . This implies that <  if n > . Hence we
n n
n
n

2
can take N = ,where the brackets denote the integer part thereof. This shows

that |bn | converges to zero. As we earlier stated |an | |bn |, it must also be the
case that |an | converges to zero by a variant of the squeeze theorem.

Let |bn | =

5. Limit of sequence
5.a. We want to show a
n is increasing
- i.e. an+1 an , n 1, n N.
For n = 1, a1 = 1, a2 = 1 + 2a1 = 3. Hence a2 a1 so true for n = 1.
Assume true for n = k - i.e.ak+1

ak .
Consider n = k + 1. ak+2 = 1 + 2ak+1 > 1 + 2ak = ak+1 . Hence if true for
n = k, true for n = k + 1. And true for n = 1. Thus proved by induction that an
is increasing.
5.b. The technique I am using here is to assume if lim an = a exists, then it
converges to an upper bound a. Then I will prove by induction that this value a
is indeed an upper bound.
a = lim an+1

= lim 1 + 2an
p
= 1 + 2 lim an

= 1 + 2a
Hence:
a=

1 + 2a

a2 = 1 + 2a
0 = a2 2a 1
= (a 1)2 1 1

2=a1

a=1 2

2 cannot be a valid soluAs an is initially positive and increasing,

a
=
1

tion.Thus if lim an exists, a = 1 + 2.

We show an is bounded above
by observing a1 = 1 which is less than our protrue for n = 1.
posed upper bound a = 1 + 2. Hence

Assume true for n = k: ak < 1 + 2. Note that k represents some value of n, not

JARON LEE

all values of n (i.e. not ass

Consider n = k + 1:

1 + 2ak
q

< 1 + 2(1 + 2)
q

< 1+2+2 2
q

< 3+2 2

<1+ 2

ak+1 =

Note that:

1+ 2=x

(1 + 2)2 = x2

1+2+2 2=

3+2 2=
q

x= 3+2 2

Hence if true for n = k, it is also true for n = k + 1. And true

for n = 1. Thus

proved by induction an is bounded above such that an < 1 + 2.
5.c. A bounded monotone sequence converges, as stated by Theorem 2.5.1 in the
course notes. As we have proved that the sequence is always increasing and is
bounded above, it must necessarily converge by this definition.

5.d. First, we show that if an a, then 1 + 2an 1 + 2a. We have already

shown that the sequence converges.
p

lim 1 + 2an = 1 + 2 lim an

= 1 + 2a
But:

lim 1 + 2an = lim an+1

= lim an
=a

Note an+1 a is true, as an a is given for a infinitely large value of n.

Adding one to this infinite value makes no difference.
By the uniqueness of the limit of a sequence (that each sequence
can only ever
converge to one value at a time) this necessarily implies
that a = 1 + 2a. We
solve this as previously in part b), to get a value a = 1 + 2.