← Latest papers
🔢 mathematics

An elementary proof of Brémont's theorem on the convergence of equilibrium measures at temperature zero

This paper provides an elementary proof demonstrating that for a locally constant function on a topologically mixing subshift of finite type, the equilibrium measures converge as the temperature approaches zero, with the resulting limit measure assigning algebraic numbers to every cylinder.

Original authors: Oliver Jenkinson, Mark Pollicott

Published 2026-10-15
📖 5 min read🧠 Deep dive

Original authors: Oliver Jenkinson, Mark Pollicott

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

In the study of complex systems, from the swirling patterns of weather to the intricate arrangements of atoms in a crystal, scientists often look for the state where a system settles down when pushed to its absolute limits. Imagine a vast landscape of possibilities, where every point represents a different arrangement of the system. As a controlling factor, such as temperature, is adjusted, the system tends to favor certain arrangements over others. At high temperatures, the system is chaotic and explores many different states. But as the temperature drops toward absolute zero, the system is forced to choose a single, most favorable state, known as a ground state. In mathematics, this process is modeled using a concept called an equilibrium measure, which describes the probability of finding the system in any given configuration. For a long time, mathematicians knew that if the rules governing the system were simple and unchanging, this probability would eventually settle into a stable pattern as the temperature vanished. However, when the rules were slightly more complex, it was unclear whether the system would ever truly decide on a final state or if it would keep oscillating between possibilities forever.

This uncertainty was the focus of a recent proof by Oliver Jenkinson and Mark Pollicott, who tackled a specific question about how these systems behave when the temperature reaches zero. They were investigating a type of mathematical model called a subshift of finite type, which can be thought of as a set of rules for how symbols can follow one another in a sequence. In this model, a function assigns a value to each possible sequence, acting like a score that determines which sequences are most desirable. As the temperature parameter drops, the system concentrates its attention on the sequences with the highest scores. The researchers wanted to know if, as the temperature approaches zero, the probability of finding the system in any specific pattern would eventually stop changing and settle on a single, definite number. While a previous mathematician had shown this to be true, the proof was highly technical and relied on advanced tools from a branch of geometry called subanalytic functions. Jenkinson and Pollicott set out to provide a much simpler, more direct explanation that anyone with a basic grasp of algebra could follow.

The team focused on a scenario where the rules of the system are locally constant, meaning the value assigned to a sequence depends only on a short, fixed number of its initial symbols. They started with a known formula that relates the probability of a specific pattern to the properties of a large grid of numbers, which acts as a map of all possible transitions in the system. This formula involves a special number that changes as the temperature changes, representing the overall energy or pressure of the system. The difficulty in previous attempts to prove convergence was that as the temperature dropped, the numerator and denominator of this formula both shrank toward zero, making it impossible to see the final result directly. It was like trying to determine the slope of a hill by looking at two points that were both collapsing into the same spot.

To solve this, the authors realized that the special number representing the system's energy was not just any random value; it was a root of a specific polynomial equation. This means that if you plug this number into a certain algebraic equation, the result is zero. The coefficients of this equation were built from simple sums of exponential values, which are numbers that grow or shrink at a steady rate. By using the fact that this special number satisfies the equation, the researchers were able to eliminate it from their main formula. This algebraic maneuver revealed that the probability of finding the system in any given pattern was itself a solution to a different polynomial equation. In other words, the probability was not a chaotic, unpredictable value, but a number that was mathematically tied to the rules of the system in a very rigid way.

The final step of the argument relied on a simple but powerful observation about numbers that behave this way. If a value is constrained to be a solution of a polynomial equation whose coefficients change in a predictable, smooth manner, then that value cannot oscillate forever as the temperature drops. It must eventually settle down to a single, fixed number. The authors showed that this limit is not just any number, but an algebraic number, which is a type of number that can be defined as the root of a polynomial with rational coefficients. This holds true even if the original rules of the system involve numbers that are not algebraic. The proof demonstrated that the system's final state is determined by a finite set of possibilities, and the specific way the system chooses among them is fixed by the underlying algebraic structure.

The result confirms that for systems with these specific types of rules, the zero-temperature limit always exists. The system does not waver or fail to decide; it converges to a stable state. Furthermore, the proof provides a clear picture of what that state looks like: the probability assigned to every possible pattern is an algebraic number. This means that even though the system might be incredibly complex, its final behavior is governed by a finite, calculable set of mathematical relationships. The work replaces a heavy, abstract proof with a clear, elementary argument, showing that the convergence of these measures is a natural consequence of the algebraic properties hidden within the system's rules. The findings suggest that in the realm of these mathematical models, the path to the ground state is always well-defined and predictable, offering a deeper understanding of how complex systems resolve their internal conflicts when pushed to the extreme.

Drowning in papers in your field?

Get daily digests of the most novel papers matching your research keywords — with technical summaries, in your language.

Try Digest →