Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Collections

OAI Math

All of openAI's results.

https://github.com/openai/math

317 missions

Missions

26–50 of 317
Open0Completed317All317
🏆Completed
Geometry & TopologyGroup Theory·Captain: marwahaha

A torsion-free hyperbolic group that is not residually finiteOpen Problem

Residual finiteness means that finite quotients can distinguish every nonidentity group element. The source asks whether coarse negative curvature forces this separation property even without torsion. The source is OpenAI's September 2026 manuscript.

39 thms3 active usersReviewed
🏆Completed
Mathematical LogicNumber Theory·Captain: marwahaha

Single-fold Diophantine representationsOpen Problem

A Diophantine representation translates membership in a computably enumerable set into solvability of one polynomial equation. The source asks whether the entire auxiliary witness can always be made unique. The source is OpenAI's September 2026 manuscript.

48 thms3 active usersReviewed
🏆Completed
ProbabilityRepresentation Theory·Captain: marwahaha

Signed tensor densities and diagram budgets for the Thorp shuffleOpen Problem

Signed tensor components separate different sources of permutation symmetry. The source uses their diagram entropies to budget high moments of the Thorp sweep. The source is OpenAI's September 2026 manuscript.

17 thms3 active usersReviewed
🏆Completed
CombinatoricsRepresentation Theory·Captain: marwahaha

Compatibility entropy and the spectrum of a Thorp sweepOpen Problem

Compatibility of independently chosen row and column permutations controls how two families of local symmetries overlap. The source connects a weighted compatibility estimate to Thorp spectral bounds. The source is OpenAI's September 2026 manuscript.

31 thms3 active usersReviewed
🏆Completed
CombinatoricsProbability·Captain: marwahaha

Polynomial vacuum representations and bridge mass for honeycomb walksOpen Problem

Critical self-avoiding walks have weights balanced between exponential path growth and decay. The source studies bridge-length scaling; the available target establishes summability of the bridge sums used to define these quantities. The source is OpenAI's September 2026 manuscript.

43 thms3 active usersReviewed
🏆Completed
ProbabilityStochastic Systems·Captain: marwahaha

Directional transience implies ballisticityOpen Problem

Escape to infinity can be arbitrarily slow for a general stochastic process. The source asks whether independent uniformly elliptic lattice environments force a positive deterministic speed whenever a direction is transient. The source is OpenAI's September 2026 manuscript.

20 thms3 active usersReviewed
🏆Completed
CombinatoricsProbability·Captain: marwahaha

Integral and fractional expectation thresholds are equivalentOpen Problem

An increasing property of a random set can be certified by small subsets. Fractional certificates allow weight to be spread across many subsets, so comparing them with ordinary certificates measures the cost of removing this relaxation. The source is OpenAI's September 2026 manuscript.

26 thms3 active usersReviewed
🏆Completed
CombinatoricsGraph Theory·Captain: marwahaha

A proof of Seymour’s second-neighborhood conjectureOpen Problem

An oriented graph may have very uneven outdegrees, yet the second-neighborhood conjecture asks for one vertex whose new two-step reach is at least its immediate outdegree. The source manuscript presents the surrounding research claim.

45 thms3 active usersReviewed
🏆Completed
Graph TheoryMarkov Chain·Captain: marwahaha

Polynomial mixing of the switch chain for every graphical degree sequenceOpen Problem

Sampling a graph with a prescribed degree vector requires moving among realizations without changing degrees. The switch chain performs local edge replacements and asks whether these suffice for rapid global mixing. The source manuscript presents the surrounding research claim.

9 thms3 active usersReviewed
🏆Completed
Algorithmic Game TheoryTheoretical Computer Science·Captain: marwahaha

Randomized quasipolynomial-time mean-payoff gamesOpen Problem

Mean-payoff games ask which starting positions allow a player to guarantee a nonnegative long-run average reward. Binary-encoded weights make the bit cost of solving the complete winning set a central part of the question. The source manuscript presents the surrounding research claim.

6 thms3 active usersReviewed
🏆Completed
AnalysisDiscrete Geometry·Captain: marwahaha

Slope-field perturbations of the two-cylinder coveringOpen Problem

A slope-field perturbation of a two-cylinder cover trades a reduction in projected area against the extra overlap needed to maintain coverage. The slope-field manuscript studies when the net cost becomes strictly smaller. The companion radial-sweep manuscript establishes finite triangular approximation with arbitrary tagged equal subdivisions. Both…

32 thms3 active usersReviewed
🏆Completed
AnalysisDiscrete Geometry·Captain: marwahaha

Finite cylinder approximation of ruled setsOpen Problem

A continuously varying family of line segments suggests a low-cost cylinder cover, but a finite approximation must control both gaps and accumulated base area. The source manuscript presents the surrounding research claim.

32 thms3 active usersReviewed
🏆Completed
Discrete Geometry·Captain: marwahaha

Finite angular cylinder covers below the half-area boundOpen Problem

Cylinder covers measure coverage cost by perpendicular base area. For a regular tetrahedron, the familiar half-minimum-shadow threshold is tested by a finite family of tilted triangular cylinders. The source manuscript presents the surrounding research claim.

24 thms3 active usersReviewed
🏆Completed
AnalysisTheoretical Computer Science·Captain: marwahaha

Tree Constructions for the l1 Distortion of Binary Edit DistanceOpen Problem

Embedding edit distance into ℓ₁ would permit algorithms and geometric tools for that normed space. Distortion lower bounds quantify the loss any such representation must incur. The source manuscript presents the surrounding research claim.

70 thms3 active usersReviewed
🏆Completed
AnalysisOptimal Transport·Captain: wurtle

Sharp One-Third Stability of Brenier MapsResearch Paper

Given a source probability measure ρ\rhoρ and a target μ\muμ on Rd\mathbb R^dRd, Brenier's theorem (Brenier 1991) says that when ρ\rhoρ is absolutely continuous there is a unique map TμT_\muTμ​ pushing ρ\rhoρ to μ\muμ that minimizes the quadratic cost ∫∣x−T(x)∣2 dρ\int|x-T(x)|^2\,d\rho∫∣x−T(x)∣2dρ, and that it is the gradient of a convex function. Fixing ρ\rhoρ, the assignment μ↦Tμ\mu\mapsto T_\muμ↦Tμ​ embeds…

5 thms3 active usersReviewed
🏆Completed
AnalysisMathematical PhysicsPartial Differential Equations·Captain: wurtle

Nonuniqueness for the periodic hard-sphere Boltzmann equationResearch Paper

The Boltzmann equation describes a dilute gas through a density F(t,x,v)F(t,x,v)F(t,x,v) of particles at position xxx with velocity vvv, evolving by free transport and binary collisions. For hard spheres, the collision rate is proportional to the normal relative speed. In 1989 DiPerna and Lions constructed global renormalized solutions for all initial data with finite mass,…

8 thms3 active usersReviewed
🏆Completed
Discrete GeometryFunctional Analysis·Captain: wurtle

Counterexamples to the duality conjecture for metric entropyResearch Paper

Covering numbers measure the size of a set at a given scale: N(A,B)N(A,B)N(A,B) is the least number of translates of BBB needed to cover AAA. Their logarithms, the metric entropy, appear across approximation theory, operator theory (entropy numbers of compact operators), probability (Dudley's bound) and learning theory. A basic question in asymptotic geometric analysis is…

40 thms3 active usersReviewed
🏆Completed
AnalysisFunctional Analysis·Captain: wurtle

Fixed Points of Nonexpansive Maps in Reflexive Banach SpacesResearch Paper

A map FFF is nonexpansive if ∥F(a)−F(b)∥≤∥a−b∥\|F(a)-F(b)\|\le\|a-b\|∥F(a)−F(b)∥≤∥a−b∥. Unlike strict contractions, nonexpansive maps need not have fixed points: on a bounded set, existence depends on the geometry of the norm. A Banach space has the fixed point property (FPP) if every nonexpansive self-map of every nonempty closed bounded convex subset has a fixed point. Since the mid-1960s,…

78 thms3 active usersReviewed
🏆Completed
AnalysisFunctional AnalysisLinear algebra·Captain: wurtle

The complete Crouzeix theorem: optimal similarity and a common positive boundary representationResearch Paper

For a square matrix AAA, the spectrum alone does not control the size of p(A)p(A)p(A): a nonzero nilpotent matrix has spectrum {0}\{0\}{0} yet ∥A∥>0\|A\|>0∥A∥>0. The numerical range W(A)={u∗Au: ∥u∥=1}W(A)=\{u^*Au:\ \|u\|=1\}W(A)={u∗Au: ∥u∥=1} is a compact convex set containing the spectrum (Toeplitz–Hausdorff), and it does retain enough information. Crouzeix's conjecture (2004) asserts that for every polynomial ppp,

10 thms3 active usersReviewed
🏆Completed
AnalysisFunctional AnalysisLinear algebra·Captain: wurtle

A direct proof of the complete Crouzeix inequalityResearch Paper

For a square matrix AAA, the spectrum alone does not control the size of p(A)p(A)p(A): a nonzero nilpotent matrix has spectrum {0}\{0\}{0} yet ∥A∥>0\|A\|>0∥A∥>0. The numerical range W(A)={u∗Au: ∥u∥=1}W(A)=\{u^*Au:\ \|u\|=1\}W(A)={u∗Au: ∥u∥=1} is a compact convex set containing the spectrum (Toeplitz–Hausdorff), and it does retain enough information. Crouzeix's conjecture (2004) asserts that for every polynomial ppp,

47 thms3 active usersReviewed
🏆Completed
Functional Analysis·Captain: wurtle

Weak pure infiniteness and O-infinity absorptionResearch Paper

Purely infinite C∗C^*C∗-algebras are the infinite counterpart of the finite, tracial algebras: every positive element can absorb copies of itself. In the simple case they are the Kirchberg algebras, classified by K-theory. For non-simple algebras, Kirchberg and Rørdam introduced three versions of pure infiniteness (weak, ordinary, strong) and showed that the…

46 thms3 active usersReviewed
🏆Completed
AnalysisFunctional Analysis·Captain: wurtle

Backward intertwiners and a transitive commutantResearch Paper

A closed subspace M\mathcal MM of a Hilbert space HHH is hyperinvariant for a bounded operator SSS if AM⊆MA\mathcal M\subseteq\mathcal MAM⊆M for every operator AAA commuting with SSS. The hyperinvariant subspace problem asks whether every bounded nonscalar operator on an infinite-dimensional separable complex Hilbert space has a nonzero proper closed hyperinvariant subspace.…

29 thms3 active usersReviewed
🏆Completed
Information TheoryMathematical PhysicsQuantum Information·Captain: wurtle

The entropy photon-number inequalityResearch Paper

Shannon's entropy power inequality bounds the entropy of a sum of independent random vectors below by the entropies of the summands; it is a basic tool for classical Gaussian channel capacities. In optical communication, addition is replaced by passive mixing of bosonic modes at a beam splitter. Guha, Erkmen and Shapiro conjectured the sharp bosonic…

61 thms3 active usersReviewed
🏆Completed
AlgebraGroup Theory·Captain: wurtle

The Kervaire theorem for groupsResearch Paper

Given a group AAA, adjoin one new generator ttt and impose one relation w=1w=1w=1, where www is a word in ttt and elements of AAA. Can the result collapse to the trivial group when AAA is nontrivial? The Kervaire conjecture says no. It arose from Kervaire's 1965 characterization of high-dimensional knot groups, which involves groups normally generated by a single element,…

48 thms3 active usersReviewed
🏆Completed
Mathematical LogicModel Theory·Captain: wurtle

A CH obstruction to a prescribed categoricity thresholdResearch Paper

A class of structures is categorical in a cardinal λ\lambdaλ if it has exactly one model of size λ\lambdaλ up to isomorphism. Morley's theorem (1965) says that a complete first-order theory in a countable language categorical in one uncountable cardinal is categorical in all of them. Abstract elementary classes (AECs), introduced by Shelah in the 1970s,…

26 thms3 active usersReviewed
PreviousPage 2 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