For most of my life, I treated “infinity” as a single concept — a vague, boundless “forever” that you either reached or didn’t. It genuinely surprised me to learn that mathematicians don’t treat infinity that way at all. Infinity comes in different sizes, some provably larger than others, and this isn’t some fringe philosophical idea — it’s rigorously proven mathematics, developed primarily by Georg Cantor in the late 19th century, and it remains foundational to modern set theory. I want to walk through exactly how mathematicians compare the sizes of infinite sets, and what that reveals about the structure of numbers themselves.
How Do You Even Compare Sizes You Can’t Count?
With finite sets, comparing size is trivial: count the elements, compare the numbers. But you can’t literally count an infinite set one by one and finish. So mathematicians use a different, more clever method: a one-to-one correspondence, also called a bijection.
Two sets are considered the same size if you can pair up every element of one set with exactly one element of the other, with nothing left over on either side. This works perfectly for finite sets — five fingers on one hand correspond one-to-one with five fingers on the other — but it also extends cleanly, and sometimes surprisingly, to infinite sets.
$$ f: A \rightarrow B \text{ is a bijection if } f \text{ is one-to-one and onto} $$
The Smallest Infinity: Countable Sets
The natural numbers — 1, 2, 3, 4, and so on — form the baseline infinite set. Mathematicians call this size aleph-null, written $\aleph_0$, and any set that can be paired up one-to-one with the natural numbers is called “countably infinite.”
Here’s where the intuition-breaking starts. Consider the even numbers: 2, 4, 6, 8, and so on. You might assume there are “half as many” even numbers as natural numbers, since every other number is skipped. But you can pair them up perfectly:
$$ 1 \leftrightarrow 2, \quad 2 \leftrightarrow 4, \quad 3 \leftrightarrow 6, \quad 4 \leftrightarrow 8, \dots $$
$$ f(n) = 2n $$
Every natural number maps to exactly one even number, and every even number gets hit exactly once. That means, by the strict mathematical definition of size for infinite sets, there are exactly as many even numbers as there are natural numbers — both sets have size $\aleph_0$. This is deeply counterintuitive at first, but it’s a direct, unavoidable consequence of how mathematicians define “same size” for infinite collections.
Even the Rational Numbers Are Countable
It gets stranger. The rational numbers — every possible fraction, like 1/2, 3/7, or -22/9 — seem like they should vastly outnumber the natural numbers, since there are infinitely many fractions between any two natural numbers. And yet, the rational numbers are also countably infinite, with size $\aleph_0$.
Cantor demonstrated this with a clever technique often visualized as a diagonal enumeration: arrange all positive fractions in a grid, with numerators along one axis and denominators along the other, then trace a zigzag diagonal path through the grid that eventually passes through every fraction exactly once (skipping duplicates like 2/4, which equals 1/2). This zigzag path effectively “counts” the rationals in a single, if unusual, sequential order, proving they can be placed in one-to-one correspondence with the natural numbers.
$$ |\mathbb{Q}| = \aleph_0 $$
The Larger Infinity: Uncountable Sets
Given that even the rational numbers turn out to be countable, you might start to wonder if maybe all infinities are secretly the same size. This is exactly the question Cantor tackled next, focusing on the real numbers, which include the rationals plus all the irrational numbers, like $\pi$, $e$, and $\sqrt{2}$, whose decimal expansions never terminate or repeat.
Cantor proved, through his famous diagonal argument, that the real numbers cannot be placed in one-to-one correspondence with the natural numbers, meaning they represent a strictly larger infinity.
Walking Through the Diagonal Argument
The logic goes like this. Suppose, for the sake of argument, that you could list every real number between 0 and 1 in some infinite sequence, each expressed as an infinite decimal:
$$ \begin{aligned} r_1 &= 0.d_{11}d_{12}d_{13}\dots \ r_2 &= 0.d_{21}d_{22}d_{23}\dots \ r_3 &= 0.d_{31}d_{32}d_{33}\dots \ &\vdots \end{aligned} $$
Now construct a brand new number by going down the diagonal: take the first digit of $r_1$ and change it to something different, take the second digit of $r_2$ and change it, take the third digit of $r_3$ and change it, and so on. This new number differs from every single number in the list, in at least one decimal place, by construction. That means it cannot possibly already be on the list.
But we assumed the list contained every real number between 0 and 1. Since we just constructed a real number in that range that isn’t on the list, the assumption must be false — no such complete list can exist. There is no way to count the real numbers using the natural numbers, which proves the real numbers form a strictly larger infinity than the natural numbers.
$$ |\mathbb{R}| > |\mathbb{N}| $$
Naming the Bigger Infinity
Mathematicians denote the cardinality (size) of the real numbers as $2^{\aleph_0}$, sometimes called “the cardinality of the continuum,” often written $\mathfrak{c}$.
$$ \mathfrak{c} = 2^{\aleph_0} $$
This notation isn’t arbitrary. It comes from a broader theorem, also proven by Cantor, called Cantor’s theorem, which shows that the set of all subsets of any set (called its power set) is always strictly larger than the original set itself, even when the original set is infinite.
$$ |A| < |P(A)| $$
Since the real numbers can be shown to correspond to the power set of the natural numbers, this places the reals at exactly $2^{\aleph_0}$ in size, a strictly bigger infinity than $\aleph_0$.
And It Never Stops: An Infinite Tower of Infinities
Here’s the part that genuinely still gives me a bit of vertigo: Cantor’s theorem applies to any set, no matter how large, including infinite ones. That means you can take the power set of the real numbers to get an even larger infinity, then take the power set of that to get a larger infinity still, endlessly, with no upper bound.
$$ \aleph_0 < 2^{\aleph_0} < 2^{2^{\aleph_0}} < \dots $$
There is, provably, no single “largest infinity.” The hierarchy of infinite sizes continues forever, growing in a tower that never has a top.
The Continuum Hypothesis: A Genuinely Open Question
A natural question follows from all this: is there any infinite cardinality strictly between $\aleph_0$ (the size of the natural numbers) and $2^{\aleph_0}$ (the size of the real numbers)? This question, called the continuum hypothesis, was one of the most famous open problems in mathematics for decades.
$$ \aleph_1 \overset{?}{=} 2^{\aleph_0} $$
The eventual answer, proven through the combined work of Kurt Gödel in the 1940s and Paul Cohen in the 1960s, turned out to be genuinely strange: the continuum hypothesis is independent of the standard axioms of set theory (Zermelo-Fraenkel set theory with the axiom of choice, or ZFC). This means it can neither be proven nor disproven using those axioms — both “the continuum hypothesis is true” and “the continuum hypothesis is false” are logically consistent with standard mathematics, depending on which additional assumptions you choose to adopt. This was a landmark moment in the philosophy and foundations of mathematics, showing that not every mathematical statement has a definitive, discoverable truth value within a given axiom system.
Why This Isn’t Just Abstract Wordplay
It’s fair to ask whether any of this matters outside pure set theory. It genuinely does, in a few important ways. First, the tools developed to compare infinite sets, like bijections and cardinality, underpin large parts of modern analysis, topology, and computer science, particularly in areas like computability theory, where questions about which problems can or cannot be solved by an algorithm rely on precise reasoning about countable versus uncountable sets.
Second, this area of mathematics fundamentally reshaped what mathematicians consider a rigorous proof and a well-defined mathematical object. Before Cantor, “infinity” was often treated as a vague, almost philosophical notion, something to be approached but never fully grasped. Cantor’s work turned infinity into a precise, structured, and provable subject, opening the door to modern set theory as the foundational language underlying virtually all of contemporary mathematics.
What’s Rock-Solid Versus What’s Philosophically Open
- Rigorously proven: Countability of the integers and rationals; the strictly greater cardinality of the real numbers compared to the naturals, via the diagonal argument; Cantor’s theorem showing power sets are always strictly larger than their originals; the existence of an infinite, unbounded hierarchy of ever-larger infinite cardinalities.
- Formally undecidable within standard axioms: The continuum hypothesis itself, along with several related questions about the precise structure of the hierarchy of infinite cardinalities between $\aleph_0$ and $\mathfrak{c}$.
Wrapping Up
Infinity isn’t one single, monolithic idea — it’s an entire, richly structured hierarchy, with the countable infinity of the natural numbers sitting at the very bottom, the larger infinity of the real numbers above it, and an endless tower of ever-larger infinities stretching upward without any final ceiling. What I find most remarkable is that all of this was worked out with total mathematical rigor, using nothing more exotic than careful logical reasoning about pairing elements between sets. Infinity turned out to be something you can actually study, compare, and measure — just not in the way ordinary counting ever prepared us for.