Hilbert's problems

Hilbert's problems are a list of twenty-three problems in mathematics put forth by German mathematician David Hilbert at the Paris conference of the International Congress of Mathematicians in 1900. The problems were all unsolved at the time, and several of them turned out to be very influential for 20th century mathematics. Hilbert presented ten of the problems (1, 2, 6, 7, 8, 13, 16, 19, 21 and 22) at the conference, speaking on 8 August in the Sorbonne; the full list was published later.

Nature and influence of the problems

Hilbert's problems ranged widely, not only across many areas of pure and applied mathematics, but also in scope and precision. Some of them are propounded precisely enough to admit a clear affirmative/negative answer, like the 3rd problem (probably the easiest for a nonspecialist to understand and also the first to be solved) or the notorious 8th problem (the Riemann hypothesis). There are other problems (notably the 5th) for which experts have traditionally agreed on a single interpretation and a solution to the accepted interpretation has been given, but for which there remain open problems which are so closely related so as to be, perhaps, part of what Hilbert had in mind. Sometimes Hilbert's statements were not precise enough to specify a particular problem but were suggestive enough so that certain problems of more contemporary origin seem to fit in nicely, e.g. most modern number theorists would probably see the 9th problem as referring to the (conjectural) Langlands correspondence on representations of the absolute Galois group of a number field. Still other problems (e.g. the 11th and the 16th) call for work on what are now flourishing mathematical subdisciplines, like the theories of quadratic forms and real algebraic curves.

There are two problems which are not only unresolved but may in fact be unresolvable by modern standards. The 6th problem calls for the axiomatization of physics, a goal that twentieth century developments in physics (including its recognition as a discipline independent from mathematics) seem to render both more remote and less important than in Hilbert's day. Also the 4th problem concerns the foundations of geometry, in a manner which is now generally judged to be too vague to admit a definitive answer.

Remarkably, the other twenty-one problems have all received significant attention, and late into the twentieth century work on these problems was still considered to be of the highest importance. Notably, Paul Cohen received the Fields Medal in 1966 for his work on the first problem, and the negative solution of the tenth problem in 1970 by Matiyasevich (completing work of Davis, Putnam and Robinson) generated similar excitement and acclaim. Aspects of these problems are still of great interest today.

Ignorabimus

Several of the Hilbert problems have been resolved (or arguably resolved) in ways that would have been profoundly surprising, and even disturbing, to Hilbert himself. Following Frege and Russell, Hilbert sought to place mathematics on a sound logical foundation using the method of formal systems, i.e., finitistic proofs from an agreed upon set of axioms. One of the main goals of Hilbert's program was a finitistic proof of the consistency of the axioms of arithmetic: that is his second problem.

However, Gödel's second incompleteness theorem gives a precise sense in which such a finitistic proof of the consistency of arithmetic is provably impossible. Hilbert lived for 12 years after Gödel's theorem, but he does not seem to have written any formal response to or acknowledgement of Gödel's work. But there is no doubt that the significance of Gödel's work to mathematics as a whole (and not just the field of formal logic) was amply and dramatically illustrated by its applicability to one of Hilbert's problems.

Hilbert's tenth problem does not ask whether there exists an algorithm for deciding the solvability of Diophantine equations, but rather asks for the construction of such an algorithm: "to devise a process according to which it can be determined in a finite number of operations whether the equation is solvable in rational integers." That the solution to this problem comes by way of showing that there can be no such algorithm would presumably have been very surprising to him.

In discussing his opinions that every mathematical problem should have a solution, Hilbert allows for the possibility that the solution could be a proof that the original problem is impossible. Famously, he stated that the point is to know one way or the other what the solution is, and he believed that we always can know this, that in mathematics there is no ignorabimus. It seems unclear whether he would have regarded the solution of the tenth problem as an instance of ignorabimus: what we are proving not to exist is not the integer solution, but (in a certain sense) our own ability to discern whether a solution exists.

On the other hand, the status of the first and second problems is even more complicated: there is no clear mathematical consensus as to whether the results of Gödel (in the case of the second problem), or Gödel and Cohen (in the case of the first problem) give definitive negative solutions or not, since these solutions apply to a certain formalization of the problems, a formalization which is quite reasonable but is not necessarily the only possible one.

The 24th Problem

Hilbert originally included 24 problems on his list, but decided against including one of them in the published list. The "24th problem" (in proof theory, on a criterion for simplicity and general methods) was rediscovered in Hilbert's original manuscript notes by German historian Rüdiger Thiele in 2000. [ [http://www.maa.org/news/Thiele.pdf] Hilbert’s twenty-fourth problem, Rüdiger Thiele American Mathematical Monthly]

equels

Since 1900, other mathematicians and mathematical organizations have announced problem lists, but, with few exceptions, these later problem collections have not had nearly as much influence or generated as much work as Hilbert's problems. One of the exceptions is furnished by three conjectures made by André Weil in the late 1940s (the Weil conjectures). In the fields of algebraic geometry, number theory and the links between the two, the importance of the Weil conjectures was (and is) colossal. The first of the Weil conjectures was proved by Bernard Dwork, and a completely different proof of the first two conjectures via l-adic cohomology was given by Alexander Grothendieck. The last and deepest of the Weil conjectures (an analogue of the Riemann hypothesis) was proven by Pierre Deligne in what is widely regarded as one of the greatest mathematical achievements of all time. Both Grothendieck and Deligne were awarded the Fields medal. However, the Weil conjectures in their scope are more like a single Hilbert problem, and Weil never intended them as a programme for all mathematics. This is somewhat ironic, since arguably Weil was the mathematician of the 1940s and 1950s who best played the Hilbert role, being conversant with nearly all areas of (theoretical) mathematics and having played key roles in the development of many of them.

The turn of the millennium, being also the centennial of Hilbert's announcement of his problems, was a natural occasion to propose "a new set of Hilbert problems." Several mathematicians took up the challenge, notably Fields Medalist Steve Smale, who responded to a request of Vladimir Arnold by proposing a list of 18 problems.
Smale's problems have thus far not received much attention from the media, and it seems unclear how much attention they are getting from the mathematical community.

At least in the mainstream media, the de facto 21st century analogue of Hilbert's problems is the list of seven Millennium Prize Problems chosen in 2000 by the Clay Mathematics Institute. Unlike the Hilbert problems, where the primary award was the admiration of Hilbert in particular and the worldwide mathematical community in general, each prize problem carries a million dollar bounty. As for the Hilbert problems, one of the prize problems (the Poincare conjecture) was solved relatively soon after the problems were announced.

Noteworthy for its appearance on the list of Hilbert problems, Smale's list and the list of Millennium Prize Problems — and even, in its geometric guise, in the Weil Conjectures — is the Riemann hypothesis. Notwithstanding some famous (and occasionally loud) recent assaults from leading mathematicians of our day, many experts believe that the Riemann hypothesis will lurk at the top of problem lists for some centuries yet to come. The maestro himself had this to say:"If I were to awaken after having slept for a thousand years, my first question would be: has the Riemann hypothesis been proven?" — David Hilbert

In 2008, DARPA announced its own list of 23 problems which it hopes could lead to major mathematical breakthroughs, "thereby strengthening the scientific and technological capabilities of DoD" [cite web | url=http://www.networkworld.com/community/node/33361 | title=The world's 23 toughest math questions | date=2008-09-29] [cite web | url=http://www.darpa.mil/baa/DARPA-BAA08-65.html | title=DARPA Mathematics Challenge solicitation | date=2008-09-26] . The problems can be found on the [https://www.fbo.gov/download/9bc/9bce380aafb19f9ad3bda188bfc1ab20/DARPA-BAA-08-65.doc Federal Business Opportunities website] . Proposals are currently due on September 25, 2009.

ummary

Of the cleanly-formulated Hilbert problems, problems 3, 7, 10, 11, 13, 14, 17, 19, 20, and 21 have a resolution that is accepted by consensus. On the other hand, problems 1, 2, 5, 9, 12, 15, 18⁺, and 22 have solutions that have partial acceptance, but where there exists some controversy as to whether it resolves the problem.

The + on 18 denotes that the Kepler conjecture solution is a computer-assisted proof, a notion anachronistic for a Hilbert problem and also to some extent controversial because of its lack of verifiability by a human reader in a reasonable time.

That leaves 8 (the Riemann hypothesis) and 12 unresolved, both being in number theory. On this classification 4, 6, 16, and 23 are too loose to be ever described as solved. The withdrawn 24 would also fall in this class.

Table of problems

Hilbert's twenty-three problems are:

Notes

References

* Rowe, David; Gray, Jeremy J. (2000). "The Hilbert Challenge". Oxford University Press. ISBN 0-19-850651-1
* Yandell, Benjamin H. (2002). "The Honors Class. Hilbert's Problems and Their Solvers". A K Peters. ISBN 1-56881-141-1
* "On Hilbert and his 24 Problems." In: Proceedings of the Joint Meeting of the CSHPM 13(2002)1-22 (26th Meeting; ed. M. Kinyon)
* John Dawson, Jr "Logical Dilemmas, The Life and Work of Kurt Gödel", AK Peters, Wellesley, Mass., 1997. A wealth of information relevant to Hilbert's "program" and Gödel's impact on the Second Question, the impact of Arend Heyting's and Brouwer's Intuitionism on Hilbert's philosophy. Dawson is Professor of Mathematics at Penn State U, cataloguer of Gödel's papers for the Institute for Advanced Study in Princeton, and a co-editor of Gödel's "Collected Works".
* Felix E. Browder (editor), "Mathematical Developments Arising from Hilbert Problems", Proceedings of Symposia in Pure Mathematics XXVIII (1976), American Mathematical Society. A collection of survey essays by experts devoted to each of the 23 problems emphasizing current developments.
* Yuri Matiyasevich, "Hilbert's Tenth Problem", MIT Press, Cambridge, Massachusetts, 1993. An account at the undergraduate level by the mathematician who completed the solution of the problem.

External links

* [http://www.mathacademy.com/pr/prime/articles/hilbert_prob/index.asp?PRE=hilber&TAL=Y&TAN=Y&TBI=Y&TCA=Y&TCS=Y&TEC=Y&TFO=Y&TGE=Y&TNT=Y&TPH=Y&TST=Y&TTO=Y&TTR=Y&TAD= Listing of the 23 problems, with descriptions of which have been solved]
* [http://www.mathematik.uni-bielefeld.de/~kersten/hilbert/rede.html Original text of Hilbert's talk, in German]
* [http://aleph0.clarku.edu/~djoyce/hilbert/toc.html English translation of Hilbert's 1900 address]
* [http://www.math.pitt.edu/articles/hilbert.html Details on the solution of the 18th problem]
* [http://www.ams.org/amsmtgs/2025_abstracts/962-01-285.pdf "On Hilbert's 24th Problem: Report on a New Source and Some Remarks."]
* [http://www.math.umn.edu/~wittman/problems2.html The Paris Problems]
* [http://logic.pdmi.ras.ru/Hilbert10 Hilbert's Tenth Problem page!]
* [http://www.gresham.ac.uk/event.asp?PageId=45&EventId=628 'From Hilbert's Problems to the Future'] , lecture by Professor Robin Wilson, Gresham College, 27 February 2008 (available in text, audio and video formats).