Product envelope for an arbitrary finite segment list
ProvedCollatzWork.excursionChainEnvelopecollatz-work-import
Let be the shortcut Collatz map: for even and for odd . Write for its -fold iterate, with . Let be a finite list of segments of natural numbers, with . Starting from , define successive endpoints by applying . Assume each segment satisfies . Write , , and , with empty products 1.
Under the segment assumptions,
The list can have any finite length, including zero. All segment inequalities remain explicit premises.
Preamble
import Std import Init.Grind.Ordered.Module import Definitions.Def_CollatzWork_ConvergenceStatement import Definitions.Def_CollatzWork_ExcursionBudgetStatement import Theorems.Thm_CollatzWork_shiftedEnvelope_compose
Formal statement
theorem CollatzWork.excursionChainEnvelope : ExcursionChainEnvelopeStatement := by sorry
Source