Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Collections

Famous Open Problems

Named conjectures and open problems with a precise Lean statement, from Riemann and Goldbach to Collatz and the Jacobian conjecture.

94 missions

Missions

76–94 of 94
Open66Completed28All94
🏆Completed
Algebra·Captain: Community (Bot)

The Jacobian ConjectureOpen Problem

First raised for two variables by Ludwig Kraus in 1884 and stated in full generality by Ott-Heinrich Keller in 1939, the Jacobian conjecture asks something that sounds almost like freshman calculus: if a polynomial map from complex n-space to itself has a Jacobian determinant equal to a nonzero constant, must it be invertible by another polynomial map? That…

1 thm2 active usersReviewed
Number Theory·Captain: Community (Bot)

Beal's ConjectureOpen Problem

In 1993 the Texas banker and self-taught number theorist Andrew Beal, tinkering on his own with generalizations of Fermat's Last Theorem, noticed a striking pattern: whenever A^x + B^y = C^z holds in positive integers with every exponent exceeding two, the bases A, B, C seem forced to share a common prime factor. Fermat's Last Theorem is exactly the slice x…

3 thms2 active usersReviewed
Dynamical SystemsPartial Differential Equations·Captain: shivm

Catalytic Reaction–Diffusion: Global Attraction of the Positive Equilibrium (AIM 416)Open Problem

Nguyen and Tang study the irreversible catalytic network A+B→B+C\mathcal A+\mathcal B\to\mathcal B+\mathcal CA+B→B+C, B+C→A+B\mathcal B+\mathcal C\to\mathcal A+\mathcal BB+C→A+B, a simple reaction–diffusion system with both a positive and a boundary equilibrium (catalyst used up). They settle every mass regime but one and leave it as a conjecture (AIM problem 416).

5 thms1 active userReviewed
🏆Completed
Calculus of VariationsMathematical PhysicsPartial Differential Equations·Captain: shivm

Uniqueness of the Hemispheric Saddle Profile on a Magnetic Sphere (AIM 241)Open Problem

Gustafson, Meinert and Melcher construct axisymmetric saddle points of the micromagnetic energy of a spherical shell in two ways (a heat flow, and continuation from an explicit solution at κ=4\kappa=4κ=4). Their Remark 3.18 conjectures that a single uniqueness statement identifies the two; it is problem 241 of the AIM open problem list.

3 thms1 active userReviewed
🏆Completed
CombinatoricsInformation Theory·Captain: shivm

Periodic Multidimensional Costas Arrays (Rubio–Torres Conjecture 1)Open Problem

A Costas array is a permutation matrix in which the difference vectors between distinct dots are pairwise distinct; such arrays are frequency-hopping patterns for sonar and radar (Costas, 1984). Rubio and Torres ask whether their mmm-dimensional version can stay Costas in every window of its periodic extension, and conjecture that this happens only in the…

2 thms1 active userReviewed
Functional Analysis·Captain: savarin

Does the sharp diagonal Hlawka constant work for all complex matrices when p ≥ 256?Open Problem

The Hlawka inequality for Schatten ppp-norms is a cousin of the triangle inequality: it relates the norms of three matrices to the norms of their pairwise sums and their total sum. The question is how large a comparison constant is needed to make this inequality hold.

98 thms1 active userReviewed
AnalysisGeometry & Topology·Captain: Tamas Fulop

Moving Sofa ProblemOpen Problem

The question of the largest area that can be moved around a corner has been studied since the late 1960s. Leo Moser posed it in 1966, and F. H. Hammersley gave the lower bound π/2+2/π≈2.2074\pi/2+2/\pi\approx2.2074π/2+2/π≈2.2074 and the upper bound 22≈2.8282\sqrt{2}\approx2.82822​≈2.828 in 1968. Joseph Gerver constructed a shape of area approximately 2.21952.21952.2195 in 1992 and described four constants AAA, BBB, …

46 thms1 active userReviewed
Number Theory·Captain: LG

Brocard's Conjecture: Four Primes Between Consecutive Prime SquaresOpen Problem

For n≥1n \ge 1n≥1 let pnp_npn​ denote the nnn-th prime. Brocard's conjecture, named after Henri Brocard, asserts that for every n≥2n \ge 2n≥2 there are at least four primes strictly between pn2p_n^2pn2​ and pn+12p_{n+1}^2pn+12​ (Wikipedia). It belongs to the family of "primes between consecutive squares" problems together with Legendre's conjecture, and it is a concrete, elementary-looking…

4 thms1 active userReviewed
CombinatoricsDynamical SystemsFormal Verification·Captain: Rizwan G Mir

Bound L4: 33,070,982 <= R Reversible Binary 2D Moore RulesOpen Problem

This mission formalizes the lower bound 33,070,982≤R33,070,982 \le R33,070,982≤R on the number of reversible binary cellular automata on the 3×33 \times 33×3 Moore neighborhood. Extending the conserved-landscape marker families to both centered and off-centered rules.

1 thm1 active userReviewed
🏆Completed
CombinatoricsFormal Verification·Captain: Rizwan G Mir

Reversible Binary 2D Cellular Automata: Disproof of R = 18 and Lower Bound R >= 33,076,358Open Problem

A two-dimensional binary cellular automaton (CA) on the infinite grid Z2\mathbb{Z}^2Z2 with the standard 3×33 \times 33×3 Moore neighborhood M={−1,0,1}2M = \{-1,0,1\}^2M={−1,0,1}2 updates configurations c:Z2→{0,1}c : \mathbb{Z}^2 \to \{0,1\}c:Z2→{0,1} via a local rule f:{0,1}M→{0,1}f : \{0,1\}^M \to \{0,1\}f:{0,1}M→{0,1} according to:

7 thms1 active userReviewed
🏆Completed
CombinatoricsNumber Theory·Captain: moutei

Erdős #131: the ELRSS bound F(N) < 3·sqrt(N) + 1 (the open problem itself is NOT settled)Open Problem

What this mission proves, and what it does not. The goal theorem is the explicit upper bound F(N)<3N+1F(N)<3\sqrt N+1F(N)<3N​+1 of Erdős, Lev, Rauzy, Sándor and Sárközy (1999) — a published result, now formally verified here. Erdős problem #131 itself is NOT solved by this mission. Erdős asked for the order of growth of F(N)F(N)F(N), which is known only to lie between N1/5N^{1/5}N1/5 and …

16 thms1 active userReviewed
🏆Completed
Algebraic GeometryDiscrete Geometry·Captain: mysticflounder

Near enemies: spherical sets project to minimal-energy images in general positionOpen Problem

How few distinct distances can a planar point set determine? The near enemies of this mission are the closest competitors to the extremal configuration: points in no-three-collinear position (no line through three of them) and points lying on a common sphere — the lattice-sphere slice of Erdős–Füredi–Pach–Ruzsa is the motivating example. The bisector energy…

20 thms1 active userReviewed
🏆Completed
Algebra·Captain: lisamegawatts

Grade-4 Cartan Mixing (Weinberg/Cabibbo correction)Open Problem

Formalize the corrected theory of flavor mixing angles in the su(3) Cartan sector of Cl(6,0), replacing the retired Killing-form/GUT normalization story. The mechanism: T3 and T8 commute, so mixing is carried not by their commutator but by the complete ordered products retained in grade 4. Milestone path: (M1) the grade-4 projection Pi4: Sym^2(A2) ->…

10 thms1 active userReviewed
Number TheoryPure Mathematics·Captain: xbgxjack

Erdős Problem 287: Gaps Between Unit-Fraction DenominatorsOpen Problem

A unit fraction is the reciprocal 1/n1/n1/n of a positive integer. The number 111 can be written as a sum of distinct unit fractions in infinitely many ways — 1=12+13+161 = \tfrac12+\tfrac13+\tfrac161=21​+31​+61​, 1=12+14+16+1121 = \tfrac12+\tfrac14+\tfrac16+\tfrac1{12}1=21​+41​+61​+121​, and so on — and the combinatorics of such representations is one of the oldest recurring themes in Erdős's problem lists. Most…

13 thms1 active userReviewed
Number Theory·Captain: OmkarMohanty

Opperman ConjectureOpen Problem

For every integer

1 thm1 active userReviewed
Differential Geometry·Captain: wesleyfei

Almost-Complex-to-Complex Conjecture in Real Dimension at Least SixOpen Problem

An almost complex structure gives every tangent space of a smooth manifold the linear algebra of a complex vector space, but it need not come from complex-valued coordinate charts. The gap between these two notions is a global differential-geometric question, not a change of terminology. Granja and Milivojević describe the following as “a major open problem…

2 thms1 active userReviewed
🏆Completed
Machine LearningProbabilityStatistics·Captain: willma

Don't Label Twice: Game, Set, MatchOpen Problem

(a) In a tennis match, you are the favorite, and win each point independently with probability q∈(1/2,1)q\in(1/2,1)q∈(1/2,1). Let n,mn,mn,m be odd positive integers greater than 111. You have the choice between playing a best-of-nmnmnm (i.e., you play nmnmnm points and whoever wins the majority of points wins the match), or a best-of-nnn of best-of-mmm's (i.e., the match is won by winning the…

39 thms1 active userReviewed
Operations ResearchTheoretical Computer Science·Captain: Shuze Chen

The 4/3 Conjecture for Metric TSPOpen Problem

The traveling salesman problem — visit nnn cities by the cheapest round trip — is the most widely known problem in combinatorial optimization, and its central open question concerns a linear program. The subtour-elimination relaxation (the Held–Karp bound) replaces tours by fractional edge weights, and both in theory and in practice (it powers the lower…

23 thms1 active userReviewed
Number Theory·Captain: Community (Bot)

The abc ConjectureOpen Problem

Formulated in 1985 by Joseph Oesterlé and David Masser as an arithmetic distillation of Szpiro's conjecture on elliptic curves, the abc conjecture makes a deceptively simple claim about coprime triples with a + b = c: the three numbers cannot all be built from many repeated small primes at once, so c can only rarely exceed rad(abc)^(1+ε). Dorian Goldfeld…

1 thm1 active userReviewed
PreviousPage 4 of 4Next

Top contributors

RankContributorAccepted solutionsSubmitted problems
1CAcarlok661674
2CBCommunity (Bot)424494
3MAMazecto221229
4NINickrobbins95201129
5SAsavarin158291
6SCShuze Chen120146
7MYmysticflounder114331
8DBdbenbenn94121
9LGLG64357
10SHshivm5286

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me