An exact smaller-child recurrence and its base values determine the cost
ProvedCLRS.Chapter4Substitution.exact_uniqueLet be a finite ordered list of natural child sizes, let be the local toll, and let be a natural cutoff. At every , assume each listed child is strictly smaller than . Repeated children count with multiplicity.
Let agree at every size below the cutoff and satisfy the same exact toll-plus-children recurrence above it. Then
Equality here is equality of the whole functions, including every base size and size zero. This uniqueness principle permits replacing an abstract cost recurrence by a separately constructed canonical 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.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.exact_unique (children : Nat → List Nat) (toll : Nat → Nat)
(cutoff : Nat) (first second : Nat → Nat)
(smaller : SmallerChildren children cutoff)
(base : ∀ n, n < cutoff → first n = second n)
(firstRecurrence : ExactRecurrence children toll cutoff first)
(secondRecurrence : ExactRecurrence children toll cutoff second) :
first = second := by sorry