Exercise Section 1.

1. Prove that a non-empty set T1 is finite if and only if there is a bijection from T1 onto a finite
set T2.
Answer:
Let T1, T2 be sets
 Let T1 is finite, T1 = {𝑎1, 𝑎2 , … , 𝑎𝑛 }.Define T2 := T1 and f : T1 → T2, 𝑎𝑖 → 𝑎𝑖 , for i= 1,2,…,
n. Since f is identity map, then f is a bijection.
 Let T2 be a finite set and f : T1 → T2 be a bijection,
Define 𝑔 = 𝑓 −1 . 𝑔 ∶ 𝑇2 → 𝑇1 is a bijection. (Because f is a bijection, then f-1is a bijection
too). Since g is onto, 𝑇1 = 𝑔(𝑇2 ) = (𝑔(𝑡2 ), 𝑡2 ∈ 𝑇2 . Then, let T2 = {𝑎1, 𝑎2 , … , 𝑎𝑛 }.
So, We get that 𝑇1 = 𝑔(𝑇2 ) = {𝑔(𝑎1 ), 𝑔(𝑎2 ), … , 𝑔(𝑎𝑛 )}.
Then, proved that 𝑇1 is finite if and only if there is a bijection from T1 onto a finite set
T2.
2. Prove parts (b) and (c) of Theorem 1.3.4

Answer :

Theorem b :

Let 𝑓 be a bijection of 𝑁𝑚 onto A

C= {𝑥} and 𝐶 ⊆ 𝐴 → 𝑥 = 𝑓(𝑘), for some k, 1 ≤ 𝑘 ≤ 𝑚.

Lets define g: 𝑁𝑚−1 → 𝐴\𝑐,

g(𝑖) = 𝑓(𝑖), (𝑖) = 1, … . , 𝑘 − 1

g(𝑖) = 𝑓(𝑖 + 1), (𝑖) = 𝑘, … . , 𝑚 − 1

g is bijection

 Injectivity
Let 𝑔(𝑖) = 𝑔(𝑗) 𝑓 injection

If 𝑖, 𝑗 < 𝑘 ⟹ 𝑓(𝑖) = 𝑓(𝑗) 𝑖=𝑗

𝑓 injection
 If 𝑖, 𝑗 ≥ 𝑘 ⟹ 𝑓(𝑖 + 1) = 𝑓(𝑗 + 1) 𝑖+1=𝑗+1⟺𝑖 =𝑗

𝑓 injection

If 𝑖 < 𝑘, 𝑗 ≥ 𝑘 ⟹ 𝑓(𝑖) = 𝑓(𝑗 + 1) 𝑖 =𝑗+1⟹𝑖 >𝑗 but 𝑖 < 𝑗.

Contradiction
Same argument for 𝑖 ≥ 𝑘, 𝑗 < 𝑘.

 Surjectivity
.𝑦 ∈ 𝐴\𝐶 ⊆ 𝐴, 𝑦 ∉ 𝐶
.⟹ ∃ 𝑖 ∈ 𝑁𝑚 𝑓(𝑖) = 𝑦
If 𝑖 < 𝑘, 𝑡ℎ𝑒𝑛 𝑔(𝑖) = 𝑓(𝑖) = 𝑦 ⟹ 𝑦 ∈ 𝑅(𝑔).
If 𝑖 > 𝑘, 𝑡ℎ𝑒𝑛 𝑔(𝑖 − 1) = 𝑓(𝑖) = 𝑦 ⟹ 𝑦 ∈ 𝑅(𝑔).
𝑖 ≠ 𝑘 𝑠𝑖𝑛𝑐𝑒 𝑓(𝑘) = 𝑥 ∈ 𝐶
Therefore, 𝑅(𝑔) = 𝐴\𝐶

3. Let S:= (1,2) and T:= (a,b,c).

a) Determine the Number of different injection from S into T
b) Determine the Number of different subjections from T to S.
Answer:
a) Hence 1 can be mapped to a,b,c. 3 options
Then 2 has 2 options to be mapped to which can alten also Therefore total 6 cases
The number of different injections from S into T is 6
b) T S

A 1
B 2
C
4. Exhibit a bijection between ℵ and the set of all odd integers greater than 13.
Answer :
Lets denote the set of all odd integers greater than 13 by 𝑆 →
𝑆 = {2𝑛 + 13 ∶ 𝑛 ∈ ℵ}
Define 𝑓: ℵ → 𝑆 𝑏𝑦
𝑓(𝑛) = 2𝑛 + 13, 𝑛 ∈ ℵ
f is surjective :
for every odd integer x greater than 13 there exists 𝑛 ∈ ℵ. For which
𝑥 − 2𝑛 + 13 → 𝑓(𝑛) = 𝑥
f is injective :
suppose 𝑓(𝑛) = 𝑓(𝑚) → 2𝑛 + 13 = 2𝑚 + 13 → 𝑛 = 𝑚
For surjection from T to S any too elements of T should be mapped to S. Now number of
this kind of pairs in T is 3 i.e . (a,b), (a,c), (b,c). So any of this pairs can be mapped to 1
and the remaining element will be mapped to 2. The same thing will happen if we inter
change the role of 1 and 2 . the number of different surjection from T onto S is 6.

5. Give an Explicit definition of the bijective f from N onto Z described in Example 1.3.7
(b)

Example 1.3.7 (b)

The set Z of all integers is denumerable to construct a bijection of N onto Z, we map 1

onto 0, we map the set of even natural numbers onto the set N of positive integers and we
map the set of odd natural numbers onto the negative integers. This mapping can be
displayed by the enumeration :
Z ={ 0, 1, -1, -2, -3, -4}

Let f : N  Z
f is defined as
f(1) = 0
f(2n) = n where n 𝜖 N
f(2n+1) = -n where n 𝜖 N
 Then f is the bijection from N onto Z which maps 1 To ), even numbers to positive
integers and odd numbers to ngegative integers

6. Exhibit a bijection between ℕ and a proper subset of itself.

Answer :
The set of all even integers 2ℕ = {2𝑛 ∶ 𝑛 ∈ ℕ} is a proper subset of ℕ. Function 𝑓 defined as
𝑓(𝑛) = 2𝑛
Is a bijection from 𝑁 into 2ℕ.
Proof :
Injectivity : Suppose 𝑓(𝑛) = 𝑓(𝑚) ⇒ 2𝑛 = 2𝑚 ⇒ 𝑛 = 𝑚.
Surjectivity : An arbitrary even integer 𝑥 is equal to 2𝑛, for some 𝑛 ∈ ℕ. Then 𝑓(𝑛) = 2𝑛 = 𝑥.

7. Prove that a set T¹ is denumerable if and only if there is a bijection from T¹ onto a denumerable
set T².
Answer :
8. Given an example of a countable collection of finite sets whose union is not finite.
Answer : Let us consider the countable collection of following singleton sets :
{1} , {2}, ….. , {n}, {n-1}, …...
i.e. { {n} : n   }
The union of these sets is  which is not finite.
9.
10. a) If (m,n) is the 6th point down the 9th diagonal of the array in figure 1.3.1, calculate its
number according to the counting method given for Theorem 1.3.8.
b) Given that h(m,3) = 19, find m.

Answer:
(a) We can easily see that the 6th point down the 9th diagonal is (6,4) since it satisfies
𝑘 = 𝑚 + 𝑛 − 1 from the diagonal procedure. From there 𝑛 = 9 − 6 = 1 = 4.
We count the point (m,n) by first counting the points in the first 𝑘 − 1 = 𝑚 + 𝑛 −
2 diagonals and then adding m. For that we have a counting function ℎ: ℕ × ℕ →
defined as

1
ℎ(6,4) = (𝑚 + 𝑛 − 2)(𝑚 + 𝑛 − 1) + 𝑚
2

Now we only need to include the obtained point into the formula
1
ℎ(𝑚, 𝑛) = (6 + 4 − 2)(6 + 4 − 1) + 6
2
1
= 2 . 8.9 + 6 = 36 + 6 = 42

(b) Lets see the value of h(m,3) using the above formula of counting function
1
ℎ(𝑚, 3) = (𝑚 + 3 − 2)(𝑚 + 3 − 1) + 𝑚
2
1
= (𝑚 + 1)(𝑚 + 2) + 𝑚
2
1
= (𝑚2 + 3𝑚 + 2) + 𝑚
2
1 2 5
= 𝑚 + 𝑚+1
2 2
Now, we have the quadric equation to solve
1 5
2
𝑚2 + 2 𝑚 + 1 = 19
 That is

𝑚2 + 5𝑚 − 36 = 0
The solution are
144
𝑚(1,2) = −5√25 +
2
𝑚1 = 4
𝑚2 = −9∄ℕ
Therefore, m=4

11. Determine the number of elements in 𝑃(𝑆),the collection of all subsets of S,for each of the
following sets :

Solution:

We know that if a set S has n elements,the number of elements in P(S) is 2n the

number of subsets of S)

a) 𝑆 ∶= {1,2}
The number of elements in P(S) is 22= 4
b) 𝑆 ∶= {1,2,3}
The number of elements in P(S) is 23 = 8
c) 𝑠 ∶= {1,2,3,4}
The number of elements in P(S) is 24 = 16

12. Use Mathematical Iducation to prove that if the set S has n elements, then P(S) has 2n
elements.
Answer :
A set S has n element. Say
S = { x1, x2 , . . . , xn }
For n = 1, The subset of S = {x1 } are ∅ and S. The number of subset is 21 = 2.
For n = 2, S := {x1 , x2}. The subset of S are ∅, {x1}, {x2} and S.
Let the claim be true for n – 1, i.e.

if S’ := { x1, x2 , . . . , xn }, then the number of subset 2n-1.

 Now if S := { x1, x2 , . . . , xn }, then all the subset of S’ are also subset of S, and any
subset of S’ in union with {xn} is also a subset of S. Therefore, the total number of
subsets of S is 2n-1 + 2n-1 = 2n
hence, if the set S has n element, then P(S) has 2n element.

13. Prove that collection F (ℕ) of all finite subsets of N is Countable

Answer :
( Ex (12): Let 𝐹(ℕ) be the set of all finite subsets of ℕ.
To show: 𝐹(ℕ) is countable.
Define 𝐴𝑚 ⊆ 𝐹(ℕ) s.t
𝐴𝑚 = 𝑃({1,2, … , 𝑚}), 𝑚 = 1,2,3, ….

Note, by Ex (11), |𝐴𝑚 | = 2𝑚 < ∞.

∴ 𝐴𝑚 is finite and thus is countable.
Now, I claim that 𝐹(ℕ) = ⋃∞
𝑚=1 𝐴𝑚

Proof: take any 𝑋 ∈ 𝐹(ℕ),

∴ 𝑋 = {𝑥1 , 𝑥2 , … , 𝑥𝑛 : 𝑥𝑖 ∈ ℕ}
Let 𝑥𝑘 = 𝑚𝑎𝑥(𝑋) (it exists since X is finite)
Note 𝑋 ∈ 𝑃({1,2,3, … , 𝑥𝑘 })
∴ 𝑋 ∈ 𝐴𝑥𝑘 ∞
∞ 𝐹(ℕ) ⊆ ⋃ 𝐴𝑚
∴ 𝑥 ∈ ⋃ 𝐴𝑚 ⇒ 𝑚=1
𝑚=1
And 𝐴𝑚 ⊆ 𝐹(ℕ) (by definition of 𝐴𝑚 )

∴ ⋃ 𝐴𝑚 ⊆ 𝐹(ℕ)
𝑚=1

∴ 𝐹(ℕ) ⊆ ⋃ 𝐴𝑚
𝑚=1
Now 𝐴𝑚 are countable ∀𝑚 ∈ ℕ.
∴ By theorem 1.3.12, ⋃∞
𝑚=1 𝐴𝑚 is also countable.

∴ 𝐹(ℕ) is countable