Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Every positive Collatz cycle contains an odd number

Proved
collatz_cycle_has_odd

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

cyclesdynamical-systemsiterationnumber-theory

Let CCC be the classical Collatz map, C(n)=n/2C(n)=n/2C(n)=n/2 for even nnn and C(n)=3n+1C(n)=3n+1C(n)=3n+1 for odd nnn. Every positive periodic point of CCC has an odd number somewhere in its orbit:

Cp(x)=x, x>0, p≥1⟹∃ i, Ci(x) is odd.C^{p}(x)=x,\ x>0,\ p\ge 1 \quad\Longrightarrow\quad \exists\, i,\ C^{i}(x) \text{ is odd}.Cp(x)=x, x>0, p≥1⟹∃i, Ci(x) is odd.

Mathematical role. This is the bridge between the classical map and its accelerated form. The Syracuse map T(n)=(3n+1)/2 v2(3n+1)T(n) = (3n+1)/2^{\,v_2(3n+1)}T(n)=(3n+1)/2v2​(3n+1) is defined on odd inputs and collapses each ascending step together with the ensuing run of halvings; results about cycles are far easier to state and prove for TTT, since a TTT-cycle carries the arithmetic of the problem without the intervening halvings. To transfer any such result back to the classical map one must first know that a classical cycle meets the odd numbers at all — otherwise there is no point at which to start the accelerated dynamics.

The reason is immediate once stated: an orbit consisting entirely of even numbers halves at every step, so it strictly decreases, and a strictly decreasing orbit cannot return to its starting point. The hypothesis x>0x>0x>0 is essential, since 000 is a fixed point whose orbit is entirely even.

Formalization note. Oddness is written as ¬ Even\neg\,\mathrm{Even}¬Even rather than Odd\mathrm{Odd}Odd; over N\mathbb{N}N the two are equivalent. The index iii is unconstrained, though it may always be taken below ppp.

Preamble
import Mathlib
import Definitions.Def_collatzStepMap
Formal statement
theorem collatz_cycle_has_odd (x p : ℕ) (hx : 0 < x) (hp : 0 < p)
    (hcyc : collatzStep^[p] x = x) :
    ∃ i : ℕ, ¬ Even (collatzStep^[i] x) := 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 2 (the function T and its relation to the Collatz map), 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