Summable normalized tolls preserve the power-law scale
ProvedCLRS.Chapter4Master.summable_transform_thetaLet be any real number and let be nonnegative. Assume the normalized series is summable. Then
Real powers and division use Lean's total real operations, so the expression at follows those definitions; the conclusion is an eventual comparison. The result includes zero toll. It is the numerical transform estimate used when recursive leaf work dominates the accumulated toll.
Platform namespace. The imported Chapter 4 source declarations live under CLRS in this upload to avoid collisions with independently published compiler versions. The immutable source reference retains the original declaration names.
Catalog organization (2026-10-11). This record was retired from the active Chapter 4 catalog to focus the presentation on three algorithms and four reusable recurrence results. Its mathematical statement and proof status are unchanged, and existing imports and links remain valid. The retained results are CLRS.Chapter4Master.master_theorem. Supporting lemmas needed by the retained results are included in their accepted proof files.
import Definitions.Def_CLRS_Chapter4_Master_Basic import Definitions.Def_CLRS_Chapter4_Master_Rounding import Mathlib.Analysis.Asymptotics.Theta import Mathlib.Analysis.PSeries import Mathlib.Analysis.SpecialFunctions.Pow.Asymptotics import Mathlib.Computability.AkraBazzi.AkraBazzi import Mathlib.Tactic set_option autoImplicit false set_option backward.isDefEq.respectTransparency false set_option backward.defeqAttrib.useBackward true namespace CLRS end CLRS open CLRS open Filter Asymptotics Finset open scoped Topology namespace CLRS.Chapter4Master end CLRS.Chapter4Master open CLRS.Chapter4Master
theorem CLRS.Chapter4Master.summable_transform_theta (p : ℝ) (g : ℕ → ℝ)
(hg : ∀ n, 0 ≤ g n)
(hs : Summable fun n => g n / (n : ℝ) ^ (p + 1)) :
(fun n : ℕ => (n : ℝ) ^ p *
(1 + ∑ u ∈ range n, g u / (u : ℝ) ^ (p + 1)))
=Θ[atTop] (fun n : ℕ => (n : ℝ) ^ p) := by sorry