Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

CLRS §4.4: exact recurrence cost is the work on a finite tree

Proved
CLRS.Chapter4RecursionTree.recurrence_tree_accounting

by Chutong · Oct 11, 2026 · Mathlib 0df444a (Lean v4.33.1)

algo2leanalgo2lean-clrs-chapter4-fd33cf9algorithmsclrsrecurrencesrunning-timetextbook

Fix 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.

Assume every non-base child is strictly smaller than its parent. Let a natural-valued function TTT match the base work and the exact toll-plus-child recurrence. For every natural input nnn, there is a finite consistent tree τ\tauτ rooted at nnn for which

T(n)=totalCost⁡(τ)=∑ℓ=0height⁡(τ)−1levelCost⁡(τ,ℓ).T(n)=\operatorname{totalCost}(\tau) =\sum_{\ell=0}^{\operatorname{height}(\tau)-1} \operatorname{levelCost}(\tau,\ell).T(n)=totalCost(τ)=ℓ=0∑height(τ)−1​levelCost(τ,ℓ).

This unites tree existence and exact accounting without balance assumptions. It applies to a numerical recurrence; a source-program runtime claim must separately identify its completed execution's cost with that 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.

Preamble
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

Formal statement
theorem CLRS.Chapter4RecursionTree.recurrence_tree_accounting (children : Nat → List Nat) (toll base : Nat → Nat) (cutoff : Nat)
    (cost : Nat → Nat) (smaller : Chapter4Substitution.SmallerChildren children cutoff)
    (baseCost : ∀ n, n < cutoff → cost n = base n)
    (recurrence : Chapter4Substitution.ExactRecurrence children toll cutoff cost) (size : Nat) :
    ∃ tree, tree.rootSize = size ∧ Consistent children toll base cutoff tree ∧
      cost size = tree.totalCost ∧ cost size = sumBelow tree.height tree.levelCost := by sorry
Source
Algo2Lean Chapter 4 development, declaration Chapter4RecursionTree.recurrence_tree_accounting, immutable source fd33cf959b39f9e4a9fcfda4ef31d5a36b784d41: https://github.com/chutongyang98/Lean_formalization/blob/fd33cf959b39f9e4a9fcfda4ef31d5a36b784d41/proofs/chapter4/RecursionTree.lean#L267-L277

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me