Scribd
Upload
179 views2 pages

I. Class Notes of Topology-I, Semester-I, Unit-I..

This document contains class notes on topology from Unit 1. It defines what it means for a set to be denumerable, countable, and uncountable. It also proves that an infinite subset of a denumerable set is denumerable. Finally, it proves that the union of a denumerable set and a finite set is denumerable.

Uploaded by

Sahil Sharma
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
179 views2 pages

I. Class Notes of Topology-I, Semester-I, Unit-I..

This document contains class notes on topology from Unit 1. It defines what it means for a set to be denumerable, countable, and uncountable. It also proves that an infinite subset of a denumerable set is denumerable. Finally, it proves that the union of a denumerable set and a finite set is denumerable.

Uploaded by

Sahil Sharma
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/ 2

Class Notes On Topology-I(PSMATC-104)

Semester-I, 2021
Unit-1
Dr. Anu Kumari Khanna
Department Of Mathematics,
University Of Jammu,Jammu,
J & K, India.

March 16, 2021

Definition: A set X is said to be denumerable if X ∼ N.

Definition: A set X is said to be countable if either X is finite or denumerable.

Definition: An infinite set X is said to be non-denumerable or uncountable if it is not


denumerable.

Note: If X is a denumerable set, then we can write X = {x1 , x2 , .........xn , .....}.

Example: The set of even natural numbers Ne is a denumerable set.

Theorem: An infinite subset of a denumerable set is denumerable.

Proof: Let X be a denumerable set and let Y be an infinite subset of X. We have to show
that Y is denumerable. Since X is denumerable set, we can write X = {x1 , x2 , ........, xn , ........}.
Now Y ⊆ X implies if y ∈ Y, then y = xi , for some i ∈ N.
Let n1 be the least number such that xn1 ∈ Y. Since Y is infinite Y \ {xn1 } = 6 φ.
Let n2 be the least number such that xn2 ∈ Y \ {xn1 }.
Again, let n3 be the least number such that xn3 ∈ Y \ {xn1 , xn2 }.
In this way, we define nk be the least number such that xnk ∈ Y \ {xn1 , xn2 , ........, xnk−1 }. Since
Y is infinite, Y \ {xn1 , xn2 , .........., xnk } = 6 φ, for each k ∈ N.
Thus Y = {xn1 , xn2 , ........., xnk , ...............}.
We define f : N → Y by
f (k) = xnk , ∀k ∈ N.
Clearly, f is a bijection and N ∼ Y. This proves that Y is denumerable.

(D.O.M/ ∗ 2021)

1
Exercise: If X is denumerable and Y is a finite set. Then X ∪ Y is also denumerable.

Proof: We have two cases:


Case-I: If Suppose X ∩ Y = φ. Since X is denumerable, We can write X = {x1 , x2 , ......}. Also,
since Y is a finite set, there exist some k ∈ N such that Y ∼ Nk and so Y = {y1 , y2 .........., yk }.
Thus X ∪ Y = {y1 , y2 , ........yk , x1 , x2 , ......}
Define f : N → X ∪ Y by

yi if 1 ≤ i ≤ k
f (i) =
xi−k if i ≥ k + 1,

Clearly, f is a bijective map and so N ∼ X ∪ Y.


∴ X ∪ Y is denumerable.

Case-II: Suppose X ∩ Y 6= φ. So let X ∩ Y = A. Then A ⊆ Y.


Also, X ∪ Y = X ∪ (Y \ A). and X ∩ (Y \ A) = φ.
Since Y \ A ⊆ Y and Y is a finite set, so Y \ A is finite. Thus by case-I, X ∪ (Y \ A) is denu-
merable. But X ∪ (Y \ A) = X ∪ Y and so X ∪ Y is denumerable.


(D.O.M/ ∗ 2021)

You might also like