A nonnegative discrete sum has the scale of its diverging antiderivative
ProvedCLRS.Chapter4Master.sum_isTheta_antiderivativeLet . Assume has Mathlib's polynomial-growth comparison property: on each fixed proportional interval with , its values are eventually bounded above and below by positive constant multiples of . Assume at every natural , for all sufficiently large real , and . Then, as natural tends to infinity,
The nonnegative summands may be irregular on any finite initial segment. This analytic comparison is reusable in the critical master-theorem case.
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_CaseTwo import Definitions.Def_CLRS_Chapter4_Master_Rounding import Mathlib.Analysis.Asymptotics.Theta import Mathlib.Analysis.Calculus.Deriv.MeanValue import Mathlib.Analysis.SpecialFunctions.Pow.Asymptotics import Mathlib.Analysis.SpecialFunctions.Pow.Deriv 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 Real open scoped Topology namespace CLRS.Chapter4Master end CLRS.Chapter4Master open CLRS.Chapter4Master
theorem CLRS.Chapter4Master.sum_isTheta_antiderivative {F g : ℝ → ℝ}
(hg : AkraBazziRecurrence.GrowsPolynomially g)
(hgn : ∀ n : ℕ, 0 ≤ g n)
(hderiv : ∀ᶠ x in atTop, HasDerivAt F (g x) x)
(hF : Tendsto F atTop atTop) :
(fun n : ℕ => 1 + ∑ i ∈ range n, g i) =Θ[atTop] fun n : ℕ => F n := by sorry