Cslib.Algorithms.Lean.TimeM.clog2_floor_half_le
theoremverifiedformalizationimported Lean
Same logic for the floor half: ⌈log2 ⌊n/2⌋⌉ ≤ ⌈log2 n⌉ - 1
Statement
set_option relaxedAutoImplicit true in set_option autoImplicit false in variable {α : Type} [LinearOrder α] in open Nat (clog) in @[grind →] lemma Cslib.Algorithms.Lean.TimeM.clog2_floor_half_le (n : ℕ) (h : n > 1) : clog 2 (n / 2) ≤ clog 2 n - 1
- Formalizes
- CSLib, `Cslib.Algorithms.Lean.TimeM.clog2_floor_half_le`
- 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.Cslib.Algorithms.Lean.TimeM.clog2_floor_half_le← Cslib.Algorithms.Lean.TimeM.clog2_floor_half_le (Cslib/Algorithms/Lean/MergeSort/MergeSort.lean:136): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 1
- Cslib.Algorithms.Lean.TimeM.clog2_half_leKey Lemma: ⌈log2 ⌈n/2⌉⌉ ≤ ⌈log2 n⌉ - 1 for n > 1
- Used by 1
- Cslib.Algorithms.Lean.TimeM.some_algebraCslib.Algorithms.Lean.TimeM.some_algebra
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
set_option relaxedAutoImplicit true inset_option autoImplicit false invariable {α : Type} [LinearOrder α] inopen Nat (clog) in/-- Same logic for the floor half: ⌈log2 ⌊n/2⌋⌉ ≤ ⌈log2 n⌉ - 1 -/@[grind →]lemma Cslib.Algorithms.Lean.TimeM.clog2_floor_half_le (n : ℕ) (h : n > 1) : clog 2 (n / 2) ≤ clog 2 n - 1 := by apply Nat.le_trans _ (clog2_half_le n h) apply Nat.clog_monotone grind