# Quantifying the degree of average contraction of Collatz orbits

## Abstract

We here elaborate on a quantitative argument to support the validity of the Collatz conjecture, also known as the \((3x+1)\) or Syracuse conjecture. The analysis is structured as follows. First, three distinct fixed points are found for the third iterate of the Collatz map, which hence organise in a period 3 orbit of the original map. These are 1, 2 and 4, the elements which define the unique attracting cycle, as hypothesised by Collatz. To carry out the calculation we write the positive integers in modulo 8 (*mod8*), obtain a closed analytical form for the associated map and determine the transitions that yield contracting or expanding iterates in the original, infinite-dimensional, space of positive integers. Then, we consider a Markov chain which runs on the reduced space of *mod8* congruence classes of integers. The transition probabilities of the Markov chain are computed from the deterministic map, by employing a measure that is invariant for the map itself. Working in this setting, we demonstrate that the stationary distribution sampled by the stochastic system induces a contracting behaviour for the orbits of the deterministic map on the original space of the positive integers. Sampling the equilibrium distribution on the congruence classes *mod* \(8^m\) for any *m*, which amounts to arbitrarily reducing the degree of imposed coarse graining, returns an identical conclusion.

## Keywords

Collatz conjecture Number theory Markov process Ergodic dynamical systems## Notes

### Acknowledgements

We would like to thank the numerous colleagues who interacted with us all along the various stages of the writing of this work. In particular we warmly thank Claudio Bonanno, Carlo Carminati, Jean-Charle Delvenne, Craig Alan Feinstein, Steffen Kionke, Shlomo Levental, Stefano Marmi, Vassilis Papanicolaou, François Stealens and Cédric Villani, for their insightful comments and remarks. The work of T.C. presents research results of the Belgian Network DYSCO (Dynamical Systems, Control, and Optimization), funded by the Interuniversity Attraction Poles Programme, initiated by the Belgian State, Science Policy Office.

## References

- 1.Lagarias, J.C.: The Ultimate Challenge: The 3x+1 Problem. American Mathematical Society, Providence, USA (2010)Google Scholar
- 2.Oliveira, T., Silva, E.: Maximum excursion and stopping time record holders for the 3x+1 problem: computational results. Math. Comput.
**68**(1), 371–384 (1999)Google Scholar - 3.Matthews, K.R., Watts, A.M.: A Markov approach to the generalised Syracuse algorithm. Acta Arith.
**45**, 29 (1985)Google Scholar - 4.Buttsworth, R.N., Matthews, K.R.: On some Markov matrices arising from the generalised Collatz mapping. Acta Arith.
**55**(1985)Google Scholar - 5.Cox, D.R., Miller, H.D.: The Theory of Stochastic Processes. CRC Press, Florida, USA (1977)Google Scholar