3.3. Definition of Countable Sets

So now what are the countable sets? So before going into the definition of countable sets let us see some motivation. Why we want to study countable set: the whole motivation behind countable sets is that we want to split the study of infinite sets into 2 categories. What are infinite sets: on a very high level they are sets which have infinite number of elements. So what we want to basically do is there might be several sets possible which are infinite, set of integers, sets of real numbers, set of irrational numbers and so on.

Countable sets help us categorize infinite sets. Infinite sets contain an unlimited number of elements. To understand their properties better, we split them into two types: countable and uncountable. Countable sets share a cardinality (size measure) with the set of positive integers, ℤ+, while uncountable sets do not.

Think of infinite sets like a huge library: countable sets are like a library with a well-organized catalog, allowing you to list all the books one by one, while uncountable sets are like a messy assortment of books piled up without order, making it impossible to categorize them systematically.

So when exactly we say a set A is countable? We say a set A is countable if it satisfies one of the following two conditions either it has to be finite namely it has finite number of elements or it has the same cardinality as the set of non-negative integers, namely the set of positive integers to be more precise. It has to be the same cardinality as the set of positive integers. If one of these 2 conditions are satisfied then we say that the set A is countable.

A set A is considered countable if it meets one of two criteria: it is finite (having a limited number of elements) or its size is identical to the set of positive integers (like 1, 2, 3, etc.). If it doesn't meet these criteria, it is termed uncountable.

Imagine counting apples in a basket; if there are a finite number of apples, you can easily count them. Conversely, consider collecting bus tickets from every journey you ever took. If you could keep collecting tickets indefinitely, you have an uncountable set of tickets because there's no upper limit to how many journeys you can take.

So if you are given an infinite set say S which is countable so since the set is infinite that means definitely we cannot say how many elements the set S has. But if its cardinality is same as these set of positive integers then we will call the set S to be countably infinite.

A countably infinite set is an infinite set that can be matched with the positive integers. Although we cannot enumerate its elements completely, we can establish a one-to-one correspondence with the positive integers, indicating that we can theoretically 'count' its elements despite their infinite nature.

Consider the set of all even numbers: it stretches infinitely, but we can match each even number (2, 4, 6,...) with a positive integer (1, 2, 3,...). This matching demonstrates that even though there are infinite even numbers, we can count them just like the natural numbers.

So if we are considering the second category of countable sets namely infinite sets whose cardinality is same as the set of positive integers then we use this notation aleph null (א0) to denote the cardinality of such sets.

Aleph null (א0) is a symbol used to represent the cardinality of the set of countably infinite sets, including the positive integers. It helps us distinguish between countable infinity (aleph null) and larger infinities, such as the real numbers.

Think of aleph null as a label for a box containing an infinite number of items, each marked with a unique number (like natural numbers). While we know the box can hold an unlimited amount of items, every item can still be identified with a specific number, making organization feasible.

If you are given a set S which is countable that means your set S is countably infinite. Then it is countable if and only; if it is possible to list the elements of the set S in the sequence indexed by positive integers.

This theorem states that a set is countable if you can arrange its elements in a sequence where each element corresponds to a positive integer. Such a listing shows that even though the set is infinite, every element is accounted for, reinforcing its classification as countable.

Imagine a long queue at a concert. Each person can be assigned a number based on their position in line (1st, 2nd, 3rd,...). Even if there are thousands of people, if we know each one has a specific spot in the queue, this order shows that we've effectively counted them, demonstrating countability despite their large number.

--