Power Set of Natural Numbers Is Countable
Power Set of Natural Numbers Is Countable
Volume 7, Issue 3, March – 2022 International Journal of Innovative Science and Research Technology
ISSN No:-2456-2165
Power Set of Natural Numbers is Countable
Sonia Sharma, Mathematics Department
PCM S. D. College for Women,Jalandhar, India
Abstract:- This paper explains the Cardinality of the { n1 , n2 } ⟶ 3n , ( with the help of Well ordering Principle)
Power Set of Natural numbers. Set of Natural numbers { n1, n2 , n3 } ⟶ 5n.
.
is countable, in the same way the power set of Natural
numbers is also countable as every subset of the Power 2𝑛 ≠ 3𝑛 ≠ 5𝑛 ≠ ….. . .
set of Natural numbers is Countable. Prime numbers
and Well ordering Principle play a very important role Since Set of Natural numbers is countable therefore
in proving this result. Since every Subset of Natural every member of P ( 𝑁 ) is countable set ,so order of each
numbers is Countable, there exists a bijection between finite member of P ( 𝑁 ) is a Whole number and every non
the Power Set of Natural numbers and a proper subset empty Subset of Natural numbers whether finite or infinite
of Natural numbers. must contain the smallest element ( well ordering
principle),thus collection of all finite subsets of Natural
Keywords:- Subset, Power set , Order of a Power Set of a numbers is countable.
Set, Well ordering Principle, Prime Numbers, countable
set, bijection, Uncountable Set. Now infinite subsets of Natural numbers can be classified
into three categories: 1. Even subsets 2. Odd subsets 3. Mixed
I. INTRODUCTION Subsets. Every infinite subset of Natural numbers must have a
least positive integer
Set Ν of natural numbers is infinite but countable. The
Power Set of Every Finite Set is Countable if A contains 5 A. Infinite Even Subsets
elementsi.e O( A) = 5 . then its power set contains O(P( A)) E1 = { 2,4,6,8,………, 𝑒1𝑘 , ………. } is the first infinite
= 25 = 32 elements O(P( A) > O(A) but still countable. In Subset of Natural numbers, E2 = { 2,4,6,8, ……….𝑒2𝑘 ,………
the same way P( Ν ) is also countable.
} is the second even subset of Natural numbers where
𝑒1𝑘 <𝑒2𝑘
Lemmas
Axiom : Well Ordering Principle : Every non empty
Subset of Natural numbers contains its least Define the map f: P (𝑁) → S
element. E1→ (2.3)1
2
Axiom : An infinite set A is said to be Countable if E2→ (2.3)
there exists one- one correspondence between A and E3→ (2.3)3
Set of . .
Natural Numbers or between A and a subset of . .
Natural Numbers. En→ (2.3)n
. .
Theorem : Every subset of a Countable Set is
. .
Countable. . .
Theorem : Every countable union of Countable Sets
is countable.
B. Infinite Odd Subsets:
II. MAIN RESULT O1 = { 1,3,5,7,9, …… , 𝒐𝟏𝒌 ,……} , O2 = {
1,3,5,7,9,………,𝒐𝟐𝒌 ,………. },…………
𝑁 = { 1, 2, 3, 4, ………} is a countable set of
Natural Numbers. Every subset of a countable set is also 𝑜1𝑘 <𝑜2𝑘
countable. Define the map f: P (𝑁) → S
Consider S = { 1, pk, , (p.q)k ; k, p, q ∈ 𝑁 and p & q O1→ (3.5)1
are prime numbers with ( p, q ) = 1 } ⊂ 𝑁 . O2→ (3.5)2
As S is a proper Subset of Natural numbers , O3→ (3.5)3
therefore S is a Countable Set . .
. .
Hence | S| = |𝑁| = ℵ0 On → (3.5)n
. .
P( 𝑁 ) = { 𝜙, { 1 }, { 2 }, { 3 }, ………. } ( collection . .
. .
of all subsets of natural numbers )
Define f : P ( 𝑁 ) ⟶ S , such that
𝜙 ⟶1
{ n } ⟶2n
IJISRT22MAR967 www.ijisrt.com 1191
Volume 7, Issue 3, March – 2022 International Journal of Innovative Science and Research Technology
ISSN No:-2456-2165
C. Infinite Mixed Subsets : P (𝑁) = 𝐾0 ∪ (⋃𝐾𝑛∈𝑃(𝑁) 𝐾𝑛) ⋃𝐼𝑛∈𝑃(𝑁) {𝐼𝑛 } , 𝑤ℎ𝑒𝑟𝑒 𝐼𝑛 Is an
Each Mixed Infinite subset of natural numbers contain infinite Subset of 𝑁 .
Even and odd natural numbers.
𝐾𝑛 = { A ; A∈ P(𝑁) & O( A ) = n } , 𝐾0 = 𝜙.
M1 = { 1, 2, 3, 4, 5, …………, 𝑚1𝑘 ……} = 𝑁 ,
M2 = { 1, 2, 3, 4, 5, …………,𝑚2𝑘 ……} 𝐾1 ≅ 𝑁, 𝐼1 = 𝑁
𝐾2 ⊂ 𝑁 X 𝑁𝐼2 = 𝑁1
𝑚1𝑘 <𝑚2𝑘 𝐾3 ⊂ 𝑁 X 𝑁 X 𝑁𝐼3 = 𝑁2
Define the map f: P (𝑁) → S 𝐾4 ⊂ 𝑁 X 𝑁 X 𝑁 X 𝑁𝐼4 = 𝑁3
M1 (2.5)1 . .
M2→ (2.5)2 .
M3→ (2.5)3 𝐾𝑛 ⊂ 𝑁 𝑛 𝐼𝑛 = 𝑁𝑛
. . . .
. . . .
Mn→ (2.5)n
. .
each 𝐼𝑛 is an infinite subset of the set of Natural numbers
. .
must having a least positive integer according to the well
. .
ordering Principle.
Here The map defined f: P (𝑁) → S is a one - one The countable union of Countable Sets is countable.
map ,But S is Countable as S is a subset of 𝑁 , Which is Hence
Countable Set and every subset of a countable set is P (𝑁) is Countable.
Countable.
REFERENCES
S1 = { 1, pn , 6n , 10n , 15n , ∀ 𝑛 ∈
𝑁, 𝑝 𝑖𝑠 𝑎 𝑝𝑟𝑖𝑚𝑒 𝑛𝑢𝑚𝑏𝑒𝑟 } [1.] M.R. Chowdhury, “ A Simple Approach to
Countability”, vol. 1, no. 2, BRAC UNI. JOURNAL,
S1 is a proper subset of S and hence proper subset of 2004.
𝑁 [2.] R. Schwartz, “ Countable and Uncountable Sets”, Nov.
The function f1 : P (𝑁) → S1 defined as 2007 https://www.math.brown.edu
[3.] M. M. Abdullahi and Okorie,, K. Okam, “ A study of
f1 ( A) = f (A) ∀ A∈ P (𝑁) is a Bijection from P Some Results on Countable Sets” Asian Research Journal
(𝑁) to a countable subset of 𝑁 hence P (𝑁) is countable. of Mathematics, July 2019.
2ℵ0 = ℵ0
III. CONCLUSION
Another way of writing elements of P (𝑁) = { 𝜙, { 1
}, {2}, {1,2}, {3}, { 1, 3 }, { 2, 3 }, { 1, 2, 3 }, {4}, { 1, 4},
{2, 4 }, {1,2,4 }, {3,4}, { 1,3,4 }, { 2,3,4} , {
1,2,3,4}, {5} ………………}
𝜙 is the first element of P(𝑁) , second element is
Singleton set of first natural number {1}, 𝜙 ∪ {1} = {1}
has already written so second natural number is 2 so the
third element is {2} , 𝜙 ∪ {2} = {2 } already written, so 4th
element of P(𝑁) is {2} ∪ {1} = {1,2} ,{2}∪ {2} = {2}
already written, 5th element is a singleton set containing
next natural number i.e. {3} . Whenever a singleton set is
written next elements would be the union of that set with
previous elements, to ignore those elements which have
already been written.
Every Subset of P (𝑁) is Countable as every element
of The subset of P (𝑁) can be arranged in a systematic way
using the Well ordering Principle. Whether the Power Set
of a Set contains more elements but it does not mean that it
is uncountable.
