A Syracuse-periodic point that reaches equals
Provedsyracuse_periodic_reaches_oneLet be the Syracuse map. A periodic point of whose orbit ever reaches must itself be :
Mathematical role. Cycles and convergence to 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 , 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 is fixed by , an orbit which reaches 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 . The conclusion holds for every period at once, so it replaces the residual step uniformly: once one knows that the odd numbers below a threshold all reach under , no nontrivial cycle can have its minimum among them, whatever its length.
Combined with the bound on the minimum of an accelerated cycle, this reduces the entire cycle problem to convergence for small values: a nontrivial -cycle of length would have to have its minimum among the odd numbers up to roughly , none of which may reach .
Formalization note. The hypothesis is for some positive , not that is minimal. No positivity or oddness assumption on is needed; reaching supplies both.
import Mathlib import Definitions.Def_syracuseStep
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