Furstenberg's proof of the infinitude of primes

In number theory, Hillel Furstenberg's proof of the infinitude of primes is a celebrated topological proof that the integers contain infinitely many prime numbers. When examined closely, the proof is less a statement about topology than a statement about certain properties of arithmetic sequences. Like Euclid's classical proof, Furstenberg's is a proof by contradiction. The proof was published in 1955 in the American Mathematical Monthly while Furstenberg was still an undergraduate student at Yeshiva University.

Furstenberg's proof

Define a topology on the integers Z by declaring a subset "U" ⊆ Z to be an open set if and only if it is either the empty set, ∅, or it is a union of doubly infinite arithmetic sequences "S"("a", "b"), where

:$S(a,\; b)\; =\; \{\; a\; n\; +\; b\; |\; n\; in\; mathbf\{Z\}\; \}\; =\; a\; mathbf\{Z\}\; +\; b.$

In other words, "U" is open if and only if every "x" ∈ "U" admits some non-zero integer "a" such that "S"("a", "x") ⊆ "U". The axioms for a topology are easily verified:

* By definition, ∅ is open; Z is just the sequence "S"(1, 0), and so is open as well.
* Any union of open sets is open: for any collection of open sets "U"_"i" and "x" in their union, any of the numbers "a"_"i" for which "S"("a"_"i", "x") ⊆ "U"_"i" also shows that "S"("a"_"i", "x") ⊆ "U".
* The intersection of two (and hence finitely many) open sets is open: let "U"₁ and "U"₂ be open sets and let "x" ∈ "U"₁ ∩ "U"₂ (with numbers "a"₁ and "a"₂ establishing membership). Set "a" to be the lowest common multiple of "a"₁ and "a"₂. Then "S"("a", "x") ⊆ "S"("a"_"i", "x") ⊆ "U"₁ ∩ "U"₂.

The topology is quite different from the usual Euclidean one, and has two notable properties:

# Since any non-empty open set contains a doubly infinite sequence, no finite set can be open; put another way, the complement of a finite set cannot be a closed set.
# The "simple sets" "S"("a", "b") are both open and closed: we can write "S"("a", "b") as the complement of an open set as follows:

::

The only integers that are not integer multiples of prime numbers are −1 and +1, i.e.

:

By the first property, the set on the left-hand side cannot be closed. On the other hand, by the second property, the sets "S"("p", 0) are closed. So, if there were only finitely many prime numbers, then the set on the right-hand side would be a finite union of closed sets, and hence closed. This would be a contradiction, so there must be infinitely many prime numbers.

References

*Citation | last1=Aigner | first1=Martin | last2=Ziegler | first2=Günter M. | author2-link=Günter M. Ziegler | title=Proofs from The Book | publisher=Springer-Verlag | location=Berlin, New York | year=1998
* cite journal
last = Furstenberg
first = Harry
authorlink = Hillel Furstenberg
title = On the infinitude of primes
journal = Amer. Math. Monthly
volume = 62
year = 1955
pages = 353
issn = 0002-9890
doi = 10.2307/2307043 MathSciNet|id=0068566

External links

* [http://www.everything2.com/index.pl?node_id=1460203 Furstenberg's proof that there are infinitely many prime numbers] at Everything2
*