G12MAN Mathematical Analysis Solutions To Question Sheet 1, Questions 1-5

Download as pdf or txt
Download as pdf or txt
You are on page 1of 4

G12MAN Mathematical Analysis

Solutions to Question Sheet 1, Questions 1-5


1. In order to show equality of two sets we just have to show that the statement x is an
element in the rst set is logically equivalent to the statement x is an element in the second
set, that is x is an element in the rst set x is an element in the second set. We will use
this strategy in this question.
In general, it is often a good idea to prove separately the two implications and . However,
in this particular question, it is possible to use throughout.
You may easily convert each of the proofs below into proofs of the two separate implications
using one-way arrows.
If P is any proposition we denote as usual the proposition not P by P. Of course we have
P (P). Recall that if Q is another proposition then
(P and Q) P or Q
and
(P or Q) P and Q.
You may also nd it convenient to recall the notation P Q for P and Q and P Q for
P or Q.
(i) For x R, we have
x (A B)
c
(x A B)
(x A and x B)
(x A) or (x B)
x A
c
or x B
c
x A
c
B
c
.
Thus x is in (AB)
c
if and only if x is in A
c
B
c
. This means that both sets are the same.
(ii) Similarly, for x R,
x (A B)
c
(x A B)
(x A or x B)
(x A) and (x B)
x A
c
and x B
c
x A
c
B
c
.
So x is in (A B)
c
if and only if x is in A
c
B
c
. This means that both sets are the same.
1
2. (i) This time we have to look at pairs (x, y) R
2
= R R. We have
(x, y) (A
1
B
1
) (A
2
B
2
) ((x, y) A
1
B
1
and (x, y) A
2
B
2
.
Now (x, y) A
1
B
1
(x A
1
and y B
1
) and (x, y) A
2
B
2
(x A
2
and y B
2
)
so that
(x, y) A
1
B
1
and (x, y) A
2
B
2
is equivalent to the proposition (x A
1
and x A
2
and y B
1
and y B
2
).
On the other hand
(x, y) (A
1
A
2
) (B
1
B
2
) x A
1
A
2
and y B
1
B
2
which is equivalent to (x A
1
and x A
2
and y B
1
and y B
2
). So again both sets are
equal.
(ii) It is not always true that (A
1
B
1
) (A
2
B
2
) = (A
1
A
2
) (B
1
B
2
); for example,
consider A
1
= [0, 1] = B
1
and A
2
= [1, 2] = B
2
. Then A
1
A
2
= [0, 2] = B
1
B
2
. But
(A
1
B
1
) (A
2
B
2
) = ([0, 1] [0, 1]) ([1, 2] [1, 2]) ,
which is not equal to
(A
1
A
2
) (B
1
B
2
) = [0, 2] [0, 2] :
indeed. the latter contains the point (0, 2) whereas the former does not. (Exercise: draw a
diagram to make this clear.)
Actually we can even take the one-point sets A
1
= 0 = B
1
and A
2
= 1 = B
2
and obtain
a counterexample.
(iii) A B C = (x, y, z) [ x A, y B, z C contains 8 elements.
Indeed, if A = x
1
, x
2
, B = y
1
, y
2
and C = z
1
, z
2
then
A B C = (x
i
, y
j
, z
k
) [ i, j, k 1, 2
which we may write out in full as
(x
1
, y
1
, z
1
), (x
1
, y
1
, z
2
), (x
1
, y
2
, z
1
), (x
1
, y
2
, z
2
), (x
2
, y
1
, z
1
), (x
2
, y
1
, z
2
), (x
2
, y
2
, z
1
), (x
2
, y
2
, z
2
) .
More generally, the number of elements in a Cartesian product of nitely many nite sets is
obtained by multiplying together the numbers of elements in the individual sets.
2
3.(i)(a) We are given that (x, x) M = AB, so we must have x A and x B. Similarly,
we are given that (y, y) M = A B, and so y A and y B. In particular x A and
y B so (x, y) A B = M. Also, y A and x B, so (y, x) A B = M.
(b) This time we are given that (x, y) and (y, x) are both in M = AB. From (x, y) AB
we obtain that x A and y B. From (y, x) A B we obtain y A and x B. Since
x A and x B we have (x, x) M = A B. Similarly (y, y) M.
(ii) Suppose, for contradiction, that S = (x, y) R
2
[ 0 x 1 and 0 y x is a
Cartesian product i.e. S = A B for some subsets A and B of R. We have (0, 0) S and
(1, 1) S so by (i)(a) we must have (0, 1) S and (1, 0) S. But (0, 1) is not in S. This
contradiction shows that S cannot be a Cartesian product.
(iii) Suppose, for contradiction, that R is a Cartesian product. Clearly (0, 1) and (1, 0) are
both in R, but (1, 1) and (0, 0) are not. This contradicts (i)(b), and so R can not be a
Cartesian product.
4. (i) Suppose rst that |x| |y|. Then

|x| |y|

= |x| |y| and we need to show


that
|x| |y| |x y|.
However, |x| = |(xy) +y| |xy| +|y| by the triangle inequality. Subtracting |y|
from both sides yields
|x| |y| |x y|
which proves the result if |x| |y|. If |x| < |y| then, swapping the roles of y and x, the
rst part gives us
|y| |x| |y x| ().
But |y| |x| =

|x| |y|

and |y x| = |x y| so () implies

|x| |y|

|x y|.
(ii) We have x =
1
2
(x +y) +
1
2
(x y) so by the triangle inequality and homogeneity
|x| =

1
2
(x +y) +
1
2
(x y)


1
2
|x +y| +
1
2
|x y|.
Similarly y =
1
2
(x +y) +
1
2
(y x) implies
|y|
1
2
|x +y| +
1
2
|y x|.
Adding both inequalities together gives
|x| +|y| |x +y| +|x y|
which is what we want.
(iii) The identity is shown as follows:
|x +y|
2
+|x y|
2
= x +y, x +y) +x y, x y)
= x, x) +x, y) +y, x) +y, y) +x, x) x, y) y, x) +y, y)
= 2x, x) + 2y, y)
= 2|x|
2
+ 2|y|
2
.
3
5. (i) We prove separately that the left hand side (LHS) is the right hand side (RHS) and
that RHS LHS.
(LHS RHS) If c R is an upper bound for AB then c is clearly also an upper bound for
each of the sets A and B. In particular this is true if we take c = LHS. From this we see that
LHS sup A, since sup A is the least upper bound for A. Similarly LHS sup B. Therefore
LHS max(sup A, sup B) = RHS.
(RHS LHS) For all x A we have x sup A RHS. Similarly, for all x B we have
x sup B RHS. Thus, for all x A B we have x RHS. Since LHS= sup(A B) is
the least upper bound for A B, we have RHS LHS, as required.
From LHS RHS and RHS LHS, it follows that LHS = RHS.
(ii) The statement sup(A B) = min(sup A, sup B) is often false. Consider, for example,
A = 0, 2 and B = 0, 1. Then A B = 0 thus sup(A B) = 0 but sup A = 2 and
sup B = 1 i.e. min(sup A, sup B) = 1. There are many other examples where this equality
fails.
On the other hand sup(AB) = min(sup A, sup B) is true if A and B are bounded intervals
in R such that A B ,= (exercise).
4

You might also like