Three shortcut steps agree with five ordinary steps on the alternating block
ProvedBlindCollatz.AlternatingGrowth.shortcut_three_eq_ordinary_fivecollatz-work-import
Let be the shortcut Collatz map: for even and for odd . Write for its -fold iterate, with . Let be the ordinary Collatz map: for even and for odd . Write for its -fold iterate.
For every ,
This is an explicit bridge between the two iteration conventions on the stated residue family only.
Preamble
import Std import Init.Grind.Ordered.Module import Definitions.Def_ArchiveAlternatingGrowth import Theorems.Thm_BlindCollatz_AlternatingGrowth_ordinary_five
Formal statement
theorem BlindCollatz.AlternatingGrowth.shortcut_three_eq_ordinary_five (q : Nat) :
block (16 * q + 11) = ordinarySteps 5 (16 * q + 11) := by sorry
Source