Scribd
Upload
13 views3 pages

2093 H 4 Sol

The document presents solutions to various mathematical problems related to set theory, functions, and mappings. It discusses concepts such as injective and bijective functions, the Glueing Lemma, and the relationships between different sets and their mappings. Key results include the countability of certain sets and the application of the Schroder-Bernstein Theorem.

Uploaded by

esteban0paredes0aule
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
13 views3 pages

2093 H 4 Sol

The document presents solutions to various mathematical problems related to set theory, functions, and mappings. It discusses concepts such as injective and bijective functions, the Glueing Lemma, and the relationships between different sets and their mappings. Key results include the countability of certain sets and the application of the Schroder-Bernstein Theorem.

Uploaded by

esteban0paredes0aule
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

MATH2093 Assignment 4 (Solution)

1. (a) Let A be a set. The identity function idA : A −→ A is an injective function. Hence A . A.
(b) Let A, B, C be sets. Suppose A . B and B . C. Pick some injective function f : A −→ B. Pick some
injective function g : B −→ C. g ◦ f is an injective function from A to C. Hence A . C.
(c) Let A, B be sets. Consider the ordered triple f = (A × B, B × A, F ), where

F = {((x, y), (y, x)) | x ∈ A and y ∈ B}.

F is a subset of (A × B) × (B × A). f is a bijective function from A × B to B × A. Hence A × B ∼ B × A.


(d) Let A, B, C, D be sets. Suppose A ∩ B = ∅, C ∩ D = ∅ and A ∼ C, B ∼ D. Pick some bijective
function f = (A, C, F ). Pick some bijective function g = (B, D, G). Consider the ordered triple h =
(A ∪ B, C ∪ D, F ∪ G). According to the Glueing Lemma, h is a bijective function. Hence A ∪ B ∼ C ∪ D.
(e) Let A, B be sets. Suppose A is infinite and B is countably infinite. Further suppose A ∩ B = ∅.
Since A is an infinite set, we have N . A. Pick some injective function g : N −→ A. Define the function
ĝ : N −→ g(N) by ĝ(n) = g(n) for any n ∈ N. ĝ is a bijective function.
Since B is a countably infinite set, we have N ∼ B. Pick a bijective function h : N −→ B.
Consider the ordered triple f = (A ∪ B, A, F ), where F is the subset of (A ∪ B) × A is given by

(y, g(2h−1 (y) + 1)) | y ∈ B ∪ (x, g(2ĝ −1 (x))) | x ∈ g(N) ∪ DA\g(N)


 

is a bijective function. (Apply the Glueing Lemma.)


Hence A ∼ A ∪ B.

2. (a) Let A, B, C be sets. Suppose A ⊂ C and (A 6= ∅ or B 6= ∅).


• Suppose B = ∅. Then A 6= ∅. Since A ⊂ C, we have C 6= ∅. Then Map(A, B) = Map(C, B) = ∅.
Hence Map(A, B) . Map(C, B).
• Suppose B 6= ∅. Pick some z ∈ B. Define ψ ∈ Map(C\A, B, Ψ) by Ψ = (C\A) × {z}.
For any ϕ ∈ Map(A, B), there exists some Φ ∈ P(A × B) such that ϕ = (A, B, Φ). According to the
Glueing Lemma, (C, B, Φ ∪ Ψ) is a function from C to A.
Let F be the subset of Map(A, B) × Map(C, B) given by

F = {((A, B, Φ), (C, B, Φ ∪ Ψ)) | (A, B, Φ) ∈ Map(A, B)}.

The ordered triple f = (Map(A, B), Map(C, B), F ) is an injective function.1


Hence Map(A, B) . Map(C, B).
(b) Let A, B, C be sets. Suppose A . C and (A 6= ∅ or B 6= ∅).
Since A . C, we may pick some injective function g : A −→ C. We have g(A) ⊂ C and A ∼ g(A).
We also have g(A) 6= ∅ or B 6= ∅.
Therefore Map(A, B) ∼ Map(g(A), B) . Map(C, B).
(c) Let A, B, D be sets. Suppose B ⊂ D. Consider the inclusion function ιB of B into D.
Define the function h : Map(A, B) −→ Map(A, D) by h(ϕ) = ιB ◦ ϕ for any ϕ ∈ Map(A, B). h is an
injective function. (Why?)
Hence Map(A, B) . Map(A, D).
1 The injective function f : Map(A, B) −→ Map(C, B) is explicitly given by by

ϕ(x) if x ∈ A
(f (ϕ))(x) =
z if x ∈ C\A

for any ϕ ∈ Map(A, B).

1
(d) Let A, B, D be sets. Suppose B . D. We may pick some injective function j : B −→ D. We have
j(B) ⊂ D and B ∼ j(B).
Then we have Map(A, B) ∼ Map(A, j(B)) . Map(A, D).
(e) Suppose A . C and B . D and (A 6= ∅ or D 6= ∅).
Then we have Map(A, B) . Map(A, D) . Map(B, D).

3. Let A, B, C be sets.

(a) We denote the projection function from B × C to B by πB , and denote the projection function from B × C
to C by πC , (so that πB (y, z) = y, πC (y, z) = z for any y ∈ B, z ∈ C).
Let F be the subset of Map(A, B × C) × (Map(A, B) × Map(A, C)) given by

F = {(ϕ, (πB ◦ ϕ, πC ◦ ϕ)) | ϕ ∈ Map(A, B × C)} .

The ordered triple f = (Map(A, B × C), Map(A, B) × Map(A, C), F ) is a bijective function.2 Hence
Map(A, B × C) ∼ Map(A, B) × Map(A, C).
(b) Define the function g : Map(A × B, C) −→ Map(A, Map(B, C)) −→ by ((g(ϕ))(x))(y) = ϕ(x, y) for any
ϕ ∈ Map(A × B, C), x ∈ A, y ∈ B.
We verify that g is bijective:
• Pick any ϕ, ψ ∈ Map(A × B, C). Suppose g(ϕ) = g(ψ). Then, for any x ∈ A, y ∈ B, we have
ϕ(x, y) = ((g(ϕ))(x))(y) = ((g(ψ))(x))(y) = ψ(x, y). Therefore ϕ = ψ.
It follows that g is injective.
• Pick any η ∈ Map(A, Map(B, C)). Define ϕ ∈ Map(A × B, C) by ϕ(x, y) = (η(x))(y) for any x ∈ A,
y ∈ B.
We have ((g(ϕ))(x))(y) = ϕ(x, y) = (η(x))(y) for any x ∈ A, y ∈ B. Then (g(ϕ))(x) = η(x) for any
x ∈ A. Therefore g(ϕ) = η.
It follows that g is surjective.
(c) We have A×B ∼ B×A. Then Map(A, Map(B, C)) ∼ Map(A×B, C) ∼ Map(B×A, C) ∼ Map(B, Map(A, C)).
(d) We have P(B) ∼ Map(B, {0, 1}) and P(A) ∼ Map(A, {0, 1}).
Hence Map(A, P(B)) ∼ Map(A, Map(B, {0, 1})) ∼ Map(B, Map(A, {0, 1})) ∼ Map(B, P(A)).

4. (a) We have {0, 1} . N. Then Map(N, {0, 1}) . Map(N, N).


(b) We have N . Map(N, {0, 1}). Then Map(N, N) . Map(N, Map(N, {0, 1})).
(c) We have N × N ∼ N and Map(N, Map(N, {0, 1})) ∼ Map(N × N, {0, 1}).
Then Map(N, N) . Map(N, Map(N, {0, 1})) ∼ Map(N × N, {0, 1}) ∼ Map(N, {0, 1}).
We also have Map(N, {0, 1}) . Map(N, N).
According to the Schröder-Bernstein Theorem, we have Map(N, N) ∼ Map(N, {0, 1}).
(d) We have R ∼ Map(N, {0, 1}) ∼ Map(N, N).
(e) We have {0, 1} . N. Then Map(R, {0, 1}) . Map(R, N).
We have R ∼ R × R. Map(R, Map(R, {0, 1})) ∼ Map(R × R, {0, 1}) ∼ Map(R, {0, 1}).
We also have N . Map(N, {0, 1}) . Map(R, {0, 1}).
Then Map(R, N) . Map(R, Map(R, {0, 1})) ∼ Map(R, {0, 1}).
According to the Schröder-Bernstein Theorem, we have Map(R, {0, 1}) ∼ Map(R, N).
2 The bijective function f : Map(A, B × C) −→ Map(A, B) × Map(A, C) is explicitly given by f (ϕ) = (πB ◦ ϕ, πC ◦ ϕ) for any
ϕ ∈ Map(A, B × C).

2
(f) We have N . R. Then Map(R, N) . Map(R, R).
We have Map(R, R) . Map(R, Map(R, {0, 1})) ∼ Map(R × R, {0, 1}) ∼ Map(R, {0, 1}) . Map(R, N).
According to the Schröder-Bernstein Theorem, we have Map(R, N) ∼ Map(R, R).

5. (a) Let Ω be a subset of P(R). Suppose the following conditions are satisfied:
• For any I ∈ Ω, I is an interval which is neither the empty set nor a singleton.
• For any I, J ∈ Ω, if I 6= J then I ∩ J = ∅.
For any I ∈ Ω, there exists some xI ∈ Q such that xI ∈ I.3
Define the function f : Ω −→ Q by f (I) = xI for any I ∈ Ω.
Suppose I, J ∈ Ω and xI = xJ . Then I ∩ J 6= ∅. Therefore I = J. It follows that f is injective.
Hence Ω . Q ∼ N. The set Ω is countable.
(b) Let Ξ be a subset of P(R). Suppose the following conditions are satisfied:
• I is an open (non-empty) interval for any I ∈ Ξ.
[
• I = R.
I∈Ξ
 
1 1
For any x ∈ Q, there exists some nx ∈ N∗ , Ix ∈ Ξ such that x− ,x + ⊂ Ix . (Note that x ∈ Ix .)
nx nx
Define the function g : Q −→ Ξ by g(x) = Ix for any x ∈ Q.
We have g(Q) . Q ∼ N. g(Q) is countable.
[ [ [ 1 1
 [
We also have I= Ix ⊃ x− ,x + = R.4 Hence I = R.
nx nx
I∈g(Q) x∈Q x∈Q I∈g(Q)

3 We have applied the following result in analysis:


For any s, t ∈ R, if s < t then there exists some q ∈ Q such that s < q < t.

4 We have applied the following result in analysis:


1 1
For any r ∈ R, for any n ∈ N∗ , there exists q ∈ Q such that q − <r<q+ .
n n

You might also like