Finite actual-orbit segments and product envelopes
DefinitionCollatzWork_ExcursionBudgetStatementcollatz-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.
The chain-envelope interface specifies
The bundle defines segment length and numerator/denominator products, the recursively checked local-envelope predicate, and a terminal numerical descent interface. The empty list is allowed; local envelopes and final budgets are assumptions rather than all-root coverage results.
Definition code
import Std
import Init.Grind.Ordered.Module
import Definitions.Def_CollatzWork_ConvergenceStatement
import Definitions.Def_CollatzWork_InverseWordBoundaryStatement
namespace CollatzWork
/-!
Trusted interfaces for cumulative bounds on actual shortcut orbits.
The segment envelopes and final budget are hypotheses, NOT universal coverage.
This file imports definitions only, not the solution or its proof tactics.
-/
structure ExcursionSegment where
steps : Nat
numerator : Nat
denominator : Nat
def excursionSteps : List ExcursionSegment → Nat
| [] => 0
| s :: rest => s.steps + excursionSteps rest
def excursionNumerator : List ExcursionSegment → Nat
| [] => 1
| s :: rest => s.numerator * excursionNumerator rest
def excursionDenominator : List ExcursionSegment → Nat
| [] => 1
| s :: rest => s.denominator * excursionDenominator rest
/-- Each segment is evaluated on the actual endpoint of its predecessor. -/
def ExcursionChain (n : Nat) : List ExcursionSegment → Prop
| [] => True
| s :: rest =>
0 < s.denominator ∧
s.denominator * (shortcutIter s.steps n + 3) ≤ s.numerator * (n + 3) ∧
ExcursionChain (shortcutIter s.steps n) rest
def ExcursionChainEnvelopeStatement : Prop :=
∀ (segments : List ExcursionSegment) (root : Nat),
ExcursionChain root segments →
excursionDenominator segments * (shortcutIter (excursionSteps segments) root + 3) ≤
excursionNumerator segments * (root + 3) ∧
0 < excursionDenominator segments
def ExcursionBudgetDescentStatement : Prop :=
∀ root steps A D : Nat, 3 ≤ root →
D * shortcutIter steps root < A * (root + 3) → 2 * A ≤ D →
shortcutIter steps root < root
end CollatzWork
Source