# Exploring Cantor's Theorem: The Beauty of Infinite Sets

Written on

## Chapter 1: Introduction to Cantor's Theorem

Georg Cantor (1845–1918) made a significant impact with his groundbreaking paper in 1874 titled “Ueber eine Eigenschaft des Inbegriffes aller reellen algebraischen Zahlen,” published in the Journal für die Reine und Angewandte Mathematik. This work laid the foundation for what we now know as Cantor's Theorem.

As David Hilbert famously remarked, “No one will drive us from the paradise which Cantor created for us.” What better way to spend time in solitude than by contemplating the infinite? Today, we will tackle one of the simplest yet most elegant proofs in mathematics: Cantor's Theorem.

While it may be described as simple and elegant, it is by no means easy!

### Section 1.1: Understanding the Problem

Cantor's theorem addresses whether the elements of a set can be paired one-to-one with its subsets, a concept known as ‘bijection’. This inquiry relates to a mathematical idea known as ‘cardinality’. We can think of a one-to-one correspondence as a form of set-theoretical matchmaking, where each element finds its exclusive pair in another set, avoiding scenarios of multiple partners and ensuring every mathematical object has a match.

For example, consider the set {1, 2, 3}, which contains three elements: 1, 2, and 3. It has a total of eight subsets: {1}, {2}, {3}, {1, 2}, {2, 3}, {1, 3}, {}, and {1, 2, 3}, where the empty set {} can be overlooked for now as it won't play a significant role. Alternatively, visualize this as three balls numbered 1, 2, and 3, with the subsets representing different combinations of balls placed in a small sack. One possibility is placing no balls in the sack, representing the empty set.

Up to this point, everything seems straightforward. For finite sets, it's quite apparent that if a set contains N elements, then the collection of subsets will have 2^N elements. In our example, the set {1, 2, 3} has three elements, leading to eight subsets (8 = 2 × 2 × 2 = 2^3).

It's worth noting that the term ‘set of subsets’ may seem intimidating. To clarify, a subset is a valid mathematical concept; if you have some items, you can group some together while leaving others out. You might envision the original set as a roster of football players, with the subsets representing all possible teams you can form from those players, regardless of size. When we introduce an infinite number of players, the concept becomes more complex, yet the fundamental idea remains the same.

However, Cantor aimed higher. What happens when dealing with sets containing an infinite number of elements? Can we compare the sizes of two infinite sets? (Spoiler alert: we can!)

### Section 1.2: The Proof Unfolds

Cantor begins by assuming that a one-to-one pairing has been established. This means there exists a function that assigns each element of a set to a subset. For every subset, there is a corresponding element that maps to it, with no two elements mapping to the same subset.

For instance, someone might suggest a function that maps 1 to {1}, 2 to {2, 3}, and 3 to {1, 2}. However, since nothing is mapped to the subset {1, 2, 3}, the pairing fails.

To generalize, Cantor prompts us to consider the ‘set of elements not contained in the subset they are mapped to.’ In our earlier example, since 3 is mapped to {1, 2} and is not part of that set, it fits nicely into the criteria.

In this mathematical matchmaking scenario, this particular set also requires a counterpart. But who could fulfill that role? If an element is assigned to this set, and it is contained within it, that creates a contradiction. Why? Because it would then be included in the subset to which it was mapped! Conversely, if the element is not in the set, that too leads to a contradiction; by definition, it must be included, as it is not part of the subset it was assigned to.

Thus, Cantor performs his mathematical magic. By presuming our hypothetical matching function was effective, we discovered a situation where it could not possibly succeed.

## Chapter 2: Further Explorations

In the video "Intro to Proofs - Cantor's theorem - YouTube," viewers are introduced to the basic concepts behind Cantor's theorem, exploring its implications in the realm of set theory.

The second video, "Cantor's Theorem (Proof) - YouTube," delves deeper into the proof of Cantor's theorem, providing a comprehensive understanding of its significance in mathematics.