Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Balanced depth recurrences equal leaf work plus weighted tolls

Proved
CLRS.Chapter4RecursionTree.balanced_unroll

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

algo2leanalgo2lean-clrs-chapter4-fd33cf9algorithmsclrsrecurrencesrunning-timetextbook

Let a∈Na\in\mathbb Na∈N and T,g:N→NT,g:\mathbb N\to\mathbb NT,g:N→N satisfy T(k+1)=aT(k)+g(k)T(k+1)=aT(k)+g(k)T(k+1)=aT(k)+g(k) for every natural depth kkk. Then for every kkk,

T(k)=akT(0)+∑j=0k−1ak−1−jg(j).T(k)=a^kT(0)+\sum_{j=0}^{k-1}a^{k-1-j}g(j).T(k)=akT(0)+j=0∑k−1​ak−1−jg(j).

The initial value, arity, and toll may all be zero; no polynomial form or asymptotic regularity is assumed. The weighted sum is empty at depth zero. This is an exact numerical unrolling identity, available independently of any source program or heap representation.

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.

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.balanced_unroll (arity : Nat) (cost toll : Nat → Nat)
    (recurrence : ∀ depth, cost (depth+1) = arity*cost depth+toll depth) (depth : Nat) :
    cost depth = arity^depth*cost 0 + weightedTolls arity depth toll := by sorry
Source
Algo2Lean Chapter 4 development, declaration Chapter4RecursionTree.balanced_unroll, immutable source fd33cf959b39f9e4a9fcfda4ef31d5a36b784d41: https://github.com/chutongyang98/Lean_formalization/blob/fd33cf959b39f9e4a9fcfda4ef31d5a36b784d41/proofs/chapter4/RecursionTree.lean#L319-L327

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