A positive comparison absorbs every finite set of base costs
ProvedCLRS.Chapter4Master.exists_pos_mul_boundLet , with for every natural . For any natural cutoff , there is a positive real constant such that
No sign or recurrence assumption is made on , and is allowed. The constant may depend on both functions and this finite cutoff. This allows asymptotic recurrence comparisons to absorb differing finite base values without prescribing an a priori bound on the entire solution.
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.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 open scoped Topology namespace CLRS.Chapter4Master end CLRS.Chapter4Master open CLRS.Chapter4Master
theorem CLRS.Chapter4Master.exists_pos_mul_bound (T U : ℕ → ℝ) (hU : ∀ n, 0 < U n) (N : ℕ) :
∃ C > 0, ∀ n, n < N → T n ≤ C * U n := by sorry