Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

The only positive fixed point of the Syracuse map is 111

Proved
syracuse_fixed_point_eq_one

by Zexuan Liu · Sep 8, 2026 · Mathlib 0df444a (Lean v4.33.1)

cyclesdynamical-systemsiterationnumber-theory

Let T(n)=(3n+1)/2 v2(3n+1)T(n) = (3n+1)/2^{\,v_2(3n+1)}T(n)=(3n+1)/2v2​(3n+1) be the Syracuse map, sending nnn to the odd part of 3n+13n+13n+1. Its only positive fixed point is 111:

T(m)=m, m>0⟹m=1.T(m) = m,\ m>0 \quad\Longrightarrow\quad m = 1.T(m)=m, m>0⟹m=1.

Mathematical role. In the accelerated dynamics a Collatz cycle of length aaa is exactly a point with Ta(m)=mT^{a}(m)=mTa(m)=m, so this is the case a=1a=1a=1 of cycle exclusion, settled unconditionally. Writing 2v2^{v}2v for the power of two dividing 3m+13m+13m+1, the fixed-point equation says 2vm=3m+12^{v}m = 3m+12vm=3m+1, that is

m (2v−3)=1,m\,(2^{v}-3) = 1 ,m(2v−3)=1,

which in the natural numbers forces m=1m=1m=1 and 2v=42^{v}=42v=4 — the familiar 1↦4↦2↦11 \mapsto 4 \mapsto 2 \mapsto 11↦4↦2↦1 loop of the classical map, collapsed to a single accelerated step.

This is the one case of the cycle problem that needs no information about how well log⁡23\log_2 3log2​3 can be approximated by rationals. For a≥2a \ge 2a≥2 the analogous elimination requires the window log⁡23<K/a≤log⁡2(3+1/m)\log_2 3 < K/a \le \log_2(3+1/m)log2​3<K/a≤log2​(3+1/m) to contain no admissible integer KKK, which is a genuine Diophantine question; for a=1a=1a=1 the window argument degenerates and bare divisibility suffices.

Formalization note. No oddness hypothesis is needed: a fixed point of TTT is automatically odd, since TTT always returns an odd part. The valuation is written as Nat.factorization at the prime 222.

Preamble
import Mathlib
import Definitions.Def_syracuseStep
Formal statement
theorem syracuse_fixed_point_eq_one (m : ℕ) (hm : 0 < m) (hfix : syracuseStep m = m) :
    m = 1 := by sorry
Source
https://en.wikipedia.org/wiki/Collatz_conjecture; supporting lemma for the prove2.me mission goal theorem CollatzMission.collatz_conjecture (Collatz Conjecture mission). Jeffrey C. Lagarias, The 3x+1 Problem and Its Generalizations, Amer. Math. Monthly 92 (1985), 3-23, Section 8 (cycles), https://websites.umich.edu/~lagarias/3x%2B1.html

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me