Why Infinity Is Weirder Than You Think

Two surprising facts about infinity

Every positive integer pairs with exactly one even integer — same infinite size (ℵ₀)

1↔21 ↔ 2×1

2↔42 ↔ 2×2

3↔63 ↔ 2×3

4↔84 ↔ 2×4

5↔105 ↔ 2×5

6↔126 ↔ 2×6

7↔147 ↔ 2×7

8↔168 ↔ 2×8

⋮↔⋮

The even integers are a proper subset of the naturals — yet the same "size."
This is Galileo's paradox: infinite sets can equal their own subsets.

Infinity seems simple: it's just "a very large number," or "all the numbers," or "what you get when you keep going forever." But mathematicians discovered in the 19th century that infinity is far stranger than any of these descriptions suggest. There is not one infinity — there are infinitely many different sizes of infinity, some larger than others.

Counting: what it actually means

Before we can talk about the size of infinite sets, we need to be precise about what "same size" means.

Two finite sets have the same size if you can pair their elements one-to-one — match each element of one to exactly one element of the other, with no leftovers. This is what counting is: pairing a set with the set $\{1, 2, 3, \ldots, n\}$ .

Georg Cantor's key insight (c. 1870): we can use the same idea for infinite sets. Two sets have the same cardinality if there's a one-to-one correspondence (bijection) between them, even if they're infinite.

The integers and the rationals are the same size

Here's a surprise: the set of even integers $\{2, 4, 6, 8, \ldots\}$ is the same size as the set of all positive integers $\{1, 2, 3, 4, \ldots\}$ .

Match them: $1 \leftrightarrow 2$ , $2 \leftrightarrow 4$ , $3 \leftrightarrow 6$ , \ldots, $n \leftrightarrow 2n$ .

Every even integer corresponds to exactly one positive integer, and vice versa. The sets have the same cardinality, even though one seems to be "half" of the other.

This is Galileo's paradox, noticed in 1638: infinite sets can be put into bijection with proper subsets of themselves. (For finite sets, this is impossible — you can't pair $\{1,2,3\}$ with $\{2,4\}$ one-to-one.)

A set that can be put into bijection with the positive integers is called countably infinite. The positive integers, all integers, even integers, perfect squares — all countably infinite.

Perhaps more surprisingly: the rational numbers (fractions $p/q$ ) are countably infinite too. Cantor showed this by arranging them in a grid and tracing a diagonal path through them — a clever trick that pairs every rational number with a positive integer.

But the real numbers are bigger

In 1891, Cantor proved that the real numbers — all the points on the number line — cannot be put into bijection with the positive integers. The reals are uncountably infinite: a strictly larger kind of infinity.

His proof is one of the most beautiful in mathematics: Cantor's diagonal argument.

Suppose, for contradiction, that you had a complete list of all real numbers between 0 and 1:

$r_1 = 0.{\mathbf{5}}8362\ldots$ $r_2 = 0.2{\mathbf{7}}491\ldots$ $r_3 = 0.14{\mathbf{3}}78\ldots$ $r_4 = 0.618{\mathbf{0}}3\ldots$

Construct a new number $d$ by taking the diagonal digit of each $r_n$ (bold above) and changing it: replace each digit $k$ by $k+1$ (mod 10). So $d = 0.6841\ldots$

The number $d$ is not $r_1$ (they differ in the first decimal place). It's not $r_2$ (second place). Not $r_3$ (third). Not $r_n$ for any $n$ (they differ in the $n$ -th decimal place).

So $d$ is a real number not on the list — contradicting the assumption that the list was complete. No such list can exist. The reals are uncountable.

This is not a trick — it's a proof

Cantor's diagonal argument is sometimes dismissed as clever wordplay. It isn't. It's a rigorous proof by contradiction. The key step — constructing $d$ so that it differs from $r_n$ in the $n$ -th decimal place — guarantees that $d$ can't be any number on the list, no matter what the list contains.

The argument works for any proposed list of real numbers, not just the specific one above. That's what makes it a proof: it shows no list can be complete, without knowing anything specific about the list.

How many sizes of infinity are there?

Cantor called the cardinality of the natural numbers $\aleph_0$ ("aleph-null") and the cardinality of the reals $\mathfrak{c}$ (the "continuum").

He proved that the power set of any set (the set of all its subsets) is strictly larger than the original. So:

$|\mathbb{N}| = \aleph_0$
$|\mathcal{P}(\mathbb{N})| > \aleph_0$
$|\mathcal{P}(\mathcal{P}(\mathbb{N}))| > |\mathcal{P}(\mathbb{N})|$
And so on, infinitely many times.

There are infinitely many distinct sizes of infinity, each strictly larger than the last.

The Continuum Hypothesis

Is there an infinity between $\aleph_0$ and $\mathfrak{c}$ ? That is, does there exist a set that is strictly larger than the natural numbers but strictly smaller than the reals?

Cantor conjectured there wasn't — the Continuum Hypothesis. He could neither prove nor disprove it.

In 1940, Kurt Gödel proved the Continuum Hypothesis is consistent with standard set theory (you can't disprove it). In 1963, Paul Cohen proved it's also independent — you can't prove it either. Both adding it and denying it leave mathematics contradiction-free.

The Continuum Hypothesis is undecidable. The question "how many sizes of infinity are there between $\aleph_0$ and $\mathfrak{c}$ ?" has no answer within standard mathematics — it is, in a precise sense, neither true nor false.