Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

CLRS §4.3: general upper substitution for smaller recursive children

Proved
CLRS.Chapter4Substitution.upper_comparison

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

algo2leanalgo2lean-clrs-chapter4-fd33cf9algorithmsclrsrecurrencesrunning-timetextbook

Let children⁡(n)\operatorname{children}(n)children(n) be a finite ordered list of natural child sizes, let g:N→Ng:\mathbb N\to\mathbb Ng:N→N be the local toll, and let bbb be a natural cutoff. At every n≥bn\ge bn≥b, assume each listed child is strictly smaller than nnn. Repeated children count with multiplicity.

Let T,B:N→NT,B:\mathbb N\to\mathbb NT,B:N→N be a cost and candidate bound. Assume T(n)≤B(n)T(n)\le B(n)T(n)≤B(n) at every base size n<bn<bn<b and, for every n≥bn\ge bn≥b,

T(n)≤g(n)+∑mT(m),g(n)+∑mB(m)≤B(n),T(n)\le g(n)+\sum_m T(m),\qquad g(n)+\sum_m B(m)\le B(n),T(n)≤g(n)+m∑​T(m),g(n)+m∑​B(m)≤B(n),

where both sums range over the listed children of nnn. Then T(n)≤B(n)T(n)\le B(n)T(n)≤B(n) at every natural size. Unequal splits, empty child lists, and zero costs are permitted. This is a reusable numerical comparison principle; it does not assume an algorithm execution or a specific asymptotic form.

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_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.Chapter4Substitution
end CLRS.Chapter4Substitution
open CLRS.Chapter4Substitution

Formal statement
theorem CLRS.Chapter4Substitution.upper_comparison (children : Nat → List Nat) (toll : Nat → Nat)
    (cutoff : Nat) (cost candidate : Nat → Nat)
    (smaller : SmallerChildren children cutoff)
    (base : ∀ n, n < cutoff → cost n ≤ candidate n)
    (recurrence : UpperRecurrence children toll cutoff cost)
    (substitution : UpperCandidate children toll cutoff candidate) :
    ∀ n, cost n ≤ candidate n := by sorry
Source
Algo2Lean Chapter 4 development, declaration Chapter4Substitution.upper_comparison, immutable source fd33cf959b39f9e4a9fcfda4ef31d5a36b784d41: https://github.com/chutongyang98/Lean_formalization/blob/fd33cf959b39f9e4a9fcfda4ef31d5a36b784d41/proofs/chapter4/Substitution.lean#L77-L96

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