Syracuse descent below 2310000
Provedsyracuse_descends_below_2310000collatznumber-theory
Let be the Syracuse map, sending to the odd part of . For every odd with , some iterate of falls strictly below .
This is a descent statement, deliberately weaker than convergence, and exactly the strength cycle exclusion requires: the minimum of a nontrivial cycle can never descend.
Below the result is inherited from the previous descent bound. Above it, the statement comes from a ladder of mutually independent range lemmas, each following orbits only until their first drop below that range's own lower bound. Half of every range needs no orbit data at all: if then , so in a single step.
The threshold is chosen so that the cycle-margin criterion closes the period- cycle-exclusion gap: with , , the margin inequality first holds at .
Preamble
import Mathlib import Definitions.Def_syracuseStep
Formal statement
theorem syracuse_descends_below_2310000 (m : ℕ) (h1 : 1 < m) (hlt : m < 2310000) (hodd : Odd m) :
∃ t : ℕ, syracuseStep^[t] m < m := by sorrySource
Collatz mission https://prove2.me/missions/2f34a49f-2016-4de2-9662-fcd1cc96cc67; assembled from syracuse_descends_below_1883432 and 214 independent descent range lemmas covering [1883432, 2309999].