Finite budget for the alternating expansion recurrence
ProvedBlindCollatz.RepetitionBound.alternating_repetition_boundcollatz-work-import
Let and . If for every , then
This specializes the fixed affine-block budget to the alternating expansion parameters.
Preamble
import Std import Init.Grind.Ordered.Module import Theorems.Thm_BlindCollatz_RepetitionBound_telescope
Formal statement
theorem BlindCollatz.RepetitionBound.alternating_repetition_bound (x : Nat → Nat) (k : Nat)
(h : ∀ i, i < k → 8 * x (i + 1) = 9 * x i + 5) :
8 ^ k ≤ x 0 + 5 := by sorry
Source