Compilation··29:10·Theoretical computer science

Every OpenAI Math Result, Part 2 of 4: PCP for PPAD, Birkhoff Conjecture and 82 More

Compilation · 29:10 · 14 October 2026Watch on YouTube →

Watch on YouTubeAbout the problem →

About this video

Part 2 of 4: 84 results from OpenAI's public mathematics catalogue, one per chapter, in the order people search for them. Each chapter names the problem, shows the real objects, and states what OpenAI claims; none of it is peer reviewed yet. Every result has its own page: gradientdamage.com

Chapters:
0:00 Weisfeiler–Leman Refinement
0:21 Depth-Five Lower Bounds
0:41 PCP for PPAD
1:02 One-Tape Turing Machines
1:22 Log-Concave Sampling
1:42 Memory-Sample Lower Bounds
2:03 Existential Theory of the Reals
2:24 Banach's Lebesgue Spectrum Problem
2:45 Rokhlin's Multiple Mixing Problem
3:06 Birkhoff Conjecture
3:28 Entropy-Rate Dimension Formula for Self-Similar Measures
3:50 Permanence Conjecture
4:10 Shub's Entropy Conjecture
4:30 Zero Entropy, No Smooth Model
4:51 Bernoulli Convolutions
5:11 Borsuk's Conjecture Fails in Dimension 9, OpenAI Claims
5:32 Sidorenko's Conjecture
5:53 Ryser's Conjecture Disproved?
6:13 Hindman's Finite Sums and Products Conjecture Solved
6:35 Erdős Unit Distance Problem
6:56 Combinatorial Invariance Conjecture
7:17 Shareshian–Wachs Conjecture
7:38 Seymour's Second Neighbourhood Conjecture
7:58 Talagrand's Expectation Threshold
8:19 Second Kahn–Kalai Conjecture
8:39 Bounded-Degree Coboundary Expanders in Every Dimension
8:59 Circulant Hadamard Conjecture
9:19 Halving Lines
9:40 Cycle–Clique Ramsey Numbers
10:01 Gopalan–Servedio Square-Root Degree Bound Disproved
10:23 Serre's Multiplicity Conjecture
10:45 Lech's Multiplicity Conjecture
11:06 Small Cohen–Macaulay Module Conjecture
11:26 Kaplansky Zero-Divisor Conjecture
11:47 Kaplansky Direct Finiteness
12:08 Finitistic Dimension Conjecture
12:28 Auslander–Reiten Conjecture
12:49 Eisenbud–Green–Harris Conjecture
13:09 Kurosh's Division Ring Problem
13:30 Alperin Weight Conjecture Proved, Block by Block
13:52 Donovan's Conjecture
14:13 Saxl's Conjecture
14:34 The ℓ¹-Bass Conjecture
14:55 Gersten's Conjecture
15:15 Foulkes' Conjecture, Sixth Case
15:35 No Bigeodesics in First-Passage Percolation
15:56 Benjamini–Schramm Conjecture
16:16 XY Model at the BKT Point
16:38 Sherrington–Kirkpatrick Spin Glass
16:59 Ising Model Universality
17:20 Random Walk in Random Environment
17:42 Mézard–Parisi Formula
18:03 Random-Cluster Interfaces
18:24 Voronoi Percolation
18:45 Six-Vertex Model
19:05 Tree Reconstruction Threshold
19:25 Lipschitz Heights
19:45 Critical Ashkin–Teller Model
20:06 Orthogonally Invariant Spin Glass
20:28 Factor-of-IID Ising Threshold on Trees
20:49 Shelah's Eventual Categoricity Conjecture
21:10 Single-Fold Diophantine Representations
21:31 Cannon's Conjecture
21:52 Finitely Presented Burnside Problem
22:12 Thompson's Group F
22:33 Eilenberg–Ganea Conjecture
22:53 The Boone–Higman Conjecture
23:13 A Hyperbolic Group That Is Not Residually Finite
23:35 Quasi-Isometric Rigidity, Polycyclic Groups
23:56 Gersten's Conjecture
24:17 Spacetime Penrose Inequality
24:39 Lieb–Thirring Inequality in 1D
25:00 The Ionization Conjecture
25:20 Strong Cosmic Censorship Near Kerr
25:41 2D Area Law from a Spectral Gap
26:03 Bose–Einstein Condensation
26:24 The Spin-One Haldane Gap
26:45 BFSS Matrix Model
27:05 The Entropy Photon-Number Inequality
27:25 QMA-Hardness of Coulomb Energy
27:46 Kohn–Sham Representability
28:07 QAOA Reaches the SK Optimum
28:29 Scale vs Conformal Symmetry in 4D Quantum Field Theory
28:49 Unitary Synthesis from a Boolean Oracle

The animations illustrate the results; they are not proofs.

Gradient Damage: mathematics you can see, equations you can hear.
youtube.com/@gradientdamage

Chapters

One problem per chapter. Each name links to the result's own page, each time to that moment on YouTube.

  1. Weisfeiler–Leman Refinement Theoretical computer science
  2. Depth-Five Lower Bounds Theoretical computer science
  3. PCP for PPAD Theoretical computer science
  4. One-Tape Turing Machines Theoretical computer science
  5. Log-Concave Sampling Theoretical computer science
  6. Memory-Sample Lower Bounds Theoretical computer science
  7. Existential Theory of the Reals Theoretical computer science
  8. Banach's Lebesgue Spectrum Problem Dynamical systems and ergodic theory
  9. Rokhlin's Multiple Mixing Problem Dynamical systems and ergodic theory
  10. Birkhoff Conjecture Dynamical systems and ergodic theory
  11. Entropy-Rate Dimension Formula for Self-Similar Measures Dynamical systems and ergodic theory
  12. Permanence Conjecture Dynamical systems and ergodic theory
  13. Shub's Entropy Conjecture Dynamical systems and ergodic theory
  14. Zero Entropy, No Smooth Model Dynamical systems and ergodic theory
  15. Bernoulli Convolutions Dynamical systems and ergodic theory
  16. Borsuk's Conjecture Fails in Dimension 9, OpenAI Claims Combinatorics
  17. Sidorenko's Conjecture Combinatorics
  18. Ryser's Conjecture Disproved? Combinatorics
  19. Hindman's Finite Sums and Products Conjecture Solved Combinatorics
  20. Erdős Unit Distance Problem Combinatorics
  21. Combinatorial Invariance Conjecture Combinatorics
  22. Shareshian–Wachs Conjecture Combinatorics
  23. Seymour's Second Neighbourhood Conjecture Combinatorics
  24. Talagrand's Expectation Threshold Combinatorics
  25. Second Kahn–Kalai Conjecture Combinatorics
  26. Bounded-Degree Coboundary Expanders in Every Dimension Combinatorics
  27. Circulant Hadamard Conjecture Combinatorics
  28. Halving Lines Combinatorics
  29. Cycle–Clique Ramsey Numbers Combinatorics
  30. Gopalan–Servedio Square-Root Degree Bound Disproved Combinatorics
  31. Serre's Multiplicity Conjecture Algebra
  32. Lech's Multiplicity Conjecture Algebra
  33. Small Cohen–Macaulay Module Conjecture Algebra
  34. Kaplansky Zero-Divisor Conjecture Algebra
  35. Kaplansky Direct Finiteness Algebra
  36. Finitistic Dimension Conjecture Algebra
  37. Auslander–Reiten Conjecture Algebra
  38. Eisenbud–Green–Harris Conjecture Algebra
  39. Kurosh's Division Ring Problem Algebra
  40. Alperin Weight Conjecture Proved, Block by Block Algebra
  41. Donovan's Conjecture Algebra
  42. Saxl's Conjecture Algebra
  43. The ℓ¹-Bass Conjecture Algebra
  44. Gersten's Conjecture Algebra
  45. Foulkes' Conjecture, Sixth Case Algebra
  46. No Bigeodesics in First-Passage Percolation Probability and statistical mechanics
  47. Benjamini–Schramm Conjecture Probability and statistical mechanics
  48. XY Model at the BKT Point Probability and statistical mechanics
  49. Sherrington–Kirkpatrick Spin Glass Probability and statistical mechanics
  50. Ising Model Universality Probability and statistical mechanics
  51. Random Walk in Random Environment Probability and statistical mechanics
  52. Mézard–Parisi Formula Probability and statistical mechanics
  53. Random-Cluster Interfaces Probability and statistical mechanics
  54. Voronoi Percolation Probability and statistical mechanics
  55. Six-Vertex Model Probability and statistical mechanics
  56. Tree Reconstruction Threshold Probability and statistical mechanics
  57. Lipschitz Heights Probability and statistical mechanics
  58. Critical Ashkin–Teller Model Probability and statistical mechanics
  59. Orthogonally Invariant Spin Glass Probability and statistical mechanics
  60. Factor-of-IID Ising Threshold on Trees Probability and statistical mechanics
  61. Shelah's Eventual Categoricity Conjecture Mathematical logic
  62. Single-Fold Diophantine Representations Mathematical logic
  63. Cannon's Conjecture Group theory
  64. Finitely Presented Burnside Problem Group theory
  65. Thompson's Group F Group theory
  66. Eilenberg–Ganea Conjecture Group theory
  67. The Boone–Higman Conjecture Group theory
  68. A Hyperbolic Group That Is Not Residually Finite Group theory
  69. Quasi-Isometric Rigidity, Polycyclic Groups Group theory
  70. Gersten's Conjecture Group theory
  71. Spacetime Penrose Inequality Mathematical physics
  72. Lieb–Thirring Inequality in 1D Mathematical physics
  73. The Ionization Conjecture Mathematical physics
  74. Strong Cosmic Censorship Near Kerr Mathematical physics
  75. 2D Area Law from a Spectral Gap Mathematical physics
  76. Bose–Einstein Condensation Mathematical physics
  77. The Spin-One Haldane Gap Mathematical physics
  78. BFSS Matrix Model Mathematical physics
  79. The Entropy Photon-Number Inequality Mathematical physics
  80. QMA-Hardness of Coulomb Energy Mathematical physics
  81. Kohn–Sham Representability Mathematical physics
  82. QAOA Reaches the SK Optimum Mathematical physics
  83. Scale vs Conformal Symmetry in 4D Quantum Field Theory Mathematical physics
  84. Unitary Synthesis from a Boolean Oracle Mathematical physics

Chapter 1: about the problem

Theoretical computer science·OpenAI Math·Result 133

The computational complexity of Weisfeiler–Leman refinement

Proves unconditional nΩ(k) deterministic time lower bounds for joint and separate k-dimensional Weisfeiler–Leman equivalence, for sufficiently large fixed k in the specified sequential adjacency-matrix models. With dimension as input, joint equivalence is EXPTIME-complete even on subcubic graphs; deciding whether refinement identifies a graph is also EXPTIME-complete. (Lean)

OpenAI, in its public catalogue of maths results · preprint, not peer reviewed

The papers and the claim →

Chapter 2: about the problem

Theoretical computer science·OpenAI Math·Result 135·from 0:21

Homogeneous depth-five lower bounds for iterated matrix multiplication

Over every characteristic-zero field, the (1,1) entry of a product of n independent n× n variable matrices requires nΘ(√n) gates in homogeneous depth-five sum–product circuits. This sharp bound allows shared gates and bottom linear forms involving all variables. (Lean)

OpenAI, in its public catalogue of maths results · preprint, not peer reviewed

The papers and the claim →

Chapter 3: about the problem

Theoretical computer science·OpenAI Math·Result 136·from 0:41

A quasilinear PCP theorem for PPAD

Resolves the quasilinear PCP-for-PPAD conjecture. An End-of-Line instance of length N reduces to numerical circuit constraints of total length N(log N)O(1) such that any polynomially encoded rational assignment satisfying all but a fixed fraction to fixed accuracy yields an endpoint solution. Such assignments always exist, giving robust local verification with only quasilinear size overhead.

OpenAI, in its public catalogue of maths results · preprint, not peer reviewed

The papers and the claim →

Chapter 4: about the problem

Theoretical computer science·OpenAI Math·Result 137·from 1:02

One-tape time simulation in two-fifths-power space

Determines the halting and finite-control outcome of a fixed deterministic one-writable-tape machine up to time T using O(T2/5 logC(T+2)) space, improving the square-root exponent. Heads move at most one cell per step; finitely many read-only input heads are allowed. Initial contents are independent of T, and contents and input symbols have polylogarithmic-space access. Simulation time is unrestricted. (Lean)

OpenAI, in its public catalogue of maths results · preprint, not peer reviewed

The papers and the claim →

Chapter 5: about the problem

Theoretical computer science·OpenAI Math·Result 139·from 1:22

Subpolynomial query complexity for log-concave sampling

For C2 potentials with a supplied minimizer and I ⪯ ∇2V ⪯ 2I, proves that sampling within total variation 1/10 requires only Cε dε exact value-and-gradient queries for every fixed ε > 0. The bound holds on every run, with unrestricted computation between queries. A logarithmic lower bound also holds, so the optimal power-law exponent in this oracle model is zero. (Lean)

OpenAI, in its public catalogue of maths results · preprint, not peer reviewed

The papers and the claim →

Chapter 6: about the problem

Theoretical computer science·OpenAI Math·Result 140·from 1:42

Memory–sample lower bounds for noiseless Gaussian regression

For fixed A > 0, a one-pass learner with Ad2 persistent bits needs ΩA(d log(1/ϵ)) noiseless Gaussian samples to recover a unit vector to angular error 0 < ϵ ≤ 1/10 with probability 2/3, uniformly in accuracy for large d. Computation and randomized updates are unrestricted, but output uses only the terminal state, stopping index and fresh randomness. (Lean)

OpenAI, in its public catalogue of maths results · preprint, not peer reviewed

The papers and the claim →

Chapter 7: about the problem

Theoretical computer science·OpenAI Math·Result 141·from 2:03

Existential–universal real sentences in the counting hierarchy

Proves that the existential theory of the reals lies in the counting hierarchy. More generally, truth of existential–universal real sentences can be decided at one fixed level of that hierarchy, even when their integer polynomials are specified by arithmetic circuits.

OpenAI, in its public catalogue of maths results · preprint, not peer reviewed

The papers and the claim →

Chapter 8: about the problem

Dynamical systems and ergodic theory·OpenAI Math·Result 144·from 2:24

Banach’s simple Lebesgue-spectrum problem

Resolves the probability-preserving form of Banach's simple Lebesgue-spectrum problem within smooth dynamics. A smooth volume-preserving diffeomorphism of the standard-volume three-torus has simple Lebesgue spectrum on its entire complex mean-zero L2 space: the bilateral iterates of one real observable form an orthonormal basis of that space. (Lean)

OpenAI, in its public catalogue of maths results · preprint, not peer reviewed

The papers and the claim →

Chapter 9: about the problem

Dynamical systems and ergodic theory·OpenAI Math·Result 145·from 2:45

Rokhlin’s multiple-mixing problem

Proves that every invertible mixing probability-preserving transformation is mixing of all finite orders, resolving Rokhlin's multiple-mixing problem for a single transformation. Correlations among any finite collection of measurable sets converge to the product of their measures whenever all pairwise time separations diverge. (Lean)

OpenAI, in its public catalogue of maths results · preprint, not peer reviewed

The papers and the claim →

Chapter 10: about the problem

Dynamical systems and ergodic theory·OpenAI Math·Result 147·from 3:06

The near-boundary Birkhoff conjecture

Resolves the near-boundary Birkhoff conjecture for smooth strictly convex planar billiards of positive curvature. Such a billiard is an ellipse whenever a full grazing annulus is continuously foliated by individually invariant essential curves. A continuous physical collar of smooth closed convex caustics also suffices.

OpenAI, in its public catalogue of maths results · preprint, not peer reviewed

The papers and the claim →

Chapter 11: about the problem

Dynamical systems and ergodic theory·OpenAI Math·Result 148·from 3:28

The entropy-rate dimension formula for self-similar measures

For every self-similar measure on the line generated by finitely many contracting similarities, proves dimHμ=min {1,hRW/χ}, where hRW is the entropy rate of random composed maps and χ the average logarithmic contraction. This resolves the entropy-rate dimension conjecture without a separation assumption, allowing exact overlaps and unequal contraction ratios. (Lean)

OpenAI, in its public catalogue of maths results · preprint, not peer reviewed

The papers and the claim →

Chapter 12: about the problem

Dynamical systems and ergodic theory·OpenAI Math·Result 149·from 3:50

Classwise permanence for weakly reversible mass-action systems

Proves the permanence conjecture for every finite weakly reversible mass-action system with fixed positive rate constants. Every positive stoichiometric compatibility class, even an unbounded one, has a common compact convex forward-invariant absorbing set. All positive trajectories in that class therefore eventually share positive lower and finite upper concentration bounds. (Lean)

OpenAI, in its public catalogue of maths results · preprint, not peer reviewed

The papers and the claim →

Chapter 13: about the problem

Dynamical systems and ergodic theory·OpenAI Math·Result 151·from 4:10

A C1 counterexample to the entropy conjecture

Constructs a noninvertible C1 self-map of a compact smooth manifold with zero topological entropy but eigenvalue 2 on second homology. This disproves the homological entropy lower bound for general C1 self-maps: homological growth need not force positive orbit complexity. (Lean)

OpenAI, in its public catalogue of maths results · preprint, not peer reviewed

The papers and the claim →

Chapter 14: about the problem

Dynamical systems and ergodic theory·OpenAI Math·Result 152·from 4:30

Zero entropy does not guarantee a smooth positive-volume model

Constructs a zero-entropy ergodic invertible transformation of a standard nonatomic probability space that is not measurably conjugate to any C∞ diffeomorphism preserving a strictly positive smooth probability density on a compact finite-dimensional manifold. One example rules out every finite dimension. (Lean)

OpenAI, in its public catalogue of maths results · preprint, not peer reviewed

The papers and the claim →

Chapter 15: about the problem

Dynamical systems and ergodic theory·OpenAI Math·Result 153·from 4:51

Arithmetic classification and non-Pisot singularity for Bernoulli convolutions

Classifies singular and absolutely continuous unbiased Bernoulli convolutions for every λ ∈ (0,1) by an infinite, one-sided approximation condition using explicit finite sets of algebraic units. It also proves singularity at reciprocals of every quartic Salem number in (1,2), giving examples beyond reciprocal Pisot parameters.

OpenAI, in its public catalogue of maths results · preprint, not peer reviewed

The papers and the claim →

Chapter 16: about the problem

Combinatorics·OpenAI Math·Result 156·from 5:11

Borsuk's conjecture fails in dimension nine

Constructs a compact subset of ℝ9 that cannot be covered by ten sets of strictly smaller diameter, disproving Borsuk's covering assertion already in dimension nine. The example consists of rank-one orthogonal projectors onto lines in ℝ4, with the Frobenius metric. (Lean)

OpenAI, in its public catalogue of maths results · preprint, not peer reviewed

The papers and the claim →

Chapter 17: about the problem

Combinatorics·OpenAI Math·Result 161·from 5:32

Counterexamples to Sidorenko’s conjecture and the forcing conjecture

Disproves Sidorenko's conjecture with a connected bipartite pattern on 35 vertices and 66 edges that occurs less frequently than in a random graph of the same edge density. The same pattern disproves the forcing conjecture of Skokan and Thoma: matching its density and the edge density of a constant graphon need not force quasirandomness. (Lean)

OpenAI, in its public catalogue of maths results · preprint, not peer reviewed

The papers and the claim →

Chapter 18: about the problem

Combinatorics·OpenAI Math·Result 162·from 5:53

Counterexamples to Ryser’s covering conjecture

Disproves Ryser's covering conjecture by constructing intersecting (q+1)-partite, (q+1)-uniform hypergraphs with covering number q+1, rather than the predicted bound q, for every sufficiently large prime q. A separate construction over extension fields also disproves Gyárfás's monochromatic tree-cover conjecture. (Lean)

OpenAI, in its public catalogue of maths results · preprint, not peer reviewed

The papers and the claim →

Chapter 19: about the problem

Combinatorics·OpenAI Math·Result 164·from 6:13

Hindman’s finite sums and products conjecture

Proves Hindman's finite sums and products conjecture: every finite coloring of the positive integers contains sets of any prescribed finite size whose nonempty subset sums and nonempty subset products all have one common color.

OpenAI, in its public catalogue of maths results · preprint, not peer reviewed

The papers and the claim →

Chapter 20: about the problem

Combinatorics·OpenAI Math·Result 167·from 6:35

Planar distinct distances and unit-distance bounds

Proves the weak pinned Erdős distance conjecture: for every fixed ε > 0, all but o(n) points of any n-point planar set determine at least n1-ε distinct nonzero distances. A complementary theorem bounds the number of unit-distance pairs by O(n4/3-δ) for an absolute δ > 0. (Lean)

OpenAI, in its public catalogue of maths results · preprint, not peer reviewed

The papers and the claim →

Chapter 21: about the problem

Combinatorics·OpenAI Math·Result 168·from 6:56

Combinatorial invariance of Kazhdan–Lusztig polynomials

Resolves the full combinatorial invariance conjecture: isomorphic Bruhat intervals in arbitrary Coxeter systems have identical equal-parameter Kazhdan–Lusztig polynomials. Thus the abstract order of the interval determines the polynomial, even across different Coxeter systems. (Lean)

OpenAI, in its public catalogue of maths results · preprint, not peer reviewed

The papers and the claim →

Chapter 22: about the problem

Combinatorics·OpenAI Math·Result 169·from 7:17

Shareshian–Wachs elementary positivity

Resolves the elementary-positivity part of the Shareshian–Wachs conjecture: the chromatic quasisymmetric function of every natural unit interval graph has elementary-basis coefficients in ℕ[q]. The coefficients count explicitly described permutations, giving a combinatorial explanation of positivity. (Lean)

OpenAI, in its public catalogue of maths results · preprint, not peer reviewed

The papers and the claim →

Chapter 23: about the problem

Combinatorics·OpenAI Math·Result 173·from 7:38

Seymour’s second-neighborhood conjecture

Proves Seymour's second-neighborhood conjecture: every nonempty finite oriented graph has a vertex with at least as many vertices at directed distance exactly two as at directed distance one. Oriented graphs may be arbitrary apart from the exclusion of loops and oppositely directed edge pairs. (Lean)

OpenAI, in its public catalogue of maths results · preprint, not peer reviewed

The papers and the claim →

Chapter 24: about the problem

Combinatorics·OpenAI Math·Result 175·from 7:58

Talagrand’s expectation thresholds, discrete convexity, and graph decompositions

Proves that integral and fractional expectation thresholds differ by at most a universal factor, and resolves Talagrand's discrete-convexity conjecture. An application proves the Ascoli–He–Park–Talagrand graph-decomposition conjecture: every graph's edges split into a universally bounded number of fixed pieces, each with containment threshold at most a universal constant times the original graph's integral expectation threshold. The pieces' embeddings need not agree on shared vertices. (Lean)

OpenAI, in its public catalogue of maths results · preprint, not peer reviewed

The papers and the claim →

Chapter 25: about the problem

Combinatorics·OpenAI Math·Result 176·from 8:19

The second Kahn–Kalai conjecture with an edge-count bound

Proves the second Kahn–Kalai conjecture: for every finite simple graph H with h ≥ 1 edges and at most n vertices, its appearance threshold in G(n,p) is at most C pE(n,H)(1+log2 h), with universal C. Here pE is the least density at which every subgraph of H has expected copy count at least 1/2. (Lean)

OpenAI, in its public catalogue of maths results · preprint, not peer reviewed

The papers and the claim →

Chapter 26: about the problem

Combinatorics·OpenAI Math·Result 177·from 8:39

Bounded-degree coboundary expanders

Constructs arbitrarily large finite d-dimensional simplicial complexes, for every d ≥ 3, with uniformly bounded vertex degrees and uniform 𝔽2 coboundary expansion in every degree below d. Together with the known graph and two-dimensional cases, this establishes the existence of such expanders in every positive dimension. (Lean)

OpenAI, in its public catalogue of maths results · preprint, not peer reviewed

The papers and the claim →

Chapter 27: about the problem

Combinatorics·OpenAI Math·Result 179·from 8:59

The circulant Hadamard and Barker-sequence conjectures

Proves that real circulant Hadamard matrices exist exactly in orders 1 and 4, resolving the circulant Hadamard conjecture. Together with classical Barker-sequence results, this shows that binary sequences whose nontrivial aperiodic autocorrelations have magnitude at most 1 exist at lengths n > 1 exactly when n ∈ {2,3,4,5,7,11,13}. (Lean)

OpenAI, in its public catalogue of maths results · preprint, not peer reviewed

The papers and the claim →

Chapter 28: about the problem

Combinatorics·OpenAI Math·Result 183·from 9:19

Power savings for planar halving lines and k-sets

Improves the planar halving-line bound to O(n4/3-ε) for sets with no three collinear and an absolute ε > 0. More generally, an n-point set with no three collinear has O(n(k+1)1/3-ε0) strictly separable k-subsets for 1 ≤ k ≤ n/2, with an absolute ε0 > 0. The constants and positive exponents are nonquantitative. (Lean)

OpenAI, in its public catalogue of maths results · preprint, not peer reviewed

The papers and the claim →

Chapter 29: about the problem

Combinatorics·OpenAI Math·Result 189·from 9:40

Cycle–clique Ramsey numbers

Proves the Erdős–Faudree–Rousseau–Schelp conjecture: R(Cm,Kn)=(m-1)(n-1)+1 for every m ≥ n ≥ 3, except R(C3,K3)=6. This is the exact threshold forcing a red m-cycle or a blue n-clique in every red–blue coloring of a complete graph. (Lean)

OpenAI, in its public catalogue of maths results · preprint, not peer reviewed

The papers and the claim →

Chapter 30: about the problem

Combinatorics·OpenAI Math·Result 192·from 10:01

Boolean functions violate the square-root degree bound by arbitrary factors

Disproves the proposed square-root bound relating a Boolean function's linear Fourier coefficients to its polynomial degree. For every C > 0, there is a sign-valued Boolean function f with ∑if̂({i}) > C√(deg(f)). Thus its total signed correlation with individual input bits can exceed the proposed bound by an arbitrary factor. (Lean)

OpenAI, in its public catalogue of maths results · preprint, not peer reviewed

The papers and the claim →

Chapter 31: about the problem

Algebra·OpenAI Math·Result 193·from 10:23

Serre’s intersection-multiplicity conjecture

Proves strict positivity of Serre's intersection multiplicity χR(M,N) for nonzero finitely generated modules over any regular local ring, provided M⊗R N has finite length and dim M+dim N=dim R. This resolves the positivity conjecture, including ramified mixed characteristic.

OpenAI, in its public catalogue of maths results · preprint, not peer reviewed

The papers and the claim →

Chapter 32: about the problem

Algebra·OpenAI Math·Result 194·from 10:45

Lech’s multiplicity conjecture

Proves e(R) ≤ e(S) for every flat local homomorphism of nonzero Noetherian local rings, where e is Hilbert–Samuel multiplicity. This resolves Lech's conjecture in every dimension and characteristic. (Lean)

OpenAI, in its public catalogue of maths results · preprint, not peer reviewed

The papers and the claim →

Chapter 33: about the problem

Algebra·OpenAI Math·Result 195·from 11:06

A counterexample to the small Cohen–Macaulay module conjecture

Constructs a three-dimensional complete Noetherian normal local domain over ℂ with no nonzero finitely generated maximal Cohen–Macaulay module. A three-dimensional local domain essentially of finite type over ℂ has the same property, disproving the domain form of the small Cohen–Macaulay module conjecture. (Lean)

OpenAI, in its public catalogue of maths results · preprint, not peer reviewed

The papers and the claim →

Chapter 34: about the problem

Algebra·OpenAI Math·Result 196·from 11:26

A counterexample to Kaplansky’s zero-divisor conjecture

Constructs a finitely presented torsion-free group G whose group algebra 𝔽2[G] has nonzero zero divisors, disproving Kaplansky's zero-divisor conjecture. The group has a finite two-dimensional classifying space. (Lean)

OpenAI, in its public catalogue of maths results · preprint, not peer reviewed

The papers and the claim →

Chapter 35: about the problem

Algebra·OpenAI Math·Result 197·from 11:47

A torsion-free group algebra that is not directly finite

Constructs a finitely presented torsion-free nonsofic group whose group algebra over 𝔽2 is not directly finite, disproving Kaplansky's conjecture even without torsion. Companion examples give injective nonsurjective cellular automata on all configurations, refuting Gottschalk's surjunctivity conjecture. Another counterexample is an integral group-ring matrix, invertible over the rational group ring, with Fuglede–Kadison determinant strictly between zero and one, disproving the unrestricted Determinant Conjecture. (Lean)

OpenAI, in its public catalogue of maths results · preprint, not peer reviewed

The papers and the claim →

Chapter 36: about the problem

Algebra·OpenAI Math·Result 198·from 12:08

A counterexample to finitistic-dimension finiteness

Constructs a finite-dimensional complex algebra whose finite-dimensional modules have unbounded finite projective dimensions. This disproves the little finitistic-dimension conjecture. (Lean)

OpenAI, in its public catalogue of maths results · preprint, not peer reviewed

The papers and the claim →

Chapter 37: about the problem

Algebra·OpenAI Math·Result 199·from 12:28

Counterexamples to Auslander–Reiten, Tachikawa and related homological conjectures

Constructs finite-dimensional algebras over a characteristic-two rational-function field that disprove the Auslander–Reiten and Gorenstein-projective conjectures, and Tachikawa's second conjecture. An associated endomorphism algebra also disproves the classical, generalized and strong Nakayama conjectures, the Auslander–Gorenstein conjecture, and the Wakamatsu tilting conjecture. The counterexamples persist under every extension of the base field. (Lean)

OpenAI, in its public catalogue of maths results · preprint, not peer reviewed

The papers and the claim →

Chapter 38: about the problem

Algebra·OpenAI Math·Result 200·from 12:49

Eisenbud–Green–Harris and lex-plus-powers

Proves the Eisenbud–Green–Harris and lex-plus-powers conjectures over every characteristic-zero field. Any homogeneous ideal containing a regular sequence, of arbitrary length and degrees at least two, admits a lex-plus-powers ideal with the same Hilbert function and no smaller graded Betti numbers.

OpenAI, in its public catalogue of maths results · preprint, not peer reviewed

The papers and the claim →

Chapter 39: about the problem

Algebra·OpenAI Math·Result 201·from 13:09

A counterexample to Kurosh’s division-ring problem

Constructs a countable characteristic-zero division ring that is algebraic over its center and generated by two elements over that center, but has infinite dimension over it. This answers Kurosh's division-ring problem on local finiteness negatively.

OpenAI, in its public catalogue of maths results · preprint, not peer reviewed

The papers and the claim →

Chapter 40: about the problem

Algebra·OpenAI Math·Result 202·from 13:30

The blockwise Alperin weight conjecture

Proves the numerical blockwise Alperin weight conjecture for every prime and every finite group: the number of irreducible Brauer characters in a block equals the number of conjugacy classes of its weights.

OpenAI, in its public catalogue of maths results · preprint, not peer reviewed

The papers and the claim →

Chapter 41: about the problem

Algebra·OpenAI Math·Result 203·from 13:52

Donovan's conjecture over fields and complete mixed-characteristic DVRs

Proves Donovan's conjecture: over each fixed algebraically closed field of characteristic p, blocks of finite groups with bounded defect-group order have only finitely many Morita-equivalence classes, for every prime p. Also proves the integral form over each fixed complete mixed-characteristic discrete valuation ring with algebraically closed residue field.

OpenAI, in its public catalogue of maths results · preprint, not peer reviewed

The papers and the claim →

Chapter 42: about the problem

Algebra·OpenAI Math·Result 205·from 14:13

Saxl’s conjecture and universal tensor squares

Proves Saxl's conjecture: the tensor square of every staircase representation contains every irreducible complex representation of the corresponding symmetric group. More generally, every Sn with n ∉ {2,4,9} has an irreducible representation whose tensor square contains all irreducibles. (Lean)

OpenAI, in its public catalogue of maths results · preprint, not peer reviewed

The papers and the claim →

Chapter 43: about the problem

Algebra·OpenAI Math·Result 207·from 14:34

The ℓ¹-Bass conjecture for all discrete groups

Proves the ℓ1-Bass conjecture for every discrete group: Hattori–Stallings traces of idempotent matrices over ℓ1(G) are supported on finitely many finite-order conjugacy classes. The algebraic companion proves the integral Bass trace conjecture and Kaplansky's idempotent conjecture for torsion-free groups over every commutative unital characteristic-zero domain. (Lean)

OpenAI, in its public catalogue of maths results · preprint, not peer reviewed

The papers and the claim →

Chapter 44: about the problem

Algebra·OpenAI Math·Result 209·from 14:55

Integral counterexamples to Gersten’s conjecture

Disproves unrestricted integral Gersten injectivity in degrees 3 and 5. Two explicit two-dimensional ramified regular local rings of mixed characteristic (0,5) have nonzero integral K-theory classes that vanish over their fraction fields.

OpenAI, in its public catalogue of maths results · preprint, not peer reviewed

The papers and the claim →

Chapter 45: about the problem

Algebra·OpenAI Math·Result 210·from 15:15

Foulkes' conjecture for sixth powers and quadratic stabilization

Proves the sixth case of Foulkes’ conjecture: Sym 6(Sym bV) embeds equivariantly in Sym b(Sym 6V) for every b ≥ 6 and finite-dimensional complex V. More generally, the canonical multiplication map Sym b(Sym aV) → Sym a(Sym bV) is surjective for a ≥ 2 and b ≥ a(a-1), giving dimension-independent quadratic stabilization. (Lean)

OpenAI, in its public catalogue of maths results · preprint, not peer reviewed

The papers and the claim →

Chapter 46: about the problem

Probability and statistical mechanics·OpenAI Math·Result 212·from 15:35

Planar first-passage geometry and the absence of bigeodesics

Proves that planar first-passage percolation has no doubly infinite geodesic for iid nonnegative nonatomic edge weights when the minimum of four weights has finite second moment. For exponential weights, the limit shape is strictly convex with C1 boundary. Differentiability also holds for every Gamma law with positive shape and rate. (Lean)

OpenAI, in its public catalogue of maths results · preprint, not peer reviewed

The papers and the claim →

Chapter 47: about the problem

Probability and statistical mechanics·OpenAI Math·Result 214·from 15:56

The Benjamini–Schramm nonuniqueness conjecture

Proves pc < pu for Bernoulli bond percolation on every infinite connected locally finite nonamenable quasi-transitive graph, resolving the Benjamini–Schramm nonuniqueness conjecture. Thus there is a nonempty range of probabilities with infinitely many infinite clusters. A stronger operator bound also establishes the critical triangle condition. (Lean)

OpenAI, in its public catalogue of maths results · preprint, not peer reviewed

The papers and the claim →

Chapter 48: about the problem

Probability and statistical mechanics·OpenAI Math·Result 216·from 16:16

Critical and near-critical XY scaling and BKT universality

For the square-lattice nearest-neighbor cosine XY model, proves critical axis correlations Cβc(r) ∼ Ar-1/4(log r)1/8 and the Berezinskii–Kosterlitz–Thouless essential singularity √(βc-β) log ξ(β) → B, with A,B > 0 after the free-box thermodynamic limit. For finite square-symmetric interactions containing nearest neighbors, discrete Gaussian heights converge to Gaussian fields throughout the rough phase, including its threshold, along geometric torus sizes. Critical center-magnetization and spin-field conclusions retain their stated height, renormalization, and field-input assumptions.

OpenAI, in its public catalogue of maths results · preprint, not peer reviewed

The papers and the claim →

Chapter 49: about the problem

Probability and statistical mechanics·OpenAI Math·Result 217·from 16:38

The low-temperature Sherrington–Kirkpatrick fluctuation law

For every fixed inverse temperature β > 1, determines the fluctuation scale and limiting law of the zero-field Gaussian Sherrington–Kirkpatrick log partition function. Its variance is asymptotic to cβ n1/3, with cβ > 0, confirming the predicted n1/6 standard-deviation scale. Exact centering and standardization give full-sequence convergence to a uniquely characterized nondegenerate law.

OpenAI, in its public catalogue of maths results · preprint, not peer reviewed

The papers and the claim →

Chapter 50: about the problem

Probability and statistical mechanics·OpenAI Math·Result 218·from 16:59

Conformal universality for weakly interacting and random-bond Ising models

Weak finite-range square-symmetric even multispin perturbations of the square-lattice Ising model preserve critical bulk spin and energy limits; weak square-symmetric contour interactions also yield chordal SLE3 interface limits. With sufficiently weak iid bond disorder of any fixed bounded nondegenerate mean-zero law, critical spin interfaces converge to the same law in probability over environments. (Lean)

OpenAI, in its public catalogue of maths results · preprint, not peer reviewed

The papers and the claim →

Chapter 51: about the problem

Probability and statistical mechanics·OpenAI Math·Result 220·from 17:20

Directional zero–one laws beyond iid environments and iid ballisticity

On ℤd, d ≥ 3, directional escape has probability zero or one for iid strictly elliptic nearest-neighbor environments, and for stationary ergodic finite-range-dependent environments under uniform ellipticity. In iid uniformly elliptic environments with d ≥ 2, almost-sure directional transience implies a deterministic limiting velocity with positive projection in that direction, resolving the ballisticity conjecture. (Lean)

OpenAI, in its public catalogue of maths results · preprint, not peer reviewed

The papers and the claim →

Chapter 52: about the problem

Probability and statistical mechanics·OpenAI Math·Result 221·from 17:42

The Mézard–Parisi formula for diluted spin glasses

Proves the Mézard–Parisi hierarchical cavity formula for Poisson-diluted even-arity Ising models satisfying the Panchenko–Talagrand factorization and positivity assumptions, with only first-moment integrability. The limiting free energy equals the infimum over finite-depth hierarchical trial laws. This includes the Viana–Bray model, symmetric diluted even-spin models, and weighted soft even-K satisfiability. (Lean)

OpenAI, in its public catalogue of maths results · preprint, not peer reviewed

The papers and the claim →

Chapter 53: about the problem

Probability and statistical mechanics·OpenAI Math·Result 223·from 18:03

Random-cluster interfaces: critical, disordered, thermal, and natural-time scaling

Proves chordal SLEκ limits for critical square-lattice random-cluster interfaces for 0 < q ≤ 4, with κ=4π/arccos(-√q/2): bounded Jordan domains are allowed for q ≥ 1, and smooth Jordan domains for q < 1, under the stated marked-boundary approximations. For 1 ≤ q ≤ 4, complete nested plane loops converge to CLEκ.

OpenAI, in its public catalogue of maths results · preprint, not peer reviewed

The papers and the claim →

Chapter 54: about the problem

Probability and statistical mechanics·OpenAI Math·Result 224·from 18:24

Critical and quenched near-critical universality for Poisson–Voronoi percolation

Proves Cardy's formula for annealed critical Poisson–Voronoi crossing probabilities in every bounded Jordan quadrilateral. With each model normalized by its own expected unit-square pivotal count, the conditional joint near-critical crossing-threshold laws for rational polygonal quads converge in environment probability to the triangular-lattice reference law. This establishes quenched near-critical universality for crossing thresholds.

OpenAI, in its public catalogue of maths results · preprint, not peer reviewed

The papers and the claim →

Chapter 55: about the problem

Probability and statistical mechanics·OpenAI Math·Result 225·from 18:45

Gaussian free field limits throughout the balanced six-vertex regime

The balanced square-lattice six-vertex height field with a=b=1 and 0 < c ≤ 2 converges to a Gaussian free field, including at the endpoint c = 2. The plane state is defined by balanced-torus limits. For unit height increments and Green kernel -(2π)-1 log|x-y|, the exact variance multiplier is 1/arcsin(c/2).

OpenAI, in its public catalogue of maths results · preprint, not peer reviewed

The papers and the claim →

Chapter 56: about the problem

Probability and statistical mechanics·OpenAI Math·Result 229·from 19:05

Exact three- and four-state reconstruction thresholds and four-state tree capacity

Proves the exact reconstruction threshold dλ2 > 1, with nonreconstruction at equality, for three-state symmetric and four-state ferromagnetic broadcasting on regular trees (d ≥ 2) and observed Poisson trees (mean d > 1 and d > 0, respectively), with Poisson advantage averaged without conditioning on survival. The three-state theorem allows both signs of λ and gives the exact weak-recovery threshold for the symmetric three-community stochastic block model. (Lean)

OpenAI, in its public catalogue of maths results · preprint, not peer reviewed

The papers and the claim →

Chapter 57: about the problem

Probability and statistical mechanics·OpenAI Math·Result 232·from 19:25

Gaussian fields and interfaces for triangular-lattice Lipschitz heights

Proves Gaussian free field limits on bounded smooth simply connected domains for triangular-lattice height models: uniform odd heights with increments 0,±2 and two-arc boundary values ±1, and zero-boundary integer Lipschitz heights weighted by fixed x ∈ [1/√2,1]. Uniform real Lipschitz heights also converge to a Gaussian field; at a tuned opposite-boundary amplitude, their interface converges to chordal SLE4, establishing Schramm’s real-field/interface predictions.

OpenAI, in its public catalogue of maths results · preprint, not peer reviewed

The papers and the claim →

Chapter 58: about the problem

Probability and statistical mechanics·OpenAI Math·Result 233·from 19:45

The joint critical Ashkin–Teller current limit

Identifies the joint scaling limit of Ashkin–Teller heights and both complete current-cluster collections throughout the critical line, including the four-state Potts endpoint. In bounded Jordan domains with admissible lattice approximations and wired primal/free dual boundaries, the height converges to the predicted Gaussian free field, and the clusters to canonical recursive sets of that same field, retaining every nesting depth.

OpenAI, in its public catalogue of maths results · preprint, not peer reviewed

The papers and the claim →

Chapter 59: about the problem

Probability and statistical mechanics·OpenAI Math·Result 234·from 20:06

All-temperature pressure of orthogonally invariant Ising spin glasses

Gives an exact variational formula for the limiting pressure of orthogonally invariant Ising spin glasses at every fixed temperature, both almost surely and in expectation. The coupling matrix is a Haar-random rotation of a deterministic spectrum converging to a compactly supported law, with extreme eigenvalues converging to its support edges. The zero-field ground-state energy follows as temperature tends to zero. (Lean)

OpenAI, in its public catalogue of maths results · preprint, not peer reviewed

The papers and the claim →

Chapter 60: about the problem

Probability and statistical mechanics·OpenAI Math·Result 236·from 20:28

The exact factor-of-IID threshold for free Ising spins on trees

Determines when the free zero-field ferromagnetic Ising state on the infinite d-regular tree is a factor of independent vertex labels: exactly when tanh β ≤ (d-1)-1/2, including equality, for d ≥ 3 and β ≥ 0. The construction uses no root and is almost surely equivariant for each fixed tree automorphism, resolving the ferromagnetic case of Lyons's question. (Lean)

OpenAI, in its public catalogue of maths results · preprint, not peer reviewed

The papers and the claim →

Chapter 61: about the problem

Mathematical logic·OpenAI Math·Result 240·from 20:49

Shelah's eventual categoricity and the prescribed-threshold obstruction

Proves Shelah's eventual categoricity conjecture in ZFC: for each bound on the Löwenheim–Skolem number, a uniform threshold makes categoricity of an abstract elementary class in one cardinal above that threshold imply categoricity throughout the same tail. Categoricity means uniqueness up to isomorphism at a given cardinality. Under the continuum hypothesis, a proposed specific Hanf threshold need not suffice. (Lean)

OpenAI, in its public catalogue of maths results · preprint, not peer reviewed

The papers and the claim →

Chapter 62: about the problem

Mathematical logic·OpenAI Math·Result 242·from 21:10

Single-fold Diophantine representations and undecidability under an at-most-one-solution promise

Every recursively enumerable set of tuples of natural numbers has a Diophantine representation with exactly one auxiliary solution for each member and none for nonmembers. This proves the single-fold conjecture and hence the finite-fold conjecture. Diophantine solvability over the nonnegative integers remains undecidable even with an at-most-one-solution promise. (Lean)

OpenAI, in its public catalogue of maths results · preprint, not peer reviewed

The papers and the claim →

Chapter 63: about the problem

Group theory·OpenAI Math·Result 246·from 21:31

Cannon's conjecture

Every word-hyperbolic group with boundary homeomorphic to S2 admits a proper cocompact isometric action on hyperbolic three-space with finite kernel, proving Cannon's conjecture. Every torsion-free such group is therefore the fundamental group of a closed hyperbolic three-manifold. (Lean)

OpenAI, in its public catalogue of maths results · preprint, not peer reviewed

The papers and the claim →

Chapter 64: about the problem

Group theory·OpenAI Math·Result 247·from 21:52

An infinite finitely presented residually finite 2-group and a finitely presented nil algebra

Constructs an infinite finitely presented residually finite group whose elements all have finite 2-power order, answering the finitely presented Burnside problem negatively even in this class. The construction also yields an infinite-dimensional finitely presented nil associative 𝔽2-algebra and a finitely presented infinite-dimensional algebraic unitization, giving negative answers to the corresponding nilpotence and Kurosh finiteness questions. (Lean)

OpenAI, in its public catalogue of maths results · preprint, not peer reviewed

The papers and the claim →

Chapter 65: about the problem

Group theory·OpenAI Math·Result 248·from 22:12

Thompson's group F is nonamenable

Proves that Thompson's group F, the group of dyadic piecewise linear homeomorphisms of the interval, is nonamenable, resolving its longstanding amenability problem. (Lean)

OpenAI, in its public catalogue of maths results · preprint, not peer reviewed

The papers and the claim →

Chapter 66: about the problem

Group theory·OpenAI Math·Result 249·from 22:33

A finitely generated Eilenberg–Ganea counterexample

Constructs a finitely generated residually finite group with integral cohomological dimension two and geometric dimension three, disproving the Eilenberg–Ganea conjecture. It has no two-dimensional classifying space, even with infinitely many cells. (Lean)

OpenAI, in its public catalogue of maths results · preprint, not peer reviewed

The papers and the claim →

Chapter 67: about the problem

Group theory·OpenAI Math·Result 250·from 22:53

Boone–Higman embeddings with higher finiteness

A finitely generated group has decidable word problem exactly when it embeds in a finitely presented simple group, proving the Boone–Higman conjecture. The target can have type F∞: a classifying space with finitely many cells in each dimension. A single group of type F∞ can also contain every finitely presented group. (Lean)

OpenAI, in its public catalogue of maths results · preprint, not peer reviewed

The papers and the claim →

Chapter 68: about the problem

Group theory·OpenAI Math·Result 252·from 23:13

A torsion-free hyperbolic group that is neither residually finite nor linear over any field

Constructs a torsion-free word-hyperbolic group that is not residually finite, answering the residual-finiteness question negatively. One fixed nonidentity element is killed by every finite-dimensional linear representation over every commutative field, so the group is not linear over any such field. (Lean)

OpenAI, in its public catalogue of maths results · preprint, not peer reviewed

The papers and the claim →

Chapter 69: about the problem

Group theory·OpenAI Math·Result 255·from 23:35

Quasi-isometric recognition of virtually polycyclic groups

Proves that every finitely generated group quasi-isometric to a finitely generated virtually polycyclic group is virtually polycyclic, resolving the Eskin–Fisher–Whyte lattice-recognition conjecture. Equivalently, a group quasi-isometric to a lattice in a connected simply connected solvable Lie group is virtually a uniform lattice in some such Lie group, possibly a different one. (Lean)

OpenAI, in its public catalogue of maths results · preprint, not peer reviewed

The papers and the claim →

Chapter 70: about the problem

Group theory·OpenAI Math·Result 258·from 23:56

Gersten’s conjecture and virtual compact specialness of one-relator groups

Proves Gersten's conjecture: every finitely generated one-relator group containing no Baumslag–Solitar subgroup BS(m,n), with m,n ≠ 0, is word-hyperbolic. It also proves that every word-hyperbolic one-relator group is virtually compact special.

OpenAI, in its public catalogue of maths results · preprint, not peer reviewed

The papers and the claim →

Chapter 71: about the problem

Mathematical physics·OpenAI Math·Result 260·from 24:17

Spacetime Penrose inequalities: enclosing area, charge, rotation, and anti-de Sitter extensions

Proves the sharp enclosing-area spacetime Penrose inequality for smooth one-ended asymptotically flat initial data in every spatial dimension n ≥ 3, under dominant energy, weak future trapping, positive enclosing area, and the stated decay assumptions. It bounds invariant ADM mass below using minimum enclosing area, with equality rigidity under additional horizon hypotheses. Charged upper-area bounds treat dyonic three-dimensional data; the higher-dimensional purely electric extension uses the matched neutral theorem. (Lean)

OpenAI, in its public catalogue of maths results · preprint, not peer reviewed

The papers and the claim →

Chapter 72: about the problem

Mathematical physics·OpenAI Math·Result 262·from 24:39

Sharp finite-matrix Lieb–Thirring inequalities and all equality cases

Proves the sharp one-dimensional Lieb–Thirring inequality for 1/2 < γ < 3/2 and arbitrary finite-matrix potentials W ≥ 0 with ∫tr (Wγ+1/2) < ∞: the optimal constant is the scalar one-bound-state value, independent of matrix size. All equality cases are direct sums, in one constant unitary basis, of scalar sech2 solitons with independent scales and centers, and zero channels. (Lean)

OpenAI, in its public catalogue of maths results · preprint, not peer reviewed

The papers and the claim →

Chapter 73: about the problem

Mathematical physics·OpenAI Math·Result 263·from 25:00

The ionization and generalized ionization conjectures

For the full nonrelativistic Coulomb model with two electron spin states, proves that a molecule with M fixed nuclei of charges at least one and total charge Z strictly binds at most Z+CM electrons. Neutral-atom first ionization energies and radii containing all but an expected half-electron have universal positive upper and lower bounds. The energy cost of removing m electrons has Thomas–Fermi asymptotics as m → ∞ and Z/m → ∞; neutral-atom outer radii have the corresponding iterated-limit asymptotics, taking Z → ∞ first. (Lean)

OpenAI, in its public catalogue of maths results · preprint, not peer reviewed

The papers and the claim →

Chapter 74: about the problem

Mathematical physics·OpenAI Math·Result 264·from 25:20

Strong cosmic censorship near two-ended Kerr data

Proves local strong cosmic censorship near each fixed rotating subextremal Kerr bridge. A dense Gδ subset of a weighted smooth neighborhood of smooth complete two-ended asymptotically flat vacuum data has full maximal globally hyperbolic developments with no future continuous nondegenerate extension whose weak connection is locally square-integrable. No symmetry is imposed; extensions need not satisfy the vacuum equations.

OpenAI, in its public catalogue of maths results · preprint, not peer reviewed

The papers and the claim →

Chapter 75: about the problem

Mathematical physics·OpenAI Math·Result 265·from 25:41

Area laws and tensor networks for two-dimensional gapped systems

Proves an entropy area law for unique ground states of finite-range Hamiltonians on arbitrary finite induced square-lattice domains, using only a uniform full-system spectral gap and bounds on the local interactions. On open L× L squares, uniformly gapped nearest-neighbor ground states also admit projected entangled-pair state approximations with polynomial bond dimension and global vector error at most L−1.

OpenAI, in its public catalogue of maths results · preprint, not peer reviewed

The papers and the claim →

Chapter 76: about the problem

Mathematical physics·OpenAI Math·Result 267·from 26:03

Positive-temperature Bose–Einstein condensation and exact quantum depletion

Proves Bose–Einstein condensation for the exact canonical Gibbs state of the three-dimensional hard-sphere gas: each fixed exclusion distance and sufficiently small fixed density admit a strictly positive temperature, independent of volume, with positive condensate fraction in the thermodynamic limit. At zero temperature, proves the Bogoliubov leading quantum-depletion law for hard spheres and fixed bounded nonnegative radial finite-range potentials of positive scattering length, taking the thermodynamic limit before the dilute limit. (Lean)

OpenAI, in its public catalogue of maths results · preprint, not peer reviewed

The papers and the claim →

Chapter 77: about the problem

Mathematical physics·OpenAI Math·Result 268·from 26:24

The spin-one Haldane gap

Proves the spin-one Haldane gap conjecture for the pure antiferromagnetic Heisenberg chain on even periodic rings: the spectral gap stays uniformly positive as the chain grows. A companion establishes a gap for odd open chains with endpoint field h=3/5 and gives boundary-selected infinite-volume states with topological index −1.

OpenAI, in its public catalogue of maths results · preprint, not peer reviewed

The papers and the claim →

Chapter 78: about the problem

Mathematical physics·OpenAI Math·Result 270·from 26:45

Threshold and positive-energy bound states of the BFSS matrix model

Proves that the undeformed relative SU(N) BFSS model has exactly one normalizable zero-energy state for every finite N ≥ 2, resolving the threshold-bound-state conjecture. For SU(2), a companion proves infinitely many normalizable positive-energy eigenstates with unbounded energies, contradicting the original BFSS paper's exclusion of additional bound states at N = 2.

OpenAI, in its public catalogue of maths results · preprint, not peer reviewed

The papers and the claim →

Chapter 79: about the problem

Mathematical physics·OpenAI Math·Result 273·from 27:05

The entropy photon-number inequality

Proves the entropy photon-number inequality for beam-splitter mixing of two independent finite-energy bosonic inputs in any finite number of modes: the output's entropy photon number is at least the transmissivity-weighted average of the inputs'. Arbitrary entanglement within each input is allowed, and product thermal inputs attain equality even when their entropies differ. (Lean)

OpenAI, in its public catalogue of maths results · preprint, not peer reviewed

The papers and the claim →

Chapter 80: about the problem

Mathematical physics·OpenAI Math·Result 275·from 27:25

QMA-hardness of continuum Coulomb energy

Proves QMA-hardness of approximating the electronic Coulomb energy infimum in three dimensions, minimizing over the full spinful fermionic continuum space. Deterministic polynomial-time reductions work even with only unit-charge nuclei at distinct rational positions, polynomially many electrons and an energy-threshold separation of at least one. (Lean)

OpenAI, in its public catalogue of maths results · preprint, not peer reviewed

The papers and the claim →

Chapter 81: about the problem

Mathematical physics·OpenAI Math·Result 278·from 27:46

Failure of Kohn–Sham ensemble representation

Constructs a three-electron Coulomb molecule with two equal positive-integer-charge nuclei whose absolute ground-state density has no noninteracting ground-state ensemble representation by a single real spin-independent local potential in L3/2(ℝ3)+L∞(ℝ3). This disproves Kohn–Sham ensemble representability for that potential class; the required nuclear charge is specified nonnumerically.

OpenAI, in its public catalogue of maths results · preprint, not peer reviewed

The papers and the claim →

Chapter 82: about the problem

Mathematical physics·OpenAI Math·Result 281·from 28:07

QAOA attains the SK optimum in the thermodynamic-first limit

Proves that QAOA approaches the ground-state energy of the Gaussian zero-field Sherrington–Kirkpatrick model when system size tends to infinity before circuit depth. For every accuracy, finite depth and deterministic angles independent of size and disorder achieve the required limiting expected energy per spin. This also yields leading-order optimal expected MaxCut values on large-degree random regular graphs, with size tending to infinity before degree. (Lean)

OpenAI, in its public catalogue of maths results · preprint, not peer reviewed

The papers and the claim →

Chapter 83: about the problem

Mathematical physics·OpenAI Math·Result 282·from 28:29

From scale symmetry to local conformal symmetry in four-dimensional QFT

Under the stated bounded-local-net and field-reconstruction hypotheses, proves that scale symmetry implies local conformal symmetry for four-dimensional unitary positive-energy theories with a discrete bounded-below scaling spectrum of finite multiplicity, finite scaling support and a physical local scale current. The stress tensor has a traceless improvement with unchanged spacetime charges. The conclusion concerns local Ward identities, not a global conformal action on the whole net.

OpenAI, in its public catalogue of maths results · preprint, not peer reviewed

The papers and the claim →

Chapter 84: about the problem

Mathematical physics·OpenAI Math·Result 283·from 28:49

Polynomial-time unitary synthesis from a Boolean oracle

Solves the constant-error Aaronson–Kuperberg unitary synthesis problem: a uniform polynomial-size quantum oracle circuit approximates every n-qubit unitary channel within diamond-norm error 1/2, after a suitable Boolean oracle is chosen. Gates, qubits, oracle calls and query length are polynomially bounded. The target-dependent oracle may have an unrestricted truth table; its efficient classical construction is not asserted.

OpenAI, in its public catalogue of maths results · preprint, not peer reviewed

The papers and the claim →

Topics

OpenAI mathOpenAIAI proofAI mathematicsmathsGradient DamageTheoretical computer scienceDynamical systems and ergodic theoryCombinatoricsAlgebraProbability and statistical mechanicsMathematical logicGroup theoryMathematical physics