# Gradient Damage

> Maths you can see. Equations you can hear. An independent YouTube channel and site: 3D maths animations with synthesized sound, and one page for each of the 372 mathematical results OpenAI says its AI proved (its public catalogue, github.com/openai/math, September to October 2026). Not affiliated with OpenAI.

Every result page quotes OpenAI's own one-paragraph summary, links the preprint PDFs with their abstracts, states that the result is a preprint and not peer reviewed, and embeds the channel's Short once it is public. Write-ups explain the problem, its history, what OpenAI claims and what is still unchecked. Video pages carry the YouTube description, chapters and, where uploaded, the transcript. Quote with a link; animations illustrate results and are never proofs.

## Every result (372)

### Theoretical computer science

- [The Unique Games Conjecture and optimal approximation thresholds](https://gradientdamage.com/openai-math/unique-games-conjecture-and-optimal-approximation-thresholds/) (result 102): OpenAI claims: Proves Khot's Unique Games Conjecture. Independent direct reductions also establish NP-hardness, on unweighted graphs, of approximation beyond the Goemans–Williamson ratio for Max-Cut, below factor two for Vertex Cover, and within any fixed constant factor for Min-UnCut and directed feedback vertex set. These direct proofs use established PCP and Label Cover hardness results. (Lean)
- [Exact derandomization of logarithmic space: L=RL=BPL](https://gradientdamage.com/openai-math/exact-derandomization-of-logarithmic-space-l-rl-bpl/) (result 103): OpenAI claims: Proves L=RL=BPL, resolving derandomization for bounded-error logarithmic-space computation. An effective compiler converts each randomized polynomial-time logarithmic-space machine deciding a language with one-sided or two-sided error into a deterministic logarithmic-space decider with explicit polynomial running-time bounds. (Lean)
- [Quasipolynomial algorithms for mean-payoff, stochastic and parity games](https://gradientdamage.com/openai-math/quasipolynomial-algorithms-for-mean-payoff-stochastic-and-parity-games/) (result 104): OpenAI claims: Gives deterministic algorithms using 2^(O((log(L+2))²)) bit operations, for complete binary input length L, for ordinary mean-payoff games and two separate extensions. They compute exact values and optimal positional strategies in ordinary games, the nonnegative expectation-of-liminf value set in turn-based stochastic games, and the winning set for nonnegative liminf mean payoff conjoined with parity. Signed rewards, rational chance probabilities, and parity priorities are unrestricted and binary-encoded. (Lean)
- [Perfect completeness for 2-to-1 games](https://gradientdamage.com/openai-math/perfect-completeness-for-2-to-1-games/) (result 105): OpenAI claims: Proves Khot's 2-to-1 Games Conjecture with perfect completeness: for every fixed rational δ ∈ (0,1), it is NP-hard to distinguish satisfiable games from games whose optimum is at most δ, on explicit unweighted instances. The alphabet depends only on δ, and every right-hand label has exactly two preimages under each constraint map. (Lean)
- [Hardness of coloring three-colorable graphs](https://gradientdamage.com/openai-math/hardness-of-coloring-three-colorable-graphs/) (result 106): OpenAI claims: It is NP-hard to color a three-colorable graph using any fixed number c ≥ 3 of colors. More strongly, for every fixed 0 < δ < 1/3, a deterministic polynomial-time reduction from 3SAT produces simple unweighted graphs that are three-colorable in the satisfiable case and have no independent set of size δ n otherwise, where n is the number of vertices. (Lean)
- [Matrix multiplication with exponent at most 9/4](https://gradientdamage.com/openai-math/matrix-multiplication-with-exponent-at-most-9-4/) (result 107): OpenAI claims: Proves ω ≤ 9/4 over ℂ, giving O_ε(n^(9/4+ε)) arithmetic operations for square matrix multiplication. In characteristic zero, some inner dimension na with a > 0.465 permits n²⁺ᵒ⁽¹⁾ rectangular multiplication. Further square bounds give ω < 2.258 outside finitely many positive characteristics and ω < 2.371054886006746 over every fixed field. (Lean)
- [A cubic permanent–determinant lower bound](https://gradientdamage.com/openai-math/cubic-permanent-determinant-lower-bound/) (result 108): OpenAI claims: Proves an Ω(n³) lower bound for the border determinantal complexity of the n× n permanent over ℂ. Even coefficientwise limits of determinants of affine-linear matrices require matrix size at least cn³, for an absolute c > 0 and all sufficiently large n; the same bound therefore holds for exact representations. (Lean)
- [Integer multiplication below n log n](https://gradientdamage.com/openai-math/integer-multiplication-below-n-log-n/) (result 109): OpenAI claims: Multiplies two n-bit integers exactly at every input length in deterministic worst-case time O(n(log n)^(1-κ)), with κ=2⁻¹⁸², on one fixed finite-alphabet Turing machine with finitely many one-dimensional tapes. This disproves the Schönhage–Strassen n log n optimality conjecture in the ordinary multitape bit model.
- [Optimal-order randomized k-server on arbitrary metrics](https://gradientdamage.com/openai-math/optimal-order-randomized-k-server-on-arbitrary-metrics/) (result 110): OpenAI claims: Establishes a randomized competitive ratio O(log²(k+1)) for k-server on every metric space, matching the worst-case lower-bound order. One policy serves every finite oblivious request sequence, including on infinite unbounded metrics. On finite rational metrics, a uniform implementation has polynomial preprocessing and per-request bit cost in the input length and log(t+1) at request t, with a finite instance-dependent additive movement constant. (Lean)
- [One-sample matroid prophet inequalities against an almighty adversary](https://gradientdamage.com/openai-math/one-sample-matroid-prophet-inequalities-against-an-almighty-adversary/) (result 111): OpenAI claims: For every finite matroid known in advance, gives a distribution-independent online rule using one independent sample per element and earning a universal constant fraction of the expected offline optimum. Values are independent and nonnegative, with finite expected optimum. The guarantee holds even when the arrival-order adversary sees all samples, values, and the rule's entire random seed; no polynomial-time implementation is asserted. (Lean)
- [Beyond the square-root exponent for depth-three circuits](https://gradientdamage.com/openai-math/beyond-the-square-root-exponent-for-depth-three-circuits/) (result 112): OpenAI claims: Constructs a single language in deterministic polynomial time whose n-bit membership function requires 2^(ω(√n)) total gates in unbounded-fan-in OR–AND–OR circuits, at every sufficiently large input length. This crosses the square-root-exponent threshold for explicit depth-three Boolean circuit lower bounds. (Lean)
- [Approximate counting and entropy of perfect matchings](https://gradientdamage.com/openai-math/approximate-counting-and-entropy-of-perfect-matchings/) (result 113): OpenAI claims: Gives a fully polynomial randomized approximation scheme for counting perfect matchings in arbitrary finite simple graphs, with exact detection of zero counts. Also proves the perfect-matching entropy conjecture of Anari, Oveis Gharan, and Vinzant, bounding the maximum entropy of a matching law at every feasible edge-marginal vector in a loopless labelled multigraph, including boundary points. (Lean)
- [Approximate counting of common integer polymatroid bases](https://gradientdamage.com/openai-math/approximate-counting-of-common-integer-polymatroid-bases/) (result 114): OpenAI claims: Gives a fully polynomial randomized approximation scheme for counting common integer bases of two integral polymatroids of equal total rank, supplied by exact rank-value oracles. Capacities are binary-encoded, each integer vector counts once, and oracle calls and bit operations outside the oracles are polynomial on every execution. For matroids presented by independence oracles, the results also cover common independent sets of prescribed, unrestricted, or maximum cardinality, even when the ranks differ. (Lean)
- [Sampling and counting contingency tables with arbitrary margins](https://gradientdamage.com/openai-math/sampling-and-counting-contingency-tables-with-arbitrary-margins/) (result 115): OpenAI claims: For nonnegative integer matrices with prescribed row and column sums, gives exact uniform sampling in expected polynomial bit time and almost-uniform sampling in worst-case polynomial bit time. The dimensions and binary-encoded margins are unrestricted. Also gives a fully polynomial randomized approximation scheme for counting such tables with arbitrary individual cell bounds, including structural zeros, with polynomial cost on every execution. (Lean)
- [Uniform black-box noncommutative identity testing across characteristics](https://gradientdamage.com/openai-math/uniform-black-box-noncommutative-identity-testing-across-characteristics/) (result 116): OpenAI claims: For each characteristic, constructs in deterministic polynomial bit time a polynomial-dimensional matrix tuple detecting every nonzero division-free noncommutative formula of bounded size over any field of that characteristic. Rational formulas over ℚ also admit polynomial-size hitting lists whenever they have a defined rational-matrix evaluation. (Lean)
- [Uniform sparsest cut: hardness and semidefinite gaps](https://gradientdamage.com/openai-math/uniform-sparsest-cut-hardness-and-semidefinite-gaps/) (result 117): OpenAI claims: Proves that approximating Uniform Sparsest Cut within any fixed constant factor is NP-hard, even with nonnegative rational capacities and unit demands. The Goemans–Linial semidefinite relaxation also has integrality gaps of order at least √(log n)/(log log n)³, approaching the square-root-logarithmic upper bound. (Lean)
- [Bin packing and unbounded configuration-LP gaps](https://gradientdamage.com/openai-math/bin-packing-and-unbounded-configuration-lp-gaps/) (result 118): OpenAI claims: Disproves the modified integer round-up conjecture of Scheithauer and Terno: the integral bin-packing optimum can exceed its configuration linear-programming value by an arbitrarily large additive constant. Approximating the optimum within any fixed additive constant is also NP-hard, even when every item exceeds 1/6 and each bin holds at most five items. (Lean)
- [The Courtade–Kumar and Hellinger conjectures](https://gradientdamage.com/openai-math/courtade-kumar-and-hellinger-conjectures/) (result 119): OpenAI claims: Proves the Courtade–Kumar conjecture: among Boolean functions of independent uniform bits, a single coordinate retains the most mutual information after independent bit-flip noise. A stronger theorem treats randomized binary summaries at fixed initial information. The Hellinger conjecture is also proved for every Boolean output bias and noise correlation. (Lean)
- [Almost-linear-time exact matching and prescribed-degree factors in general graphs](https://gradientdamage.com/openai-math/almost-linear-time-exact-matching-and-prescribed-degree-factors-in-general-graphs/) (result 120): OpenAI claims: Gives a randomized algorithm finding an exact maximum-cardinality matching in any simple undirected graph in (n+m)¹⁺ᵒ⁽¹⁾ word time, with success probability at least 2/3. The time bound holds on every computation path. The same guarantees apply to finding a spanning subgraph with prescribed admissible vertex degrees, or deciding that none exists.
- [Almost-linear approximation of edit distance](https://gradientdamage.com/openai-math/almost-linear-approximation-of-edit-distance/) (result 121): OpenAI claims: For every fixed rational ε ∈ (0,1), gives a randomized (1+ε) approximation to unit-cost edit distance in worst-case expected time N¹⁺ᵒ⁽¹⁾, with success probability at least 2/3. The strings have total length N and polynomially bounded integer symbols. This is an asymptotic guarantee at fixed accuracy. (Lean)
- [Quantitative trace-reconstruction bounds with a uniform decoder](https://gradientdamage.com/openai-math/quantitative-trace-reconstruction-bounds-with-a-uniform-decoder/) (result 122): OpenAI claims: At every fixed deletion probability in (0,1), reconstructing an arbitrary length-n binary string requires n^(Ω(log log n)) independent traces, ruling out polynomial-sample reconstruction. A uniform decoder achieves quasipolynomial sample and running-time bounds for known fixed rational retention probabilities. When the deletion probability is at most n^(-ε) for fixed ε > 0, both bounds become polynomial in the input and parameter encoding. (Lean)
- [Polynomial-time scheduling on three identical machines](https://gradientdamage.com/openai-math/polynomial-time-scheduling-on-three-identical-machines/) (result 124): OpenAI claims: Resolves the three-processor unit-job scheduling problem of Garey and Johnson: a deterministic polynomial-time algorithm minimizes makespan for nonpreemptive unit-length jobs with arbitrary precedence constraints on three identical parallel machines. For an explicitly given precedence graph, it decides deadline feasibility exactly and constructs a feasible schedule. (Lean)
- [The metric k-median approximation threshold and recovery](https://gradientdamage.com/openai-math/metric-k-median-approximation-threshold-and-recovery/) (result 125): OpenAI claims: Gives a deterministic polynomial-time (1+2/e+ε)-approximation for finite rational metric k-median with specified candidate facilities, for every fixed ε > 0. Assuming P ≠ NP, the optimal infimum approximation factor is 1+2/e. (Lean)
- [Exponential semidefinite complexity of perfect matching](https://gradientdamage.com/openai-math/exponential-semidefinite-complexity-of-perfect-matching/) (result 126): OpenAI claims: Proves that every exact semidefinite lift of the perfect matching polytope has exponential size, answering Rothvoss's polynomial-size lift question negatively. The bound holds even for the positive semidefinite rank of its odd-cut slack matrix after any fixed shift 0 < ρ < 1, allowing arbitrary real positive semidefinite factors. (Lean)
- [Average sensitivity of polynomial threshold functions](https://gradientdamage.com/openai-math/average-sensitivity-of-polynomial-threshold-functions/) (result 127): OpenAI claims: Proves that a degree-at-most-d polynomial threshold function on the uniform n-dimensional Boolean cube has average sensitivity at most 8d√n, uniformly for 1 ≤ d ≤ n. Average sensitivity counts expected output changes under single-bit flips. This establishes the asymptotic Gotsman–Linial conjecture, allowing polynomial zeros with sign (0)=1. (Lean) Video: https://www.youtube.com/shorts/4vB_rSP3FgQ.
- [A factor-two approximation for shortest common superstring](https://gradientdamage.com/openai-math/factor-two-approximation-for-shortest-common-superstring/) (result 128): OpenAI claims: Gives a deterministic polynomial-time algorithm constructing a common superstring of length at most twice the optimum for every finite family of explicitly represented strings. The running time is polynomial in the full encoded input length, including symbol labels. (Lean)
- [Exponential state costs for two-way automata](https://gradientdamage.com/openai-math/exponential-state-costs-for-two-way-automata/) (result 129): OpenAI claims: Proves exponential lower bounds both for complementing two-way nondeterministic finite automata and for simulating one-way nondeterministic automata by two-way deterministic ones. The latter resolves the Sakoda–Sipser state-succinctness conjecture over growing finite alphabets; both results rule out polynomial state bounds independent of alphabet size. (Lean)
- [Exact Fourier transforms below n log n](https://gradientdamage.com/openai-math/exact-fourier-transforms-below-n-log-n/) (result 130): OpenAI claims: Gives a deterministic length-n discrete Fourier transform algorithm using O(n(log n)^(1-δ)) operations for every n, with explicit δ=10⁻¹³. The model uses exact complex arithmetic, unrestricted coefficients and a supplied root of unity, and counts scalar preparation and logarithmic-word indexing. (Lean)
- [Rapid mixing of graph switches for every degree sequence](https://gradientdamage.com/openai-math/rapid-mixing-of-graph-switches-for-every-degree-sequence/) (result 131): OpenAI claims: Resolves the simple-undirected Kannan–Tetali–Vempala conjecture: the lazy edge-switch chain mixes in O(n⁸) time for every graphical labeled degree sequence. The same degree-constrained graphs can also be sampled exactly uniformly by an almost-surely terminating algorithm with expected polynomial bit running time. (Lean)
- [A superquadratic separation of sensitivity and block sensitivity](https://gradientdamage.com/openai-math/superquadratic-separation-of-sensitivity-and-block-sensitivity/) (result 132): OpenAI claims: Constructs total Boolean functions with block sensitivity bs (f) ≥ s(f)^α for a fixed α > 2, disproving the quadratic strengthening of the Sensitivity Conjecture. Here s(f) counts influential individual-bit flips, while block sensitivity allows disjoint groups of bits to change together. (Lean)
- [The computational complexity of Weisfeiler–Leman refinement](https://gradientdamage.com/openai-math/computational-complexity-of-weisfeiler-leman-refinement/) (result 133): OpenAI claims: 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)
- [Generalized star height at most three](https://gradientdamage.com/openai-math/generalized-star-height-at-most-three/) (result 134): OpenAI claims: Every regular language over a finite alphabet has a generalized regular expression with at most three nested Kleene stars, allowing union, concatenation and complement over the same alphabet. This establishes an absolute bound independent of automaton size, resolving the uniform-boundedness version of the generalized star-height problem. (Lean)
- [Homogeneous depth-five lower bounds for iterated matrix multiplication](https://gradientdamage.com/openai-math/homogeneous-depth-five-lower-bounds-for-iterated-matrix-multiplication/) (result 135): OpenAI claims: 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)
- [A quasilinear PCP theorem for PPAD](https://gradientdamage.com/openai-math/quasilinear-pcp-theorem-for-ppad/) (result 136): OpenAI claims: 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)ᴼ⁽¹⁾ 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.
- [One-tape time simulation in two-fifths-power space](https://gradientdamage.com/openai-math/one-tape-time-simulation-in-two-fifths-power-space/) (result 137): OpenAI claims: Determines the halting and finite-control outcome of a fixed deterministic one-writable-tape machine up to time T using O(T^(2/5) log^C(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)
- [Subset Sum in O(2^(0.49n)) time](https://gradientdamage.com/openai-math/subset-sum-in-o-2-0-49n-time/) (result 138): OpenAI claims: Gives a uniform randomized classical algorithm for worst-case Subset Sum in ordinary O(2^(0.49n)) word-RAM time on polynomial-bit inputs, where n counts the integers. The time bound holds on every execution and success probability is at least 2/3 on every input. Inputs may repeat positive integers; words have O(n+b) bits for maximum input bit length b.
- [Subpolynomial query complexity for log-concave sampling](https://gradientdamage.com/openai-math/subpolynomial-query-complexity-for-log-concave-sampling/) (result 139): OpenAI claims: For C2 potentials with a supplied minimizer and I ⪯ ∇²V ⪯ 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)
- [Memory–sample lower bounds for noiseless Gaussian regression](https://gradientdamage.com/openai-math/memory-sample-lower-bounds-for-noiseless-gaussian-regression/) (result 140): OpenAI claims: For fixed A > 0, a one-pass learner with Ad² 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)
- [Existential–universal real sentences in the counting hierarchy](https://gradientdamage.com/openai-math/existential-universal-real-sentences-in-the-counting-hierarchy/) (result 141): OpenAI claims: 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.
- [Deterministic polynomial factorization over prime fields](https://gradientdamage.com/openai-math/deterministic-polynomial-factorization-over-prime-fields/) (result 142): OpenAI claims: Gives a uniform deterministic algorithm that completely factors every nonzero dense degree-n polynomial over a prime field 𝔽p, including multiplicities, in bit complexity polynomial in (n+1) log p. The prime is supplied in binary. No randomness, integer-factorization or primitive-root oracle, or GRH assumption is required.

### Combinatorics

- [A counterexample to periodic tiling in dimension three](https://gradientdamage.com/openai-math/counterexample-to-periodic-tiling-in-dimension-three/) (result 155): OpenAI claims: Constructs a finite translational tile in ℤ3 that tiles space but admits no fully periodic tiling, disproving the periodic tiling conjecture in the smallest possible lattice dimension. Its unit-cube thickening gives the same counterexample in ℝ3, even with arbitrary real translation vectors. (Lean)
- [Borsuk's conjecture fails in dimension nine](https://gradientdamage.com/openai-math/borsuks-conjecture-fails-in-dimension-nine/) (result 156): OpenAI claims: 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)
- [Graph coloring, clique minors, and Colin de Verdière invariants](https://gradientdamage.com/openai-math/graph-coloring-clique-minors-and-colin-de-verdiere-invariants/) (result 157): OpenAI claims: Disproves Hadwiger's conjecture even for fractional coloring: arbitrarily large finite simple graphs with independence number at most two satisfy χ_f(G) > h(G), where h(G) is the largest clique-minor order. Also disproves the fractional Colin de Verdière chromatic bound χ_f(G) ≤ μ(G)+1. In the positive direction, every finite nonempty graph satisfies χₗᵢₛₜ(G) ≤ C h(G) for a universal constant C. (Lean)
- [The Euclidean plane cannot be colored with five colors](https://gradientdamage.com/openai-math/euclidean-plane-cannot-be-colored-with-five-colors/) (result 158): OpenAI claims: Proves that every five-coloring of the Euclidean plane has a monochromatic pair at distance one, with no restriction on the color classes. This advances the Hadwiger–Nelson problem: together with the classical seven-coloring, only six and seven remain possible chromatic numbers of the plane. (Lean) Video: https://www.youtube.com/shorts/FFsKkuXhQKs.
- [Erdős’s reciprocal-sum conjecture and quasipolynomial Szemerédi bounds](https://gradientdamage.com/openai-math/erdoss-reciprocal-sum-conjecture-and-quasipolynomial-szemeredi-bounds/) (result 159): OpenAI claims: Proves Erdős's conjecture that every set of positive integers with divergent reciprocal sum contains arithmetic progressions of every finite length. Quantitatively, for each fixed k ≥ 3, every subset of {1,…,N} with no nonconstant k-term progression has size at most CₖN exp[-cₖ(log N)^(εₖ)], with positive constants depending only on k. (Lean) Video: https://www.youtube.com/shorts/Fx1zddsBSFg.
- [Superexponential van der Waerden numbers](https://gradientdamage.com/openai-math/superexponential-van-der-waerden-numbers/) (result 160): OpenAI claims: Resolves Erdős's superexponential-growth question for van der Waerden numbers. If Wᵣ(k) is the least interval length forcing a monochromatic k-term progression in every r-coloring, then Wᵣ(k) > k^(ck⌊log₂ r⌋) for an absolute c > 0, all r ≥ 2 and sufficiently large k, uniformly in r. In particular, Wᵣ(k)^(1/k) → ∞ for each fixed r. (Lean)
- [Counterexamples to Sidorenko’s conjecture and the forcing conjecture](https://gradientdamage.com/openai-math/counterexamples-to-sidorenkos-conjecture-and-the-forcing-conjecture/) (result 161): OpenAI claims: 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)
- [Counterexamples to Ryser’s covering conjecture](https://gradientdamage.com/openai-math/counterexamples-to-rysers-covering-conjecture/) (result 162): OpenAI claims: 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)
- [Hindman’s finite sums and products conjecture](https://gradientdamage.com/openai-math/hindmans-finite-sums-and-products-conjecture/) (result 164): OpenAI claims: 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.
- [The Harary–Hill and Zarankiewicz crossing-number formulas](https://gradientdamage.com/openai-math/harary-hill-conjecture/) (result 165): OpenAI claims: Resolves the Harary–Hill conjecture and Turán's brickyard problem in the Zarankiewicz formulation, determining the crossing numbers of every complete and complete bipartite graph. The result proves the optimality of the classical drawings among all plane drawings with continuous edge arcs. (Lean) Write-up. Video: https://www.youtube.com/shorts/yrXjLp8nfqo.
- [The higher-dimensional Erdős distinct-distances conjecture](https://gradientdamage.com/openai-math/higher-dimensional-erdos-distinct-distances-conjecture/) (result 166): OpenAI claims: For every fixed d ≥ 3, any n ≥ 2 distinct points in ℝd determine at least c_dn^(2/d) distinct distances, with c_d > 0 depending only on dimension. This matches the integer-grid order and resolves the higher-dimensional Erdős distinct-distances conjecture with a constant-factor bound.
- [Planar distinct distances and unit-distance bounds](https://gradientdamage.com/openai-math/planar-distinct-distances-and-unit-distance-bounds/) (result 167): OpenAI claims: 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 n^(1-ε) distinct nonzero distances. A complementary theorem bounds the number of unit-distance pairs by O(n^(4/3-δ)) for an absolute δ > 0. (Lean)
- [Combinatorial invariance of Kazhdan–Lusztig polynomials](https://gradientdamage.com/openai-math/combinatorial-invariance-of-kazhdan-lusztig-polynomials/) (result 168): OpenAI claims: 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)
- [Shareshian–Wachs elementary positivity](https://gradientdamage.com/openai-math/shareshian-wachs-elementary-positivity/) (result 169): OpenAI claims: 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)
- [Sharp logarithmic exponents for off-diagonal Ramsey numbers](https://gradientdamage.com/openai-math/sharp-logarithmic-exponents-for-off-diagonal-ramsey-numbers/) (result 170): OpenAI claims: For every fixed integer s ≥ 5, proves r(s,t)=tˢ⁻¹/(log t)ˢ⁻²⁺ᵒ⁽¹⁾ as t → ∞, determining the logarithmic exponent and matching the classical upper bound at that scale. Here r(s,t) is the least number of vertices forcing an s-clique or a t-vertex independent set. (Lean) Video: https://www.youtube.com/shorts/De6BOflEsvM.
- [The hypercube Ramsey conjecture](https://gradientdamage.com/openai-math/hypercube-ramsey-conjecture/) (result 171): OpenAI claims: Resolves the Burr–Erdős hypercube Ramsey conjecture: the two-color Ramsey number of the n-dimensional cube is Θ(2ⁿ). Thus every red-blue coloring of a complete graph on a universal constant times the cube's number of vertices contains a monochromatic copy of the cube. Video: https://www.youtube.com/shorts/0v6aVMcmIcg.
- [Classification of finite Euclidean Ramsey configurations](https://gradientdamage.com/openai-math/classification-of-finite-euclidean-ramsey-configurations/) (result 172): OpenAI claims: Classifies finite point configurations that occur monochromatically, at their original scale, in every finite coloring of sufficiently high-dimensional Euclidean space. The characterization is an algebraic condition over the coordinate field. It also disproves the Leader–Russell–Walters conjecture that every such configuration is a subset of a finite transitive set. (Lean)
- [Seymour’s second-neighborhood conjecture](https://gradientdamage.com/openai-math/seymours-second-neighborhood-conjecture/) (result 173): OpenAI claims: 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)
- [Deterministic construction of strong thin spanning trees](https://gradientdamage.com/openai-math/deterministic-construction-of-strong-thin-spanning-trees/) (result 174): OpenAI claims: Resolves the strong thin-tree conjecture constructively. Every finite loopless k-edge-connected multigraph on at least two vertices has a spanning tree containing at most a universal C/k fraction of the edges of every cut. Such a tree can be found deterministically in polynomial time, even with binary-encoded parallel-edge multiplicities. (Lean)
- [Talagrand’s expectation thresholds, discrete convexity, and graph decompositions](https://gradientdamage.com/openai-math/talagrands-expectation-thresholds-discrete-convexity-and-graph-decompositions/) (result 175): OpenAI claims: 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)
- [The second Kahn–Kalai conjecture with an edge-count bound](https://gradientdamage.com/openai-math/second-kahn-kalai-conjecture-with-an-edge-count-bound/) (result 176): OpenAI claims: 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 p_E(n,H)(1+log₂ h), with universal C. Here p_E is the least density at which every subgraph of H has expected copy count at least 1/2. (Lean)
- [Bounded-degree coboundary expanders](https://gradientdamage.com/openai-math/bounded-degree-coboundary-expanders/) (result 177): OpenAI claims: 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)
- [Deterministic nonbipartite Ramanujan graphs in every fixed degree](https://gradientdamage.com/openai-math/deterministic-nonbipartite-ramanujan-graphs-in-every-fixed-degree/) (result 178): OpenAI claims: For every fixed d ≥ 3, constructs a simple d-regular nonbipartite Ramanujan graph on every sufficiently large even number n of vertices, with every nonconstant adjacency eigenvalue strictly between -2√(d-1) and 2√(d-1). A deterministic algorithm outputs the full adjacency list in polynomial bit time, with exponent depending on d.
- [The circulant Hadamard and Barker-sequence conjectures](https://gradientdamage.com/openai-math/circulant-hadamard-and-barker-sequence-conjectures/) (result 179): OpenAI claims: 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)
- [Barnette’s Hamiltonian-cycle conjecture](https://gradientdamage.com/openai-math/barnettes-hamiltonian-cycle-conjecture/) (result 180): OpenAI claims: Proves that every finite simple cubic bipartite planar 3-vertex-connected graph has a Hamiltonian cycle, resolving Barnette's conjecture. Equivalently, every three-edge path in a finite simple cubic 3-vertex-connected bipartite Pfaffian graph lies in a Hamiltonian cycle. (Lean) Video: https://www.youtube.com/shorts/pn4CFp88RlM.
- [The Erdős–Gallai cycle-decomposition conjecture](https://gradientdamage.com/openai-math/erdos-gallai-cycle-decomposition-conjecture/) (result 181): OpenAI claims: Proves that the edges of every finite simple undirected graph on n vertices can be partitioned into at most Cn simple cycles and single edges, for an absolute constant C. This resolves the Erdős–Gallai cycle-decomposition conjecture, bounding the number of pieces linearly even for dense graphs. (Lean) Video: https://www.youtube.com/shorts/vbINiO4LewQ.
- [Power savings for intersective polynomial differences and prime arguments](https://gradientdamage.com/openai-math/power-savings-for-intersective-polynomial-differences-and-prime-arguments/) (result 182): OpenAI claims: For every fixed intersective integer polynomial h of degree k ≥ 2 with positive leading coefficient, proves that a subset of {1,…,N} avoiding nonzero values h(1),h(2),… as differences has size Oₕ(N^(1-cₖ)), with cₖ > 0 depending only on degree. Here intersective means having a root modulo every modulus. For prime arguments, a power saving also holds when h has a unit root modulo every modulus, with exponent allowed to depend on h. (Lean)
- [Power savings for planar halving lines and k-sets](https://gradientdamage.com/openai-math/power-savings-for-planar-halving-lines-and-k-sets/) (result 183): OpenAI claims: Improves the planar halving-line bound to O(n^(4/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-ε₀)) strictly separable k-subsets for 1 ≤ k ≤ n/2, with an absolute ε₀ > 0. The constants and positive exponents are nonquantitative. (Lean)
- [Correspondence coloring with a fixed forbidden subgraph](https://gradientdamage.com/openai-math/correspondence-coloring-with-a-fixed-forbidden-subgraph/) (result 184): OpenAI claims: Proves the Alon–Krivelevich–Sudakov coloring conjecture in correspondence-coloring form: graphs avoiding any fixed subgraph F need O_F(Δ/log Δ) colors when their maximum degree Δ is sufficiently large. Also proves the Ajtai–Erdős–Komlós–Szemerédi independence conjecture: for fixed r ≥ 4, every n-vertex Kr-free graph of average degree d ≥ 2 has an independent set of size Ωᵣ(n log d/d). (Lean)
- [Counterexamples to infinite matroid intersection and packing/covering](https://gradientdamage.com/openai-math/counterexamples-to-infinite-matroid-intersection-and-packing-covering/) (result 185): OpenAI claims: Disproves the unrestricted infinite matroid intersection and packing/covering conjectures in ZFC, using two self-dual partitional matroids on a countably infinite ground set. The same examples answer Joó’s partitional-matroid question negatively. They are neither finitary nor cofinitary, so Nash-Williams’ original finitary conjecture remains outside the result. (Lean)
- [Uniform influence and sharp thresholds for graph and hypergraph properties](https://gradientdamage.com/openai-math/uniform-influence-and-sharp-thresholds-for-graph-and-hypergraph-properties/) (result 186): OpenAI claims: Proves the Friedgut–Kalai threshold-width conjectures for graphs and fixed-uniformity hypergraphs. For fixed 0 < ε < 1/2, every nontrivial increasing relabeling-invariant property crosses from probability ε to 1-ε within width O((log n)⁻²) for graphs and Oᵣ((log n)^(-r/(r-1))) for r-uniform hypergraphs, r ≥ 3. The hypergraph influence bound also applies to nonmonotone properties. (Lean)
- [Snaky in 21 Maker moves](https://gradientdamage.com/openai-math/snaky-in-21-maker-moves/) (result 187): OpenAI claims: Settles the Snaky achievement problem: Maker can force the six-cell Snaky shape within 21 of its own moves on the initially empty infinite square board. Maker moves first, each player claims one free cell per turn, and translations, rotations and reflections count as wins. (Lean)
- [The sharp terminal leave in random triangle removal](https://gradientdamage.com/openai-math/sharp-terminal-leave-in-random-triangle-removal/) (result 188): OpenAI claims: Starting from the complete graph on n vertices, repeatedly delete a uniformly chosen remaining triangle. The terminal edge count is asymptotic to n^(3/2)/(2√2), with mean-square convergence after normalization by n3/2. This proves the triangle case of the Joos–Kühn sharp-constant conjecture. (Lean)
- [Cycle–clique Ramsey numbers](https://gradientdamage.com/openai-math/cycle-clique-ramsey-numbers/) (result 189): OpenAI claims: Proves the Erdős–Faudree–Rousseau–Schelp conjecture: R(Cₘ,Kₙ)=(m-1)(n-1)+1 for every m ≥ n ≥ 3, except R(C₃,K₃)=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)
- [Polynomial removal fails for ordered binary matrices](https://gradientdamage.com/openai-math/polynomial-removal-fails-for-ordered-binary-matrices/) (result 190): OpenAI claims: Disproves polynomial ordered binary matrix removal with one fixed 66×66 zero–one pattern. Matrices can require many binary-entry changes to become pattern-free while their copy density is smaller than every proposed polynomial bound in that distance. Copies preserve row and column orders and match both zeros and ones. (Lean)
- [A power improvement in the Heilbronn triangle lower bound](https://gradientdamage.com/openai-math/power-improvement-in-the-heilbronn-triangle-lower-bound/) (result 191): OpenAI claims: For every sufficiently large n, constructs n points in the unit square such that every triangle has area at least n⁻²⁺ᶜ for one absolute c > 0. This disproves the conjectured almost-n−2 upper bound in Heilbronn's triangle problem, which asks how large the smallest determined triangle can be. (Lean)
- [Boolean functions violate the square-root degree bound by arbitrary factors](https://gradientdamage.com/openai-math/boolean-functions-violate-the-square-root-degree-bound-by-arbitrary-factors/) (result 192): OpenAI claims: 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 ∑ᵢf̂({i}) > C√(deg(f)). Thus its total signed correlation with individual input bits can exceed the proposed bound by an arbitrary factor. (Lean)

### Algebraic and complex geometry

- [The rational Hodge conjecture for CM abelian varieties](https://gradientdamage.com/openai-math/rational-hodge-conjecture-for-cm-abelian-varieties/) (result 032): OpenAI claims: Proves the rational Hodge conjecture for every complex CM abelian variety, in every dimension and codimension. Through Milne's theorems, this also gives the Tate conjecture for all abelian varieties over finite fields and the Hodge standard conjecture for abelian varieties in every characteristic.
- [Iitaka subadditivity, variation, and logarithmic additivity](https://gradientdamage.com/openai-math/iitaka-subadditivity-variation-and-logarithmic-additivity/) (result 033): OpenAI claims: Proves Campana's orbifold Iitaka subadditivity conjecture for smooth Fujiki-class-𝒞 manifolds with rational simple-normal-crossing boundaries. For projective fibrations f:U → V of smooth complex quasi-projective varieties with connected fibers, general fiber F, and κ̄(V) ≥ 0, proves Popa's inequality κ̄(U) ≥ κ(F)+max {κ̄(V),Var (f)}, where variation measures the whole geometric generic fiber. (Lean)
- [Log abundance for compact Kähler spaces under logarithmic Iitaka subadditivity](https://gradientdamage.com/openai-math/log-abundance-for-compact-kahler-spaces-under-logarithmic-iitaka-subadditivity/) (result 034): OpenAI claims: Using logarithmic Iitaka subadditivity, proves log abundance in every dimension for normal compact Kähler log canonical pairs with effective rational boundary: an analytically nef ℚ-Cartier adjoint is semiample. It also proves projective log abundance over every algebraically closed field of characteristic zero and the effective Iitaka fibration conjecture for smooth projective varieties of nonnegative Kodaira dimension in that setting. A further result resolves the finite-rational-coefficient index conjecture for connected projective semi-log-canonical log Calabi–Yau pairs over such fields in each fixed dimension and for each fixed finite set of rational boundary coefficients, with a uniform index independent of the number of components.
- [Log-canonical threefold abundance in numerical dimension one](https://gradientdamage.com/openai-math/log-canonical-threefold-abundance-in-numerical-dimension-one/) (result 035): OpenAI claims: Proves log abundance for projective log canonical threefold pairs over algebraically closed fields of characteristic p > 3 when the effective boundary is rational and the ℚ-Cartier adjoint is nef of numerical dimension one. The adjoint is semiample, without requiring the original variety to be terminal or ℚ-factorial.
- [Numerical semiampleness and generalized minimal models](https://gradientdamage.com/openai-math/numerical-semiampleness-and-generalized-minimal-models/) (result 036): OpenAI claims: Proves numerical semiampleness for nef adjoints K_X+B+M with K_X+B pseudo-effective and M nef rational, for projective klt rational pairs over algebraically closed characteristic-zero fields and smooth compact Kähler rational klt simple-normal-crossing pairs, using Bott–Chern cohomology in the latter case. Separately, projective generalized log canonical rational pairs over such fields admit minimal models for pseudo-effective adjoints and Mori fiber spaces otherwise, with nef b-data fixed.
- [The ordinary-double-point volume gap](https://gradientdamage.com/openai-math/ordinary-double-point-volume-gap/) (result 037): OpenAI claims: Proves the ordinary-double-point volume-gap conjecture: every singular complex algebraic klt germ of dimension n ≥ 2, with zero boundary, has normalized volume at most 2(n-1)ⁿ. Equality holds precisely for an analytic ordinary double point.
- [Fujita’s freeness conjecture](https://gradientdamage.com/openai-math/fujitas-freeness-conjecture/) (result 038): OpenAI claims: Proves Fujita's freeness conjecture at its sharp bound in every dimension: for a smooth projective complex variety X of dimension n and an ample line bundle L, the adjoint K_X+mL is globally generated for every integer m ≥ n+1.
- [Nagata’s conjecture and maximal Seshadri constants](https://gradientdamage.com/openai-math/nagatas-conjecture-and-maximal-seshadri-constants/) (result 039): OpenAI claims: Proves Nagata's strict inequality ∑ᵢ mᵢ < d√r for every nonzero effective plane curve of degree d through r ≥ 10 very general complex points, with arbitrary multiplicities mi. It also proves maximal multipoint Seshadri constants (Lⁿ/r)^(1/n) for every smooth polarized projective variety of dimension n ≥ 2 and all sufficiently large r: at very general points over ℂ, and at the geometric generic tuple over any algebraically closed field of positive characteristic. (Lean)
- [Bloch’s conjecture for complex surfaces](https://gradientdamage.com/openai-math/blochs-conjecture-for-complex-surfaces/) (result 040): OpenAI claims: Proves Bloch's conjecture: for every smooth connected projective complex surface S with p_g(S)=0, the Albanese map CH₀(S)⁰ → Alb(S)(ℂ) on integral degree-zero zero-cycles is an isomorphism. This combines the new p_g=q=0 theorem with the classical theorem of Bloch, Kas, and Lieberman.
- [Hyperkähler SYZ and projective-space bases](https://gradientdamage.com/openai-math/hyperkahler-syz-and-projective-space-bases/) (result 041): OpenAI claims: Proves the strong hyperkähler SYZ conjecture: every holomorphic line bundle with nonzero nef isotropic first Chern class on a compact irreducible holomorphic symplectic Kähler manifold is semiample. It also proves that every projective Lagrangian fibration with normal projective base has projective space as its base, in every dimension and deformation type.
- [Oka classification for minimal compact complex surfaces: Kodaira dimension zero and class VII](https://gradientdamage.com/openai-math/oka-classification-for-minimal-compact-complex-surfaces-kodaira-dimension-zero-and-class-vii/) (result 042): OpenAI claims: Proves that every complex K3 surface is Oka, including nonprojective surfaces. More generally, every connected minimal compact complex surface of Kodaira dimension zero is Oka; a connected minimal compact complex surface of class VII is Oka exactly when it is a Hopf or Enoki surface.
- [P = W for fixed-determinant SLn moduli spaces](https://gradientdamage.com/openai-math/p-w-for-fixed-determinant-sln-moduli-spaces/) (result 043): OpenAI claims: Proves Pₖ=W₂ₖ=W₂ₖ₊₁ on the full rational cohomology of smooth coprime fixed-determinant, trace-free Higgs moduli spaces and their character varieties for composite ranks over smooth projective complex curves of genus at least two. This includes variant cohomology and, together with the known prime-rank theorems, establishes the fixed-determinant P = W conjecture in every coprime rank.
- [The equivariant cohomological Hikita conjecture](https://gradientdamage.com/openai-math/equivariant-cohomological-hikita-conjecture/) (result 044): OpenAI claims: Proves the equivariant cohomological Hikita correspondence for every finite quiver, including loops and multiple arrows, with arbitrary dimension and framing vectors and commuting flavor torus. When every semistable point is stable and the gauge action is free, the equivariant cohomology of the Nakajima variety is canonically the coordinate ring of the scheme-theoretic cocharacter-fixed locus of its flavor-deformed Coulomb branch.
- [Shafarevich counterexamples in dimension two and with large fundamental group](https://gradientdamage.com/openai-math/shafarevich-counterexamples-in-dimension-two-and-with-large-fundamental-group/) (result 046): OpenAI claims: Constructs a smooth projective complex fourfold with large fundamental group whose universal cover contains no positive-dimensional compact analytic subvariety but is neither Stein nor holomorphically convex. A separate smooth projective complex surface already disproves unrestricted Shafarevich holomorphic convexity in dimension two.
- [Zariski cancellation and affine fibrations over the complex numbers](https://gradientdamage.com/openai-math/zariski-cancellation-and-affine-fibrations-over-the-complex-numbers/) (result 047): OpenAI claims: Constructs an integral complex affine fourfold X≇𝔸⁴ with X×𝔸¹ ≅ 𝔸⁵, disproving affine-space cancellation over ℂ in dimension four. It also disproves the Dolgachev–Weisfeiler affine-fibration conjecture: smooth surjections X → 𝔸¹ and 𝔸⁵ → 𝔸² have every residue-field fiber isomorphic to affine three-space but are not Zariski-locally trivial. (Lean)
- [A characteristic-zero counterexample to Lipman–Zariski](https://gradientdamage.com/openai-math/characteristic-zero-counterexample-to-lipman-zariski/) (result 048): OpenAI claims: Constructs a singular normal affine complex surface with free rank-two tangent sheaf, disproving the characteristic-zero Lipman–Zariski conjecture.
- [A stable-coordinate counterexample in four variables](https://gradientdamage.com/openai-math/stable-coordinate-counterexample-in-four-variables/) (result 049): OpenAI claims: Constructs a polynomial in four complex variables that is not a coordinate but becomes one after adjoining a single variable, disproving the Stable Coordinate conjecture in four variables. Every fiber is affine three-space, yet none of its embeddings is rectifiable, also disproving the Abhyankar–Sathaye conjecture even when all fibers are affine spaces. (Lean)
- [A counterexample to Griffiths’ positivity conjecture](https://gradientdamage.com/openai-math/counterexample-to-griffiths-positivity-conjecture/) (result 050): OpenAI claims: Constructs ample rank-two bundles on ℙ¹×ℙ¹ with no smooth Hermitian metric of strictly Griffiths-positive curvature, disproving Griffiths' positivity conjecture already on the quadric surface. (Lean)
- [Kobayashi’s canonical-ampleness conjecture](https://gradientdamage.com/openai-math/kobayashis-canonical-ampleness-conjecture/) (result 051): OpenAI claims: Every compact connected Kähler manifold of positive complex dimension with no nonconstant entire curve has ample canonical bundle and is therefore projective. This proves Kobayashi's canonical-ampleness conjecture in the smooth compact Kähler setting.
- [Tangent splittings and product decompositions](https://gradientdamage.com/openai-math/tangent-splittings-and-product-decompositions/) (result 052): OpenAI claims: A splitting of the tangent bundle of a compact Kähler manifold into two integrable holomorphic subbundles induces a compatible product decomposition of its universal cover, proving the two-summand form of Beauville's splitting conjecture. On smooth rationally connected projective manifolds, both summands are automatically integrable, establishing Höring's conjecture and the corresponding product decomposition. (Lean)
- [A counterexample to Pixton completeness in Chow](https://gradientdamage.com/openai-math/counterexample-to-pixton-completeness-in-chow/) (result 053): OpenAI claims: Constructs a tautological relation on a moduli space of stable pointed curves that vanishes in rational Chow, hence in rational cohomology, but lies outside Pixton's original relation span. This disproves the Chow and rational-cohomological forms of his original completeness conjecture.
- [Irrational cubic fourfolds with Hodge-theoretic and categorical K3 associations](https://gradientdamage.com/openai-math/irrational-cubic-fourfolds-with-hodge-theoretic-and-categorical-k3-associations/) (result 054): OpenAI claims: For every sufficiently large admissible Hassett discriminant, a very general smooth complex cubic fourfold is irrational despite having both an untwisted geometric K3 category and an integral Hodge-theoretic K3 association. This disproves Kuznetsov's rationality conjecture and the sufficiency of the associated-K3 criterion for rationality; the discriminant threshold is ineffective.
- [Gepner symmetry and large-volume stability on threefolds](https://gradientdamage.com/openai-math/gepner-symmetry-and-large-volume-stability-on-threefolds/) (result 055): OpenAI claims: Proves Toda's Gepner conjecture for every smooth complex quintic threefold, constructing a numerical Bridgeland stability condition with the prescribed phase shift 2/5. Also constructs numerical Bridgeland stability conditions at every sufficiently large volume on all smooth projective complex threefolds with trivial canonical bundle, with the exact ordinary and square-root-Todd central charges.
- [Termination of projective and Kähler fourfold minimal model programs](https://gradientdamage.com/openai-math/termination-of-projective-and-kahler-fourfold-minimal-model-programs/) (result 056): OpenAI claims: Proves termination of every existing generalized log canonical flip sequence on globally Weil ℚ-factorial compact Kähler fourfolds, with rational boundary, fixed rational analytically nef b-data, and projective small flip diagrams with the prescribed ample signs. Also proves termination of arbitrary permitted minimal model programs for projective log canonical fourfolds with rational boundary in characteristic zero.
- [Fundamental groups of special complex varieties and root orbifolds](https://gradientdamage.com/openai-math/fundamental-groups-of-special-complex-varieties-and-root-orbifolds/) (result 057): OpenAI claims: Proves Campana's abelianity conjecture: special compact Kähler manifolds have virtually abelian fundamental groups. Using this theorem, establishes the same conclusion for order-two root orbifolds of smooth projective complex fourfolds along one nonempty smooth connected divisor, when special in the stated differential-line sense. For smooth special complex quasi-projective varieties, proves that every finite-dimensional complex linear representation of the fundamental group has virtually nilpotent image of class at most two.
- [Semialgebraic universal covers and bounded domains](https://gradientdamage.com/openai-math/semialgebraic-universal-covers-and-bounded-domains/) (result 058): OpenAI claims: Proves the Kollár–Pardon conjecture: the semialgebraic universal covers of connected normal projective complex varieties are exactly products D×ℂᵐ× F, with D bounded symmetric and F simply connected, normal, and projective. A universal cover is quasi-projective exactly when the bounded symmetric factor is absent. In particular, a smooth projective variety covered by ℂn has a finite étale cover by an abelian variety. (Lean)
- [Counterexamples to Zariski’s multiplicity conjecture](https://gradientdamage.com/openai-math/counterexamples-to-zariskis-multiplicity-conjecture/) (result 059): OpenAI claims: Disproves Zariski's multiplicity conjecture by constructing reduced holomorphic hypersurface germs that are ambiently homeomorphic but have different multiplicities. The examples include hypersurfaces in ℂ4 with isolated critical points and multiplicities four and five.
- [The Global Spherical Shell conjecture](https://gradientdamage.com/openai-math/global-spherical-shell-conjecture/) (result 060): OpenAI claims: Every connected minimal compact complex surface of class VII with b₂ > 0 contains a global spherical shell, proving the positive-b2 Global Spherical Shell conjecture. Such a shell is a holomorphically embedded neighborhood of the standard three-sphere in ℂ²∖{0} whose complement is connected.
- [Projective contact classification and the LeBrun–Salamon conjecture](https://gradientdamage.com/openai-math/projective-contact-classification-and-the-lebrun-salamon-conjecture/) (result 062): OpenAI claims: Proves the LeBrun–Salamon conjecture: every closed connected positive quaternionic-Kähler manifold of real dimension at least eight is homothetic to a compact symmetric Wolf space. It also proves contact-Fano homogeneity and classifies smooth connected complex projective contact manifolds of complex dimension at least three: those with b₂=1 are adjoint varieties with their canonical contact structures, while those with b₂ ≥ 2 have underlying manifold ℙ(T*Z) for a smooth projective variety Z.
- [The generalized Mukai conjecture](https://gradientdamage.com/openai-math/generalized-mukai-conjecture/) (result 063): OpenAI claims: Proves the generalized Mukai conjecture: every positive-dimensional smooth complex projective Fano manifold of dimension n, Picard number ρ and pseudoindex ι satisfies ρ(ι-1) ≤ n, with equality exactly for (ℙ^(ι-1))^ρ. Here the pseudoindex is the least anticanonical degree of a rational curve.
- [Topological triviality of μ-constant surface singularities](https://gradientdamage.com/openai-math/topological-triviality-of-constant-surface-singularities/) (result 064): OpenAI claims: Proves topological right-triviality for every holomorphic one-parameter family of isolated hypersurface singularities in ℂ3 with constant Milnor number, resolving the surface case of the μ-constant problem. After shrinking the parameter disk and representatives, ambient homeomorphisms vary jointly continuously, fix the origin section and preserve the defining functions.
- [Virasoro constraints for complete intersections and projective-bundle towers](https://gradientdamage.com/openai-math/virasoro-constraints-for-complete-intersections-and-projective-bundle-towers/) (result 065): OpenAI claims: Proves the full ordinary unreduced descendant Virasoro conjecture for smooth complete intersections in complex projective space, in every genus and curve class with arbitrary cohomology insertions. The constraints also pass from any smooth projective complex base satisfying them to the projectivization of every algebraic vector bundle of rank at least two, and hence to projective-bundle towers.
- [Bounded klt complements for Fano contractions](https://gradientdamage.com/openai-math/bounded-klt-complements-for-fano-contractions/) (result 066): OpenAI claims: Proves the finite-rational-coefficient form of Shokurov’s bounded-klt-complement conjecture for ϵ-lc complex Fano-type pairs with nef anti-log-canonical divisor. For ϵ-lc Fano contractions over any algebraically closed characteristic-zero field, it gives klt complements near every base point, with index bounded only by dimension and positive rational ϵ. (Lean)
- [The Campana–Peternell conjecture in dimension six](https://gradientdamage.com/openai-math/campana-peternell-conjecture-in-dimension-six/) (result 067): OpenAI claims: Proves the Campana–Peternell conjecture in complex dimension six: every smooth connected complex projective Fano sixfold with nef tangent bundle is rational homogeneous.
- [Anticanonical nonvanishing in every dimension](https://gradientdamage.com/openai-math/anticanonical-nonvanishing-in-every-dimension/) (result 068): OpenAI claims: If X is a smooth connected complex projective variety and -K_X admits a smooth Hermitian metric with nonnegative curvature, then H⁰(X,-mK_X) ≠ 0 for some m > 0. Thus smooth semipositivity forces a nonzero section of a positive tensor power of the anticanonical bundle in every dimension.
- [Global quantum geometric Langlands at irrational level](https://gradientdamage.com/openai-math/global-quantum-geometric-langlands-at-irrational-level/) (result 069): OpenAI claims: Proves the unramified de Rham quantum geometric Langlands equivalence for every connected simple complex algebraic group on every smooth projective connected complex curve, at every shifted level c ∈ ℂ∖ℚ. It identifies the full derived categories of twisted D-modules for the group and its Langlands dual, retaining all global forms and connected components.

### Number theory

- [Milne’s rationality conjecture and algebraic specialization](https://gradientdamage.com/openai-math/milnes-rationality-conjecture-and-algebraic-specialization/) (result 001): OpenAI claims: Proves Milne's rationality conjecture for abelian varieties over ℚ̅ with good reduction: specialized Hodge classes pair rationally with complementary divisor products, independently of cohomology theory. Together with result 032, every specialized Hodge class is represented by a single rational algebraic cycle simultaneously in all prime-to-p and crystalline realizations, for every residue characteristic p. Video: https://www.youtube.com/shorts/BltBSdVlkHU.
- [The full BSD formula from low Selmer corank](https://gradientdamage.com/openai-math/full-bsd-formula-from-low-selmer-corank/) (result 002): OpenAI claims: Proves the full Birch–Swinnerton-Dyer leading-term formula for every elliptic curve over ℚ whose full q-power Selmer group has corank zero or one for some prime q, including finiteness of the Tate–Shafarevich group. With result 006, this gives full BSD for a density-one set of quadratic twists of every elliptic curve over ℚ. Video: https://www.youtube.com/shorts/BXJeJxNXAgs.
- [The quasi-Riemann hypothesis](https://gradientdamage.com/openai-math/quasi-riemann-hypothesis/) (result 003): OpenAI claims: Proves that every Dirichlet L-function, including ζ(s), is zero-free in Re s > 7/8, resolving the quasi-Riemann hypothesis. The same half-plane is zero-free for every finite-order Hecke L-function over ℚ(√(-3)). A companion gives a different proof of the zero-free half-plane Re s > 11/12. (Lean) Video: https://www.youtube.com/shorts/ZYTVn8ritCo.
- [Hilbert’s tenth problem over ℚ](https://gradientdamage.com/openai-math/hilberts-tenth-problem-over-q/) (result 004): OpenAI claims: Proves that no algorithm decides whether an integer-coefficient polynomial in an arbitrary number of variables has a rational zero, resolving Hilbert's tenth problem over ℚ negatively. Video: https://www.youtube.com/shorts/9LbtHS_YFcU.
- [Irrationality of Catalan’s constant](https://gradientdamage.com/openai-math/irrationality-of-catalans-constant/) (result 005): OpenAI claims: Proves that Catalan's constant G=∑_(j ≥ 0)(-1)ʲ/(2j+1)² is irrational. (Lean) Video: https://www.youtube.com/shorts/PXNXSlzCLPo.
- [Goldfeld’s conjecture: densities and mean analytic rank](https://gradientdamage.com/openai-math/goldfelds-conjecture-densities-and-mean-analytic-rank/) (result 006): OpenAI claims: Proves Goldfeld's conjecture for quadratic twists of every elliptic curve over ℚ: analytic ranks zero and one each have density 1/2, and the mean analytic rank tends to 1/2. Both statements order signed squarefree twist parameters by absolute value. Video: https://www.youtube.com/shorts/AFGKRcCdzSU.
- [Ordinary two-point correlations and the corrected Elliott conjecture](https://gradientdamage.com/openai-math/ordinary-two-point-correlations-and-the-corrected-elliott-conjecture/) (result 007): OpenAI claims: Proves the ordinary two-point Chowla conjecture, with a bound O(X/(log X)ᶜ) for Liouville correlation sums along fixed nonproportional affine forms, where c > 0 is absolute. More generally, proves the binary corrected Elliott conjecture for complex multiplicative functions bounded by one when one factor is uniformly nonpretentious against each fixed Dirichlet character times nⁱᵗ for |t| ≤ X. (Lean)
- [The Deligne–Drinfeld conjecture](https://gradientdamage.com/openai-math/deligne-drinfeld-conjecture/) (result 008): OpenAI claims: Proves that the rational Grothendieck–Teichmüller Lie algebra, with the Ihara bracket, is freely generated by one element in each odd weight 3, 5, 7, …, resolving the Deligne–Drinfeld conjecture. (Lean)
- [Function-field reconstruction from Milnor K-theory and Galois data](https://gradientdamage.com/openai-math/function-field-reconstruction-from-milnor-k-theory-and-galois-data/) (result 009): OpenAI claims: Reconstructs function fields of transcendence degree at least two over algebraically closed constants from Kᴹ₁/ℓ, Kᴹ₂/ℓ, and their product. These data recover the perfect closure and constants when ℓ differs from the characteristic, and the original field and its named base in equal characteristic. Also proves Bogomolov–Pop reconstruction from abelian-by-central pro-ℓ Galois data away from the characteristic. (Lean)
- [Unrestricted pro-modularity at the prime two](https://gradientdamage.com/openai-math/unrestricted-pro-modularity-at-the-prime-two/) (result 010): OpenAI claims: Every continuous odd absolutely irreducible two-dimensional 2-adic representation of G_ℚ unramified outside finitely many primes occurs in a completed Hecke algebra at some odd tame level. Also proves classical modularity up to Tate twist for irreducible odd representations with these finiteness conditions that are de Rham at 2 with distinct Hodge–Tate weights, resolving the dyadic Fontaine–Mazur case without residual restrictions.
- [Prime-factor statistics of p-1](https://gradientdamage.com/openai-math/prime-factor-statistics-of-p-1/) (result 011): OpenAI claims: Proves that the normalized ordered logarithms of the prime factors of p-1, counted with multiplicity, converge jointly to the Poisson–Dirichlet law PD(1) as p ranges uniformly over primes up to x and x → ∞. This resolves the Ford–Konyagin–Luca conjecture. It also proves that infinitely many integers n have more than n^(1-ε) totient preimages, for every ε > 0. Video: https://www.youtube.com/shorts/aGmPuX3YCs8.
- [Independent largest prime factors of consecutive integers](https://gradientdamage.com/openai-math/independent-largest-prime-factors-of-consecutive-integers/) (result 012): OpenAI claims: Resolves the Erdős–Pomerance joint Dickman conjecture: the logarithmic sizes of the largest prime factors of n and n+1 are asymptotically independent in ordinary natural density. In particular, the integers satisfying P⁺(n) < P⁺(n+1) have density 1/2. (Lean)
- [Ostmann’s inverse Goldbach conjecture](https://gradientdamage.com/openai-math/ostmanns-inverse-goldbach-conjecture/) (result 013): OpenAI claims: Proves that no finite modification of the primes can be written as A+B with A,B ⊆ ℤ_(≥ 0) each containing at least two elements. This resolves Ostmann's inverse Goldbach conjecture on additive indecomposability. (Lean)
- [Restricted geometric Langlands, global Arthur enhancements, and generic Ramanujan](https://gradientdamage.com/openai-math/restricted-geometric-langlands-global-arthur-enhancements-and-generic-ramanujan/) (result 014): OpenAI claims: Proves the restricted geometric Langlands equivalence for connected reductive groups on smooth projective connected curves over 𝔽̅_q under the four stated Lie-theoretic characteristic hypotheses. Over arbitrary algebraically closed fields of characteristic p > 0, the same conclusion holds assuming additionally that p is very good for the group and p∤ |W_G|. Over global function fields, proves Ramanujan at every place for globally generic cuspidal representations of split adjoint absolutely simple exceptional groups, without characteristic or ramification-depth restrictions, and at every unramified place for cuspidal representations of split adjoint absolutely simple groups with a generic unramified component. Assuming the finite-level Ramanujan–Arthur decomposition, constructs global Arthur enhancements of occurring cuspidal excursion parameters for split connected semisimple groups at full finite level, recovering the given parameters by diagonal specialization on the entire Weil group, including inertia. Video: https://www.youtube.com/shorts/1lz16-M84MM.
- [Torus-packet equidistribution in prime, quartic, and sextic degrees](https://gradientdamage.com/openai-math/torus-packet-equidistribution-in-prime-quartic-and-sextic-degrees/) (result 015): OpenAI claims: Proves Haar equidistribution without escape of mass for complete volume-weighted torus packets from totally real fields: arbitrary lattices and prescribed local types in fixed prime degree at least five, arbitrary-order Picard packets in primitive quartic fields, and maximal-order ideal-class packets in primitive sextic fields. Here primitive means having no proper intermediate field; the relevant order or field discriminant tends to infinity. (Lean)
- [Zilber–Pink in abelian varieties and the Siegel threefold](https://gradientdamage.com/openai-math/zilber-pink-in-abelian-varieties-and-the-siegel-threefold/) (result 016): OpenAI claims: Proves the abelian Zilber–Pink conjecture over ℚ̅: every irreducible subvariety has finitely many maximal atypical subvarieties relative to its smallest containing torsion coset. It also proves the full curve case in the Siegel threefold 𝒜₂ for Hodge-generic curves defined over ℚ̅, without boundary or reduction assumptions.
- [The irrationality exponent of π is 2](https://gradientdamage.com/openai-math/irrationality-exponent-of-is-2/) (result 017): OpenAI claims: Proves that the irrationality exponent of π is exactly 2: for every ε > 0 and all sufficiently large denominators q, every rational p/q satisfies |π-p/q| ≥ q^(-2-ε). This also proves convergence of the Flint–Hills series ∑_(n ≥ 1)1/(n³ sin² n), with angles in radians. (Lean)
- [The Margulis–Platonov conjecture over global fields](https://gradientdamage.com/openai-math/margulis-platonov-conjecture-over-global-fields/) (result 018): OpenAI claims: Proves the Margulis–Platonov conjecture over every global field, including function fields of characteristic two. For an absolutely almost simple simply connected algebraic group G over k, every noncentral abstract normal subgroup of G(k) is the inverse image of an open normal subgroup in the finite product of its anisotropic nonarchimedean local groups.
- [The local p-adic section conjecture and global consequences](https://gradientdamage.com/openai-math/local-p-adic-section-conjecture-and-global-consequences/) (result 019): OpenAI claims: Proves that rational points on every smooth proper geometrically connected curve of genus at least two over a finite extension of ℚp correspond bijectively to conjugacy classes of sections of its full arithmetic étale fundamental group. It also proves Grothendieck's section conjecture over ℚ for the modular curves X₀(N) and X₁(N) of genus at least two.
- [Squarefree quartics and power-free polynomial values](https://gradientdamage.com/openai-math/squarefree-quartics-and-power-free-polynomial-values/) (result 020): OpenAI claims: Proves the squarefree-values conjecture for irreducible integer quartics with no fixed prime-square divisor: squarefree values on positive integers have the predicted positive Euler-product density. More generally, establishes the (d-2)-power-free density for irreducible integer polynomials of degrees four through eight under the necessary local condition; together with Browning's higher-degree theorem, this covers every d ≥ 4. (Lean)
- [A quadratic bound for Jacobsthal’s function](https://gradientdamage.com/openai-math/quadratic-bound-for-jacobsthals-function/) (result 021): OpenAI claims: Answers Jacobsthal's quadratic-bound question: every interval of Ck² consecutive integers contains an integer coprime to any prescribed positive integer with at most k distinct prime divisors, for an absolute constant C. The bound is uniform over prime sets and interval positions and removes the classical logarithmic loss. (Lean)
- [The weak inhomogeneous Duffin–Schaeffer conjecture](https://gradientdamage.com/openai-math/weak-inhomogeneous-duffin-schaeffer-conjecture/) (result 022): OpenAI claims: Proves that for every real shift γ and finite-valued ψ:ℕ → [0,∞), divergence of ∑_qϕ(q)ψ(q)/q implies ‖qx-γ‖ < ψ(q) for infinitely many q, for almost every x. Here ϕ is Euler's totient and the norm is distance to the nearest integer. Numerators are unrestricted; no monotonicity or Diophantine condition on γ is needed.
- [Patterson's first moment for cubic Gauss sums](https://gradientdamage.com/openai-math/pattersons-first-moment-for-cubic-gauss-sums/) (result 023): OpenAI claims: Proves unconditionally the all-primary-prime form of Patterson’s first-moment asymptotic: normalized cubic Gauss sums over primary Eisenstein primes of norm at most X, including both conjugates, have an explicit positive main term of order X^(5/6)/log X. Every fixed nonzero prime-angle Fourier mode has smaller order. (Lean)
- [An asymptotic formula for the number of totients](https://gradientdamage.com/openai-math/asymptotic-formula-for-the-number-of-totients/) (result 024): OpenAI claims: Gives an asymptotic equivalent for the number V(x) of distinct totient values up to x, with a positive bounded phase-dependent factor determined by convergent arithmetic approximations. In particular, V(cx)/V(x) → c for every fixed c > 0, answering Erdős and Hall’s scaling question. (Lean)
- [Short Egyptian fractions](https://gradientdamage.com/openai-math/short-egyptian-fractions/) (result 025): OpenAI claims: Every rational a/b with 1 ≤ a < b is a sum of O(log log b) distinct positive unit fractions. The worst-case minimum number of terms has the same order, resolving Erdős’s conjecture on short Egyptian fractions. (Lean)
- [Positive lower density of large prime gaps](https://gradientdamage.com/openai-math/positive-lower-density-of-large-prime-gaps/) (result 026): OpenAI claims: For every fixed C > 0, a positive proportion of consecutive prime gaps exceed C log pₙ, throughout every sufficiently large initial segment of the primes. The proportion may depend on C. Consequently, the indices where pₙ/n increases have positive lower density, answering Erdős and Prachar. (Lean)
- [Potential integral density on curve character varieties](https://gradientdamage.com/openai-math/potential-integral-density-on-curve-character-varieties/) (result 027): OpenAI claims: Resolves the determinant-one curve case of Litt's integral-density question. For every smooth connected complex algebraic curve and every rank, integral points become Zariski dense in every component of its SLr character variety over the full ring of integers of one number field. Prescribed quasi-unipotent boundary conjugacy classes are allowed, including nonsemisimple classes. (Lean)
- [Uniformly bounded components of Gaussian-prime graphs](https://gradientdamage.com/openai-math/uniformly-bounded-components-of-gaussian-prime-graphs/) (result 028): OpenAI claims: Proves the Gaussian moat conjecture: no infinite walk through distinct Gaussian primes can have uniformly bounded steps. More strongly, for every distance bound D, the graph joining Gaussian primes at distance at most D has uniformly bounded finite component sizes, depending only on D, including primes on the coordinate axes. (Lean)
- [Primitive roots for every admissible integer base](https://gradientdamage.com/openai-math/primitive-roots-for-every-admissible-integer-base/) (result 029): OpenAI claims: Proves the infinitude assertion in Artin's primitive root conjecture for every integer a that is neither −1 nor a square. For each such base, at least cₐ x/(log x)² primes in every sufficiently large interval (x,2x) have primitive root a, with cₐ > 0.
- [Modularity of elliptic curves over imaginary quadratic fields](https://gradientdamage.com/openai-math/modularity-of-elliptic-curves-over-imaginary-quadratic-fields/) (result 030): OpenAI claims: Proves the modularity conjecture for elliptic curves over imaginary quadratic fields: every elliptic curve over every imaginary quadratic field is modular, with matching local parameters at every place.
- [Uchida’s conjecture for open homomorphisms of Galois groups](https://gradientdamage.com/openai-math/uchidas-conjecture-for-open-homomorphisms-of-galois-groups/) (result 031): OpenAI claims: Proves Uchida's conjecture: every continuous open homomorphism between Galois groups of possibly infinite solvably closed Galois extensions of number fields comes from a unique equivariant field embedding in the opposite direction. No restriction on the kernel or separate cyclotomic-compatibility assumption is needed.

### Differential geometry

- [Smooth isometric immersions of surfaces into ℝ4](https://gradientdamage.com/openai-math/smooth-isometric-immersions-of-surfaces-into-r4/) (result 333): OpenAI claims: Every closed smooth Riemannian surface admits a smooth isometric immersion into ℝ4, resolving the closed-surface form of the four-dimensional isometric-immersion problem. This includes nonorientable surfaces and metrics of arbitrary Gaussian curvature. (Lean)
- [A smooth surface metric with no local isometric immersion in ℝ3](https://gradientdamage.com/openai-math/smooth-surface-metric-with-no-local-isometric-immersion-in-r3/) (result 334): OpenAI claims: Constructs a smooth positive-definite metric on (-1,1)² for which no neighborhood of the origin admits a smooth isometric immersion into ℝ3. This answers the unrestricted smooth local isometric realization problem for surfaces negatively, even after shrinking the neighborhood. (Lean)
- [Gromov’s integral scalar-curvature bound for simplicial volume](https://gradientdamage.com/openai-math/gromovs-integral-scalar-curvature-bound-for-simplicial-volume/) (result 335): OpenAI claims: Proves ∫_M(Scal_g⁻)^(n/2) dV_g ≥ aₙ‖ M‖ for every closed connected oriented smooth n-manifold, n ≥ 3, and every smooth metric, with aₙ > 0 depending only on dimension. Here Scal_g⁻=max {0,-Scal_g} and ‖ M‖ is real simplicial volume. Also proves rational inessentiality under positive scalar curvature, resolving the Gromov–Lawson conjecture; every nonnegative-scalar-curvature metric on a closed aspherical manifold is flat.
- [Spectral scalar curvature, Urysohn width, and macroscopic dimension](https://gradientdamage.com/openai-math/spectral-scalar-curvature-urysohn-width-and-macroscopic-dimension/) (result 336): OpenAI claims: Every complete connected smooth boundaryless n-manifold, n ≥ 3, satisfying -4Δ+Scal ≥ 1 as a quadratic-form inequality admits a continuous map to a simplicial complex of dimension at most n-2 whose entire fibers have diameter bounded only by n in the original metric. This strengthens Gromov's width conclusion to spectral scalar curvature. Universal covers of closed positive-scalar-curvature manifolds also have continuous macroscopic dimension at most n-2 for every n ≥ 2.
- [Sharp Cartan–Hadamard isoperimetry and rigidity](https://gradientdamage.com/openai-math/sharp-cartan-hadamard-isoperimetry-and-rigidity/) (result 337): OpenAI claims: Proves generalized Cartan–Hadamard isoperimetry in every dimension: in a complete simply connected manifold with sectional curvature at most κ ≤ 0, every finite-volume finite-perimeter set satisfies the sharp comparison with the equal-volume model ball. Bounded positive-volume equality regions for κ = 0 are Euclidean balls. Also proves sharp Euclidean filling bounds for compactly supported integral n-cycles, n ≥ 2, in arbitrary proper CAT(0) spaces. (Lean)
- [Yau's uniformization conjecture](https://gradientdamage.com/openai-math/yaus-uniformization-conjecture/) (result 338): OpenAI claims: Proves Yau's uniformization conjecture: every complete connected noncompact Kähler manifold with strictly positive holomorphic bisectional curvature is biholomorphic to ℂn.
- [Katok's entropy rigidity conjecture](https://gradientdamage.com/openai-math/katoks-entropy-rigidity-conjecture/) (result 339): OpenAI claims: Proves Katok's entropy rigidity conjecture for closed connected Riemannian manifolds of dimension at least three with strictly negative sectional curvature: normalized Liouville measure maximizes entropy for the geodesic flow if and only if the metric is locally symmetric.
- [A counterexample to the nearby Lagrangian conjecture](https://gradientdamage.com/openai-math/counterexample-to-the-nearby-lagrangian-conjecture/) (result 340): OpenAI claims: Disproves the unrestricted nearby Lagrangian conjecture. For some sufficiently large even N, constructs a closed exact embedded Lagrangian in T*(S⁹× Sᴺ⁻¹) that is diffeomorphic to the base but not Hamiltonian isotopic to its zero section.
- [Donaldson's hypersymplectic deformation conjecture](https://gradientdamage.com/openai-math/donaldsons-hypersymplectic-deformation-conjecture/) (result 341): OpenAI claims: Proves Donaldson's hypersymplectic deformation conjecture in a cohomology-preserving form. Every positive triple of smooth closed two-forms on a closed connected oriented four-manifold, normalized by ∫ωᵢ∧ωⱼ=δᵢⱼ, deforms through positive closed triples to a hyperkähler triple while preserving all three cohomology classes. Any positive triple can first be normalized by a constant linear change.
- [Donaldson's tamed-to-compatible conjecture](https://gradientdamage.com/openai-math/donaldsons-tamed-to-compatible-conjecture/) (result 342): OpenAI claims: Proves Donaldson's tamed-to-compatible conjecture: every smooth almost complex structure on a closed four-manifold that is tamed by a symplectic form admits a compatible symplectic form. The almost complex structure stays fixed; the form's cohomology class may change. (Lean)
- [Symplectic ball packing in higher dimensions](https://gradientdamage.com/openai-math/symplectic-ball-packing-in-higher-dimensions/) (result 343): OpenAI claims: Resolves the Siegel–Yao conjecture for arbitrary capacities in every dimension 2n ≥ 6. Finitely many closed symplectic balls of capacities R₁,…,Rₖ embed disjointly into an open ball of capacity R exactly when ∑ᵢRᵢⁿ < Rⁿ and Rᵢ+Rⱼ < R for every distinct pair i, j. (Lean)
- [The metric Blaschke conjecture](https://gradientdamage.com/openai-math/metric-blaschke-conjecture/) (result 344): OpenAI claims: Proves the metric Blaschke conjecture: every closed connected Riemannian manifold of positive dimension whose injectivity radius equals its diameter is, up to scaling, a standard compact rank-one symmetric space.
- [Infinitely many closed geodesics on Riemannian spheres and closed three-manifolds](https://gradientdamage.com/openai-math/infinitely-many-closed-geodesics-on-riemannian-spheres-and-closed-three-manifolds/) (result 345): OpenAI claims: Proves that every smooth Riemannian metric on Sn, n ≥ 2, has infinitely many prime closed geodesics with pairwise distinct images. The same conclusion holds on every closed manifold admitting a finite smooth spherical cover and on every closed three-manifold, without orientability or nondegeneracy restrictions. Video: https://www.youtube.com/shorts/nvS8R9FbAgY.
- [Sharp singular-set bounds for stationary integral varifolds](https://gradientdamage.com/openai-math/sharp-singular-set-bounds-for-stationary-integral-varifolds/) (result 346): OpenAI claims: Proves that every stationary integral m-varifold in a Euclidean open set has singular set of Hausdorff dimension at most m-1, a sharp bound in every positive dimension and codimension. On round spheres, the family also proves almost-everywhere regularity: the singular set has zero m-dimensional Hausdorff measure.
- [Counterexamples to stable-Morse and strong Arnold fixed-point bounds](https://gradientdamage.com/openai-math/counterexamples-to-stable-morse-and-strong-arnold-fixed-point-bounds/) (result 347): OpenAI claims: Disproves stable-Morse lower bounds for nondegenerate Hamiltonian fixed points: on simply connected closed Kähler manifolds of real dimension 22, the deficit below the stable Morse number is unbounded. A separate Hamiltonian diffeomorphism of the complex quadric threefold has exactly three fixed points, fewer than the four critical points required of every smooth function. (Lean)
- [Nonnegative-curvature Einstein classification and an L2 topological gap](https://gradientdamage.com/openai-math/nonnegative-curvature-einstein-classification-and-an-l2-topological-gap/) (result 348): OpenAI claims: Classifies closed connected Einstein four-manifolds with positive Einstein constant and nonnegative sectional curvature: up to scaling, their universal Riemannian covers are the round S4, Fubini–Study ℂℙ², or a product of equal round two-spheres. A closed simply connected nonnegatively curved four-manifold is diffeomorphic to one of these whenever the scale-invariant L2 norm of its trace-free Ricci curvature lies below a universal positive constant. (Lean)
- [The Solomon–Yau least-volume conjecture](https://gradientdamage.com/openai-math/solomon-yau-least-volume-conjecture/) (result 349): OpenAI claims: Proves the Solomon–Yau least-volume conjecture for minimal hypersurfaces of round spheres. For every m ≥ 2, a closed connected minimal immersion into the unit sphere Sᵐ⁺¹ with non-totally-geodesic image has volume at least that of the smallest minimal Clifford product, counting covering multiplicity.
- [Yau’s nodal bounds: surfaces and higher dimensions](https://gradientdamage.com/openai-math/yaus-nodal-bounds-surfaces-and-higher-dimensions/) (result 350): OpenAI claims: Proves the sharp C√λ upper bound for nodal length on every fixed smooth closed surface, completing Yau's conjecture there. The upper bound fails for fixed smooth metrics in dimensions three and four, including metrics on S3 arbitrarily close to round. In dimension five, nodal measure can grow faster than λ^(1/2+ε₀) for some fixed ε₀ > 0, ruling out even arbitrarily small power losses. (Lean) Video: https://www.youtube.com/shorts/2Zgw4jT7Cek.
- [Scalar curvature and finite-time Ricci-flow singularities](https://gradientdamage.com/openai-math/scalar-curvature-and-finite-time-ricci-flow-singularities/) (result 351): OpenAI claims: Proves that a smooth Ricci flow on a closed four-manifold extends past any finite time at which scalar curvature remains uniformly bounded. A higher-dimensional counterexample has bounded scalar curvature but unbounded full curvature at its finite maximal time, disproving the unrestricted scalar-curvature extension conjecture.
- [A finite-time singularity of Calabi flow](https://gradientdamage.com/openai-math/finite-time-singularity-of-calabi-flow/) (result 352): OpenAI claims: Disproves Chen's smooth long-time existence conjecture for Calabi flow by constructing a smooth U(10)-invariant Kähler metric on ℂℙ¹⁰ whose flow develops a finite-time singularity. The metric lies in the Fubini–Study class, so the failure occurs even in a class containing a constant-scalar-curvature metric.
- [Affine Bernstein rigidity through dimension nine and a smooth dimension-ten counterexample](https://gradientdamage.com/openai-math/affine-bernstein-rigidity-through-dimension-nine-and-a-smooth-dimension-ten-counterexample/) (result 353): OpenAI claims: Proves that every smooth locally uniformly convex affine-maximal graph of dimension three through nine, complete for its induced Euclidean metric, is an elliptic paraboloid. A smooth entire nonquadratic example in dimension ten makes this range sharp. In dimensions three through nine, the paraboloid classification also holds for connected open locally uniformly convex affine-maximal hypersurfaces complete for the affine Berwald–Blaschke metric. (Lean)
- [The isoperimetric profile of the cubic three-torus](https://gradientdamage.com/openai-math/isoperimetric-profile-of-the-cubic-three-torus/) (result 354): OpenAI claims: Determines the isoperimetric profile of the unit cubic flat three-torus and classifies every finite-perimeter minimizer: balls, circular tubes around shortest closed geodesics, coordinate slabs, and their complements. The transition volumes are 4π/81 and 1/π, with exactly the adjacent two types minimizing at each transition. (Lean) Video: https://www.youtube.com/shorts/FFsKkuXhQKs.
- [Unique tangent flows at the first surface singularity](https://gradientdamage.com/openai-math/unique-tangent-flows-at-the-first-surface-singularity/) (result 355): OpenAI claims: Proves the first-singular-time case of tangent-flow uniqueness for smooth compact connected embedded surfaces without boundary in ℝ3. At every singular point, all fixed-center backward tangent flows agree as area measures at every negative time in the original ambient coordinates, without mean-convexity or a prescribed tangent model.
- [Gigli’s characterization of Alexandrov curvature](https://gradientdamage.com/openai-math/giglis-characterization-of-alexandrov-curvature/) (result 356): OpenAI claims: Proves Gigli's conjecture: in every integer dimension n ≥ 2, Alexandrov curvature at least κ is characterized by the full-support RCD ((n-1)κ,n) condition with reference measure ℋⁿ and distributional sectional curvature at least κ in the original global test classes. The RCD condition is unreduced. (Lean)
- [Bi-Lipschitz coordinates at every regular RCD point](https://gradientdamage.com/openai-math/bi-lipschitz-coordinates-at-every-regular-rcd-point/) (result 357): OpenAI claims: Proves that every regular point of a noncollapsed RCD (K,n) space, for K ∈ ℝ and integer n ≥ 2, has an open neighborhood bi-Lipschitz to an open subset of ℝn. Regularity requires all pointed tangents to be Euclidean, the reference measure is exactly ℋⁿ, and the chart compares ambient distances with a point-dependent finite constant.
- [A three-manifold without conjugate points or nonpositive curvature](https://gradientdamage.com/openai-math/three-manifold-without-conjugate-points-or-nonpositive-curvature/) (result 358): OpenAI claims: Constructs a closed connected orientable smooth three-manifold that admits a metric without conjugate points but no metric of nonpositive sectional curvature. This answers negatively, already in dimension three, whether the first metric-existence property implies the second. (Lean)
- [Negative Kähler curvature without bounded holomorphic coordinates](https://gradientdamage.com/openai-math/negative-kahler-curvature-without-bounded-holomorphic-coordinates/) (result 359): OpenAI claims: Constructs a contractible domain in ℂ3 with a complete negatively pinched Kähler metric but no bounded holomorphic coordinates, disproving bounded-domain uniformization in this setting. A higher-dimensional example has sectional curvature at most −1 and only constant bounded holomorphic functions; its curvature is not bounded below. (Lean)
- [Weak MTW curvature gives convexity and regular optimal transport](https://gradientdamage.com/openai-math/weak-mtw-curvature-gives-convexity-and-regular-optimal-transport/) (result 360): OpenAI claims: On every closed connected Riemannian manifold of dimension at least two satisfying weak Ma–Trudinger–Wang curvature, all tangent injectivity domains are convex, resolving Villani’s conjecture in this setting. For squared-distance transport between measurable probability densities bounded above and away from zero, the optimal map and its inverse are Hölder continuous. (Lean)
- [Failure of integer-degree harmonic dimension comparison](https://gradientdamage.com/openai-math/failure-of-integer-degree-harmonic-dimension-comparison/) (result 361): OpenAI claims: Disproves Yau's proposed Euclidean dimension bound for harmonic functions of integer growth on manifolds with nonnegative Ricci curvature. For every sufficiently large integer k, a complete smooth metric on ℝ3 has at least (k+2)² independent harmonic functions of growth at most k, exceeding the Euclidean count (k+1)². The metric may depend on k. (Lean)

### Probability and statistical mechanics

- [The geometric phase diagram, diffusion, and spectra of random planar maps](https://gradientdamage.com/openai-math/geometric-phase-diagram-diffusion-and-spectra-of-random-planar-maps/) (result 211): OpenAI claims: Critical Fortuin–Kasteleyn planar maps converge to Liouville quantum gravity spheres for 0 < q ≤ 4 and to the Brownian continuum random tree for q > 4, establishing the surface-to-tree geometric transition. For FK–Ising and spanning-tree-weighted maps, stationary random walks converge to Liouville Brownian motion on the limiting sphere. The FK–Ising spectral result also gives convergence of eigenvalues and heat traces, using the stated Brownian/LQG inputs. (Lean)
- [Planar first-passage geometry and the absence of bigeodesics](https://gradientdamage.com/openai-math/planar-first-passage-geometry-and-the-absence-of-bigeodesics/) (result 212): OpenAI claims: 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)
- [Critical percolation on every quasi-transitive graph](https://gradientdamage.com/openai-math/critical-percolation-on-every-quasi-transitive-graph/) (result 213): OpenAI claims: Resolves the Benjamini–Schramm criticality conjecture for bond percolation on every infinite connected locally finite quasi-transitive graph with p_c < 1: at the critical probability, there is almost surely no infinite cluster. The family also establishes this conclusion for both nearest-neighbor bond and site percolation on ℤ3. (Lean) Video: https://www.youtube.com/shorts/2KExA3m9N3M.
- [The Benjamini–Schramm nonuniqueness conjecture](https://gradientdamage.com/openai-math/benjamini-schramm-nonuniqueness-conjecture/) (result 214): OpenAI claims: Proves p_c < pᵤ 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)
- [Canonical O(3) continuum limit and exact O(4) mass asymptotics](https://gradientdamage.com/openai-math/canonical-o-3-continuum-limit-and-exact-o-4-mass-asymptotics/) (result 215): OpenAI claims: Constructs the canonical continuum limit of the two-dimensional nearest-neighbor O(3) model: a non-Gaussian local relativistic theory with a unique vacuum and a positive mass gap. For the square-lattice O(4) model, determines the exact leading asymptotic of the full transfer gap, mₗₐₜ(β) ∼ 32e^(π/4-1/2)√β e^(-πβ). The family also proves exponential spin-correlation decay for two-dimensional nearest-neighbor O(n) models with n ≥ 3 at every positive temperature. (Lean)
- [Critical and near-critical XY scaling and BKT universality](https://gradientdamage.com/openai-math/critical-and-near-critical-xy-scaling-and-bkt-universality/) (result 216): OpenAI claims: 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.
- [The low-temperature Sherrington–Kirkpatrick fluctuation law](https://gradientdamage.com/openai-math/low-temperature-sherrington-kirkpatrick-fluctuation-law/) (result 217): OpenAI claims: 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_β n^(1/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.
- [Conformal universality for weakly interacting and random-bond Ising models](https://gradientdamage.com/openai-math/conformal-universality-for-weakly-interacting-and-random-bond-ising-models/) (result 218): OpenAI claims: 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)
- [GOE bulk universality for regular graphs with weak Anderson disorder](https://gradientdamage.com/openai-math/goe-bulk-universality-for-regular-graphs-with-weak-anderson-disorder/) (result 219): OpenAI claims: For every fixed degree d ≥ 3, the bulk adjacency-eigenvalue point process of a uniform simple random d-regular graph converges to the Gaussian orthogonal ensemble law, including for cubic graphs. The same fixed-energy universality persists under sufficiently weak fixed iid uniform diagonal disorder, throughout compact bands strictly inside the clean spectral edges.
- [Directional zero–one laws beyond iid environments and iid ballisticity](https://gradientdamage.com/openai-math/directional-zero-one-laws-beyond-iid-environments-and-iid-ballisticity/) (result 220): OpenAI claims: 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)
- [The Mézard–Parisi formula for diluted spin glasses](https://gradientdamage.com/openai-math/mezard-parisi-formula-for-diluted-spin-glasses/) (result 221): OpenAI claims: 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)
- [Perceptron free energies and microscopic jamming exponents](https://gradientdamage.com/openai-math/perceptron-free-energies-and-microscopic-jamming-exponents/) (result 222): OpenAI claims: Determines finite-temperature variational free energies for Gaussian Ising perceptrons with bounded Borel log-potentials and Gaussian spherical perceptrons with bounded continuous potentials, at every positive pattern density. A spherical extension treats bi-orthogonally invariant disorder with compact limiting singular-value distributions and no outliers. At margin −1, the quadratic-penalty spherical model has a sharp feasibility threshold and limiting gap and force laws, with system size, zero temperature, and critical density taken in that order. (Lean)
- [Random-cluster interfaces: critical, disordered, thermal, and natural-time scaling](https://gradientdamage.com/openai-math/random-cluster-interfaces-critical-disordered-thermal-and-natural-time-scaling/) (result 223): OpenAI claims: 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κ.
- [Critical and quenched near-critical universality for Poisson–Voronoi percolation](https://gradientdamage.com/openai-math/critical-and-quenched-near-critical-universality-for-poisson-voronoi-percolation/) (result 224): OpenAI claims: 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.
- [Gaussian free field limits throughout the balanced six-vertex regime](https://gradientdamage.com/openai-math/gaussian-free-field-limits-throughout-the-balanced-six-vertex-regime/) (result 225): OpenAI claims: 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π)⁻¹ log|x-y|, the exact variance multiplier is 1/arcsin(c/2).
- [The double-dimer loop ensemble converges to CLE4](https://gradientdamage.com/openai-math/double-dimer-loop-ensemble-converges-to-cle4/) (result 226): OpenAI claims: Resolves the half-plane Temperleyan form of the double-dimer scaling-limit conjecture: the complete loop ensemble formed by two independent dimer coverings of the Temperleyan square lattice converges to nested CLE4. Convergence matches every macroscopic loop as an unparametrized curve, upgrading convergence of loop observables to convergence of the loops themselves. Video: https://www.youtube.com/shorts/_-E8jXoNkk4.
- [Critical SK autocorrelation processes and dynamics across the temperature transition](https://gradientdamage.com/openai-math/critical-sk-autocorrelation-processes-and-dynamics-across-the-temperature-transition/) (result 227): OpenAI claims: For zero-field Gaussian SK heat-bath dynamics with rate-one updates per spin, proves worst-start cutoff on the log n scale for fixed 0 ≤ β < 1, mixing time n^(2/3+o(1)) at β = 1, and stretched-exponential mixing from a Gibbs-sampled fixed starting configuration for β > 1, in probability over disorder. At criticality, rescaled stationary and quench autocorrelation processes have universal random limits for Gaussian and Rademacher disorder; the quench limit relaxes to the stationary limit. (Lean)
- [Continuum phase transitions for radial pair potentials](https://gradientdamage.com/openai-math/continuum-phase-transitions-for-radial-pair-potentials/) (result 228): OpenAI claims: Constructs stable distance-dependent pair interactions for three-dimensional classical particles with a first-order phase transition: the canonical free energy has a derivative jump at one inverse temperature throughout an open density interval. One potential has a divergent repulsive core; another is bounded and continuous with an integrable power-law tail, realizing the type of transition sought in Simon's continuum problem. (Lean)
- [Exact three- and four-state reconstruction thresholds and four-state tree capacity](https://gradientdamage.com/openai-math/exact-three-and-four-state-reconstruction-thresholds-and-four-state-tree-capacity/) (result 229): OpenAI claims: Proves the exact reconstruction threshold dλ² > 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)
- [Exact Hausdorff gauges for SLE](https://gradientdamage.com/openai-math/exact-hausdorff-gauges-for-sle/) (result 230): OpenAI claims: Resolves Schramm’s Hausdorff-measure question for chordal SLEκ, 0 < κ < 8. The explicit gauge rᵈ(log log(1/r))^((2-d)/2), d=1+κ/8, gives almost surely positive finite measure to every trace segment γ([s,t]) with 0 < s < t < ∞, and finite expected measure to the trace in every bounded disk. (Lean) Video: https://www.youtube.com/shorts/FFsKkuXhQKs.
- [The free uniform spanning forest is a factor of IID](https://gradientdamage.com/openai-math/free-uniform-spanning-forest-is-a-factor-of-iid/) (result 231): OpenAI claims: On every infinite connected locally finite simple unweighted graph, the free uniform spanning forest is a factor of independent vertex labels, by one isomorphism-equivariant rule using no root. Translation-invariant strongly Rayleigh binary processes on every countable group, including invariant determinantal processes with Hermitian positive-contraction kernels, are also factors of IID. (Lean)
- [Gaussian fields and interfaces for triangular-lattice Lipschitz heights](https://gradientdamage.com/openai-math/gaussian-fields-and-interfaces-for-triangular-lattice-lipschitz-heights/) (result 232): OpenAI claims: 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.
- [The joint critical Ashkin–Teller current limit](https://gradientdamage.com/openai-math/joint-critical-ashkin-teller-current-limit/) (result 233): OpenAI claims: 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.
- [All-temperature pressure of orthogonally invariant Ising spin glasses](https://gradientdamage.com/openai-math/all-temperature-pressure-of-orthogonally-invariant-ising-spin-glasses/) (result 234): OpenAI claims: 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)
- [Limiting random SAT thresholds, sharp variance and computability](https://gradientdamage.com/openai-math/limiting-random-sat-thresholds-sharp-variance-and-computability/) (result 235): OpenAI claims: For random k-SAT with independent uniformly signed proper clauses sampled with replacement, proves finite positive limiting thresholds and hitting-time variance Θₖ(n) for every fixed k ≥ 3, and computability of the 3-SAT threshold. We credit Gaia Carenini with priority for resolving the threshold-existence conjecture in her concurrent ECCC TR26-229, made public October 5, 2026; this family supplies another proof and the sharper variance and computability results. (Lean)
- [The exact factor-of-IID threshold for free Ising spins on trees](https://gradientdamage.com/openai-math/exact-factor-of-iid-threshold-for-free-ising-spins-on-trees/) (result 236): OpenAI claims: 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)
- [The three-quarter exponent for honeycomb self-avoiding walk](https://gradientdamage.com/openai-math/three-quarter-exponent-for-honeycomb-self-avoiding-walk/) (result 237): OpenAI claims: Proves the diameter form of Nienhuis's predicted three-quarter exponent: a uniformly chosen n-step self-avoiding walk on the honeycomb lattice has diameter n^(3/4+o(1)). Its local mass and covering numbers have exponent 4/3. These estimates hold at every sufficiently large fixed length, simultaneously across scales, with arbitrarily high polynomial probability. (Lean) Video: https://www.youtube.com/shorts/FFsKkuXhQKs.
- [Optimal logarithmic mixing of the Thorp shuffle](https://gradientdamage.com/openai-math/optimal-logarithmic-mixing-of-the-thorp-shuffle/) (result 238): OpenAI claims: Proves that the Thorp shuffle randomizes N=2ᵈ labeled cards in Θ(log N) physical shuffles, settling its optimal mixing order for power-of-two deck sizes. Convergence is in total variation from the worst initial ordering and concerns the entire permutation, not just individual card positions. (Lean)
- [Sharp singularity rates for symmetric random sign matrices](https://gradientdamage.com/openai-math/sharp-singularity-rates-for-symmetric-random-sign-matrices/) (result 239): OpenAI claims: Determines the sharp exponential singularity rate of symmetric random sign matrices with independent entries on and above the diagonal. Uniform signs give Pr(det Aₙ=0)=(1/2+o(1))ⁿ; for fixed bias p ∈ (0,1)∖{1/2}, the rate is (p²+(1-p)²+o(1))ⁿ. In the biased case, agreeing rows attain this rate.

### Mathematical physics

- [Spacetime Penrose inequalities: enclosing area, charge, rotation, and anti-de Sitter extensions](https://gradientdamage.com/openai-math/spacetime-penrose-inequalities-enclosing-area-charge-rotation-and-anti-de-sitter-extensions/) (result 260): OpenAI claims: 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)
- [Localization and delocalization in the Anderson model](https://gradientdamage.com/openai-math/localization-and-delocalization-in-the-anderson-model/) (result 261): OpenAI claims: Resolves the predicted spectral contrast for the lattice Anderson model with independent uniform site potentials. In dimension two, every positive disorder strength gives almost surely pure-point spectrum. In every fixed dimension d ≥ 3, sufficiently weak positive disorder gives purely absolutely continuous spectrum on a fixed open interval with nonzero spectral weight. (Lean) Video: https://www.youtube.com/shorts/G7LkNMIilNo.
- [Sharp finite-matrix Lieb–Thirring inequalities and all equality cases](https://gradientdamage.com/openai-math/sharp-finite-matrix-lieb-thirring-inequalities-and-all-equality-cases/) (result 262): OpenAI claims: 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)
- [The ionization and generalized ionization conjectures](https://gradientdamage.com/openai-math/ionization-and-generalized-ionization-conjectures/) (result 263): OpenAI claims: 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)
- [Strong cosmic censorship near two-ended Kerr data](https://gradientdamage.com/openai-math/strong-cosmic-censorship-near-two-ended-kerr-data/) (result 264): OpenAI claims: 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.
- [Area laws and tensor networks for two-dimensional gapped systems](https://gradientdamage.com/openai-math/area-laws-and-tensor-networks-for-two-dimensional-gapped-systems/) (result 265): OpenAI claims: 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.
- [Exactly three mutually unbiased bases in dimension six](https://gradientdamage.com/openai-math/exactly-three-mutually-unbiased-bases-in-dimension-six/) (result 266): OpenAI claims: Proves N(6)=3, resolving Zauner's dimension-six mutually unbiased bases conjecture: three such bases exist in ℂ6, but four cannot. The exclusion is a complete certified computation under the stated binary64 arithmetic and compiler conditions. An independent companion proves the Matolcsi–Ruzsa–Weiner Fourier-vanishing conjecture for order-six complex Hadamard matrices outside Tao's cubic equivalence class. (Lean)
- [Positive-temperature Bose–Einstein condensation and exact quantum depletion](https://gradientdamage.com/openai-math/positive-temperature-bose-einstein-condensation-and-exact-quantum-depletion/) (result 267): OpenAI claims: 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)
- [The spin-one Haldane gap](https://gradientdamage.com/openai-math/spin-one-haldane-gap/) (result 268): OpenAI claims: 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.
- [Uniform Laughlin gap and stability under bounded scalar disorder](https://gradientdamage.com/openai-math/uniform-laughlin-gap-and-stability-under-bounded-scalar-disorder/) (result 269): OpenAI claims: Proves the fermionic Laughlin spectral-gap conjecture for the full V1 interaction at filling 1/3 on the round sphere. The unique ground state remains uniformly gapped under sufficiently weak bounded real scalar one-body potentials projected to the lowest Landau level. Both the gap and disorder threshold are uniform over all sufficiently large particle numbers and all normalized potential profiles. (Lean)
- [Threshold and positive-energy bound states of the BFSS matrix model](https://gradientdamage.com/openai-math/threshold-and-positive-energy-bound-states-of-the-bfss-matrix-model/) (result 270): OpenAI claims: 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.
- [Bloch's law, its lattice correction, and the spherical magnetization law](https://gradientdamage.com/openai-math/blochs-law-its-lattice-correction-and-the-spherical-magnetization-law/) (result 271): OpenAI claims: Proves Bloch's T3/2 law with its exact coefficient for three-dimensional quantum Heisenberg ferromagnets at every positive quantum spin, allowing nonnegative symmetric finite-range couplings whose support generates ℤ3. The thermodynamic limit precedes the zero-field derivative and low-temperature limit. The family also proves spontaneous magnetization for nearest-neighbor models in every dimension d ≥ 3 and determines the first lattice correction for three-dimensional nearest-neighbor couplings. (Lean) Video: https://www.youtube.com/shorts/3wB5bhuWbJQ.
- [Entanglement without distillable secret key](https://gradientdamage.com/openai-math/entanglement-without-distillable-secret-key/) (result 272): OpenAI claims: Constructs an entangled state on ℂ¹⁰⊗ℂ¹⁰ with zero distillable secret key for the specified local-instrument protocols that complete almost surely. These allow joint local processing and authenticated two-way public communication, with no other shared private resource and an eavesdropper holding the input purification and public record. A trace-preserving PPT channel on M₂₁(ℂ) whose square is not entanglement breaking disproves Christandl's PPT-square conjecture. (Lean)
- [The entropy photon-number inequality](https://gradientdamage.com/openai-math/entropy-photon-number-inequality/) (result 273): OpenAI claims: 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)
- [Parity is not in QAC0](https://gradientdamage.com/openai-math/parity-is-not-in-qac0/) (result 274): OpenAI claims: Resolves Moore's parity conjecture in the measured-output model: constant-depth quantum circuits with arbitrary one-qubit gates, unbounded-arity Toffoli gates and polynomially many total qubits cannot compute parity with any fixed positive worst-case advantage. Ancillas start in zero, one output qubit is measured, and all other registers may be discarded. Xu–Li's reductions give the same bounded-error obstruction for strict majority. (Lean)
- [QMA-hardness of continuum Coulomb energy](https://gradientdamage.com/openai-math/qma-hardness-of-continuum-coulomb-energy/) (result 275): OpenAI claims: 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)
- [Classical capacity of generalized amplitude damping](https://gradientdamage.com/openai-math/classical-capacity-of-generalized-amplitude-damping/) (result 276): OpenAI claims: Determines the unassisted classical capacity of every qubit generalized amplitude-damping channel, including all damping and thermal parameters. An explicit one-variable optimization gives the capacity, attained by independent two-state signal ensembles with collective decoding. Holevo capacity, minimum output entropy and regularized classical capacity are additive when tensoring with any finite-dimensional quantum channel. (Lean)
- [Threshold repetition for entangled games](https://gradientdamage.com/openai-math/threshold-repetition-for-entangled-games/) (result 277): OpenAI claims: Proves exponential threshold repetition for every finite two-player one-round game: if its entangled value is v < 1, the probability of winning at least a fraction v+δ of k independent repetitions decays exponentially in k, for 0 < δ < 1-v. Arbitrary joint finite-dimensional entangled strategies and correlated question distributions are allowed. (Lean)
- [Failure of Kohn–Sham ensemble representation](https://gradientdamage.com/openai-math/failure-of-kohn-sham-ensemble-representation/) (result 278): OpenAI claims: 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 L^(3/2)(ℝ³)+L^∞(ℝ³). This disproves Kohn–Sham ensemble representability for that potential class; the required nuclear charge is specified nonnumerically.
- [Exact quantum factoring over a fixed finite gate set](https://gradientdamage.com/openai-math/exact-quantum-factoring-over-a-fixed-finite-gate-set/) (result 279): OpenAI claims: Gives a polynomial-time uniform quantum circuit family that outputs the complete prime factorization of every integer with probability one. Both gate count and qubit count are polynomial in the input length, and one fixed finite gate set suffices. (Lean) Video: https://www.youtube.com/shorts/ugIzZGQoCuc.
- [Unitary vertex operator algebras and conformal nets](https://gradientdamage.com/openai-math/unitary-vertex-operator-algebras-and-conformal-nets/) (result 280): OpenAI claims: Proves the strongly rational case of the strong-locality conjecture: every simple unitary strongly rational complex vertex operator algebra generates a completely rational conformal net. Its simple modules are unitarizable, and its representation category agrees with the net’s finite-index sectors as a braided unitary tensor category. (Lean)
- [QAOA attains the SK optimum in the thermodynamic-first limit](https://gradientdamage.com/openai-math/qaoa-attains-the-sk-optimum-in-the-thermodynamic-first-limit/) (result 281): OpenAI claims: 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)
- [From scale symmetry to local conformal symmetry in four-dimensional QFT](https://gradientdamage.com/openai-math/from-scale-symmetry-to-local-conformal-symmetry-in-four-dimensional-qft/) (result 282): OpenAI claims: 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.
- [Polynomial-time unitary synthesis from a Boolean oracle](https://gradientdamage.com/openai-math/polynomial-time-unitary-synthesis-from-a-boolean-oracle/) (result 283): OpenAI claims: 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.
- [The optimal quartic separation between randomized and quantum queries](https://gradientdamage.com/openai-math/optimal-quartic-separation-between-randomized-and-quantum-queries/) (result 284): OpenAI claims: Shows that the universal bound R(f)=O((1+Q(f))⁴) for total Boolean functions is sharp in its exponent, ruling out every smaller power and disproving the conjectured cubic relation. Here R and Q are randomized and quantum worst-case bit-query complexities with error at most 1/3; computation between queries is unrestricted.

### Operator algebras

- [Counterexamples to Baum–Connes and Kadison–Kaplansky](https://gradientdamage.com/openai-math/counterexamples-to-baum-connes-and-kadison-kaplansky/) (result 285): OpenAI claims: Disproves the coefficient-free reduced Baum–Connes conjecture through a failure of rational injectivity and a separate failure of surjectivity of assembly. A finitely generated torsion-free example witnesses the injectivity failure. Separately, a torsion-free group has a nontrivial projection in its reduced group C∗-algebra, disproving the Kadison–Kaplansky conjecture.
- [Rigidity and arithmetic of lattice von Neumann algebras](https://gradientdamage.com/openai-math/rigidity-and-arithmetic-of-lattice-von-neumann-algebras/) (result 286): OpenAI claims: Classifies finite-index bimodules between scalar-twisted group factors of ICC groups commensurable with property-(T) lattices over characteristic-zero local fields and arbitrary ICC group factors. Every such bimodule is a summand of finite sums of models arising from finite-index subgroup isomorphisms and finite-dimensional projective representations. The classification also recovers the group, scalar cocycle and amplification scale up to the stated stable equivalence.
- [Isomorphism of the free group factors](https://gradientdamage.com/openai-math/isomorphism-of-the-free-group-factors/) (result 287): OpenAI claims: Resolves the free group factor isomorphism problem: L(𝔽₂) ≅ L(𝔽₃), and hence all interpolated free group factors, including L(𝔽_∞), are isomorphic. Their common factor has fundamental group ℝ_(> 0). (Lean)
- [Kadison's similarity conjecture](https://gradientdamage.com/openai-math/kadisons-similarity-conjecture/) (result 288): OpenAI claims: Proves Kadison's similarity conjecture: every bounded complex-linear unital algebra homomorphism from a unital complex C∗-algebra to operators on a Hilbert space becomes a *-homomorphism after conjugation by a bounded invertible operator. (Lean)
- [Strong Kadison–Kastler stability and its spatial boundaries](https://gradientdamage.com/openai-math/strong-kadison-kastler-stability-and-its-spatial-boundaries/) (result 289): OpenAI claims: Proves that sufficiently close unital von Neumann algebras on the same Hilbert space are conjugate by a unitary arbitrarily close to the identity, with a universal tolerance in the operator-norm distance between unit balls. Counterexamples show that near-identity conjugacy fails for one-sided near inclusions, and that arbitrarily close norm-separable C∗-algebras need not be ambiently unitarily conjugate. (Lean)
- [Relative bicentralizers and modular spectral recovery](https://gradientdamage.com/openai-math/relative-bicentralizers-and-modular-spectral-recovery/) (result 290): OpenAI claims: Proves Connes' bicentralizer conjecture for every type III1 factor with separable predual and every faithful normal state. More generally, for every inclusion N ⊂ M of von Neumann algebras with separable preduals admitting a faithful normal conditional expectation, constructs an amenable expected subalgebra P ⊂ N with P'∩ c(M)=N'∩ c(M), resolving the relative bicentralizer conjecture. (Lean)
- [Cuntz comparison, nuclear dimension, and equivariant Jiang–Su stability](https://gradientdamage.com/openai-math/cuntz-comparison-nuclear-dimension-and-equivariant-jiang-su-stability/) (result 291): OpenAI claims: Proves equivariant Jiang–Su stability for every countable discrete amenable group action on a simple separable unital infinite-dimensional nuclear stably finite Jiang–Su-stable C∗-algebra, resolving this case of Szabó's conjecture without restrictions on trace dynamics. The family also proves the unital Toms–Winter conjecture, equating strict comparison, finite nuclear dimension and Jiang–Su stability in the simple separable unital infinite-dimensional nuclear setting. (Lean)
- [Kirchberg's 𝒪₂ norm-ultrapower embedding problem](https://gradientdamage.com/openai-math/kirchbergs-o2-norm-ultrapower-embedding-problem/) (result 292): OpenAI claims: Constructs an explicit separable unital full group C∗-algebra that cannot embed unitally into the norm ultrapower of any fixed nonzero unital nuclear C∗-algebra, for any free ultrafilter on the natural numbers. Taking the target to be 𝒪₂ answers Kirchberg's norm-ultrapower embedding problem negatively. (Lean)
- [Invariant projections, hyperinvariant subspaces, and transitive algebras](https://gradientdamage.com/openai-math/invariant-projections-hyperinvariant-subspaces-and-transitive-algebras/) (result 293): OpenAI claims: Constructs a nonzero norm-quasinilpotent operator on every infinite-dimensional separable complex Hilbert space with no nonzero proper closed subspace invariant under every commuting operator. The construction also gives operators with no nontrivial invariant projection in the hyperfinite type II1 factor. (Lean)
- [Kaplansky's quasitrace conjecture and failure of tensor-product stable finiteness](https://gradientdamage.com/openai-math/kaplanskys-quasitrace-conjecture-and-failure-of-tensor-product-stable-finiteness/) (result 294): OpenAI claims: Disproves Kaplansky's quasitrace conjecture by constructing a separable unital complex C∗-algebra admitting normalized 2-quasitraces, all of which are nonadditive. As a consequence, two unital simple stably finite C∗-algebras can have a properly infinite minimal tensor product, with one factor Cᵣ*(𝔽₂). (Lean)
- [The Kadison–Ringrose cohomology conjecture](https://gradientdamage.com/openai-math/kadison-ringrose-cohomology-conjecture/) (result 295): OpenAI claims: Proves that every bounded Hochschild cocycle of degree at least two on a complex von Neumann algebra, with coefficients in the algebra itself, has a bounded primitive. Equivalently, all higher bounded Hochschild cohomology groups vanish, resolving the Kadison–Ringrose conjecture. (Lean)
- [The generator problem for finite factors](https://gradientdamage.com/openai-math/generator-problem-for-finite-factors/) (result 296): OpenAI claims: Proves that every type II1 factor with separable predual is generated by a single operator, equivalently by two self-adjoint operators, resolving the generator problem. More strongly, for every irreducible inclusion P ⊂ M of such factors, the unitaries u with M=W*(P,u) form a dense Gδ subset in the trace 2-norm topology. (Lean)
- [A ZFC counterexample to Naimark's problem](https://gradientdamage.com/openai-math/zfc-counterexample-to-naimarks-problem/) (result 297): OpenAI claims: Gives an alternative to Tanaka's ZFC construction of a unital infinite-dimensional simple complex C∗-algebra with a faithful tracial state and exactly one nonzero irreducible representation up to unitary equivalence. Thus the unrestricted compact-operator characterization fails without additional set-theoretic assumptions; the counterexample is nonseparable. (Lean)
- [Two notions of free entropy differ even when both are finite](https://gradientdamage.com/openai-math/two-notions-of-free-entropy-differ-even-when-both-are-finite/) (result 298): OpenAI claims: Constructs a bounded self-adjoint tuple in a tracial von Neumann algebra whose microstates and nonmicrostates free entropies satisfy -∞ < χ < χ* < ∞. This answers Voiculescu’s finite-entropy equality question negatively: the matrix-approximation and free-Fisher-information definitions differ even when both are finite. (Lean)
- [The Kirchberg–Rørdam character criterion and infinite tensor-power Jiang–Su stability](https://gradientdamage.com/openai-math/kirchberg-rrdam-character-criterion-and-infinite-tensor-power-jiang-su-stability/) (result 299): OpenAI claims: A nonzero unital separable complex C∗-algebra is Jiang–Su stable exactly when its norm central-sequence algebra has no characters, for every free ultrafilter. This answers the Kirchberg–Rørdam character question. Also, the infinite minimal tensor power of every such algebra without characters is Jiang–Su stable, answering the Dadarlat–Toms question. (Lean)
- [Approximation and quadratic strong-operator paving](https://gradientdamage.com/openai-math/approximation-and-quadratic-strong-operator-paving/) (result 300): OpenAI claims: Proves that every self-adjoint element of a complex von Neumann algebra admits strong-operator paving relative to any maximal abelian subalgebra with O(ε⁻²) blocks. The norm bound holds after compression by a projection arbitrarily close to the identity in the strong topology, resolving the Popa–Vaes quadratic paving conjecture.
- [Trace cones and Razak–Jacelon stabilization](https://gradientdamage.com/openai-math/trace-cones-and-razak-jacelon-stabilization/) (result 301): OpenAI claims: Classifies separable nuclear complex C∗-algebras after tensoring with the Razak–Jacelon algebra and the compact operators, using their full topological cones of extended lower-semicontinuous tracial weights. This answers Robert’s trace-cone question, including algebras with arbitrary ideal structure and both finite and infinite subquotients. (Lean)
- [Radius of comparison equals half the mean dimension](https://gradientdamage.com/openai-math/radius-of-comparison-equals-half-the-mean-dimension/) (result 302): OpenAI claims: For every minimal homeomorphism h of an infinite compact metrizable space X, the radius of comparison of C(X)⋊ₕℤ equals 1/2mdim(X,h), including infinite values. Zero mean dimension is equivalent to the small boundary property, Jiang–Su stability and finite nuclear dimension; in this case nuclear dimension is at most one.
- [Weak pure infiniteness and Cuntz-algebra absorption](https://gradientdamage.com/openai-math/weak-pure-infiniteness-and-cuntz-algebra-absorption/) (result 303): OpenAI claims: Resolves the ordinary-to-strong pure-infiniteness question of Kirchberg and Rørdam for complex C∗-algebras. For exact algebras, proper infiniteness of one fixed finite amplification of every positive element also suffices. Consequently, every separable nuclear algebra with this property absorbs 𝒪_∞, without unitality or simplicity assumptions. (Lean)

### Algebra

- [Serre’s intersection-multiplicity conjecture](https://gradientdamage.com/openai-math/serres-intersection-multiplicity-conjecture/) (result 193): OpenAI claims: Proves strict positivity of Serre's intersection multiplicity χᴿ(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.
- [Lech’s multiplicity conjecture](https://gradientdamage.com/openai-math/lechs-multiplicity-conjecture/) (result 194): OpenAI claims: 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)
- [A counterexample to the small Cohen–Macaulay module conjecture](https://gradientdamage.com/openai-math/counterexample-to-the-small-cohen-macaulay-module-conjecture/) (result 195): OpenAI claims: 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)
- [A counterexample to Kaplansky’s zero-divisor conjecture](https://gradientdamage.com/openai-math/counterexample-to-kaplanskys-zero-divisor-conjecture/) (result 196): OpenAI claims: Constructs a finitely presented torsion-free group G whose group algebra 𝔽₂[G] has nonzero zero divisors, disproving Kaplansky's zero-divisor conjecture. The group has a finite two-dimensional classifying space. (Lean)
- [A torsion-free group algebra that is not directly finite](https://gradientdamage.com/openai-math/torsion-free-group-algebra-that-is-not-directly-finite/) (result 197): OpenAI claims: 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)
- [A counterexample to finitistic-dimension finiteness](https://gradientdamage.com/openai-math/counterexample-to-finitistic-dimension-finiteness/) (result 198): OpenAI claims: Constructs a finite-dimensional complex algebra whose finite-dimensional modules have unbounded finite projective dimensions. This disproves the little finitistic-dimension conjecture. (Lean)
- [Counterexamples to Auslander–Reiten, Tachikawa and related homological conjectures](https://gradientdamage.com/openai-math/counterexamples-to-auslander-reiten-tachikawa-and-related-homological-conjectures/) (result 199): OpenAI claims: 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)
- [Eisenbud–Green–Harris and lex-plus-powers](https://gradientdamage.com/openai-math/eisenbud-green-harris-and-lex-plus-powers/) (result 200): OpenAI claims: 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.
- [A counterexample to Kurosh’s division-ring problem](https://gradientdamage.com/openai-math/counterexample-to-kuroshs-division-ring-problem/) (result 201): OpenAI claims: 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.
- [The blockwise Alperin weight conjecture](https://gradientdamage.com/openai-math/blockwise-alperin-weight-conjecture/) (result 202): OpenAI claims: 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.
- [Donovan's conjecture over fields and complete mixed-characteristic DVRs](https://gradientdamage.com/openai-math/donovans-conjecture-over-fields-and-complete-mixed-characteristic-dvrs/) (result 203): OpenAI claims: 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.
- [Tensor saturation for even spin groups](https://gradientdamage.com/openai-math/tensor-saturation-for-even-spin-groups/) (result 204): OpenAI claims: Proves saturation factor one for Spin (2n), n ≥ 2: for three dominant integral weights whose sum lies in the root lattice, an invariant at any common positive integral dilation already gives an invariant at the original weights. This resolves the type-D part of the simply-laced saturation conjecture.
- [Saxl’s conjecture and universal tensor squares](https://gradientdamage.com/openai-math/saxls-conjecture-and-universal-tensor-squares/) (result 205): OpenAI claims: 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)
- [Finite lattice representation and undecidability](https://gradientdamage.com/openai-math/finite-lattice-representation-and-undecidability/) (result 206): OpenAI claims: Some finite lattices are not congruence lattices of any finite algebra, answering the finite lattice representation problem negatively. Moreover, no algorithm decides whether a finite lattice has such a representation, or whether it is a full subgroup interval of a finite group. (Lean)
- [The ℓ¹-Bass conjecture for all discrete groups](https://gradientdamage.com/openai-math/l1-bass-conjecture-for-all-discrete-groups/) (result 207): OpenAI claims: Proves the ℓ1-Bass conjecture for every discrete group: Hattori–Stallings traces of idempotent matrices over ℓ¹(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)
- [Finite symmetric tensor categories and the Verlinde tower](https://gradientdamage.com/openai-math/finite-symmetric-tensor-categories-and-the-verlinde-tower/) (result 208): OpenAI claims: Proves that every finite symmetric tensor category over an algebraically closed field k of characteristic p > 0 admits a k-linear exact faithful strong symmetric monoidal fiber functor to a higher Verlinde category Ver_(pⁿ). The level may depend on the category, and the theorem includes characteristic two, resolving the finite case of the Benson–Etingof–Ostrik conjecture.
- [Integral counterexamples to Gersten’s conjecture](https://gradientdamage.com/openai-math/integral-counterexamples-to-gerstens-conjecture/) (result 209): OpenAI claims: 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.
- [Foulkes' conjecture for sixth powers and quadratic stabilization](https://gradientdamage.com/openai-math/foulkes-conjecture-for-sixth-powers-and-quadratic-stabilization/) (result 210): OpenAI claims: Proves the sixth case of Foulkes’ conjecture: Sym ⁶(Sym ᵇV) embeds equivariantly in Sym ᵇ(Sym ⁶V) for every b ≥ 6 and finite-dimensional complex V. More generally, the canonical multiplication map Sym ᵇ(Sym ᵃV) → Sym ᵃ(Sym ᵇV) is surjective for a ≥ 2 and b ≥ a(a-1), giving dimension-independent quadratic stabilization. (Lean)

### Topology

- [The Hilbert–Smith conjecture in every dimension](https://gradientdamage.com/openai-math/hilbert-smith-conjecture-in-every-dimension/) (result 304): OpenAI claims: Every locally compact second-countable Hausdorff group acting faithfully and jointly continuously on a connected finite-dimensional topological manifold is a Lie group. This proves the Hilbert–Smith conjecture in all finite dimensions, for Hausdorff second-countable manifolds without boundary. Video: https://www.youtube.com/shorts/7uq-r6tvByk.
- [Four-dimensional disk embedding and Wall's conjecture](https://gradientdamage.com/openai-math/four-dimensional-disk-embedding-and-walls-conjecture/) (result 305): OpenAI claims: The unrestricted four-dimensional disk-embedding conjecture fails: framed algebraic dual spheres do not suffice to obtain disjoint locally flat spanning disks. In particular, the free group F2 is not good in the sense of Freedman–Quinn. Also constructs a finitely presented integral Poincaré duality group of dimension four with a finite classifying space but no realization as the fundamental group of a closed aspherical topological four-manifold, disproving Wall's conjecture.
- [The purely cosmetic surgery conjecture](https://gradientdamage.com/openai-math/purely-cosmetic-surgery-conjecture/) (result 306): OpenAI claims: Distinct Dehn surgery slopes on a nontrivial smooth knot in S3 never produce orientation-preservingly homeomorphic manifolds, proving the purely cosmetic surgery conjecture. The statement includes the meridional slope.
- [Failure of rational injectivity for maximal coarse assembly](https://gradientdamage.com/openai-math/failure-of-rational-injectivity-for-maximal-coarse-assembly/) (result 307): OpenAI claims: Constructs a uniformly discrete bounded-geometry space whose maximal coarse assembly map is not rationally injective. The example is a coarse disjoint union of finite connected graphs of uniformly bounded degree, with an infinite-order kernel class. A companion gives the analogous failure for reduced coarse assembly, disproving the rational coarse Novikov conjecture. (Lean)
- [Finite Smith–Toda complexes at every height](https://gradientdamage.com/openai-math/finite-smith-toda-complexes-at-every-height/) (result 308): OpenAI claims: For every n ≥ 0, constructs a finite Smith–Toda spectrum at a prime p depending on n, with Brown–Peterson homology BP_*/(p,v₁,…,vₙ) and the canonical comodule structure. Thus Smith–Toda complexes exist at every height when the prime may vary; an explicit example realizes V(4) at p = 1009.
- [The Kervaire invariant problem at the prime three](https://gradientdamage.com/openai-math/kervaire-invariant-problem-at-the-prime-three/) (result 309): OpenAI claims: Resolves the odd-primary Kervaire invariant problem at the prime three: exactly the standard classes with indices 0, 2, and 3 survive in the mod-three Adams spectral sequence, in stems 10, 106, and 322. Each surviving detection coset contains an element of exact additive order three.
- [Quillen's conjecture in rational homology](https://gradientdamage.com/openai-math/quillens-conjecture-in-rational-homology/) (result 310): OpenAI claims: Proves the rational-homology form of Quillen's conjecture for every finite group and every prime. If the largest normal p-subgroup of G is trivial, the poset of nontrivial elementary abelian p-subgroups has nonzero augmented reduced rational homology and is therefore not contractible.
- [The Hovey–Strickland and Chai conjectures](https://gradientdamage.com/openai-math/hovey-strickland-and-chai-conjectures/) (result 311): OpenAI claims: Proves Chai's invariant-ideal conjecture for Lubin–Tate deformation rings over finite residue fields, at every prime and positive height n. Through the implication of Barthel–Heard–Naumann, this proves the Hovey–Strickland conjecture: dualizable K(n)-local spectra have exactly n+2 thick tensor ideals, and their Balmer spectrum is a chain of n+1 points.
- [The Grothendieck homotopy hypothesis](https://gradientdamage.com/openai-math/grothendieck-homotopy-hypothesis/) (result 312): OpenAI claims: Proves the Grothendieck homotopy hypothesis for ∞-groupoids associated with every Grothendieck coherator in the Ara–Henry convention: these algebraic objects recover the homotopy theory of spaces. (Lean)
- [Finite generation for the K(n)-local sphere](https://gradientdamage.com/openai-math/finite-generation-for-the-k-n-local-sphere/) (result 313): OpenAI claims: Answers the degreewise finiteness question of Hovey and Hovey–Strickland: every homotopy group of the K(n)-local sphere is a finitely generated ℤp-module, for every prime, positive height and integer degree. The same conclusion holds after K(n)-localizing any finite p-local spectrum.
- [Cyclic length and chromatic fixed-point loss](https://gradientdamage.com/openai-math/cyclic-length-and-chromatic-fixed-point-loss/) (result 314): OpenAI claims: Determines the optimal chromatic loss from geometric H-fixed points to geometric G-fixed points for every subgroup H of a finite p-group G. At every nonnegative height, the loss equals the shortest subnormal-chain length from H to G with cyclic quotients. Each quotient counts once regardless of order, and finite spectra witness sharpness.
- [The four-dimensional Singer conjecture](https://gradientdamage.com/openai-math/four-dimensional-singer-conjecture/) (result 315): OpenAI claims: Proves that the L2-Betti numbers of the universal cover of every closed connected aspherical topological four-manifold vanish outside degree two. More generally, the same conclusion holds for every finite connected aspherical integral Poincaré complex of formal dimension four, proving the four-dimensional Singer conjecture in this wider class.
- [Curtis’s conjecture](https://gradientdamage.com/openai-math/curtiss-conjecture/) (result 316): OpenAI claims: Proves Curtis’s conjecture: the positive-degree mod-two stable Hurewicz image of the sphere is spanned by the images of the Hopf-invariant-one classes η, ν, σ and the Kervaire-invariant-one classes that exist.
- [Thomason model structures in all strict higher dimensions](https://gradientdamage.com/openai-math/thomason-model-structures-in-all-strict-higher-dimensions/) (result 317): OpenAI claims: Resolves the Ara–Maltsiniotis conjecture: for every n ≥ 1 and n = ω, small strict globular n-categories admit proper combinatorial Thomason model structures Quillen equivalent to simplicial sets. Thus strict higher categories model the homotopy theory of spaces in every stated dimension. (Lean)
- [Chromatic splitting: filtrations and counterexamples](https://gradientdamage.com/openai-math/chromatic-splitting-filtrations-and-counterexamples/) (result 318): OpenAI claims: Disproves strong chromatic splitting at height three for primes p ≥ 5, and weak splitting for the derived p-completed sphere at heights p (p ≥ 5) and p+1 (p ≥ 7). Nevertheless, for n ≥ 1 and p > n+1, the overlap Lₙ₋₁L_(K(n))Sₚ^∧ admits a 2ⁿ-stage filtration by the predicted localized-sphere pieces. At height three and prime three, even finite assembly from such pieces fails in the category of E(2)-local modules over the derived completed sphere.
- [Counterexamples to finite generation at chromatic height two](https://gradientdamage.com/openai-math/counterexamples-to-finite-generation-at-chromatic-height-two/) (result 319): OpenAI claims: Refutes the Hahn–Wilson conjecture at chromatic height two. For every sufficiently large prime p, constructs a connective p-complete spectrum of exact fp-type two that cannot be built from completed BP⟨2⟩ by finitely many sums, shifts, cones and retracts. The examples nevertheless satisfy the finite and telescopic localization comparisons.
- [Nonhomeomorphic closed aspherical four-manifolds](https://gradientdamage.com/openai-math/nonhomeomorphic-closed-aspherical-four-manifolds/) (result 320): OpenAI claims: Constructs closed connected aspherical topological four-manifolds that are homotopy equivalent but not homeomorphic, with a common word-hyperbolic fundamental group. This disproves even the homeomorphism-existence formulation of the Borel conjecture in dimension four.
- [A counterexample to Wall's finite D(2) problem](https://gradientdamage.com/openai-math/counterexample-to-walls-finite-d-2-problem/) (result 321): OpenAI claims: Constructs a finite connected three-dimensional CW complex whose universal cover has no integral homology above degree two and whose third cohomology vanishes for every local coefficient module, but which has no finite two-dimensional homotopy model. This disproves Wall's finite D(2) conjecture; the example has infinite fundamental group.

### Partial differential equations

- [Global smoothness for relativistic Vlasov–Maxwell](https://gradientdamage.com/openai-math/global-smoothness-for-relativistic-vlasov-maxwell/) (result 362): OpenAI claims: Proves large-data global existence and uniqueness for the three-dimensional, one-species relativistic Vlasov–Maxwell system. Smooth admissible initial data may be arbitrary provided the particle density is compactly supported and the electromagnetic fields have finite energy and bounded derivatives of every order; the solution remains smooth on every finite time interval. (Lean) Video: https://www.youtube.com/shorts/gpIfWdqCISI.
- [Nonuniqueness with local conservation for the hard-sphere Boltzmann equation](https://gradientdamage.com/openai-math/nonuniqueness-with-local-conservation-for-the-hard-sphere-boltzmann-equation/) (result 363): OpenAI claims: Constructs two distinct global entropy solutions of the three-dimensional periodic hard-sphere Boltzmann equation from the same nonnegative initial density, with bounded velocity support and finite mass, energy and absolute entropy. Both are strongly continuous in L1 and satisfy exact local conservation of mass, momentum and kinetic energy. (Lean)
- [Kinetic limits and fluctuations over the Boltzmann lifespan](https://gradientdamage.com/openai-math/kinetic-limits-and-fluctuations-over-the-boltzmann-lifespan/) (result 364): OpenAI claims: Derives the nonlinear Boltzmann equation from three-dimensional grand-canonical Newtonian gases throughout every regular kinetic interval with uniform Gaussian decay. Stable finite-range radial potentials may have attractive wells and a singular repulsive core; initial pair exclusion and spatially summable Gaussian density and gradient bounds are assumed. A companion gives finite-dimensional hard-sphere Gaussian fluctuations, centered at the exact microscopic expectation and governed by the linear fluctuating Boltzmann equation.
- [Joint metric and connection recovery from one boundary patch](https://gradientdamage.com/openai-math/joint-metric-and-connection-recovery-from-one-boundary-patch/) (result 365): OpenAI claims: Zero-frequency measurements on any nonempty open boundary patch determine a smooth metric and smooth unitary connection on a trivial Hermitian rank-two bundle over a compact connected manifold of dimension at least three, up to diffeomorphism and gauge fixed on that patch. Inputs and observations use the same patch. In contrast, distinct uniformly positive bounded measurable scalar conductivities on a three-dimensional ball can have identical full-boundary data. (Lean)
- [The planar Mumford–Shah regularity conjecture and local weak-L4 gradient bounds](https://gradientdamage.com/openai-math/planar-mumford-shah-regularity-conjecture-and-local-weak-l4-gradient-bounds/) (result 366): OpenAI claims: Resolves the interior regularity conjecture for reduced absolute planar Mumford–Shah minimizers with bounded fidelity data. Locally, the closed discontinuity set is a C^(1,α) arc, a regular crack tip, or three arcs meeting at 120°; only finitely many global connected components meet any compact interior region.
- [The critical dimension for the one-phase Bernoulli problem](https://gradientdamage.com/openai-math/critical-dimension-for-the-one-phase-bernoulli-problem/) (result 367): OpenAI claims: Establishes seven as the first dimension admitting a nonflat, one-homogeneous global minimizer of the one-phase Bernoulli energy. Consequently, minimizing free boundaries are smooth through dimension six, and their singular sets have dimension at most n-7 in higher dimensions. (Lean)
- [The three-dimensional Ball–Evans approximation problem](https://gradientdamage.com/openai-math/three-dimensional-ball-evans-approximation-problem/) (result 368): OpenAI claims: Resolves the three-dimensional Ball–Evans approximation problem: every W^(1,p) homeomorphism between arbitrary bounded domains in ℝ3, for 1 ≤ p < ∞, is a strong W^(1,p) limit of smooth diffeomorphisms onto the same target.
- [The hot spots conjecture for simply connected planar domains](https://gradientdamage.com/openai-math/hot-spots-conjecture-for-simply-connected-planar-domains/) (result 369): OpenAI claims: Proves a strict form of Burdzy's simply connected hot spots conjecture. On every smooth bounded simply connected planar domain, each nonzero eigenfunction for the first positive Neumann eigenvalue has no interior critical point, so all global extrema lie on the boundary. Eigenvalue multiplicity is allowed. (Lean)
- [The Lane–Emden and Hénon–Lane–Emden conjectures](https://gradientdamage.com/openai-math/lane-emden-and-henon-lane-emden-conjectures/) (result 370): OpenAI claims: Resolves the subcritical Lane–Emden conjecture and its weighted Hénon extension. For n ≥ 2, p,q > 0 and real A, B, the system -Δ u=|x|ᴬ vᵖ, -Δ v=|x|ᴮ u^q has no positive entire solution when (n+A)/(p+1)+(n+B)/(q+1) > n-2, with solutions continuous at the origin and classical elsewhere. No symmetry or growth assumption is needed. Known radial existence gives the exact existence criterion for n ≥ 3 and A,B > -2. (Lean)
- [Stable blowup for the defocusing Schrödinger equation](https://gradientdamage.com/openai-math/stable-blowup-for-the-defocusing-schrodinger-equation/) (result 371): OpenAI claims: For a sufficiently large odd nonlinearity power, constructs a nonempty open set of initial data in Hᵏ(𝕋¹²), with k > 8, whose solutions of the scalar defocusing nonlinear Schrödinger equation blow up in finite time. Thus finite-time blowup is stable under Sobolev perturbations in this supercritical regime. (Lean)
- [Global uniqueness in smooth isotropic elasticity](https://gradientdamage.com/openai-math/global-uniqueness-in-smooth-isotropic-elasticity/) (result 372): OpenAI claims: Proves that full static boundary displacement-to-traction data determine both smooth real Lamé moduli on every bounded connected smooth domain in ℝ3, provided μ > 0 and 3λ+2μ > 0 on the closure. Neither analyticity, proximity to constant coefficients nor prior knowledge near the boundary is required. (Lean)
- [Nonattainment of the three-marginal Coulomb Monge problem](https://gradientdamage.com/openai-math/nonattainment-of-the-three-marginal-coulomb-monge-problem/) (result 373): OpenAI claims: An optimal three-particle Coulomb configuration need not be a deterministic function of the first particle, even for smooth identical spatial densities. The Monge and Kantorovich infima agree, but the Monge infimum is not attained. The same phenomenon occurs for every inverse-power Riesz exponent in each dimension at least two, with a suitable density in each case. (Lean)
- [Sharp one-third stability of Brenier maps](https://gradientdamage.com/openai-math/sharp-one-third-stability-of-brenier-maps/) (result 374): OpenAI claims: For uniform source measure ρ on a compact convex body with interior in dimension at least two, quadratic optimal transport maps satisfy ‖T_μ-T_ν‖_(L²(ρ)) ≤ C W₂(μ,ν)^(1/3) uniformly over targets in a fixed compact set. The exponent is sharp, even for three-atom targets, disproving Letrouit's conjectured square-root bound. (Lean)
- [De Giorgi's conjecture in dimension eight](https://gradientdamage.com/openai-math/de-giorgis-conjecture-in-dimension-eight/) (result 375): OpenAI claims: Proves De Giorgi's conjecture at its sharp dimension-eight endpoint: every entire C2 solution u:ℝ⁸ → (-1,1) of Δ u=u³-u that is strictly increasing in one direction depends on only one linear coordinate. A stronger theorem classifies all stable entire solutions v:ℝ⁷ → [-1,1] as constant wells or planar transitions, without an energy-growth assumption.
- [Universal computation in forced Navier–Stokes flows](https://gradientdamage.com/openai-math/universal-computation-in-forced-navier-stokes-flows/) (result 376): OpenAI claims: Constructs viscous incompressible flows starting from rest on a fixed flat three-dimensional domain that perform universal computation under smooth external forcing. A terminating compiler turns a Turing machine and input into a finite program for the force, so a designated particle reaches a fixed region exactly when the machine halts. The viscosity is fixed, positive and computable. (Lean) Video: https://www.youtube.com/shorts/YME5mZZfiPY.
- [Interior C^(1,α) regularity for infinity-harmonic functions](https://gradientdamage.com/openai-math/interior-c-1-regularity-for-infinity-harmonic-functions/) (result 377): OpenAI claims: Proves uniform interior C^(1,α_d) regularity for bounded infinity-harmonic functions in every dimension d ≥ 3, for a positive exponent depending only on dimension. The gradient's supremum norm and Hölder seminorm on the half unit ball are bounded by a dimension-dependent constant times the oscillation on the unit ball. The exponent is not explicit.

### Real and complex analysis

- [Koebe’s circle-domain conjecture](https://gradientdamage.com/openai-math/koebes-circle-domain-conjecture/) (result 071): OpenAI claims: Resolves the existence part of Koebe's circle-domain conjecture: every domain in the Riemann sphere is conformally equivalent to a domain whose complementary components are round disks or points. It also proves that circle domains with conformally removable boundary are rigid, meaning every conformal equivalence to another circle domain is Möbius, establishing this direction of the He–Schramm conjecture. (Lean)
- [Brennan's conjecture and the integral-means spectrum](https://gradientdamage.com/openai-math/brennans-conjecture-and-the-integral-means-spectrum/) (result 072): OpenAI claims: Proves Brennan's conjecture: for every conformal bijection ϕ from a simply connected plane domain onto the disk, |ϕ'|ˢ is area-integrable for 4/3 < s < 4. The sharp universal integral-means identity is B_𝒮(t)=|t|-1 for t ≤ −2. A strict bound B_b(-1) < 1/4 for bounded univalent functions disproves Kraetzer's prediction at that parameter. (Lean)
- [The Falconer distance conjecture](https://gradientdamage.com/openai-math/falconer-distance-conjecture/) (result 073): OpenAI claims: Resolves the Falconer distance conjecture in every dimension d ≥ 2: every compact set E ⊂ ℝᵈ with Hausdorff dimension greater than d/2 determines a set of Euclidean distances of positive Lebesgue measure. (Lean)
- [Kakeya in three and four dimensions](https://gradientdamage.com/openai-math/kakeya-in-three-and-four-dimensions/) (result 074): OpenAI claims: Resolves the Kakeya maximal conjecture in three dimensions and the Hausdorff-dimension conjecture in four. In three dimensions, the radius-δ tube maximal operator maps L³(ℝ³) to L³(S²) with norm O_ε(δ^(-ε)) for every ε > 0. In four dimensions, every set containing a unit segment in every direction has Hausdorff dimension four. Video: https://www.youtube.com/shorts/c6nBODRzsqg.
- [The L log L Fourier-convergence conjecture](https://gradientdamage.com/openai-math/l-log-l-fourier-convergence-conjecture/) (result 075): OpenAI claims: Proves that the ordinary symmetric Fourier partial sums of every complex-valued function in L log L(𝕋) converge almost everywhere along the full sequence. This resolves the classical sufficiency conjecture at the L log L scale. (Lean) Video: https://www.youtube.com/shorts/OyH0voIAmQU.
- [Real ultraflat Littlewood polynomials and unbounded binary merit factors](https://gradientdamage.com/openai-math/real-ultraflat-littlewood-polynomials-and-unbounded-binary-merit-factors/) (result 076): OpenAI claims: Constructs polynomials with N consecutive coefficients in {-1,1} whose modulus is (1+o(1))√N uniformly on the entire unit circle, for every sufficiently large integer length N. Thus real Littlewood polynomials are ultraflat, including at the real endpoints. Their binary merit factors tend to infinity, disproving Turyn's bounded-merit-factor conjecture. (Lean)
- [Fourier restriction for positively curved surfaces](https://gradientdamage.com/openai-math/fourier-restriction-for-positively-curved-surfaces/) (result 077): OpenAI claims: Proves the diagonal Fourier extension conjecture for positively curved surfaces in three dimensions. For every compact smooth positively curved surface Σ ⊂ ℝ³, including surfaces with boundary, the extension operator is bounded from Lᵖ(Σ) to Lᵖ(ℝ³) for every p > 3.
- [The three-dimensional Bochner–Riesz conjecture](https://gradientdamage.com/openai-math/three-dimensional-bochner-riesz-conjecture/) (result 078): OpenAI claims: Resolves the three-dimensional Bochner–Riesz conjecture in its strict range: the Bochner–Riesz multipliers of order δ are bounded on Lᵖ(ℝ³) for every 1 ≤ p ≤ ∞ whenever δ > max {3|1/p-1/2|-1/2,0}.
- [Local smoothing in three dimensions](https://gradientdamage.com/openai-math/local-smoothing-in-three-dimensions/) (result 079): OpenAI claims: Resolves Sogge's local smoothing conjecture for the Euclidean wave equation in three spatial dimensions. The estimate holds throughout the full strict range 2 < p < ∞, with Sobolev regularity above max {0,1-3/p}. In particular, the critical L3 estimate holds with every positive Sobolev loss.
- [The exact Sobolev endpoint for Schrödinger convergence](https://gradientdamage.com/openai-math/exact-sobolev-endpoint-for-schrodinger-convergence/) (result 080): OpenAI claims: Proves almost-everywhere convergence e^(itΔ)f → f as t↓0 for every f ∈ H^(n/(2(n+1)))(ℝⁿ) and every dimension n ≥ 2. This attains the sharp Sobolev equality case of Carleson's Schrödinger convergence problem, including the planar endpoint H1/3.
- [Riesz transforms and rectifiability in higher codimension](https://gradientdamage.com/openai-math/riesz-transforms-and-rectifiability-in-higher-codimension/) (result 081): OpenAI claims: Resolves the remaining higher-codimension Riesz-transform rectifiability problem: for d ≥ 4 and 2 ≤ n ≤ d-2, an n-Ahlfors–David regular Radon measure on ℝd is uniformly n-rectifiable whenever its n-dimensional Riesz transform is uniformly L2-bounded over all positive hard truncations. The rectifiability bounds depend only on dimension, regularity and operator bounds. (Lean)
- [Annular variation and dyadic absolute bounds for the triangular Hilbert transform](https://gradientdamage.com/openai-math/annular-variation-and-dyadic-absolute-bounds-for-the-triangular-hilbert-transform/) (result 082): OpenAI claims: Proves maximal and annular r-variation bounds, for every r > 2, from complex L³(ℝ²)× L³(ℝ²) to L^(3/2)(ℝ²). The maximal estimate controls both hard truncation endpoints and gives almost-everywhere and norm convergence. Pairing with a third input settles the triangular Hilbert transform estimate at the symmetric L³× L³× L³ point. (Lean)
- [Hilbert transforms along Lipschitz directions](https://gradientdamage.com/openai-math/hilbert-transforms-along-lipschitz-directions/) (result 083): OpenAI claims: Proves a uniform strong L2 bound for the planar Hilbert transform along any Lipschitz unit vector field, at integration lengths bounded by an absolute multiple of its reciprocal Lipschitz constant. The estimate is uniform over inner truncations and yields an L2-bounded principal-value operator, establishing Stein's weak-type conjecture at this short scale. (Lean)
- [The geometric case of the Erdős similarity conjecture](https://gradientdamage.com/openai-math/geometric-case-of-the-erdos-similarity-conjecture/) (result 084): OpenAI claims: For every fixed q ∈ (0,1), constructs compact subsets of [0,1] with measure arbitrarily close to one containing no translated and nontrivially dilated copy of {qⁿ:n ≥ 1}, with dilations of either sign. This resolves the geometric-progression case of the Erdős similarity conjecture for every ratio. (Lean) Video: https://www.youtube.com/shorts/fzzOF9l0WyQ.
- [Endpoint Sobolev regularity of centered disk averages](https://gradientdamage.com/openai-math/endpoint-sobolev-regularity-of-centered-disk-averages/) (result 085): OpenAI claims: Resolves the planar centered-disk case of the Hajłasz–Onninen maximal-function regularity problem. For every real f ∈ W^(1,1)(ℝ²), the centered disk maximal function satisfies ‖∇ Mf‖₁ ≤ C‖∇ f‖₁ with an absolute constant. It belongs locally to W^(1,1) and has a globally integrable weak gradient. (Lean)
- [An L3 bound for the trilinear Hilbert transform](https://gradientdamage.com/openai-math/l3-bound-for-the-trilinear-hilbert-transform/) (result 086): OpenAI claims: Proves that the principal-value trilinear Hilbert transform with shifts x-t, x-2t, x-3t is bounded from L³(ℝ)³ to L¹(ℝ). This resolves the L3 exponent case of the standard conjecture for slopes 1, 2, 3.

### Convex and metric geometry

- [The Mahler conjectures, functional inequalities and polar-product symplectic width](https://gradientdamage.com/openai-math/mahler-conjectures-functional-inequalities-and-polar-product-symplectic-width/) (result 087): OpenAI claims: Resolves the symmetric and nonsymmetric geometric Mahler conjectures in every dimension, with Hanner polytopes and simplices as the respective volume-product minimizers and all equality cases classified. The corresponding sharp functional Mahler inequalities also hold. For n ≥ 2, every symmetric polar product K× K° in dimension 2n has Gromov width 4. (Lean) Video: https://www.youtube.com/shorts/wQGjvjo64AA.
- [Sharp projection-body inequalities and a counterexample to simplex maximization](https://gradientdamage.com/openai-math/sharp-projection-body-inequalities-and-a-counterexample-to-simplex-maximization/) (result 088): OpenAI claims: Proves Petty's projection-volume conjecture in the remaining dimensions n ≥ 4: ellipsoids uniquely minimize projection-body volume at fixed body volume. Also establishes the full Lutwak–Petty projection inequalities. In contrast, products of simplices exceed Brannen's proposed simplex maximum for normalized projection-body volume by an exponential factor in every sufficiently large dimension. (Lean)
- [Bounded-distortion L1 embeddings of planar and bounded-treewidth graphs](https://gradientdamage.com/openai-math/bounded-distortion-l1-embeddings-of-planar-and-bounded-treewidth-graphs/) (result 089): OpenAI claims: Resolves the planar and bounded-treewidth cases of the Gupta–Newman–Rabinovich–Sinclair conjecture. Shortest-path metrics of finite connected graphs with arbitrary positive edge lengths embed into real L1 with universal distortion for planar graphs, and distortion depending only on treewidth for bounded-treewidth graphs. The corresponding multicommodity flow–cut gaps are uniformly bounded. (Lean)
- [Triangular-lattice optimality, long-range Riesz and Coulomb energies, and spherical logarithmic energy](https://gradientdamage.com/openai-math/triangular-lattice-optimality-long-range-riesz-and-coulomb-energies-and-spherical-logarithmic-energy/) (result 090): OpenAI claims: Proves that the triangular lattice minimizes the lower limit of energy per particle for every nonnegative completely monotone potential of squared distance among locally finite planar configurations of centered-disk density one. It also minimizes unit-background renormalized Riesz energies for 0 < s < 2 and Coulomb energy, resolving Sandier–Serfaty and the two-dimensional Brauchart–Hardin–Saff conjecture on the linear term of optimal spherical logarithmic energy. (Lean)
- [Logarithmic and Lp Brunn–Minkowski inequalities and the B-conjecture](https://gradientdamage.com/openai-math/logarithmic-and-lp-brunn-minkowski-inequalities-and-the-b-conjecture/) (result 091): OpenAI claims: Proves the logarithmic Brunn–Minkowski inequality for origin-symmetric convex bodies in every dimension, and the scalar-dilation B-conjecture for all even log-concave Radon measures. For Lebesgue volume it also proves the additive Lp Brunn–Minkowski inequality for full-dimensional origin-symmetric convex bodies throughout 0 < p < 1. (Lean)
- [The optimal order of convex-body covering density](https://gradientdamage.com/openai-math/optimal-order-of-convex-body-covering-density/) (result 092): OpenAI claims: Determines the optimal worst-case covering density as Θ(n log n), for both lattice and unrestricted translative coverings. Every convex body in ℝn, n ≥ 2, admits a lattice covering of density at most Cn log n; centrally symmetric examples in every sufficiently large dimension require at least cn log n even without the lattice restriction, for absolute c,C > 0. (Lean)
- [Dimension-free logarithmic Sobolev inequality for subgaussian log-concave measures](https://gradientdamage.com/openai-math/dimension-free-logarithmic-sobolev-inequality-for-subgaussian-log-concave-measures/) (result 093): OpenAI claims: Proves a dimension-free logarithmic Sobolev inequality for centered log-concave densities with uniformly subgaussian linear marginals, with constant bounded by a universal multiple of the squared linear subgaussian parameter.
- [Subpolynomial dimension reduction in Lp](https://gradientdamage.com/openai-math/subpolynomial-dimension-reduction-in-lp/) (result 094): OpenAI claims: For every fixed 1 < p < ∞ and distortion D > 1, every n-point subset of real Lp embeds into ℓₚᵈ with distortion at most D and dimension d=nᵒ⁽¹⁾, answering Naor's sublinear-dimension question for p ≠ 2. In contrast, exact embeddings require worst-case dimension Θ(n²) when p ≠ 2. (Lean)
- [Hyperbolicity cones without semidefinite lifts](https://gradientdamage.com/openai-math/hyperbolicity-cones-without-semidefinite-lifts/) (result 095): OpenAI claims: Disproves the Projected Lax conjecture: some hyperbolicity cones are not spectrahedral shadows. The examples admit no exact finite affine semidefinite lift, regardless of the number of auxiliary variables or the real coefficients used. This also disproves the generalized Lax conjecture that every hyperbolicity cone is spectrahedral. (Lean)
- [The Gaussian propeller conjecture in every dimension](https://gradientdamage.com/openai-math/gaussian-propeller-conjecture-in-every-dimension/) (result 096): OpenAI claims: Proves that the sum of squared Gaussian first moments of any finite measurable partition is at most 9/(8π). In dimension at least two, three planar sectors of angle 2π/3, extended orthogonally, attain the bound. Combined with the separate Unique Games theorem, this proves NP-hardness of improving the loss factor (8π/9)(1-1/k) for identity-target kernel clustering with fixed k ≥ 3 on rational centered positive semidefinite inputs. (Lean)
- [The Euclidean Steinitz–Bergström bound](https://gradientdamage.com/openai-math/euclidean-steinitz-bergstrom-bound/) (result 097): OpenAI claims: Proves that any finite sequence in the Euclidean unit ball of ℝd admits signs keeping every partial sum within C√d, independently of length. Consequently every zero-sum family can be reordered with the same bound on unsigned partial sums. A matching lower bound gives the optimal order S₂(d)=Θ(√d). (Lean)
- [Compact counterexamples to bi-Lipschitz dimension reduction](https://gradientdamage.com/openai-math/compact-counterexamples-to-bi-lipschitz-dimension-reduction/) (result 098): OpenAI claims: Every infinite-dimensional real Banach space contains a compact doubling set that admits no bi-Lipschitz embedding into any finite-dimensional normed space. The doubling constant is universal. This answers the Lang–Plaut problem negatively, even for compact subsets of Hilbert space. (Lean)
- [The sharp exponential scale of edit-distance distortion](https://gradientdamage.com/openai-math/sharp-exponential-scale-of-edit-distance-distortion/) (result 099): OpenAI claims: Determines the least distortion of embedding edit distance on words of length at most d into real ℓ1: it is exp(Θ(√(log d log log d))). Insertions, deletions and substitutions have unit cost. The constants are uniform over all finite alphabets with at least two symbols, even when the alphabet grows with d; binary words already force the lower bound. (Lean)
- [Cylinder coverings below the half-area bound](https://gradientdamage.com/openai-math/cylinder-coverings-below-the-half-area-bound/) (result 100): OpenAI claims: Covers the entire closed regular tetrahedron by finitely many cylinders with compact triangular perpendicular bases whose total area is less than half its smallest orthogonal projection area. This disproves Bang's half-area cylinder-covering bound and the stronger directionwise normalized conjecture in dimension three. (Lean)
- [The sharp simplex conjecture for isotropic constants](https://gradientdamage.com/openai-math/sharp-simplex-conjecture-for-isotropic-constants/) (result 101): OpenAI claims: Proves that simplices uniquely maximize the isotropic constant among convex bodies in every dimension, resolving the strong isotropic constant conjecture. Also establishes the sharp entropy lower bound for log-concave probability densities, with equality precisely for invertible affine images of products of one-sided exponential laws.

### Group theory

- [Cannon's conjecture](https://gradientdamage.com/openai-math/cannons-conjecture/) (result 246): OpenAI claims: 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)
- [An infinite finitely presented residually finite 2-group and a finitely presented nil algebra](https://gradientdamage.com/openai-math/infinite-finitely-presented-residually-finite-2-group-and-a-finitely-presented-nil-algebra/) (result 247): OpenAI claims: 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)
- [Thompson's group F is nonamenable](https://gradientdamage.com/openai-math/thompsons-group-f-is-nonamenable/) (result 248): OpenAI claims: Proves that Thompson's group F, the group of dyadic piecewise linear homeomorphisms of the interval, is nonamenable, resolving its longstanding amenability problem. (Lean)
- [A finitely generated Eilenberg–Ganea counterexample](https://gradientdamage.com/openai-math/finitely-generated-eilenberg-ganea-counterexample/) (result 249): OpenAI claims: 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)
- [Boone–Higman embeddings with higher finiteness](https://gradientdamage.com/openai-math/boone-higman-embeddings-with-higher-finiteness/) (result 250): OpenAI claims: 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)
- [Amenability, unitarizability, and strong Ulam stability](https://gradientdamage.com/openai-math/amenability-unitarizability-and-strong-ulam-stability/) (result 251): OpenAI claims: Resolves Dixmier's problem for all discrete groups: amenability is equivalent to every uniformly bounded Hilbert-space representation being similar to a unitary representation. For countable discrete groups, amenability is also equivalent to strong Ulam stability: sufficiently accurate unitary approximate representations are uniformly close in operator norm to genuine representations on the same, possibly infinite-dimensional, Hilbert space. (Lean)
- [A torsion-free hyperbolic group that is neither residually finite nor linear over any field](https://gradientdamage.com/openai-math/torsion-free-hyperbolic-group-that-is-neither-residually-finite-nor-linear-over-any-field/) (result 252): OpenAI claims: 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)
- [An infinite finitely presented simple amenable group](https://gradientdamage.com/openai-math/infinite-finitely-presented-simple-amenable-group/) (result 253): OpenAI claims: Constructs an infinite finitely presented simple amenable group, answering the longstanding question of whether these properties can occur simultaneously. (Lean)
- [Classifying spaces and geometric obstructions for Artin groups](https://gradientdamage.com/openai-math/classifying-spaces-and-geometric-obstructions-for-artin-groups/) (result 254): OpenAI claims: The Salvetti complex of every finite-rank Artin group is aspherical, proving the Artin K(π,1) conjecture. Arbitrary intersections of its parabolic subgroups are parabolic, proving the Parabolic Intersection Conjecture. An explicit Artin group admits no proper cocompact isometric action on any nonempty proper CAT(0) space. (Lean)
- [Quasi-isometric recognition of virtually polycyclic groups](https://gradientdamage.com/openai-math/quasi-isometric-recognition-of-virtually-polycyclic-groups/) (result 255): OpenAI claims: 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)
- [Nonsingular systems of equations over arbitrary groups](https://gradientdamage.com/openai-math/nonsingular-systems-of-equations-over-arbitrary-groups/) (result 256): OpenAI claims: Proves that every finite system of equations over an arbitrary group whose exponent-sum matrix has full row rank over ℚ has a simultaneous solution in an overgroup, resolving Howie's conjecture. The coefficient group embeds in the presented quotient. A companion proves Kervaire's conjecture: adjoining one generator and one relation cannot trivialize a nontrivial group. (Lean)
- [A hyperbolic group without a geometric CAT(0) action](https://gradientdamage.com/openai-math/hyperbolic-group-without-a-geometric-cat-0-action/) (result 257): OpenAI claims: Answers negatively whether every word-hyperbolic group is a CAT(0) group. Constructs one with a finite classifying space but no proper cocompact isometric action on any proper complete CAT (0) space, in any dimension. (Lean)
- [Gersten’s conjecture and virtual compact specialness of one-relator groups](https://gradientdamage.com/openai-math/gerstens-conjecture-and-virtual-compact-specialness-of-one-relator-groups/) (result 258): OpenAI claims: 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.
- [A group without fixed price](https://gradientdamage.com/openai-math/group-without-fixed-price/) (result 259): OpenAI claims: Constructs a finitely generated group with two essentially free probability-measure-preserving actions of different costs, answering the general fixed-price problem negatively. Its Bernoulli action has cost bounded away from one, while a sequence of finite height extensions has costs tending to one.

### Dynamical systems and ergodic theory

- [Hilbert's sixteenth problem: uniform bounds for limit cycles](https://gradientdamage.com/openai-math/hilberts-sixteenth-problem-uniform-bounds-for-limit-cycles/) (result 143): OpenAI claims: Resolves the uniform boundedness assertion in Hilbert's sixteenth problem: the number of isolated periodic orbits of a real planar polynomial vector field is bounded by a finite constant depending only on its degree. For classical quintic Liénard systems, the exact maximum is two limit cycles. (Lean) Video: https://www.youtube.com/shorts/NGIyDMEDJEw.
- [Banach’s simple Lebesgue-spectrum problem](https://gradientdamage.com/openai-math/banachs-simple-lebesgue-spectrum-problem/) (result 144): OpenAI claims: 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)
- [Rokhlin’s multiple-mixing problem](https://gradientdamage.com/openai-math/rokhlins-multiple-mixing-problem/) (result 145): OpenAI claims: 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)
- [Positive metric entropy for the standard map](https://gradientdamage.com/openai-math/positive-metric-entropy-for-the-standard-map/) (result 146): OpenAI claims: Proves that the standard sine map on the two-dimensional torus has positive metric entropy with respect to area for every sufficiently large positive parameter. This establishes Sinai's positive-parameter-measure conjecture for the original family, with the stronger conclusion of a full parameter tail. (Lean)
- [The near-boundary Birkhoff conjecture](https://gradientdamage.com/openai-math/near-boundary-birkhoff-conjecture/) (result 147): OpenAI claims: 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.
- [The entropy-rate dimension formula for self-similar measures](https://gradientdamage.com/openai-math/entropy-rate-dimension-formula-for-self-similar-measures/) (result 148): OpenAI claims: For every self-similar measure on the line generated by finitely many contracting similarities, proves dim_Hμ=min {1,h_(RW)/χ}, where h_(RW) 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)
- [Classwise permanence for weakly reversible mass-action systems](https://gradientdamage.com/openai-math/classwise-permanence-for-weakly-reversible-mass-action-systems/) (result 149): OpenAI claims: 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)
- [Weak mixing of triangular billiards with an irrational angle](https://gradientdamage.com/openai-math/weak-mixing-of-triangular-billiards-with-an-irrational-angle/) (result 150): OpenAI claims: Proves that the billiard flow in every nondegenerate Euclidean triangle with at least one angle irrational relative to π is weakly mixing for normalized area times uniform direction. This strengthens ergodicity on the entire irrational-angle class, with no genericity or Diophantine restrictions. (Lean) Video: https://www.youtube.com/shorts/FHWC7PiYtG8.
- [A C1 counterexample to the entropy conjecture](https://gradientdamage.com/openai-math/c1-counterexample-to-the-entropy-conjecture/) (result 151): OpenAI claims: 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)
- [Zero entropy does not guarantee a smooth positive-volume model](https://gradientdamage.com/openai-math/zero-entropy-does-not-guarantee-a-smooth-positive-volume-model/) (result 152): OpenAI claims: 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)
- [Arithmetic classification and non-Pisot singularity for Bernoulli convolutions](https://gradientdamage.com/openai-math/arithmetic-classification-and-non-pisot-singularity-for-bernoulli-convolutions/) (result 153): OpenAI claims: 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.
- [Pointwise multiple ergodic averages for mixing transformations](https://gradientdamage.com/openai-math/pointwise-multiple-ergodic-averages-for-mixing-transformations/) (result 154): OpenAI claims: Proves almost-everywhere convergence of consecutive multiple ergodic averages of every finite length for invertible mixing probability-preserving transformations. For each fixed tuple of bounded functions, the limit is the product of their integrals, along all positive averaging lengths. No mixing rate or standardness assumption on the probability space is required.

### Functional analysis

- [Tingley’s sphere-isometry problem](https://gradientdamage.com/openai-math/tingleys-sphere-isometry-problem/) (result 322): OpenAI claims: Resolves Tingley's problem: every surjective isometry between the unit spheres of nonzero real Banach spaces extends uniquely to a surjective real-linear isometry of the whole spaces. No dimension restriction is imposed, so the metric geometry of the unit sphere determines the Banach space up to linear isometry. (Lean)
- [Independence of the separable quotient problem](https://gradientdamage.com/openai-math/independence-of-the-separable-quotient-problem/) (result 323): OpenAI claims: Establishes, relative to the consistency of a measurable cardinal, that the separable quotient problem is independent of ZFC. The assertion that every infinite-dimensional Banach space has a separable infinite-dimensional quotient can hold for all real and complex Banach spaces, whereas the continuum hypothesis yields counterexamples over both fields. (Lean)
- [Lipschitz equivalent Banach spaces need not be linearly isomorphic](https://gradientdamage.com/openai-math/lipschitz-equivalent-banach-spaces-need-not-be-linearly-isomorphic/) (result 324): OpenAI claims: Constructs separable real Banach spaces that are globally bi-Lipschitz equivalent but not linearly isomorphic, resolving the separable Lipschitz-isomorphism problem negatively. Thus even the complete metric structure up to bi-Lipschitz equivalence does not determine a separable Banach space's linear isomorphism class. (Lean)
- [The complete Crouzeix conjecture](https://gradientdamage.com/openai-math/complete-crouzeix-conjecture/) (result 325): OpenAI claims: Resolves the complete Crouzeix conjecture: for every bounded operator A on a complex Hilbert space and every finite matrix-valued polynomial P, one has ‖ P[A]‖ ≤ 2 sup_(z ∈ W(A))‖ P(z)‖, where W(A) is the numerical range. The constant 2 is sharp, independent of the matrix size, and valid in infinite dimensions. (Lean)
- [The cotype–cotype conjecture under the approximation property](https://gradientdamage.com/openai-math/cotype-cotype-conjecture-under-the-approximation-property/) (result 326): OpenAI claims: Resolves the cotype–cotype conjecture for real Banach spaces with the approximation property. Such a nonzero space is K-convex if and only if both it and its dual have finite Rademacher cotype, with possibly different exponents. Equivalently, these cotype assumptions force nontrivial Rademacher type. (Lean)
- [Markov type characterizes superreflexivity](https://gradientdamage.com/openai-math/markov-type-characterizes-superreflexivity/) (result 327): OpenAI claims: Proves that every real Banach space with Markov type p for some p > 1 admits an equivalent uniformly convex norm, answering Naor's renorming question. Together with the known converse, this characterizes superreflexivity by nontrivial Markov type. (Lean)
- [Nonexpansive fixed points in reflexive Banach spaces](https://gradientdamage.com/openai-math/nonexpansive-fixed-points-in-reflexive-banach-spaces/) (result 328): OpenAI claims: Resolves Kirk's reflexive-space fixed-point problem: every nonexpansive selfmap of a nonempty closed bounded convex subset of a real reflexive Banach space has a fixed point. The result uses the original norm, without assuming uniform convexity. (Lean)
- [A counterexample to metric-entropy duality](https://gradientdamage.com/openai-math/counterexample-to-metric-entropy-duality/) (result 329): OpenAI claims: Disproves Pietsch's dimension-free duality conjecture for metric entropy. Origin-symmetric convex bodies violate every proposed choice of universal constants in the conjectured comparison between covering numbers and those of the polar bodies, even when the covering body is a cube. (Lean)
- [A uniformly discrete counterexample to bounded approximation in Lipschitz-free spaces](https://gradientdamage.com/openai-math/uniformly-discrete-counterexample-to-bounded-approximation-in-lipschitz-free-spaces/) (result 330): OpenAI claims: Constructs a countable uniformly discrete metric space whose real Lipschitz-free Banach space has the approximation property but not the bounded approximation property, answering Kalton's question negatively. Finite-rank operators approximate the identity on every compact set, but their norms cannot share a finite bound. (Lean)
- [Reflexive midpoint convexity and diamond distortion](https://gradientdamage.com/openai-math/reflexive-midpoint-convexity-and-diamond-distortion/) (result 331): OpenAI claims: Constructs a real reflexive Banach space with an asymptotically midpoint uniformly convex norm but no equivalent asymptotically uniformly convex norm, extending Baudier's separation to reflexive spaces. In the same space, depth-k countably branching diamonds require distortion at least √(1+k/12), so midpoint uniform convexity does not force uniformly bounded diamond distortion even under reflexivity. (Lean)
- [Metric Markov cotype of ℓ1 and Hilbert-space Lipschitz extension](https://gradientdamage.com/openai-math/metric-markov-cotype-of-l1-and-hilbert-space-lipschitz-extension/) (result 332): OpenAI claims: Proves that real ℓ1 has metric Markov cotype two, answering Mendel and Naor's question. Consequently, every Lipschitz map from an arbitrary subset of a real Hilbert space into ℓ1 extends to the whole space with a universal multiplicative loss in its Lipschitz constant, resolving Ball's extension problem for this target.

### Mathematical logic

- [Shelah's eventual categoricity and the prescribed-threshold obstruction](https://gradientdamage.com/openai-math/shelahs-eventual-categoricity-and-the-prescribed-threshold-obstruction/) (result 240): OpenAI claims: 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)
- [Rigidity of the Turing degrees](https://gradientdamage.com/openai-math/rigidity-of-the-turing-degrees/) (result 241): OpenAI claims: Every order automorphism of the Turing degrees is the identity, resolving their rigidity problem. Thus no nontrivial relabeling of degrees preserves the ordering by relative computability. (Lean)
- [Single-fold Diophantine representations and undecidability under an at-most-one-solution promise](https://gradientdamage.com/openai-math/single-fold-diophantine-representations-and-undecidability-under-an-at-most-one-solution-promise/) (result 242): OpenAI claims: 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)
- [Separating choiceless counting from polynomial time and witnessed choice](https://gradientdamage.com/openai-math/separating-choiceless-counting-from-polynomial-time-and-witnessed-choice/) (result 243): OpenAI claims: Confirms the Blass–Gurevich–Shelah noncapture conjecture: consistency of a linear system over 𝔽3 defines a polynomial-time query on unordered finite structures that choiceless polynomial time with counting cannot express. A separate result shows that adding witnessed symmetric choice strictly increases expressive power. Both separations hold for the full counting formalism, allowing hereditarily finite sets of arbitrary finite rank. (Lean)
- [The Partition Principle does not imply Choice](https://gradientdamage.com/openai-math/partition-principle-does-not-imply-choice/) (result 244): OpenAI claims: Assuming ZF is consistent, constructs a model in which every surjective image of a set injects into that set, yet the axiom of choice fails. Choice for ordinal-indexed families still holds. From any countable transitive model of ZFC, a separate construction gives a transitive symmetric extension with these properties and no new countable sequences of ground-model elements. (Lean)
- [Weak normalization implies strong normalization in pure type systems](https://gradientdamage.com/openai-math/weak-normalization-implies-strong-normalization-in-pure-type-systems/) (result 245): OpenAI claims: Proves that weak normalization implies strong normalization for every pure type system: if every legal expression in every valid context has a β-normal form, every β-reduction sequence terminates. This resolves the β-Barendregt–Geuvers–Klop conjecture, including nonfunctional rules and open contexts. (Lean)

## Every video (50)

- [Goldfeld's Conjecture: Half Rank 0, Half Rank 1](https://gradientdamage.com/videos/goldfelds-conjecture-half-rank-0-half-rank-1/): Short, 0:21, 13 October 2026. YouTube: https://www.youtube.com/shorts/AFGKRcCdzSU. About result 006
- [Restricted Geometric Langlands: OpenAI Claims Characteristic p](https://gradientdamage.com/videos/restricted-geometric-langlands-openai-claims-characteristic-p/): Short, 0:20, 13 October 2026. YouTube: https://www.youtube.com/shorts/1lz16-M84MM. About result 014
- [Prime Factors of p−1: OpenAI Claims the Poisson–Dirichlet Law](https://gradientdamage.com/videos/prime-factors-of-p1-openai-claims-the-poisson-dirichlet-law/): Short, 0:22, 12 October 2026. YouTube: https://www.youtube.com/shorts/aGmPuX3YCs8. About result 011
- [Milne's Rationality Conjecture: OpenAI Claims a Proof](https://gradientdamage.com/videos/milnes-rationality-conjecture-openai-claims-a-proof/): Short, 0:20, 12 October 2026. YouTube: https://www.youtube.com/shorts/BltBSdVlkHU. About result 001
- [Erdős–Gallai Conjecture: Every Graph Splits Into Few Loops](https://gradientdamage.com/videos/erdos-gallai-conjecture-every-graph-splits-into-few-loops/): Short, 0:21, 12 October 2026. YouTube: https://www.youtube.com/shorts/vbINiO4LewQ. About result 181
- [Hypercube Ramsey Conjecture: How Many Dots Force a Cube?](https://gradientdamage.com/videos/hypercube-ramsey-conjecture-how-many-dots-force-a-cube/): Short, 0:20, 12 October 2026. YouTube: https://www.youtube.com/shorts/0v6aVMcmIcg. About result 171
- [Erdős Conjecture on Arithmetic Progressions: OpenAI Claims a Proof](https://gradientdamage.com/videos/erdos-conjecture-on-arithmetic-progressions-openai-claims-a-proof/): Short, 0:21, 12 October 2026. YouTube: https://www.youtube.com/shorts/Fx1zddsBSFg. About result 159
- [Gotsman–Linial Conjecture: OpenAI Claims Sensitivity ≤ 8d√n](https://gradientdamage.com/videos/gotsman-linial-conjecture-openai-claims-sensitivity-8dn/): Short, 0:20, 12 October 2026. YouTube: https://www.youtube.com/shorts/4vB_rSP3FgQ. About result 127
- [Erdős Similarity Conjecture: OpenAI Claims the Geometric Case](https://gradientdamage.com/videos/erdos-similarity-conjecture-openai-claims-the-geometric-case/): Short, 0:20, 12 October 2026. YouTube: https://www.youtube.com/shorts/fzzOF9l0WyQ. About result 084
- [Hilbert-Smith Conjecture: OpenAI Claims a Proof in Every Dimension](https://gradientdamage.com/videos/hilbert-smith-conjecture-openai-claims-a-proof-in-every-dimension/): Short, 0:21, 12 October 2026. YouTube: https://www.youtube.com/shorts/7uq-r6tvByk. About result 304
- [Ramsey Numbers r(s,t): OpenAI Claims the Sharp Log Exponent](https://gradientdamage.com/videos/ramsey-numbers-r-s-t-openai-claims-the-sharp-log-exponent/): Short, 0:21, 12 October 2026. YouTube: https://www.youtube.com/shorts/De6BOflEsvM. About result 170
- [Kakeya Conjecture in 3D and 4D: OpenAI Claims a Proof](https://gradientdamage.com/videos/kakeya-conjecture-in-3d-and-4d-openai-claims-a-proof/): Short, 0:22, 12 October 2026. YouTube: https://www.youtube.com/shorts/c6nBODRzsqg. About result 074
- [Hilbert's Tenth Problem Over the Rationals: OpenAI Says It's Unsolvable](https://gradientdamage.com/videos/hilberts-tenth-problem-over-the-rationals-openai-says-its-unsolvable/): Short, 0:22, 12 October 2026. YouTube: https://www.youtube.com/shorts/9LbtHS_YFcU. About result 004
- [Birch and Swinnerton-Dyer Conjecture (BSD): OpenAI Claims Full Formula, Rank 0 and 1](https://gradientdamage.com/videos/birch-and-swinnerton-dyer-conjecture-bsd-openai-claims-full-formula/): Short, 0:23, 12 October 2026. YouTube: https://www.youtube.com/shorts/BXJeJxNXAgs. About result 002
- [Quantum Factoring: How Often Does Shor's Algorithm Win?](https://gradientdamage.com/videos/quantum-factoring-how-often-does-shors-algorithm-win/): Short, 0:40, 12 October 2026. YouTube: https://www.youtube.com/shorts/ugIzZGQoCuc. About result 279
- [Triangle Billiards: Will the Ball Hit Every Spot?](https://gradientdamage.com/videos/triangle-billiards-will-the-ball-hit-every-spot/): Short, 0:40, 12 October 2026. YouTube: https://www.youtube.com/shorts/FHWC7PiYtG8. About result 150
- [Barnette's Conjecture: Does This Loop Always Exist?](https://gradientdamage.com/videos/barnettes-conjecture-does-this-loop-always-exist/): Short, 0:40, 12 October 2026. YouTube: https://www.youtube.com/shorts/pn4CFp88RlM. About result 180
- [Triangle Billiards: 1 Ball or 10,000?](https://gradientdamage.com/videos/triangle-billiards-1-ball-or-10000/): Short, 0:38, 12 October 2026. YouTube: https://www.youtube.com/shorts/IY4GrzMm9vE. About result 150
- [The Harary–Hill Conjecture: Why 18 Dots Need 1008 Crossings](https://gradientdamage.com/videos/the-harary-hill-conjecture-why-18-dots-need-1008-crossings/): Short, 0:40, 11 October 2026. YouTube: https://www.youtube.com/shorts/yrXjLp8nfqo. About result 165
- [5 Maths Problems OpenAI Says Its AI Just Solved](https://gradientdamage.com/videos/5-maths-problems-openai-says-its-ai-just-solved/): Short, 0:45, 11 October 2026. YouTube: https://www.youtube.com/shorts/FFsKkuXhQKs. About results 165, 158, 237, 354, 230
- [We handed AI everything. Then it went to war.](https://gradientdamage.com/videos/we-handed-ai-everything-then-it-went-to-war-short/): Short, 0:49, 11 October 2026. YouTube: https://www.youtube.com/shorts/FNcyNpWM8CI
- [We Handed AI Everything. Then It Went to War.](https://gradientdamage.com/videos/we-handed-ai-everything-then-it-went-to-war/): Film, 13:01, 11 October 2026. YouTube: https://www.youtube.com/watch?v=jGZGYB4Jhr4
- [Two random tilings make these loops](https://gradientdamage.com/videos/two-random-tilings-make-these-loops/): Short, 0:37, 11 October 2026. YouTube: https://www.youtube.com/shorts/_-E8jXoNkk4. About result 226
- [This equation can only end two ways](https://gradientdamage.com/videos/this-equation-can-only-end-two-ways/): Short, 0:49, 11 October 2026. YouTube: https://www.youtube.com/shorts/NGIyDMEDJEw. About result 143
- [What If Shapes Could Make Music?](https://gradientdamage.com/videos/what-if-shapes-could-make-music/): Short, 0:36, 10 October 2026. YouTube: https://www.youtube.com/shorts/zfYRrhkfKUo
- [Math Sounds Broken: Quantum Buffering](https://gradientdamage.com/videos/math-sounds-broken-quantum-buffering/): Short, 0:12, 10 October 2026. YouTube: https://www.youtube.com/shorts/G7LkNMIilNo. About result 261
- [OpenAI's Navier-Stokes Proof: The Plagiarism Fight](https://gradientdamage.com/videos/openais-navier-stokes-proof-the-plagiarism-fight/): Short, 0:21, 10 October 2026. YouTube: https://www.youtube.com/shorts/bykkBvBpGdM
- [Math Makes Music: The Singing Sphere](https://gradientdamage.com/videos/math-makes-music-the-singing-sphere/): Short, 0:12, 10 October 2026. YouTube: https://www.youtube.com/shorts/2Zgw4jT7Cek. About result 350
- [OpenAI's Navier-Stokes Proof Sparked a Plagiarism Fight](https://gradientdamage.com/videos/openais-navier-stokes-proof-sparked-a-plagiarism-fight/): Short, 1:00, 9 October 2026. YouTube: https://www.youtube.com/shorts/NaO0ugtDZdU
- [Why OpenAI’s Navier-Stokes Proof Triggered a Plagiarism Dispute](https://gradientdamage.com/videos/why-openais-navier-stokes-proof-triggered-a-plagiarism-dispute/): Film, 9:01, 9 October 2026. YouTube: https://www.youtube.com/watch?v=tJn65LrMG9k
- [Math Makes Sounds... Then Gets Weird](https://gradientdamage.com/videos/math-makes-sounds-then-gets-weird/): Short, 0:12, 9 October 2026. YouTube: https://www.youtube.com/shorts/OyH0voIAmQU. About result 075
- [Infinitely Many Closed Geodesics](https://gradientdamage.com/videos/infinitely-many-closed-geodesics/): Short, 0:14, 9 October 2026. YouTube: https://www.youtube.com/shorts/nvS8R9FbAgY. About result 345
- [There Is an Animal Hidden in These Squares](https://gradientdamage.com/videos/there-is-an-animal-hidden-in-these-squares/): Short, 1:00, 9 October 2026. YouTube: https://www.youtube.com/shorts/R6Pc0dAoHKk
- [Triangular Billiards: Weak Mixing](https://gradientdamage.com/videos/triangular-billiards-weak-mixing/): Short, 0:12, 9 October 2026. YouTube: https://www.youtube.com/shorts/n3H8vOkoW1I. About result 150
- [Quasi-Riemann Hypothesis: The 7/8 Bound](https://gradientdamage.com/videos/quasi-riemann-hypothesis-the-7-8-bound/): Short, 0:12, 9 October 2026. YouTube: https://www.youtube.com/shorts/ZYTVn8ritCo. About result 003
- [Catalan's Constant: Reported Irrationality Proof](https://gradientdamage.com/videos/catalans-constant-reported-irrationality-proof/): Short, 0:12, 9 October 2026. YouTube: https://www.youtube.com/shorts/PXNXSlzCLPo. About result 005
- [Relativistic Vlasov-Maxwell: Global Solutions](https://gradientdamage.com/videos/relativistic-vlasov-maxwell-global-solutions/): Short, 0:12, 9 October 2026. YouTube: https://www.youtube.com/shorts/gpIfWdqCISI. About result 362
- [Bloch's Law: 3D Heisenberg Ferromagnets](https://gradientdamage.com/videos/blochs-law-3d-heisenberg-ferromagnets/): Short, 0:12, 9 October 2026. YouTube: https://www.youtube.com/shorts/3wB5bhuWbJQ. About result 271
- [Critical Percolation on a Cubic Lattice](https://gradientdamage.com/videos/critical-percolation-on-a-cubic-lattice/): Short, 0:12, 9 October 2026. YouTube: https://www.youtube.com/shorts/2KExA3m9N3M. About result 213
- [Fluid Computation: A Fixed-Particle Test](https://gradientdamage.com/videos/fluid-computation-a-fixed-particle-test/): Short, 0:12, 9 October 2026. YouTube: https://www.youtube.com/shorts/YME5mZZfiPY. About result 376
- [Finite time blowup for the Euler equation](https://gradientdamage.com/videos/finite-time-blowup-for-the-euler-equation/): Short, 0:12, 9 October 2026. YouTube: https://www.youtube.com/shorts/obiM-dvLYmk
- [Finite Time Blowup for Navier-Stokes | OpenAI's Reported Proof](https://gradientdamage.com/videos/finite-time-blowup-for-navier-stokes-openais-reported-proof/): Short, 0:12, 9 October 2026. YouTube: https://www.youtube.com/shorts/Tvt53n2qQWg
- [ChatGPT's Creators Say They Proved This | Mahler's Conjecture](https://gradientdamage.com/videos/chatgpts-creators-say-they-proved-this-mahlers-conjecture/): Short, 0:12, 9 October 2026. YouTube: https://www.youtube.com/shorts/wQGjvjo64AA. About result 087
- [Sphere, Tube or Slab? The 3D Torus Geometry Problem](https://gradientdamage.com/videos/sphere-tube-or-slab-the-3d-torus-geometry-problem/): Short, 0:12, 8 October 2026. YouTube: https://www.youtube.com/shorts/V90QyAEvpBI. About result 354
- [OpenAI's New Math Result: Sphere, Tube or Slab?](https://gradientdamage.com/videos/openais-new-math-result-sphere-tube-or-slab/): Short, 0:12, 8 October 2026. YouTube: https://www.youtube.com/shorts/eHJX2rBcF2Q. About result 354
- [I Added Too Many Sound Waves... (Shrek in 3D)](https://gradientdamage.com/videos/i-added-too-many-sound-waves-shrek-in-3d/): Short, 0:12, 8 October 2026. YouTube: https://www.youtube.com/shorts/GLh-GpREPUM
- [3.14 Loops. Pi Doesn't. | Pi Visualized](https://gradientdamage.com/videos/3-14-loops-pi-doesnt-pi-visualized/): Short, 0:22, 8 October 2026. YouTube: https://www.youtube.com/shorts/hhcMLKwX74Y
- [If Math Functions Had a Sound (3D Edition)](https://gradientdamage.com/videos/if-math-functions-had-a-sound-3d-edition/): Short, 0:32, 8 October 2026. YouTube: https://www.youtube.com/shorts/IHhQ7LO2z7s
- [Watch a Neural Network Learn in 10 Seconds](https://gradientdamage.com/videos/watch-a-neural-network-learn-in-10-seconds/): Short, 0:10, 7 October 2026. YouTube: https://www.youtube.com/shorts/Nf88DvBMT6U
- [Will ChatGPT replace electrical engineers?](https://gradientdamage.com/videos/will-chatgpt-replace-electrical-engineers/): Short, 0:05, 27 September 2026. YouTube: https://www.youtube.com/shorts/iEuJWxTgJes