2007 Fall

and 2008
Spring

MATH202 Introduction to Analysis

MATH202 Introduction to Analysis (2007 Fall and 2008 Spring)

Midterm Review
Reminder: The midterm will be scheduled on 20/11 (Tuesday) at LTD. The exam will
cover Sets, Countability, Series and also real numbers
Part I: Countability
Things you need to know:
Able to judge and proof the sets are countable or uncountable.
Theorem 1 (Countable Subset Theorem)
Let A, B be two sets and A B, then
(1) if B is countable, then A is also countable
(2) if A is uncountable, then B is also uncountable
(Roughly speaking, the theorem said any subset of countable set is countable and a
set containing an uncountable set is uncountable)
Theorem 2 (Commonly used in proving the set is countable)
If A1 , A2 , A3 , A4 , .. are countable sets, then
(1) Countable Union Theorem

n=1 An and nS An are all countable (where S is any countable set)

(2) Product Theorem
A1 A2 A3 Ak (But it is not true for infinite many )
(Note: However we CANNOT use them to prove the set is UNCOUNTABLE)
Theorem 3 (Commonly used in proving the set is uncountable)
Let f be a function f: A B,
(1) Bijection Theorem
If f is bijective, then both A and B are countable (or uncountable).
(2) Surjection Theorem
If f is surjective, then
a) if A is countable, then B is countable
b) if B is uncountable, then A is uncountable
(3) Injection Theorem
If f is injective, then
a) If B is countable, then A is countable
b) If A is uncountable then B is uncountable
(Note: For the countable set, you can also use this method)
Midterm Review

Page 1

2007 Fall
and 2008
Spring

MATH202 Introduction to Analysis

Example 1
Determine whether the sets
a b c2
a b c2
+ : a, b, c , T =
+ : a , b , c
2 3 5
2 3 5

S=

U=

a b c2
+ : a , b , c
2 3 5

is countable or not
Solution:
For Set S, since the all variables lie in Q which is obviously countable. Therefore, we
can try to use countable union theorem to prove S is countable.
Note S =

3+
2

aQ bQ cQ
a

: a, b, c

a b c2
+
2 3 5

Note in

c2

3+
2

c2
5

since a,b,c are fixed, therefore

3+
2

c2

has only 1 element

and therefore countable.

So by countable union theorem, S =

aQ

bQ

a
cQ 2

3+

c2

is countable.

For Set T, since there is a variable (a ) lies in which is uncountable. So one may
suspect the set is uncountable. By our intuition, we may say S is uncountable is
because the variable a is in uncountable set R. Next, we will use mathematical
argument to write down our intuition.
Since we just need to focus on variable a, lets fix b and c and let
a b c2
Ta =
+ :a
2 3 5
Construct a map:
f: Ta
want to show

which f

3+
2

c2
5

where a lies (Trouble!!)

=a
a

f is bijective because we can find an inverse map g a = 2 3 +

Midterm Review

c2
5

Page 2

2007 Fall
and 2008
Spring

MATH202 Introduction to Analysis

Hence by bijection theorem and since R is uncountable, Ta is uncountable.

Because T Ta , therefore by countable subset theorem, T is uncountable.
For Set U, It is also uncountable by similar reason in b), all you need to do is to fix b
and c. (Try to finish the proof by yourself)

Example 2
Check whether the set
S = {x: x 7 3x 4 + 2 P}
is countable where P is a non-empty countable subset of .
Solution:
We should first rephrase the set into
S = x : x 7 3x 4 + 2 P = {x : x 7 3x 4 + 2 = r where r P}
Since only variable r lies in countable set P, therefore we suspect S is countable, now
{x: x 7 3x 4 + 2 = r}

S=
rP

Fix each fix r, there are at most 7 real roots, therefore {x : x 7 3x 4 + 2 = r} is

countable. Since P is countable, by countable union theorem, S is countable.
Difficult Situation:
Example 3 (Special Symbol)
Check whether the set
S = 3 y 3 + 2 y + 2: y and T = {3 y 3 2 y + 2: y }
U = {3y 3 2y + 2: [y] }
are countable or not.
(Note: |x| means the absolute value of x, and [x] means the greatest integer less
than or equal to x. (E.g. 7.2 = 7, 7,9 = 7 and 7 = 7)
When you see the set involves some special notations, you may try to do some
analysis to simplify the set. (So it would be easier to check the countability, right?)

Midterm Review

Page 3

2007 Fall
and 2008
Spring

MATH202 Introduction to Analysis

Solution:
For Set S
Note that y and y will give the same value (since y = |y|). Therefore we can
write the set into
S = 3 y 3 + 2 y + 2: y = {3y 3 + 2y + 2: y 0, }
Note y lies in [0, ) which is uncountable (because any interval is uncountable).
Therefore we suspect the set is uncountable.
Construct a map
f: S [0, )
want to show

where y lies (Trouble!!)

which f 3y 3 + 2y + 2 = y
f is bijective because 3y 3 + 2y + 2 is increasing, therefore we can find an inverse
g y = 3y 3 + 2y + 2 (Question: Why we need + + is increasing?)
Therefore by bijection theorem, we get S is uncountable
For Set T
Note [y] must be integer for any real y, then 3 y 3 2 y + 2 is also integer
Hence T , since is countable, by countable subset theorem, T is countable.
For Set U
We see that y = 1 y [1,2), y = 2 y [2,3), y = 3 y [3,4),.....
The set can be simplified into
U = 3y 3 2y + 2: y = {3y 3 2y + 2: y 1, }
One can show that U is uncountable (the method is similar as that in set S). Note that
3y 3 2y + 2 is increasing function in [1, ).
Construct a map
f: U [1, )
want to show

where y lies (Trouble!!)

which f 3y 3 2y + 2 = y
f is bijective because 3y 3 2y + 2 is increasing, therefore we can find an inverse
g y = 3y 3 2y + 2
Therefore by bijection theorem, we get S is uncountable

Midterm Review

Page 4

2007 Fall
and 2008
Spring

MATH202 Introduction to Analysis

Example 4
Determine the set
S = {x 2 + y 2 + z 2 : x A B, y A, z B }
Is countable or not.
where A is non-empty countable subset of R and B is an uncountable subset of R
Solution:
We first need to check whether the set A B, A, B are countable or not.
Note that A B A, A , B , since A and are countable.
Therefore by countable subset theorem, A B, A, B are countable.
Then, since all variables lie in countable sets, now we can write
{x 2 + y 2 + z 2 }

S=

xAB yA zB
2

Then {x + y + z } has only 1 element and therefore countable, then S is

countable by countable union theorem. (Because A B, A, B are
countable)
Example 5
Determine whether the set
S = {x 2 3 y: x A B and y A B}
Is countable or not.
where A is non-empty countable subset of R and B is an uncountable subset of R
Solution:
Note that A B A, so A B is countable by countable subset theorem
But A B B, so A B is uncountable by countable subset theorem.
Hence we may suspect S is uncountable (because variable y lie in uncountable set
A B). But there is another variable x, so we first fix and let
= {x 2 3 y: y A B}
Construct a map
f: Sx A B
want to show

where y lies (Trouble!!)

which f x 2 3 y = y
f is bijective because x 2 3 y is decreasing (Remember the x is fixed!!), therefore
we can find an inverse function g y = x 2 3 y
Since A B is uncountable, so is countable (by bijection theorem).
Since , so S is uncountable (by countable subset theorem).
Midterm Review

Page 5

2007 Fall
and 2008
Spring

MATH202 Introduction to Analysis

Example 6
Check whether the set
= T U and S = T U
Is countable or not,
where T = \{p + 2s: p , s } U = \{ m + n: m, n }
Solution:
(Step 1) First, let us investigate whether T and U are countable or not.
(For Set T)
Note = {p + 2s: p , s } =

s{p

+ 2s}

Since {p + 2s} has 1 element and therefore countable,

Therefore = {p + 2s: p , s } is countable (by countable union theorem)
Since R is uncountable, then = \ is uncountable.
(Reason: Suppose R\A is countable, then R = (R\A) A, and A is also countable,
it implies R is countable, contradiction)
(For Set U)
Similar argument can show U is uncountable
(Step 2)
Note that = T U T, therefore S is uncountable by countable subset theorem.
For S = T U,
We need to consider \(T U)
Note \(T U) = \T (\U)
= {p + 2s: p , s } { m + n: m, n } (Since \(\A) = A)
We have shown that each set is countable, by countable union theorem, \(T U)
is countable. Then must be uncountable
(Otherwise if must be countable, then = T U (\(T U)) will be
countable by countable union theorem, contradict to is uncountable)
Example 7
Check whether the set
S = { x, y 2 : x A and y \A}
Is countable or not. (Where A is countable set)
a) Case i) If A is empty, then we cannot assign any value to y. Therefore C will be an
empty set and therefore countable. (You may lose points if you fail to consider
this case!!!!!!!)
Midterm Review

Page 6

2007 Fall
and 2008
Spring

MATH202 Introduction to Analysis

Case ii) If A is non-empty, note that is uncountable and A is countable,

therefore \A is uncountable. (If \A is countable, then \A A = will
imply R is countable which is a contradiction)
Since variable x lies in \A which is uncountable, we suspect S is uncountable
Using similar trick, we first fix x, and let Sy = { x, y 2 : y \A}
Consider a map f: Sy \A
Where f x, y = y,
We see f is bijective because we can find an inverse map g y = (x, y)
Therefore, by bijection theorem, Sy is uncountable.
Since S Sy , by countable subset theorem, S is uncountable.
Example 8 (Practice Exercise #28)
If S is a countable subset of 2 , show that for any two points x, y 2 \S, there is
a parallelogram in 2 \S having x, y as opposite vertices. Here parallelogram
means only the 4 edges (including the 4 vertices, but not including any interior
point).
(IDEA: To construct a parallelogram, we need 2 pairs of parallel sides as shown)
y
x
Therefore, to prove the existence of a parallelogram, it is suffice for us to prove the
existence of 2 pairs of parallel lines in 2 \S.)
Step 1: Define the pair of parallel line
Let L be the pair of straight line, each passes through x and y respectively and
make an angle with xy-line

x
L
Midterm Review

Page 7

2007 Fall
and 2008
Spring

MATH202 Introduction to Analysis

Step 2: Define the set

Define two sets
T = {L : 0 < } = {L : 0, } (Collection of such parallel lines)
V = {L : L pass through some points in S} (Collection of all lines pass through some
points in S)
Then T\V = {L : L does not pass through any points in S} (Thats what we want)
Step 3: Show \ is uncountable
For Set T,
Since lies in [0, ) which is uncountable, by considering a map
f: T {0, ) which f L =
We can see f is bijective (since there is inverse map g = L )
By bijection theorem, T is uncountable
For Set V,
V=

{L : L pass through the point s }

sS

For each s, there are at most 2 pairs of L pass through s

Hence by countable union theorem, V is countable
So T\V is uncountable, (otherwise if T\V is countable, then (T\V) V = T will
imply T is uncountable).
Finally, since T\V is uncountable and therefore infinite, we can pick two pair of lines
L and L . Use them to construct our parallelogram
L
y

Remark: This construction is useful in dealing with existence problem. (See Exercise
4)

Midterm Review

Page 8

2007 Fall
and 2008
Spring

MATH202 Introduction to Analysis

You are welcome to submit the solutions of following exercises to me so that I can
give some comments to you. I encourage you to do all of them so that you can get
familiar with the material about countability.
The exercise are same as the one in Tutorial Note #9
Exercise 1 (Basic Question)
Determine (with proof) the following sets are countable or not.
a) A = {x : e3x + 3ex 9 = 0}
b) B = {7x 2 6y + z : x A, y, z } where A is an uncountable subset of

c) C = {(x, y, z) 3 , x 2 z 3 + y 4 = 4, y + 2x = 6 and x 3 + 3z = 1}
d) D = {x 2 5y: x A, y B} where A is an uncountable subset of and B is any
subset of . (Be careful, B can be an empty set)
e) E = {x y: x, y A} where A is an uncountable set.
f) F = { x, y : [x] and y } where [x] is greatest integer less than or equal to
x. (i.e. 7 = 7, 7.2 = 7, 7.9 = 7, 1 = 1, [1.2] = 2, 1.9 = 2)
Exercise 2 (2004 Midterm)
Let S be the set of all intersection points (x, y) 2 of the graphs of the equations
x 2 + my2 = 1 and mx 2 + y 2 = 1, where m \{1,1}. Determine if S is
countable or uncountable. Provide a proof of your answer.
Exercise 3 (2003 Final)
Let P be a countable set of points in 2 . Prove that there exists a circle C with the
origin as center and positive radius such that every point of the circle C is not in P.
(Note points inside the circle do not belong to the circle.)
(Hint: If you understand Example 3, this one should be an easy question)
*Exercise 4 (2002 Midterm)
Let S be the set of all lines L on the R2 such that L passes through 2 distinct points in
and T be the set of all points, each of which is the intersection of a pair of
distinct lines in S. Determine if T is countable set or not.
(Hint: Try to draw some graphs to understand the problem)
(More Exercises can be found in Tutorial Note #4)

Midterm Review

Page 9