Lower substitution at balanced recursion depths
ProvedCLRS.Chapter4Substitution.depth_lowerLet and . Assume and, for every natural depth ,
Then for every depth. All costs and the branching number may be zero. This is a convenient depth-indexed specialization of the general smaller-child comparison principles.
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.Chapter4Substitution.upper_comparison, CLRS.Chapter4Substitution.lower_comparison. Supporting lemmas needed by the retained results are included in their accepted proof files.
import Definitions.Def_CLRS_Chapter4_Substitution import Std set_option autoImplicit false set_option backward.isDefEq.respectTransparency false set_option backward.defeqAttrib.useBackward true namespace CLRS end CLRS open CLRS namespace CLRS.Chapter4Substitution end CLRS.Chapter4Substitution open CLRS.Chapter4Substitution
theorem CLRS.Chapter4Substitution.depth_lower (cost candidate : Nat → Nat) (branching : Nat) (toll : Nat → Nat)
(base : candidate 0 ≤ cost 0)
(stepCost : ∀ k, branching * cost k + toll k ≤ cost (k+1))
(stepCandidate : ∀ k, candidate (k+1) ≤ branching * candidate k + toll k) :
∀ k, candidate k ≤ cost k := by sorry