Available consistent trees assemble a forest with the exact ordered roots
ProvedCLRS.Chapter4RecursionTree.forest_existsFix 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 be any finite list of natural sizes. If a consistent tree rooted at exists for every occurrence , then there is a finite ordered forest such that
and every member of is consistent. Repeated sizes retain their multiplicity and the empty list is allowed. No child-decrease premise is needed here: existence of the individual trees is the explicit hypothesis.
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.forest_exists (children : Nat → List Nat) (toll base : Nat → Nat) (cutoff : Nat)
(sizes : List Nat)
(available : ∀ n ∈ sizes, ∃ tree, tree.rootSize = n ∧ Consistent children toll base cutoff tree) :
∃ forest : List Tree, forest.map Tree.rootSize = sizes ∧
∀ tree ∈ forest, Consistent children toll base cutoff tree := by sorry