Master theorem case one for bounded-error rounded natural sizes
ProvedCLRS.Chapter4Master.case_oneA 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.
Bounded-error rounding means a real divisor and a uniform real bound on for every natural size. All asymptotic comparisons are eventual as natural tends to infinity.
Set . For any real , a polynomially smaller toll gives
This individual theorem needs , supplied by the recurrence package; it does not add the textbook combined theorem's stronger premise. No continuity, monotonicity, or polynomial-growth comparison hypothesis is imposed on the original toll. The bounds hold at arbitrary natural sizes.
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.case_one {T f : ℕ → ℝ} {a b : ℝ} {r : ℕ → ℕ}
(R : Recurrence T f a r) (hr : RoundedDivision b r)
{ε : ℝ} (hε : 0 < ε)
(hf : f =O[atTop] (fun n : ℕ => (n : ℝ) ^ (Real.logb b a - ε))) :
T =Θ[atTop] (fun n : ℕ => (n : ℝ) ^ Real.logb b a) := by sorry