Divisibility budget for a repeated affine block
ProvedBlindCollatz.RepetitionBound.affine_repetition_boundcollatz-work-import
Let with , and with . Assume for every . Then
The positive shifted initial value bounds repetitions of a fixed affine rule. Degenerate parameters remain covered when they satisfy the stated hypotheses.
Preamble
import Std import Init.Grind.Ordered.Module import Theorems.Thm_BlindCollatz_RepetitionBound_telescope
Formal statement
theorem BlindCollatz.RepetitionBound.affine_repetition_bound (b d c : Nat)
(hcop : b.Coprime (b + d)) (x : Nat → Nat)
(hpos : 0 < d * x 0 + c) (k : Nat)
(h : ∀ i, i < k → b * x (i + 1) = (b + d) * x i + c) :
b ^ k ≤ d * x 0 + c := by sorry
Source