Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Critical master recurrence with a canonical logarithmic toll

Proved
CLRS.Chapter4Master.case_two_canonical

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

algo2leanalgo2lean-clrs-chapter4-fd33cf9algorithmsclrsrecurrencesrunning-timetextbook

Let a≥1a\ge1a≥1, let b>1b>1b>1, and let q≥0q\ge0q≥0 be real. Put p=log⁡bap=\log_b ap=logb​a. Take the positive-base recurrence package with canonical toll f(n)=np(log⁡n)qf(n)=n^p(\log n)^qf(n)=np(logn)q and a strictly decreasing natural child function with bounded error from n/bn/bn/b. The toll is interpreted by the total real logarithm and power functions, including small input sizes. Then

T(n)=Θ(np(log⁡n)q+1).T(n)=\Theta\bigl(n^p(\log n)^{q+1}\bigr).T(n)=Θ(np(logn)q+1).

The package includes a positive finite cutoff, positive costs throughout its base range, and the exact recurrence above that cutoff. This canonical critical-case result allows arbitrary nonnegative real logarithmic powers and forms a comparison target for more general asymptotically equivalent tolls.

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.Chapter4Master.master_theorem. Supporting lemmas needed by the retained results are included in their accepted proof files.

Preamble
import Definitions.Def_CLRS_Chapter4_Master_Basic
import Definitions.Def_CLRS_Chapter4_Master_CaseTwo
import Definitions.Def_CLRS_Chapter4_Master_Rounding
import Mathlib.Analysis.Asymptotics.Theta
import Mathlib.Analysis.Calculus.Deriv.MeanValue
import Mathlib.Analysis.SpecialFunctions.Pow.Asymptotics
import Mathlib.Analysis.SpecialFunctions.Pow.Deriv
import Mathlib.Computability.AkraBazzi.AkraBazzi
import Mathlib.Tactic

set_option autoImplicit false
set_option backward.isDefEq.respectTransparency false
set_option backward.defeqAttrib.useBackward true

namespace CLRS
end CLRS
open CLRS
open Filter Asymptotics Finset Real
open scoped Topology
namespace CLRS.Chapter4Master
end CLRS.Chapter4Master
open CLRS.Chapter4Master

Formal statement
theorem CLRS.Chapter4Master.case_two_canonical {T : ℕ → ℝ} {a b k : ℝ} {r : ℕ → ℕ}
    (R : Recurrence T (fun n => logarithmicToll (logb b a) k n) a r)
    (hr : RoundedDivision b r) (ha : 1 ≤ a) (hk : 0 ≤ k) :
    T =Θ[atTop] fun n : ℕ => (n : ℝ) ^ (logb b a) * (log n) ^ (k + 1) := by sorry
Source
Algo2Lean Chapter 4 development, declaration Chapter4Master.case_two_canonical, immutable source fd33cf959b39f9e4a9fcfda4ef31d5a36b784d41: https://github.com/chutongyang98/Lean_formalization/blob/fd33cf959b39f9e4a9fcfda4ef31d5a36b784d41/proofs/chapter4/Master/CaseTwo.lean#L170-L190

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