Bootstrap Step 1: Geometric Decay by Induction #
If Lₙ₊₁ ≤ c · Lₙ whenever a predicate P(n) holds, and P is preserved, then Lₙ ≤ cⁿ · L₀.
Geometric Series Sum #
S_a = Σ_{k=0}^∞ (1-a/2)^{k/2} = 1/(1-√(1-a/2)) is finite for a > 0.
Total Displacement Control #
Σ_{k=1}^n ‖h_k‖ ≤ C_h √η Σ_{k=1}^n √L_k ≤ C_h √η · R · S_a
theorem
PLAcceleratedNesterovLean.geometric_decay_with_invariant
(f : ℕ → ℝ)
(P : ℕ → Prop)
(c : ℝ)
(hc : 0 ≤ c)
(_hc1 : c ≤ 1)
(_hf0 : 0 ≤ f 0)
(hP0 : P 0)
(hstep : ∀ (n : ℕ), P n → f (n + 1) ≤ c * f n ∧ P (n + 1))
(n : ℕ)
:
Geometric decay with invariant: if contraction holds whenever P(n) is true, and P is preserved, then both the invariant and the decay hold for all n.