
Most of us have long known that there are infinitely many prime numbers. Euclid’s classical argument — dating back over two millennia — elegantly shows this by contradiction. Countless other proofs exist, each unveiling a different aspect of number theory’s depth and beauty.
But what if we could prove the infinitude of primes topologically?
Yes, topology — the study of shapes, continuity, and structure — can step into the arena of arithmetic and reveal the same timeless truth from an entirely new vantage point. The proof, originally due to Hillel Furstenberg, is as breathtakingly simple as it is conceptually profound.
Let’s dive in.
Defining a Topology on the Integers
We begin by equipping the set of integers , with an unusual but elegant topology.
For any integers and positive integer
, define the following subset of
:
.
Each is nothing but an arithmetic progression with initial term
and common difference
. Alternatively, one can think of
as the residue class of
modulo
.
Now we declare the collection as a basis for our topology on
.
Checking the Basis Axioms
To ensure this truly defines a topology, let’s verify the basis properties.
- Covering:
Every integer lies in some basic open set.
Indeed, for any, we have
.
Hence,.
- Intersection Property:
If, then one can show that
. Thus, the intersection of two basis elements containing
is again a basis element containing
.
Hence, indeed forms a basis for a topology on
.
A Few Curious Observations
This topology behaves quite differently from the familiar Euclidean one. Let’s note a few key features:
- Neighborhoods:
The neighborhoods of an integerare precisely all arithmetic progressions passing through
.
- Clopen Sets:
Eachis both open and closed.
Why? Because its complement can be expressed as a union of other basic open sets:
if, then
.
- Infinite Open Sets:
Every non-empty open set is infinite, since every arithmetic progression contains infinitely many integers. - Not Discrete:
The topology is not discrete because singleton sets likeare not open.
Interestingly, this topology turns out to be Hausdorff and regular, despite being so far removed from our intuitive notions of “closeness.”
Towards the Proof — Connecting Primes and Topology
Now comes the magic.
For every integer , there exists a prime
dividing
.
That means for some integer
, so
.
Hence,
where denotes the set of all prime numbers.
The Contradiction Argument
Suppose, for the sake of argument, that there are only finitely many primes. Then the union would be a finite union of closed sets, and therefore closed itself. That would make
closed, implying that its complement
is open.
But here’s the catch — we already know that no non-empty open set can be finite in this topology.
Thus, cannot be open, and our assumption of finitely many primes collapses.
Therefore, the set of primes must be infinite.

Closing Thoughts
Furstenberg’s proof does not rely on divisibility tricks or clever algebraic manipulations — instead, it unveils the structure of the integers through the lens of topology. Arithmetic progressions, residue classes, and primes all interlace naturally within this topological framework.

It’s a striking reminder that mathematics is not a collection of separate silos — number theory and topology, algebra and geometry — but a unified landscape where deep truths can be rediscovered through many different languages.
“Mathematics, rightly viewed, possesses not only truth, but supreme beauty.”
— Bertrand Russell
Leave a Reply