No nontrivial Syracuse cycle of length
Provedsyracuse_two_cycle_eq_oneLet be the Syracuse map. Its only positive point of period dividing is :
Equivalently, the Collatz map has no nontrivial cycle whose accelerated form has length .
Mathematical role. In the accelerated dynamics a Collatz cycle of length is a solution of , so together with the corresponding statement for this closes the two shortest cases of the cycle problem unconditionally. Writing and multiplying the two step relations and gives
The right-hand side is positive, so ; being a power of two it is therefore at least , and the equation forces . Since for positive , this collapses to , leaving only .
The point of interest is that no Diophantine input is needed. For a cycle of length the two general bounds confine the ratio of even to odd steps to , and eliminating a given amounts to showing that this window contains no admissible integer — a question about rational approximations to . For the gap between and is necessarily coarse enough that plain integrality closes it, which is why these cases fall to elementary arithmetic while larger does not.
Formalization note. No oddness hypothesis is required; a point of period under is automatically odd. The statement is period dividing : it also covers the fixed-point case, since implies .
import Mathlib import Definitions.Def_syracuseStep
theorem syracuse_two_cycle_eq_one (m : ℕ) (hm : 0 < m) (hcyc : syracuseStep^[2] m = m) :
m = 1 := by sorry