91Ó°ÊÓ

The concept of set theory is a cornerstone of modern mathematics, providing a foundation for various mathematical disciplines. In essence, a set is a well-defined collection of distinct objects, which may be anything from numbers to letters or even other sets.
Understanding set theory involves grasping fundamental operations and concepts, like union, intersection, and power sets. The union of two sets, such as in the case of two enumerable sets \( A \) and \( B \), combines all elements from both sets into a single set \( A \cup B \).
It's important to note that set theory not only focuses on operations but also on recognizing the size or cardinality of sets. This is where enumerability comes into play, defining whether a set's size is finite or can be counted using natural numbers.

Countable sets are a fascinating area of set theory that deals with sets whose elements can be listed in a sequence. A set is considered countable if its elements can be matched either with the natural numbers \( \mathbb{N} \) or if it is finite.
For example, the sets of integers, even numbers, and rational numbers are all countably infinite because we can establish such a one-to-one correspondence.
A key feature of countable sets involves bijective functions, which help establish this correspondence with natural numbers.

• **Countably Infinite Sets**: These are infinite sets where elements can be paired with every natural number, such as integer values.
• **Finite Sets**: These have a limited number of elements, like the set of weekdays.

Bijective functions, also known as one-to-one and onto functions, play a critical role in understanding the relationship between sets, particularly in proving that a set is countable.
A function is bijective if each element of one set is paired with a unique element of another set and every element of the second set is paired with an element from the first. This means not only are there no duplicate elements in the pairing, but no element is left out.
Utilizing bijective functions allows us to illustrate that even when combining two enumerable sets \( A \) and \( B \), their union \( A \cup B \) can still be enumerated. This is done by creating a new function that smartly assigns numbers from \( \mathbb{N} \) to elements of both contributing sets. In such constructions, choosing distinct mappings like odd or even integers simplifies the counting process.