Telescoping a finite multiplicative recurrence
ProvedCollatzWork.affineRecurrenceTelescopecollatz-work-import
Let and . Assume for every . Then
This records the exact accumulated multiplier without division or positivity assumptions.
Preamble
import Std import Init.Grind.Ordered.Module
Formal statement
theorem CollatzWork.affineRecurrenceTelescope (a b : Nat) (y : Nat → Nat) (k : Nat)
(h : ∀ i, i < k → b * y (i + 1) = a * y i) :
b ^ k * y k = a ^ k * y 0 := by sorry
Source