Critical master recurrence with a canonical logarithmic toll
ProvedCLRS.Chapter4Master.case_two_canonicalLet , let , and let be real. Put . Take the positive-base recurrence package with canonical toll and a strictly decreasing natural child function with bounded error from . The toll is interpreted by the total real logarithm and power functions, including small input sizes. Then
The package includes a positive finite cutoff, positive costs throughout its base range, and the exact recurrence above that cutoff. This canonical critical-case result allows arbitrary nonnegative real logarithmic powers and forms a comparison target for more general asymptotically equivalent tolls.
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.case_two_canonical {T : ℕ → ℝ} {a b k : ℝ} {r : ℕ → ℕ}
(R : Recurrence T (fun n => logarithmicToll (logb b a) k n) a r)
(hr : RoundedDivision b r) (ha : 1 ≤ a) (hk : 0 ≤ k) :
T =Θ[atTop] fun n : ℕ => (n : ℝ) ^ (logb b a) * (log n) ^ (k + 1) := by sorry