{
  "id": "millennium-prize-problems",
  "title": "Millennium Prize Problems",
  "lang": "en",
  "source_lang": "en",
  "summary": "The Millennium Prize Problems are seven major mathematical challenges designated by the Clay Mathematics Institute in 2000, each carrying a million-dollar prize.",
  "category": "mathematics",
  "subcategory": "discrete-logic",
  "type": "concept",
  "aliases": [
    "Millennium Problems",
    "Clay Millennium Problems",
    "Clay Prize Problems"
  ],
  "generated_at": "2026-11-02",
  "model": "pro/gpt-6.1-sol",
  "url": "https://aiwiki.page/en/millennium-prize-problems/",
  "translations": {
    "zh-Hans": {
      "url": "https://aiwiki.page/zh/millennium-prize-problems/",
      "json": "https://aiwiki.page/zh/millennium-prize-problems.json"
    }
  },
  "sections": [
    {
      "heading": "",
      "text": "The Millennium Prize Problems are seven mathematical problems selected by the Clay Mathematics Institute and announced in Paris on May 24, 2000. A prize of US$1 million was allocated to the solution of each problem. The list comprises the Birch and Swinnerton-Dyer conjecture, the Hodge conjecture, the Navier–Stokes existence and smoothness problem, the P versus NP problem, the Poincaré conjecture, the Riemann hypothesis, and Yang–Mills existence and mass gap. Of these, only the Poincaré conjecture has an accepted solution, established through work by Grigori Perelman released in 2002–2003.\n\nThe problems concern fundamental relationships between computation and verification, geometry and topology, prime numbers and complex analysis, rational solutions and analytic functions, and mathematical equations and physical phenomena. Their importance does not arise solely from their difficulty: each identifies a structural gap in a major mathematical theory. Some ask whether an established pattern always holds; others demand a rigorous construction or a proof that solutions cannot develop singularities.\n\nAlthough commonly described as seven conjectures, the problems are not all conjectures of the same logical form. P versus NP asks whether two complexity classes coincide; the Yang–Mills problem requires both existence and a spectral property; and the Navier–Stokes problem includes precise alternatives for proving regularity or demonstrating its failure. The official formulations, rather than abbreviated popular descriptions, determine what counts as a solution."
    },
    {
      "heading": "Establishment and mathematical setting",
      "text": "The Clay Mathematics Institute was founded in 1998 by businessman Landon T. Clay and his wife, Lavinia D. Clay, to support and disseminate mathematical knowledge. Its founding scientific advisory board included Alain Connes, Arthur Jaffe, Andrew Wiles, and Edward Witten. The Millennium Prize Problems were presented at a meeting at the Collège de France in Paris, with a total prize fund of US$7 million. The announcement combined a research initiative with a public statement about the continuing importance of unresolved questions in mathematics.\n\nThe historical model was the list of problems presented by David Hilbert at the International Congress of Mathematicians in Paris in 1900. Hilbert’s published list contained 23 problems and influenced many branches of twentieth-century research. The millennium list was smaller and more concentrated: it selected established central problems rather than attempting a broad inventory of mathematical directions. The Riemann hypothesis appeared in both initiatives, forming part of Hilbert’s eighth problem.\n\nThe seven problems were accompanied by detailed expositions written by leading specialists. Stephen Cook described P versus NP; Pierre Deligne presented the Hodge conjecture; John Milnor explained the Poincaré conjecture; Enrico Bombieri discussed the Riemann hypothesis; Arthur Jaffe and Edward Witten formulated the Yang–Mills problem; Charles Fefferman set out the Navier–Stokes problem; and Andrew Wiles explained the Birch and Swinnerton-Dyer conjecture. These texts specify mathematical objects, hypotheses, and acceptable conclusions that cannot always be conveyed by a one-sentence description.\n\nThe list spans number theory, algebraic geometry, topology, analysis, mathematical physics, and theoretical computer science. Its distribution is not intended to rank all mathematical fields. Important questions in other subjects, including many areas of probability, combinatorics, and logic, do not appear. Nor does the list imply that the selected problems are independent: the two number-theoretic problems involve analytic functions, while the Poincaré problem was solved using a geometric evolution equation.\n\nTheir origins also differ substantially. The Riemann hypothesis dates to 1859, the Poincaré conjecture to 1904, and the Hodge conjecture to work developed in the twentieth century. The computational formulation of P versus NP emerged in the early 1970s, while the Birch and Swinnerton-Dyer conjecture grew out of numerical investigations in the preceding decade. Placing these problems together highlights the coexistence of long-established questions and comparatively recent theories at the mathematical research frontier."
    },
    {
      "heading": "P versus NP: computation and verification",
      "text": "The P versus NP problem asks whether every decision problem whose proposed solutions can be verified efficiently can also be solved efficiently. Here “efficiently” has a precise asymptotic meaning: the running time is bounded by a polynomial in the length of the input. The class \\(\\mathrm{P}\\) consists of decision problems solvable by a deterministic algorithm in polynomial time. The class \\(\\mathrm{NP}\\) consists of decision problems for which a yes-answer has a certificate of polynomial length that a deterministic algorithm can check in polynomial time.\n\nFor example, consider whether a graph has a cycle visiting every vertex exactly once. A proposed cycle is a certificate: checking that it visits the vertices correctly and follows the graph’s edges takes polynomial time. Finding such a cycle is a different task. The distinction is between discovering a witness and checking one, not between problems that are easy and problems that are impossible. Every problem in \\(\\mathrm{P}\\) is also in \\(\\mathrm{NP}\\), so the unresolved question is whether\n\n\\[\\mathrm{P}=\\mathrm{NP}.\\]\n\nThe abbreviation NP means nondeterministic polynomial time, not “non-polynomial.”\n\nStephen Cook’s 1971 work and Leonid Levin’s independent work established the central role of NP-completeness. A problem is NP-complete if it belongs to NP and every problem in NP can be transformed into it by a polynomial-time reduction. Boolean satisfiability is the foundational example: given a logical formula, the task is to determine whether some assignment of truth values makes it true. Richard Karp’s 1972 work showed that many familiar combinatorial problems fit this framework. A polynomial-time algorithm for any NP-complete problem would establish \\(\\mathrm{P}=\\mathrm{NP}\\).\n\nThe problem concerns worst-case behavior as input size grows. It does not assert that every instance of an NP-complete problem is difficult, and it does not exclude effective algorithms for restricted families. Modern satisfiability solvers and optimization software can handle many large practical instances without resolving the general question. Conversely, a polynomial-time algorithm with an enormous exponent might settle the theoretical problem while remaining impractical.\n\nA proof that \\(\\mathrm{P}\\ne\\mathrm{NP}\\) would require limitations applying to all polynomial-time algorithms, not merely the failure of known approaches. Research has identified barriers to broad families of proof techniques, notably relativization, natural proofs, and algebrization. These results explain why certain methods are insufficient; they do not establish that the problem is undecidable or unsolvable.\n\nThe implications extend to automated reasoning, scheduling, optimization, and cryptography, but require qualification. Proving \\(\\mathrm{P}\\ne\\mathrm{NP}\\) alone would not establish the average-case hardness assumptions underlying practical cryptography. Conversely, \\(\\mathrm{P}=\\mathrm{NP}\\), together with sufficiently effective algorithms, would undermine many conventional cryptographic assumptions. Integer factorization is not known to be NP-complete, illustrating why the prize problem must not be identified with the difficulty of breaking a particular cryptosystem."
    },
    {
      "heading": "The Hodge conjecture: topology and algebraic cycles",
      "text": "The Hodge conjecture concerns the relationship between the topological structure of a complex algebraic variety and the algebraic subvarieties it contains. Its standard setting is a smooth projective variety over the complex numbers: a nonsingular geometric object described by homogeneous polynomial equations in projective space. Such an object can be studied both through its defining equations and as a smooth manifold. The conjecture proposes that a particular class of topological information always comes from algebraic geometry.\n\nThe relevant invariant is cohomology, a theory that organizes global features of a space into algebraic objects. For a smooth projective complex variety \\(X\\), Hodge theory decomposes complex cohomology by type:\n\n\\[H^k(X,\\mathbb C)=\\bigoplus_{p+q=k}H^{p,q}(X).\\]\n\nThis decomposition reflects the complex structure, not just the underlying topology. An algebraic subvariety of complex codimension \\(p\\) determines a cohomology class in degree \\(2p\\), and that class has type \\((p,p)\\).\n\nThe conjecture asserts the converse after allowing rational coefficients: every rational cohomology class of type \\((p,p)\\) is a rational linear combination of classes of algebraic subvarieties of codimension \\(p\\). An algebraic cycle is a formal sum of such subvarieties with coefficients. Schematically, the assertion is that every element of\n\n\\[H^{2p}(X,\\mathbb Q)\\cap H^{p,p}(X)\\]\n\nis the class of an algebraic cycle with rational coefficients. The intersection is understood using the inclusion of rational cohomology into complex cohomology.\n\nThe coefficient restriction is essential. Replacing rational coefficients by integer coefficients produces an integral version that is false in general; counterexamples were constructed by Michael Atiyah and Friedrich Hirzebruch. These counterexamples do not disprove the Millennium problem. The assumptions of smoothness and projectivity are also substantive: extensions to broader classes of complex manifolds can behave differently.\n\nAn important positive case is the Lefschetz \\((1,1)\\) theorem, which settles the codimension-one case through the relationship between integral \\((1,1)\\)-classes, line bundles, and divisors. The unresolved difficulty lies in higher-codimension cycles. A cohomology class is a relatively flexible linear-algebraic object, whereas an algebraic subvariety must satisfy rigid polynomial equations. Showing that one necessarily arises from the other requires more than checking numerical dimensions or intersections.\n\nWilliam Vallance Douglas Hodge developed the underlying theory of harmonic forms in the 1930s, and the conjecture was formulated around the middle of the twentieth century. It remains central because it would identify a precise boundary between geometric information accessible through analysis and information realized by algebraic equations. It does not claim that every topological cycle is algebraic, nor does it supply a general algorithm for finding all subvarieties of a given variety."
    },
    {
      "heading": "The Poincaré conjecture: recognizing the three-sphere",
      "text": "The Poincaré conjecture states that every closed, simply connected three-dimensional manifold is homeomorphic to the three-sphere \\(S^3\\). “Closed” means compact and without boundary. A space is simply connected if it is path connected and every loop can be continuously contracted to a point. A homeomorphism is a continuous bijection with a continuous inverse, expressing equivalence at the level of topology.\n\nThe three-sphere is not the ordinary spherical surface in three-dimensional space. It is the three-dimensional space\n\n\\[S^3=\\{x\\in\\mathbb R^4:\\|x\\|=1\\}.\\]\n\nThe familiar two-dimensional sphere is characterized among closed connected surfaces by simple connectivity. Henri Poincaré asked whether the corresponding criterion works in dimension three. In 1904 he formulated the question after recognizing that an earlier homological condition was insufficient: his homology sphere has the same homology as \\(S^3\\) but a nontrivial fundamental group.\n\nThe decisive method was Ricci flow, introduced by Richard Hamilton in 1982. It evolves a Riemannian metric according to\n\n\\[\\frac{\\partial g}{\\partial t}=-2\\operatorname{Ric}(g),\\]\n\nwhere \\(\\operatorname{Ric}\\) is the Ricci curvature tensor. The equation tends to redistribute curvature, but the evolution can develop singularities. Hamilton’s program sought to understand these singularities and perform controlled surgery, removing problematic regions and continuing the flow.\n\nGrigori Perelman’s three preprints of 2002–2003 supplied essential new tools, including entropy and monotonicity formulas, a no-local-collapsing theorem, and the control needed for the surgery program. His work established the broader geometrization conjecture associated with William Thurston, of which the Poincaré conjecture is a consequence. Geometrization describes how compact three-manifolds can be decomposed into pieces carrying standard geometric structures.\n\nThe proof was examined and developed in detailed accounts by several groups, including Bruce Kleiner and John Lott, John Morgan and Gang Tian, and Huai-Dong Cao and Xi-Ping Zhu. In 2010 the Clay Mathematics Institute awarded Perelman the Millennium Prize for the Poincaré conjecture; he declined it. He had also declined the Fields Medal offered to him in 2006.\n\nThe solution is specific to the topological three-dimensional problem. Higher-dimensional analogues had been resolved by other methods: Stephen Smale established the case in dimensions at least five, and Michael Freedman proved the topological four-dimensional case. Questions about smooth structures differ from questions about homeomorphism; in particular, the smooth four-dimensional Poincaré conjecture remains distinct. The three-dimensional result demonstrates how a topological classification problem can be settled through differential geometry and the analysis of an evolving metric."
    },
    {
      "heading": "The Riemann hypothesis: zeros and prime numbers",
      "text": "The Riemann hypothesis concerns the zeros of the Riemann zeta function, initially defined for \\(\\operatorname{Re}(s)>1\\) by\n\n\\[\\zeta(s)=\\sum_{n=1}^{\\infty}\\frac{1}{n^s}.\\]\n\nThrough analytic continuation, this function extends to the complex plane except for a simple pole at \\(s=1\\). Its zeros include the negative even integers, called the trivial zeros. The hypothesis states that every other zero lies on the critical line\n\n\\[\\operatorname{Re}(s)=\\frac12.\\]\n\nThese nontrivial zeros lie in the critical strip \\(0<\\operatorname{Re}(s)<1\\).\n\nBernhard Riemann proposed the hypothesis in his 1859 paper on the number of primes below a given magnitude. The connection to prime numbers begins with Euler’s product:\n\n\\[\\zeta(s)=\\prod_{p\\ \\mathrm{prime}}(1-p^{-s})^{-1}, \\qquad \\operatorname{Re}(s)>1.\\]\n\nUnique factorization makes the product equal to the series. Analytic properties of the zeta function therefore encode information about the distribution of primes.\n\nThe prime number theorem, proved independently by Jacques Hadamard and Charles Jean de la Vallée Poussin in 1896, states that the number \\(\\pi(x)\\) of primes not exceeding \\(x\\) satisfies\n\n\\[\\pi(x)\\sim\\frac{x}{\\log x}.\\]\n\nIts proof depends on the absence of zeros on the line \\(\\operatorname{Re}(s)=1\\), a weaker statement than the Riemann hypothesis. Locating every nontrivial zero on the critical line would provide much sharper control over fluctuations in prime counting.\n\nA standard equivalent consequence is\n\n\\[\\pi(x)=\\operatorname{Li}(x)+O\\!\\left(\\sqrt{x}\\log x\\right),\\]\n\nwhere \\(\\operatorname{Li}(x)\\) is the logarithmic integral and the error term is understood asymptotically. This does not turn the primes into a periodic or locally predictable sequence. Rather, it bounds the cumulative discrepancy between their actual distribution and an analytic approximation.\n\nThere is extensive partial evidence. G. H. Hardy proved in 1914 that infinitely many zeros lie on the critical line, and later work established that a positive proportion do. Computations have verified very large finite collections of zeros. Such calculations test the conjecture and inform theory, but no finite verification rules out an exceptional zero at a greater height.\n\nThe zeta function belongs to a much larger family of \\(L\\)-functions. Generalized Riemann hypotheses concern corresponding zero-location statements for these functions. Analogues over finite fields have been proved, notably through André Weil’s work for curves and Pierre Deligne’s proof of the Weil conjectures. Those achievements show that related assertions can follow from deep geometric structures, but they do not establish the original hypothesis for the classical zeta function."
    },
    {
      "heading": "Yang–Mills existence and the mass gap",
      "text": "The Yang–Mills Millennium problem asks for a rigorous construction of a nontrivial quantum Yang–Mills theory on four-dimensional Euclidean space, for every compact simple gauge group, and a proof that the resulting theory has a positive mass gap. It joins two demands: the quantum theory must exist with appropriate mathematical properties, and its lowest nonvacuum excitations must be separated from the vacuum by a strictly positive energy scale.\n\nClassical Yang–Mills theory was introduced by Chen Ning Yang and Robert Mills in 1954. It generalizes electromagnetism using noncommutative symmetry groups. In geometric language, a gauge field is a connection, and its field strength is a curvature form,\n\n\\[F=dA+A\\wedge A.\\]\n\nThe quadratic term reflects the noncommutativity of the gauge symmetry and allows gauge fields to interact with themselves. The action is built from an integral quadratic in \\(F\\), and its stationary points satisfy the classical Yang–Mills equations.\n\nQuantization is not simply the replacement of classical variables by matrices. A quantum field theory involves infinitely many coupled degrees of freedom, and formal expressions such as path integrals do not automatically define mathematical objects. A solution must construct a theory satisfying sufficiently strong axiomatic requirements, for example through a rigorous Euclidean framework from which a physical quantum theory can be reconstructed. Merely producing a perturbation series or a regularized finite system does not establish the required continuum theory.\n\nThe mass-gap condition is naturally expressed in terms of the Hamiltonian \\(H\\). After setting the vacuum energy to zero, the desired spectral structure has the form\n\n\\[\\operatorname{spec}(H)\\subseteq \\{0\\}\\cup[\\Delta,\\infty), \\qquad \\Delta>0.\\]\n\nThere are no physical excitations with arbitrarily small positive energy. Under appropriate hypotheses, a mass gap is associated with exponential decay of suitable connected correlation functions at large separation.\n\nThe physical motivation includes the behavior of the strong interaction. Pure Yang–Mills theory with gauge group \\(SU(3)\\) is closely related to the gluonic sector of quantum chromodynamics. Nevertheless, the prize problem is not a demand to derive the full Standard Model, and it does not include dynamical quark fields. Mass gap and confinement are related ideas but are not interchangeable: a proof of one must not be assumed to prove every formulation of the other.\n\nLattice gauge theory replaces continuous spacetime by a discrete grid and provides powerful numerical evidence for nonperturbative mass scales. The outstanding mathematical task is to control the continuum and infinite-volume limits while preserving the properties needed for a quantum theory. Perturbation theory is effective at high energies because of asymptotic freedom, but the mass gap is a large-distance, strongly interacting phenomenon not established by ordinary finite-order perturbative calculations."
    },
    {
      "heading": "Navier–Stokes existence and smoothness",
      "text": "The Navier–Stokes problem concerns the mathematical behavior of three-dimensional incompressible viscous flow. With constant density absorbed into the notation, the equations can be written as\n\n\\[\\frac{\\partial u}{\\partial t}+(u\\cdot\\nabla)u =-\\nabla p+\\nu\\Delta u+f, \\qquad \\nabla\\cdot u=0.\\]\n\nHere \\(u(x,t)\\) is the velocity field, \\(p(x,t)\\) is pressure, \\(\\nu>0\\) is kinematic viscosity, and \\(f\\) is an external force. The divergence-free condition expresses incompressibility.\n\nThe central question is whether smooth admissible initial data in three dimensions always produce solutions that remain smooth for all future time, or whether finite-time breakdown can occur. The official formulation specifies alternatives on all of \\(\\mathbb R^3\\) and in a spatially periodic setting, together with precise assumptions on decay, energy, and forcing. It is not an unrestricted question about every possible fluid model, boundary condition, or singular initial state.\n\nThe difficulty is the competition between viscous smoothing and nonlinear transport. Formally, for an unforced sufficiently regular solution with appropriate spatial behavior,\n\n\\[\\frac12\\frac{d}{dt}\\int |u|^2\\,dx +\\nu\\int |\\nabla u|^2\\,dx=0.\\]\n\nThis controls kinetic energy and accumulated dissipation, but in three dimensions it does not provide all the stronger bounds required to exclude singularity formation. A finite amount of energy can be compatible with increasingly concentrated gradients.\n\nVorticity makes the dimension dependence especially clear. Writing \\(\\omega=\\nabla\\times u\\), the three-dimensional vorticity equation contains the stretching term \\((\\omega\\cdot\\nabla)u\\). This can amplify rotational motion. In two-dimensional incompressible flow, the corresponding stretching mechanism is absent, and global regularity is known under standard assumptions. The three-dimensional obstacle is therefore structural, not simply an inconvenience caused by larger calculations.\n\nJean Leray constructed global weak solutions in 1934; Eberhard Hopf later developed related existence theory. A weak solution satisfies an integrated form of the equations and need not possess all classical derivatives. In three dimensions, existence of such solutions does not settle their global smoothness or uniqueness. Partial regularity theory, including the 1982 work of Luis Caffarelli, Robert Kohn, and Louis Nirenberg, sharply restricts the possible singular set for suitable weak solutions without proving that it is empty.\n\nThe issue is distinct from whether numerical simulations reproduce observed flows. Computational fluid dynamics can produce useful approximations even while the general regularity theorem remains unproved. Conversely, apparent blow-up in a simulation can arise from insufficient resolution or numerical error. Resolving the prize problem requires a mathematical proof of global regularity under the stated conditions, or a rigorous construction demonstrating an allowed form of breakdown."
    },
    {
      "heading": "The Birch and Swinnerton-Dyer conjecture",
      "text": "The Birch and Swinnerton-Dyer conjecture relates rational solutions of equations defining elliptic curves to the behavior of associated \\(L\\)-functions. An elliptic curve over the rational numbers can be represented by an equation\n\n\\[y^2=x^3+Ax+B,\\]\n\nwith rational coefficients and nonzero discriminant, together with a point at infinity. Despite the name, an elliptic curve is not an ellipse. Its significance arises partly from a geometric addition law that makes its rational points into an abelian group.\n\nMordell’s theorem states that this group is finitely generated:\n\n\\[E(\\mathbb Q)\\cong \\mathbb Z^r\\oplus E(\\mathbb Q)_{\\mathrm{tors}}.\\]\n\nThe finite torsion subgroup consists of points of finite order. The integer \\(r\\), called the rank, counts independent infinite-order generators. Rank zero means that only finitely many rational points exist; positive rank means there are infinitely many. Determining the rank of a given curve can be difficult even when many explicit points have been found.\n\nThe analytic object is the elliptic curve’s \\(L\\)-function. At a prime \\(p\\) of good reduction, let \\(N_p\\) be the number of points on the reduced curve over the finite field, including the point at infinity, and put \\(a_p=p+1-N_p\\). The local Euler factor is\n\n\\[(1-a_pp^{-s}+p^{1-2s})^{-1}.\\]\n\nTogether with appropriate factors at bad primes, these factors define \\(L(E,s)\\) in a right half-plane. The modularity theorem supplies analytic continuation and a functional equation for elliptic curves over \\(\\mathbb Q\\).\n\nThe central rank statement is\n\n\\[\\operatorname{ord}_{s=1}L(E,s)=r.\\]\n\nThus the number of independent rational points should equal the order of vanishing of an analytic function at a particular point. The refined conjecture predicts the leading nonzero Taylor coefficient using arithmetic invariants, including a regulator, a real period, local Tamagawa numbers, the torsion subgroup, and the conjecturally finite Tate–Shafarevich group.\n\nBryan Birch and Peter Swinnerton-Dyer developed the conjecture through computer-assisted investigations in the 1960s. Point counts over finite fields suggested that the behavior of products of local data reflected the abundance of rational points. The conjecture is therefore an important instance in which numerical experimentation revealed a precise link between arithmetic and analysis.\n\nMajor theorems establish the expected equality of analytic and algebraic ranks when the analytic rank is zero or one, through work including that of Benedict Gross, Don Zagier, and Victor Kolyvagin. The full conjecture remains unresolved, particularly in higher-rank cases and in the general leading-coefficient formula. Computing many points or observing a numerically small \\(L\\)-value does not by itself prove the rank or establish the exact order of vanishing."
    },
    {
      "heading": "Prize rules, verification, and the meaning of a solution",
      "text": "The million-dollar allocation for each problem is governed by the Clay Mathematics Institute’s rules, rather than by a simple first-submission procedure. The institute does not accept proposed solutions directly as prize submissions. In the ordinary route to consideration, a proposed solution must be published in a qualifying outlet, at least two years must pass after publication, and the work must achieve general acceptance in the global mathematics community. The rules also provide for the institute’s own procedures and discretion in evaluating exceptional circumstances.\n\nThese conditions distinguish publicity from verification. A public announcement, uploaded manuscript, or computer-generated argument is not automatically a recognized solution. Specialists must examine whether the proof establishes the precise assertion, whether intermediate results are justified, and whether all hypotheses are respected. In a long argument, checking can involve reconstructing omitted details, comparing independent expositions, and determining whether later corrections repair or alter the central proof.\n\nThe accepted outcome depends on the problem’s logical form. Either \\(\\mathrm{P}=\\mathrm{NP}\\) or \\(\\mathrm{P}\\ne\\mathrm{NP}\\) would answer the computational question. A valid counterexample would disprove a universal assertion such as the Hodge conjecture or Riemann hypothesis, but the official formulation and prize rules determine the assessment of such a result. For Navier–Stokes, a proposed singularity must satisfy one of the stated breakdown alternatives rather than belong to a different equation or data class. For Yang–Mills, proving a property of a formal model is insufficient without constructing the required quantum theory.\n\nThe Poincaré case illustrates the distinction between authorship, dissemination, mathematical acceptance, and payment. Perelman released his main papers as preprints rather than following the ordinary journal-publication route. Extensive expert examination and detailed subsequent accounts established acceptance of the argument. The institute recognized his solution in 2010 under its procedures, and his refusal of the money did not affect the mathematical status of the theorem. Receiving payment is not what makes a statement proved.\n\nPartial progress also has a precise but limited role. Verifying finitely many zeta zeros does not prove the Riemann hypothesis; establishing regularity for a restricted class of flows does not settle all admissible three-dimensional data; and proving a theorem for one family of algebraic varieties does not establish the Hodge conjecture generally. Such work can nevertheless introduce methods or identify obstructions central to an eventual solution.\n\nThe prize list is fixed rather than replenished whenever a problem is solved. The Poincaré conjecture remains one of the seven original Millennium Prize Problems, now with the status of a theorem. The remaining six retain their place as unresolved problems; later developments are assessed against their mathematical formulations, not against the amount of attention a claimed solution receives."
    }
  ],
  "links": [
    "mathematics",
    "david-hilbert",
    "number-theory",
    "algebraic-geometry",
    "topology",
    "mathematical-analysis",
    "computer-science",
    "polynomial",
    "np-completeness",
    "mathematical-optimization",
    "cybersecurity",
    "complex-number",
    "manifold",
    "homeomorphism",
    "riemann-hypothesis",
    "riemann-zeta-function",
    "analytic-continuation",
    "prime-number",
    "prime-number-theorem",
    "yang-mills-theory",
    "navier-stokes-equations",
    "weak-solution",
    "mathematical-proof",
    "elliptic-curve",
    "rational-number"
  ],
  "sources": [],
  "license": "https://creativecommons.org/licenses/by/4.0/"
}