AFTD Auto-Formalizing Theoretical Domains

Cslib.Algorithms.Lean.TimeM.T

abbrevimported Lean

Upper bound function for merge sort time complexity: T(n) = n * ⌈log₂ n⌉

Statement

set_option relaxedAutoImplicit true in
set_option autoImplicit false in
variable {α : Type} [LinearOrder α] in
open Nat (clog) in
abbrev Cslib.Algorithms.Lean.TimeM.T (n : ℕ) : ℕ
Defined in
CSLib, `Cslib.Algorithms.Lean.TimeM.T`
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
none listed
Used by 1

Lean source view module on GitHub

set_option relaxedAutoImplicit true in
set_option autoImplicit false in
variable {α : Type} [LinearOrder α] in
open Nat (clog) in
/-- Upper bound function for merge sort time complexity: `T(n) = n * ⌈log₂ n⌉` -/
abbrev Cslib.Algorithms.Lean.TimeM.T (n : ℕ) : ℕ := n * clog 2 n
See it in the graphDiscuss this resultChallenge it