2022 S2 Exam solutions

MAM1019H Exam Solutions
University of Cape Town

Final Examination November 2022
Department of Mathematics and Applied Mathematics
Time: 3 hours Available marks: 85 Full marks: 80
Instructions
1. Answer all questions in the lined answer booklets.
2. Start each question on a new page. Number each page and put your
student number on the top of each page.
3. Make sure each answer is clearly labelled.
4. Show all work and reasoning unless otherwise instructed.
5. This test consists of 8 questions. Make sure your question paper is complete.
6. If you have read the instructions, on the inside cover write your favourite Greek
letter.
Good luck! 😊 ✨
1
1. Give an example of each of the following. If no such example exists, state so. No
explanations are required.
(a) A set S, other than P(N), whose cardinality is equal to |P(N)|.
(b) A set A and a proper subset B ⊊ A whose cardinality equals |A|.
(c) Two countable sets C and D whose union is uncountable.
(d) A countable set X with a subset Y that is uncountable.
(e) A set Z whose cardinality equals that of its power set.
(a) S = R
(b) A = R and B = (0, 1)
(c) Not possible
(d) Not possible
(e) Not possible
[5 marks]
2
2. (a) State the Cantor–Schröder–Bernstein Theorem.
(b) Consider the set A = {(a, b, c) ∈ N × N × N : a ≤ b ≤ c}. Use the Cantor–

Schröder–Bernstein Theorem to prove that |A| = |N × N × N|.
(a) Cantor–Schröder–Bernstein Theorem. Let A and B be sets such that

|A| ≤ |B| and |B| ≤ |A|, then |A| = |B|.
(b) We have A ⊆ N × N × N, thus |A| ≤ |N × N × N|. On the other hand, consider

the map f : N × N × N → A defined by f (a, b, c) = (a, a + b, a + b + c). Notice
that a ≤ a + b ≤ a + b + c for a, b, c ∈ N. Thus f is well-defined. It remains to
show that f is injective. Suppose (a, a + b, a + b + c) = (a′ , a′ + b′ , a′ + b′ + c′ ).
Then a = a, b = b′ and c = c′ thus (a, b, c) = (a′ , b′ , c′ ). So |N × N × N| ≤ |A|.
By CSB, the two cardinalities are equal.
[5 + 10 = 15 marks]
3
3. Consider the partially ordered sets (N, ≤) and (N, |).
(a) Give an example of an order-embedding f between the partially ordered sets.
(b) Prove that f is an order-embedding.
(c) Is f an order isomorphism? Give a brief reason.
(a) Define f (n) = 2n .
(b) Suppose n ≤ m, then 2n | 2m . Suppose 2n | 2m , then n ≤ m. Thus n ≤ m if

and only if f (n) | f (m).
(c) No, it is not bijective.
[1 + 3 + 1 = 5 marks]
4
4. (a) State the addition axioms.
(b) Prove that for all n, a, b ∈ N0 , if n + a = n + b then a = b.
You may use the following axioms and results:

• Peano axioms,
• Addition axioms,
• 0 + m = m for all m ∈ N0 ,
• s(m) = m + 1 for all m ∈ N0 ,
• Addition is associative and commutative.
(a) Addition Axioms. There is a binary operation + on N0 such that for all
n, m ∈ N0 ,
(A1) n + 0 = n,
(A2) n + s(m) = s(n + m).
(b) Let A = {n ∈ N0 : n + a = n + b implies a = b}. We will show that A = N0

using (P3). That is, for all n, a, b ∈ N0 , if we have n + a = n + b, then a = b.
We start by showing 0 ∈ A. That is, if 0 + a = 0 + b, then a = b. We have
0 + a = a and 0 + b = b. Thus a = b and so 0 ∈ A.
Now assume n ∈ A. We will show that s(n) ∈ A. Assume that s(n) + a =
s(n) + b. We need to show that this implies a = b. We have s(n) = n + 1. Thus
s(n) + a = (n + 1) + a = n + (1 + a)
s(n) + b = (n + 1) + b = n + (1 + b).
Then n + (1 + a) = n + (1 + b). Since n ∈ A, we then have 1 + a = 1 + b. That

is, s(a) = s(b). Since s is injective by (P2), we then have a = b, as desired.
Then by (P3), we have A = N0 . So the statement holds for all n ∈ N0 .
[5 + 15 = 20 marks]
5
5. (a) State the definition of partially ordered set.
(b) State the definition of the relation ≤ on N0 .
(c) Prove that (N0 , ≤) is a partially ordered set using the definition of ≤.
You may also use the following results:

• Addition axioms,
• Additive cancellation law,
• a + b = 0 if and only if a = b = 0.
(a) Definition. A pair (P, ≤) consisting of a set P and a relation ≤ is a partially

ordered set if ≤ is reflexive, anti-symmetric and transitive.
(b) Definition. m ≤ n for m, n ∈ N0 if and only if there exists z ∈ N0 such that

m + z = n.
(c) Suppose m ∈ N0 . Then m + 0 = m by (A1). Thus m ≤ m and so ≤ is reflexive.

Now suppose m, n ∈ N0 such that m ≤ n and n ≤ m. Then there exist a, b ∈ N0
such that m + a = n and n + b = m. Then we have
n = m + a = (n + b) + a = n + (b + a).
By the additive cancellation law, we must then have b + a = 0. Then we have

a = b = 0. Thus n = m + a = m + 0 = m. So ≤ is antisymmetric.
Now suppose n, m, p ∈ N0 such that n ≤ m and m ≤ p. Then there exist
a, b ∈ N0 such that n + a = m and m + b = p. Thus
p = m + b = (n + a) + b = n + (a + b).
Since a, b ∈ N0 , we have a + b ∈ N0 . Let c = a + b. Then we can write n + c = p.

That is, n ≤ p. So ≤ is transitive.
Because ≤ is reflexive, antisymmetric and transitive, it is a partial order on N0 .
[3 + 2 + 10 = 15 marks]
6
6. Let S be an infinite set and P(S) its power set. Consider the binary operation of
intersection, ∩, on P(S).
(a) Determine which of the following statements are true or false. No reasoning
required.
(i) ∩ is commutative.
(ii) ∩ is associative.
(iii) ∩ is idempotent.
(iv) P(S) has an identity element. If true, give the identity.
(v) Every X ∈ P(S) has an inverse. If true, give the inverse.
(b) Consider the subset Pfin (S) ⊆ P(S) consisting of finite subsets of S.
(i) Is Pfin (S) closed under ∩?
(ii) Is (Pfin (S), ∩) a group? Give a brief reason.
(a) (i) True.
(ii) True.
(iii) True.
(iv) True, S.
(v) False.
(b) (i) True.
(ii) False, no identity element since S is not finite.
[5 + 5 = 10 marks]
7
7. Let G be an abelian group. Define a subset H = {x ∈ G : x = x−1 }. Show that H is
a subgroup of G. Clearly indicate where you use the fact that G is abelian.
Let x, y ∈ H. We need to show xy ∈ H. That is, xy = (xy)−1 . We have (xy)−1 =

y −1 x−1 . Since G is abelian, this equals x−1 y −1 . But x, y ∈ H, so x−1 y −1 = xy. Thus
(xy)−1 = xy and so xy ∈ H. Suppose x ∈ H. Then x−1 = (x−1 )−1 , so x−1 ∈ H.
Finally, if e is the identity of G, then e = e−1 and so e ∈ H.
[5 marks]
8
8. Let (G1 , ∗1 ), (G2 , ∗2 ) and (G3 , ∗3 ) be groups. Suppose G1 ∼
= G2 and G2 ∼
= G3 . Prove
that G1 ∼= G3 .
Let f : G1 → G2 and g : G2 → G3 be isomorphisms. We claim that g ◦ f : G1 → G3

is an isomorphism. Let x, y ∈ G1 , then
(g ◦ f )(x ∗1 y) = g(f (x ∗1 y)) = g(f (x) ∗2 f (y)) = g(f (x)) ∗3 g(f (y)),
since g and f are both isomorphisms. Thus g ◦ f preserves operations. It remains

to show that g ◦ f is a bijection. Since it is the composition of two bijections, this
is true. Thus g ◦ f is an isomorphisms and G1 ∼ = G3 .
[10 marks]

2022 S2 Exam solutions

Uploaded by

Copyright:

Available Formats

2022 S2 Exam solutions

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

2022 S2 Exam solutions

Uploaded by

Copyright:

Available Formats

MAM1019H Exam Solutions

University of Cape Town

Time: 3 hours Available marks: 85 Full marks: 80

1. Answer all questions in the lined answer booklets.

3. Make sure each answer is clearly labelled.

4. Show all work and reasoning unless otherwise instructed.

(a) A set S, other than P(N), whose cardinality is equal to |P(N)|.

(b) A set A and a proper subset B ⊊ A whose cardinality equals |A|.

(c) Two countable sets C and D whose union is uncountable.

(d) A countable set X with a subset Y that is uncountable.

(e) A set Z whose cardinality equals that of its power set.

(b) A = R and B = (0, 1)

(c) Not possible

(d) Not possible

(e) Not possible

(b) Consider the set A = {(a, b, c) ∈ N × N × N : a ≤ b ≤ c}. Use the Cantor–

(a) Cantor–Schröder–Bernstein Theorem. Let A and B be sets such that

(b) We have A ⊆ N × N × N, thus |A| ≤ |N × N × N|. On the other hand, consider

(a) Give an example of an order-embedding f between the partially ordered sets.

(b) Prove that f is an order-embedding.

(c) Is f an order isomorphism? Give a brief reason.

(a) Define f (n) = 2n .

(b) Suppose n ≤ m, then 2n | 2m . Suppose 2n | 2m , then n ≤ m. Thus n ≤ m if

(c) No, it is not bijective.

(b) Prove that for all n, a, b ∈ N0 , if n + a = n + b then a = b.

You may use the following axioms and results:

(A2) n + s(m) = s(n + m).

(b) Let A = {n ∈ N0 : n + a = n + b implies a = b}. We will show that A = N0

Then n + (1 + a) = n + (1 + b). Since n ∈ A, we then have 1 + a = 1 + b. That

(b) State the definition of the relation ≤ on N0 .

You may also use the following results:

(a) Definition. A pair (P, ≤) consisting of a set P and a relation ≤ is a partially

(b) Definition. m ≤ n for m, n ∈ N0 if and only if there exists z ∈ N0 such that

(c) Suppose m ∈ N0 . Then m + 0 = m by (A1). Thus m ≤ m and so ≤ is reflexive.

By the additive cancellation law, we must then have b + a = 0. Then we have

Since a, b ∈ N0 , we have a + b ∈ N0 . Let c = a + b. Then we can write n + c = p.

(iv) P(S) has an identity element. If true, give the identity.

(v) Every X ∈ P(S) has an inverse. If true, give the inverse.

(i) Is Pfin (S) closed under ∩?

(ii) Is (Pfin (S), ∩) a group? Give a brief reason.

(a) (i) True.

(b) (i) True.

(ii) False, no identity element since S is not finite.

Let x, y ∈ H. We need to show xy ∈ H. That is, xy = (xy)−1 . We have (xy)−1 =

Let f : G1 → G2 and g : G2 → G3 be isomorphisms. We claim that g ◦ f : G1 → G3

since g and f are both isomorphisms. Thus g ◦ f preserves operations. It remains

You might also like