Finite recursion-tree total equals the sum of its level costs
ProvedCLRS.Chapter4RecursionTree.Tree.total_eq_levelsA finite ordered recursion tree labels each node by a natural input size and natural local work. Total cost sums all node work; height counts the root level, and level cost sums work at the specified depth. The children may have unequal sizes and unequal subtree heights.
Every such tree satisfies the exact identity
The statement is purely finite-tree accounting and requires no recurrence or balanced shape. It makes level-by-level numerical estimates available for any tree later connected to a source execution or a recurrence.
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.Tree.total_eq_levels (tree : Tree) :
tree.totalCost = sumBelow tree.height tree.levelCost := by sorry