Every positive Syracuse return period at most 6290 is trivial
Provedsyracuse_period_le_6290_eq_oneLet be the accelerated Syracuse map, the odd part of . For every positive natural number and every positive integer with ,
Thus every positive periodic point admitting a return time at most 6290 belongs to the trivial Syracuse cycle . The return time need not be the least positive return time, and no bound is placed on the starting value .
This consolidates the mission's existing finite-period exclusions into a reusable prefix theorem. It can serve as a single dependency in arguments that first derive a short return time, even when another period under discussion is unbounded. It does not exclude cycles with all positive return times at least 6291, and it makes no claim about nonperiodic Collatz trajectories.
Formalization Note. The map is the existing public syracuseStep definition, iteration is finite function iteration, and both positivity hypotheses are explicit.
import Definitions.Def_syracuseStep import Mathlib.Logic.Function.Iterate set_option autoImplicit false
theorem syracuse_period_le_6290_eq_one (m a : ℕ) (hm : 0 < m) (ha : 0 < a)
(hle : a ≤ 6290) (hcyc : syracuseStep^[a] m = m) :
m = 1 := by sorry