AFTD Auto-Formalizing Theoretical Domains

Cslib.Algorithms.Lean.TimeM.mergeSort_time

theoremverifiedformalizationimported Lean

Time complexity of mergeSort

Statement

set_option relaxedAutoImplicit true in
open Cslib Cslib.Algorithms Cslib.Algorithms.Lean Cslib.Algorithms.Lean.TimeM in
set_option autoImplicit false in
variable {α : Type} [LinearOrder α] in
open Nat (clog) in
theorem Cslib.Algorithms.Lean.TimeM.mergeSort_time (xs : List α) :
    let n := xs.length
    (mergeSort xs).time ≤ n * clog 2 n
Formalizes
CSLib, `Cslib.Algorithms.Lean.TimeM.mergeSort_time`
Lean proof
By Sorrachai Yingchareonthawornhcai, from github.com/leanprover/cslib at 3951377e5a3f (Copyright (c) 2025 Sorrachai Yingchareonthawornhcai. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.33.0.
Verified
08 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 29

Lean source view module on GitHub

set_option relaxedAutoImplicit true inopen Cslib Cslib.Algorithms Cslib.Algorithms.Lean Cslib.Algorithms.Lean.TimeM inset_option autoImplicit false invariable {α : Type} [LinearOrder α] inopen Nat (clog) in/-- Time complexity of mergeSort -/theorem Cslib.Algorithms.Lean.TimeM.mergeSort_time (xs : List α) :    let n := xs.length    (mergeSort xs).time ≤ n * clog 2 n := by  grind [mergeSort_time_le, timeMergeSortRec_le]
See it in the graphDiscuss this resultChallenge it