Strict Syracuse descent within 512 steps for odd inputs 2310001 through 2387461
Provedsyracuse_descent_odd_band_2310001_to_2387461collatzfinite-verificationnumber-theorystopping-time
Let be the odd part of , the accelerated Syracuse map. For a natural index , put . Then
Equivalently, every odd starting value from through , inclusive, has a strict descent within512 accelerated steps. The bound is a time to become smaller than the starting value, not a bound on total time to reach one. This is a finite descent assertion, not an unbounded trajectory-convergence theorem or a completed cycle-exclusion baseline.
Preamble
import Mathlib import Definitions.Def_syracuseStep set_option autoImplicit false
Formal statement
theorem syracuse_descent_odd_band_2310001_to_2387461 (i : ℕ) (hi : i < 38731) :
∃ t ≤ 512,
syracuseStep^[t] (2310001 + 2 * i) < 2310001 + 2 * i := by sorrySource
Credits the exact checker and soundness proofs in the existing workspace Solutions/CollatzFiniteDescent.lean and Solutions/CollatzFiniteDescentChunks.lean, and the eight historical certificates Solutions/CollatzFiniteDescentExtensionChunk000.lean through007.lean. Their original indexed formula is1883433+2j, starting at j212015 with eight5000-index chunks. The public band uses j213284+i, skipping1269 original indices, and has38731 inputs through j252014. Historical certificate report: C:/Users/jason/prove2me_workspace/certificates/finite_descent_extended_band/certificates-report.json . Historical checking and104.945-second summed chunk timing are provenance, not new public acceptance or a remote300-second runtime guarantee. This is a distinct first finite-band block, not a renamed retry of the timed-out syracuse_no_cycle_below_2786502 proof; that baseline remains Open in the saved canonical readback. Only the canonical SyracuseStep definition is imported, with no public theorem support assumption.