Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Collections

OAI Math

All of openAI's results.

https://github.com/openai/math

317 completed missions

Missions

301–317 of 317
Open0Completed317All317
🏆Completed
Algebraic GeometryDifferential Geometry·Captain: wurtle

Integrability of split tangent bundles on rationally connected manifoldsResearch Paper

If a complex manifold is a product X1×X2X_1\times X_2X1​×X2​, its tangent bundle splits as the sum of the pulled-back tangent bundles of the factors, and each summand is integrable: the bracket of two local holomorphic vector fields tangent to a summand stays in that summand. Conversely, given a holomorphic decomposition TX=E1⊕E2T_X=E_1\oplus E_2TX​=E1​⊕E2​, one wants to know whether it…

5 thms2 active usersReviewed
🏆Completed
Algebraic GeometryDifferential Geometry·Captain: wurtle

Universal-cover splitting for compact Kähler manifoldsResearch Paper

If a complex manifold is a product Y1×Y2Y_1\times Y_2Y1​×Y2​, its holomorphic tangent bundle is the direct sum of the tangent bundles of the factors. The converse question asks when a given holomorphic decomposition TX=E1⊕E2T_X=E_1\oplus E_2TX​=E1​⊕E2​ of the tangent bundle of a compact manifold XXX comes from a product decomposition of its universal cover, with the product realizing the sp…

3 thms2 active usersReviewed
🏆Completed
AlgebraAlgebraic Geometry·Captain: wurtle

An explicit failure of complex affine-space cancellationResearch Paper

Zariski's cancellation problem asks whether affine space can be recognized from its cylinder: if a variety XXX satisfies X×A1≅An+1X\times\mathbb A^1\cong\mathbb A^{n+1}X×A1≅An+1, must X≅AnX\cong\mathbb A^nX≅An? Algebraically, for a finitely generated commutative C\mathbb CC-algebra AAA and an independent variable www,

41 thms2 active usersReviewed
🏆Completed
Algebraic Geometry·Captain: wurtle

Maximal Seshadri constants on arbitrary polarized surfacesResearch Paper

Seshadri constants measure the local positivity of a line bundle at a point or a configuration of points: how much of an ample class survives after blowing up the points and subtracting equal multiples of the exceptional curves. For rrr points on a surface with ample LLL, a dimension count gives the universal upper bound L2/r\sqrt{L^2/r}L2/r​. Nagata's 1959 conjecture,…

67 thms2 active usersReviewed
🏆Completed
Number Theory·Captain: wurtle

Positive lower density of large prime gapsResearch Paper

Let pnp_npn​ be the nnn-th prime and dn=pn+1−pnd_n=p_{n+1}-p_ndn​=pn+1​−pn​ the nnn-th gap. By the prime number theorem the average gap near ppp is about log⁡p\log plogp. A great deal is known about how large individual gaps can be, but much less about how often large gaps occur. A natural question is whether, for each fixed CCC, a positive proportion of all gaps exceed Clog⁡pnC\log p_nClogpn​. Erdős and Prachar…

9 thms2 active usersReviewed
🏆Completed
Number Theory·Captain: wurtle

An asymptotic formula for the number of totientsResearch Paper

Euler's totient φ(n)\varphi(n)φ(n) counts the integers in {1,…,n}\{1,\dots,n\}{1,…,n} coprime to nnn. Many integers share a totient, and most integers are not totients at all, so counting the distinct values of φ\varphiφ is much harder than counting integers with a given factorization. Let

13 thms2 active usersReviewed
🏆Completed
Number Theory·Captain: wurtle

A quadratic bound for Jacobsthal's functionResearch Paper

For a positive integer nnn, Jacobsthal's function j(n)j(n)j(n) is the least mmm such that every run of mmm consecutive integers contains an integer coprime to nnn. Equivalently, j(n)−1j(n)-1j(n)−1 is the longest interval that can be covered by choosing one residue class modulo each prime divisor of nnn (the classes 0 mod p0\bmod p0modp shifted by the interval's start). Its maximum over integers…

17 thms2 active usersReviewed
🏆Completed
Number Theory·Captain: wurtle

Squarefree values of quartics and power-free values of polynomialsResearch Paper

An integer aaa is kkk-power-free if no prime power pkp^kpk divides it (zero is never kkk-power-free). For a fixed integer polynomial fff one expects f(n)f(n)f(n) to be kkk-power-free for a positive proportion of integers nnn, given by an Euler product of local densities, as soon as no prime kkkth power divides every value of fff. The heuristic is a sieve: discard the nnn with …

9 thms2 active usersReviewed
🏆Completed
CombinatoricsNumber Theory·Captain: wurtle

The additive indecomposability of the primesResearch Paper

Goldbach-type problems ask which sets are sumsets of primes. The inverse Goldbach problem, due to Ostmann (1956), reverses the question: can the set of primes itself, up to finitely many changes, be written as a sumset A+B={a+b:a∈A, b∈B}A+B=\{a+b:a\in A,\ b\in B\}A+B={a+b:a∈A, b∈B} with both AAA and BBB having at least two elements? Ostmann conjectured that it cannot: the primes are asymptotically…

25 thms2 active usersReviewed
🏆Completed
Number Theory·Captain: wurtle

Ordinary two-point correlations of multiplicative functionsResearch Paper

Let Ω(n)\Omega(n)Ω(n) count the prime factors of nnn with multiplicity and let λ(n)=(−1)Ω(n)\lambda(n)=(-1)^{\Omega(n)}λ(n)=(−1)Ω(n) be the Liouville function. Chowla's conjecture (1965) predicts that λ\lambdaλ behaves like a random sign sequence: its correlations along any fixed collection of distinct shifts have average tending to zero. The two-point case asks whether nnn and n+hn+hn+h have the same…

17 thms2 active usersReviewed
🏆Completed
Number Theory·Captain: wurtle

Catalan’s constant is irrational — OpenAI Lean formalizationResearch Paper

Catalan's constant

5 thms2 active usersReviewed
🏆Completed
AnalysisNumber Theory·Captain: wurtle

The Quasi-Riemann Hypothesis: A Zero-Free Half-Plane Re(s) > 7/8Research Paper

The Riemann zeta function ζ(s)=∑n≥1n−s\zeta(s) = \sum_{n\ge1} n^{-s}ζ(s)=∑n≥1​n−s (ℜs>1\Re s > 1ℜs>1), continued meromorphically to C\mathbb{C}C, encodes the distribution of primes through its zeros. Riemann (1859) conjectured that all nontrivial zeros lie on ℜs=1/2\Re s = 1/2ℜs=1/2. Hadamard and de la Vallée Poussin (1896) proved there are no zeros on ℜs=1\Re s = 1ℜs=1, which gives the prime number theorem,…

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

Vanishing of higher bounded Hochschild cohomologyOpen Problem

Hochschild cohomology measures whether a cocycle equation admits a primitive. In an operator algebra the boundedness requirement is part of the mathematical problem. The pinned manuscript supplies the research context.

9 thms1 active userReviewed
🏆Completed
Functional Analysis·Captain: marwahaha

An isomorphism of the free group factorsOpen Problem

Group von Neumann algebras encode a free group's regular representation as an operator algebra. Whether the rank remains visible in that algebra is the motivating isomorphism problem. The pinned manuscript supplies the research context.

17 thms1 active userReviewed
🏆Completed
CombinatoricsGraph Theory·Captain: wurtle

A counterexample to Ryser's covering conjectureResearch Paper

A vertex cover of a hypergraph HHH is a set of vertices meeting every edge; the covering number τ(H)\tau(H)τ(H) is the minimum size of a cover, and the matching number ν(H)\nu(H)ν(H) is the maximum number of pairwise disjoint edges. In an rrr-partite rrr-uniform hypergraph the vertices are split into rrr parts and every edge contains exactly one vertex from each part. Ryser's…

6 thms1 active userReviewed
🏆Completed
Complexity TheoryOperations ResearchTheoretical Computer Science·Captain: wurtle

A Polynomial-Time Algorithm for Three-Machine Unit-Job SchedulingResearch Paper

A set of unit-length jobs with precedence constraints is to be run on a fixed number of identical machines so that all jobs finish as early as possible. For two machines this was solved in 1969–1972; for a number of machines given as part of the input the problem is NP-complete (Ullman, 1975). Whether the problem is polynomial-time solvable for three machine…

4 thms1 active userReviewed
🏆Completed
Theoretical Computer Science·Captain: marwahaha

OpenAI matrix multiplication: the 9/4 boundResearch Paper

Multiplying matrices is a basic operation whose asymptotic cost is measured by the number of scalar arithmetic operations needed as the matrix dimensions increase. The familiar entry-by-entry algorithm has cubic cost. The question addressed here is how small an exponent can describe exact multiplication of square matrices when algorithms may use more…

2 thms1 active userReviewed
PreviousPage 13 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