Composition of two shifted shortcut envelopes
ProvedCollatzWork.shiftedEnvelope_composecollatz-work-import
Let be the shortcut Collatz map: for even and for odd . Write for its -fold iterate, with .
Let . Assume and . Then
This combines local bounds relative to the unchanged original start. It requires no positive-denominator hypothesis for this non-strict inequality.
Preamble
import Std import Init.Grind.Ordered.Module import Definitions.Def_CollatzWork_ConvergenceStatement import Definitions.Def_CollatzWork_InverseWordBoundaryStatement import Definitions.Def_CollatzWork_RefinedMersenneChild
Formal statement
theorem CollatzWork.shiftedEnvelope_compose (root k l A B D E : Nat)
(hfirst : D * (shortcutIter k root + 3) ≤ A * (root + 3))
(hsecond : E * (shortcutIter l (shortcutIter k root) + 3) ≤
B * (shortcutIter k root + 3)) :
(D * E) * (shortcutIter (k + l) root + 3) ≤
(A * B) * (root + 3) := by sorry
Source