Conditional convergence after a guarded two-burst descent
ProvedCollatzWork.twoBurst_converges_of_smallercollatz-work-import
Let be the shortcut Collatz map: for even and for odd . Write for its -fold iterate, with . Write for the assertion that for some . Let be positive natural numbers satisfying and . Put .
Assume additionally for every natural with . Then
The convergence conclusion retains both arithmetic guards and the smaller-start induction premise.
Preamble
import Std import Init.Grind.Ordered.Module import Definitions.Def_CollatzWork_ConvergenceStatement import Theorems.Thm_CollatzWork_converges_shortcutIter_iff import Theorems.Thm_CollatzWork_twoBurstDescent
Formal statement
theorem CollatzWork.twoBurst_converges_of_smaller (k l u v m : Nat)
(hk : 0 < k) (hl : 0 < l) (hu : 0 < u) (hv : 0 < v) (hm : 0 < m)
(hrecharge : 9 ^ k * u + 1 = 2 ^ (3 * l + 1) * v)
(hexit : 2 ^ (k + l) * m + 5 = 3 * 9 ^ l * v)
(ih : ∀ a : Nat, 0 < a → a < 2 * 8 ^ k * u - 5 → Converges a) :
Converges (2 * 8 ^ k * u - 5) := by sorry
Source