What Is Infinity? Types of Infinity and Cantor's Theorem

Is infinity just a really big number? Something you'd hit if you counted long enough?

No. And that "no" is doing a lot of work. Infinity isn't a number on the number line at all. It's a description of size, the size of a collection that never runs out. And here's the part that surprises almost everyone the first time they see it: not all infinite collections are the same size.

Some infinities are bigger than others. We can prove it. A mathematician named Georg Cantor did exactly that in the 1870s, and the proof still holds up perfectly today. To get there, we're going to check into a very strange hotel.

Infinity is an amount you never finish counting

Start with the counting numbers: 1, 2, 3, 4, and so on forever. We call this set $\mathbb{N}$, the natural numbers. There's no last one. Whatever number you name, you can always add 1 and get a bigger one.

That "never finishes" property is the whole idea of infinity. It's not a destination. It's a process that has no end. Mathematicians write the size of this particular infinity as $\aleph_0$ (read "aleph-null" or "aleph-zero"), and any set you can count off 1, 2, 3, ... forever, matching each item to exactly one natural number, has this same size.

That's the definition we'll use for the rest of this post: two sets are the same size if you can pair up their elements one to one, with nothing left over on either side. We call that pairing a bijection. It sounds simple. It's about to get weird.

A full hotel can still make room for you

Picture a hotel with infinitely many rooms, numbered 1, 2, 3, and so on forever. Every single room is occupied. No vacancies. Full.

A new guest shows up. In a normal hotel, that's a problem. In this hotel, the manager just asks every guest to move from their current room to the room one number higher. The guest in room 1 moves to room 2, room 2 moves to room 3, and so on, forever. Room 1 is now empty. The new guest checks in.

A full hotel just made room for one more guest, without kicking anyone out.

Try sliding the number of new guests up to 6. Same trick, just shift everyone down by 6 instead of 1. Every room stays occupied before and after. Nobody loses their room. The hotel was never "less full," and it's never "more full" either. It's just as infinite as it started.

This is Hilbert's Hotel, a thought experiment from the mathematician David Hilbert. It's not a trick or a paradox in the bad sense. It's a real, correct description of how infinite sets behave. A set of size $\aleph_0$ can absorb any finite number of new elements and stay exactly the same size.

Wait, doesn't that mean the evens are only half as big as the naturals?

Here's where intuition really starts to fight you. Take every even number: 2, 4, 6, 8, and so on. That's clearly a smaller collection than all the naturals, right? You're throwing away every other number.

Let's test that with the bijection rule from before. Pair each natural number $n$ with the even number $2n$:

Slide $n$ up and watch the pairing build. Every natural number on the left gets exactly one even number on the right. No natural number is left unpaired. No even number is left unmatched either, since any even number $2k$ is paired with the natural number $k$. The pairing covers both sides completely.

That's a bijection. And by our definition, a bijection means the two sets are the same size. The naturals and the even naturals both have size $\aleph_0$, even though the evens look like "half" of the naturals sitting inside them.

This is one of the defining, official features of infinite sets: an infinite set can be the same size as a proper subset of itself. For finite sets that's impossible. A set of 10 things can never be paired up perfectly with 5 of its own elements. Infinite sets don't follow that rule, and that's not a bug. It's basically the definition of what makes them infinite.

So are all infinities the same size?

At this point you might guess the answer is yes. Naturals, evens, integers, even the fractions (you can prove those are countable too, with a clever zigzag pattern through a grid). They all turn out to be size $\aleph_0$. Maybe every infinity is just $\aleph_0$ in disguise.

Cantor asked the same question, and then he checked. He looked at the real numbers, meaning every point on the number line, including all the endless, non-repeating decimals like $\pi$ or $\sqrt{2}$. Could you count those off 1, 2, 3, ... too?

He proved you can't. Not "nobody's found a way yet." Provably, permanently impossible. The real numbers are a bigger infinity than the naturals.

Cantor's proof: build a number that can't be on any list

Here's the argument, and it's one of the cleanest proofs in all of math. Suppose someone hands you a list that they claim contains every real number between 0 and 1, written in binary. It doesn't matter how they built the list. Just suppose it exists and is complete.

Step through the rows. At row 1, look at digit 1. At row 2, look at digit 2. At row $i$, look at digit $i$. That's the diagonal, the digits running from top-left down to the bottom-right.

Now build a brand new number: for each row, flip that diagonal digit. Where row $i$ has a 0, your new number gets a 1 there. Where row $i$ has a 1, your new number gets a 0.

...and here's the reveal. This new number cannot be row 1, because it differs from row 1 at digit 1. It can't be row 2, because it differs from row 2 at digit 2. It can't be row $i$, for any $i$, because you built it specifically to differ from row $i$ at position $i$.

The list claimed to be complete. You just constructed a real number that's guaranteed not to be anywhere on it. So the list was never complete. And this argument works no matter what list you started with, even an infinitely long one. There is no possible list that contains every real number. The reals are uncountable: a strictly bigger infinity than $\aleph_0$.

This is called Cantor's diagonal argument, and it's the reason we know for certain that $\aleph_0$ isn't the only size of infinity that exists.

Cantor's theorem: why this keeps happening

The diagonal trick isn't just a one-off gimmick for real numbers. It generalizes into a full theorem, and the general version is almost shockingly simple to state.

Take any set $A$, and consider its power set $\mathcal{P}(A)$: the set of all possible subsets of $A$. For a finite set, this is easy to picture. A set with $n$ elements has exactly $2^n$ subsets, since each element is either in a given subset or it isn't, two choices, multiplied together $n$ times.

Watch $2^n$ pull away from $n$ as you slide it up. By $n = 6$, you've got 6 elements but 64 subsets. That gap only widens as $n$ grows.

Cantor's theorem says this relationship holds for every set, finite or infinite: $|A|$ is always strictly less than $|\mathcal{P}(A)|$. The proof is a diagonal argument again, almost identical in spirit to the one you just walked through with the real numbers. No matter how you try to match up elements of $A$ with subsets of $A$, you can always construct a subset that was left out of the matching. There's no way around it.

That's not just a curiosity about the reals specifically. It's a structural fact about size itself.

There's no biggest infinity

Put those two results together and something remarkable falls out. Start with $\mathbb{N}$, size $\aleph_0$. Take its power set: bigger, by Cantor's theorem. It turns out $\mathcal{P}(\mathbb{N})$ is exactly the same size as the real numbers, written $2^{\aleph_0}$, sometimes called $\mathfrak{c}$ for "continuum."

Now take the power set of that. Bigger again, by the same theorem. And the power set of that one. And so on, forever:

Every step in that chain is a strictly bigger infinity than the one before it, and the chain never stops. There is no largest infinity. Whatever infinite size you name, Cantor's theorem hands you a bigger one, guaranteed, by the exact same construction every time.

(Whether there's an infinity strictly between $\aleph_0$ and $2^{\aleph_0}$ is a separate question called the continuum hypothesis, and it turns out to be unprovable either way from the standard axioms of math. That's a story for another post.)

The short version

Infinity isn't a number, it's a size, and sizes aren't all equal. Two sets are the same size if you can pair their elements up one to one. By that rule, the naturals, the evens, and the integers are all the same size, $\aleph_0$, even though intuition says some should be smaller. Hilbert's Hotel shows that a countably infinite set absorbs new elements without changing size.

But the real numbers break that pattern. Cantor's diagonal argument proves no list can ever contain all of them, so the reals are a strictly bigger infinity than $\aleph_0$. And that argument scales up into Cantor's theorem: every set's power set is bigger than the set itself, without exception, which means the tower of bigger and bigger infinities never has a top.

Infinity was never one thing. It's an entire, endless ladder of them.

All visualizations are interactive React components running entirely in your browser, built with plain SVG. The diagonal builder and the shifting hotel both animate with requestAnimationFrame. No libraries beyond React.