Furstenberg's proof of the infinitude of primes

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"1 and "U"2 be open sets and let "x" ∈ "U"1 ∩ "U"2 (with numbers "a"1 and "a"2 establishing membership). Set "a" to be the lowest common multiple of "a"1 and "a"2. Then "S"("a", "x") ⊆ "S"("a""i", "x") ⊆ "U"1 ∩ "U"2.

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:

::S(a, b) = mathbf{Z} setminus igcup_{j = 1}^{a - 1} S(a, b + j).

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

:mathbf{Z} setminus { -1, + 1 } = igcup_{p mathrm{, prime S(p, 0).

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
*


Wikimedia Foundation. 2010.

Игры ⚽ Нужно решить контрольную?

Look at other dictionaries:

  • Démonstration de Fürstenberg de l'infinité des nombres premiers — En théorie des nombres, la démonstration de Hillel Fürstenberg de l infinité des nombres premiers est une célèbre démonstration topologique selon laquelle les entiers relatifs contiennent une infinité de nombres premiers. Comme la démonstration… …   Wikipédia en Français

  • Hillel Furstenberg — en 1992. Hillel (Harry) Furstenberg (הלל (הארי) פורסטנברג) est un mathématicien israélien, membre de l Académie israélienne des sciences et lettres et de la National Academy of Sciences américaine. Il a été récompensé par le Prix Wolf en 2007. Il …   Wikipédia en Français

  • Fürstenbergs Beweis der Unendlichkeit der Primzahlen — ist ein 1955 veröffentlichter außergewöhnlicher Beweis der schon von Euklid bewiesenen bekannten Tatsache, dass es unendlich viele Primzahlen gibt. Er wurde von Hillel Fürstenberg entdeckt, als er noch als undergraduate student an der Yeshiva… …   Deutsch Wikipedia

  • List of mathematics articles (F) — NOTOC F F₄ F algebra F coalgebra F distribution F divergence Fσ set F space F test F theory F. and M. Riesz theorem F1 Score Faà di Bruno s formula Face (geometry) Face configuration Face diagonal Facet (mathematics) Facetting… …   Wikipedia

  • Proofs from THE BOOK — is a book of mathematical proofs by Martin Aigner and Günter M. Ziegler. The book is dedicated to the mathematician Paul Erdős, who often referred to The Book in which God keeps all of the most elegant proofs of mathematical theorems. During a… …   Wikipedia

  • Topology — (Greek topos , place, and logos , study ) is the branch of mathematics that studies the properties of a space that are preserved under continuous deformations. Topology grew out of geometry, but unlike geometry, topology is not concerned with… …   Wikipedia

  • Prime number — Prime redirects here. For other uses, see Prime (disambiguation). A prime number (or a prime) is a natural number greater than 1 that has no positive divisors other than 1 and itself. A natural number greater than 1 that is not a prime number is… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”