Regularity bounds the complete recurrence by its toll
ProvedCLRS.Chapter4Master.regularity_upperA recurrence package consists of real-valued costs , a positive real multiplier , a natural child function , and a positive cutoff . It requires positive base costs for every , nonnegative toll at every size, strictly smaller children above the cutoff, and there.
Let be natural and let be real with and . Assume and at every . Then
The constant is constructed from the recurrence and the finite base range; a bound on the solution is not a premise.
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 Mathlib.Analysis.Asymptotics.Theta import Mathlib.Analysis.SpecialFunctions.Pow.Real 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 namespace CLRS.Chapter4Master end CLRS.Chapter4Master open CLRS.Chapter4Master
theorem CLRS.Chapter4Master.regularity_upper {T f : ℕ → ℝ} {a : ℝ} {r : ℕ → ℕ}
(R : Recurrence T f a r) {N : ℕ} {c δ : ℝ}
(hc : c < 1) (hδ : 0 < δ)
(hregular : ∀ n, N ≤ n → a * f (r n) ≤ c * f n)
(htoll : ∀ n, N ≤ n → δ ≤ f n) :
∃ K : ℝ, 0 < K ∧ ∀ n, max R.cutoff N ≤ n → T n ≤ K * f n := by sorry