Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

A Syracuse-periodic point that reaches 111 equals 111

Proved
syracuse_periodic_reaches_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. A periodic point of TTT whose orbit ever reaches 111 must itself be 111:

Ta(z)=z, a≥1, ∃k Tk(z)=1⟹z=1.T^{a}(z)=z,\ a\ge 1,\ \exists k\ T^{k}(z)=1 \quad\Longrightarrow\quad z=1 .Ta(z)=z, a≥1, ∃k Tk(z)=1⟹z=1.

Mathematical role. Cycles and convergence to 111 are mutually exclusive, and this states it in the form actually needed. Every exclusion of a specific accelerated cycle length ends the same way: the argument bounds the cycle below by some explicit threshold BBB, and one is left checking that no small value is periodic. That final check is a statement about each individual residual value and has to be redone for each period.

This lemma removes that repetition. Because 111 is fixed by TTT, an orbit which reaches 111 stays there; a periodic orbit, on the other hand, returns to its starting point at every multiple of its length. Running far enough forward that both apply forces the starting point to equal 111. The conclusion holds for every period aaa at once, so it replaces the residual step uniformly: once one knows that the odd numbers below a threshold all reach 111 under TTT, no nontrivial cycle can have its minimum among them, whatever its length.

Combined with the bound m≲a 3a−1m \lesssim a\,3^{a-1}m≲a3a−1 on the minimum of an accelerated cycle, this reduces the entire cycle problem to convergence for small values: a nontrivial TTT-cycle of length aaa would have to have its minimum among the odd numbers up to roughly a 3a−1a\,3^{a-1}a3a−1, none of which may reach 111.

Formalization note. The hypothesis is Ta(z)=zT^{a}(z)=zTa(z)=z for some positive aaa, not that aaa is minimal. No positivity or oddness assumption on zzz is needed; reaching 111 supplies both.

Preamble
import Mathlib
import Definitions.Def_syracuseStep
Formal statement
theorem syracuse_periodic_reaches_one (z a : ℕ) (ha : 0 < a)
    (hcyc : syracuseStep^[a] z = z) (hreach : ∃ k : ℕ, syracuseStep^[k] z = 1) :
    z = 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