Every consistent tree computes its exact recurrence cost
ProvedCLRS.Chapter4RecursionTree.consistent_totalFix a finite ordered child-size list at every natural size, natural-valued toll and base-work functions, and a natural cutoff. A tree is consistent when sizes below the cutoff are leaves with their base work, and every other node has its toll as local work and the prescribed ordered list of child root sizes.
Let equal the prescribed base work below the cutoff and satisfy the exact recurrence above it:
Then every consistent finite tree has total work evaluated at its root size. This statement takes the finite tree as a premise and needs no additional decrease condition. It allows nonuniform shapes, repeated children, and unequal subtree heights.
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.Chapter4RecursionTree.recurrence_tree_accounting. Supporting lemmas needed by the retained results are included in their accepted proof files.
import Definitions.Def_CLRS_Chapter4_RecursionTree 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.Chapter4RecursionTree end CLRS.Chapter4RecursionTree open CLRS.Chapter4RecursionTree
theorem CLRS.Chapter4RecursionTree.consistent_total (children : Nat → List Nat) (toll base : Nat → Nat) (cutoff : Nat)
(cost : Nat → Nat) (baseCost : ∀ n, n < cutoff → cost n = base n)
(recurrence : Chapter4Substitution.ExactRecurrence children toll cutoff cost)
(tree : Tree) (consistent : Consistent children toll base cutoff tree) :
tree.totalCost = cost tree.rootSize := by sorry