OpenAI Math Digest

Accessible guides to the mathematical result families in OpenAI’s math collection. Each article explains the question, its history, previous partial results, the new claims, and the ideas behind them. The intended reader knows undergraduate mathematics but need not specialize in the subject.

AI declaration

These digests are written by GPT-6-Astra. They have not been verified or checked by a human. Mathematical results are presented as claimed in the cited manuscripts. The digest process does not verify proofs or certify the correctness of results.

AI-generated explanations may contain errors. Readers can consult the linked manuscripts for the original statements and arguments. Importance scores reflect editorial judgments about the significance of the stated claims.

Family index

Family numbers follow the source catalogue. Open a category to browse its digests. Each list starts in index order; choose importance to see higher scores first, with equal scores kept in index order.

373 families digested · 17 categories

Number theory 31 families
Number theory digests
IndexTitleImportance
001Milne’s rationality conjecture and geometry after reduction4/5
002The full BSD formula from a small Selmer group5/5
003A fixed zero-free region for zeta and Dirichlet L-functions5/5
004Hilbert’s tenth problem over the rationals: a claimed limit of algorithms5/5
005Catalan’s constant: a determinant approach to irrationality4/5
006Goldfeld’s conjecture: half the twists have rank zero, half rank one5/5
007Two-point Chowla: do neighboring integers forget prime-factor parity?5/5
008Deligne–Drinfeld: all associator symmetries from odd-weight generators4/5
009Reconstructing a function field from small arithmetic invariants4/5
010Modularity at two: geometric representations and completed Hecke families5/5
011Factoring one less than a prime: a Poisson–Dirichlet law4/5
012Largest prime factors of consecutive integers: a joint Dickman law4/5
013Inverse Goldbach: why the primes cannot split into a sumset4/5
014Arthur parameters and geometric Langlands over finite fields5/5
015How arithmetic torus packets spread through spaces of lattices4/5
016Zilber–Pink: when too many special intersections force structure5/5
017How well can fractions approximate pi?4/5
018Margulis–Platonov: local origins of abstract normal subgroups4/5
019Recovering p-adic points from fundamental-group sections5/5
020Squarefree quartic values and the large-prime obstacle4/5
021Jacobsthal’s function: how long can primes cover an interval?3/5
022Rational approximation with any fixed shift4/5
023The small positive bias in cubic Gauss sums3/5
024Counting distinct values of Euler’s totient function3/5
025Short Egyptian fractions and doubly exponential families3/5
026Large prime gaps occur with positive frequency3/5
027Integral points throughout character varieties of curves4/5
028The Gaussian moat: why bounded steps cannot go forever4/5
029Artin’s primitive roots for every admissible integer base5/5
030Modularity for every elliptic curve over an imaginary quadratic field5/5
031Uchida’s conjecture: recovering field embeddings from Galois maps4/5
Algebraic and complex geometry 36 families
Algebraic and complex geometry digests
IndexTitleImportance
032Hodge classes, complex multiplication, and the search for algebraic cycles5/5
033Adding the complexity of a base and its fibers5/5
034From nef canonical bundles to maps: abundance and uniform degrees5/5
035When one numerical direction becomes a fibration in positive characteristic4/5
036Numerical semiampleness and the existence of minimal models5/5
037The ordinary double point as the largest singular volume4/5
038Fujita freeness: how much positivity removes every base point?5/5
039Nagata’s conjecture and the cost of imposing many multiple points5/5
040Family 040 — Bloch’s conjecture: when points on a surface have no hidden differences5/5
041Family 041 — Hyperkähler fibrations: turning a boundary class into a map5/5
042Family 042 — Oka K3 surfaces: extending holomorphic maps with freedom4/5
043Family 043 — P = W: two ways to organize the same cohomology4/5
044Family 044 — Hikita’s conjecture: cohomology hidden inside a fixed scheme4/5
046Family 046 — Shafarevich’s conjecture: two claimed failures of holomorphic convexity5/5
047Family 047 — Affine cancellation: when adding one coordinate hides the difference5/5
048Family 048 — Free vector fields on a singular surface5/5
049Family 049 — Affine space embedded in a way coordinates cannot straighten4/5
050Family 050 — Ample bundles without Griffiths-positive metrics on the quadric4/5
051Family 051 — Hyperbolicity forces an ample canonical bundle5/5
052Family 052 — From a split tangent bundle to a product of manifolds4/5
053Family 053 — A relation beyond Pixton’s original system4/5
054Family 054 — K3 structures without rationality for cubic fourfolds5/5
055Family 055 — Stability at the Gepner point and at large volume5/5
056Family 056 — Why four-dimensional minimal model programs should stop5/5
057Family 057 — Special geometry and almost commutative fundamental groups5/5
058Family 058 — Universal covers with a finite algebraic description5/5
059Family 059 — The same local topology with different multiplicities5/5
060Family 060 — Finding a spherical shell inside every class VII surface5/5
062Family 062 — Contact geometry forces a homogeneous model5/5
063Family 063 — The sharp tradeoff between Fano curves and divisor directions4/5
064Family 064 — Constant Milnor number and an unchanged surface singularity5/5
065Virasoro constraints for projective bundles and complete intersections5/5
066Bounded klt complements and uniformly mild hypersurfaces5/5
067Nef tangent bundles force homogeneity in dimension six4/5
068From semipositive anticanonical curvature to algebraic sections5/5
069Quantum geometric Langlands at every irrational level5/5
Real and complex analysis 16 families
Convex and metric geometry 15 families
Theoretical computer science 41 families
Theoretical computer science digests
IndexTitleImportance
102The Unique Games Conjecture and optimal approximation thresholds5/5
103Derandomization of logarithmic space — L = RL = BPL5/5
104Quasipolynomial algorithms for mean-payoff, stochastic and parity games4/5
105The 2-to-1 Games Conjecture with perfect completeness3/5
106Hardness of coloring three-colorable graphs4/5
107Matrix multiplication with exponent at most nine quarters5/5
108A cubic permanent–determinant lower bound4/5
109Integer multiplication below n log n5/5
110Optimal-order randomized k-server on arbitrary metrics4/5
111One-sample matroid prophet inequalities against an almighty adversary3/5
112Beyond the square-root exponent for depth-three circuits4/5
113Approximate counting and entropy of perfect matchings4/5
114Approximate counting of common integer polymatroid bases3/5
115Sampling and counting contingency tables with arbitrary margins3/5
116Uniform identity testing for noncommutative formulas4/5
117Uniform sparsest cut hardness and semidefinite gaps4/5
118Unbounded bin-packing gaps and the modified integer round-up conjecture3/5
119The Courtade–Kumar and Hellinger conjectures4/5
120Almost-linear-time exact matching in general graphs4/5
121Almost-linear expected-time approximation of edit distance4/5
122Trace reconstruction: how many incomplete copies reveal a string?4/5
124Three-machine scheduling: exact optimization with precedence constraints4/5
125Metric k-median: approaching the sharp approximation threshold4/5
126Perfect matching: why exact semidefinite descriptions must be large4/5
127Polynomial threshold functions: how often can one flipped bit change a decision?3/5
128Shortest common superstring: assembling fragments within a factor of two3/5
129Two-way finite automata: exponential costs of determinism and complement3/5
130Exact Fourier transforms below n log n: the role of the arithmetic model4/5
131Random graphs with prescribed degrees: a universal switch-chain mixing bound3/5
132Sensitivity versus block sensitivity: beyond every quadratic bound3/5
133Weisfeiler–Leman refinement: the cost of deciding what it can distinguish4/5
134Generalized star height: three nested repetitions for every regular language4/5
135Iterated matrix multiplication: the gate cost of five homogeneous layers2/5
136PCP for PPAD: preserving a search problem despite many failed constraints5/5
137One-tape computation: trading unrestricted time for two-fifths-power space2/5
138Subset Sum: a smaller time exponent and a separate low-memory algorithm4/5
139Log-concave sampling: a zero dimension exponent for exact oracle queries2/5
140Noiseless Gaussian regression: the sample price of finite memory and precision1/5
141Exact real feasibility through a fixed number of counting layers5/5
142Factoring polynomials over prime fields without random choices5/5
378Counting solutions faster than the Exponential Time Hypothesis allows5/5
Dynamical systems and ergodic theory 12 families
Combinatorics 37 families
Combinatorics digests
IndexTitleImportance
155A translational tile that cannot repeat periodically in three dimensions4/5
156Why ten smaller pieces may not cover a set in nine dimensions4/5
157Graph coloring and clique minors after the coefficient-one conjectures5/5
158Why five colors would not suffice for the Euclidean plane4/5
159Arithmetic progressions from a divergent reciprocal sum5/5
160How long can a coloring avoid a long arithmetic progression4/5
161When a bipartite pattern is rarer than the random-graph benchmark5/5
162Intersecting hypergraphs that need one more covering vertex5/5
164One color for every finite subset sum and product5/5
165Exact crossing counts for complete and complete bipartite graphs5/5
166How many different distances must occur in higher dimensions5/5
167Distances from one point and limits on repeated unit distances4/5
168Can an unlabeled order determine a Kazhdan–Lusztig polynomial5/5
169Positive elementary coefficients for refined graph colorings4/5
170The logarithmic scale of off-diagonal Ramsey numbers4/5
171A monochromatic hypercube in a network only a constant times larger5/5
172Which finite shapes must appear in one color5/5
173Finding a vertex whose second neighborhood is at least as large as its first5/5
174A spanning tree that stays thin across every cut5/5
175Fractional covers, discrete convexity, and random-graph thresholds5/5
176Predicting graph appearance from the expected counts of all subgraphs5/5
177Sparse higher-dimensional spaces with no hidden parity obstructions5/5
178Constructing exact nonbipartite Ramanujan graphs at prescribed sizes4/5
179Why a perfectly orthogonal cyclic sign pattern would stop at length four4/5
180One cycle through every vertex of a cubic bipartite polyhedron4/5
181Partitioning every graph into only linearly many cycles and edges4/5
182A power saving for sets avoiding polynomial differences5/5
183Fewer balanced lines through a planar point set4/5
184A full logarithmic gain from excluding a fixed clique4/5
185Where unrestricted infinite matroid packing and covering break down4/5
186How narrow must a symmetric random-graph transition be4/5
187Making Snaky in at most twenty-one moves1/5
188The precise residue of random triangle removal3/5
189The exact threshold for a red cycle or a blue clique3/5
190Why rare ordered binary patterns can be hard to remove2/5
191Keeping every triangle larger than the predicted scale4/5
192A Boolean function can beat the square-root degree bound by any factor3/5
Algebra 18 families
Probability and statistical mechanics 29 families
Probability and statistical mechanics digests
IndexTitleImportance
211When a random surface becomes a tree and how a particle moves on it5/5
212The shape of random travel times and the absence of infinite shortest lines4/5
213Why an infinite percolation cluster would disappear exactly at criticality5/5
214When infinite percolation clusters coexist4/5
215How two-dimensional spins acquire a mass5/5
216The XY transition: a quarter-power law, logarithms, and an exponential length scale5/5
217The one-sixth fluctuation scale of the SK spin glass5/5
218Why weakly perturbed Ising models would keep the same large-scale geometry5/5
219Gaussian-matrix statistics inside sparse random graphs4/5
220When escape through a random environment forces a definite direction and speed5/5
221A hierarchical formula for the free energy of diluted spin glasses4/5
222Random perceptrons: free energy, correlated patterns, and microscopic jamming5/5
223Random-cluster interfaces: conformal shapes, natural length, and perturbations5/5
224Voronoi percolation: Cardy crossings and the near-critical window5/5
225Six-vertex heights and the Gaussian free field across the balanced critical range5/5
226Double-dimer loops: from topological records to nested CLE₄ curves4/5
227The dynamical phase transition in the Sherrington–Kirkpatrick model4/5
228Engineering a temperature transition with radial pair interactions4/5
229When noisy descendants remember their ancestor: Potts reconstruction thresholds4/5
230Measuring SLE curves beyond their Hausdorff dimension4/5
231Building the free uniform spanning forest from independent randomness4/5
232Lipschitz random surfaces: Gaussian fields and a tuned SLE₄ interface5/5
233The joint scaling limit of critical Ashkin–Teller currents4/5
234All-temperature pressure for orthogonally invariant Ising spin glasses4/5
235Random SAT thresholds, fluctuations, and computability4/5
236The factor-of-IID threshold for the free Ising model on regular trees4/5
237The 3/4 size exponent for honeycomb self-avoiding walks5/5
238Optimal-order mixing of the Thorp shuffle4/5
239Sharp singularity rates for symmetric random sign matrices4/5
Mathematical logic 6 families
Group theory 14 families
Mathematical physics 25 families
Mathematical physics digests
IndexTitleImportance
260How much mass does a black hole require? Penrose inequalities beyond time symmetry5/5
261When disorder traps a quantum particle—and when extended states survive5/5
262The sharp cost of binding: Lieb–Thirring inequalities and their equality cases5/5
263The outer electrons of large atoms: ionization bounds and universal scales5/5
264Predictability beyond a rotating black hole: three levels of strong cosmic censorship5/5
265Why a gapped quantum sheet should have only boundary-sized entanglement5/5
266Three complementary measurements in dimension six—and why a fourth is excluded4/5
267Condensation in an interacting Bose gas—and the particles left outside it5/5
268The spin-one Haldane gap: rings, boundary fields and a topological index5/5
269The Laughlin gap: a quantum Hall state that resists weak disorder5/5
270Bound states in BFSS matrix mechanics: one at zero, infinitely many above it5/5
271How a quantum ferromagnet orders: Bloch’s law and the magnetization sphere5/5
272Entanglement without a secret key5/5
273How much uncertainty survives when two quantum light beams mix?5/5
274Why shallow quantum circuits cannot compute parity5/5
275The computational difficulty of Coulomb energy in the full continuum5/5
276The classical capacity of a relaxing qubit4/5
277Repeating an entangled game: why unusually many wins become exponentially rare4/5
278A molecular density that no ordinary Kohn–Sham ensemble reproduces5/5
279Quantum factoring with certainty and a fixed finite gate set4/5
280Two languages for conformal field theory, with matching particles and fusion5/5
281QAOA reaches the spin-glass optimum—when system size goes first4/5
282When scale symmetry becomes local conformal symmetry in four dimensions5/5
283A Boolean oracle for every quantum unitary4/5
284How large can a quantum query advantage be? The quartic boundary4/5
Operator algebras 19 families
Operator algebras digests
IndexTitleImportance
285When geometry and operator indices part company: three group-algebra counterexamples5/5
286Recovering arithmetic groups from their operator algebras5/5
287Can an operator algebra forget how many free generators it had?5/5
288Can every bounded representation be made to respect adjoints?5/5
289When nearby operator algebras are the same—and when they are not5/5
290Simpler subalgebras that preserve every modular commutation constraint5/5
291Three forms of regularity become one: comparison, dimension and Jiang–Su absorption5/5
292A concrete algebra that cannot fit inside any nuclear norm ultrapower5/5
293Operators with invariant subspaces but no hyperinvariant ones5/5
294A quasitrace that cannot be a trace—and finite algebras with an infinite tensor product5/5
295Every bounded cocycle has a primitive: the Kadison–Ringrose cohomology claim5/5
296One operator can generate a whole von Neumann algebra5/5
297One irreducible representation does not determine the compact operators4/5
298Two free entropies disagree even when both are finite5/5
299No scalar shadows in central sequences: a criterion for Jiang–Su stability5/5
300Paving every maximal abelian subalgebra with a uniform number of pieces5/5
301When every extended trace determines a stabilized operator algebra5/5
302Half the mean dimension: an exact bridge from dynamics to operator comparison5/5
303From local infinite size to Cuntz-algebra absorption5/5
Topology 18 families
Functional analysis 11 families
Differential geometry 29 families
Differential geometry digests
IndexTitleImportance
333Every closed surface metric in four-dimensional Euclidean space5/5
334A smooth surface metric that cannot fit locally in three-space5/5
335How negative scalar curvature pays for topological complexity5/5
336Positive spectral curvature and a controlled loss of two dimensions5/5
337Sharp isoperimetry and fillings in nonpositive curvature5/5
338Positive bisectional curvature and global complex coordinates5/5
339When geodesic entropy forces local symmetry5/5
340An exact Lagrangian that cannot be untied by Hamiltonian motion5/5
341Deforming positive triples into hyperkähler geometry5/5
342From taming to compatibility in four dimensions5/5
343Two inequalities for packing symplectic balls5/5
344When every geodesic minimizes for the same distance5/5
345Infinitely many distinct closed geodesics on every sphere5/5
346How large can the singular set of a stationary surface be?5/5
347Which topological counts constrain Hamiltonian fixed points?5/5
348Einstein four-manifolds from positive curvature to a topological gap5/5
349The first minimal-hypersurface volume above an equator5/5
350Nodal size: a sharp surface bound and higher-dimensional failures5/5
351Can scalar curvature detect a Ricci-flow singularity?5/5
352A Calabi flow that becomes singular before reaching a canonical metric5/5
353When affine maximal graphs must be paraboloids—and when they need not be5/5
354Balls, tubes and slabs: the least-area shapes in a periodic cube5/5
355Does every magnification see the same mean-curvature singularity?5/5
356Recognizing Alexandrov curvature without a smooth metric5/5
357From a Euclidean tangent to coordinates with controlled distortion5/5
358Geodesics without focusing on a manifold that forbids nonpositive curvature5/5
359Negative Kähler curvature does not guarantee bounded holomorphic coordinates5/5
360Weak transport curvature, convex geodesic domains and continuous optimal maps5/5
361More polynomial-growth harmonic functions than Euclidean space5/5
Partial differential equations 16 families

How to read the ratings

Importance measures relative mathematical significance across the collection: 1 is a focused contribution, 2 a useful specialized advance, 3 a substantial advance within a field, 4 a major advance with broad consequences or methods, and 5 an exceptional advance on a central problem. Ratings use the full scale as coverage grows and may be recalibrated. Each digest explains its score.

An importance rating assesses the significance of the stated result if correct. A completed digest means its exposition is ready to read; it does not indicate expert verification.

Sources

The overview introduces the families, and the manuscript map links their papers. Articles cite fixed repository revisions and record when those sources were consulted. Any discussion of formalization or expert review is attributed to its source.

Essential definitions are included in each article, with optional background links for further reading.

Recent additions