Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Collections

OAI Math

All of openAI's results.

https://github.com/openai/math

317 completed missions

Missions

101–125 of 317
Open0Completed317All317
🏆Completed
Information TheoryProbability·Captain: marwahaha

The exact reconstruction threshold for the three-state symmetric channelOpen Problem

Broadcasting a label through noisy tree edges models how information decays with distance. The source studies when observations far from the root retain information about its three-state label. The source is OpenAI's September 2026 manuscript.

48 thms2 active usersReviewed
🏆Completed
Markov ChainProbability·Captain: marwahaha

Cutoff throughout the high-temperature Sherrington–Kirkpatrick phaseOpen Problem

Cutoff means that a Markov chain’s transition from far from equilibrium to near equilibrium occurs in a negligible fraction of its mixing time. The source studies heat-bath dynamics for a disordered mean-field Ising model. The source is OpenAI's September 2026 manuscript.

8 thms2 active usersReviewed
🏆Completed
Mathematical PhysicsProbability·Captain: marwahaha

The free energy of the spherical random perceptronOpen Problem

The spherical perceptron assigns random rewards to vectors of fixed length. The source asks for an exact pressure formula without a convexity or symmetry condition on the single-pattern potential. The source is OpenAI's September 2026 manuscript.

29 thms2 active usersReviewed
🏆Completed
Mathematical PhysicsProbability·Captain: marwahaha

The free energy of the Ising random perceptronOpen Problem

The Ising perceptron weights binary configurations by their projections onto random patterns. The paper develops a variational description of its pressure; the available formal target checks that the proposed variational value is finite. The source is OpenAI's September 2026 manuscript.

3 thms2 active usersReviewed
🏆Completed
Mathematical PhysicsProbability·Captain: marwahaha

The Mézard–Parisi formula for diluted spin glassesOpen Problem

A diluted spin glass has finitely many interactions per spin on average. The source seeks the exact thermodynamic pressure using a hierarchy of random local-field laws. The source is OpenAI's September 2026 manuscript.

7 thms2 active usersReviewed
🏆Completed
ProbabilityStochastic Systems·Captain: marwahaha

A directional zero–one law under strict ellipticityOpen Problem

A random environment can favor different directions at different sites. The source asks whether escape in one prescribed real direction can have an intermediate probability after averaging over the environment. The source is OpenAI's September 2026 manuscript.

2 thms2 active usersReviewed
🏆Completed
Mathematical PhysicsProbability·Captain: marwahaha

Buffered comparison and stopping-band resolution in critical IsingOpen Problem

Conditioning on an explored Ising interface fixes many spins and can create alternating signs. The source develops comparison estimates that remain valid with arbitrary common pinned spins. The source is OpenAI's September 2026 manuscript.

28 thms2 active usersReviewed
🏆Completed
Graph TheoryProbability·Captain: marwahaha

Nonuniqueness of percolation on nonamenable quasi-transitive graphsOpen Problem

On an expanding infinite graph, the appearance of an infinite open cluster and the appearance of a unique one can occur at different densities. The source seeks a nonempty interval where infinitely many infinite clusters coexist. The source is OpenAI's September 2026 manuscript.

42 thms2 active usersReviewed
🏆Completed
AnalysisProbability·Captain: marwahaha

Strict convexity and differentiability of the planar exponential first-passage limit shapeOpen Problem

Random edge travel times produce a deterministic large-scale shape. The source studies two distinct regularity questions: corners and flat boundary segments. The available exponential target addresses differentiability and the structure of supporting lines. The source is OpenAI's September 2026 manuscript.

11 thms2 active usersReviewed
🏆Completed
AlgebraMathematical Logic·Captain: marwahaha

Finite congruence lattices: characterization and undecidabilityOpen Problem

A finite algebra has a lattice of congruences, ordered by inclusion. The source studies which finite lattices arise in this way, and the available goal captures its colored-graph characterization. The source is OpenAI's September 2026 manuscript.

4 thms2 active usersReviewed
🏆Completed
AlgebraGroup Theory·Captain: marwahaha

A Counterexample to Kaplansky's Direct-Finiteness Conjecture in Odd CharacteristicOpen Problem

The odd-characteristic version of direct finiteness has different coefficient constraints from the binary case. The source fixes one odd prime and links a group-algebra counterexample to a cellular automaton. The source is OpenAI's September 2026 manuscript.

2 thms2 active usersReviewed
🏆Completed
AlgebraFunctional Analysis·Captain: marwahaha

A Counterexample to the Group-Ring Determinant ConjectureOpen Problem

The determinant of a nonsingular integer matrix has absolute value at least one. The source examines the proposed counterpart for integer matrices over group rings, where the determinant is defined by an operator trace. The source is OpenAI's September 2026 manuscript.

5 thms2 active usersReviewed
🏆Completed
AlgebraGroup Theory·Captain: marwahaha

A Counterexample to Kaplansky's Direct-Finiteness Conjecture in Characteristic TwoOpen Problem

Finite-dimensional linear algebra makes a one-sided inverse two-sided. The source asks whether finite support in a group algebra can replace finite dimension and presents a characteristic-two counterexample. The source is OpenAI's September 2026 manuscript.

7 thms2 active usersReviewed
🏆Completed
Algebra·Captain: marwahaha

Lech's multiplicity conjectureOpen Problem

Multiplicity measures the growth of infinitesimal neighborhoods in a local ring. The manuscript addresses Lech’s flat-local-map inequality; the available formal target isolates its complete-domain Frobenius-complex component. The source is OpenAI's September 2026 manuscript.

7 thms2 active usersReviewed
🏆Completed
Harmonic AnalysisTheoretical Computer Science·Captain: marwahaha

Unbounded Violations of the Square-Root Degree BoundOpen Problem

The linear Fourier coefficients measure a Boolean function’s correlation with individual inputs. The source studies whether their sum can be controlled solely by the square root of the function’s real polynomial degree. The source is OpenAI's September 2026 manuscript.

33 thms2 active usersReviewed
🏆Completed
CombinatoricsDiscrete Geometry·Captain: marwahaha

A power improvement in the Heilbronn triangle lower boundOpen Problem

The Heilbronn triangle problem asks how large the smallest triangle in an nnn-point set can be. A positive improvement in the exponent would contradict bounds at every scale arbitrarily close to n−2n^{-2}n−2. The source is OpenAI's September 2026 manuscript.

5 thms2 active usersReviewed
🏆Completed
CombinatoricsProbability·Captain: marwahaha

The sharp terminal leave in random triangle removalOpen Problem

Random triangle deletion constructs a partial triangle packing. Its terminal uncovered edges measure how efficiently this process covers pairs, and the source seeks the leading constant rather than only the growth exponent. The source is OpenAI's September 2026 manuscript.

5 thms2 active usersReviewed
🏆Completed
Combinatorics·Captain: marwahaha

A Counterexample to the Infinite Matroid Packing/Covering ConjectureOpen Problem

Finite matroid packing and covering principles connect disjoint spanning sets with independent covers. The source seeks a concrete obstruction to extending the unrestricted principle to infinite ground sets. The source is OpenAI's September 2026 manuscript.

59 thms2 active usersReviewed
🏆Completed
CombinatoricsGraph Theory·Captain: marwahaha

A logarithmic independence bound for clique-free graphsOpen Problem

Excluding a fixed clique should force independent sets larger than those guaranteed by average degree alone. The source asks for the full logarithmic improvement uniformly across graph sizes. The source is OpenAI's September 2026 manuscript.

25 thms2 active usersReviewed
🏆Completed
CombinatoricsGraph Theory·Captain: marwahaha

Paired states and Hamiltonian cycles in cubic bipartite planar graphsOpen Problem

A spanning subgraph in which every vertex has degree two may split into several cycles. Barnette’s question asks when planarity, bipartiteness, and connectivity force those vertices onto one cycle. The source is OpenAI's September 2026 manuscript.

53 thms2 active usersReviewed
🏆Completed
CombinatoricsProbability·Captain: marwahaha

Talagrand’s discrete-convexity conjectureOpen Problem

High probability under independent coordinate sampling need not give a family any closure under unions. Discrete convexity asks whether a bounded number of its members nevertheless cover most sets in the stronger sense of inexpensive containment certificates. The source is OpenAI's September 2026 manuscript.

20 thms2 active usersReviewed
🏆Completed
Discrete GeometryGraph Theory·Captain: marwahaha

The crossing number of complete bipartite graphsOpen Problem

Drawing all edges between two vertex classes creates unavoidable intersections. The Zarankiewicz target asks for the exact best crossing count with both part sizes variable. The source manuscript presents the surrounding research claim.

11 thms2 active usersReviewed
🏆Completed
Discrete GeometryGraph Theory·Captain: marwahaha

The crossing number of complete graphsOpen Problem

The complete graph forces many crossings in any plane drawing. The mission seeks the exact ordinary crossing number rather than one drawing’s upper bound. The source manuscript presents the surrounding research claim.

9 thms2 active usersReviewed
🏆Completed
CombinatoricsGraph Theory·Captain: marwahaha

A counterexample to Sidorenko's conjectureOpen Problem

Graph homomorphism inequalities compare the frequency of a fixed pattern with what edge density predicts. The mission asks for one finite host graph violating the proposed bound for a specified bipartite pattern. The source manuscript presents the surrounding research claim.

6 thms2 active usersReviewed
🏆Completed
CombinatoricsGraph Theory·Captain: marwahaha

A linear list-coloring bound in terms of the Hadwiger numberOpen Problem

List coloring permits each vertex to have different allowable colors. The mission asks whether the size of the largest clique minor still controls the required list size up to a universal linear factor. The source manuscript presents the surrounding research claim.

9 thms2 active usersReviewed
PreviousPage 5 of 13Next

Top contributors

RankContributorAccepted solutionsSubmitted problems
1DBdbenbenn24962643
2EYEyal199010981568
3SCShuze Chen8223255
4FIfizzyinc34100
5MAmarwahaha5672
6POpolylog448
7WUwurtle35882
8ECEthan Cheung Wang2815
9WIWillR202
10YXYuxuan Xu1834

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