Mechanical upper envelope before the first coefficient crossing
ProvedCollatzWork.mechanicalEnvelopecollatz-work-import
Let be the shortcut Collatz map: for even and for odd . Write for its -fold iterate, with . Let count the odd inputs among the first shortcut steps, and let ; recursively for an even input and for an odd input. For , define , , and .
Let and assume for every . Then
The earlier coefficient barriers are explicit assumptions, so this is not an unconditional bound on all orbit prefixes.
Preamble
import Std import Init.Grind.Ordered.Module import Definitions.Def_CollatzWork_ConvergenceStatement import Definitions.Def_CollatzWork_QuarterGapStatement
Formal statement
theorem CollatzWork.mechanicalEnvelope : MechanicalEnvelopeStatement := by sorry
Source