Hilbert's problems are 23 problems in mathematics published by German mathematician David Hilbert in 1900. They were all unsolved at the time, and several proved 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 Paris conference of the International Congress of Mathematicians, speaking on August 8 at the Sorbonne. The complete list of 23 problems was published later, most notably in English translation in 1902 by Mary Frances Winston Newson in the Bulletin of the American Mathematical Society.
Hilbert's problems ranged greatly in topic and precision. Some of them, like the 3rd problem, which was the first to be solved, or the 8th problem (the Riemann hypothesis), which still remains unresolved, were presented precisely enough to enable a clear affirmative or negative answer. For other problems, such as the 5th, experts have traditionally agreed on a single interpretation, and a solution to the accepted interpretation has been given, but closely related unsolved problems exist. Some of Hilbert's statements were not precise enough to specify a particular problem, but were suggestive enough that certain problems of contemporary nature seem to apply; for example, 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, such as the 11th and the 16th, concern what are now flourishing mathematical subdisciplines, like the theories of quadratic forms and real algebraic curves.
There are two problems that are not only unresolved but may in fact be unresolvable by modern standards. The 6th problem concerns the axiomatization of physics, a goal that 20th-century developments seem to render both more remote and less important than in Hilbert's time. Also, the 4th problem concerns the foundations of geometry, in a manner that is now generally judged to be too vague to enable a definitive answer.
The other 21 problems have all received significant attention, and late into the 20th century work on these problems was still considered to be of the greatest importance. 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 Yuri Matiyasevich (completing work by Julia Robinson, Hilary Putnam, and Martin Davis) generated similar acclaim. Aspects of these problems are still of great interest today.
Following Gottlob Frege and Bertrand Russell, Hilbert sought to define mathematics logically 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.[a]
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 Kurt Gödel published his theorem, but does not seem to have written any formal response to Gödel's work.[b][c]
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 this problem was solved by showing that there cannot be any such algorithm contradicted Hilbert's philosophy of mathematics.
In discussing his opinion 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.[d] 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 not any "ignorabimus" (statement whose truth can never be known).[e] It seems unclear whether he would have regarded the solution of the tenth problem as an instance of ignorabimus: what is proved not to exist is not the integer solution, but (in a certain sense) the ability to discern in a specific way whether a solution exists.
On the other hand, the status of the first and second problems is even more complicated: there is not any 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, which is not necessarily the only possible one.[f]
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.
Since 1900, mathematicians and mathematical organizations have announced problem lists, but, with few exceptions, these have not had nearly as much influence nor generated as much work as Hilbert's problems.
One exception consists of 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 Weil conjectures were very important. The first of these was proved by Bernard Dwork; a completely different proof of the first two, via ℓ-adic cohomology, was given by Alexander Grothendieck. The last and deepest of the Weil conjectures (an analogue of the Riemann hypothesis) was proved by Pierre Deligne. Both Grothendieck and Deligne were awarded the Fields medal. However, the Weil conjectures were, in their scope, 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 figured importantly in the development of many of them.
Paul Erdős posed hundreds, if not thousands, of mathematical problems, many of them profound. Erdős often offered monetary rewards; the size of the reward depended on the perceived difficulty of the problem.
The end of the millennium, which was also the centennial of Hilbert's announcement of his problems, provided a natural occasion to propose "a new set of Hilbert problems." Several mathematicians accepted the challenge, notably Fields Medalist Steve Smale, who responded to a request by Vladimir Arnold to propose a list of 18 problems.
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 during 2000 by the Clay Mathematics Institute. Unlike the Hilbert problems, where the primary award was the admiration of Hilbert in particular and mathematicians in general, each prize problem includes a million dollar bounty. As with the Hilbert problems, one of the prize problems (the Poincaré conjecture) was solved relatively soon after the problems were announced.
The Riemann hypothesis is noteworthy for its appearance on the list of Hilbert problems, Smale's list, the list of Millennium Prize Problems, and even the Weil conjectures, in its geometric guise. Although it has been attacked by major mathematicians of our day, many experts believe that it will still be part of unsolved problems lists for many centuries. Hilbert himself declared: "If I were to awaken after having slept for a thousand years, my first question would be: Has the Riemann hypothesis been proved?"
In 2008, DARPA announced its own list of 23 problems that it hoped could lead to major mathematical breakthroughs, "thereby strengthening the scientific and technological capabilities of the DoD."
Of the cleanly formulated Hilbert problems, problems 3, 7, 10, 14, 17, 18, 19, and 20 have a resolution that is accepted by consensus of the mathematical community. On the other hand, problems 1, 2, 5, 6, 9, 11, 15, 21, and 22 have solutions that have partial acceptance, but there exists some controversy as to whether they resolve the problems.
That leaves 8 (the Riemann hypothesis), 12, 13 and 16[g] unresolved, and 4 and 23 as too vague to ever be described as solved. The withdrawn 24 would also be in this class. Number 6 is deferred as a problem in physics rather than in mathematics.
Hilbert's twenty-three problems are (for details on the solutions and references, see the detailed articles that are linked to in the first column):
|Problem||Brief explanation||Status||Year Solved|
|1st||The continuum hypothesis (that is, there is no set whose cardinality is strictly between that of the integers and that of the real numbers)||Proven to be impossible to prove or disprove within Zermelo–Fraenkel set theory with or without the Axiom of Choice (provided Zermelo–Fraenkel set theory is consistent, i.e., it does not contain a contradiction). There is no consensus on whether this is a solution to the problem.||1940, 1963|
|2nd||Prove that the axioms of arithmetic are consistent.||There is no consensus on whether results of Gödel and Gentzen give a solution to the problem as stated by Hilbert. Gödel's second incompleteness theorem, proved in 1931, shows that no proof of its consistency can be carried out within arithmetic itself. Gentzen proved in 1936 that the consistency of arithmetic follows from the well-foundedness of the ordinal ε0.||1931, 1936|
|3rd||Given any two polyhedra of equal volume, is it always possible to cut the first into finitely many polyhedral pieces that can be reassembled to yield the second?||Resolved. Result: No, proved using Dehn invariants.||1900|
|4th||Construct all metrics where lines are geodesics.||Too vague to be stated resolved or not.[h]||—|
|5th||Are continuous groups automatically differential groups?||Resolved by Andrew Gleason, assuming one interpretation of the original statement. If, however, it is understood as an equivalent of the Hilbert–Smith conjecture, it is still unsolved.||1953?|
|6th||Mathematical treatment of the axioms of physics
(a) axiomatic treatment of probability with limit theorems for foundation of statistical physics
(b) the rigorous theory of limiting processes "which lead from the atomistic view to the laws of motion of continua"
|Partially resolved depending on how the original statement is interpreted. Items (a) and (b) were two specific problems given by Hilbert in a later explanation. Kolmogorov's axiomatics (1933) is now accepted as standard. There is some success on the way from the "atomistic view to the laws of motion of continua."||1933–2002?|
|7th||Is ab transcendental, for algebraic a ≠ 0,1 and irrational algebraic b ?||Resolved. Result: Yes, illustrated by Gelfond's theorem or the Gelfond–Schneider theorem.||1934|
|8th||The Riemann hypothesis
("the real part of any non-trivial zero of the Riemann zeta function is 1⁄2")
and other prime number problems, among them Goldbach's conjecture and the twin prime conjecture
|9th||Find the most general law of the reciprocity theorem in any algebraic number field.||Partially resolved.[i]||—|
|10th||Find an algorithm to determine whether a given polynomial Diophantine equation with integer coefficients has an integer solution.||Resolved. Result: Impossible; Matiyasevich's theorem implies that there is no such algorithm.||1970|
|11th||Solving quadratic forms with algebraic numerical coefficients.||Partially resolved.||—|
|12th||Extend the Kronecker–Weber theorem on Abelian extensions of the rational numbers to any base number field.||Partially resolved.||—|
|13th||Solve 7th degree equation using algebraic (variant: continuous) functions of two parameters.||Unresolved. The continuous variant of this problem was solved by Vladimir Arnold in 1957 based on work by Andrei Kolmogorov, but the algebraic variant is unresolved.[j]||—|
|14th||Is the ring of invariants of an algebraic group acting on a polynomial ring always finitely generated?||Resolved. Result: No, a counterexample was constructed by Masayoshi Nagata.||1959|
|15th||Rigorous foundation of Schubert's enumerative calculus.||Partially resolved.||—|
|16th||Describe relative positions of ovals originating from a real algebraic curve and as limit cycles of a polynomial vector field on the plane.||Unresolved, even for algebraic curves of degree 8.||—|
|17th||Express a nonnegative rational function as quotient of sums of squares.||Resolved. Result: Yes, due to Emil Artin. Moreover, an upper limit was established for the number of square terms necessary.||1927|
|18th||(a) Are there are only finitely many essentially different space groups in n-dimensional Euclidean space?
(b) Is there a polyhedron that admits only an anisohedral tiling in three dimensions?
(c) What is the densest sphere packing?
|(a) Resolved. Result Yes (by Ludwig Bieberbach)
(b) Resolved. Result: Yes (by Karl Reinhardt).
(c) Widely believed to be resolved, by computer-assisted proof (by Thomas Callister Hales). Result: Highest density achieved by close packings, each with density approximately 74%, such as face-centered cubic close packing and hexagonal close packing.[k]
|(a) 1910 |
|19th||Are the solutions of regular problems in the calculus of variations always necessarily analytic?||Resolved. Result: Yes, proven by Ennio de Giorgi and, independently and using different methods, by John Forbes Nash.||1957|
|20th||Do all variational problems with certain boundary conditions have solutions?||Resolved. A significant topic of research throughout the 20th century, culminating in solutions for the non-linear case.||?|
|21st||Proof of the existence of linear differential equations having a prescribed monodromic group||Partially resolved. Result: Yes/No/Open depending on more exact formulations of the problem.||?|
|22nd||Uniformization of analytic relations by means of automorphic functions||Partially resolved. Uniformization theorem||?|
|23rd||Further development of the calculus of variations||Too vague to be stated resolved or not.||—|
|Wikisource has original text related to this article: