# Computer-assisted proof of ergodicity breaking in expanding coupled maps

## TL;DR

This paper presents a computer-assisted method to rigorously demonstrate ergodicity breaking in a family of coupled expanding maps, providing evidence of phase transitions in deterministic chaotic systems.

## Contribution

It introduces a novel numerical algorithm to construct asymmetric ergodic components, advancing the understanding of phase transitions in deterministic dynamical systems.

## Key findings

- Empirical evidence of symmetry breaking with increasing coupling strength.
- Algorithm successfully constructs ergodic components for small N.
- Indicates phase transitions are provable for systems with arbitrary particles.

## Abstract

From a dynamical viewpoint, basic phase transitions of statistical mechanics can be regarded as a breaking of ergodicity. While many random models exhibiting such transitions at the thermodynamics limit exist, finite-dimensional examples with deterministic dynamics on a chaotic attractor are rare, if at all existent. Here, the dynamics of a family of $N$ coupled expanding circle maps is investigated in a parameter regime where absolutely continuous invariant measures are known to exist. At first, empirical evidence is given of symmetry breaking of the ergodic components upon increase of the coupling strength, suggesting that breaking of ergodicity should occur for every integer $N>2$. Then, a numerical algorithm is proposed which aims to rigorously construct asymmetric ergodic components of positive Lebesgue measure. Due to the explosive growth of the required computational resources, the algorithm successfully terminates for small values of $N$ only. However, this approach shows that phase transitions should be provable for systems of arbitrary number of particles with erratic dynamics, in a purely deterministic setting, without any reference to random processes.