Hilbert's problems

Hilbert's problems are 23 problems in mathematics published by German mathematician David Hilbert in 1900.

Uses your system voice; voice and rate in settings.

Snapshot

≈ 8 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

Hilbert's problems are 23 problems in mathematics published by German mathematician David Hilbert in 19001. He intended to rival the master of French mathematics, Henri Poincaré, and to prove that he was cut from the same cloth. 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, and translated into English in 19021 by Mary Frances Winston Newson in the Bulletin of the American Mathematical Society.

Earlier publications (in the original German) appeared in Archiv der Mathematik und Physik. Of the cleanly formulated Hilbert problems: 3, 6a , 7, 10, 11, 14, 17, 18, 19, and 21 have resolutions that are accepted by consensus of the mathematical community.

The status of problems 1, 2, 5, 6b, 8c, 13, and 15 is controversial: there are some results, but there exists some controversy as to whether they resolve the problems. Problems 8a, 8b, 9, 12, 16, 20 and 22 are unresolved or widely agreed as unresolved despite some partial results.

Problems 4 and 23 are considered as too vague to ever be described as solved; the withdrawn 24 would also be in this class.

Hilbert's problems are 23 problems in mathematics published by German mathematician David Hilbert in 1900. He intended to rival the master of French mathematics, Henri Poincaré, and to prove that he was cut from the same cloth. 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, and translated into English in 1902 by Mary Frances Winston Newson in the Bulletin of the American Mathematical Society.

Earlier publications (in the original German) appeared in Archiv der Mathematik und Physik. Of the cleanly formulated Hilbert problems: 3, 6a , 7, 10, 11, 14, 17, 18, 19, and 21 have resolutions that are accepted by consensus of the mathematical community.

The status of problems 1, 2, 5, 6b, 8c, 13, and 15 is controversial: there are some results, but there exists some controversy as to whether they resolve the problems. Problems 8a, 8b, 9, 12, 16, 20 and 22 are unresolved or widely agreed as unresolved despite some partial results.

Problems 4 and 23 are considered as too vague to ever be described as solved; the withdrawn 24 would also be in this class.

Table of problems

Hilbert's 23 problems, and the unpublished 24th problem, are listed below. For details on the solutions and references, see the articles that are linked to in the first column.

Knowability

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.

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.

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. 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).

It seems unclear whether he would have regarded the solution of the tenth problem as an instance of ignorabimus. 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, which is not necessarily the only possible one.

Follow-ups

Mathematicians and mathematical organizations have announced numerous problem lists which have, with few exceptions, failed to generate nearly as much influence or work as Hilbert's problems. Notable examples include the Weil conjectures, Paul Erdős's problems, Thurston's 24 questions, and Smale's problems.

The four Weil Conjectures, made by André Weil in the late 1940s, are important to the fields of algebraic geometry and number theory. The first conjecture was proven by Bernard Dwork; a 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 proven by Pierre Deligne. Both Grothendieck and Deligne were awarded the Fields Medal. However, the Weil conjectures were more like a single Hilbert problem in scope, and Weil never intended them as a programme for all mathematics.

Erdős posed hundreds, possibly thousands, of problems, often offering monetary rewards; the size of the reward depended on the perceived difficulty of the problem. William Thurston published a list of 24 mathematical problems in a 19821 paper, but Thurston's list was focused on problems from geometric topology of 3-dimensional manifolds, unlike Hilbert's list that covered many different branches of mathematics, Also unlike Hilbert's problems, many of which took decades to resolve or are still open, 22 of 24 Thurston's problems were resolved in 30 years after publication.

Several mathematicians proposed problem lists at the turn of the millennium, such as 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. While most of Hilbert's problems were not recognised widely in mathematical community before publication of his list, all of Millennium Prize Problem was well-known from decades and earned many attempted proofs.

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". The DARPA list also includes a few problems from Hilbert's list, e.g. the Riemann hypothesis.

See also

Landau's problems Millennium Prize Problems Smale's problems Taniyama's problems Thurston's 24 questions

Text derived from https://en.wikipedia.org/w/index.php?oldid=1378218691 under CC BY-SA 4.0; modifications have been made.

References

  1. ↩Wikipedia “Hilbert's problems” revision 1378218691 · retrieved 2026-10-20 publication date (×3) · confidence 0.95 revision URL