Every classical Collatz cycle contains a Syracuse-periodic point
Provedcollatz_cycle_gives_syracuse_cycleLet be the classical Collatz map and the accelerated Syracuse map. Every positive cycle of contains a point which is genuinely periodic for :
Mathematical role. This is the transfer principle that makes the accelerated theory applicable to the original problem. Every sharp statement about Collatz cycles — the inequality , the bound on a cycle's minimum, the resulting estimate , and the exclusion of short accelerated periods — is a statement about , because carries the arithmetic of the problem without the intervening halvings. None of it says anything about a hypothetical classical cycle until one knows that such a cycle contains a -periodic point. That is what this provides, together with the fact that the point is reached from by the classical map, so the two cycles genuinely share an orbit.
The argument is a finiteness one. A classical cycle contains an odd number , at which the accelerated dynamics can start. Every Syracuse iterate of is again a classical iterate of , since one -step is a run of -steps; and the classical orbit of a periodic point is finite, being determined by the residue of the index modulo . So the sequence takes only finitely many values and must repeat: for some . The point then satisfies with .
What it does and does not give. Combined with the exclusion of accelerated periods through , it shows that any positive classical cycle whose accelerated period is at most must contain , hence is the trivial cycle. It does not bound that accelerated period, so it does not by itself exclude classical cycles; supplying such a bound is the remaining content of the cycle problem.
Formalization note. The conclusion asserts is reached from in classical steps, rather than that lies in a set, so no orbit set need be defined. The period produced is positive but not claimed minimal.
import Mathlib import Definitions.Def_collatzStepMap import Definitions.Def_syracuseStep
theorem collatz_cycle_gives_syracuse_cycle (x p : ℕ) (hx : 0 < x) (hp : 0 < p)
(hcyc : collatzStep^[p] x = x) :
∃ z a k : ℕ, 0 < z ∧ 0 < a ∧ syracuseStep^[a] z = z ∧ collatzStep^[k] x = z := by sorry