Skip to content

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

4 Commits
 
 
 
 
 
 
 
 

Repository files navigation

Open Problems in Mathematics — a tier list

Tier list

Ranking axis: structural centrality × how much a proof would transform mathematics — not raw fame, not difficulty alone. Fame is a tiebreaker. This is why some household names land surprisingly low.

Inspired by the July 2026 counterexample to the Jacobian conjecture (Levent Alpöge + Claude, a 216-character polynomial map ℂ³→ℂ³ with constant Jacobian determinant that is not injective — n ≥ 3 refuted, n = 2 still open; verified across the community within a day of posting). One more reminder that "open" is a temporary condition — see the graveyard at the bottom for what "solvable" has looked like lately.

How to read an entry. Links are marked by favicon, where they exist:

  • Wikipedia — or arXiv where no decent article exists
  • a formal statement in Lean 4, almost always in Google DeepMind's formal-conjectures repo (statements, not proofs!)
  • Manifold prediction markets, usually the "is it true?" market — probabilities are snapshots from July 2026 and will drift
  • Metaculus (search links — their API is login-walled) and other public forecasting or notable expert discussion

Corrections and additions welcome — PRs open. Especially wanted: markets and formalizations that exist but aren't linked here.


S — Load-bearing pillars of mathematics

  1. Riemann Hypothesis (+ GRH for L-functions) — thousands of theorems are conditional on it; secretly a statement about the "spectrum" of the primes. The one problem on both Hilbert's 1900 list and the Millennium list. Wikipedia · Lean statement (also stated in Mathlib) · proven or refuted before 2050 — 50% · if false, how many counterexamples? · AI resolves it before 2035 — 42% · Metaculus Why "is it true?" is a clean binary here, unlike CH: RH is equivalent to a Π⁰₁ arithmetic sentence — a "this computation never finds a counterexample" statement (MathOverflow: Is RH equivalent to a Π₁ sentence?). Concretely: RH ⇔ an elementary inequality about σ(n) and harmonic numbers (Lagarias 2002), and ⇔ a specific 744-state Turing machine never halting (Matiyasevich–O'Rear–Aaronson, in Aaronson's Busy Beaver survey, §3; see also the blog post). For such sentences falsity is always provable — run the machine to the counterexample — so even a ZFC-independence proof would settle the market: independent ⇒ no counterexample ⇒ true. Contrast the CH market below, where "true" is genuinely a philosophy question.
  2. P vs NP — the only problem here whose answer changes what civilization can do, not just what mathematicians know. Also the deepest: we can't even prove weak circuit lower bounds. Wikipedia · Lean statement · P = NP? — 8% · resolved before humans land on Mars — 37% · Aaronson's survey & Gasarch's polls (~80–90% of experts say P ≠ NP)
  3. Langlands functoriality / general reciprocity — the grand unification of number theory, representation theory, and harmonic analysis. Technically a program, not a problem, but FLT was a corollary of one corner of it. That's the tier it lives in. Wikipedia · geometric Langlands (function-field analogue) was proven in 2024 (Gaitsgory–Raskin et al.) — the arithmetic case is the S-tier monster

A — Field-defining

  1. Birch–Swinnerton-Dyer — the bridge between analysis and arithmetic of elliptic curves; rank part and finiteness of Ш both open in general. Wikipedia · true? — 84% · which Millennium problem falls next?
  2. Hodge Conjecture — which topology is algebraic; the health check for all of algebraic geometry. Wikipedia · true? — 80% · Litt's $25k bet against a claimed AI-assisted proof — 99%
  3. Tate Conjecture + Grothendieck's Standard Conjectures — the motives package; Hodge's arithmetic sibling, arguably more consequential than Hodge itself. Wikipedia: Tate · Wikipedia: Standard
  4. Navier–Stokes global regularity — do fluids blow up? (Related: interior finite-time singularity for 3D Euler — Hou–Chen's computer-assisted boundary blowup was a landmark.) Wikipedia · Lean statement · smooth solutions always exist? — 13% (Tao suspects blowup) · Hutter's $10k bet on a claimed Lean proof — 99% he wins
  5. Yang–Mills existence & mass gap — construct a 4D QFT rigorously at all; the gap between physics and math in one problem. Wikipedia · proven ever? — 62%
  6. abc Conjecture — would trivialize half of Diophantine number theory. Status: contested — Mochizuki's IUT claim is not accepted by the broader community (the Scholze–Stix objection stands). Wikipedia · Lean statement · true? — 80% · Mochizuki's proof has unfixable gaps — 96%
  7. Hardy–Littlewood prime k-tuples (twin primes as flagship) — post-Zhang/Maynard we have bounded gaps; the full conjecture is the real prize. Wikipedia · Lean: twin primes, k-tuples · infinitely many twin primes? — 95% · proven before 2030 — 18%
  8. Smooth 4-dimensional Poincaré Conjecture — the last Poincaré. Dimension 4 is the lawless frontier of topology. Wikipedia · true? — 53% — a genuine coin-flip among topologists
  9. Schanuel's Conjecture — one statement that subsumes essentially all of transcendence theory (e+π irrational? Corollary.). The most underrated entry on this list. Wikipedia · Lean statement · true? — 77%
  10. Bombieri–Lang — geometry governs rational points; the ultimate generalization of Faltings. Wikipedia
  11. Existence of one-way functions — the foundation of all cryptography; Impagliazzo's five worlds made precise. Wikipedia · exist? — 87% · which computational universe do we live in?
  12. Fontaine–Mazur + Bloch–Kato/Beilinson conjectures — which Galois representations come from geometry, and what L-values mean. The arithmetic engine room. Wikipedia: Fontaine–Mazur · Wikipedia: Beilinson
  13. Borel & Novikov Conjectures — rigidity of aspherical manifolds; where topology, geometry, and operator algebras (Baum–Connes) meet. Wikipedia: Borel · Wikipedia: Novikov
  14. Hilbert's 16th problem (second part) — a uniform bound H(n) on limit cycles of degree-n polynomial vector fields; not even known finite for n = 2. On Hilbert's list and Smale's list; the central open problem of dynamical systems. (new) Wikipedia
  15. Cosmic censorship (weak & strong) — are naked singularities generic? Is determinism salvageable in GR? The organizing conjectures of mathematical relativity; strong censorship (C⁰ version) already dented by Dafermos–Luk. Kerr stability only recently settled for slow rotation. (new) Wikipedia · famously the subject of Thorne–Hawking–Preskill bets

B — Major open problems within their fields

Number theory

  1. Goldbach (binary) — famous and genuinely important, but a proof likely refines circle-method tech rather than creating a new world. Ternary case: done (Helfgott). Wikipedia · Lean statement · true? — 92% · proved before 2040 — 44%
  2. Lindelöf Hypothesis — RH's understudy; even this is out of reach. Wikipedia
  3. Elliott–Halberstam — primes in progressions beyond GRH; would give prime gaps ≤ 6 (Polymath8b). Wikipedia · Lean statement
  4. Chowla & Sarnak conjectures — Möbius randomness; Tao's logarithmic results are the beachhead. Wikipedia
  5. Are elliptic curve ranks unbounded? — heuristics now say bounded (!), reversing decades of folklore. Wikipedia · Lean statement
  6. Hilbert's 12th (explicit class field theory) — real recent progress (Dasgupta–Kakde), still open. Wikipedia
  7. Hilbert's 10th over ℚ — is there an algorithm for rational points? (Over ℤ: no — MRDP. Over ℚ: open; over some big rings recently resolved.) Wikipedia
  8. Inverse Galois Problem — is every finite group a Galois group over ℚ? Wikipedia · Lean statement
  9. Artin's primitive root conjecture — follows from GRH; unconditional = open. Wikipedia · Lean statement
  10. Lehmer's Mahler measure problem — a spectral gap for algebraic numbers. Wikipedia · Lean statement
  11. Littlewood Conjecture (simultaneous approximation) — exceptions have measure zero (Einsiedler–Katok–Lindenstrauss); full statement open. Wikipedia · Lean statement
  12. Zilber–Pink — the unlikely-intersections master conjecture (André–Oort was its solved special case). Wikipedia
  13. Serre's uniformity question — Galois images of elliptic curves over ℚ: is 37 the last exceptional prime? Wikipedia
  14. Vandiver / Leopoldt — old, stubborn, structurally meaningful. Wikipedia: Vandiver · Wikipedia: Leopoldt · Lean: Vandiver
  15. Grothendieck's section conjecture — anabelian geometry's central open question: rational points = sections of the fundamental exact sequence. (new) Wikipedia
  16. Selberg's 1/4 eigenvalue conjecture / Ramanujan–Petersson for Maass forms — the archimedean edge of Langlands; everything in analytic number theory wants it. (new) Wikipedia

Geometry & topology

  1. Slice-ribbon conjecture — knot concordance's central mystery (the Conway knot episode was a warning shot). Wikipedia
  2. L-space conjecture — the conjectural trinity (Floer homology / taut foliations / left-orderability) of 3-manifolds. arXiv
  3. 4D Schoenflies — even more embarrassing than smooth Poincaré, arguably. Wikipedia
  4. Volume Conjecture — quantum invariants see hyperbolic geometry. Wikipedia
  5. Cannon Conjecture — group theory determines when a boundary is a sphere. Wikipedia
  6. Hopf conjectures — positive curvature on S²×S²; sign of the Euler characteristic. Wikipedia
  7. Andrews–Curtis — widely suspected false; a disproof would be spectacular. Wikipedia
  8. Whitehead asphericity — 80+ years, elementary statement, nothing. Wikipedia
  9. SYZ conjecture & homological mirror symmetrywhy mirror symmetry works; proved in families of examples, open as a general principle. (new) Wikipedia: SYZ · Wikipedia: HMS

Analysis & dynamics

  1. Restriction Conjecture — the summit of harmonic analysis; Kakeya was its foothill (3D Kakeya fell in 2025 — Wang–Zahl; higher dimensions and restriction itself open). Wikipedia
  2. Falconer distance conjecture — fractal geometry's flagship. Wikipedia
  3. Invariant subspace problem (Hilbert space) — Enflo's 2023 claim remains unaccepted; cursed energy. Wikipedia · Lean statement
  4. Crouzeix's conjecture — the constant is 2, everyone believes it, nobody can do it. Wikipedia
  5. Fuglede-type spectral questions in low dimensions — false in general (Tao), alive in ℝ², ℝ³ (the conjecture was fully proved for convex domains). Wikipedia · Lean statement
  6. Furstenberg's ×2, ×3 measure conjecture — rigidity of arithmetic dynamics; Rudolph's theorem is the partial result everyone wants to remove the entropy hypothesis from. Wikipedia
  7. Soliton resolution conjecture — every reasonable dispersive evolution decomposes into solitons + radiation; proved for energy-critical waves in special cases (Duyckaerts–Kenig–Merle), wide open in general. (new) Wikipedia
  8. Quantum unique ergodicity — arithmetic case is a Fields-medal theorem (Lindenstrauss); general negatively-curved manifolds open. (new) Wikipedia

Algebra

  1. Kaplansky zero-divisor & idempotent conjectures — especially spicy since the unit conjecture was refuted (Gardam, 2021). Wikipedia · Lean statement
  2. Köthe Conjecture — ring theory's oldest open wound (1930). Wikipedia · Lean statement
  3. Alperin weight & Broué's abelian defect conjectures — modular representation theory's core (McKay itself fell in '24, Brauer's height zero in '24 too — the local-global program is on a run). Wikipedia · Wikipedia: Broué
  4. Brauer's remaining problems on blocks and characters — the 1963 list that keeps giving. Wikipedia
  5. Is Thompson's group F amenable? — the most contested question in geometric group theory; multiple contradictory claimed proofs in both directions have died. (new) Wikipedia

Combinatorics & graphs

  1. Hadwiger's Conjecture (graph minors vs. coloring) — the deepest thing in graph theory. Wikipedia · true? — 58%
  2. Erdős's conjecture on APs in sets of divergent reciprocal sum — Bloom–Sisask did density; full conjecture (primes ⇒ Green–Tao as corollary) open. Wikipedia · true? — 88% · LLM finds counterexample by 7/2027 — 8%
  3. Diagonal Ramsey asymptotics — the exponential barrier finally cracked (Campos–Griffiths–Morris–Sahasrabudhe 2023); true growth rate still open. Wikipedia
  4. Sunflower Conjecture — big progress (Alweiss–Lovett–Wu–Zhang 2019), gap remains. Wikipedia · Lean statement · true? — 73%
  5. Reconstruction Conjecture — can you rebuild a graph from its vertex-deleted deck? Wikipedia
  6. Cycle double cover / Berge–Fulkerson / Tutte's flow conjectures — the snark-infested waters. Wikipedia: CDC · Wikipedia: flows
  7. Hadwiger–Nelson (chromatic number of the plane) — now 5 ≤ χ ≤ 7 thanks to a hobbyist (de Grey, 2018). Wikipedia · Lean statement · what is χ?
  8. Inscribed square (Toeplitz) — every Jordan curve? Smooth case done; continuous case open since 1911. Wikipedia · Lean statement · true? — 80%
  9. Sphere packing / kissing numbers in general dimension — 8 and 24 fell to Viazovska; everything else is wilderness (and dim 10+ lower bounds just moved for the first time in decades). Wikipedia · Wikipedia: kissing
  10. Caccetta–Häggkvist — digraph girth; simple statement, no traction. arXiv
  11. Erdős–Hajnal conjecture — forbidding any one induced subgraph forces polynomial-size cliques or independent sets; structural graph theory's north star. (new) Wikipedia
  12. Sidorenko's conjecture — bipartite graphs are "quasirandomness-minimal"; deceptively innocent, tied to Gowers norms and graph limits. (new) Wikipedia · Lean statement
  13. Hadamard matrix conjecture — a Hadamard matrix in every order 4k; smallest open order 668. (new) Wikipedia · Lean statement
  14. Erdős–Turán conjecture on additive bases — must representation counts of an additive basis be unbounded? (new) Wikipedia

Logic & foundations

  1. The Continuum Problem, post-Cohen — independence didn't kill it: Woodin's Ultimate-L vs. the forcing-axiom camp (which says 2^ℵ⁰ = ℵ₂!) make it a live research program about which axioms are true. Wikipedia · is CH true? — 61% (a market on a statement independent of ZFC is itself a philosophy experiment)
  2. Vaught's Conjecture — model theory's white whale. Wikipedia · Lean statement

Theoretical computer science

  1. Unique Games Conjecture — half-proved (2-to-2 games); would settle optimal inapproximability across the board. Wikipedia · true? — 65%
  2. Matrix multiplication exponent ω = 2? — inching down for 50 years; current record ω < 2.3714. Wikipedia · beat 2.371552 before 2035 — 99%
  3. P = BPP (derandomization) — everyone believes it; a proof requires circuit lower bounds we can't touch. Wikipedia
  4. Graph isomorphism in P? — Babai got quasipolynomial; the last step is stuck. Wikipedia · in P? — 51% · NP-complete? — 7%
  5. Log-rank conjecture — communication complexity's oldest embarrassment. Wikipedia
  6. VP vs VNP (Valiant's hypothesis) — permanent vs. determinant; the algebraic P vs NP, plausibly easier, still untouched. (new) Wikipedia
  7. Quantum PCP conjecture — hardness of approximating ground-state energy; the NLTS breakthrough (2022) was the first real step. (new) Wikipedia

Probability, mathematical physics & high-dimensional geometry

  1. 3D Ising / percolation critical exponents & conformal invariance — 2D is a triumph (SLE); 3D is a desert with physics predictions (bootstrap!) and no proofs. Wikipedia
  2. KPZ universality in full generality — proved for exactly solvable models only. Wikipedia
  3. Ergodic/quantitative theory of turbulence — beyond even Navier–Stokes regularity. (Meanwhile Hilbert's 6th — deriving fluid equations from Newtonian particles — took a giant leap with Deng–Hani–Ma 2025.) Wikipedia
  4. Kannan–Lovász–Simonovits (KLS) conjecture — one spectral constant governing isoperimetry of all log-concave measures; Yuansi Chen's 2020 near-resolution electrified the field, the constant-factor question remains. (new) arXiv
  5. Mahler volume conjecture — cubes minimize the volume product; proved in ℝ³ (2020), open in general. Symplectic connection: it followed from Viterbo's conjecture — which was just refuted, so the route died but the conjecture didn't. (new) Wikipedia

C — Famous, but narrow or technique-isolated

  1. Odd perfect numbers — open for ~2300 years, the oldest problem in mathematics. A proof would be a fireworks show, not an earthquake. Wikipedia · Lean statement · exist? — 9%
  2. Infinitely many Mersenne primes (and: finitely many Fermat primes?) — no tools exist. None. Wikipedia · Lean statement · infinitely many? — 89% · new Mersenne prime found in 2026 — 16%
  3. Normality of π, e, √2 — we cannot prove a single natural constant is normal. Humbling, isolated. Wikipedia · Lean statement
  4. Irrationality of γ (Euler–Mascheroni) and ζ(5) — ζ(3) took Apéry magic; the magic didn't generalize. Wikipedia · Lean statement
  5. Lehmer's totient problem — does φ(n) | n−1 force primality? Wikipedia · Lean statement · composite solution exists? — 30%
  6. Ramsey number R(5,5) — known to be in [43, 46]; finite computation, cosmically infeasible. ("Aliens demand R(6,6): attack." — Erdős) Wikipedia · Lean statement · known before 2040 — 71% · its value?
  7. Union-closed sets (Frankl) — Gilmer's 2022 breakthrough got a constant (now ≈ 0.38); the ½ remains. Wikipedia · Lean statement · true? — 78%
  8. Second neighborhood conjecture, graceful trees, lonely runner — beloved, bounded blast radius. Wikipedia: 2nd nbhd · Wikipedia: graceful · Wikipedia: lonely runner · Lean: graceful, lonely runner
  9. Zaremba's conjecture — continued fractions with bounded partial quotients; Bourgain–Kontorovich got density one. Wikipedia
  10. Erdős–Straus (4/n = 1/x + 1/y + 1/z) — the classic "looks like homework, isn't." Wikipedia
  11. Legendre's conjecture & Landau's n²+1 problem — the two Landau problems with zero movement since 1912 (his other two are Goldbach and twin primes, above). (new) Wikipedia: Legendre · Wikipedia: Landau's problems · Lean statement · which Landau problem falls next?
  12. Beal conjecture — Fermat with mixed exponents and a $1M bounty from a Texas banker. (new) Wikipedia · Lean statement · true? — 59%
  13. Sendov's conjecture — zeros and critical points of polynomials in a disk; Tao settled it for sufficiently high degree, the rest is open. (new) Wikipedia · Lean statement
  14. Singmaster's conjecture — does any number appear more than 8 times in Pascal's triangle? (new) Wikipedia · Lean statement

☠️ Cursed tier (fame ≫ tractability; possibly technique-free)

  1. Collatz — "Mathematics is not ready for such problems" (Erdős). Tao's almost-everywhere result is the best in 80 years and it's still nowhere near. Maximal fame, unclear payoff, no attack surface. Its own tier. Wikipedia · Lean statement · true? — 82% · resolved before 2030 — 14%
  2. 3×3 magic square of squares — recreational statement, absorbs infinite amateur-hours (a.k.a. the Parker Square problem). Wikipedia · Lean statement · which year is one found? · proven impossible by 2025 — resolved NO
  3. Perfect cuboid — same energy, 300 years running. Wikipedia · Lean statement
  4. Brocard's problem (n! + 1 = m²) — three known solutions, no theory. Wikipedia · Lean statement

🪦 Recently fell (calibration for the whole list)

For a sense of what "solvable" looks like lately:

  • Jacobian conjecturerefuted for n ≥ 3 by a 216-character map ℂ³→ℂ³ ( Alpöge + Claude, July 2026; simple enough to check in a CAS, verified community-wide within a day). The great graveyard of false proofs ends up dead by counterexample. The n = 2 case is still open — true in 2D? — 39% · general, pre-refutation market — 1% · Lean statement. Bonus casualty: via Tsuchimoto / Belov-Kanel–Kontsevich equivalences, trouble propagates to the Dixmier conjecture for Weyl algebras.
  • Bourgain's slicing problem / hyperplane conjecture — Klartag–Lehec '25, pending review
  • Moving sofa problem — Baek '24, pending review ( Wikipedia) — Lean statement
  • 3D Kakeya conjecture — Wang–Zahl '25 ( Wikipedia · full conjecture true? — 85%)
  • Kervaire invariant one, dimension 126 — Lin–Wang–Xu '24; the last dimension, settled positively ( Wikipedia)
  • McKay conjecture — Cabanes–Späth '24 ( Wikipedia); Brauer's height zero conjecture also fell '24
  • Viterbo's conjecturerefuted, Haim-Kislev–Ostrover '24 ( arXiv)
  • Consistency of Quine's NF — Holmes' proof verified in Lean, '24 ( Wikipedia) — a preview of this list's "Lean?" column becoming load-bearing
  • Marton's conjecture / Polynomial Freiman–Ruzsa — Gowers–Green–Manners–Tao '23, formalized in Lean within weeks
  • Aperiodic monotile ("the hat") — Smith–Myers–Kaplan–Goodman-Strauss '23 ( Wikipedia)
  • Telescope conjecturerefuted, Burklund–Hahn–Levy–Schlank '23; the last of Ravenel's conjectures ( Wikipedia)
  • Ryser–Brualdi–Stein (large n) — Montgomery '23 ( Wikipedia)
  • Erdős primitive set conjecture — Lichtman '22
  • Erdős–Faber–Lovász — Kang–Kelly–Kühn–Methuku–Osthus '21 · André–Oort — Pila–Shankar–Tsimerman '21 · Kaplansky unit conjecturerefuted, Gardam '21
  • Duffin–Schaeffer — Koukoulopoulos–Maynard '19 · Sensitivity conjecture — Huang '19, two pages! · Connes embeddingrefuted via MIP*=RE '20
  • Sphere packing, dims 8 & 24 — Viazovska '16–'17 · Kadison–Singer — Marcus–Spielman–Srivastava '13 · Bounded prime gaps — Zhang / Maynard '13

Refutation rate in that sample is worth staring at: Connes embedding, Kaplansky units, telescope, Viterbo, Jacobian. Betting "true" on everything is not the free money it looks like.


Hot takes, made explicit

  • Goldbach at B, because fame ≠ fertility.
  • Collatz quarantined, because a tier list should measure what a solution buys you.
  • Tate above Hodge in spirit if not placement.
  • The most underrated entry on the whole list is Schanuel — one sentence that would retire an entire subfield.
  • The Manifold "is it true?" markets are thin but surprisingly sane — note the market had the Jacobian conjecture at ~1% before the counterexample, and has smooth 4D Poincaré as a literal coin-flip, matching expert vibes.

Meta

  • Forecasting coverage is patchy. Manifold has real markets on ~⅓ of this list (linked above). Metaculus has a cluster around the Millennium problems and AI-does-math ( search). The meta-markets are arguably the most interesting: AI solves a Millennium problem before 2030 — 52%, ≥4 of 7 Millennium problems solved by 2040 — 66%.
  • Lean coverage is better than you'd guess. formal-conjectures has formal statements for 30+ items on this list (all linked inline), plus ~500 Erdős problems. If you want to add one that's missing, that repo takes PRs too.
  • Probabilities are snapshots (July 2026). If you're reading this later, click through.
  • Generated graphic: python3 make_tier_svg.pytier-list.svg.

List curated in conversation with Claude. Content license: CC BY 4.0.

About

A tier list of open problems in mathematics — with Wikipedia links, Lean formalizations, and prediction markets

Resources

Stars

Watchers

Forks

Releases

Packages

Contributors

Languages