Subjects

Dynamical systems and ergodic theory

12 results from OpenAI’s math release. 12 explained so far. OpenAI has published Lean proofs for 9: 5 of the main theorem, 4 of part of the claim.

See these in the full list, with search and filters.

• 143 Hilbert's sixteenth problem: uniform bounds for limit cycles

  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.

  2 papers ▶Episode, 7:05 OpenAI published a Lean proof of part of the claim.

• 144 Banach’s simple Lebesgue-spectrum problem

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

  ▶Episode, 6:19 OpenAI published a Lean proof of the main theorem.

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

  ▶Episode, 6:28 OpenAI published a Lean proof of the main theorem.

• 146 Positive metric entropy for the standard map

  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.

  ▶Episode, 6:16 OpenAI published a Lean proof of the main theorem.

• 147 The near-boundary Birkhoff conjecture

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

  2 papers ▶Episode, 6:32

• 148 The entropy-rate dimension formula for self-similar measures

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

  ▶Episode, 6:23 OpenAI published a Lean proof of the main theorem.

• 149 Classwise permanence for weakly reversible mass-action systems

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

  2 papers ▶Episode, 6:38 OpenAI published a Lean proof of part of the claim.

• 150 Weak mixing of triangular billiards with an irrational angle

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

  2 papers ▶Episode, 6:50 OpenAI published a Lean proof of part of the claim.

• 151 A C¹ counterexample to the entropy conjecture

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

  ▶Episode, 7:24 OpenAI published a Lean proof of the main theorem.

• 152 Zero entropy does not guarantee a smooth positive-volume model

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

  ▶Episode, 7:19 OpenAI published a Lean proof of part of the claim.

• 153 Arithmetic classification and non-Pisot singularity for Bernoulli convolutions

  Classifies singular and absolutely continuous unbiased Bernoulli convolutions for every $\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)$, giving examples beyond reciprocal Pisot parameters.

  ▶Episode, 6:44

• 154 Pointwise multiple ergodic averages for mixing transformations

  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.

  4 papers ▶Episode, 7:02

Summary and paper titles from OpenAI’s catalog, used under the Apache License 2.0. Last checked October 19, 2026.