This article describes a formal proof of the Kepler conjecture on dense sphere packings in a combination of the HOL Light and Isabelle proof assistants. This paper constitutes the official published account of the now completed Flyspeck project.

We define, for each quasisyntomic ring R (in the sense of Bhatt et al., Publ. Math. IHES 129 (2019), 199–310), a category $\mathrm {DM}^{\mathrm {adm}}(R)$ of admissible prismatic Dieudonné crystals over R and a functor from p-divisible groups over R to $\mathrm {DM}^{\mathrm {adm}}(R)$ . We prove that this functor is an antiequivalence. Our main cohomological tool is the prismatic formalism recently developed by Bhatt and Scholze.

Let A be an $n \times n$ symmetric matrix with $(A_{i,j})_{i\leqslant j}$ independent and identically distributed according to a subgaussian distribution. We show that

$$ \begin{align*}\mathbb{P}(\sigma_{\min}(A) \leqslant \varepsilon n^{-1/2} ) \leqslant C \varepsilon + e^{-cn},\end{align*} $$

where $\sigma _{\min }(A)$ denotes the least singular value of A and the constants $C,c>0 $ depend only on the distribution of the entries of A. This result confirms the folklore conjecture on the lower tail of the least singular value of such matrices and is best possible up to the dependence of the constants on the distribution of $A_{i,j}$. Along the way, we prove that the probability that A has a repeated eigenvalue is $e^{-\Omega (n)}$, thus confirming a conjecture of Nguyen, Tao and Vu [Probab. Theory Relat. Fields 167 (2017), 777–816].

We show that a complete, two-sided, stable immersed anisotropic minimal hypersurface in $\mathbf {R}^4$ has intrinsic cubic volume growth, provided the parametric elliptic integral is $C^2$ -close to the area functional. We also obtain an interior volume upper bound for stable anisotropic minimal hypersurfaces in the unit ball. We can estimate the constants explicitly in all of our results. In particular, this paper gives an alternative proof of our recent stable Bernstein theorem for minimal hypersurfaces in $\mathbf {R}^4$ . The new proof is more closely related to techniques from the study of strictly positive scalar curvature.

We study the locally analytic vectors in the completed cohomology of modular curves and determine the eigenvectors of a rational Borel subalgebra of $\mathfrak {gl}_2(\mathbb {Q}_p)$ . As applications, we prove a classicality result for overconvergent eigenforms of weight 1 and give a new proof of the Fontaine–Mazur conjecture in the irregular case under some mild hypotheses. For an overconvergent eigenform of weight k, we show its corresponding Galois representation has Hodge–Tate–Sen weights $0,k-1$ and prove a converse result.

The aims of this paper are to answer several conjectures and questions about the multiplier spectrum of rational maps and giving new proofs of several rigidity theorems in complex dynamics by combining tools from complex and non-Archimedean dynamics.

A remarkable theorem due to McMullen asserts that, aside from the flexible Lattès family, the multiplier spectrum of periodic points determines the conjugacy class of rational maps up to finitely many choices. The proof relies on Thurston’s rigidity theorem for post-critically finite maps, in which Teichmüller theory is an essential tool. We will give a new proof of McMullen’s theorem (and therefore a new proof of Thurston’s theorem) without using quasiconformal maps or Teichmüller theory.

We show that, aside from the flexible Lattès family, the length spectrum of periodic points determines the conjugacy class of rational maps up to finitely many choices. This generalizes the aforementioned McMullen’s theorem. We will also prove a rigidity theorem for marked length spectrum. Similar ideas also yield a simple proof of a rigidity theorem due to Zdunik.

We show that a rational map is exceptional if and only if one of the following holds: (i) the multipliers of periodic points are contained in the integer ring of an imaginary quadratic field, and (ii) all but finitely many periodic points have the same Lyapunov exponent. This solves two conjectures of Milnor.

Define the Collatz map ${\operatorname {Col}} \colon \mathbb {N}+1 \to \mathbb {N}+1$ on the positive integers $\mathbb {N}+1 = \{1,2,3,\dots \}$ by setting ${\operatorname {Col}}(N)$ equal to $3N+1$ when N is odd and $N/2$ when N is even, and let ${\operatorname {Col}}_{\min }(N) := \inf _{n \in \mathbb {N}} {\operatorname {Col}}^n(N)$ denote the minimal element of the Collatz orbit $N, {\operatorname {Col}}(N), {\operatorname {Col}}^2(N), \dots $ . The infamous Collatz conjecture asserts that ${\operatorname {Col}}_{\min }(N)=1$ for all $N \in \mathbb {N}+1$ . Previously, it was shown by Korec that for any $\theta> \frac {\log 3}{\log 4} \approx 0.7924$ , one has ${\operatorname {Col}}_{\min }(N) \leq N^\theta $ for almost all $N \in \mathbb {N}+1$ (in the sense of natural density). In this paper, we show that for any function $f \colon \mathbb {N}+1 \to \mathbb {R}$ with $\lim _{N \to \infty } f(N)=+\infty $ , one has ${\operatorname {Col}}_{\min }(N) \leq f(N)$ for almost all $N \in \mathbb {N}+1$ (in the sense of logarithmic density). Our proof proceeds by establishing a stabilisation property for a certain first passage random variable associated with the Collatz iteration (or more precisely, the closely related Syracuse iteration), which in turn follows from estimation of the characteristic function of a certain skew random walk on a $3$ -adic cyclic group $\mathbb {Z}/3^n\mathbb {Z}$ at high frequencies. This estimation is achieved by studying how a certain two-dimensional renewal process interacts with a union of triangles associated to a given frequency.

Let $M_{\langle \mathbf {u},\mathbf {v},\mathbf {w}\rangle }\in \mathbb C^{\mathbf {u}\mathbf {v}}{\mathord { \otimes } } \mathbb C^{\mathbf {v}\mathbf {w}}{\mathord { \otimes } } \mathbb C^{\mathbf {w}\mathbf {u}}$ denote the matrix multiplication tensor (and write $M_{\langle \mathbf {n} \rangle }=M_{\langle \mathbf {n},\mathbf {n},\mathbf {n}\rangle }$ ), and let $\operatorname {det}_3\in (\mathbb C^9)^{{\mathord { \otimes } } 3}$ denote the determinant polynomial considered as a tensor. For a tensor T, let $\underline {\mathbf {R}}(T)$ denote its border rank. We (i) give the first hand-checkable algebraic proof that $\underline {\mathbf {R}}(M_{\langle 2\rangle })=7$ , (ii) prove $\underline {\mathbf {R}}(M_{\langle 223\rangle })=10$ and $\underline {\mathbf {R}}(M_{\langle 233\rangle })=14$ , where previously the only nontrivial matrix multiplication tensor whose border rank had been determined was $M_{\langle 2\rangle }$ , (iii) prove $\underline {\mathbf {R}}( M_{\langle 3\rangle })\geq 17$ , (iv) prove $\underline {\mathbf {R}}(\operatorname {det}_3)=17$ , improving the previous lower bound of $12$ , (v) prove $\underline {\mathbf {R}}(M_{\langle 2\mathbf {n}\mathbf {n}\rangle })\geq \mathbf {n}^2+1.32\mathbf {n}$ for all $\mathbf {n}\geq 25$ , where previously only $\underline {\mathbf {R}}(M_{\langle 2\mathbf {n}\mathbf {n}\rangle })\geq \mathbf {n}^2+1$ was known, as well as lower bounds for $4\leq \mathbf {n}\leq 25$ , and (vi) prove $\underline {\mathbf {R}}(M_{\langle 3\mathbf {n}\mathbf {n}\rangle })\geq \mathbf {n}^2+1.6\mathbf {n}$ for all $\mathbf {n} \ge 18$ , where previously only $\underline {\mathbf {R}}(M_{\langle 3\mathbf {n}\mathbf {n}\rangle })\geq \mathbf {n}^2+2$ was known. The last two results are significant for two reasons: (i) they are essentially the first nontrivial lower bounds for tensors in an “unbalanced” ambient space and (ii) they demonstrate that the methods we use (border apolarity) may be applied to sequences of tensors.

The methods used to obtain the results are new and “nonnatural” in the sense of Razborov and Rudich, in that the results are obtained via an algorithm that cannot be effectively applied to generic tensors. We utilize a new technique, called border apolarity developed by Buczyńska and Buczyński in the general context of toric varieties. We apply this technique to develop an algorithm that, given a tensor T and an integer r, in a finite number of steps, either outputs that there is no border rank r decomposition for T or produces a list of all normalized ideals which could potentially result from a border rank decomposition. The algorithm is effectively implementable when T has a large symmetry group, in which case it outputs potential decompositions in a natural normal form. The algorithm is based on algebraic geometry and representation theory.

A set of integers greater than 1 is primitive if no member in the set divides another. Erdős proved in 1935 that the series $f(A) = \sum _{a\in A}1/(a \log a)$ is uniformly bounded over all choices of primitive sets A. In 1986, he asked if this bound is attained for the set of prime numbers. In this article, we answer in the affirmative.

As further applications of the method, we make progress towards a question of Erdős, Sárközy and Szemerédi from 1968. We also refine the classical Davenport–Erdős theorem on infinite divisibility chains, and extend a result of Erdős, Sárközy and Szemerédi from 1966.

In this paper, we completely resolve the well-known problem of Erdős and Sauer from 1975 which asks for the maximum number of edges an n-vertex graph can have without containing a k-regular subgraph, for some fixed integer $k\geq 3$. We prove that any n-vertex graph with average degree at least $C_k\log \log n$ contains a k-regular subgraph. This matches the lower bound of Pyber, Rödl and Szemerédi and substantially improves an old result of Pyber, who showed that average degree at least $C_k\log n$ is enough.

Our method can also be used to settle asymptotically a problem raised by Erdős and Simonovits in 1970 on almost regular subgraphs of sparse graphs and to make progress on the well-known question of Thomassen from 1983 on finding subgraphs with large girth and large average degree.

An n-vertex graph is called C-Ramsey if it has no clique or independent set of size $C\log _2 n$ (i.e., if it has near-optimal Ramsey behavior). In this paper, we study edge statistics in Ramsey graphs, in particular obtaining very precise control of the distribution of the number of edges in a random vertex subset of a C-Ramsey graph. This brings together two ongoing lines of research: the study of ‘random-like’ properties of Ramsey graphs and the study of small-ball probability for low-degree polynomials of independent random variables.

The proof proceeds via an ‘additive structure’ dichotomy on the degree sequence and involves a wide range of different tools from Fourier analysis, random matrix theory, the theory of Boolean functions, probabilistic combinatorics and low-rank approximation. In particular, a key ingredient is a new sharpened version of the quadratic Carbery–Wright theorem on small-ball probability for polynomials of Gaussians, which we believe is of independent interest. One of the consequences of our result is the resolution of an old conjecture of Erdős and McKay, for which Erdős reiterated in several of his open problem collections and for which he offered one of his notorious monetary prizes.

We prove convergence in norm and pointwise almost everywhere on $L^p$, $p\in (1,\infty )$, for certain multi-parameter polynomial ergodic averages by establishing the corresponding multi-parameter maximal and oscillation inequalities. Our result, in particular, gives an affirmative answer to a multi-parameter variant of the Bellow–Furstenberg problem. This paper is also the first systematic treatment of multi-parameter oscillation semi-norms which allows an efficient handling of multi-parameter pointwise convergence problems with arithmetic features. The methods of proof of our main result develop estimates for multi-parameter exponential sums, as well as introduce new ideas from the so-called multi-parameter circle method in the context of the geometry of backwards Newton diagrams that are dictated by the shape of the polynomials defining our ergodic averages.

We use the geometry of the stellahedral toric variety to study matroids. We identify the valuative group of matroids with the cohomology ring of the stellahedral toric variety and show that valuative, homological and numerical equivalence relations for matroids coincide. We establish a new log-concavity result for the Tutte polynomial of a matroid, answering a question of Wagner and Shapiro–Smirnov–Vaintrob on Postnikov–Shapiro algebras, and calculate the Chern–Schwartz–MacPherson classes of matroid Schubert cells. The central construction is the ‘augmented tautological classes of matroids’, modeled after certain toric vector bundles on the stellahedral toric variety.

We prove the local Langlands conjecture for the exceptional group $G_2(F)$ where F is a non-archimedean local field of characteristic zero.

We study higher uniformity properties of the Möbius function $\mu $, the von Mangoldt function $\Lambda $, and the divisor functions $d_k$ on short intervals $(X,X+H]$ with $X^{\theta +\varepsilon } \leq H \leq X^{1-\varepsilon }$ for a fixed constant $0 \leq \theta < 1$ and any $\varepsilon>0$.

More precisely, letting $\Lambda ^\sharp $ and $d_k^\sharp $ be suitable approximants of $\Lambda $ and $d_k$ and $\mu ^\sharp = 0$, we show for instance that, for any nilsequence $F(g(n)\Gamma )$, we have

$$\begin{align*}\sum_{X < n \leq X+H} (f(n)-f^\sharp(n)) F(g(n) \Gamma) \ll H \log^{-A} X \end{align*}$$

when $\theta = 5/8$ and $f \in \{\Lambda , \mu , d_k\}$ or $\theta = 1/3$ and $f = d_2$.

As a consequence, we show that the short interval Gowers norms $\|f-f^\sharp \|_{U^s(X,X+H]}$ are also asymptotically small for any fixed s for these choices of $f,\theta $. As applications, we prove an asymptotic formula for the number of solutions to linear equations in primes in short intervals and show that multiple ergodic averages along primes in short intervals converge in $L^2$.

Our innovations include the use of multiparameter nilsequence equidistribution theorems to control type $II$ sums and an elementary decomposition of the neighborhood of a hyperbola into arithmetic progressions to control type $I_2$ sums.