Mathematics, opened.

A visual journey through every subject in the collection. Examples first. Terms explained.

44:07 narrated film
36 chapters · 85 featured families

Watch the illustrated film

Mathematics, opened. Illustrated mathematics film.

Press play, or choose a chapter to begin.

Download filmDownload captions
01 · Mathematics, opened.

Choose a chapter to jump to its explanation. Use the video controls for fullscreen playback.

What is in the release, and how should we read it?

The repository README describes 722 manuscripts in 372 families. Families group main theorems, alternative arguments, and consequences. The package also contains manuscript source files, Lean proof artifacts, checking configurations, and ten abridged reasoning summaries. OpenAI reports about 4,000 posed problems and about three hours of Pro-equivalent compute per result on average. The counts alone do not measure a success rate. The README identifies procedural exceptions for zeta and CM Hodge work, and human editing of the 11/12 zeta writeup.

The film visits all 17 subjects and discusses 85 selected families. The index below includes every family and every manuscript in the pinned release. The film is selective within each subject. Its examples explain concepts; they are not reconstructions of the proofs.

The catalogue records differing verification stages and review status “unchecked.” We checked source statements, scopes, counts, and artifact listings for this production. We did not rebuild the Lean project or independently verify the mathematical proofs. A “source listed” badge only records an association in the formalization catalogue. It does not certify the whole paper or family.

Snapshot: adc7f1241b42, checked 7 October 2026. Original catalogue PDF · Manuscript map · Formalization catalogue · Checking instructions

THE COMPLETE COLLECTION

A route into every result.

Search all 372 families and 722 papers. Choose a subject, revisit an explanation, or open a family to read its exact scope and sources.

Download catalogue CSV ↓
Explore the 17 subjects

Bars count families, not importance. Each subject appears in the film.

Start with a familiar subject or search for a problem. Technical descriptions retain the repository’s language; the film and glossary provide gentler introductions.

372 families · 722 papers

001Milne's rationality conjecture1 paper

Number theory

Original repository description

Proves Milne's rationality conjecture for abelian varieties over Q‾\overline{\mathbb Q} 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-pp and crystalline realizations, for every residue characteristic pp.

Read the manuscripts

  1. Milne's rationality conjecture for abelian varieties
002The full Birch–Swinnerton-Dyer formula in Selmer coranks zero and one3 papersIn the film

Number theory

Original repository description

Proves the full Birch–Swinnerton-Dyer leading-term formula for every elliptic curve over Q\mathbb Q whose full qq-power Selmer group has corank zero or one for some prime qq, 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 Q\mathbb Q.

Read the manuscripts

  1. Exact Birch–Swinnerton-Dyer Formula from Low Selmer Corank
  2. The Selmer converse for elliptic curves at every prime
  3. The two-primary Birch–Swinnerton-Dyer formula in Selmer corank at most one
003The quasi-Riemann hypothesis3 papersIn the film

Number theory

Original repository description

Proves that every Dirichlet LL-function, including ζ(s)\zeta(s), is zero-free in ℜs>7/8\Re s>7/8, resolving the quasi-Riemann hypothesis. The same half-plane is zero-free for every finite-order Hecke LL-function over Q(−3)\mathbb Q(\sqrt{-3}). A companion gives a different proof of the zero-free half-plane ℜs>11/12\Re s>11/12.

Read the manuscripts

  1. The Quasi-Riemann Hypothesis: A Zero-Free Half-Plane s>7/8Source listed in formalization catalogue
  2. The Quasi-Riemann Hypothesis (alternate 11/12 proof)
  3. Uniform exclusion of Landau–Siegel zerosSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

004Hilbert's tenth problem over Q\mathbb Q2 papersIn the film

Number theory

Original repository description

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 Q\mathbb Q negatively.

Read the manuscripts

  1. Hilbert’s tenth over ℚ
  2. Pointwise 2-converse with rational two-torsion
005Irrationality of Catalan's constant1 paperIn the film

Number theory

Original repository description

Proves that Catalan's constant G=∑j≥0(−1)j/(2j+1)2G=\sum_{j\ge0}(-1)^j/(2j+1)^2 is irrational.

Read the manuscripts

  1. Catalan's constant is irrational
006Goldfeld's conjecture2 papersIn the film

Number theory

Original repository description

Proves Goldfeld's conjecture for quadratic twists of every elliptic curve over Q\mathbb Q: analytic ranks zero and one each have density 1/21/2, and the mean analytic rank tends to 1/21/2. Both statements order signed squarefree twist parameters by absolute value.

Read the manuscripts

  1. Analytic density and 2-converse
  2. Mean analytic rank
007Two-point Chowla and the corrected binary Elliott conjecture1 paperIn the film

Number theory

Original repository description

Proves the ordinary two-point Chowla conjecture, with a bound O(X/(log⁡X)c)O(X/(\log X)^c) for Liouville correlation sums along fixed nonproportional affine forms, where c>0c>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 nitn^{it} for ∣t∣≤X|t|\le X.

Read the manuscripts

  1. Ordinary two-point correlations of multiplicative functions
008The Deligne–Drinfeld conjecture1 paper

Number theory

Original repository description

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,…3,5,7,\ldots, resolving the Deligne–Drinfeld conjecture.

Read the manuscripts

  1. The Deligne-Drinfeld conjectureSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

009Bogomolov–Pop and Milnor KK-theoretic reconstruction3 papers

Number theory

Original repository description

Reconstructs function fields of transcendence degree at least two over algebraically closed constants from K1M/ℓK^{\mathrm M}_1/\ell, K2M/ℓK^{\mathrm M}_2/\ell, and their product. These data recover the perfect closure and constants when ℓ\ell 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-ℓ\ell Galois data away from the characteristic.

Read the manuscripts

  1. Reconstruction of Function Fields from Mod-ℓ Milnor K-Theory
  2. Reconstruction from Milnor K-theory modulo the characteristic
  3. The Bogomolov-Pop reconstruction theorem
010Fontaine–Mazur modularity at the prime 22 and 22-adic pro-modularity3 papers

Number theory

Original repository description

Every continuous odd absolutely irreducible two-dimensional 22-adic representation of GQG_{\mathbb Q} 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 22 with distinct Hodge–Tate weights, resolving the dyadic Fontaine–Mazur case without residual restrictions.

Read the manuscripts

  1. Unrestricted pro-modularity
  2. Two-adic Hecke dimension
  3. Fontaine–Mazur modularity at the prime 2
011The Ford–Konyagin–Luca conjecture on prime predecessors3 papers

Number theory

Original repository description

Proves that the normalized ordered logarithms of the prime factors of p−1p-1, counted with multiplicity, converge jointly to the Poisson–Dirichlet law PD(1)\mathrm{PD}(1) as pp ranges uniformly over primes up to xx and x→∞x\to\infty. This resolves the Ford–Konyagin–Luca conjecture. It also proves that infinitely many integers nn have more than n1−εn^{1-\varepsilon} totient preimages, for every ε>0\varepsilon>0.

Read the manuscripts

  1. Weighted dilation graphs, smooth shifted primes and totient fibers
  2. The Poisson-Dirichlet law for prime predecessors
  3. Prime Predecessors with an Even Number of Prime Factors
012Independent largest prime factors of consecutive integers1 paper

Number theory

Original repository description

Resolves the Erdős–Pomerance joint Dickman conjecture: the logarithmic sizes of the largest prime factors of nn and n+1n+1 are asymptotically independent in ordinary natural density. In particular, the integers satisfying P+(n)<P+(n+1)P^+(n)<P^+(n+1) have density 1/21/2.

Read the manuscripts

  1. The joint Dickman law for consecutive integers
013Ostmann's inverse Goldbach conjecture1 paper

Number theory

Original repository description

Proves that no finite modification of the primes can be written as A+BA+B with A,B⊆Z≥0A,B\subseteq\mathbb Z_{\ge0} each containing at least two elements. This resolves Ostmann's inverse Goldbach conjecture on additive indecomposability.

Read the manuscripts

  1. The additive indecomposability of the primes
014Restricted geometric Langlands, generic Ramanujan and Arthur parameters8 papers

Number theory

Original repository description

Proves the restricted geometric Langlands equivalence for connected reductive groups on smooth projective connected curves over F‾q\overline{\mathbb F}_q under the four stated Lie-theoretic characteristic hypotheses. Over arbitrary algebraically closed fields of characteristic p>0p>0, the same conclusion holds assuming additionally that pp is very good for the group and p∤∣WG∣p\nmid |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.

Read the manuscripts

  1. Global Arthur Enhancements of Cuspidal Excursion Parameters
  2. Unramified Arthur filtration
  3. Arthur decompositions at full finite level
  4. Temperedness at ramified places for globally generic exceptional groups
  5. Restricted geometric Langlands
  6. Constructible tame Hecke eigensheaves in positive characteristic
  7. Tame Hecke Eigensheaves with Several Marked Points
  8. Frobenius Structures on Tame Hecke Eigensheaves
015Torus-packet equidistribution in prime, quartic, and sextic degrees3 papers

Number theory

Original repository description

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.

Read the manuscripts

  1. Equidistribution of Prime-Degree Torus Packets with Arbitrary Local Type
  2. Equidistribution of primitive quartic torus packets for arbitrary orders
  3. Equidistribution of Primitive Sextic Torus Packets
016Zilber–Pink in abelian varieties and the Siegel threefold4 papers

Number theory

Original repository description

Proves the abelian Zilber–Pink conjecture over Q‾\overline{\mathbb Q}: 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 A2\mathcal A_2 for Hodge-generic curves defined over Q‾\overline{\mathbb Q}, without boundary or reduction assumptions.

Read the manuscripts

  1. Abelian Zilber–Pink
  2. E×CM component
  3. Quaternionic division points
  4. Elliptic squares
017The irrationality exponent of π\pi is 221 paperIn the film

Number theory

Original repository description

Proves that the irrationality exponent of π\pi is exactly 22: for every ε>0\varepsilon>0 and all sufficiently large denominators qq, every rational p/qp/q satisfies ∣π−p/q∣≥q−2−ε|\pi-p/q|\ge q^{-2-\varepsilon}. This also proves convergence of the Flint–Hills series ∑n≥11/(n3sin⁡2n)\sum_{n\ge1}1/(n^3\sin^2 n), with angles in radians.

Read the manuscripts

  1. The irrationality exponent of pi is 2
018The Margulis–Platonov conjecture over global fields2 papers

Number theory

Original repository description

Proves the Margulis–Platonov conjecture over every global field, including function fields of characteristic two. For an absolutely almost simple simply connected algebraic group GG over kk, every noncentral abstract normal subgroup of G(k)G(k) is the inverse image of an open normal subgroup in the finite product of its anisotropic nonarchimedean local groups.

Read the manuscripts

  1. The Margulis–Platonov conjecture over global function fields
  2. The Margulis–Platonov conjecture over number fields
019The pp-adic section conjecture2 papers

Number theory

Original repository description

Proves that rational points on every smooth proper geometrically connected curve of genus at least two over a finite extension of Qp\mathbb Q_p correspond bijectively to conjugacy classes of sections of its full arithmetic étale fundamental group. It also proves Grothendieck's section conjecture over Q\mathbb Q for the modular curves X0(N)X_0(N) and X1(N)X_1(N) of genus at least two.

Read the manuscripts

  1. Prescribed exterior sheet
  2. p-adic section conjecture
020Squarefree quartics and power-free polynomial values1 paperIn the film

Number theory

Original repository description

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)(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≥4d\ge4.

Read the manuscripts

  1. Squarefree values of quartics and power-free values of polynomialsSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

021A quadratic bound for Jacobsthal's function1 paper

Number theory

Original repository description

Answers Jacobsthal's quadratic-bound question: every interval of Ck2Ck^2 consecutive integers contains an integer coprime to any prescribed positive integer with at most kk distinct prime divisors, for an absolute constant CC. The bound is uniform over prime sets and interval positions and removes the classical logarithmic loss.

Read the manuscripts

  1. A quadratic bound for Jacobsthal's functionSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

022The weak inhomogeneous Duffin–Schaeffer conjecture1 paper

Number theory

Original repository description

Proves that for every real shift γ\gamma and finite-valued ψ:N→[0,∞)\psi:\mathbb N\to[0,\infty), divergence of ∑qϕ(q)ψ(q)/q\sum_q\phi(q)\psi(q)/q implies ∥qx−γ∥<ψ(q)\|qx-\gamma\|<\psi(q) for infinitely many qq, for almost every xx. Here ϕ\phi is Euler's totient and the norm is distance to the nearest integer. Numerators are unrestricted; no monotonicity or Diophantine condition on γ\gamma is needed.

Read the manuscripts

  1. The Weak Inhomogeneous Duffin–Schaeffer Conjecture
023Patterson’s first moment for cubic Gauss sums1 paper

Number theory

Original repository description

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 XX, including both conjugates, have an explicit positive main term of order X5/6/log⁡XX^{5/6}/\log X. Every fixed nonzero prime-angle Fourier mode has smaller order.

Read the manuscripts

  1. An unconditional first moment for cubic Gauss sums
024An asymptotic formula for the number of totients1 paper

Number theory

Original repository description

Gives an asymptotic equivalent for the number V(x)V(x) of distinct totient values up to xx, with a positive bounded phase-dependent factor determined by convergent arithmetic approximations. In particular, V(cx)/V(x)→cV(cx)/V(x)\to c for every fixed c>0c>0, answering Erdős and Hall’s scaling question.

Read the manuscripts

  1. An asymptotic formula for the number of totients
025Erdős’s short Egyptian-fraction conjecture1 paperIn the film

Number theory

Original repository description

Every rational a/ba/b with 1≤a<b1\le a<b is a sum of O(log⁡log⁡b)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.

Read the manuscripts

  1. Short Egyptian fractionsSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

026Positive lower density of large prime gaps1 paper

Number theory

Original repository description

For every fixed C>0C>0, a positive proportion of consecutive prime gaps exceed Clog⁡pnC\log p_n, throughout every sufficiently large initial segment of the primes. The proportion may depend on CC. Consequently, the indices where pn/np_n/n increases have positive lower density, answering Erdős and Prachar.

Read the manuscripts

  1. Positive lower density of large prime gaps
027Integral density on curve character varieties1 paper

Number theory

Original repository description

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\mathrm{SL}_r character variety over the full ring of integers of one number field. Prescribed quasi-unipotent boundary conjugacy classes are allowed, including nonsemisimple classes.

Read the manuscripts

  1. Integral points on character varieties of curves
028The Gaussian moat conjecture1 paperIn the film

Number theory

Original repository description

Proves the Gaussian moat conjecture: no infinite walk through distinct Gaussian primes can have uniformly bounded steps. More strongly, for every distance bound DD, the graph joining Gaussian primes at distance at most DD has uniformly bounded finite component sizes, depending only on DD, including primes on the coordinate axes.

Read the manuscripts

  1. Bounded-Step Walks on Gaussian PrimesSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

029Artin's primitive root conjecture: infinitude for every base2 papersIn the film

Number theory

Original repository description

Proves the infinitude assertion in Artin's primitive root conjecture for every integer aa that is neither −1-1 nor a square. For each such base, at least cax/(log⁡x)2c_a x/(\log x)^2 primes in every sufficiently large interval (x,2x)(x,2x) have primitive root aa, with ca>0c_a>0.

Read the manuscripts

  1. Primitive roots for every admissible integer base
  2. Simultaneous primitive roots: a conditional lower bound for prime bases
030Modularity over imaginary quadratic fields1 paper

Number theory

Original repository description

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.

Read the manuscripts

  1. Modularity of elliptic curves over imaginary quadratic fields
031Uchida's conjecture for open Galois homomorphisms1 paper

Number theory

Original repository description

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.

Read the manuscripts

  1. Open Homomorphisms of Global Solvably Closed Galois Groups
032The rational Hodge conjecture for CM abelian varieties and products of K3 surfaces8 papersIn the film

Algebraic and complex geometry

Original repository description

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. Companion results prove rational Hodge for arbitrary products of projective complex K3 surfaces and algebraicity of the Kuga–Satake correspondence for every such surface.

Read the manuscripts

  1. The rational Hodge conjecture for CM abelian varieties
  2. The rational Hodge conjecture for products of K3 surfaces
  3. Algebraicity of Kuga–Satake Correspondences for K3 Surfaces
  4. Algebraic Kuga–Satake correspondences and Hodge conjectures on a K3 quadratic locus
  5. Weil classes and Hodge classes on abelian powers
  6. Abelian covers, Gale correspondences, and the Hodge conjecture for powers
  7. Algebraicity of Weil classes on split abelian eightfolds
  8. A Conditional Reduction for Algebraic Kuga–Satake Correspondences
033Campana's orbifold Iitaka conjecture and logarithmic subadditivity5 papersIn the film

Algebraic and complex geometry

Original repository description

Proves Campana's orbifold Iitaka subadditivity conjecture for smooth Fujiki-class-C\mathcal C manifolds with rational simple-normal-crossing boundaries. For projective fibrations f:U→Vf:U\to V of smooth complex quasi-projective varieties with connected fibers, general fiber FF, and κˉ(V)≥0\bar\kappa(V)\ge0, proves Popa's inequality κˉ(U)≥κ(F)+max⁡{κˉ(V),Var⁡(f)}\bar\kappa(U)\ge\kappa(F)+\max\{\bar\kappa(V),\operatorname{Var}(f)\}, where variation measures the whole geometric generic fiber.

Read the manuscripts

  1. Orbifold and logarithmic subadditivity
  2. Whole-fiber variation
  3. Reverse inequality and additivity
  4. Projective Hodge lines
  5. Kähler b-semiampleness
034Log abundance and effective Iitaka fibrations14 papersIn the film

Algebraic and complex geometry

Original repository description

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 Q\mathbb Q-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.

Read the manuscripts

  1. Log abundance for compact Kähler spaces
  2. Uniform indices for semi-log-canonical log Calabi–Yau pairs
  3. Conditional Kähler good minimal models
  4. Log abundance in characteristic zero
  5. Minimal metrics and interior injectivity
  6. Fourfold nonvanishing
  7. Lifting sections from reduced support
  8. Schnell fiber spaces
  9. Uniform log Iitaka fibrations
  10. Uniform pluricanonical Iitaka fibrations
  11. Log Calabi–Yau fibrations
  12. Arithmetic Stein-degree bounds
  13. Log Iitaka fibrations for fourfolds
  14. Compact Kähler fourfolds after nonvanishing
035Threefold log abundance in numerical dimension one in characteristic p>3p>32 papers

Algebraic and complex geometry

Original repository description

Proves log abundance for projective log canonical threefold pairs over algebraically closed fields of characteristic p>3p>3 when the effective boundary is rational and the Q\mathbb Q-Cartier adjoint is nef of numerical dimension one. The adjoint is semiample, without requiring the original variety to be terminal or Q\mathbb Q-factorial.

Read the manuscripts

  1. Log abundance in numerical dimension one for threefolds in positive characteristic
  2. Abundance in numerical dimension one for terminal threefolds in positive characteristic
036Numerical semiampleness and generalized minimal models4 papers

Algebraic and complex geometry

Original repository description

Proves numerical semiampleness for nef adjoints KX+B+MK_X+B+M with KX+BK_X+B pseudo-effective and MM 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.

Read the manuscripts

  1. Compact Kähler numerical semiampleness
  2. Projective numerical semiampleness
  3. Generalized log canonical Q-pairs
  4. Numerical dimension one
037The sharp ordinary-double-point volume gap2 papers

Algebraic and complex geometry

Original repository description

Proves the ordinary-double-point volume-gap conjecture: every singular complex algebraic klt germ of dimension n≥2n\ge2, with zero boundary, has normalized volume at most 2(n−1)n2(n-1)^n. Equality holds precisely for an analytic ordinary double point.

Read the manuscripts

  1. Gap in every dimension
  2. Dimension-four normalized-volume gap
038Fujita's freeness conjecture1 paperIn the film

Algebraic and complex geometry

Original repository description

Proves Fujita's freeness conjecture at its sharp bound in every dimension: for a smooth projective complex variety XX of dimension nn and an ample line bundle LL, the adjoint KX+mLK_X+mL is globally generated for every integer m≥n+1m\ge n+1.

Read the manuscripts

  1. Fujita's freeness conjecture
039Nagata's conjecture and maximal Seshadri constants4 papersIn the film

Algebraic and complex geometry

Original repository description

Proves Nagata's strict inequality ∑imi<dr\sum_i m_i<d\sqrt r for every nonzero effective plane curve of degree dd through r≥10r\ge10 very general complex points, with arbitrary multiplicities mim_i. It also proves maximal multipoint Seshadri constants (Ln/r)1/n(L^n/r)^{1/n} for every smooth polarized projective variety of dimension n≥2n\ge2 and all sufficiently large rr: at very general points over C\mathbb C, and at the geometric generic tuple over any algebraically closed field of positive characteristic.

Read the manuscripts

  1. Plane-curve Nagata conjectureSource listed in formalization catalogue
  2. Maximal Seshadri constantsSource listed in formalization catalogue
  3. Maximal Multipoint Seshadri Constants in Higher Dimensions
  4. Maximal multipoint Seshadri constants in positive characteristic

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

040Bloch's conjecture for complex surfaces1 paper

Algebraic and complex geometry

Original repository description

Proves Bloch's conjecture: for every smooth connected projective complex surface SS with pg(S)=0p_g(S)=0, the Albanese map CH0(S)0→Alb(S)(C)\mathrm{CH}_0(S)^0\to\mathrm{Alb}(S)(\mathbb C) on integral degree-zero zero-cycles is an isomorphism. This combines the new pg=q=0p_g=q=0 theorem with the classical theorem of Bloch, Kas, and Lieberman.

Read the manuscripts

  1. Bloch’s conjecture for surfaces with p_g=0
041Hyperkähler SYZ and projective-space bases2 papers

Algebraic and complex geometry

Original repository description

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.

Read the manuscripts

  1. Projective-space bases
  2. Strong hyperkähler SYZ
042Oka classification for K3 surfaces and other compact complex surfaces1 paper

Algebraic and complex geometry

Original repository description

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.

Read the manuscripts

  1. Every complex K3 surface is Oka
043P=WP=W for fixed-determinant moduli spaces1 paper

Algebraic and complex geometry

Original repository description

Proves Pk=W2k=W2k+1P_k=W_{2k}=W_{2k+1} 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=WP=W conjecture in every coprime rank.

Read the manuscripts

  1. P=W in composite rank for fixed determinant
044The equivariant cohomological Hikita conjecture for quivers1 paper

Algebraic and complex geometry

Original repository description

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.

Read the manuscripts

  1. The equivariant cohomological Hikita conjecture for arbitrary quivers
046Counterexamples to Shafarevich holomorphic convexity2 papers

Algebraic and complex geometry

Original repository description

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.

Read the manuscripts

  1. A projective fourfold with large fundamental group and non-Stein universal cover
  2. A surface counterexample to Shafarevich holomorphic convexity
047Complex counterexamples to cancellation and affine fibrations1 paperIn the film

Algebraic and complex geometry

Original repository description

Constructs an integral complex affine fourfold X≇A4X\not\cong\mathbb A^4 with X×A1≅A5X\times\mathbb A^1\cong\mathbb A^5, disproving affine-space cancellation over C\mathbb C in dimension four. It also disproves the Dolgachev–Weisfeiler affine-fibration conjecture: smooth surjections X→A1X\to\mathbb A^1 and A5→A2\mathbb A^5\to\mathbb A^2 have every residue-field fiber isomorphic to affine three-space but are not Zariski-locally trivial.

Read the manuscripts

  1. An explicit failure of complex affine-space cancellationSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

048A characteristic-zero counterexample to Lipman–Zariski1 paper

Algebraic and complex geometry

Original repository description

Constructs a singular normal affine complex surface with free rank-two tangent sheaf, disproving the characteristic-zero Lipman–Zariski conjecture.

Read the manuscripts

  1. A singular normal affine surface with free tangent sheaf
049A stable-coordinate counterexample in four variables2 papers

Algebraic and complex geometry

Original repository description

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.

Read the manuscripts

  1. A stable coordinate that is not a coordinate in four variables
  2. An explicit noncoordinate polynomial with affine three-space zero fibreSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

050A counterexample to Griffiths' positivity conjecture1 paper

Algebraic and complex geometry

Original repository description

Constructs ample rank-two bundles on P1×P1\mathbb P^1\times\mathbb P^1 with no smooth Hermitian metric of strictly Griffiths-positive curvature, disproving Griffiths' positivity conjecture already on the quadric surface.

Read the manuscripts

  1. Ample rank-two bundles on the quadric surface without Griffiths-positive metricsSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

051Kobayashi's canonical-ampleness conjecture1 paper

Algebraic and complex geometry

Original repository description

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.

Read the manuscripts

  1. Canonical ampleness of compact hyperbolic Kähler manifolds
052Tangent-bundle splittings and universal covers2 papers

Algebraic and complex geometry

Original repository description

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.

Read the manuscripts

  1. Kähler universal-cover splittingSource listed in formalization catalogue
  2. Integrability on rationally connected manifolds

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

053A counterexample to Pixton's original completeness conjecture1 paper

Algebraic and complex geometry

Original repository description

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.

Read the manuscripts

  1. A high-arity counterexample to Pixton completeness in Chow
054Counterexamples to Kuznetsov's rationality conjecture1 paper

Algebraic and complex geometry

Original repository description

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.

Read the manuscripts

  1. Irrational cubic fourfolds with geometric K3 categories
055Toda's Gepner conjecture and large-volume stability2 papers

Algebraic and complex geometry

Original repository description

Proves Toda's Gepner conjecture for every smooth complex quintic threefold, constructing a numerical Bridgeland stability condition with the prescribed phase shift 2/52/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.

Read the manuscripts

  1. Gepner stability on quintic threefolds
  2. Prescribed large-volume charges
056Termination of fourfold minimal model programs5 papers

Algebraic and complex geometry

Original repository description

Proves termination of every existing generalized log canonical flip sequence on globally Weil Q\mathbb Q-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.

Read the manuscripts

  1. Termination of generalized log canonical flips on compact Kähler fourfolds
  2. Termination of generalized-canonical flips on compact Kähler fourfolds
  3. Log canonical fourfold termination
  4. Ordinary Kähler fourfold termination
  5. Finite Kähler fourfold programs
057Campana's abelianity conjecture and special varieties3 papers

Algebraic and complex geometry

Original repository description

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.

Read the manuscripts

  1. Special compact Kähler abelianity
  2. Two-step monodromy
  3. A conditional abelianity theorem for special fourfold pairs with a half-weight divisor
058The Kollár–Pardon universal-cover conjecture2 papers

Algebraic and complex geometry

Original repository description

Proves the Kollár–Pardon conjecture: the semialgebraic universal covers of connected normal projective complex varieties are exactly products D×Cm×FD\times\mathbb C^m\times F, with DD bounded symmetric and FF 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 Cn\mathbb C^n has a finite étale cover by an abelian variety.

Read the manuscripts

  1. Semialgebraic universal covers
  2. Bounded-domain symmetrySource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

059Counterexamples to Zariski's multiplicity conjecture2 papers

Algebraic and complex geometry

Original repository description

Disproves Zariski's multiplicity conjecture by constructing reduced holomorphic hypersurface germs that are ambiently homeomorphic but have different multiplicities. The examples include hypersurfaces in C4\mathbb C^4 with isolated critical points and multiplicities four and five.

Read the manuscripts

  1. Multiplicities two and three
  2. Multiplicities four and five
060The Global Spherical Shell conjecture1 paper

Algebraic and complex geometry

Original repository description

Every connected minimal compact complex surface of class VII with b2>0b_2>0 contains a global spherical shell, proving the positive-b2b_2 Global Spherical Shell conjecture. Such a shell is a holomorphically embedded neighborhood of the standard three-sphere in C2∖{0}\mathbb C^2\setminus\{0\} whose complement is connected.

Read the manuscripts

  1. Global Spherical Shells on Minimal Surfaces of Class VII
062The LeBrun–Salamon conjecture and projective contact classification1 paper

Algebraic and complex geometry

Original repository description

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 b2=1b_2=1 are adjoint varieties with their canonical contact structures, while those with b2≥2b_2\ge2 have underlying manifold P(T∗Z)\mathbb P(T^*Z) for a smooth projective variety ZZ.

Read the manuscripts

  1. Contact Fano manifolds and the LeBrun–Salamon conjecture
063The generalized Mukai conjecture1 paper

Algebraic and complex geometry

Original repository description

Proves the generalized Mukai conjecture: every positive-dimensional smooth complex projective Fano manifold of dimension nn, Picard number ρ\rho and pseudoindex ι\iota satisfies ρ(ι−1)≤n\rho(\iota-1)\le n, with equality exactly for (Pι−1)ρ(\mathbb P^{\iota-1})^\rho. Here the pseudoindex is the least anticanonical degree of a rational curve.

Read the manuscripts

  1. The generalized Mukai conjecture
064The μ\mu-constant problem for surface singularities1 paper

Algebraic and complex geometry

Original repository description

Proves topological right-triviality for every holomorphic one-parameter family of isolated hypersurface singularities in C3\mathbb C^3 with constant Milnor number, resolving the surface case of the μ\mu-constant problem. After shrinking the parameter disk and representatives, ambient homeomorphisms vary jointly continuously, fix the origin section and preserve the defining functions.

Read the manuscripts

  1. Topological triviality of mu-constant families of surface singularities
065Virasoro constraints for complete intersections and projective bundles2 papers

Algebraic and complex geometry

Original repository description

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.

Read the manuscripts

  1. Virasoro Constraints under Projectivization
  2. Virasoro Constraints for Projective Complete Intersections
066Bounded klt complements for Fano contractions2 papers

Algebraic and complex geometry

Original repository description

Proves the finite-rational-coefficient form of Shokurov’s bounded-klt-complement conjecture for ϵ\epsilon-lc complex Fano-type pairs with nef anti-log-canonical divisor. For ϵ\epsilon-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 ϵ\epsilon.

Read the manuscripts

  1. Bounded klt complements
  2. Uniform Cartier sections
067The Campana–Peternell conjecture in dimension six1 paper

Algebraic and complex geometry

Original repository description

Proves the Campana–Peternell conjecture in complex dimension six: every smooth connected complex projective Fano sixfold with nef tangent bundle is rational homogeneous.

Read the manuscripts

  1. The Campana–Peternell conjecture in dimension six
068Anticanonical nonvanishing under smooth semipositivity7 papers

Algebraic and complex geometry

Original repository description

If XX is a smooth connected complex projective variety and −KX-K_X admits a smooth Hermitian metric with nonnegative curvature, then H0(X,−mKX)≠0H^0(X,-mK_X)\ne0 for some m>0m>0. Thus smooth semipositivity forces a nonzero section of a positive tensor power of the anticanonical bundle in every dimension.

Read the manuscripts

  1. Smooth semipositivity
  2. Invariant indices and twisted differentials
  3. Bounded metrics on klt pairs
  4. Cohomological transfer
  5. Rank-preserving contractions
  6. Effectivity with controlled boundary
  7. Exact orders and invariant linear systems
069Quantum geometric Langlands at irrational level1 paper

Algebraic and complex geometry

Original repository description

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∈C∖Qc\in\mathbb C\setminus\mathbb Q. It identifies the full derived categories of twisted DD-modules for the group and its Langlands dual, retaining all global forms and connected components.

Read the manuscripts

  1. Global quantum geometric Langlands at irrational level
071Koebe's circle-domain conjecture and circle-domain rigidity2 papersIn the film

Real and complex analysis

Original repository description

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.

Read the manuscripts

  1. Removable boundaries and rigidity
  2. Koebe’s circle-domain conjecture
072Brennan's conjecture and a counterexample to Kraetzer's prediction2 papers

Real and complex analysis

Original repository description

Proves Brennan's conjecture: for every conformal bijection ϕ\phi from a simply connected plane domain onto the disk, ∣ϕ′∣s|\phi'|^s is area-integrable for 4/3<s<44/3<s<4. The sharp universal integral-means identity is BS(t)=∣t∣−1B_{\mathcal S}(t)=|t|-1 for t≤−2t\le-2. A strict bound Bb(−1)<1/4B_b(-1)<1/4 for bounded univalent functions disproves Kraetzer's prediction at that parameter.

Read the manuscripts

  1. Brennan’s conjectureSource listed in formalization catalogue
  2. Strict inverse-first-power boundSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

073The Falconer distance conjecture1 paperIn the film

Real and complex analysis

Original repository description

Resolves the Falconer distance conjecture in every dimension d≥2d\ge2: every compact set E⊂RdE\subset\mathbb R^d with Hausdorff dimension greater than d/2d/2 determines a set of Euclidean distances of positive Lebesgue measure.

Read the manuscripts

  1. The Falconer distance conjecture in all dimensionsSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

074Kakeya in three and four dimensions2 papersIn the film

Real and complex analysis

Original repository description

Resolves the Kakeya maximal conjecture in three dimensions and the Hausdorff-dimension conjecture in four. In three dimensions, the radius-δ\delta tube maximal operator maps L3(R3)L^3(\mathbb R^3) to L3(S2)L^3(S^2) with norm Oε(δ−ε)O_\varepsilon(\delta^{-\varepsilon}) for every ε>0\varepsilon>0. In four dimensions, every set containing a unit segment in every direction has Hausdorff dimension four.

Read the manuscripts

  1. 3D Kakeya maximal conjecture
  2. 4D Kakeya Hausdorff dimension
075The Llog⁡LL\log L Fourier-convergence conjecture1 paperIn the film

Real and complex analysis

Original repository description

Proves that the ordinary symmetric Fourier partial sums of every complex-valued function in Llog⁡L(T)L\log L(\mathbb T) converge almost everywhere along the full sequence. This resolves the classical sufficiency conjecture at the Llog⁡LL\log L scale.

Read the manuscripts

  1. Almost-everywhere Fourier convergence in L log L
076Ultraflat real Littlewood polynomials3 papers

Real and complex analysis

Original repository description

Constructs polynomials with NN consecutive coefficients in {−1,1}\{-1,1\} whose modulus is (1+o(1))N(1+o(1))\sqrt N uniformly on the entire unit circle, for every sufficiently large integer length NN. 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.

Read the manuscripts

  1. Ultraflat real Littlewood polynomials
  2. Nearly minimal maxima and positive minima of Littlewood polynomials
  3. Asymptotically minimal maxima of real Littlewood polynomialsSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

077Fourier restriction for positively curved surfaces2 papers

Real and complex analysis

Original repository description

Proves the diagonal Fourier extension conjecture for positively curved surfaces in three dimensions. For every compact smooth positively curved surface Σ⊂R3\Sigma\subset\mathbb R^3, including surfaces with boundary, the extension operator is bounded from Lp(Σ)L^p(\Sigma) to Lp(R3)L^p(\mathbb R^3) for every p>3p>3.

Read the manuscripts

  1. Sphere restriction
  2. Diagonal Fourier extension
078The three-dimensional Bochner–Riesz conjecture1 paper

Real and complex analysis

Original repository description

Resolves the three-dimensional Bochner–Riesz conjecture in its strict range: the Bochner–Riesz multipliers of order δ\delta are bounded on Lp(R3)L^p(\mathbb R^3) for every 1≤p≤∞1\le p\le\infty whenever δ>max⁡{3∣1/p−1/2∣−1/2,0}\delta>\max\{3|1/p-1/2|-1/2,0\}.

Read the manuscripts

  1. Bochner–Riesz multipliers in three dimensions
079Sogge's local smoothing conjecture in dimension three1 paper

Real and complex analysis

Original repository description

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<∞2<p<\infty, with Sobolev regularity above max⁡{0,1−3/p}\max\{0,1-3/p\}. In particular, the critical L3L^3 estimate holds with every positive Sobolev loss.

Read the manuscripts

  1. Critical local smoothing for the three-dimensional wave equation
080The Sobolev endpoint in Carleson's Schrödinger convergence problem2 papers

Real and complex analysis

Original repository description

Proves almost-everywhere convergence eitΔf→fe^{it\Delta}f\to f as t↓0t\downarrow0 for every f∈Hn/(2(n+1))(Rn)f\in H^{n/(2(n+1))}(\mathbb R^n) and every dimension n≥2n\ge2. This attains the sharp Sobolev equality case of Carleson's Schrödinger convergence problem, including the planar endpoint H1/3H^{1/3}.

Read the manuscripts

  1. Planar endpoint convergence
  2. Higher-dimensional endpoint convergence
081The David–Semmes Riesz-transform problem in higher codimension1 paper

Real and complex analysis

Original repository description

Resolves the remaining higher-codimension Riesz-transform rectifiability problem: for d≥4d\ge4 and 2≤n≤d−22\le n\le d-2, an nn-Ahlfors–David regular Radon measure on Rd\mathbb R^d is uniformly nn-rectifiable whenever its nn-dimensional Riesz transform is uniformly L2L^2-bounded over all positive hard truncations. The rectifiability bounds depend only on dimension, regularity and operator bounds.

Read the manuscripts

  1. Riesz transforms and uniform rectifiability in higher codimensionSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

082Maximal and variational bounds for the triangular Hilbert transform3 papers

Real and complex analysis

Original repository description

Proves maximal and annular rr-variation bounds, for every r>2r>2, from complex L3(R2)×L3(R2)L^3(\mathbb R^2)\times L^3(\mathbb R^2) to L3/2(R2)L^{3/2}(\mathbb R^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 L3×L3×L3L^3\times L^3\times L^3 point.

Read the manuscripts

  1. Annular variation of the triangular Hilbert transform at the symmetric point
  2. An L^3 bound for the dyadic triangular Hilbert form
  3. The maximal triangular Hilbert transform at the symmetric pointSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

083Stein's conjecture for Hilbert transforms along Lipschitz directions1 paper

Real and complex analysis

Original repository description

Proves a uniform strong L2L^2 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 L2L^2-bounded principal-value operator, establishing Stein's weak-type conjecture at this short scale.

Read the manuscripts

  1. A uniform Hilbert transform estimate for Lipschitz directions
084The geometric case of the Erdős similarity conjecture2 papers

Real and complex analysis

Original repository description

For every fixed q∈(0,1)q\in(0,1), constructs compact subsets of [0,1][0,1] with measure arbitrarily close to one containing no translated and nontrivially dilated copy of {qn:n≥1}\{q^n:n\ge1\}, with dilations of either sign. This resolves the geometric-progression case of the Erdős similarity conjecture for every ratio.

Read the manuscripts

  1. The geometric case of the Erdős similarity conjecture
  2. The dyadic case of the Erdős similarity conjecture
085Endpoint regularity of the planar centered maximal function1 paper

Real and complex analysis

Original repository description

Resolves the planar centered-disk case of the Hajłasz–Onninen maximal-function regularity problem. For every real f∈W1,1(R2)f\in W^{1,1}(\mathbb R^2), the centered disk maximal function satisfies ∥∇Mf∥1≤C∥∇f∥1\|\nabla Mf\|_1\le C\|\nabla f\|_1 with an absolute constant. It belongs locally to W1,1W^{1,1} and has a globally integrable weak gradient.

Read the manuscripts

  1. An Endpoint Gradient Bound for the Centered Disk Maximal OperatorSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

086An L3L^3 bound for the trilinear Hilbert transform1 paper

Real and complex analysis

Original repository description

Proves that the principal-value trilinear Hilbert transform with shifts x−tx-t, x−2tx-2t, x−3tx-3t is bounded from L3(R)3L^3(\mathbb R)^3 to L1(R)L^1(\mathbb R). This resolves the L3L^3 exponent case of the standard conjecture for slopes 1,2,31,2,3.

Read the manuscripts

  1. An L^3 bound for the trilinear Hilbert transform
087The Mahler conjectures and symplectic width3 papersIn the film

Convex and metric geometry

Original repository description

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≥2n\ge2, every symmetric polar product K×K∘K\times K^\circ in dimension 2n2n has Gromov width 44.

Read the manuscripts

  1. Symmetric Mahler equality casesSource listed in formalization catalogue
  2. General Mahler conjecture
  3. Symplectic balls in polar productsSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

088Petty's projection-volume conjecture and simplex counterexamples2 papers

Convex and metric geometry

Original repository description

Proves Petty's projection-volume conjecture in the remaining dimensions n≥4n\ge4: 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.

Read the manuscripts

  1. Petty’s projection-volume conjectureSource listed in formalization catalogue
  2. Product counterexample to simplex maximumSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

089Bounded-distortion L1L_1 embeddings of planar and bounded-treewidth graphs2 papersIn the film

Convex and metric geometry

Original repository description

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 L1L_1 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.

Read the manuscripts

  1. Planar graph embeddingsSource listed in formalization catalogue
  2. Bounded-treewidth embeddingsSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

090Universal optimality of the triangular lattice4 papersIn the film

Convex and metric geometry

Original repository description

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<20<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.

Read the manuscripts

  1. Atomic certificate
  2. Universal optimality
  3. Fourier circle-packing certificate
  4. Coulomb renormalized energy
091The logarithmic Brunn–Minkowski conjecture1 paper

Convex and metric geometry

Original repository description

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 LpL_p Brunn–Minkowski inequality for full-dimensional origin-symmetric convex bodies throughout 0<p<10<p<1.

Read the manuscripts

  1. The logarithmic Brunn–Minkowski conjectureSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

092The optimal order of convex-body covering density2 papers

Convex and metric geometry

Original repository description

Determines the optimal worst-case covering density as Θ(nlog⁡n)\Theta(n\log n), for both lattice and unrestricted translative coverings. Every convex body in Rn\mathbb R^n, n≥2n\ge2, admits a lattice covering of density at most Cnlog⁡nCn\log n; centrally symmetric examples in every sufficiently large dimension require at least cnlog⁡ncn\log n even without the lattice restriction, for absolute c,C>0c,C>0.

Read the manuscripts

  1. Single-lattice covering boundSource listed in formalization catalogue
  2. Translative covering densities

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

093Dimension-free logarithmic Sobolev inequality for subgaussian log-concave measures1 paper

Convex and metric geometry

Original repository description

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.

Read the manuscripts

  1. Subgaussian logarithmic Sobolev inequality
094Subpolynomial dimension reduction in LpL_p1 paper

Convex and metric geometry

Original repository description

For every fixed 1<p<∞1<p<\infty and distortion D>1D>1, every nn-point subset of real LpL_p embeds into ℓpd\ell_p^d with distortion at most DD and dimension d=no(1)d=n^{o(1)}, answering Naor's sublinear-dimension question for p≠2p\ne2. In contrast, exact embeddings require worst-case dimension Θ(n2)\Theta(n^2) when p≠2p\ne2.

Read the manuscripts

  1. Subpolynomial dimension reduction in LpSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

095Hyperbolicity cones without semidefinite lifts3 papers

Convex and metric geometry

Original repository description

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.

Read the manuscripts

  1. Hyperbolicity Cones Without Semidefinite Lifts
  2. A nonspectrahedral hyperbolicity coneSource listed in formalization catalogue
  3. An Exact Semidefinite Lift of a Nonspectrahedral Hyperbolicity Cone

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

096The Gaussian propeller conjecture1 paper

Convex and metric geometry

Original repository description

Proves that the sum of squared Gaussian first moments of any finite measurable partition is at most 9/(8π)9/(8\pi). In dimension at least two, three planar sectors of angle 2π/32\pi/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)(8\pi/9)(1-1/k) for identity-target kernel clustering with fixed k≥3k\ge3 on rational centered positive semidefinite inputs.

Read the manuscripts

  1. The Gaussian propeller bound in every dimensionSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

097The Euclidean Steinitz–Bergström conjecture1 paper

Convex and metric geometry

Original repository description

Proves that any finite sequence in the Euclidean unit ball of Rd\mathbb R^d admits signs keeping every partial sum within CdC\sqrt 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 S2(d)=Θ(d)S_2(d)=\Theta(\sqrt d).

Read the manuscripts

  1. The Euclidean Steinitz–Bergström theoremSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

098A negative answer to the Lang–Plaut problem1 paper

Convex and metric geometry

Original repository description

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.

Read the manuscripts

  1. A doubling Hilbert subset with no finite-dimensional bi-Lipschitz embeddingSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

099The sharp distortion of edit distance into ℓ1\ell_13 papersIn the film

Convex and metric geometry

Original repository description

Determines the least distortion of embedding edit distance on words of length at most dd into real ℓ1\ell_1: it is exp⁡(Θ(log⁡d log⁡log⁡d))\exp(\Theta(\sqrt{\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 dd; binary words already force the lower bound.

Read the manuscripts

  1. Matching bounds
  2. Finite circles
  3. Tree constructions
100A counterexample to Bang's cylinder-covering bound4 papers

Convex and metric geometry

Original repository description

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.

Read the manuscripts

  1. Angular cylinder covers
  2. Ruled-set approximation
  3. Slope-field perturbations
  4. Radial-sweep approximation
101The sharp simplex conjecture for isotropic constants1 paper

Convex and metric geometry

Original repository description

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.

Read the manuscripts

  1. A sharp entropy bound and the simplex inequality for isotropic constants
102The Unique Games Conjecture and optimal approximation thresholds5 papersIn the film

Theoretical computer science

Original repository description

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.

Read the manuscripts

  1. Unique Games theoremSource listed in formalization catalogue
  2. Optimal Max-Cut hardnessSource listed in formalization catalogue
  3. Factor-two Vertex Cover hardnessSource listed in formalization catalogue
  4. Constant-factor Min-UnCut hardness
  5. Directed feedback vertex set hardness

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

103Derandomization of logarithmic space: L=RL=BPL\mathsf L=\mathsf{RL}=\mathsf{BPL}1 paperIn the film

Theoretical computer science

Original repository description

Proves L=RL=BPL\mathsf L=\mathsf{RL}=\mathsf{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.

Read the manuscripts

  1. Exact derandomization of logarithmic space: L = RL = BPL
104Quasipolynomial algorithms for mean-payoff, stochastic and parity games4 papers

Theoretical computer science

Original repository description

Gives deterministic algorithms using 2O((log⁡(L+2))2)2^{O((\log(L+2))^2)} bit operations, for complete binary input length LL, 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.

Read the manuscripts

  1. Turn-Based Stochastic Mean-Payoff Games in Deterministic Quasipolynomial Time
  2. Mean-payoff parity games in quasipolynomial time
  3. Deterministic algorithm
  4. Randomized algorithmSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

105The 2-to-1 Games Conjecture with perfect completeness1 paper

Theoretical computer science

Original repository description

Proves Khot's 2-to-1 Games Conjecture with perfect completeness: for every fixed rational δ∈(0,1)\delta\in(0,1), it is NP-hard to distinguish satisfiable games from games whose optimum is at most δ\delta, on explicit unweighted instances. The alphabet depends only on δ\delta, and every right-hand label has exactly two preimages under each constraint map.

Read the manuscripts

  1. Perfect completeness for 2-to-1 gamesSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

106Hardness of coloring three-colorable graphs1 paper

Theoretical computer science

Original repository description

It is NP-hard to color a three-colorable graph using any fixed number c≥3c\ge3 of colors. More strongly, for every fixed 0<δ<1/30<\delta<1/3, a deterministic polynomial-time reduction from 33SAT produces simple unweighted graphs that are three-colorable in the satisfiable case and have no independent set of size δn\delta n otherwise, where nn is the number of vertices.

Read the manuscripts

  1. Hardness of finding large independent sets in three-colorable graphsSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

107Matrix multiplication with exponent at most 9/49/43 papersIn the film

Theoretical computer science

Original repository description

Proves ω≤9/4\omega\le9/4 over C\mathbb C, giving Oε(n9/4+ε)O_\varepsilon(n^{9/4+\varepsilon}) arithmetic operations for square matrix multiplication. In characteristic zero, some inner dimension nan^a with a>0.465a>0.465 permits n2+o(1)n^{2+o(1)} rectangular multiplication. Further square bounds give ω<2.258\omega<2.258 outside finitely many positive characteristics and ω<2.371054886006746\omega<2.371054886006746 over every fixed field.

Read the manuscripts

  1. Exponent at most 9/4 over ℂSource listed in formalization catalogue
  2. Earlier complex and rectangular boundsSource listed in formalization catalogue
  3. Staggered extraction over every fieldSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

108A cubic permanent–determinant lower bound1 paper

Theoretical computer science

Original repository description

Proves an Ω(n3)\Omega(n^3) lower bound for the border determinantal complexity of the n×nn\times n permanent over C\mathbb C. Even coefficientwise limits of determinants of affine-linear matrices require matrix size at least cn3cn^3, for an absolute c>0c>0 and all sufficiently large nn; the same bound therefore holds for exact representations.

Read the manuscripts

  1. A cubic lower bound for border determinantal complexity of the permanent
109Integer multiplication below nlog⁡nn\log n1 paperIn the film

Theoretical computer science

Original repository description

Multiplies two nn-bit integers exactly at every input length in deterministic worst-case time O(n(log⁡n)1−κ)O(n(\log n)^{1-\kappa}), with κ=2−182\kappa=2^{-182}, on one fixed finite-alphabet Turing machine with finitely many one-dimensional tapes. This disproves the Schönhage–Strassen nlog⁡nn\log n optimality conjecture in the ordinary multitape bit model.

Read the manuscripts

  1. Integer multiplication below n log n
110Optimal-order randomized kk-server on arbitrary metrics2 papers

Theoretical computer science

Original repository description

Establishes a randomized competitive ratio O(log⁡2(k+1))O(\log^2(k+1)) for kk-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)\log(t+1) at request tt, with a finite instance-dependent additive movement constant.

Read the manuscripts

  1. Squared-logarithmic randomized k-server
  2. Uniform computation
111One-sample matroid prophet inequalities against an almighty adversary1 paper

Theoretical computer science

Original repository description

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.

Read the manuscripts

  1. One Sample Suffices for Matroid Prophet Inequalities against an Almighty Adversary
112Beyond the square-root exponent for depth-three circuits1 paper

Theoretical computer science

Original repository description

Constructs a single language in deterministic polynomial time whose nn-bit membership function requires 2ω(n)2^{\omega(\sqrt 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.

Read the manuscripts

  1. Beyond the Square-Root Exponent for Depth-Three Boolean CircuitsSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

113Approximate counting and the perfect-matching entropy conjecture2 papers

Theoretical computer science

Original repository description

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.

Read the manuscripts

  1. Perfect-matching FPRAS
  2. Entropy and face dimensionSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

114Approximate counting of common integer polymatroid bases2 papers

Theoretical computer science

Original repository description

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.

Read the manuscripts

  1. An FPRAS for Common Integer Polymatroid Bases with Binary Capacities
  2. Approximate counting of common bases of two matroidsSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

115Sampling and counting contingency tables with arbitrary margins2 papers

Theoretical computer science

Original repository description

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.

Read the manuscripts

  1. Exact uniform sampling
  2. Cell-bounded counting FPRAS
116Uniform identity testing for noncommutative formulas3 papers

Theoretical computer science

Original repository description

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 Q\mathbb Q also admit polynomial-size hitting lists whenever they have a defined rational-matrix evaluation.

Read the manuscripts

  1. Uniform Matrix Hitting Points in Every Positive Characteristic
  2. One rational matrix hitting point
  3. Rational-formula hitting listsSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

117Uniform sparsest cut: hardness and semidefinite gaps2 papers

Theoretical computer science

Original repository description

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)3\sqrt{\log n}/(\log\log n)^3, approaching the square-root-logarithmic upper bound.

Read the manuscripts

  1. Constant-factor hardness
  2. Near-square-root logarithmic integrality gapsSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

118Unbounded bin-packing gaps and the modified integer round-up conjecture1 paper

Theoretical computer science

Original repository description

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/61/6 and each bin holds at most five items.

Read the manuscripts

  1. Additive hardness and unbounded configuration gaps in bin packingSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

119The Courtade–Kumar and Hellinger conjectures2 papers

Theoretical computer science

Original repository description

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.

Read the manuscripts

  1. Sharp binary-information contractionSource listed in formalization catalogue
  2. Arbitrary-bias Hellinger contraction

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

120Almost-linear-time exact matching in general graphs1 paperIn the film

Theoretical computer science

Original repository description

Gives a randomized algorithm finding an exact maximum-cardinality matching in any simple undirected graph in (n+m)1+o(1)(n+m)^{1+o(1)} word time, with success probability at least 2/32/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.

Read the manuscripts

  1. Almost-Linear-Time Maximum-Cardinality Matching in General Graphs
121Almost-linear expected-time approximation of edit distance1 paper

Theoretical computer science

Original repository description

For every fixed rational ε∈(0,1)\varepsilon\in(0,1), gives a randomized (1+ε)(1+\varepsilon) approximation to unit-cost edit distance in worst-case expected time N1+o(1)N^{1+o(1)}, with success probability at least 2/32/3. The strings have total length NN and polynomially bounded integer symbols. This is an asymptotic guarantee at fixed accuracy.

Read the manuscripts

  1. An Almost-Linear Approximation Scheme for Edit Distance
122Superpolynomial lower bounds and quasipolynomial reconstruction from deletion traces3 papers

Theoretical computer science

Original repository description

At every fixed deletion probability in (0,1)(0,1), reconstructing an arbitrary length-nn binary string requires nΩ(log⁡log⁡n)n^{\Omega(\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−εn^{-\varepsilon} for fixed ε>0\varepsilon>0, both bounds become polynomial in the input and parameter encoding.

Read the manuscripts

  1. Uniform quasipolynomial-time trace reconstruction
  2. A latest-anchor induction with spectrally compact masks for worst-case trace reconstruction
  3. Quantitative lower bounds for trace reconstruction
124Polynomial-time scheduling on three identical machines1 paper

Theoretical computer science

Original repository description

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.

Read the manuscripts

  1. A Polynomial-Time Algorithm for Three-Machine Unit-Job Scheduling
125The approximation threshold for metric kk-median2 papers

Theoretical computer science

Original repository description

Gives a deterministic polynomial-time (1+2/e+ε)(1+2/e+\varepsilon)-approximation for finite rational metric kk-median with specified candidate facilities, for every fixed ε>0\varepsilon>0. Assuming P≠NPP\ne NP, the optimal infimum approximation factor is 1+2/e1+2/e.

Read the manuscripts

  1. Single-exponential recoverySource listed in formalization catalogue
  2. Approximation threshold

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

126Exponential semidefinite complexity of perfect matching1 paper

Theoretical computer science

Original repository description

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<ρ<10<\rho<1, allowing arbitrary real positive semidefinite factors.

Read the manuscripts

  1. Exponential PSD rank of positively shifted matching matrices
127The asymptotic Gotsman–Linial conjecture1 paper

Theoretical computer science

Original repository description

Proves that a degree-at-most-dd polynomial threshold function on the uniform nn-dimensional Boolean cube has average sensitivity at most 8dn8d\sqrt n, uniformly for 1≤d≤n1\le d\le 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\operatorname{sign}(0)=1.

Read the manuscripts

  1. Average sensitivity of polynomial threshold functionsSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

128A factor-two approximation for shortest common superstring1 paper

Theoretical computer science

Original repository description

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.

Read the manuscripts

  1. A Polynomial-Time 2-Approximation for Shortest Common SuperstringSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

129Exponential state costs for two-way automata2 papers

Theoretical computer science

Original repository description

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.

Read the manuscripts

  1. Nondeterministic complementation lower boundSource listed in formalization catalogue
  2. Two-way deterministic state lower boundSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

130Fourier transforms below nlog⁡nn\log n2 papers

Theoretical computer science

Original repository description

Gives a deterministic length-nn discrete Fourier transform algorithm using O(n(log⁡n)1−δ)O(n(\log n)^{1-\delta}) operations for every nn, with explicit δ=10−13\delta=10^{-13}. The model uses exact complex arithmetic, unrestricted coefficients and a supplied root of unity, and counts scalar preparation and logarithmic-word indexing.

Read the manuscripts

  1. Explicit DFT power saving
  2. Tensor savings and Fourier circuitsSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

131Polynomial mixing of graph switches with prescribed degrees1 paper

Theoretical computer science

Original repository description

Resolves the simple-undirected Kannan–Tetali–Vempala conjecture: the lazy edge-switch chain mixes in O(n8)O(n^8) 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.

Read the manuscripts

  1. Polynomial mixing of the switch chain for every graphical degree sequence
132A counterexample to the quadratic sensitivity conjecture1 paper

Theoretical computer science

Original repository description

Constructs total Boolean functions with block sensitivity bs⁡(f)≥s(f)α\operatorname{bs}(f)\ge s(f)^\alpha for a fixed α>2\alpha>2, disproving the quadratic strengthening of the Sensitivity Conjecture. Here s(f)s(f) counts influential individual-bit flips, while block sensitivity allows disjoint groups of bits to change together.

Read the manuscripts

  1. A superquadratic separation between sensitivity and block sensitivitySource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

133The complexity of Weisfeiler–Leman refinement4 papers

Theoretical computer science

Original repository description

Proves unconditional nΩ(k)n^{\Omega(k)} deterministic time lower bounds for joint and separate kk-dimensional Weisfeiler–Leman equivalence, for sufficiently large fixed kk 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.

Read the manuscripts

  1. Parity lifts and bounded-treewidth witnesses
  2. Graph-identification complexity
  3. Unconditional time lower bounds
  4. Variable-dimension equivalence
134Generalized star height at most three3 papers

Theoretical computer science

Original repository description

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.

Read the manuscripts

  1. Finite-monoid computations
  2. Star height at most four
  3. Star height at most three
135Sharp homogeneous depth-five complexity of matrix products1 paper

Theoretical computer science

Original repository description

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

Read the manuscripts

  1. Homogeneous depth-five lower bounds for iterated matrix multiplication
136The quasilinear PCP-for-PPAD conjecture1 paper

Theoretical computer science

Original repository description

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

Read the manuscripts

  1. The PCP-for-PPAD conjecture: a quasilinear reduction
137One-tape time simulation in two-fifths-power space1 paper

Theoretical computer science

Original repository description

Determines the halting and finite-control outcome of a fixed deterministic one-writable-tape machine up to time TT using O(T2/5log⁡C(T+2))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 TT, and contents and input symbols have polylogarithmic-space access. Simulation time is unrestricted.

Read the manuscripts

  1. Simulating One-Tape Time in Two-Fifths-Power Space
138Subset Sum in O(20.49n)O(2^{0.49n}) time2 papers

Theoretical computer science

Original repository description

Gives a uniform randomized classical algorithm for worst-case Subset Sum in ordinary O(20.49n)O(2^{0.49n}) word-RAM time on polynomial-bit inputs, where nn counts the integers. The time bound holds on every execution and success probability is at least 2/32/3 on every input. Inputs may repeat positive integers; words have O(n+b)O(n+b) bits for maximum input bit length bb.

Read the manuscripts

  1. Subset Sum in Time O(2^0.49n)
  2. A Low-Space Algorithm for Worst-Case Subset Sum
139Subpolynomial queries for log-concave sampling1 paper

Theoretical computer science

Original repository description

For C2C^2 potentials with a supplied minimizer and I⪯∇2V⪯2II\preceq\nabla^2V\preceq2I, proves that sampling within total variation 1/101/10 requires only CεdεC_\varepsilon d^\varepsilon exact value-and-gradient queries for every fixed ε>0\varepsilon>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.

Read the manuscripts

  1. Subpolynomial query complexity for well-conditioned log-concave samplingSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

140Memory–sample lower bounds for noiseless Gaussian regression6 papers

Theoretical computer science

Original repository description

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

Read the manuscripts

  1. Memory and precisionSource listed in formalization catalogue
  2. Posterior replicasSource listed in formalization catalogue
  3. Localization costs
  4. Projection moments and Riesz estimatesSource listed in formalization catalogue
  5. Observation replacementSource listed in formalization catalogue
  6. Subsphere methodsSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

141The existential theory of the reals and existential–universal sentences in the counting hierarchy1 paper

Theoretical computer science

Original repository description

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.

Read the manuscripts

  1. Existential–universal real sentences in the counting hierarchy
142Deterministic polynomial factorization over prime fields1 paperIn the film

Theoretical computer science

Original repository description

Gives a uniform deterministic algorithm that completely factors every nonzero dense degree-nn polynomial over a prime field Fp\mathbb F_p, including multiplicities, in bit complexity polynomial in (n+1)log⁡p(n+1)\log p. The prime is supplied in binary. No randomness, integer-factorization or primitive-root oracle, or GRH assumption is required.

Read the manuscripts

  1. Deterministic Polynomial Factorization over Prime Fields
143Uniform limit-cycle bounds in Hilbert's sixteenth problem2 papersIn the film

Dynamical systems and ergodic theory

Original repository description

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.

Read the manuscripts

  1. Uniform limit-cycle bounds
  2. Quintic Liénard limit cyclesSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

144Banach's simple Lebesgue-spectrum problem1 paper

Dynamical systems and ergodic theory

Original repository description

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 L2L^2 space: the bilateral iterates of one real observable form an orthonormal basis of that space.

Read the manuscripts

  1. A smooth three-torus diffeomorphism with simple Lebesgue spectrum
145Rokhlin's multiple-mixing problem1 paperIn the film

Dynamical systems and ergodic theory

Original repository description

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.

Read the manuscripts

  1. Rokhlin's multiple-mixing problem for one transformation
146Sinai's positive-entropy conjecture for the standard map1 paper

Dynamical systems and ergodic theory

Original repository description

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.

Read the manuscripts

  1. Positive Metric Entropy for the Standard Map at Large Parameters
147The near-boundary Birkhoff conjecture2 papers

Dynamical systems and ergodic theory

Original repository description

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.

Read the manuscripts

  1. Analytic caustic collars
  2. Billiard rigidity
148The dimension formula for self-similar measures on the line1 paper

Dynamical systems and ergodic theory

Original repository description

For every self-similar measure on the line generated by finitely many contracting similarities, proves dim⁡Hμ=min⁡{1,hRW/χ}\dim_{\mathrm H}\mu=\min\{1,h_{\mathrm{RW}}/\chi\}, where hRWh_{\mathrm{RW}} is the entropy rate of random composed maps and χ\chi the average logarithmic contraction. This resolves the entropy-rate dimension conjecture without a separation assumption, allowing exact overlaps and unequal contraction ratios.

Read the manuscripts

  1. The entropy-rate dimension formula for self-similar measures on the lineSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

149Permanence for weakly reversible reaction networks2 papersIn the film

Dynamical systems and ergodic theory

Original repository description

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.

Read the manuscripts

  1. Uniform Permanence in Weakly Reversible Mass-Action Systems
  2. Boundedness and persistence of weakly reversible mass-action systems
150Weak mixing of irrational triangular billiards2 papers

Dynamical systems and ergodic theory

Original repository description

Proves that the billiard flow in every nondegenerate Euclidean triangle with at least one angle irrational relative to π\pi is weakly mixing for normalized area times uniform direction. This strengthens ergodicity on the entire irrational-angle class, with no genericity or Diophantine restrictions.

Read the manuscripts

  1. Weak mixing of triangular billiards with an irrational angle
  2. Ergodicity of triangular billiards with an irrational angle
151A C1C^1 counterexample to Shub’s entropy conjecture1 paper

Dynamical systems and ergodic theory

Original repository description

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

Read the manuscripts

  1. A Cˆ1 Counterexample to the Entropy Conjecture
152Zero entropy does not guarantee a smooth positive-volume model1 paper

Dynamical systems and ergodic theory

Original repository description

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

Read the manuscripts

  1. A zero-entropy system without a smooth positive-volume model
153Arithmetic classification of Bernoulli convolutions1 paper

Dynamical systems and ergodic theory

Original repository description

Classifies singular and absolutely continuous unbiased Bernoulli convolutions for every λ∈(0,1)\lambda\in(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)(1,2), giving examples beyond reciprocal Pisot parameters.

Read the manuscripts

  1. Arithmetic classification and non-Pisot singularity for Bernoulli convolutions
154Pointwise multiple ergodic averages for mixing transformations4 papers

Dynamical systems and ergodic theory

Original repository description

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.

Read the manuscripts

  1. Pointwise Multiple Ergodic Averages for Mixing Transformations
  2. Pointwise convergence of fourfold ergodic averages for mixing transformations
  3. Triple ergodic averages with distinct integer slopes
  4. Pointwise convergence of triple ergodic averages for mixing transformations
155A counterexample to periodic tiling in dimension three1 paperIn the film

Combinatorics

Original repository description

Constructs a finite translational tile in Z3\mathbb Z^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 R3\mathbb R^3, even with arbitrary real translation vectors.

Read the manuscripts

  1. A translational tile with no fully periodic tiling in dimension threeSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

156Borsuk's conjecture fails in dimension nine1 paperIn the film

Combinatorics

Original repository description

Constructs a compact subset of R9\mathbb R^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 R4\mathbb R^4, with the Frobenius metric.

Read the manuscripts

  1. A nine-dimensional counterexample to Borsuk's covering assertionSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

157Counterexamples to the Hadwiger and Colin de Verdière conjectures3 papers

Combinatorics

Original repository description

Disproves Hadwiger's conjecture even for fractional coloring: arbitrarily large finite simple graphs with independence number at most two satisfy χf(G)>h(G)\chi_f(G)>h(G), where h(G)h(G) is the largest clique-minor order. Also disproves the fractional Colin de Verdière chromatic bound χf(G)≤μ(G)+1\chi_f(G)\le\mu(G)+1. In the positive direction, every finite nonempty graph satisfies χlist(G)≤Ch(G)\chi_{\mathrm{list}}(G)\le C h(G) for a universal constant CC.

Read the manuscripts

  1. Hadwiger counterexample
  2. Colin de Verdière counterexample
  3. Linear list-coloring bound
158The Euclidean plane cannot be colored with five colors1 paperIn the film

Combinatorics

Original repository description

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.

Read the manuscripts

  1. The Euclidean plane is not five-colorableSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

159Erdős's reciprocal-sum conjecture and quasipolynomial Szemerédi bounds1 paperIn the film

Combinatorics

Original repository description

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≥3k\ge3, every subset of {1,…,N}\{1,\ldots,N\} with no nonconstant kk-term progression has size at most CkNexp⁡[−ck(log⁡N)εk]C_kN\exp[-c_k(\log N)^{\varepsilon_k}], with positive constants depending only on kk.

Read the manuscripts

  1. Quasipolynomial Bounds for Arithmetic Progressions
160Superexponential van der Waerden numbers1 paper

Combinatorics

Original repository description

Resolves Erdős's superexponential-growth question for van der Waerden numbers. If Wr(k)W_r(k) is the least interval length forcing a monochromatic kk-term progression in every rr-coloring, then Wr(k)>kck⌊log⁡2r⌋W_r(k)>k^{ck\lfloor\log_2 r\rfloor} for an absolute c>0c>0, all r≥2r\ge2 and sufficiently large kk, uniformly in rr. In particular, Wr(k)1/k→∞W_r(k)^{1/k}\to\infty for each fixed rr.

Read the manuscripts

  1. Quantitative Superexponential Bounds for van der Waerden NumbersSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

161Counterexamples to Sidorenko's conjecture and the forcing conjecture1 paperIn the film

Combinatorics

Original repository description

Disproves Sidorenko's conjecture with a connected bipartite pattern on 3535 vertices and 6666 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.

Read the manuscripts

  1. A counterexample to Sidorenko's conjecture
162Counterexamples to Ryser's covering and Gyárfás's tree-cover conjectures2 papers

Combinatorics

Original repository description

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

Read the manuscripts

  1. Balanced prime-order counterexamples
  2. Original counterexampleSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

164Hindman's finite sums and products conjecture1 paper

Combinatorics

Original repository description

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.

Read the manuscripts

  1. Monochromatic finite sums and products in the positive integers
165Exact crossing numbers of complete and complete bipartite graphs2 papersIn the film

Combinatorics

Original repository description

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.

Read the manuscripts

  1. Complete graphsSource listed in formalization catalogue
  2. Complete bipartite graphsSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

166The higher-dimensional Erdős distinct-distances conjecture1 paper

Combinatorics

Original repository description

For every fixed d≥3d\ge3, any n≥2n\ge2 distinct points in Rd\mathbb R^d determine at least cdn2/dc_dn^{2/d} distinct distances, with cd>0c_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.

Read the manuscripts

  1. The higher-dimensional Erdős distinct-distances conjecture
167Pinned distances and a power saving for planar unit distances2 papers

Combinatorics

Original repository description

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

Read the manuscripts

  1. Weak pinned planar distancesSource listed in formalization catalogue
  2. Planar unit-distance power saving

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

168Combinatorial invariance of Kazhdan–Lusztig polynomials1 paper

Combinatorics

Original repository description

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.

Read the manuscripts

  1. Combinatorial invariance of Kazhdan–Lusztig polynomials
169The Shareshian–Wachs ee-positivity conjecture1 paper

Combinatorics

Original repository description

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 N[q]\mathbb N[q]. The coefficients count explicitly described permutations, giving a combinatorial explanation of positivity.

Read the manuscripts

  1. Elementary positivity of chromatic quasisymmetric functions
170Sharp logarithmic exponents for off-diagonal Ramsey numbers2 papers

Combinatorics

Original repository description

For every fixed integer s≥5s\ge5, proves r(s,t)=ts−1/(log⁡t)s−2+o(1)r(s,t)=t^{s-1}/(\log t)^{s-2+o(1)} as t→∞t\to\infty, determining the logarithmic exponent and matching the classical upper bound at that scale. Here r(s,t)r(s,t) is the least number of vertices forcing an ss-clique or a tt-vertex independent set.

Read the manuscripts

  1. r(5,t) logarithmic exponent
  2. Fixed off-diagonal Ramsey numbers
171The hypercube Ramsey conjecture1 paper

Combinatorics

Original repository description

Resolves the Burr–Erdős hypercube Ramsey conjecture: the two-color Ramsey number of the nn-dimensional cube is Θ(2n)\Theta(2^n). 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.

Read the manuscripts

  1. The hypercube Ramsey number has linear order
172Classification of finite Euclidean Ramsey configurations1 paper

Combinatorics

Original repository description

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.

Read the manuscripts

  1. A classification of finite Euclidean Ramsey configurationsSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

173Seymour's second-neighborhood conjecture1 paper

Combinatorics

Original repository description

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.

Read the manuscripts

  1. A proof of Seymour’s second-neighborhood conjectureSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

174Deterministic construction of strong thin spanning trees2 papers

Combinatorics

Original repository description

Resolves the strong thin-tree conjecture constructively. Every finite loopless kk-edge-connected multigraph on at least two vertices has a spanning tree containing at most a universal C/kC/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.

Read the manuscripts

  1. Strong thin tree conjectureSource listed in formalization catalogue
  2. Polynomial-time construction

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

175Talagrand's conjectures and graph decompositions at expectation thresholds3 papers

Combinatorics

Original repository description

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.

Read the manuscripts

  1. Graph Decompositions at the Integral Expectation Threshold
  2. Expectation-threshold equivalenceSource listed in formalization catalogue
  3. Discrete convexitySource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

176The second Kahn–Kalai conjecture1 paper

Combinatorics

Original repository description

Proves the second Kahn–Kalai conjecture: for every finite simple graph HH with h≥1h\ge1 edges and at most nn vertices, its appearance threshold in G(n,p)G(n,p) is at most CpE(n,H)(1+log⁡2h)C p_{\mathrm E}(n,H)(1+\log_2 h), with universal CC. Here pEp_{\mathrm E} is the least density at which every subgraph of HH has expected copy count at least 1/21/2.

Read the manuscripts

  1. The second Kahn–Kalai conjectureSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

177Bounded-degree coboundary expanders in every dimension1 paper

Combinatorics

Original repository description

Constructs arbitrarily large finite dd-dimensional simplicial complexes, for every d≥3d\ge3, with uniformly bounded vertex degrees and uniform F2\mathbb F_2 coboundary expansion in every degree below dd. Together with the known graph and two-dimensional cases, this establishes the existence of such expanders in every positive dimension.

Read the manuscripts

  1. Bounded-degree coboundary expanders in every dimension
178Deterministic nonbipartite Ramanujan graphs in every fixed degree1 paper

Combinatorics

Original repository description

For every fixed d≥3d\ge3, constructs a simple dd-regular nonbipartite Ramanujan graph on every sufficiently large even number nn of vertices, with every nonconstant adjacency eigenvalue strictly between −2d−1-2\sqrt{d-1} and 2d−12\sqrt{d-1}. A deterministic algorithm outputs the full adjacency list in polynomial bit time, with exponent depending on dd.

Read the manuscripts

  1. Deterministic nonbipartite Ramanujan graphs in every fixed degree
179The circulant Hadamard conjecture1 paper

Combinatorics

Original repository description

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

Read the manuscripts

  1. The circulant Hadamard conjectureSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

180Barnette's Hamiltonian-cycle conjecture1 paper

Combinatorics

Original repository description

Proves that every finite simple cubic bipartite planar 33-vertex-connected graph has a Hamiltonian cycle, resolving Barnette's conjecture. Equivalently, every three-edge path in a finite simple cubic 33-vertex-connected bipartite Pfaffian graph lies in a Hamiltonian cycle.

Read the manuscripts

  1. Paired states and Hamiltonian cycles in cubic bipartite planar graphs
181The Erdős–Gallai cycle-decomposition conjecture1 paper

Combinatorics

Original repository description

Proves that the edges of every finite simple undirected graph on nn vertices can be partitioned into at most CnCn simple cycles and single edges, for an absolute constant CC. This resolves the Erdős–Gallai cycle-decomposition conjecture, bounding the number of pieces linearly even for dense graphs.

Read the manuscripts

  1. A linear cycle-and-edge decomposition of every graphSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

182Power savings for polynomial-difference-free sets3 papers

Combinatorics

Original repository description

For every fixed intersective integer polynomial hh of degree k≥2k\ge2 with positive leading coefficient, proves that a subset of {1,…,N}\{1,\ldots,N\} avoiding nonzero values h(1),h(2),…h(1),h(2),\ldots as differences has size Oh(N1−ck)O_h(N^{1-c_k}), with ck>0c_k>0 depending only on degree. Here intersective means having a root modulo every modulus. For prime arguments, a power saving also holds when hh has a unit root modulo every modulus, with exponent allowed to depend on hh.

Read the manuscripts

  1. A power saving for intersective polynomial differences with an exponent depending only on the degree
  2. A Power Saving for Polynomial Differences at Prime Arguments
  3. A power saving for square-difference-free sets
183Power savings for planar halving lines and kk-sets1 paper

Combinatorics

Original repository description

Improves the planar halving-line bound to O(n4/3−ε)O(n^{4/3-\varepsilon}) for sets with no three collinear and an absolute ε>0\varepsilon>0. More generally, an nn-point set with no three collinear has O(n(k+1)1/3−ε0)O(n(k+1)^{1/3-\varepsilon_0}) strictly separable kk-subsets for 1≤k≤n/21\le k\le n/2, with an absolute ε0>0\varepsilon_0>0. The constants and positive exponents are nonquantitative.

Read the manuscripts

  1. A power saving for planar halving lines
184Coloring and independence in graphs with forbidden subgraphs2 papers

Combinatorics

Original repository description

Proves the Alon–Krivelevich–Sudakov coloring conjecture in correspondence-coloring form: graphs avoiding any fixed subgraph FF need OF(Δ/log⁡Δ)O_F(\Delta/\log\Delta) colors when their maximum degree Δ\Delta is sufficiently large. Also proves the Ajtai–Erdős–Komlós–Szemerédi independence conjecture: for fixed r≥4r\ge4, every nn-vertex KrK_r-free graph of average degree d≥2d\ge2 has an independent set of size Ωr(nlog⁡d/d)\Omega_r(n\log d/d).

Read the manuscripts

  1. Correspondence coloring graphs with a forbidden clique
  2. A logarithmic independence bound for clique-free graphsSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

185Counterexamples to infinite matroid intersection and packing/covering1 paper

Combinatorics

Original repository description

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.

Read the manuscripts

  1. A Counterexample to the Infinite Matroid Packing/Covering ConjectureSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

186The Friedgut–Kalai graph and hypergraph threshold conjectures2 papers

Combinatorics

Original repository description

Proves the Friedgut–Kalai threshold-width conjectures for graphs and fixed-uniformity hypergraphs. For fixed 0<ε<1/20<\varepsilon<1/2, every nontrivial increasing relabeling-invariant property crosses from probability ε\varepsilon to 1−ε1-\varepsilon within width O((log⁡n)−2)O((\log n)^{-2}) for graphs and Or((log⁡n)−r/(r−1))O_r((\log n)^{-r/(r-1)}) for rr-uniform hypergraphs, r≥3r\ge3. The hypergraph influence bound also applies to nonmonotone properties.

Read the manuscripts

  1. A uniform influence bound for hypergraph properties
  2. A Sharp Threshold Bound for Monotone Graph Properties
187Snaky in 21 Maker moves1 paper

Combinatorics

Original repository description

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.

Read the manuscripts

  1. Snaky in 21 Maker moves
188The sharp constant in random triangle removal1 paper

Combinatorics

Original repository description

Starting from the complete graph on nn vertices, repeatedly delete a uniformly chosen remaining triangle. The terminal edge count is asymptotic to n3/2/(22)n^{3/2}/(2\sqrt2), with mean-square convergence after normalization by n3/2n^{3/2}. This proves the triangle case of the Joos–Kühn sharp-constant conjecture.

Read the manuscripts

  1. The sharp terminal leave in random triangle removal
189Exact cycle–clique Ramsey numbers1 paper

Combinatorics

Original repository description

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

Read the manuscripts

  1. Cycle–clique Ramsey numbers
190Polynomial removal fails for ordered binary matrices1 paper

Combinatorics

Original repository description

Disproves polynomial ordered binary matrix removal with one fixed 66×6666\times66 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.

Read the manuscripts

  1. Polynomial removal fails for ordered binary matricesSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

191A power improvement in the Heilbronn triangle problem1 paper

Combinatorics

Original repository description

For every sufficiently large nn, constructs nn points in the unit square such that every triangle has area at least n−2+cn^{-2+c} for one absolute c>0c>0. This disproves the conjectured almost-n−2n^{-2} upper bound in Heilbronn's triangle problem, which asks how large the smallest determined triangle can be.

Read the manuscripts

  1. A power improvement in the Heilbronn triangle lower bound
192A counterexample to the Gopalan–Servedio conjecture1 paper

Combinatorics

Original repository description

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

Read the manuscripts

  1. Unbounded Violations of the Square-Root Degree Bound
193Serre's intersection-multiplicity conjecture1 paperIn the film

Algebra

Original repository description

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

Read the manuscripts

  1. Positivity of Serre's Intersection Multiplicity
194Lech's multiplicity conjecture1 paper

Algebra

Original repository description

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

Read the manuscripts

  1. Lech's multiplicity conjecture
195A counterexample to the small Cohen–Macaulay module conjecture1 paper

Algebra

Original repository description

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

Read the manuscripts

  1. A Complete Local Domain without a Small Cohen–Macaulay Module
196A counterexample to Kaplansky's zero-divisor conjecture1 paperIn the film

Algebra

Original repository description

Constructs a finitely presented torsion-free group GG whose group algebra F2[G]\mathbb F_2[G] has nonzero zero divisors, disproving Kaplansky's zero-divisor conjecture. The group has a finite two-dimensional classifying space.

Read the manuscripts

  1. A Torsion-Free Group Algebra with Zero DivisorsSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

197Nonsofic groups and group-ring counterexamples4 papersIn the film

Algebra

Original repository description

Constructs a finitely presented torsion-free nonsofic group whose group algebra over F2\mathbb F_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.

Read the manuscripts

  1. Torsion-free direct-finiteness counterexample
  2. Characteristic twoSource listed in formalization catalogue
  3. DeterminantSource listed in formalization catalogue
  4. Odd characteristicSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

198A counterexample to the little finitistic-dimension conjecture1 paperIn the film

Algebra

Original repository description

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

Read the manuscripts

  1. An algebra of infinite little finitistic dimensionSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

199Counterexamples to conjectures of Auslander–Reiten, Tachikawa, and Nakayama2 papersIn the film

Algebra

Original repository description

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.

Read the manuscripts

  1. Auslander–Reiten counterexampleSource listed in formalization catalogue
  2. Tachikawa’s second conjectureSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

200Eisenbud–Green–Harris and lex-plus-powers in characteristic zero2 papers

Algebra

Original repository description

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.

Read the manuscripts

  1. Artinian lex-plus-powers Betti theorem
  2. Commuting division-coefficient forms
201A counterexample to Kurosh's division-ring problem1 paper

Algebra

Original repository description

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.

Read the manuscripts

  1. A Counterexample to Kurosh’s Division-Ring Problem
202The blockwise Alperin weight conjecture1 paper

Algebra

Original repository description

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.

Read the manuscripts

  1. The Blockwise Alperin Weight Conjecture
203Donovan's conjecture over fields and discrete valuation rings2 papers

Algebra

Original repository description

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

Read the manuscripts

  1. Donovan over algebraically closed fields
  2. Integral Donovan over Witt vectors
204Tensor saturation for even spin groups1 paper

Algebra

Original repository description

Proves saturation factor one for Spin⁡(2n)\operatorname{Spin}(2n), n≥2n\ge2: 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-DD part of the simply-laced saturation conjecture.

Read the manuscripts

  1. Tensor saturation for even spin groups
205Saxl's conjecture and universal tensor squares2 papers

Algebra

Original repository description

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

Read the manuscripts

  1. Universal tensor squares
  2. Cyclic polytabloid proofSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

206Finite lattice representation: counterexamples and undecidability2 papers

Algebra

Original repository description

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.

Read the manuscripts

  1. Characterization and undecidability
  2. Negative solution
207The ℓ1\ell^1-Bass and complex Bass trace conjectures2 papers

Algebra

Original repository description

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

Read the manuscripts

  1. The ℓ^1-Bass Conjecture for Discrete Groups
  2. The Bass trace conjecture and the characteristic-zero Kaplansky idempotent conjectureSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

208The finite Benson–Etingof–Ostrik conjecture1 paper

Algebra

Original repository description

Proves that every finite symmetric tensor category over an algebraically closed field kk of characteristic p>0p>0 admits a kk-linear exact faithful strong symmetric monoidal fiber functor to a higher Verlinde category Verpn\mathrm{Ver}_{p^n}. The level may depend on the category, and the theorem includes characteristic two, resolving the finite case of the Benson–Etingof–Ostrik conjecture.

Read the manuscripts

  1. Fiber functors for finite symmetric tensor categories in positive characteristic
209Integral counterexamples to Gersten’s conjecture2 papers

Algebra

Original repository description

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

Read the manuscripts

  1. Integral Gersten counterexample
  2. Degree-three Gersten counterexample
210Foulkes’ conjecture for sixth powers and quadratic stabilization2 papers

Algebra

Original repository description

Proves the sixth case of Foulkes’ conjecture: Sym⁡6(Sym⁡bV)\operatorname{Sym}^6(\operatorname{Sym}^bV) embeds equivariantly in Sym⁡b(Sym⁡6V)\operatorname{Sym}^b(\operatorname{Sym}^6V) for every b≥6b\ge6 and finite-dimensional complex VV. More generally, the canonical multiplication map Sym⁡b(Sym⁡aV)→Sym⁡a(Sym⁡bV)\operatorname{Sym}^b(\operatorname{Sym}^aV)\to\operatorname{Sym}^a(\operatorname{Sym}^bV) is surjective for a≥2a\ge2 and b≥a(a−1)b\ge a(a-1), giving dimension-independent quadratic stabilization.

Read the manuscripts

  1. Sixth symmetric power
  2. Quadratic stabilizationSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

211Geometry, diffusion, and spectra of random planar maps7 papersIn the film

Probability and statistical mechanics

Original repository description

Critical Fortuin–Kasteleyn planar maps converge to Liouville quantum gravity spheres for 0<q≤40<q\le4 and to the Brownian continuum random tree for q>4q>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.

Read the manuscripts

  1. Random Walks on Critical FK–Ising Maps and Liouville Brownian Motion
  2. Spectral convergence for critical FK–Ising planar maps
  3. A Linear Clock for Random Walk on Tree-Weighted Planar Maps
  4. Subcritical conformal limits
  5. Critical sphere at q=4
  6. FK and spanning-tree metric-measure limits
  7. Brownian CRT limits for q>4
212No bigeodesics and smooth limit shapes in planar first-passage percolation2 papers

Probability and statistical mechanics

Original repository description

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 C1C^1 boundary. Differentiability also holds for every Gamma law with positive shape and rate.

Read the manuscripts

  1. No bigeodesics
  2. Strict convexity and differentiabilitySource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

213No infinite critical clusters on quasi-transitive graphs2 papersIn the film

Probability and statistical mechanics

Original repository description

Resolves the Benjamini–Schramm criticality conjecture for bond percolation on every infinite connected locally finite quasi-transitive graph with pc<1p_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 Z3\mathbb Z^3.

Read the manuscripts

  1. Cubic-lattice bond and site percolationSource listed in formalization catalogue
  2. Quasi-transitive graphs at criticality

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

214The Benjamini–Schramm nonuniqueness conjecture1 paper

Probability and statistical mechanics

Original repository description

Proves pc<pup_c<p_u 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.

Read the manuscripts

  1. Nonuniqueness of percolation on nonamenable quasi-transitive graphs
215Massive continuum limits and exact mass asymptotics for planar O(n)O(n) models5 papers

Probability and statistical mechanics

Original repository description

Constructs the canonical continuum limit of the two-dimensional nearest-neighbor O(3)O(3) model: a non-Gaussian local relativistic theory with a unique vacuum and a positive mass gap. For the square-lattice O(4)O(4) model, determines the exact leading asymptotic of the full transfer gap, mlat(β)∼32eπ/4−1/2β e−πβm_{\mathrm{lat}}(\beta)\sim32e^{\pi/4-1/2}\sqrt\beta\,e^{-\pi\beta}. The family also proves exponential spin-correlation decay for two-dimensional nearest-neighbor O(n)O(n) models with n≥3n\ge3 at every positive temperature.

Read the manuscripts

  1. O(3) massive continuum limit
  2. O(3) isolated particle pole
  3. Exact mass asymptotics for the two-dimensional O(4) lattice model
  4. O(4) mass bounds
  5. O(n) exponential decaySource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

216Critical logarithmic corrections and BKT scaling for the planar XY model6 papers

Probability and statistical mechanics

Original repository description

For the square-lattice nearest-neighbor cosine XY model, proves critical axis correlations Cβc(r)∼Ar−1/4(log⁡r)1/8C_{\beta_c}(r)\sim Ar^{-1/4}(\log r)^{1/8} and the Berezinskii–Kosterlitz–Thouless essential singularity βc−βlog⁡ξ(β)→B\sqrt{\beta_c-\beta}\log\xi(\beta)\to B, with A,B>0A,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.

Read the manuscripts

  1. The critical logarithmic correction for the planar XY model
  2. Critical Center Magnetization in the Planar XY Model
  3. The Critical Spin Field of the Planar XY Model
  4. Essential Singularity of the Correlation Length in the Planar XY Model
  5. Critical XY correlation exponent
  6. Height and spin-field universality
217The low-temperature Sherrington–Kirkpatrick fluctuation law2 papers

Probability and statistical mechanics

Original repository description

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

Read the manuscripts

  1. Free-energy limiting law
  2. Fluctuation scale
218Conformal universality for weakly interacting and disordered Ising models6 papersIn the film

Probability and statistical mechanics

Original repository description

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\mathrm{SLE}_3 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.

Read the manuscripts

  1. Quenched SLE_3 limits for general weak random-bond Ising models
  2. Quenched SLE_3 Universality for the Weak Random-Bond Ising Model
  3. Logarithmic Relative Fluctuations in the Weakly Disordered Planar Ising Model
  4. Bulk correlation universality
  5. SLE_3 universality
  6. Stopping-band resolution
219GOE universality for random regular graphs with weak disorder2 papers

Probability and statistical mechanics

Original repository description

For every fixed degree d≥3d\ge3, the bulk adjacency-eigenvalue point process of a uniform simple random dd-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.

Read the manuscripts

  1. Fixed-energy universality for weak Anderson disorder on random regular graphs
  2. GOE bulk universality for fixed-degree random regular graphs
220Directional zero–one laws and ballisticity in random environments3 papers

Probability and statistical mechanics

Original repository description

On Zd\mathbb Z^d, d≥3d\ge3, 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≥2d\ge2, almost-sure directional transience implies a deterministic limiting velocity with positive projection in that direction, resolving the ballisticity conjecture.

Read the manuscripts

  1. A directional zero–one law for finite-range-dependent random environments
  2. Strict-ellipticity zero–one law
  3. Directional transience implies ballisticitySource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

221The Mézard–Parisi formula for diluted spin glasses1 paperIn the film

Probability and statistical mechanics

Original repository description

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-KK satisfiability.

Read the manuscripts

  1. The Mézard–Parisi formula for diluted spin glasses
222Perceptron free energies and microscopic jamming4 papersIn the film

Probability and statistical mechanics

Original repository description

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-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.

Read the manuscripts

  1. Ising perceptron free energy
  2. Negative spherical perceptron jamming
  3. Bi-orthogonally invariant disorder
  4. Spherical perceptron free energy
223Conformal limits of square-lattice random-cluster interfaces6 papers

Probability and statistical mechanics

Original repository description

Proves chordal SLEκ\mathrm{SLE}_\kappa limits for critical square-lattice random-cluster interfaces for 0<q≤40<q\le4, with κ=4π/arccos⁡(−q/2)\kappa=4\pi/\arccos(-\sqrt q/2): bounded Jordan domains are allowed for q≥1q\ge1, and smooth Jordan domains for q<1q<1, under the stated marked-boundary approximations. For 1≤q≤41\le q\le4, complete nested plane loops converge to CLEκ\mathrm{CLE}_\kappa.

Read the manuscripts

  1. FK interfaces and nested loops (1≤ q<4)
  2. Self-dual interfaces (q<1)
  3. Quenched SLE Universality for Weakly Disordered FK–Ising Interfaces
  4. Thermal FK–Ising interfaces and massive SLE
  5. Natural Occupation Measures for Critical Square-Lattice FK Interfaces
  6. Conformal Limits of Critical Square-Lattice Random-Cluster Interfaces
224Critical and near-critical universality for Voronoi percolation3 papers

Probability and statistical mechanics

Original repository description

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.

Read the manuscripts

  1. From critical crossings to quenched near-critical universality in Voronoi percolation
  2. A Pivotal Amplitude for Voronoi Percolation from Cardy's Formula
  3. Cardy’s formula for critical Poisson–Voronoi percolation
225Gaussian free field limits for the balanced six-vertex model1 paper

Probability and statistical mechanics

Original repository description

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

Read the manuscripts

  1. The Gaussian free field limit of the balanced six-vertex model with variance multiplier 1/arcsin(c/2)
226The double-dimer CLE4\mathrm{CLE}_4 conjecture in the half-plane1 paper

Probability and statistical mechanics

Original repository description

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\mathrm{CLE}_4. Convergence matches every macroscopic loop as an unparametrized curve, upgrading convergence of loop observables to convergence of the loops themselves.

Read the manuscripts

  1. The curve scaling limit of half-plane double dimers
227The dynamical phase transition in the Sherrington–Kirkpatrick model8 papers

Probability and statistical mechanics

Original repository description

For zero-field Gaussian SK heat-bath dynamics with rate-one updates per spin, proves worst-start cutoff on the log⁡n\log n scale for fixed 0≤β<10\le\beta<1, mixing time n2/3+o(1)n^{2/3+o(1)} at β=1\beta=1, and stretched-exponential mixing from a Gibbs-sampled fixed starting configuration for β>1\beta>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.

Read the manuscripts

  1. Universality of critical quench autocorrelations in the Sherrington–Kirkpatrick model
  2. Functional universality of critical SK autocorrelations
  3. High-temperature spectral gap
  4. High-temperature cutoff
  5. Critical slowing downSource listed in formalization catalogue
  6. Typical-start stretched-exponential barriers
  7. Low-temperature typical-start upper bound
  8. Critical mixing

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

228Continuum phase transitions for radial pair potentials2 papers

Probability and statistical mechanics

Original repository description

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.

Read the manuscripts

  1. Temperature singularitySource listed in formalization catalogue
  2. Algebraic-decay phase transitionSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

229Sharp three- and four-state reconstruction thresholds3 papers

Probability and statistical mechanics

Original repository description

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

Read the manuscripts

  1. The Reconstruction Threshold for the Ferromagnetic Four-State Potts Model
  2. A Capacity Criterion for Four-State Potts Reconstruction on Trees
  3. The exact reconstruction threshold for the three-state symmetric channel
230Exact Hausdorff measure for SLE2 papers

Probability and statistical mechanics

Original repository description

Resolves Schramm’s Hausdorff-measure question for chordal SLEκ\mathrm{SLE}_\kappa, 0<κ<80<\kappa<8. The explicit gauge rd(log⁡log⁡(1/r))(2−d)/2r^d(\log\log(1/r))^{(2-d)/2}, d=1+κ/8d=1+\kappa/8, gives almost surely positive finite measure to every trace segment γ([s,t])\gamma([s,t]) with 0<s<t<∞0<s<t<\infty, and finite expected measure to the trace in every bounded disk.

Read the manuscripts

  1. Exact Hausdorff gauge
  2. Explicit exact Hausdorff gauge
231The free uniform spanning forest is a factor of IID1 paper

Probability and statistical mechanics

Original repository description

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.

Read the manuscripts

  1. The free uniform spanning forest is a factor of IID
232Gaussian fields and SLE interfaces for Lipschitz heights3 papers

Probability and statistical mechanics

Original repository description

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

Read the manuscripts

  1. Weighted integer heights
  2. Integer heights with two-arc boundary
  3. Uniform real Lipschitz surfaces
233The joint critical Ashkin–Teller scaling limit1 paper

Probability and statistical mechanics

Original repository description

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.

Read the manuscripts

  1. The joint scaling limit of critical Ashkin-Teller currents
234All-temperature pressure for orthogonally invariant Ising spin glasses1 paper

Probability and statistical mechanics

Original repository description

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.

Read the manuscripts

  1. All-temperature pressure for orthogonally invariant Ising spin glasses
235Random-SAT thresholds, sharp variance and computability4 papersIn the film

Probability and statistical mechanics

Original repository description

For random kk-SAT with independent uniformly signed proper clauses sampled with replacement, proves finite positive limiting thresholds and hitting-time variance Θk(n)\Theta_k(n) for every fixed k≥3k\ge3, 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.

Read the manuscripts

  1. Fixed-clause-size limiting threshold
  2. Linear Variance of the Random 3-SAT Hitting Time
  3. Random k-SAT hitting-time variance
  4. Computing the random 3-SAT threshold
236The factor-of-IID threshold for free Ising states on trees1 paper

Probability and statistical mechanics

Original repository description

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

Read the manuscripts

  1. The sharp factor-of-IID threshold for the free Ising model on regular treesSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

237The three-quarter diameter exponent for honeycomb walks13 papers

Probability and statistical mechanics

Original repository description

Proves the diameter form of Nienhuis's predicted three-quarter exponent: a uniformly chosen nn-step self-avoiding walk on the honeycomb lattice has diameter n3/4+o(1)n^{3/4+o(1)}. Its local mass and covering numbers have exponent 4/34/3. These estimates hold at every sufficiently large fixed length, simultaneously across scales, with arbitrarily high polynomial probability.

Read the manuscripts

  1. Radial transfer and polygon length laws
  2. Chords with prescribed boundary endpoints
  3. Cylinder loop weights and planar nesting
  4. Mass and covering exponents for fixed-length walks
  5. Signed cylinder propagation
  6. Logarithmic bridge-length windows
  7. Marked polygons and one-arc bounds
  8. Disk transfer and confined bridge mass
  9. Polynomial vacuum representations
  10. Renewal and changes of law
  11. Critical strip-crossing mass
  12. Finite bridge moments
  13. Cap-selected amplitudes and triangle chords
238Optimal logarithmic mixing of the Thorp shuffle12 papers

Probability and statistical mechanics

Original repository description

Proves that the Thorp shuffle randomizes N=2dN=2^d labeled cards in Θ(log⁡N)\Theta(\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.

Read the manuscripts

  1. Optimal-order mixing of the Thorp shuffle
  2. Random coordinate frames
  3. Partial-information Fourier bounds
  4. Deterministic-sweep information
  5. Permutations with revealed switching
  6. Routing and representation contractionSource listed in formalization catalogue
  7. Row–column symmetry and sweep contraction
  8. Random-subspace tests and trace smoothing
  9. Compatibility entropy and spectrumSource listed in formalization catalogue
  10. Signed tensor densities and diagram budgets
  11. Conditional sweeps and analytic transferSource listed in formalization catalogue
  12. Strict four-row permanent inequality

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

239Sharp singularity rates for symmetric sign matrices2 papers

Probability and statistical mechanics

Original repository description

Determines the sharp exponential singularity rate of symmetric random sign matrices with independent entries on and above the diagonal. Uniform signs give Pr⁡(det⁡An=0)=(1/2+o(1))n\Pr(\det A_n=0)=(1/2+o(1))^n; for fixed bias p∈(0,1)∖{1/2}p\in(0,1)\setminus\{1/2\}, the rate is (p2+(1−p)2+o(1))n(p^2+(1-p)^2+o(1))^n. In the biased case, agreeing rows attain this rate.

Read the manuscripts

  1. The sharp exponential rate of singularity for symmetric Bernoulli matrices
  2. The sharp singularity rate for biased symmetric sign matrices
240Shelah's eventual categoricity conjecture2 papersIn the film

Mathematical logic

Original repository description

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.

Read the manuscripts

  1. CH threshold obstructionSource listed in formalization catalogue
  2. Eventual categoricity

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

241Rigidity of the Turing degrees1 paperIn the film

Mathematical logic

Original repository description

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.

Read the manuscripts

  1. Rigidity of the Turing degreesSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

242Single-fold Diophantine representations1 paperIn the film

Mathematical logic

Original repository description

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.

Read the manuscripts

  1. Single-fold Diophantine representationsSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

243Choiceless counting does not capture polynomial time2 papers

Mathematical logic

Original repository description

Confirms the Blass–Gurevich–Shelah noncapture conjecture: consistency of a linear system over F3\mathbb F_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.

Read the manuscripts

  1. Failure to capture polynomial timeSource listed in formalization catalogue
  2. Witnessed symmetric choice

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

244The partition principle does not imply choice1 paperIn the film

Mathematical logic

Original repository description

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.

Read the manuscripts

  1. The Partition Principle does not imply ChoiceSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

245The β\beta-Barendregt–Geuvers–Klop conjecture1 paper

Mathematical logic

Original repository description

Proves that weak normalization implies strong normalization for every pure type system: if every legal expression in every valid context has a β\beta-normal form, every β\beta-reduction sequence terminates. This resolves the β\beta-Barendregt–Geuvers–Klop conjecture, including nonfunctional rules and open contexts.

Read the manuscripts

  1. Weak and strong normalization in pure type systems
246Cannon's conjecture1 paperIn the film

Group theory

Original repository description

Every word-hyperbolic group with boundary homeomorphic to S2S^2 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.

Read the manuscripts

  1. A Modulus Proof of Cannon’s Conjecture
247An infinite finitely presented residually finite 22-group2 papersIn the film

Group theory

Original repository description

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

Read the manuscripts

  1. An infinite finitely presented residually finite 2-group
  2. An infinite finitely presented periodic group
248Thompson's group FF is nonamenable1 paperIn the film

Group theory

Original repository description

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

Read the manuscripts

  1. Thompson's group F is nonamenableSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

249A finitely generated counterexample to Eilenberg–Ganea1 paper

Group theory

Original repository description

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.

Read the manuscripts

  1. A finitely generated counterexample to the Eilenberg–Ganea conjecture
250The Boone–Higman conjecture and higher finiteness3 papers

Group theory

Original repository description

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∞F_\infty: a classifying space with finitely many cells in each dimension. A single group of type F∞F_\infty can also contain every finitely presented group.

Read the manuscripts

  1. Finite algebraic envelopes
  2. Simple F_∞ overgroups
  3. Universal F_∞ groupSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

251Amenability, unitarizability, and Ulam stability2 papers

Group theory

Original repository description

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.

Read the manuscripts

  1. Unitarizability implies amenability for discrete groupsSource listed in formalization catalogue
  2. Strong Ulam Stability Characterizes Amenability

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

252A non-residually-finite torsion-free hyperbolic group1 paper

Group theory

Original repository description

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.

Read the manuscripts

  1. A torsion-free hyperbolic group that is not residually finiteSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

253An infinite finitely presented simple amenable group1 paper

Group theory

Original repository description

Constructs an infinite finitely presented simple amenable group, answering the longstanding question of whether these properties can occur simultaneously.

Read the manuscripts

  1. An infinite finitely presented simple amenable groupSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

254Classifying spaces and geometric obstructions for Artin groups3 papers

Group theory

Original repository description

The Salvetti complex of every finite-rank Artin group is aspherical, proving the Artin K(π,1)K(\pi,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)(0) space.

Read the manuscripts

  1. Artin K(π,1)Source listed in formalization catalogue
  2. No geometric CAT(0) actionSource listed in formalization catalogue
  3. Parabolic intersections

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

255Quasi-isometric rigidity of virtually polycyclic groups1 paper

Group theory

Original repository description

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.

Read the manuscripts

  1. Quasi-isometric recognition of virtually polycyclic groups
256Howie's conjecture on equations over groups2 papers

Group theory

Original repository description

Proves that every finite system of equations over an arbitrary group whose exponent-sum matrix has full row rank over Q\mathbb Q 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.

Read the manuscripts

  1. Nonsingular systems of equations over arbitrary groups
  2. The Kervaire theorem for groups
257A hyperbolic group with no geometric CAT(0) action1 paper

Group theory

Original repository description

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)\operatorname{CAT}(0) space, in any dimension.

Read the manuscripts

  1. A hyperbolic group with no geometric CAT(0) actionSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

258Gersten's conjecture for one-relator groups2 papers

Group theory

Original repository description

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

Read the manuscripts

  1. Baumslag–Solitar-free one-relator groups
  2. Virtual compact specialness
259A group without fixed price1 paper

Group theory

Original repository description

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.

Read the manuscripts

  1. A group without fixed price
260Spacetime Penrose inequalities and rigidity13 papersIn the film

Mathematical physics

Original repository description

Proves the sharp enclosing-area spacetime Penrose inequality for smooth one-ended asymptotically flat initial data in every spatial dimension n≥3n\ge3, 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.

Read the manuscripts

  1. Three-dimensional charged inequality
  2. Higher-dimensional charged reduction
  3. Enclosing area, charge, and rigidity
  4. Kerr–Newman inequality
  5. Electromagnetic tails
  6. Nonmaximal anti-de Sitter inequality
  7. Maximal asymptotically hyperbolic inequality
  8. Local Schwarzschild–anti-de Sitter inequality
  9. Numerical spacetime
  10. Riemannian endpoint
  11. Equality and rigidity
  12. Boundary graphs
  13. Bondi-CKS
261Localization and delocalization in the Anderson model2 papers

Mathematical physics

Original repository description

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≥3d\ge3, sufficiently weak positive disorder gives purely absolutely continuous spectrum on a fixed open interval with nonzero spectral weight.

Read the manuscripts

  1. Absolutely continuous spectrum
  2. Pure-point spectrum
262Sharp one-dimensional Lieb–Thirring inequalities3 papers

Mathematical physics

Original repository description

Proves the sharp one-dimensional Lieb–Thirring inequality for 1/2<γ<3/21/2<\gamma<3/2 and arbitrary finite-matrix potentials W≥0W\ge0 with ∫tr⁡(Wγ+1/2)<∞\int\operatorname{tr}(W^{\gamma+1/2})<\infty: 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 sech⁡2\operatorname{sech}^2 solitons with independent scales and centers, and zero channels.

Read the manuscripts

  1. Equality cases in the sharp one-dimensional matrix Lieb–Thirring inequality
  2. Sharp one-dimensional Lieb–Thirring inequalities for matrix potentials
  3. Sharp one-dimensional Lieb–Thirring constantsSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

263The ionization and generalized ionization conjectures3 papers

Mathematical physics

Original repository description

For the full nonrelativistic Coulomb model with two electron spin states, proves that a molecule with MM fixed nuclei of charges at least one and total charge ZZ strictly binds at most Z+CMZ+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 mm electrons has Thomas–Fermi asymptotics as m→∞m\to\infty and Z/m→∞Z/m\to\infty; neutral-atom outer radii have the corresponding iterated-limit asymptotics, taking Z→∞Z\to\infty first.

Read the manuscripts

  1. Uniform excess charge and outer radius
  2. Generalized ionization energiesSource listed in formalization catalogue
  3. Generalized outer-electron radii

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

264Strong cosmic censorship near two-ended Kerr data3 papersIn the film

Mathematical physics

Original repository description

Proves local strong cosmic censorship near each fixed rotating subextremal Kerr bridge. A dense GδG_\delta 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.

Read the manuscripts

  1. Future inextendibility, L^2 connection
  2. C^1 future inextendibility
  3. C^2 future inextendibility
265The two-dimensional gapped area law2 papersIn the film

Mathematical physics

Original repository description

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×LL\times 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−1L^{-1}.

Read the manuscripts

  1. Two-dimensional area law
  2. Polynomial PEPS approximation
266Exactly three mutually unbiased bases in dimension six2 papers

Mathematical physics

Original repository description

Proves N(6)=3N(6)=3, resolving Zauner's dimension-six mutually unbiased bases conjecture: three such bases exist in C6\mathbb C^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.

Read the manuscripts

  1. Maximum number of bases
  2. Exact Fourier certificates
267Positive-temperature Bose–Einstein condensation and quantum depletion5 papersIn the film

Mathematical physics

Original repository description

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.

Read the manuscripts

  1. Bose–Einstein condensation at positive temperature in the dilute hard-sphere gas
  2. Quantum Depletion and Momentum Distribution in the Dilute Hard-Sphere Bose Gas
  3. Quantum Depletion for Fixed Bounded Repulsive Potentials
  4. A density-uniform condensate bound for dilute Bose gases
  5. Ground-state condensation in the dilute hard-sphere gas
268The spin-one Haldane gap2 papersIn the film

Mathematical physics

Original repository description

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/5h=3/5 and gives boundary-selected infinite-volume states with topological index −1-1.

Read the manuscripts

  1. Periodic Haldane gap
  2. Boundary-field gap
269The Laughlin gap and stability under scalar disorder2 papersIn the film

Mathematical physics

Original repository description

Proves the fermionic Laughlin spectral-gap conjecture for the full V1V_1 interaction at filling 1/31/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.

Read the manuscripts

  1. Uniform Stability of the Spherical Laughlin Gap
  2. A Fock-space inequality and the Laughlin spectral gapSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

270Threshold and positive-energy bound states of the BFSS model2 papers

Mathematical physics

Original repository description

Proves that the undeformed relative SU(N)\mathrm{SU}(N) BFSS model has exactly one normalizable zero-energy state for every finite N≥2N\ge2, resolving the threshold-bound-state conjecture. For SU(2)\mathrm{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=2N=2.

Read the manuscripts

  1. The unique threshold bound state of the SU(N) BFSS model
  2. Positive eigenvalues of the relative SU(2) BFSS Hamiltonian
271Bloch's law and spontaneous ferromagnetic order4 papersIn the film

Mathematical physics

Original repository description

Proves Bloch's T3/2T^{3/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 Z3\mathbb Z^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≥3d\ge3 and determines the first lattice correction for three-dimensional nearest-neighbor couplings.

Read the manuscripts

  1. Bloch's Law for Finite-Range Heisenberg Ferromagnets in Three Dimensions
  2. The first lattice correction to Bloch's law
  3. The spherical magnetization law for the three-dimensional quantum Heisenberg ferromagnet
  4. Spontaneous magnetization in the quantum Heisenberg ferromagnet
272Entanglement without secret key and the PPT-square conjecture1 paper

Mathematical physics

Original repository description

Constructs an entangled state on C10⊗C10\mathbb C^{10}\otimes\mathbb C^{10} 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 M21(C)M_{21}(\mathbb C) whose square is not entanglement breaking disproves Christandl's PPT-square conjecture.

Read the manuscripts

  1. Entanglement with zero distillable secret key in local dimension ten
273The entropy photon-number inequality1 paper

Mathematical physics

Original repository description

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.

Read the manuscripts

  1. The entropy photon-number inequality
274Moore's parity conjecture for QAC0\mathrm{QAC}^02 papers

Mathematical physics

Original repository description

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.

Read the manuscripts

  1. Product-projection localizationSource listed in formalization catalogue
  2. Regular trajectories and pruningSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

275QMA-hardness of continuum Coulomb energy2 papers

Mathematical physics

Original repository description

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.

Read the manuscripts

  1. Binary nuclear charges
  2. Unit nuclear charges
276The classical capacity of generalized amplitude damping1 paper

Mathematical physics

Original repository description

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.

Read the manuscripts

  1. Classical capacity and entropy inequalities for generalized amplitude dampingSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

277Threshold repetition for entangled games1 paper

Mathematical physics

Original repository description

Proves exponential threshold repetition for every finite two-player one-round game: if its entangled value is v<1v<1, the probability of winning at least a fraction v+δv+\delta of kk independent repetitions decays exponentially in kk, for 0<δ<1−v0<\delta<1-v. Arbitrary joint finite-dimensional entangled strategies and correlated question distributions are allowed.

Read the manuscripts

  1. Threshold parallel repetition for finite-dimensional entangled gamesSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

278Failure of Kohn–Sham ensemble representation1 paper

Mathematical physics

Original repository description

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

Read the manuscripts

  1. A Coulomb ground-state density without Kohn-Sham ensemble representation
279Exact quantum factoring over a fixed finite gate set1 paper

Mathematical physics

Original repository description

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.

Read the manuscripts

  1. Exact quantum factoring over a fixed finite gate set
280Strong locality for strongly rational unitary vertex operator algebras1 paper

Mathematical physics

Original repository description

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.

Read the manuscripts

  1. Strongly rational unitary vertex operator algebras and conformal nets
281QAOA optimality for the SK model2 papers

Mathematical physics

Original repository description

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.

Read the manuscripts

  1. QAOA attains the SK ground-state energy in the thermodynamic-first limit
  2. Full support of the zero-temperature Sherrington-Kirkpatrick order parameter
282Scale-to-conformal enhancement in four-dimensional QFT1 paper

Mathematical physics

Original repository description

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.

Read the manuscripts

  1. Scale and conformal symmetry in four-dimensional operational quantum field theory
283Polynomial-time, constant-error unitary synthesis from a Boolean oracle1 paper

Mathematical physics

Original repository description

Solves the constant-error Aaronson–Kuperberg unitary synthesis problem: a uniform polynomial-size quantum oracle circuit approximates every nn-qubit unitary channel within diamond-norm error 1/21/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.

Read the manuscripts

  1. Polynomial-Time Unitary Synthesis from a Boolean Oracle
284The optimal randomized–quantum query exponent1 paper

Mathematical physics

Original repository description

Shows that the universal bound R(f)=O((1+Q(f))4)R(f)=O((1+Q(f))^4) for total Boolean functions is sharp in its exponent, ruling out every smaller power and disproving the conjectured cubic relation. Here RR and QQ are randomized and quantum worst-case bit-query complexities with error at most 1/31/3; computation between queries is unrestricted.

Read the manuscripts

  1. A Nearly Quartic Separation Between Randomized and Quantum Query Complexity
285Counterexamples to Baum–Connes and Kadison–Kaplansky3 papers

Operator algebras

Original repository description

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∗C^*-algebra, disproving the Kadison–Kaplansky conjecture.

Read the manuscripts

  1. Baum–Connes injectivity
  2. Kadison–Kaplansky counterexample
  3. Irrational-trace Baum–Connes counterexample
286Arithmetic rigidity of lattice von Neumann algebras2 papers

Operator algebras

Original repository description

Classifies finite-index bimodules between scalar-twisted group factors of ICC groups commensurable with property-(T)(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.

Read the manuscripts

  1. Twisted finite correspondences
  2. Arithmetic category and stable recovery
287All nonabelian free group factors are isomorphic1 paperIn the film

Operator algebras

Original repository description

Resolves the free group factor isomorphism problem: L(F2)≅L(F3)L(\mathbb F_2)\cong L(\mathbb F_3), and hence all interpolated free group factors, including L(F∞)L(\mathbb F_\infty), are isomorphic. Their common factor has fundamental group R>0\mathbb R_{>0}.

Read the manuscripts

  1. An isomorphism of the free group factors
288Kadison's similarity conjecture1 paperIn the film

Operator algebras

Original repository description

Proves Kadison's similarity conjecture: every bounded complex-linear unital algebra homomorphism from a unital complex C∗C^*-algebra to operators on a Hilbert space becomes a ∗*-homomorphism after conjugation by a bounded invertible operator.

Read the manuscripts

  1. Kadison's similarity theorem through uniform derivation estimates
289The strong Kadison–Kastler conjecture3 papers

Operator algebras

Original repository description

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∗C^*-algebras need not be ambiently unitarily conjugate.

Read the manuscripts

  1. Universal strong Kadison–Kastler stability
  2. Near Inclusions of von Neumann Algebras Without Small Spatial Embeddings
  3. Close Separable C^*-Algebras Without Spatial Conjugacy
290Connes' bicentralizer conjecture and relative bicentralizers2 papers

Operator algebras

Original repository description

Proves Connes' bicentralizer conjecture for every type III1\mathrm{III}_1 factor with separable predual and every faithful normal state. More generally, for every inclusion N⊂MN\subset M of von Neumann algebras with separable preduals admitting a faithful normal conditional expectation, constructs an amenable expected subalgebra P⊂NP\subset N with P′∩c(M)=N′∩c(M)P'\cap c(M)=N'\cap c(M), resolving the relative bicentralizer conjecture.

Read the manuscripts

  1. Core-commutant preservation
  2. Modular spectral averagesSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

291Toms–Winter and equivariant Jiang–Su stability4 papers

Operator algebras

Original repository description

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∗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.

Read the manuscripts

  1. Equivariant Jiang–Su Stability for Amenable Actions in the Unital Stably Finite Case
  2. Cuntz comparison and absorption
  3. Nuclear dimension and Jiang–Su stability
  4. Uniform property ΓSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

292A counterexample to Kirchberg's norm-ultrapower embedding problem1 paper

Operator algebras

Original repository description

Constructs an explicit separable unital full group C∗C^*-algebra that cannot embed unitally into the norm ultrapower of any fixed nonzero unital nuclear C∗C^*-algebra, for any free ultrafilter on the natural numbers. Taking the target to be O2\mathcal O_2 answers Kirchberg's norm-ultrapower embedding problem negatively.

Read the manuscripts

  1. An explicit obstruction to nuclear norm-ultrapower embeddings
293A counterexample to the hyperinvariant-subspace problem2 papersIn the film

Operator algebras

Original repository description

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\mathrm{II}_1 factor.

Read the manuscripts

  1. Invariant-projection counterexamples for every irrational rotation
  2. Backward intertwiners and a transitive commutantSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

294A counterexample to Kaplansky's quasitrace conjecture1 paper

Operator algebras

Original repository description

Disproves Kaplansky's quasitrace conjecture by constructing a separable unital complex C∗C^*-algebra admitting normalized 22-quasitraces, all of which are nonadditive. As a consequence, two unital simple stably finite C∗C^*-algebras can have a properly infinite minimal tensor product, with one factor Cr∗(F2)C_r^*(\mathbb F_2).

Read the manuscripts

  1. A counterexample to Kaplansky's quasitrace conjecture and failure of tensor-product stable finitenessSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

295The Kadison–Ringrose cohomology conjecture1 paper

Operator algebras

Original repository description

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.

Read the manuscripts

  1. Vanishing of higher bounded Hochschild cohomology
296The generator problem for finite factors1 paperIn the film

Operator algebras

Original repository description

Proves that every type II1\mathrm{II}_1 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⊂MP\subset M of such factors, the unitaries uu with M=W∗(P,u)M=W^*(P,u) form a dense GδG_\delta subset in the trace 22-norm topology.

Read the manuscripts

  1. Relative generation and the generator problem for finite factorsSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

297A ZFC counterexample to Naimark's problem1 paper

Operator algebras

Original repository description

Gives an alternative to Tanaka's ZFC construction of a unital infinite-dimensional simple complex C∗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.

Read the manuscripts

  1. A counterexample to Naimark's problem in ZFC
298A counterexample to Voiculescu’s free-entropy equality conjecture1 paper

Operator algebras

Original repository description

Constructs a bounded self-adjoint tuple in a tracial von Neumann algebra whose microstates and nonmicrostates free entropies satisfy −∞<χ<χ∗<∞-\infty<\chi<\chi^*<\infty. This answers Voiculescu’s finite-entropy equality question negatively: the matrix-approximation and free-Fisher-information definitions differ even when both are finite.

Read the manuscripts

  1. A finite-entropy separation of microstates and nonmicrostates free entropy
299The Kirchberg–Rørdam character criterion1 paper

Operator algebras

Original repository description

A nonzero unital separable complex C∗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.

Read the manuscripts

  1. The Kirchberg–Rørdam character criterionSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

300The Popa–Vaes quadratic strong-operator paving conjecture2 papers

Operator algebras

Original repository description

Proves that every self-adjoint element of a complex von Neumann algebra admits strong-operator paving relative to any maximal abelian subalgebra with O(ε−2)O(\varepsilon^{-2}) 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.

Read the manuscripts

  1. Approximation paving
  2. Quadratic strong-operator paving
301Classification by trace cones after Razak–Jacelon stabilization1 paper

Operator algebras

Original repository description

Classifies separable nuclear complex C∗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.

Read the manuscripts

  1. The trace cone classifies Razak–Jacelon stabilizations
302The Phillips–Toms formula for minimal integer actions2 papers

Operator algebras

Original repository description

For every minimal homeomorphism hh of an infinite compact metrizable space XX, the radius of comparison of C(X)⋊hZC(X)\rtimes_h\mathbb Z equals 12mdim(X,h)\tfrac12\mathrm{mdim}(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.

Read the manuscripts

  1. Boundary-preserving cobordism compression
  2. Radius =1/2 mean dimension
303From ordinary to strong pure infiniteness1 paper

Operator algebras

Original repository description

Resolves the ordinary-to-strong pure-infiniteness question of Kirchberg and Rørdam for complex C∗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 O∞\mathcal O_\infty, without unitality or simplicity assumptions.

Read the manuscripts

  1. Weak pure infiniteness and O-infinity absorption
304The Hilbert–Smith conjecture in every dimension1 paperIn the film

Topology

Original repository description

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.

Read the manuscripts

  1. The Hilbert–Smith conjecture in every finite dimension
305Counterexamples to disk embedding and Wall's manifold conjecture3 papers

Topology

Original repository description

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 F2F_2 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.

Read the manuscripts

  1. Boundary-only obstruction
  2. Marked tensor obstruction
  3. PD4 group without aspherical manifold model
306The purely cosmetic surgery conjecture for knots in S3S^31 paperIn the film

Topology

Original repository description

Distinct Dehn surgery slopes on a nontrivial smooth knot in S3S^3 never produce orientation-preservingly homeomorphic manifolds, proving the purely cosmetic surgery conjecture. The statement includes the meridional slope.

Read the manuscripts

  1. Purely cosmetic surgery on knots in the three-sphere
307Failure of rational injectivity for maximal coarse assembly2 papers

Topology

Original repository description

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.

Read the manuscripts

  1. Failure of rational injectivity for maximal coarse assembly
  2. A counterexample to the coarse Novikov conjecture
308Smith–Toda complexes at every height with varying primes2 papers

Topology

Original repository description

For every n≥0n\ge0, constructs a finite Smith–Toda spectrum at a prime pp depending on nn, with Brown–Peterson homology BP∗/(p,v1,…,vn)BP_*/(p,v_1,\ldots,v_n) and the canonical comodule structure. Thus Smith–Toda complexes exist at every height when the prime may vary; an explicit example realizes V(4)V(4) at p=1009p=1009.

Read the manuscripts

  1. Varying primes
  2. V(4) at prime 1009
309The Kervaire invariant problem at the prime three1 paper

Topology

Original repository description

Resolves the odd-primary Kervaire invariant problem at the prime three: exactly the standard classes with indices 00, 22, and 33 survive in the mod-three Adams spectral sequence, in stems 1010, 106106, and 322322. Each surviving detection coset contains an element of exact additive order three.

Read the manuscripts

  1. The Kervaire invariant problem at the prime three
310Quillen's conjecture in rational homology1 paper

Topology

Original repository description

Proves the rational-homology form of Quillen's conjecture for every finite group and every prime. If the largest normal pp-subgroup of GG is trivial, the poset of nontrivial elementary abelian pp-subgroups has nonzero augmented reduced rational homology and is therefore not contractible.

Read the manuscripts

  1. Rational homology and Quillen's conjecture
311Chai's invariant-ideal conjecture1 paper

Topology

Original repository description

Proves Chai's invariant-ideal conjecture for Lubin–Tate deformation rings over finite residue fields, at every prime and positive height nn. Through the implication of Barthel–Heard–Naumann, this proves the Hovey–Strickland conjecture: dualizable K(n)K(n)-local spectra have exactly n+2n+2 thick tensor ideals, and their Balmer spectrum is a chain of n+1n+1 points.

Read the manuscripts

  1. Stabilizer orbits and thick tensor ideals of dualizable K(n)-local spectra
312The Grothendieck homotopy hypothesis1 paperIn the film

Topology

Original repository description

Proves the Grothendieck homotopy hypothesis for ∞\infty-groupoids associated with every Grothendieck coherator in the Ara–Henry convention: these algebraic objects recover the homotopy theory of spaces.

Read the manuscripts

  1. The Grothendieck homotopy hypothesis via elementary expansionsSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

313Finite generation for the K(n)K(n)-local sphere1 paper

Topology

Original repository description

Answers the degreewise finiteness question of Hovey and Hovey–Strickland: every homotopy group of the K(n)K(n)-local sphere is a finitely generated Zp\mathbb Z_p-module, for every prime, positive height and integer degree. The same conclusion holds after K(n)K(n)-localizing any finite pp-local spectrum.

Read the manuscripts

  1. Finite generation for the K(n)-local sphere
314The chromatic Smith fixed-point problem for finite pp-groups1 paper

Topology

Original repository description

Determines the optimal chromatic loss from geometric HH-fixed points to geometric GG-fixed points for every subgroup HH of a finite pp-group GG. At every nonnegative height, the loss equals the shortest subnormal-chain length from HH to GG with cyclic quotients. Each quotient counts once regardless of order, and finite spectra witness sharpness.

Read the manuscripts

  1. Cyclic length and chromatic fixed-point loss
315The four-dimensional Singer conjecture1 paper

Topology

Original repository description

Proves that the L2L^2-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.

Read the manuscripts

  1. The Singer conjecture in dimension four
316Curtis’s conjecture1 paper

Topology

Original repository description

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 η,ν,σ\eta,\nu,\sigma and the Kervaire-invariant-one classes that exist.

Read the manuscripts

  1. The Stable Hurewicz Image of the Sphere at Two
317Thomason model structures in every strict higher dimension1 paper

Topology

Original repository description

Resolves the Ara–Maltsiniotis conjecture: for every n≥1n\ge1 and n=ωn=\omega, small strict globular nn-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.

Read the manuscripts

  1. Thomason Model Structures in Every Strict Higher Dimension
318Chromatic splitting: counterexamples and filtrations5 papers

Topology

Original repository description

Disproves strong chromatic splitting at height three for primes p≥5p\ge5, and weak splitting for the derived pp-completed sphere at heights pp (p≥5p\ge5) and p+1p+1 (p≥7p\ge7). Nevertheless, for n≥1n\ge1 and p>n+1p>n+1, the overlap Ln−1LK(n)Sp∧L_{n-1}L_{K(n)}S_p^\wedge admits a 2n2^n-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)E(2)-local modules over the derived completed sphere.

Read the manuscripts

  1. Filtered splitting at generic primes
  2. Height-three filtration and attachments
  3. Rational obstruction to strong splitting
  4. Finite-assembly failure at prime three
  5. Weak chromatic splitting counterexamples
319Counterexamples to the Hahn–Wilson conjecture at height two1 paper

Topology

Original repository description

Refutes the Hahn–Wilson conjecture at chromatic height two. For every sufficiently large prime pp, constructs a connective pp-complete spectrum of exact fp-type two that cannot be built from completed BP⟨2⟩\mathrm{BP}\langle2\rangle by finitely many sums, shifts, cones and retracts. The examples nevertheless satisfy the finite and telescopic localization comparisons.

Read the manuscripts

  1. Counterexamples to the Hahn-Wilson conjecture at height two
320A four-dimensional counterexample to Borel rigidity1 paperIn the film

Topology

Original repository description

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.

Read the manuscripts

  1. Nonhomeomorphic closed aspherical four-manifolds with the same homotopy type
321A counterexample to Wall's finite D(2) conjecture1 paper

Topology

Original repository description

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.

Read the manuscripts

  1. A Counterexample to Wall's D(2) Problem
322Tingley's sphere-isometry problem1 paperIn the film

Functional analysis

Original repository description

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.

Read the manuscripts

  1. A positive solution to Tingley’s problemSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

323Relative independence of the separable quotient problem1 paper

Functional analysis

Original repository description

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.

Read the manuscripts

  1. Relative independence of the separable quotient problem
324Lipschitz equivalence without linear isomorphism2 papers

Functional analysis

Original repository description

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.

Read the manuscripts

  1. Lipschitz equivalence without linear isomorphismSource listed in formalization catalogue
  2. Bi-Lipschitz c_0 absorptionSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

325The complete Crouzeix conjecture2 papersIn the film

Functional analysis

Original repository description

Resolves the complete Crouzeix conjecture: for every bounded operator AA on a complex Hilbert space and every finite matrix-valued polynomial PP, one has ∥P[A]∥≤2sup⁡z∈W(A)∥P(z)∥\lVert P[A]\rVert\le2\sup_{z\in W(A)}\lVert P(z)\rVert, where W(A)W(A) is the numerical range. The constant 22 is sharp, independent of the matrix size, and valid in infinite dimensions.

Read the manuscripts

  1. Direct proofSource listed in formalization catalogue
  2. Structural proofSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

326The cotype–cotype conjecture under the approximation property1 paper

Functional analysis

Original repository description

Resolves the cotype–cotype conjecture for real Banach spaces with the approximation property. Such a nonzero space is KK-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.

Read the manuscripts

  1. The cotype–cotype conjecture under the approximation propertySource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

327Markov type characterizes superreflexivity1 paper

Functional analysis

Original repository description

Proves that every real Banach space with Markov type pp for some p>1p>1 admits an equivalent uniformly convex norm, answering Naor's renorming question. Together with the known converse, this characterizes superreflexivity by nontrivial Markov type.

Read the manuscripts

  1. Nontrivial Markov Type Forces SuperreflexivitySource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

328Fixed points of nonexpansive maps in reflexive Banach spaces1 paperIn the film

Functional analysis

Original repository description

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.

Read the manuscripts

  1. Fixed Points of Nonexpansive Maps in Reflexive Banach SpacesSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

329A counterexample to Pietsch's metric-entropy duality conjecture1 paper

Functional analysis

Original repository description

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.

Read the manuscripts

  1. Counterexamples to the duality conjecture for metric entropySource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

330A negative answer to Kalton's Lipschitz-free approximation question1 paper

Functional analysis

Original repository description

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.

Read the manuscripts

  1. A uniformly discrete counterexample to bounded approximation in Lipschitz-free spaces
331Asymptotic midpoint uniform convexity without asymptotically uniformly convex renorming7 papers

Functional analysis

Original repository description

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-kk countably branching diamonds require distortion at least 1+k/12\sqrt{1+k/12}, so midpoint uniform convexity does not force uniformly bounded diamond distortion even under reflexivity.

Read the manuscripts

  1. Reflexive tree-space exampleSource listed in formalization catalogue
  2. Midpoint lensesSource listed in formalization catalogue
  3. Midpoint and tree energiesSource listed in formalization catalogue
  4. Daugavet subspace moduliSource listed in formalization catalogue
  5. Bounded tree potentialsSource listed in formalization catalogue
  6. Independent products in real L1Source listed in formalization catalogue
  7. Two recursive potentialsSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

332Metric Markov cotype two for ℓ1\ell_11 paper

Functional analysis

Original repository description

Proves that real ℓ1\ell_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\ell_1 extends to the whole space with a universal multiplicative loss in its Lipschitz constant, resolving Ball's extension problem for this target.

Read the manuscripts

  1. Metric Markov Cotype Two of ℓ_1
333Smooth isometric immersions of surfaces into R4\mathbb R^41 paperIn the film

Differential geometry

Original repository description

Every closed smooth Riemannian surface admits a smooth isometric immersion into R4\mathbb R^4, resolving the closed-surface form of the four-dimensional isometric-immersion problem. This includes nonorientable surfaces and metrics of arbitrary Gaussian curvature.

Read the manuscripts

  1. Smooth isometric immersions of closed surfaces into Euclidean four-space
334A smooth surface metric with no local immersion in R3\mathbb R^31 paperIn the film

Differential geometry

Original repository description

Constructs a smooth positive-definite metric on (−1,1)2(-1,1)^2 for which no neighborhood of the origin admits a smooth isometric immersion into R3\mathbb R^3. This answers the unrestricted smooth local isometric realization problem for surfaces negatively, even after shrinking the neighborhood.

Read the manuscripts

  1. A Smooth Metric with No Local Isometric Immersion into Three-SpaceSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

335Gromov's integral scalar-curvature inequality2 papers

Differential geometry

Original repository description

Proves ∫M(Scalg−)n/2 dVg≥an∥M∥\int_M(\mathrm{Scal}_g^-)^{n/2}\,dV_g\ge a_n\lVert M\rVert for every closed connected oriented smooth nn-manifold, n≥3n\ge3, and every smooth metric, with an>0a_n>0 depending only on dimension. Here Scalg−=max⁡{0,−Scalg}\mathrm{Scal}_g^-=\max\{0,-\mathrm{Scal}_g\} and ∥M∥\lVert M\rVert 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.

Read the manuscripts

  1. An integral scalar curvature bound for real simplicial volume
  2. Positive scalar curvature forces rational inessentiality
336Spectral scalar curvature and codimension-two width3 papers

Differential geometry

Original repository description

Every complete connected smooth boundaryless nn-manifold, n≥3n\ge3, satisfying −4Δ+Scal≥1-4\Delta+\mathrm{Scal}\ge1 as a quadratic-form inequality admits a continuous map to a simplicial complex of dimension at most n−2n-2 whose entire fibers have diameter bounded only by nn 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−2n-2 for every n≥2n\ge2.

Read the manuscripts

  1. Spectral scalar curvature and uniform Urysohn width
  2. Spectral scalar curvature and Urysohn width in dimension three
  3. Positive scalar curvature and uniform codimension-two width
337Cartan–Hadamard isoperimetry and CAT(0)(0) fillings2 papersIn the film

Differential geometry

Original repository description

Proves generalized Cartan–Hadamard isoperimetry in every dimension: in a complete simply connected manifold with sectional curvature at most κ≤0\kappa\le0, every finite-volume finite-perimeter set satisfies the sharp comparison with the equal-volume model ball. Bounded positive-volume equality regions for κ=0\kappa=0 are Euclidean balls. Also proves sharp Euclidean filling bounds for compactly supported integral nn-cycles, n≥2n\ge2, in arbitrary proper CAT(0)(0) spaces.

Read the manuscripts

  1. Cartan–Hadamard isoperimetry and rigidity
  2. Sharp integral fillings in CAT(0) spaces
338Yau's uniformization conjecture1 paper

Differential geometry

Original repository description

Proves Yau's uniformization conjecture: every complete connected noncompact Kähler manifold with strictly positive holomorphic bisectional curvature is biholomorphic to Cn\mathbb C^n.

Read the manuscripts

  1. Uniformization of complete Kähler manifolds with positive bisectional curvature
339Katok's entropy rigidity conjecture1 paper

Differential geometry

Original repository description

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.

Read the manuscripts

  1. Entropy equality and local symmetry in negative curvature
340A counterexample to the nearby Lagrangian conjecture1 paper

Differential geometry

Original repository description

Disproves the unrestricted nearby Lagrangian conjecture. For some sufficiently large even NN, constructs a closed exact embedded Lagrangian in T∗(S9×SN−1)T^*(S^9\times S^{N-1}) that is diffeomorphic to the base but not Hamiltonian isotopic to its zero section.

Read the manuscripts

  1. A counterexample to the nearby Lagrangian conjecture
341Donaldson's hypersymplectic deformation conjecture1 paper

Differential geometry

Original repository description

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 ∫ωi∧ωj=δij\int\omega_i\wedge\omega_j=\delta_{ij}, 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.

Read the manuscripts

  1. Deforming hypersymplectic four-manifolds to hyperkähler triples
342Donaldson's tamed-to-compatible conjecture1 paper

Differential geometry

Original repository description

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.

Read the manuscripts

  1. Taming implies compatibility on four-manifoldsSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

343Sharp symplectic ball-packing criteria in higher dimensions1 paper

Differential geometry

Original repository description

Resolves the Siegel–Yao conjecture for arbitrary capacities in every dimension 2n≥62n\ge6. Finitely many closed symplectic balls of capacities R1,…,RkR_1,\ldots,R_k embed disjointly into an open ball of capacity RR exactly when ∑iRin<Rn\sum_iR_i^n<R^n and Ri+Rj<RR_i+R_j<R for every distinct pair i,ji,j.

Read the manuscripts

  1. Symplectic Ball Packings in Higher Dimensions
344The metric Blaschke conjecture1 paper

Differential geometry

Original repository description

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.

Read the manuscripts

  1. The metric Blaschke theorem
345Infinitely many closed geodesics on spheres and three-manifolds1 paperIn the film

Differential geometry

Original repository description

Proves that every smooth Riemannian metric on SnS^n, n≥2n\ge2, 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.

Read the manuscripts

  1. Infinitely many closed geodesic images on every Riemannian sphere
346Sharp singular-set bounds for stationary integral varifolds2 papers

Differential geometry

Original repository description

Proves that every stationary integral mm-varifold in a Euclidean open set has singular set of Hausdorff dimension at most m−1m-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 mm-dimensional Hausdorff measure.

Read the manuscripts

  1. A Codimension-One Bound for the Singular Set of a Stationary Integral Varifold
  2. Almost-everywhere regularity of stationary integral varifolds
347Counterexamples to strong forms of Arnold's fixed-point conjecture5 papers

Differential geometry

Original repository description

Disproves stable-Morse lower bounds for nondegenerate Hamiltonian fixed points: on simply connected closed Kähler manifolds of real dimension 2222, 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.

Read the manuscripts

  1. Hamiltonian Fixed Points Below the Stable Morse Number in Dimension Twenty-Two
  2. Sharpness of the Cyclic Integral Floer Bound Below the Stable Morse Number
  3. Hamiltonian Fixed Points Below the Stable Morse Number
  4. Nondegenerate Morse-number counterexample
  5. Three fixed points on the symplectic quadric threefoldSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

348Nonnegatively curved Einstein four-manifolds and a topological gap3 papers

Differential geometry

Original repository description

Classifies closed connected Einstein four-manifolds with positive Einstein constant and nonnegative sectional curvature: up to scaling, their universal Riemannian covers are the round S4S^4, Fubini–Study CP2\mathbb{CP}^2, 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 L2L^2 norm of its trace-free Ricci curvature lies below a universal positive constant.

Read the manuscripts

  1. Zero-Plane Rigidity for Einstein Four-Manifolds
  2. An L^2 Einstein Gap for Nonnegatively Curved Four-Manifolds
  3. Positively curved Einstein four-manifolds
349The Solomon–Yau least-volume conjecture1 paper

Differential geometry

Original repository description

Proves the Solomon–Yau least-volume conjecture for minimal hypersurfaces of round spheres. For every m≥2m\ge2, a closed connected minimal immersion into the unit sphere Sm+1S^{m+1} with non-totally-geodesic image has volume at least that of the smallest minimal Clifford product, counting covering multiplicity.

Read the manuscripts

  1. The Solomon–Yau least-volume theorem
350Yau's nodal conjecture: surfaces and counterexamples3 papers

Differential geometry

Original repository description

Proves the sharp CλC\sqrt\lambda 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 S3S^3 arbitrarily close to round. In dimension five, nodal measure can grow faster than λ1/2+ε0\lambda^{1/2+\varepsilon_0} for some fixed ε0>0\varepsilon_0>0, ruling out even arbitrarily small power losses.

Read the manuscripts

  1. Sharp surface nodal length
  2. Smooth upper-bound counterexamples in dimensions 3–4Source listed in formalization catalogue
  3. Power-law violations of Yau’s upper boundSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

351Scalar curvature detects four-dimensional Ricci-flow singularities3 papers

Differential geometry

Original repository description

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.

Read the manuscripts

  1. Finite-time curvature blowup
  2. Four-dimensional smooth extension
  3. Ricci-flat tree inequality
352Finite-time singularity of Calabi flow1 paper

Differential geometry

Original repository description

Disproves Chen's smooth long-time existence conjecture for Calabi flow by constructing a smooth U(10)U(10)-invariant Kähler metric on CP10\mathbb{CP}^{10} 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.

Read the manuscripts

  1. A finite-time singularity of Calabi flow on projective space
353The sharp dimension threshold for affine Bernstein rigidity2 papers

Differential geometry

Original repository description

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.

Read the manuscripts

  1. A Smooth Nonquadratic Entire Affine Maximal Graph in Dimension Ten
  2. The affine Bernstein theorem in dimensions three through nine
354Isoperimetric regions in the cubic three-torus1 paper

Differential geometry

Original repository description

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π/814\pi/81 and 1/π1/\pi, with exactly the adjacent two types minimizing at each transition.

Read the manuscripts

  1. The Isoperimetric Conjecture for the Cubic Flat Three-Torus
355Unique tangent flows at the first surface singularity1 paper

Differential geometry

Original repository description

Proves the first-singular-time case of tangent-flow uniqueness for smooth compact connected embedded surfaces without boundary in R3\mathbb R^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.

Read the manuscripts

  1. Uniqueness of tangent flows at the first singular time of embedded surface mean-curvature flow
356Gigli's characterization of Alexandrov curvature2 papers

Differential geometry

Original repository description

Proves Gigli's conjecture: in every integer dimension n≥2n\ge2, Alexandrov curvature at least κ\kappa is characterized by the full-support RCD⁡((n−1)κ,n)\operatorname{RCD}((n-1)\kappa,n) condition with reference measure Hn\mathcal H^n and distributional sectional curvature at least κ\kappa in the original global test classes. The RCD condition is unreduced.

Read the manuscripts

  1. Distributional curvature characterization
  2. Weak Hessian boundsSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

357Bi-Lipschitz coordinates at every regular RCD point1 paper

Differential geometry

Original repository description

Proves that every regular point of a noncollapsed RCD⁡(K,n)\operatorname{RCD}(K,n) space, for K∈RK\in\mathbb R and integer n≥2n\ge2, has an open neighborhood bi-Lipschitz to an open subset of Rn\mathbb R^n. Regularity requires all pointed tangents to be Euclidean, the reference measure is exactly Hn\mathcal H^n, and the chart compares ambient distances with a point-dependent finite constant.

Read the manuscripts

  1. Bi-Lipschitz Coordinates at Regular Points of Noncollapsed RCD Spaces
358A three-manifold with no conjugate points and no nonpositively curved metric1 paper

Differential geometry

Original repository description

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.

Read the manuscripts

  1. A Three-Manifold Without Conjugate Points and Without a Nonpositively Curved MetricSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

359Negative Kähler curvature without bounded holomorphic coordinates2 papers

Differential geometry

Original repository description

Constructs a contractible domain in C3\mathbb C^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-1 and only constant bounded holomorphic functions; its curvature is not bounded below.

Read the manuscripts

  1. Negatively pinched Kähler threefoldSource listed in formalization catalogue
  2. Holomorphic Liouville property

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

360Villani’s convexity conjecture and regular optimal transport2 papers

Differential geometry

Original repository description

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.

Read the manuscripts

  1. Support and convex injectivity domainsSource listed in formalization catalogue
  2. Uniform bi-Hölder transportSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

361Counterexamples to Yau's harmonic dimension bound2 papers

Differential geometry

Original repository description

Disproves Yau's proposed Euclidean dimension bound for harmonic functions of integer growth on manifolds with nonnegative Ricci curvature. For every sufficiently large integer kk, a complete smooth metric on R3\mathbb R^3 has at least (k+2)2(k+2)^2 independent harmonic functions of growth at most kk, exceeding the Euclidean count (k+1)2(k+1)^2. The metric may depend on kk.

Read the manuscripts

  1. Even-dimensional counterexampleSource listed in formalization catalogue
  2. Three-dimensional counterexample

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

362Global smoothness for relativistic Vlasov–Maxwell1 paperIn the film

Partial differential equations

Original repository description

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.

Read the manuscripts

  1. Global classical solutions of the three-dimensional relativistic Vlasov–Maxwell systemSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

363Boltzmann nonuniqueness with exact local conservation2 papersIn the film

Partial differential equations

Original repository description

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 L1L^1 and satisfy exact local conservation of mass, momentum and kinetic energy.

Read the manuscripts

  1. Nonuniqueness with local conservation for the hard-sphere Boltzmann equation
  2. Nonuniqueness for the periodic hard-sphere Boltzmann equation
364Kinetic limits and fluctuations over the Boltzmann lifespan2 papers

Partial differential equations

Original repository description

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.

Read the manuscripts

  1. Boltzmann–Grad limit for stable radial potentials
  2. Hard-sphere fluctuations
365Joint metric and connection recovery from one boundary patch3 papers

Partial differential equations

Original repository description

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.

Read the manuscripts

  1. Determination of a metric and a unitary connection from one boundary patch
  2. Smooth anisotropic uniqueness
  3. Measurable scalar nonuniquenessSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

366The planar Mumford–Shah regularity conjecture1 paper

Partial differential equations

Original repository description

Resolves the interior regularity conjecture for reduced absolute planar Mumford–Shah minimizers with bounded fidelity data. Locally, the closed discontinuity set is a C1,αC^{1,\alpha} arc, a regular crack tip, or three arcs meeting at 120∘120^\circ; only finitely many global connected components meet any compact interior region.

Read the manuscripts

  1. Interior regularity of planar Mumford–Shah minimizers
367The critical dimension for the one-phase Bernoulli problem1 paper

Partial differential equations

Original repository description

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−7n-7 in higher dimensions.

Read the manuscripts

  1. The critical dimension for one-phase Bernoulli minimizers
368The three-dimensional Ball–Evans approximation problem2 papers

Partial differential equations

Original repository description

Resolves the three-dimensional Ball–Evans approximation problem: every W1,pW^{1,p} homeomorphism between arbitrary bounded domains in R3\mathbb R^3, for 1≤p<∞1\le p<\infty, is a strong W1,pW^{1,p} limit of smooth diffeomorphisms onto the same target.

Read the manuscripts

  1. Diffeomorphic approximation, 1≤ p≤2
  2. Diffeomorphic approximation, p>2
369The hot spots conjecture for simply connected planar domains1 paperIn the film

Partial differential equations

Original repository description

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.

Read the manuscripts

  1. Strict hot spots and absence of interior critical points on smooth simply connected planar domains
370The subcritical Lane–Emden and Hénon–Lane–Emden conjectures1 paper

Partial differential equations

Original repository description

Resolves the subcritical Lane–Emden conjecture and its weighted Hénon extension. For n≥2n\ge2, p,q>0p,q>0 and real A,BA,B, the system −Δu=∣x∣Avp-\Delta u=|x|^A v^p, −Δv=∣x∣Buq-\Delta v=|x|^B u^q has no positive entire solution when (n+A)/(p+1)+(n+B)/(q+1)>n−2(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≥3n\ge3 and A,B>−2A,B>-2.

Read the manuscripts

  1. The Subcritical Hénon–Lane–Emden ConjectureSource listed in formalization catalogue

“Source listed” identifies a paper in formalization.yaml. It is an artifact association, not a verification certificate for this family.

371Stable blowup for a defocusing Schrödinger equation1 paper

Partial differential equations

Original repository description

For a sufficiently large odd nonlinearity power, constructs a nonempty open set of initial data in Hk(T12)H^k(\mathbb T^{12}), with k>8k>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.

Read the manuscripts

  1. Stable self-similar blowup for a supercritical defocusing Schrödinger equation on the torus
372Global uniqueness in smooth isotropic elasticity1 paper

Partial differential equations

Original repository description

Proves that full static boundary displacement-to-traction data determine both smooth real Lamé moduli on every bounded connected smooth domain in R3\mathbb R^3, provided μ>0\mu>0 and 3λ+2μ>03\lambda+2\mu>0 on the closure. Neither analyticity, proximity to constant coefficients nor prior knowledge near the boundary is required.

Read the manuscripts

  1. Global Uniqueness for the Smooth Isotropic Elasticity Inverse Problem
373Nonattainment in three-marginal Coulomb transport1 paper

Partial differential equations

Original repository description

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.

Read the manuscripts

  1. A counterexample to the Monge ansatz for the three-marginal Coulomb cost
374Sharp one-third stability of optimal transport maps1 paper

Partial differential equations

Original repository description

For uniform source measure ρ\rho on a compact convex body with interior in dimension at least two, quadratic optimal transport maps satisfy ∥Tμ−Tν∥L2(ρ)≤CW2(μ,ν)1/3\|T_\mu-T_\nu\|_{L^2(\rho)}\le C W_2(\mu,\nu)^{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.

Read the manuscripts

  1. Sharp One-Third Stability of Brenier Maps
375De Giorgi's conjecture in dimension eight1 paperIn the film

Partial differential equations

Original repository description

Proves De Giorgi's conjecture at its sharp dimension-eight endpoint: every entire C2C^2 solution u:R8→(−1,1)u:\mathbb R^8\to(-1,1) of Δu=u3−u\Delta u=u^3-u that is strictly increasing in one direction depends on only one linear coordinate. A stronger theorem classifies all stable entire solutions v:R7→[−1,1]v:\mathbb R^7\to[-1,1] as constant wells or planar transitions, without an energy-growth assumption.

Read the manuscripts

  1. A positive resolution of De Giorgi's conjecture in dimension eight
376Universal computation in forced Navier–Stokes flows9 papersIn the film

Partial differential equations

Original repository description

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.

Read the manuscripts

  1. Finite instructions and shear flows
  2. Fixed particle test
  3. Eventually stationary forcing
  4. Geometric programs for solenoidal forcing
  5. Prefix instructions and incompressible flows
  6. Rapidly vanishing forcing
  7. Velocity-field detection
  8. Scalar potentials and slow clocks
  9. Incompressible box transport
377Interior C1,αC^{1,\alpha} regularity for infinity-harmonic functions1 paper

Partial differential equations

Original repository description

Proves uniform interior C1,αdC^{1,\alpha_d} regularity for bounded infinity-harmonic functions in every dimension d≥3d\ge3, 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.

Read the manuscripts

  1. Uniform Interior C^1,α Estimates for Infinity-Harmonic Functions

Repository descriptions are reproduced from OpenAI’s catalogue under Apache License 2.0. They state the authors’ results and assumptions. Read the source catalogue · Source license.

New words, explained

Look up a term, then return to the chapter that introduces it. These short explanations are starting points; exact conditions are in the chapter notes.

139 terms

Abelian variety

A higher-dimensional relative of an elliptic curve, with a compatible addition rule.

Read the chapter →

Algebraic cycle

A formal combination of geometric pieces cut out by polynomial equations.

Read the chapter →

Amenability

For finitely generated groups, large finite pieces can have boundary-to-size ratio as small as desired.

Read the chapter →

Analytic rank

Rank 0: nonzero at 1. Rank 1: a simple zero, changing roughly linearly near 1.

Read the chapter →

Approximation guarantee

A lower bound on how good the algorithm’s answer is relative to the best answer.

Read the chapter →

Area law in two dimensions

Entanglement is bounded in proportion to a region’s boundary length, under the stated gap and interaction assumptions.

Read the chapter →

Banach space

A normed vector space containing the limit of every sequence whose terms become arbitrarily close to one another.

Read the chapter →

Base point

A point where all sections in the chosen system vanish, so they cannot provide coordinates there.

Read the chapter →

Beyond the CM case

Family 032 also covers finite-field consequences and products of projective K3 surfaces.

Read the chapter →

Bipartite graph

Its vertices split into two classes, with every edge joining different classes.

Read the chapter →

Bit complexity

Count elementary operations on bits, the zeros and ones encoding the input.

Read the chapter →

Bose–Einstein condensation

A nonvanishing fraction of all particles occupy one quantum state in the large-system limit.

Read the chapter →

Boundary at infinity

An ideal collection of directions in which paths can escape indefinitely.

Read the chapter →

Bounded distortion

The representation preserves every distance within a fixed multiplicative factor after rescaling.

Read the chapter →

Cancellation

If X × line and Y × line agree, must X and Y agree? The reported example says no.

Read the chapter →

Categoricity

All models of the specified size are equivalent through a structure-preserving match.

Read the chapter →

Closed geodesic

A locally straight path that closes up smoothly. Distinct images are different geometric paths.

Read the chapter →

Cohomology class

One element in an algebraic description of a space’s global structure.

Read the chapter →

Complex multiplication

Many compatible ways of sending the space to itself while respecting addition. Precise condition in the notes.

Read the chapter →

Complex number

A number with real and imaginary coordinates, shown as a point on a plane.

Read the chapter →

Conformal map

A map preserving angles locally, though lengths and areas can change.

Read the chapter →

Convex

Every straight segment joining two points of the filled shape stays inside it.

Read the chapter →

Counterexample

A specific construction for which the proposed universal rule fails.

Read the chapter →

Critical probability

The transition value for the appearance of an infinite open cluster.

Read the chapter →

Crossing number

The smallest possible number of edge crossings among all allowed plane drawings of a graph.

Read the chapter →

Degree and multiplicity

Degree measures polynomial complexity; multiplicity measures repeated vanishing at a point.

Read the chapter →

Denominator q

The integer below the fraction bar. Larger q allows finer choices of fractions.

Read the chapter →

Density one

The proportion of exceptions tends to zero in the specified ordering.

Read the chapter →

Derandomization

Replace random choices by a deterministic procedure while preserving the stated resource bounds.

Read the chapter →

Different kinds of result

Theorems, counterexamples, sharper bounds, constructions, and links between theories.

Read the chapter →

Dot product

Multiply corresponding coordinates, then add: (a,b)·(x,y) = ax + by.

Read the chapter →

Edit distance

The minimum number of allowed one-letter edits converting one word into another.

Read the chapter →

Elliptic curve

A curve such as y² = x³ − x, completed by a point at infinity, with a rule for adding points.

Read the chapter →

Energy minimization

Compare arrangements at the same density using the same pair-interaction rule.

Read the chapter →

Existence and uniqueness

A solution exists, and the same initial state determines only one solution.

Read the chapter →

Exponent at most 2.25

The precise bound allows n raised to 2.25 plus any fixed positive extra amount.

Read the chapter →

Filling fraction

A ratio comparing particle number with the number of available magnetic states.

Read the chapter →

Finite field

An arithmetic system with finitely many values in which every nonzero value has a multiplicative inverse.

Read the chapter →

Finite presentation

A finite list of generators and relations describing a group, which can still be infinite.

Read the chapter →

Fixed point

A point x satisfying T(x) = x. A nonexpansive T never increases the distance between two points.

Read the chapter →

Fourier partial sum

An approximation formed by keeping finitely many frequency components.

Read the chapter →

Fractal dimension

A measure of how the number of small pieces needed to cover a set grows as their size shrinks.

Read the chapter →

Free energy

A quantity balancing energy and how many arrangements are available at a given temperature.

Read the chapter →

Generator

A basic group element from which other elements are made using products and inverses.

Read the chapter →

Generator of an algebra

An element from which the whole algebra is obtained using its permitted operations and limits.

Read the chapter →

Group

A system of reversible operations. They can be combined, and each can be undone.

Read the chapter →

Group algebra

Add weighted group elements. Multiply by distributing, then combining the group operations.

Read the chapter →

Heat eigenmode

A spatial temperature pattern whose shape stays fixed while its amplitude decays during diffusion.

Read the chapter →

Homeomorphism versus homotopy

A homeomorphism is a reversible continuous map. Homotopy equivalence permits inverse maps only up to continuous deformation.

Read the chapter →

Hyperinvariant subspace

A subspace preserved by every operator that commutes with the chosen operator.

Read the chapter →

Independent review

Other researchers examine the statements, arguments, and supporting evidence.

Read the chapter →

Initial data

A starting spatial geometry, its rate of change, and matter or field information satisfying the required constraints.

Read the chapter →

Intersection multiplicity

A weighted algebraic count of an intersection, which includes more information than simply counting visible points.

Read the chapter →

Irrationality exponent

A measure of how often rational approximations can achieve exceptionally small errors.

Read the chapter →

Isometric immersion

A smooth realization preserving lengths of tangent vectors, while allowing self-intersections.

Read the chapter →

Isomorphic

Related by a one-to-one correspondence preserving the mathematical structure.

Read the chapter →

Isoperimetric inequality

A lower bound on boundary size for a region of given volume.

Read the chapter →

Knot surgery

Remove a tubular neighborhood of a knot, then reglue it with a chosen boundary identification.

Read the chapter →

L-function

A function packaging arithmetic information, here from counts of solutions modulo primes.

Read the chapter →

L-one distance

Add the absolute differences of the coordinates: |x₁ − y₁| + |x₂ − y₂| + …

Read the chapter →

Limit cycle

An isolated periodic orbit: a repeating trajectory separated from other repeating trajectories.

Read the chapter →

Liouville function

+1 for an even number of prime factors; −1 for an odd number, counting repeats.

Read the chapter →

Magnetization

The net magnetic effect per unit size, after adding the individual magnetic moments.

Read the chapter →

Manifold

A space that looks like ordinary Euclidean space in a sufficiently small neighborhood of every point.

Read the chapter →

Mixing

Long time separation makes the relevant correlations approach products of probabilities.

Read the chapter →

Multiplicative inverse

A partner that multiplies with an element to give 1, the multiplicative identity.

Read the chapter →

One species

One kind of charged particle. The full starting-state conditions are in the guide.

Read the chapter →

One-dimensional profile

The value depends only on one linear coordinate, even when the surrounding space has many dimensions.

Read the chapter →

Operator

A linear rule acting on vectors, possibly in a space with infinitely many coordinates.

Read the chapter →

P versus NP

Does efficient checking always imply efficient solving? P ≠ NP says no.

Read the chapter →

Penrose inequality

A lower bound on mass in terms of the minimum area enclosing a trapped region, under precise geometric conditions.

Read the chapter →

Permanence

After enough time, all concentrations stay bounded away from both zero and infinity, within the stated class.

Read the chapter →

Polar body

The points whose dot product with every point of the original body is at most 1.

Read the chapter →

Polynomial

A finite sum of terms using nonnegative whole-number powers of the variables.

Read the chapter →

Quadratic twists

Curves obtained by a controlled change of coefficients; one form is d y² = x³ + ax + b.

Read the chapter →

Rank

The number of independent starting points needed for its infinite part, using repeated addition.

Read the chapter →

Rational / irrational

Rational: an exact fraction of integers. Irrational: no such exact fraction exists.

Read the chapter →

Relative consistency

If the starting axioms are consistent, a model with the claimed combination of properties can be built.

Read the chapter →

Resolution length

Count the stages needed to describe an algebraic object through successive equations and relations.

Read the chapter →

Satisfiability threshold

The limiting transition between constraints that can all be satisfied and constraints that cannot.

Read the chapter →

Scaling limit

A large-system limit obtained while rescaling distances, time, or other quantities.

Read the chapter →

Similarity

Change coordinates by an invertible transformation: A becomes S A S⁻¹.

Read the chapter →

Singularity

A failure of the smooth solution, for example through uncontrolled growth of derivatives.

Read the chapter →

Spin glass

A disordered spin system with interactions that can favor conflicting alignments.

Read the chapter →

Squarefree

No prime square divides the number. For example, 10 qualifies; 12 does not.

Read the chapter →

Strong cosmic censorship

A question about whether physically admissible spacetime evolution can continue past the region determined by initial data.

Read the chapter →

Subject map

Each bar counts result families assigned to that subject by the catalogue.

Read the chapter →

Supporting materials

Papers, source files, formal proof artifacts, checking instructions, and selected reasoning summaries.

Read the chapter →

The critical strip

The region with horizontal coordinate strictly between 0 and 1.

Read the chapter →

Three-halves power

T^(3/2) = T × √T. The theorem also specifies the multiplier.

Read the chapter →

Turing degree

A level of computational power, defined by mutual ability to solve problems using each other as an oracle.

Read the chapter →

Two-point correlation

Multiply signs a fixed distance apart, then average those products.

Read the chapter →

Uniform energy gap

The separation above the lowest energy stays bounded away from zero as the system size grows.

Read the chapter →

Unique Games

Labeling puzzles with pairwise rules: one endpoint’s label uniquely determines the required other label.

Read the chapter →

Unique witness

Membership is represented by exactly one auxiliary solution, and nonmembership by none.

Read the chapter →

Unit-distance coloring

Points at distance exactly 1 must receive different colors.

Read the chapter →

Universal computation

A system can simulate any computation when supplied with an appropriate encoded program and input.

Read the chapter →

Universal decision procedure

One algorithm that always finishes and gives the correct yes-or-no answer.

Read the chapter →

Universality

Different small-scale models share the same limiting behavior under the stated conditions.

Read the chapter →

Von Neumann algebra

A collection of vector transformations that also contains the relevant combinations and limits.

Read the chapter →

Weak solution

A solution satisfying the equations in an integrated sense, allowing less smoothness than a classical solution.

Read the chapter →

Read the results. Follow the sources.

The complete narration, plain-language definitions, scope notes and primary sources.

Back to the film
01 · THE COLLECTION

A map of the whole collection

This release reaches far beyond prime numbers and a few famous conjectures. It asks how shapes can be bent, whether randomness helps computers, how gases evolve, and what quantum systems can do. This expanded tour visits every one of the catalogue's seventeen subjects. We will explain representative results through examples and define the unfamiliar words as they appear. The companion page lets you search every result family and follow every paper.

Terms introduced here

The whole collection
All 17 subjects in the film. Every catalogue family in the searchable companion.
Scope, assumptions, and source descriptions

Repository README · Formalization catalogue

02 · THE COLLECTION

What is actually in the package?

The package contains seven hundred twenty-two manuscripts, grouped into three hundred seventy-two result families. A family can include a main theorem, another proof, and papers developing its consequences. A manuscript is one paper; a family is a group of related papers. The numbers are not interchangeable.

There are also manuscript source files, a Lean proof library, checking configurations, and abridged reasoning summaries for ten selected families. Those summaries describe parts of the reasoning process; they are not substitutes for the mathematical proofs. OpenAI says the model was posed about four thousand problems. The published counts alone do not give a success rate.

Terms introduced here

Paper versus family
One family can contain several related manuscripts.
Supporting materials
Papers, source files, formal proof artifacts, checking instructions, and selected reasoning summaries.
Scope, assumptions, and source descriptions

Repository README · Formalization catalogue

03 · READING THE CLAIMS

How should we read the claims?

A conjecture is a mathematical statement people suspect is true.

A proof is an argument establishing that it follows from stated assumptions. The release includes written proofs and, for many results, versions intended to be checked by software called Lean.

Lean checks whether the formal proof follows its rules. People still need to check that the formal statement expresses the intended mathematics.

Independent review means other researchers examine that evidence. The results are at different stages of checking; the catalogue marks review status unchecked. So throughout this film, reported result means what the repository claims, not a proof that we have independently verified.

Terms introduced here

Conjecture
A mathematical statement suspected to be true.
Proof
An argument deriving a statement from stated assumptions.
Lean
Software that checks a precisely written mathematical argument.
Independent review
Other researchers examine the statements, arguments, and supporting evidence.
Scope, assumptions, and source descriptions

The formalization catalogue reports scope “Partial progress” and review status “unchecked.” Presence in this catalogue means supporting artifacts are listed. It does not mean this production rebuilt the proof library or completed an independent mathematical review.

Repository README · Formalization catalogue

04 · THE COLLECTION

Seventeen subjects, one connected catalogue

Here is the full map. The largest family count is in theoretical computer science, but substantial groups of results also concern algebraic geometry, combinatorics, probability, and differential geometry. A family count measures how the catalogue is organized, not how difficult or important a theorem is.

Some results establish a proposed rule. Others give counterexamples: constructions showing that a proposed rule can fail. Still others improve a numerical bound or connect two descriptions of the same mathematical object. We will keep those different kinds of accomplishment visible.

Terms introduced here

Subject map
Each bar counts result families assigned to that subject by the catalogue.
Different kinds of result
Theorems, counterexamples, sharper bounds, constructions, and links between theories.
Scope, assumptions, and source descriptions

Repository README · Formalization catalogue

05 · NUMBER THEORY

Where can a special function equal zero?

Start with a function: a rule that takes an input and returns an output. A zero is an input where the output is zero. The zeta function is a special function tied to prime numbers, the integers greater than one divisible only by themselves and one.

Its inputs can be complex numbers. Picture those as points on a plane: a real coordinate horizontally, and an imaginary coordinate vertically.

The zeros relevant here lie in the strip between horizontal coordinates zero and one. The Riemann hypothesis says they all sit on the one-half line.

The release reports that none lie to the right of seven eighths. That forbidden region continues upward and downward without end. This is progress toward the famous conjecture, not the full conjecture. The paper extends the claim to related functions used to study primes.

Terms introduced here

Zero of a function
An input for which the function’s output equals zero.
Complex number
A number with real and imaginary coordinates, shown as a point on a plane.
The critical strip
The region with horizontal coordinate strictly between 0 and 1.
Zero-free region
A region containing no inputs where the function vanishes.
Scope, assumptions, and source descriptions

The zero-free region is Re(s) > 7/8, not the full Riemann hypothesis. The principal pole at s = 1 is not a zero. The marked zeta zeros use the first seven positive ordinates, rounded to six decimals. Lean declaration: OAI.riemannZeta_ne_zero_of_seven_eighths_lt_re. The corresponding comparator permits propext, Quot.sound and Classical.choice; this production did not run it.

The following descriptions are reproduced from OpenAI’s catalogue. They report the authors’ claims and retain the technical scope. The film does not independently certify their proofs.

Family 003 · The quasi-Riemann hypothesis

Proves that every Dirichlet LL-function, including ζ(s)\zeta(s), is zero-free in ℜs>7/8\Re s>7/8, resolving the quasi-Riemann hypothesis. The same half-plane is zero-free for every finite-order Hecke LL-function over Q(−3)\mathbb Q(\sqrt{-3}). A companion gives a different proof of the zero-free half-plane ℜs>11/12\Re s>11/12.

06 · NUMBER THEORY

How well can fractions approximate π?

A rational number is a fraction of integers, such as twenty-two sevenths. Pi is irrational: no such fraction equals it exactly. But fractions can come close. Three hundred fifty-five over one hundred thirteen is much better than twenty-two sevenths.

The denominator, the number underneath, is the price paid for that accuracy. Write it as q. An error like one over q squared improves as q grows; one over q cubed would improve faster.

The paper reports that the long-run dividing exponent for pi is two. Choose any fixed exponent larger than two, even two point zero zero one. Only finitely many fractions beat that accuracy target. This statement is called an irrationality exponent of two.

A related infinite sum, the Flint Hills series, then converges: its partial totals approach a finite number. A separate paper reports that another particular infinite sum, Catalan's constant, cannot equal a fraction either.

Terms introduced here

Rational / irrational
Rational: an exact fraction of integers. Irrational: no such exact fraction exists.
Denominator q
The integer below the fraction bar. Larger q allows finer choices of fractions.
Irrationality exponent
A measure of how often rational approximations can achieve exceptionally small errors.
Convergent sum
The partial totals approach a finite number.
Scope, assumptions, and source descriptions

μ(π) = 2 means that for every ε > 0, all sufficiently large q satisfy |π − p/q| ≥ q^(−2−ε) for every integer p. The two displayed absolute approximation errors are computed from 22/7 and 355/113. The conclusion concerns sufficiently large denominators; it does not give a uniform c/q² lower bound. The Catalan irrationality claim is a separate manuscript.

The following descriptions are reproduced from OpenAI’s catalogue. They report the authors’ claims and retain the technical scope. The film does not independently certify their proofs.

Family 017 · The irrationality exponent of π\pi is 22

Proves that the irrationality exponent of π\pi is exactly 22: for every ε>0\varepsilon>0 and all sufficiently large denominators qq, every rational p/qp/q satisfies ∣π−p/q∣≥q−2−ε|\pi-p/q|\ge q^{-2-\varepsilon}. This also proves convergence of the Flint–Hills series ∑n≥11/(n3sin⁡2n)\sum_{n\ge1}1/(n^3\sin^2 n), with angles in radians.

Family 005 · Irrationality of Catalan's constant

Proves that Catalan's constant G=∑j≥0(−1)j/(2j+1)2G=\sum_{j\ge0}(-1)^j/(2j+1)^2 is irrational.

07 · NUMBER THEORY / LOGIC

The limits of a universal solver

Now ask for exact solutions instead of approximations. In x squared plus y squared equals one, x equals three fifths and y equals four fifths work. They are rational solutions because both coordinates are fractions. In x squared equals two, neither solution is rational.

An algorithm is a precise, step-by-step recipe a computer can follow. Could one recipe decide whether every polynomial equation has a rational solution?

Here polynomial means a sum of terms made from whole-number powers of the variables, and the coefficients are integers.

The reported answer is no, when any number of variables is allowed. This is Hilbert's tenth problem over the rationals. It does not say every individual equation is impossible to solve. It says no single procedure can always finish and answer correctly for every input.

Terms introduced here

Rational solution
A solution whose coordinates are fractions of integers.
Algorithm
A precise sequence of instructions a computer can follow.
Polynomial
A finite sum of terms using nonnegative whole-number powers of the variables.
Universal decision procedure
One algorithm that always finishes and gives the correct yes-or-no answer.
Scope, assumptions, and source descriptions

The polynomial has integer coefficients, the requested zeros are rational, and the number of variables is part of the input. The result concerns a universal algorithm that always halts, not the solvability of every particular equation.

The following descriptions are reproduced from OpenAI’s catalogue. They report the authors’ claims and retain the technical scope. The film does not independently certify their proofs.

Family 004 · Hilbert's tenth problem over Q\mathbb Q

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 Q\mathbb Q negatively.

08 · ELLIPTIC CURVES

Two ways to understand rational points

An elliptic curve is a special kind of curve with no sharp corners or crossing singularities, described by an equation like y squared equals x cubed minus x, together with one point at infinity. Despite the name, it is not an ellipse. We want its rational points: solutions whose coordinates are fractions.

There is a rule for adding these points. The curve's rank counts independent starting points needed to generate its infinite part by repeated addition. Think of counting independent directions, while keeping track of a separate finite part.

Another description starts by counting solutions in arithmetic modulo primes. Modulo means keeping only the remainder after division. Those counts are packaged into a function called an L-function. The Birch and Swinnerton-Dyer conjecture links these two descriptions: rational points and the behavior of that function near input one.

The release reports its full numerical formula for a precisely specified class of curves. The extra arithmetic condition is in the notes; this does not settle every curve.

Related work studies families of modified equations called quadratic twists.

It reports a limiting half-and-half split: in half, the L-function is nonzero at one; in half, it has a simple zero, meaning that near one its value changes roughly in proportion to the distance from one. These are called analytic ranks zero and one.

Terms introduced here

Elliptic curve
A curve such as y² = x³ − x, completed by a point at infinity, with a rule for adding points.
Rank
The number of independent starting points needed for its infinite part, using repeated addition.
L-function
A function packaging arithmetic information, here from counts of solutions modulo primes.
A restricted class
The full numerical formula is reported under an extra arithmetic condition given in the notes.
Quadratic twists
Curves obtained by a controlled change of coefficients; one form is d y² = x³ + ax + b.
Analytic rank
Rank 0: nonzero at 1. Rank 1: a simple zero, changing roughly linearly near 1.
Scope, assumptions, and source descriptions

The BSD hypothesis concerns the full q-power Selmer corank, not only the Mordell–Weil rank. Goldfeld densities are over signed squarefree twist parameters ordered by absolute value. The displayed curve y² = x³ − x is an illustration; the three marked rational points are (−1,0), (0,0), and (1,0).

The following descriptions are reproduced from OpenAI’s catalogue. They report the authors’ claims and retain the technical scope. The film does not independently certify their proofs.

Family 002 · The full Birch–Swinnerton-Dyer formula in Selmer coranks zero and one

Proves the full Birch–Swinnerton-Dyer leading-term formula for every elliptic curve over Q\mathbb Q whose full qq-power Selmer group has corank zero or one for some prime qq, 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 Q\mathbb Q.

Family 006 · Goldfeld's conjecture

Proves Goldfeld's conjecture for quadratic twists of every elliptic curve over Q\mathbb Q: analytic ranks zero and one each have density 1/21/2, and the mean analytic rank tends to 1/21/2. Both statements order signed squarefree twist parameters by absolute value.

09 · Number theory

More ways that primes and fractions behave

The number-theory package goes further than the preceding examples. The BSD and Goldfeld families are reported to combine into the full BSD formula for almost every quadratic twist of any fixed elliptic curve. Here almost every means that the fraction of exceptions tends to zero as larger twist parameters are included.

Another result concerns squarefree numbers, which have no repeated prime factor. Ten is squarefree; twelve is not, because four divides it. For irreducible fourth-degree integer polynomials without an unavoidable prime-square divisor, the package reports the predicted positive density of squarefree values.

An Egyptian fraction writes a number as a sum of distinct fractions with numerator one. For example, two thirds is one half plus one sixth. The release gives an optimal-order bound on how many terms are needed: the worst case grows like the logarithm of the logarithm of the denominator.

Gaussian primes are primes in arithmetic with integer real and imaginary coordinates. The Gaussian moat result says that no fixed maximum step length lets you walk forever through distinct Gaussian primes.

Finally, a primitive root generates every nonzero remainder modulo a prime by taking powers. Powers of three do this modulo seven. The Artin result reports infinitely many suitable primes for every integer base that is neither minus one nor a square. It proves this infinitude claim, not the full predicted density.

Terms introduced here

Density one
The proportion of exceptions tends to zero in the specified ordering.
Squarefree
No prime square divides the number. For example, 10 qualifies; 12 does not.
Egyptian fraction
A sum of distinct positive fractions of the form 1/n.
Gaussian prime
A prime in the arithmetic of numbers a + bi with integer a and b.
Primitive root
Its powers visit all nonzero remainders modulo the prime.
Scope, assumptions, and source descriptions

The following descriptions are reproduced from OpenAI’s catalogue. They report the authors’ claims and retain the technical scope. The film does not independently certify their proofs.

Family 002 · The full Birch–Swinnerton-Dyer formula in Selmer coranks zero and one

Proves the full Birch–Swinnerton-Dyer leading-term formula for every elliptic curve over Q\mathbb Q whose full qq-power Selmer group has corank zero or one for some prime qq, 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 Q\mathbb Q.

Family 006 · Goldfeld's conjecture

Proves Goldfeld's conjecture for quadratic twists of every elliptic curve over Q\mathbb Q: analytic ranks zero and one each have density 1/21/2, and the mean analytic rank tends to 1/21/2. Both statements order signed squarefree twist parameters by absolute value.

Family 020 · Squarefree quartics and power-free polynomial values

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)(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≥4d\ge4.

Family 025 · Erdős’s short Egyptian-fraction conjecture

Every rational a/ba/b with 1≤a<b1\le a<b is a sum of O(log⁡log⁡b)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.

Family 028 · The Gaussian moat conjecture

Proves the Gaussian moat conjecture: no infinite walk through distinct Gaussian primes can have uniformly bounded steps. More strongly, for every distance bound DD, the graph joining Gaussian primes at distance at most DD has uniformly bounded finite component sizes, depending only on DD, including primes on the coordinate axes.

Family 029 · Artin's primitive root conjecture: infinitude for every base

Proves the infinitude assertion in Artin's primitive root conjecture for every integer aa that is neither −1-1 nor a square. For each such base, at least cax/(log⁡x)2c_a x/(\log x)^2 primes in every sufficiently large interval (x,2x)(x,2x) have primitive root aa, with ca>0c_a>0.

10 · ALGEBRAIC GEOMETRY

Can global features come from equations?

Imagine studying a shape in two ways. You can describe its global structure, including holes. Or you can describe smaller pieces cut out by equations.

Cohomology is an algebraic way of recording global features; a cohomology class is one item in that record.

An algebraic cycle is a combination of geometric pieces defined by polynomial equations. The Hodge conjecture asks whether certain cohomology classes can be built from these algebraic cycles. The word certain matters: it does not make that claim for every class.

The release reports the conjecture for a special class of spaces called abelian varieties with complex multiplication.

An abelian variety is a higher-dimensional relative of an elliptic curve, with a compatible rule for adding points.

Complex multiplication means it has a particularly rich system of compatible multiplication maps: rules sending the space back to itself while respecting addition. The picture of a doughnut is a visual aid, not the general space. The result covers all dimensions within this special class; it does not settle the Hodge conjecture for every algebraic space.

Terms introduced here

Global structure
Features of the whole space, such as the way holes occur.
Cohomology class
One element in an algebraic description of a space’s global structure.
Algebraic cycle
A formal combination of geometric pieces cut out by polynomial equations.
A special class of spaces
The claim concerns abelian varieties with complex multiplication.
Abelian variety
A higher-dimensional relative of an elliptic curve, with a compatible addition rule.
Complex multiplication
Many compatible ways of sending the space to itself while respecting addition. Precise condition in the notes.
Scope, assumptions, and source descriptions

The principal result concerns rational Hodge classes on complex CM abelian varieties. It is not the general Hodge conjecture. The torus and loops are conceptual illustrations and should not be read as a representation of every algebraic cycle.

The following descriptions are reproduced from OpenAI’s catalogue. They report the authors’ claims and retain the technical scope. The film does not independently certify their proofs.

Family 032 · The rational Hodge conjecture for CM abelian varieties and products of K3 surfaces

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. Companion results prove rational Hodge for arbitrary products of projective complex K3 surfaces and algebraicity of the Kuga–Satake correspondence for every such surface.

11 · Algebraic and complex geometry

Algebraic geometry: maps, constraints, and surprises

The Hodge family also reports consequences for abelian varieties over finite fields, where arithmetic has only finitely many values. These include the Tate conjecture in that setting. Companion papers extend the rational Hodge claim to products of projective K3 surfaces, special spaces with two complex dimensions, or four real dimensions. These extensions are part of the package, not just the CM case shown earlier.

Other families ask when a shape admits useful coordinate maps built from algebraic data. Think of sections as generalized functions used to build coordinates. A base point is a point where all the available sections vanish together, preventing that coordinate description. Fujita gives a sharp positivity bound that removes base points. Log abundance turns a weaker positivity condition on specified canonical data into such a usable map after taking a suitable multiple. Its proof uses the companion work on how complexity behaves in families of shapes. The exact hypotheses are in the catalogue.

Nagata concerns the cost of forcing a polynomial curve through many points. The degree measures the polynomial complexity; multiplicity measures repeated vanishing at a point. The claimed inequality puts a sharp restriction on their tradeoff for at least ten very general complex points.

The package also contains failures of expected rules. Cancellation would let us remove the same extra coordinate from two equivalent products. A reported complex four-dimensional shape becomes ordinary five-dimensional affine space after adding a line, even though the original shape is not ordinary four-dimensional affine space. Adding a coordinate can hide a difference.

Terms introduced here

Beyond the CM case
Family 032 also covers finite-field consequences and products of projective K3 surfaces.
Base point
A point where all sections in the chosen system vanish, so they cannot provide coordinates there.
Degree and multiplicity
Degree measures polynomial complexity; multiplicity measures repeated vanishing at a point.
Cancellation
If X × line and Y × line agree, must X and Y agree? The reported example says no.
Scope, assumptions, and source descriptions

The following descriptions are reproduced from OpenAI’s catalogue. They report the authors’ claims and retain the technical scope. The film does not independently certify their proofs.

Family 032 · The rational Hodge conjecture for CM abelian varieties and products of K3 surfaces

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. Companion results prove rational Hodge for arbitrary products of projective complex K3 surfaces and algebraicity of the Kuga–Satake correspondence for every such surface.

Family 033 · Campana's orbifold Iitaka conjecture and logarithmic subadditivity

Proves Campana's orbifold Iitaka subadditivity conjecture for smooth Fujiki-class-C\mathcal C manifolds with rational simple-normal-crossing boundaries. For projective fibrations f:U→Vf:U\to V of smooth complex quasi-projective varieties with connected fibers, general fiber FF, and κˉ(V)≥0\bar\kappa(V)\ge0, proves Popa's inequality κˉ(U)≥κ(F)+max⁡{κˉ(V),Var⁡(f)}\bar\kappa(U)\ge\kappa(F)+\max\{\bar\kappa(V),\operatorname{Var}(f)\}, where variation measures the whole geometric generic fiber.

Family 034 · Log abundance and effective Iitaka fibrations

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 Q\mathbb Q-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.

Family 038 · Fujita's freeness conjecture

Proves Fujita's freeness conjecture at its sharp bound in every dimension: for a smooth projective complex variety XX of dimension nn and an ample line bundle LL, the adjoint KX+mLK_X+mL is globally generated for every integer m≥n+1m\ge n+1.

Family 039 · Nagata's conjecture and maximal Seshadri constants

Proves Nagata's strict inequality ∑imi<dr\sum_i m_i<d\sqrt r for every nonzero effective plane curve of degree dd through r≥10r\ge10 very general complex points, with arbitrary multiplicities mim_i. It also proves maximal multipoint Seshadri constants (Ln/r)1/n(L^n/r)^{1/n} for every smooth polarized projective variety of dimension n≥2n\ge2 and all sufficiently large rr: at very general points over C\mathbb C, and at the geometric generic tuple over any algebraically closed field of positive characteristic.

Family 047 · Complex counterexamples to cancellation and affine fibrations

Constructs an integral complex affine fourfold X≇A4X\not\cong\mathbb A^4 with X×A1≅A5X\times\mathbb A^1\cong\mathbb A^5, disproving affine-space cancellation over C\mathbb C in dimension four. It also disproves the Dolgachev–Weisfeiler affine-fibration conjecture: smooth surjections X→A1X\to\mathbb A^1 and A5→A2\mathbb A^5\to\mathbb A^2 have every residue-field fiber isomorphic to affine three-space but are not Zariski-locally trivial.

12 · Real and complex analysis

Analysis: distances, directions, and waves

Analysis studies functions and limiting processes. Koebe asks whether complicated planar regions can be redrawn while preserving local angles so that the missing pieces become round disks or points. Such an angle-preserving redraw is called conformal. The package reports this existence theorem for every domain on the sphere used in complex analysis.

A fractal dimension measures how finely a set fills space and need not be a whole number. Falconer asks how many different distances a set determines. The reported theorem says that a compact set of dimension greater than half the surrounding dimension has distances occupying positive length on the number line.

Kakeya asks how small a set can be while containing a unit line segment pointing in every direction. The release reports the full four-dimensional dimension conclusion, along with a stronger quantitative tube estimate in three dimensions. Full dimension does not mean positive volume.

Fourier analysis rebuilds a signal from sine and cosine waves. The Fourier result gives pointwise reconstruction except on a set of measure zero under the size condition called L log L. That condition controls large spikes through a finite integral of the function’s size times the logarithm of one plus its size.

Terms introduced here

Conformal map
A map preserving angles locally, though lengths and areas can change.
Fractal dimension
A measure of how the number of small pieces needed to cover a set grows as their size shrinks.
Kakeya set
A set containing a unit line segment in every direction.
Fourier partial sum
An approximation formed by keeping finitely many frequency components.
Scope, assumptions, and source descriptions

The following descriptions are reproduced from OpenAI’s catalogue. They report the authors’ claims and retain the technical scope. The film does not independently certify their proofs.

Family 071 · Koebe's circle-domain conjecture and circle-domain rigidity

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.

Family 073 · The Falconer distance conjecture

Resolves the Falconer distance conjecture in every dimension d≥2d\ge2: every compact set E⊂RdE\subset\mathbb R^d with Hausdorff dimension greater than d/2d/2 determines a set of Euclidean distances of positive Lebesgue measure.

Family 074 · Kakeya in three and four dimensions

Resolves the Kakeya maximal conjecture in three dimensions and the Hausdorff-dimension conjecture in four. In three dimensions, the radius-δ\delta tube maximal operator maps L3(R3)L^3(\mathbb R^3) to L3(S2)L^3(S^2) with norm Oε(δ−ε)O_\varepsilon(\delta^{-\varepsilon}) for every ε>0\varepsilon>0. In four dimensions, every set containing a unit segment in every direction has Hausdorff dimension four.

Family 075 · The Llog⁡LL\log L Fourier-convergence conjecture

Proves that the ordinary symmetric Fourier partial sums of every complex-valued function in Llog⁡L(T)L\log L(\mathbb T) converge almost everywhere along the full sequence. This resolves the classical sufficiency conjecture at the Llog⁡LL\log L scale.

13 · CONVEX GEOMETRY

How small can a shape–polar product be?

A filled shape is convex if the straight segment between any two of its points stays inside it. A disk and a square are convex; a crescent is not.

Now pair a convex shape with the origin strictly inside it with its polar. The polar consists of the points whose dot product with every point in the original shape is at most one.

A dot product multiplies matching coordinates and adds the results. This rule makes the two shapes respond in opposite ways.

Start with a unit disk; its polar is another unit disk. Each area is pi, so their product is pi squared. As these true polar pairs become a square and a diamond, their area product falls to eight.

The symmetric Mahler claim says this sort of minimum has a sharp formula in every dimension. Symmetric here means unchanged when every coordinate is negated. The equality shapes are called Hanner polytopes, a family that includes cubes and their polar shapes. A companion reports the corresponding result without that symmetry, where the equality shapes are triangles and their higher-dimensional relatives.

Terms introduced here

Convex
Every straight segment joining two points of the filled shape stays inside it.
Polar body
The points whose dot product with every point of the original body is at most 1.
Dot product
Multiply corresponding coordinates, then add: (a,b)·(x,y) = ax + by.
Area product
Area of the body multiplied by area of its polar.
Origin symmetry
If a point is in the body, its coordinatewise negative is too.
Scope, assumptions, and source descriptions

Symmetric bound: |K||K°| ≥ 4^n/n!, with equality at invertible linear images of Hanner polytopes. General bound at the Santaló point s(K): |K||(K−s(K))°| ≥ (n+1)^(n+1)/(n!)², with equality at simplices. The animation uses unit ℓᵖ balls and their ℓᑫ polar duals, 1/p + 1/q = 1. The area readout uses the exact gamma-function area formula and ends at the exact square/diamond product 8. The catalogue entries cited cover the symmetric result and its equality classification; the general manuscript is not listed there.

The following descriptions are reproduced from OpenAI’s catalogue. They report the authors’ claims and retain the technical scope. The film does not independently certify their proofs.

Family 087 · The Mahler conjectures and symplectic width

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≥2n\ge2, every symmetric polar product K×K∘K\times K^\circ in dimension 2n2n has Gromov width 44.

14 · Convex and metric geometry

Geometry: optimal arrangements and faithful distances

Geometry also asks whether we can change a representation without badly changing distances. In an L-one space, distance is the sum of coordinate differences in absolute value, like traveling along a rectangular street grid. Distortion measures the worst multiplicative mismatch after rescaling.

For shortest-path distances on planar graphs, the package reports an L-one representation with a distortion bound independent of graph size. Planar means the graph can be drawn without edges crossing. A related bound applies to graphs with limited branching complexity called bounded treewidth.

A second result concerns the triangular lattice, the familiar arrangement in which each point has six nearest neighbors. At fixed density, it is reported to minimize energy for a broad specified class of repulsive pair interactions, as well as the stated Coulomb and Riesz energy models. The allowed interaction class matters; this is not a claim about every possible force.

Edit distance counts the cheapest sequence of insertions, deletions, and substitutions converting one word into another. The package determines the sharp growth rate of distortion needed to represent these distances in L-one. So distances that are easy to define need not be easy to reproduce faithfully as coordinate distances.

Terms introduced here

L-one distance
Add the absolute differences of the coordinates: |x₁ − y₁| + |x₂ − y₂| + …
Bounded distortion
The representation preserves every distance within a fixed multiplicative factor after rescaling.
Energy minimization
Compare arrangements at the same density using the same pair-interaction rule.
Edit distance
The minimum number of allowed one-letter edits converting one word into another.
Scope, assumptions, and source descriptions

The following descriptions are reproduced from OpenAI’s catalogue. They report the authors’ claims and retain the technical scope. The film does not independently certify their proofs.

Family 089 · Bounded-distortion L1L_1 embeddings of planar and bounded-treewidth graphs

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 L1L_1 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.

Family 090 · Universal optimality of the triangular lattice

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<20<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.

Family 099 · The sharp distortion of edit distance into ℓ1\ell_1

Determines the least distortion of embedding edit distance on words of length at most dd into real ℓ1\ell_1: it is exp⁡(Θ(log⁡d log⁡log⁡d))\exp(\Theta(\sqrt{\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 dd; binary words already force the lower bound.

15 · THEORETICAL COMPUTER SCIENCE

How good can a quick answer be?

A graph is a collection of dots connected by lines. The dots are vertices; the lines are edges. In Max-Cut, divide the dots into two groups and count the lines that cross between them.

The optimum is the largest count any division can achieve.

For a large graph, finding the optimum can be difficult, so an approximation algorithm settles for a provably good fraction of it.

The release reports that the familiar guarantee of about eighty-seven point eight six percent cannot be improved in general by an efficient algorithm, under the assumption that P differs from NP.

Informally, that assumption says that being able to check a proposed answer efficiently does not always make it easy to find one. Here efficient means polynomial time: running time bounded by a fixed power of input size.

The release also reports the Unique Games Conjecture, a general statement about the difficulty of approximately satisfying certain systems of pairwise labeling rules. The guarantee concerns every possible input, not the fraction of edges in our example.

Terms introduced here

Graph
Vertices are dots. Edges are the connections between them.
Optimum
The largest crossing-edge count achievable by any split.
Approximation guarantee
A lower bound on how good the algorithm’s answer is relative to the best answer.
About 87.86%
The guarantee is a fraction of the optimum, not a fraction of all edges.
P versus NP
Does efficient checking always imply efficient solving? P ≠ NP says no.
Unique Games
Labeling puzzles with pairwise rules: one endpoint’s label uniquely determines the required other label.
Scope, assumptions, and source descriptions

The main paper reports Unique Games hardness; a separate paper reports direct ordinary NP-hardness of beating the Goemans–Williamson ratio for simple unweighted Max-Cut. The graph shown is an illustrative cut with an exactly counted number of crossing edges. Its displayed best cut was checked exhaustively over its 4096 vertex partitions. It is not an instance used in the reduction.

The following descriptions are reproduced from OpenAI’s catalogue. They report the authors’ claims and retain the technical scope. The film does not independently certify their proofs.

Family 102 · The Unique Games Conjecture and optimal approximation thresholds

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.

16 · THEORETICAL COMPUTER SCIENCE

What a smaller exponent changes

A matrix is a rectangular table of numbers. Multiplying matrices combines two such tables using sums of products.

For square tables with n rows, the ordinary method uses roughly n cubed arithmetic operations. That exponent of three tells us how work grows: doubling n multiplies a pure cubic count by eight.

The release reports a multiplication exponent at most two point two five, for complex-number entries. Complex numbers are the two-coordinate numbers introduced in the zeta chapter. A pure two-point-two-five power grows by about four point seven six when n doubles.

The precise theorem allows any fixed positive extra amount in the exponent. That small allowance is usually called epsilon.

The result is asymptotic, meaning it describes growth for sufficiently large matrices. Hidden constants still matter, so it does not by itself establish a faster program on today's hardware.

Terms introduced here

Matrix
A rectangular table of numbers.
Exponent
The power of n controlling the growth of the arithmetic count.
Exponent at most 2.25
The precise bound allows n raised to 2.25 plus any fixed positive extra amount.
Epsilon ε
A positive allowance, however small, fixed before matrix size grows.
Asymptotic
About growth as the problem size becomes sufficiently large.
Scope, assumptions, and source descriptions

The exponent ω over the complex numbers is reported to be ≤ 9/4. The displayed O(n^(2.25+ε)) statement is for every fixed positive ε. This is an arithmetic-operation asymptotic and does not report a measured implementation speedup. The illustrative doubling comparison is 2³=8 versus 2^2.25≈4.7568; it omits constants and ε. The displayed 2×2 numerical product is exact.

The following descriptions are reproduced from OpenAI’s catalogue. They report the authors’ claims and retain the technical scope. The film does not independently certify their proofs.

Family 107 · Matrix multiplication with exponent at most 9/49/4

Proves ω≤9/4\omega\le9/4 over C\mathbb C, giving Oε(n9/4+ε)O_\varepsilon(n^{9/4+\varepsilon}) arithmetic operations for square matrix multiplication. In characteristic zero, some inner dimension nan^a with a>0.465a>0.465 permits n2+o(1)n^{2+o(1)} rectangular multiplication. Further square bounds give ω<2.258\omega<2.258 outside finitely many positive characteristics and ω<2.371054886006746\omega<2.371054886006746 over every fixed field.

17 · Theoretical computer science

Algorithms: randomness, arithmetic, and exact answers

The algorithms package includes more than matrix multiplication and approximation barriers. One result removes randomness from computations using only logarithmic working memory. Logarithmic means that doubling the input needs only a constant number of extra memory cells. The claimed conversion keeps polynomial running time. This is a precise small-memory derandomization theorem, not a solution of every question about randomness in computation.

For multiplication of n-bit integers, another result improves on n times log n in the standard multitape computation model. The exponent improvement is extraordinarily small, two to the minus one hundred eighty-two. It is a theoretical improvement in long-run growth, not an advertised practical speedup.

A matching is a set of graph edges that share no endpoints. The release gives a randomized algorithm finding a largest matching in almost-linear time in the graph’s input size, with the stated success probability. The answer is exact when the algorithm succeeds.

Finally, polynomials can be factored using arithmetic modulo a prime, where remainders form a finite field. The package reports a deterministic polynomial-time algorithm for this problem, including repeated factors, with the prime supplied as part of the input.

Terms introduced here

Derandomization
Replace random choices by a deterministic procedure while preserving the stated resource bounds.
Bit complexity
Count elementary operations on bits, the zeros and ones encoding the input.
Matching
A selection of edges with no shared endpoints.
Finite field
An arithmetic system with finitely many values in which every nonzero value has a multiplicative inverse.
Scope, assumptions, and source descriptions

The following descriptions are reproduced from OpenAI’s catalogue. They report the authors’ claims and retain the technical scope. The film does not independently certify their proofs.

Family 103 · Derandomization of logarithmic space: L=RL=BPL\mathsf L=\mathsf{RL}=\mathsf{BPL}

Proves L=RL=BPL\mathsf L=\mathsf{RL}=\mathsf{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.

Family 109 · Integer multiplication below nlog⁡nn\log n

Multiplies two nn-bit integers exactly at every input length in deterministic worst-case time O(n(log⁡n)1−κ)O(n(\log n)^{1-\kappa}), with κ=2−182\kappa=2^{-182}, on one fixed finite-alphabet Turing machine with finitely many one-dimensional tapes. This disproves the Schönhage–Strassen nlog⁡nn\log n optimality conjecture in the ordinary multitape bit model.

Family 120 · Almost-linear-time exact matching in general graphs

Gives a randomized algorithm finding an exact maximum-cardinality matching in any simple undirected graph in (n+m)1+o(1)(n+m)^{1+o(1)} word time, with success probability at least 2/32/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.

Family 142 · Deterministic polynomial factorization over prime fields

Gives a uniform deterministic algorithm that completely factors every nonzero dense degree-nn polynomial over a prime field Fp\mathbb F_p, including multiplicities, in bit complexity polynomial in (n+1)log⁡p(n+1)\log p. The prime is supplied in binary. No randomness, integer-factorization or primitive-root oracle, or GRH assumption is required.

18 · Dynamical systems and ergodic theory

Dynamics: repeating motion, mixing, and reactions

A dynamical system describes how a state changes with time. A limit cycle is an isolated repeating motion, pictured as a closed orbit in a phase portrait. For planar polynomial motion rules of a fixed degree, the release reports a finite bound on how many limit cycles can occur. The bound depends only on the degree. This addresses the uniform boundedness part of Hilbert’s sixteenth problem.

Mixing means that observations far apart in time become statistically independent in the limiting sense. Pairwise independence does not by itself imply independence of several observations in ordinary probability. The Rokhlin result says that for an invertible mixing probability-preserving transformation, the dynamical mixing property does extend to every finite number of widely separated observations.

Chemical reaction networks supply a concrete application. Weak reversibility means that a directed reaction can be followed by a path of reactions returning to its starting combination of species. For finite mass-action networks of this kind with fixed positive rate constants, the package reports permanence. Every positive trajectory eventually stays within common positive lower and finite upper concentration bounds in its conservation class. This does not require convergence to a single equilibrium.

Terms introduced here

Limit cycle
An isolated periodic orbit: a repeating trajectory separated from other repeating trajectories.
Mixing
Long time separation makes the relevant correlations approach products of probabilities.
Permanence
After enough time, all concentrations stay bounded away from both zero and infinity, within the stated class.
Scope, assumptions, and source descriptions

The following descriptions are reproduced from OpenAI’s catalogue. They report the authors’ claims and retain the technical scope. The film does not independently certify their proofs.

Family 143 · Uniform limit-cycle bounds in Hilbert's sixteenth problem

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.

Family 145 · Rokhlin's multiple-mixing problem

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

Family 149 · Permanence for weakly reversible reaction networks

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.

19 · COMBINATORICS

When numbers must contain patterns

Seven, fourteen, twenty-one, twenty-eight: the gap is always seven. A sequence with constant spacing is called an arithmetic progression.

Now take an infinite set of positive integers. Replace each number by its reciprocal, meaning one divided by that number, and add them up.

A divergent sum means the running total grows without bound. Erdos conjectured that this condition forces progressions of every finite length. The release reports a proof.

A separate result concerns a sequence of plus and minus signs called the Liouville function. Factor a number into primes, counting repeats: twelve is two times two times three. An odd count gives minus one; an even count gives plus one.

The reported two-point Chowla result says that, for any fixed positive spacing, multiplying pairs of signs and averaging gives a value tending to zero. This is a precise kind of cancellation, not a claim that the signs are literally random.

Terms introduced here

Arithmetic progression
A sequence with the same gap between consecutive terms.
Reciprocal
One divided by the number: the reciprocal of 7 is 1/7.
Divergent reciprocal sum
Its positive partial totals grow without bound.
Liouville function
+1 for an even number of prime factors; −1 for an odd number, counting repeats.
Two-point correlation
Multiply signs a fixed distance apart, then average those products.
Scope, assumptions, and source descriptions

The reciprocal-sum result concerns infinite sets of positive integers and progressions of every fixed finite length. The number line is an example, not a proof. The displayed Liouville values and their one-step shift are computed by counting prime factors with multiplicity. The Chowla statement concerns ordinary, not merely logarithmically averaged, two-point Liouville correlations along fixed nonproportional affine forms.

The following descriptions are reproduced from OpenAI’s catalogue. They report the authors’ claims and retain the technical scope. The film does not independently certify their proofs.

Family 159 · Erdős's reciprocal-sum conjecture and quasipolynomial Szemerédi bounds

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≥3k\ge3, every subset of {1,…,N}\{1,\ldots,N\} with no nonconstant kk-term progression has size at most CkNexp⁡[−ck(log⁡N)εk]C_kN\exp[-c_k(\log N)^{\varepsilon_k}], with positive constants depending only on kk.

Family 007 · Two-point Chowla and the corrected binary Elliott conjecture

Proves the ordinary two-point Chowla conjecture, with a bound O(X/(log⁡X)c)O(X/(\log X)^c) for Liouville correlation sums along fixed nonproportional affine forms, where c>0c>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 nitn^{it} for ∣t∣≤X|t|\le X.

20 · Combinatorics

Combinatorics: coloring, tiling, and graph structure

Combinatorics often begins with pictures that are easy to state and hard to settle. Color every point of the plane so that points exactly one unit apart have different colors. The package reports that five colors cannot suffice. Since a seven-color construction is already known, the answer is narrowed to six or seven, not determined exactly.

A translational tile covers space using shifted copies without overlaps or gaps. A new three-dimensional tile is reported to cover space, but never in a fully periodic pattern. Another construction in nine dimensions disproves Borsuk’s proposal that every bounded set can be covered by ten smaller-diameter pieces. Diameter is the largest distance between two points of a set.

Graphs have surprises too. Sidorenko’s conjecture predicted that every bipartite pattern appears at least as often as in a random graph of the same edge density. Bipartite means the vertices split into two sets with all edges crossing between them. The reported counterexample has thirty-five vertices and sixty-six edges.

Finally, the crossing-number family determines the minimum possible number of edge crossings for every complete graph and every complete bipartite graph. A complete graph connects every pair of vertices. The result optimizes over drawings, rather than merely counting crossings in one chosen picture.

Terms introduced here

Unit-distance coloring
Points at distance exactly 1 must receive different colors.
Counterexample
A specific construction for which the proposed universal rule fails.
Bipartite graph
Its vertices split into two classes, with every edge joining different classes.
Crossing number
The smallest possible number of edge crossings among all allowed plane drawings of a graph.
Scope, assumptions, and source descriptions

The following descriptions are reproduced from OpenAI’s catalogue. They report the authors’ claims and retain the technical scope. The film does not independently certify their proofs.

Family 155 · A counterexample to periodic tiling in dimension three

Constructs a finite translational tile in Z3\mathbb Z^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 R3\mathbb R^3, even with arbitrary real translation vectors.

Family 156 · Borsuk's conjecture fails in dimension nine

Constructs a compact subset of R9\mathbb R^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 R4\mathbb R^4, with the Frobenius metric.

Family 158 · The Euclidean plane cannot be colored with five colors

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.

Family 161 · Counterexamples to Sidorenko's conjecture and the forcing conjecture

Disproves Sidorenko's conjecture with a connected bipartite pattern on 3535 vertices and 6666 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.

Family 165 · Exact crossing numbers of complete and complete bipartite graphs

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.

21 · ALGEBRA / GROUP THEORY

Can reversing multiplication break an inverse?

With ordinary numbers, multiplication can undo multiplication: two times one half equals one in either order. Other algebraic systems need not behave like ordinary numbers.

A group describes reversible operations that can be combined, such as rotations.

A group algebra lets us add weighted combinations of group elements and multiply those combinations using the group's rules. Kaplansky's conjecture asked: in every group algebra, if A times B equals one, must B times A also equal one? The release reports a counterexample, an explicit construction showing the answer can be no.

It uses characteristic two, arithmetic in which one plus one equals zero.

A companion construction supplies a short way to see the failure: A times C equals zero, although C is not zero. If B times A were one, multiplying those identities would force C to be zero, a contradiction. The difficult part is constructing a group algebra where these relations really hold.

Terms introduced here

Multiplicative inverse
A partner that multiplies with an element to give 1, the multiplicative identity.
Group
A system of reversible operations. They can be combined, and each can be undone.
Group algebra
Add weighted group elements. Multiply by distributing, then combining the group operations.
Direct finiteness
The property that ab = 1 always forces ba = 1.
Characteristic two
Adding 1 to itself gives 0.
Certificate of failure
ab = 1, ac = 0, and c ≠ 0 rule out ba = 1.
Scope, assumptions, and source descriptions

The September characteristic-two construction uses a finite field K, a finitely presented group G and elements a,b in K[G] with ab = 1 and ba ≠ 1. The October companion gives a finitely presented torsion-free counterexample over F₂. The listed Lean artifact is associated with the September construction. The animation shows the companion’s algebraic certificate: ab=1, ac=0 and c≠0 force ba≠1. It does not display the actual group presentation.

The following descriptions are reproduced from OpenAI’s catalogue. They report the authors’ claims and retain the technical scope. The film does not independently certify their proofs.

Family 197 · Nonsofic groups and group-ring counterexamples

Constructs a finitely presented torsion-free nonsofic group whose group algebra over F2\mathbb F_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.

22 · Algebra

Algebra: which familiar rules survive?

Algebra studies systems in which we can add and multiply, including ones very different from ordinary numbers. An intersection multiplicity counts how geometric pieces meet, with weights for tangency and other complications. Serre’s result establishes the predicted strict positivity under the precise complementary-dimension and finite-intersection hypotheses, for the full class stated in the catalogue.

A zero divisor is a nonzero element that multiplies another nonzero element to zero. Ordinary real numbers have none, but matrices can. The package constructs them in a group algebra where Kaplansky’s conjecture predicted they could not occur. The group has no nonidentity element of finite order, so that familiar source of zero divisors is absent.

Other counterexamples concern resolutions: ways of analyzing an algebraic object through successive equations and relations. The little finitistic-dimension conjecture predicted a common upper bound on the lengths of the finite resolutions for a fixed finite-dimensional algebra. The reported example has finite lengths with no common bound. A separate family defeats several related structural conjectures, including Auslander–Reiten and Nakayama. Their exact statements are preserved in the catalogue.

Terms introduced here

Intersection multiplicity
A weighted algebraic count of an intersection, which includes more information than simply counting visible points.
Zero divisor
A nonzero element a for which ab = 0 for some nonzero b.
Resolution length
Count the stages needed to describe an algebraic object through successive equations and relations.
Scope, assumptions, and source descriptions

The following descriptions are reproduced from OpenAI’s catalogue. They report the authors’ claims and retain the technical scope. The film does not independently certify their proofs.

Family 193 · Serre's intersection-multiplicity conjecture

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

Family 196 · A counterexample to Kaplansky's zero-divisor conjecture

Constructs a finitely presented torsion-free group GG whose group algebra F2[G]\mathbb F_2[G] has nonzero zero divisors, disproving Kaplansky's zero-divisor conjecture. The group has a finite two-dimensional classifying space.

Family 198 · A counterexample to the little finitistic-dimension conjecture

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

Family 199 · Counterexamples to conjectures of Auslander–Reiten, Tachikawa, and Nakayama

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.

23 · Probability and statistical mechanics

Probability: large random systems and their limits

Probability asks what becomes predictable when a system has many random parts. In percolation, connections are independently open or closed. An open cluster consists of points joined by open connections. The release reports that at the critical probability, no infinite cluster exists for the stated broad class of symmetric infinite graphs, and for both standard bond and site percolation on the three-dimensional cubic lattice.

Random planar maps are random networks drawn on a surface. One family reports a surface-to-tree transition in their large-size geometry as a model parameter crosses four. It also connects random walks on selected maps to motion on the limiting random surface.

Universality means that different microscopic rules can produce the same large-scale law. The Ising family studies two-state magnetic models. It reports that specified weak interactions and small random changes in interactions preserve the stated critical limits. The perceptron family, involving randomly constrained simple learning models, gives formulas for free energy, which balances energy and available arrangements, and results about the threshold where satisfying all constraints becomes impossible.

Random satisfiability asks when randomly generated true-or-false requirements stop being jointly satisfiable. A clause is a requirement such as A or not B or C; its size is the number of variables. For each fixed size at least three, the package reports a sharp limiting threshold and additional fluctuation results. It also reports computability of the three-SAT threshold. The paper explicitly credits Gaia Carenini with priority for threshold existence in concurrent work; its contributions include another proof and sharper variance and computability conclusions.

Terms introduced here

Critical probability
The transition value for the appearance of an infinite open cluster.
Scaling limit
A large-system limit obtained while rescaling distances, time, or other quantities.
Universality
Different small-scale models share the same limiting behavior under the stated conditions.
Satisfiability threshold
The limiting transition between constraints that can all be satisfied and constraints that cannot.
Scope, assumptions, and source descriptions

The following descriptions are reproduced from OpenAI’s catalogue. They report the authors’ claims and retain the technical scope. The film does not independently certify their proofs.

Family 211 · Geometry, diffusion, and spectra of random planar maps

Critical Fortuin–Kasteleyn planar maps converge to Liouville quantum gravity spheres for 0<q≤40<q\le4 and to the Brownian continuum random tree for q>4q>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.

Family 213 · No infinite critical clusters on quasi-transitive graphs

Resolves the Benjamini–Schramm criticality conjecture for bond percolation on every infinite connected locally finite quasi-transitive graph with pc<1p_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 Z3\mathbb Z^3.

Family 218 · Conformal universality for weakly interacting and disordered Ising models

Weak finite-range square-symmetric even multispin perturbations of the square-lattice Ising model preserve critical bulk spin and energy limits; weak square-symmetric contour interactions also yield chordal SLE3\mathrm{SLE}_3 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.

Family 222 · Perceptron free energies and microscopic jamming

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-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.

Family 235 · Random-SAT thresholds, sharp variance and computability

For random kk-SAT with independent uniformly signed proper clauses sampled with replacement, proves finite positive limiting thresholds and hitting-time variance Θk(n)\Theta_k(n) for every fixed k≥3k\ge3, 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.

24 · Mathematical logic

Logic: models, computation, and choice

Logic studies what formal rules can describe and what they force to be true. A mathematical theory can have many models, meaning structures that satisfy its rules. Categoricity means there is only one kind of model of a specified size, up to a structure-preserving match. The Shelah family reports that, for the stated class of theories, uniqueness at one sufficiently large size forces uniqueness at every larger size beyond a uniform threshold.

Turing degrees group computational problems by their power: two problems have the same degree if each can be solved using a solver for the other. Degrees are ordered by which problems can help solve which others. The release reports rigidity: no nontrivial relabeling preserves that entire order.

Another result turns any computably enumerable set into a polynomial equation whose auxiliary solution is unique for each member of the set, and absent for nonmembers. Computably enumerable means a program can list the members, without necessarily deciding every nonmember. Even with at most one solution promised, deciding existence can remain impossible.

Finally, the axiom of choice allows one selection from each set in an arbitrary collection of nonempty sets. A reported model of set theory satisfies a weaker principle comparing the sizes of sets and their images, while choice still fails. This is a relative consistency result, assuming the stated underlying set theory is consistent.

Terms introduced here

Categoricity
All models of the specified size are equivalent through a structure-preserving match.
Turing degree
A level of computational power, defined by mutual ability to solve problems using each other as an oracle.
Unique witness
Membership is represented by exactly one auxiliary solution, and nonmembership by none.
Relative consistency
If the starting axioms are consistent, a model with the claimed combination of properties can be built.
Scope, assumptions, and source descriptions

The following descriptions are reproduced from OpenAI’s catalogue. They report the authors’ claims and retain the technical scope. The film does not independently certify their proofs.

Family 240 · Shelah's eventual categoricity conjecture

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.

Family 241 · Rigidity of the Turing degrees

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.

Family 242 · Single-fold Diophantine representations

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.

Family 244 · The partition principle does not imply choice

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.

25 · Group theory

Groups: local rules, infinite structures, and geometry

Recall that a group describes reversible moves. A finite presentation gives finitely many basic moves and finitely many relations, yet the resulting group can have infinitely many elements. One construction in the package is infinite even though every element eventually repeats after a power-of-two number of repetitions. It is also residually finite: distinct elements can be distinguished in suitable finite group models.

Groups can also have geometry. For a hyperbolic group, large triangles in its move graph are thin: each side stays near the other two. The boundary records directions toward infinity. Cannon’s conjecture says that if this boundary is a two-dimensional sphere, the group should act as geometric symmetries of hyperbolic three-space. The package reports that conclusion, including the stated compactness and finite-kernel conditions.

Amenability asks whether a group admits averaging compatible with its moves. For a finitely generated group, one can test whether large finite pieces can have arbitrarily small boundary relative to their size. The package reports that Thompson’s group F is nonamenable. This group is built from particular piecewise linear rearrangements of an interval.

Terms introduced here

Finite presentation
A finite list of generators and relations describing a group, which can still be infinite.
Boundary at infinity
An ideal collection of directions in which paths can escape indefinitely.
Amenability
For finitely generated groups, large finite pieces can have boundary-to-size ratio as small as desired.
Scope, assumptions, and source descriptions

The following descriptions are reproduced from OpenAI’s catalogue. They report the authors’ claims and retain the technical scope. The film does not independently certify their proofs.

Family 246 · Cannon's conjecture

Every word-hyperbolic group with boundary homeomorphic to S2S^2 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.

Family 247 · An infinite finitely presented residually finite 22-group

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

Family 248 · Thompson's group FF is nonamenable

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

26 · Mathematical physics

Relativity: mass, trapped regions, and predictability

Mathematical physics includes claims about spacetime itself. A trapped region is one where even outward-moving light fails to expand in the usual way. The Penrose inequality connects the area needed to enclose such a region with the total mass measured far away. In three spatial dimensions, the familiar geometric-units form compares mass with the square root of area divided by sixteen pi.

The release reports an enclosing-area spacetime version in every spatial dimension at least three, under the stated energy and decay assumptions, together with equality statements and charged extensions. These are mathematical statements about specified initial data, not measurements of astronomical black holes.

Strong cosmic censorship concerns whether the evolution determined by initial data can be extended beyond the region where prediction is unique. A separate result addresses generic data near a fixed rotating, subextremal Kerr configuration with two asymptotically flat ends. It rules out extensions in a specified weak regularity class. Both the neighborhood restriction and the exact meaning of an allowed extension are essential.

Terms introduced here

Penrose inequality
A lower bound on mass in terms of the minimum area enclosing a trapped region, under precise geometric conditions.
Initial data
A starting spatial geometry, its rate of change, and matter or field information satisfying the required constraints.
Strong cosmic censorship
A question about whether physically admissible spacetime evolution can continue past the region determined by initial data.
Scope, assumptions, and source descriptions

The following descriptions are reproduced from OpenAI’s catalogue. They report the authors’ claims and retain the technical scope. The film does not independently certify their proofs.

Family 260 · Spacetime Penrose inequalities and rigidity

Proves the sharp enclosing-area spacetime Penrose inequality for smooth one-ended asymptotically flat initial data in every spatial dimension n≥3n\ge3, 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.

Family 264 · Strong cosmic censorship near two-ended Kerr data

Proves local strong cosmic censorship near each fixed rotating subextremal Kerr bridge. A dense GδG_\delta 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.

27 · Mathematical physics

Quantum matter: gaps, entanglement, and condensation

A ground state is a quantum system’s lowest-energy state. An energy gap separates it from the next allowed energy. A uniform gap stays positive as the system grows. The package reports such a gap for the spin-one antiferromagnetic Heisenberg chain on even periodic rings. Antiferromagnetic means neighboring spins favor opposite alignment.

A second gap result concerns the specified Laughlin model at one-third filling on a sphere, with stability under sufficiently weak scalar disorder. Filling describes the fraction of available magnetic states occupied by particles. The claim is for the stated idealized interaction, not every model of the fractional quantum Hall effect.

Entanglement entropy measures quantum entanglement between a region and the rest of a pure state. For the stated two-dimensional systems with a unique uniformly gapped ground state, an area law bounds this entropy by a constant times boundary length. The same family gives controlled approximations that can represent these states more economically.

Bose–Einstein condensation means that a macroscopic fraction of particles occupy the same quantum state. Another family reports condensation at a strictly positive temperature in a dilute three-dimensional hard-sphere gas, and a zero-temperature formula for quantum depletion, the fraction pushed out of that state by interactions.

Terms introduced here

Uniform energy gap
The separation above the lowest energy stays bounded away from zero as the system size grows.
Filling fraction
A ratio comparing particle number with the number of available magnetic states.
Area law in two dimensions
Entanglement is bounded in proportion to a region’s boundary length, under the stated gap and interaction assumptions.
Bose–Einstein condensation
A nonvanishing fraction of all particles occupy one quantum state in the large-system limit.
Scope, assumptions, and source descriptions

The following descriptions are reproduced from OpenAI’s catalogue. They report the authors’ claims and retain the technical scope. The film does not independently certify their proofs.

Family 265 · The two-dimensional gapped area law

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×LL\times 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−1L^{-1}.

Family 267 · Positive-temperature Bose–Einstein condensation and quantum depletion

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

Family 268 · The spin-one Haldane gap

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

Family 269 · The Laughlin gap and stability under scalar disorder

Proves the fermionic Laughlin spectral-gap conjecture for the full V1V_1 interaction at filling 1/31/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.

28 · MATHEMATICAL PHYSICS

From local spins to collective laws

Spin is a quantum property that makes particles behave, in some respects, like tiny magnets.

In a spin glass, some interactions favor alignment and others oppose it. These competing preferences can create many different arrangements.

Diluted means each spin interacts with only a finite average number of others.

Free energy balances energy against how many arrangements are available at a given temperature. The release reports the Mezard-Parisi formula for that quantity in a specified class of diluted spin glasses.

Now consider a different model, a quantum Heisenberg ferromagnet, where the interactions favor magnetic alignment.

Magnetization measures the resulting net magnetic moment. As the temperature rises slightly above zero, that magnetization decreases.

The reported Bloch law says the decrease is proportional to temperature to the three-halves power, with the exact multiplier determined by the interactions. The arrows are explanatory pictures of these quantum systems, not literal rotating magnets or a numerical simulation.

Terms introduced here

Spin
A quantum property that can make particles behave like tiny magnets.
Spin glass
A disordered spin system with interactions that can favor conflicting alignments.
Diluted
Each spin interacts with a finite average number of other spins.
Free energy
A quantity balancing energy and how many arrangements are available at a given temperature.
Ferromagnet
A system whose interactions favor magnetic alignment.
Magnetization
The net magnetic effect per unit size, after adding the individual magnetic moments.
Three-halves power
T^(3/2) = T × √T. The theorem also specifies the multiplier.
Scope, assumptions, and source descriptions

The Mézard–Parisi claim is restricted to diluted even-arity Ising models satisfying the Panchenko–Talagrand factorization and positivity assumptions, with first-moment integrability. The Bloch law concerns 3D quantum Heisenberg ferromagnets, fixed positive quantum spin, nonnegative symmetric finite-range couplings whose support generates Z³, with the stated order of limits. The drawn arrows and normalized low-temperature curve are illustrations, not computed solutions of these models.

The following descriptions are reproduced from OpenAI’s catalogue. They report the authors’ claims and retain the technical scope. The film does not independently certify their proofs.

Family 221 · The Mézard–Parisi formula for diluted spin glasses

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

Family 271 · Bloch's law and spontaneous ferromagnetic order

Proves Bloch's T3/2T^{3/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 Z3\mathbb Z^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≥3d\ge3 and determines the first lattice correction for three-dimensional nearest-neighbor couplings.

29 · OPERATOR ALGEBRAS

Different groups, matching operator systems

A generator is a basic move from which more complicated moves are built.

In a free group, there are no extra relations between those moves: a move cancels its inverse, but otherwise different reduced sequences stay different.

Two generators and three generators give different groups, illustrated by these branching trees.

Now change the object we study. Think of a matrix as a rule that transforms a vector. An operator extends this idea to spaces that can have infinitely many coordinates. Bounded means an operator cannot stretch a vector by an arbitrarily large factor.

A von Neumann algebra is a collection of these operators that also contains the results of the relevant arithmetic operations and limits. Certain basic building blocks of these systems are called factors.

The release reports that the factors built from two and three free generators are isomorphic. Isomorphic means there is a one-to-one correspondence preserving their mathematical structure. So the groups differ, but the operator systems constructed from them are reported to be the same kind of object. Established results then extend this to a larger family of factors.

Terms introduced here

Generator
A basic group element from which other elements are made using products and inverses.
Free group
Reduced words stay distinct; a letter cancels its adjacent inverse.
Two versus three generators
The associated free groups have different structures.
Operator
A linear rule acting on vectors, possibly in a space with infinitely many coordinates.
Von Neumann algebra
A collection of vector transformations that also contains the relevant combinations and limits.
Isomorphic
Related by a one-to-one correspondence preserving the mathematical structure.
Scope, assumptions, and source descriptions

The reported isomorphism is between the tracial von Neumann algebras L(F₂) and L(F₃), not between the free groups F₂ and F₃. The consequence for all interpolated factors uses the classical free group factor alternative. Drawings are finite tree fragments illustrating the different generator counts.

The following descriptions are reproduced from OpenAI’s catalogue. They report the authors’ claims and retain the technical scope. The film does not independently certify their proofs.

Family 287 · All nonabelian free group factors are isomorphic

Resolves the free group factor isomorphism problem: L(F2)≅L(F3)L(\mathbb F_2)\cong L(\mathbb F_3), and hence all interpolated free group factors, including L(F∞)L(\mathbb F_\infty), are isomorphic. Their common factor has fundamental group R>0\mathbb R_{>0}.

30 · Operator algebras

Operator algebras: representations and building blocks

After the free-group-factor result, the operator-algebra catalogue continues in several directions. A representation realizes an abstract algebra as transformations of a vector space. Kadison’s similarity conjecture asks whether a bounded representation can be adjusted by a change of coordinates so that it also respects the adjoint operation, the analogue of a matrix’s conjugate transpose. The package reports that it can, under the exact complex-linear and identity-preserving assumptions.

The generator problem asks how many transformations are needed to build an entire operator algebra using its allowed operations and limits. The release reports that every type two-one factor with separable predual can be generated by one operator. The technical class is specified in the notes; the point is a single generating transformation for this broad class of infinite systems.

There are counterexamples too. An invariant subspace stays inside itself under a transformation. Hyperinvariant means it stays inside itself under every transformation commuting with that operator. The package constructs an operator with no nontrivial closed hyperinvariant subspace. This is a stronger preservation requirement than ordinary invariance, so the distinction matters.

Terms introduced here

Similarity
Change coordinates by an invertible transformation: A becomes S A S⁻¹.
Generator of an algebra
An element from which the whole algebra is obtained using its permitted operations and limits.
Hyperinvariant subspace
A subspace preserved by every operator that commutes with the chosen operator.
Scope, assumptions, and source descriptions

The following descriptions are reproduced from OpenAI’s catalogue. They report the authors’ claims and retain the technical scope. The film does not independently certify their proofs.

Family 288 · Kadison's similarity conjecture

Proves Kadison's similarity conjecture: every bounded complex-linear unital algebra homomorphism from a unital complex C∗C^*-algebra to operators on a Hilbert space becomes a ∗*-homomorphism after conjugation by a bounded invertible operator.

Family 293 · A counterexample to the hyperinvariant-subspace problem

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\mathrm{II}_1 factor.

Family 296 · The generator problem for finite factors

Proves that every type II1\mathrm{II}_1 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⊂MP\subset M of such factors, the unitaries uu with M=W∗(P,u)M=W^*(P,u) form a dense GδG_\delta subset in the trace 22-norm topology.

31 · Topology

Topology: continuous symmetries and different kinds of sameness

Topology studies shapes through continuous changes. A manifold looks locally like ordinary Euclidean space. The Hilbert–Smith result says that a group acting continuously and faithfully on such a manifold must be a Lie group under the stated local-compactness and countability assumptions. A Lie group is a symmetry group with smoothly varying, finite-dimensional parameters.

Knot surgery removes a tube around a knot and glues it back in a specified way. The gluing slope records that choice. The cosmetic-surgery result says that two distinct slopes on a nontrivial knot in the three-sphere cannot give the same oriented three-dimensional manifold. Preserving orientation means respecting handedness.

Homotopy compares maps through continuous deformation, a weaker notion than a reversible change of coordinates. The package reports the homotopy hypothesis for the specified algebraic models of paths, paths between paths, and all higher levels. It also gives four-dimensional spaces that are homotopy equivalent but not homeomorphic, contradicting Borel rigidity in that setting. Matching the homotopy information does not force an actual homeomorphism.

Terms introduced here

Manifold
A space that looks like ordinary Euclidean space in a sufficiently small neighborhood of every point.
Knot surgery
Remove a tubular neighborhood of a knot, then reglue it with a chosen boundary identification.
Homeomorphism versus homotopy
A homeomorphism is a reversible continuous map. Homotopy equivalence permits inverse maps only up to continuous deformation.
Scope, assumptions, and source descriptions

The following descriptions are reproduced from OpenAI’s catalogue. They report the authors’ claims and retain the technical scope. The film does not independently certify their proofs.

Family 304 · The Hilbert–Smith conjecture in every dimension

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.

Family 306 · The purely cosmetic surgery conjecture for knots in S3S^3

Distinct Dehn surgery slopes on a nontrivial smooth knot in S3S^3 never produce orientation-preservingly homeomorphic manifolds, proving the purely cosmetic surgery conjecture. The statement includes the meridional slope.

Family 312 · The Grothendieck homotopy hypothesis

Proves the Grothendieck homotopy hypothesis for ∞\infty-groupoids associated with every Grothendieck coherator in the Ara–Henry convention: these algebraic objects recover the homotopy theory of spaces.

Family 320 · A four-dimensional counterexample to Borel rigidity

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.

32 · Functional analysis

Functional analysis: geometry of spaces of functions

Functional analysis treats functions, sequences, and vectors as points in a space. A norm assigns a length, and a Banach space is complete: sequences whose terms eventually become arbitrarily close have limits in the space. Tingley asks whether knowing the distances on the unit sphere determines the whole space. The reported answer is yes: every onto distance-preserving map between real Banach unit spheres extends uniquely to a linear distance-preserving map of the spaces.

The Crouzeix result bounds how strongly a polynomial of an operator can stretch vectors by testing that polynomial on a particular region of the complex plane called the numerical range. The sharp multiplier is two, also for the more general matrix-valued version in the paper. The numerical range consists of inner-product measurements of the operator along unit vectors.

A nonexpansive map never increases distances. A fixed point is a point it leaves unchanged. The package reports a fixed-point theorem for such maps on nonempty closed bounded convex subsets of real reflexive Banach spaces. Reflexivity is a compactness-related condition on the space; it is a substantive assumption, not a property of every Banach space.

Terms introduced here

Banach space
A normed vector space containing the limit of every sequence whose terms become arbitrarily close to one another.
Operator norm
The largest factor by which an operator can stretch a unit vector.
Fixed point
A point x satisfying T(x) = x. A nonexpansive T never increases the distance between two points.
Scope, assumptions, and source descriptions

The following descriptions are reproduced from OpenAI’s catalogue. They report the authors’ claims and retain the technical scope. The film does not independently certify their proofs.

Family 322 · Tingley's sphere-isometry problem

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.

Family 325 · The complete Crouzeix conjecture

Resolves the complete Crouzeix conjecture: for every bounded operator AA on a complex Hilbert space and every finite matrix-valued polynomial PP, one has ∥P[A]∥≤2sup⁡z∈W(A)∥P(z)∥\lVert P[A]\rVert\le2\sup_{z\in W(A)}\lVert P(z)\rVert, where W(A)W(A) is the numerical range. The constant 22 is sharp, independent of the matrix size, and valid in infinite dimensions.

Family 328 · Fixed points of nonexpansive maps in reflexive Banach spaces

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.

33 · Differential geometry

Differential geometry: distances, curvature, and closed paths

A surface metric specifies infinitesimal distances measured within the surface. An isometric immersion realizes those distances in an ambient space, while allowing the image to cross itself. The package reports that every closed smooth surface metric can be realized smoothly in four-dimensional Euclidean space. A separate construction gives a smooth metric that cannot be realized even locally in three-dimensional Euclidean space. The extra dimension changes what is possible.

Isoperimetry compares a region’s volume with the size of its boundary. In the flat plane, the circle encloses a given area using the least perimeter. The reported Cartan–Hadamard result extends the sharp comparison to every dimension for the stated complete, simply connected spaces with nonpositive curvature, along with generalized filling inequalities.

A geodesic is a path that is locally straight according to the surface’s own geometry. A closed geodesic returns to its starting point and direction. The package reports infinitely many geometrically distinct closed geodesics for every smooth metric on every sphere of dimension at least two, and on every closed three-manifold. Distinct means different paths, not merely repeated trips around one loop.

Terms introduced here

Isometric immersion
A smooth realization preserving lengths of tangent vectors, while allowing self-intersections.
Isoperimetric inequality
A lower bound on boundary size for a region of given volume.
Closed geodesic
A locally straight path that closes up smoothly. Distinct images are different geometric paths.
Scope, assumptions, and source descriptions

The following descriptions are reproduced from OpenAI’s catalogue. They report the authors’ claims and retain the technical scope. The film does not independently certify their proofs.

Family 333 · Smooth isometric immersions of surfaces into R4\mathbb R^4

Every closed smooth Riemannian surface admits a smooth isometric immersion into R4\mathbb R^4, resolving the closed-surface form of the four-dimensional isometric-immersion problem. This includes nonorientable surfaces and metrics of arbitrary Gaussian curvature.

Family 334 · A smooth surface metric with no local immersion in R3\mathbb R^3

Constructs a smooth positive-definite metric on (−1,1)2(-1,1)^2 for which no neighborhood of the origin admits a smooth isometric immersion into R3\mathbb R^3. This answers the unrestricted smooth local isometric realization problem for surfaces negatively, even after shrinking the neighborhood.

Family 337 · Cartan–Hadamard isoperimetry and CAT(0)(0) fillings

Proves generalized Cartan–Hadamard isoperimetry in every dimension: in a complete simply connected manifold with sectional curvature at most κ≤0\kappa\le0, every finite-volume finite-perimeter set satisfies the sharp comparison with the equal-volume model ball. Bounded positive-volume equality regions for κ=0\kappa=0 are Euclidean balls. Also proves sharp Euclidean filling bounds for compactly supported integral nn-cycles, n≥2n\ge2, in arbitrary proper CAT(0)(0) spaces.

Family 345 · Infinitely many closed geodesics on spheres and three-manifolds

Proves that every smooth Riemannian metric on SnS^n, n≥2n\ge2, 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.

34 · PARTIAL DIFFERENTIAL EQUATIONS

Can the equations for a plasma keep working?

A plasma is matter containing freely moving charged particles. Their charges and motion produce electric and magnetic fields, which in turn affect the particles. The relativistic Vlasov-Maxwell equations model this feedback while respecting the speed limit of special relativity.

Rather than tracking each individual particle, they describe a distribution: how much particle density occupies different positions and momenta.

Momentum measures motion and, at low speeds, equals mass times velocity.

The mathematical question is whether an initially smooth distribution can develop a singularity: a breakdown of the smooth solution.

The release reports that, for its three-dimensional, one-species model, every allowed smooth starting state has a unique solution that stays smooth for all finite times.

One species means one kind of particle. The theorem allows large initial states, but still imposes precise conditions on the cloud and fields. Those conditions are listed in the guide. The moving dots illustrate the feedback; they do not prove the theorem.

Terms introduced here

Plasma
Matter containing freely moving charged particles.
Distribution
Particle density as a function of position and momentum.
Momentum
A measure of motion; at low speeds, mass multiplied by velocity.
Singularity
A failure of the smooth solution, for example through uncontrolled growth of derivatives.
Existence and uniqueness
A solution exists, and the same initial state determines only one solution.
One species
One kind of charged particle. The full starting-state conditions are in the guide.
Scope, assumptions, and source descriptions

The theorem is for the 3D one-species relativistic Vlasov–Maxwell system. Initial particle density is compactly supported; fields have finite energy and bounded derivatives of every order; smooth admissible data are required. There is no smallness or symmetry restriction. The trajectories in the video are analytic illustration paths, not an RVM solver.

The following descriptions are reproduced from OpenAI’s catalogue. They report the authors’ claims and retain the technical scope. The film does not independently certify their proofs.

Family 362 · Global smoothness for relativistic Vlasov–Maxwell

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.

35 · Partial differential equations

Differential equations: uniqueness, patterns, and computation

Differential equations relate a system to how it changes. The plasma theorem gave a global smooth evolution. Other equations in the package behave differently. For the stated periodic hard-sphere Boltzmann model of a gas, two different entropy solutions can start from the same density while both exactly conserve mass, momentum, and kinetic energy locally. These are solutions in a weaker regularity class, so this does not contradict uniqueness theorems for smooth solutions.

The hot-spots result concerns the slowest nonconstant mode of heat diffusion in a smooth bounded planar region with insulating boundary and no holes. Its hottest and coldest values must occur on the boundary. This is a statement about that eigenmode, not every arbitrary temperature pattern at every time.

De Giorgi concerns transition layers between two phases. The package reports that a bounded solution in eight dimensions, strictly increasing in one direction and satisfying the stated equation, must depend on just one linear coordinate. Its layers are therefore planar.

Finally, specially forced viscous Navier–Stokes flows are reported to perform universal computation. A prescribed particle reaches a target region exactly when the encoded computer program halts. The external forcing is part of the construction. This is a result about computational power and undecidability, not a resolution of the general unforced Navier–Stokes regularity problem.

Terms introduced here

Weak solution
A solution satisfying the equations in an integrated sense, allowing less smoothness than a classical solution.
Heat eigenmode
A spatial temperature pattern whose shape stays fixed while its amplitude decays during diffusion.
One-dimensional profile
The value depends only on one linear coordinate, even when the surrounding space has many dimensions.
Universal computation
A system can simulate any computation when supplied with an appropriate encoded program and input.
Scope, assumptions, and source descriptions

The following descriptions are reproduced from OpenAI’s catalogue. They report the authors’ claims and retain the technical scope. The film does not independently certify their proofs.

Family 363 · Boltzmann nonuniqueness with exact local conservation

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 L1L^1 and satisfy exact local conservation of mass, momentum and kinetic energy.

Family 369 · The hot spots conjecture for simply connected planar domains

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.

Family 375 · De Giorgi's conjecture in dimension eight

Proves De Giorgi's conjecture at its sharp dimension-eight endpoint: every entire C2C^2 solution u:R8→(−1,1)u:\mathbb R^8\to(-1,1) of Δu=u3−u\Delta u=u^3-u that is strictly increasing in one direction depends on only one linear coordinate. A stronger theorem classifies all stable entire solutions v:R7→[−1,1]v:\mathbb R^7\to[-1,1] as constant wells or planar transitions, without an energy-growth assumption.

Family 376 · Universal computation in forced Navier–Stokes flows

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.

36 · THE COLLECTION

A fuller picture, with a route into every result

The package is a collection of positive theorems, sharper estimates, constructions, counterexamples, and connections between areas. Some claims settle a named conjecture. Others settle a restricted case, improve a bound, or depend on a companion result. Those distinctions are part of the mathematics.

Every subject has now appeared in the film. The companion page lists all three hundred seventy-two families and all seven hundred twenty-two manuscripts, with the original technical descriptions and source links. It identifies the families discussed here, includes definitions, and points to the formalization catalogue and available reasoning summaries. The next step is to examine the statements and proofs, with their assumptions visible.

Terms introduced here

Read the scope
Which objects? Which assumptions? Which conclusion? Which supporting results?
Continue exploring
Search every family, choose a subject, revisit a chapter, and follow the primary sources.
Scope, assumptions, and source descriptions

Repository README · Formalization catalogue