AFTD Auto-Formalizing Theoretical Domains

Cslib.Algorithms.Lean.TimeM.clog2_half_le

theoremverifiedformalizationimported Lean

Key Lemma: ⌈log2 ⌈n/2⌉⌉ ≤ ⌈log2 n⌉ - 1 for 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_half_le (n : ℕ) (h : n > 1) : clog 2 ((n + 1) / 2) ≤ clog 2 n - 1
Formalizes
CSLib, `Cslib.Algorithms.Lean.TimeM.clog2_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.
Verified
08 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Used by 2

Lean source view module on GitHub

set_option relaxedAutoImplicit true inset_option autoImplicit false invariable {α : Type} [LinearOrder α] inopen Nat (clog) in/-- Key Lemma: ⌈log2 ⌈n/2⌉⌉ ≤ ⌈log2 n⌉ - 1 for n > 1 -/@[grind →]lemma Cslib.Algorithms.Lean.TimeM.clog2_half_le (n : ℕ) (h : n > 1) : clog 2 ((n + 1) / 2) ≤ clog 2 n - 1 := by  grind [Nat.clog_of_one_lt one_lt_two h]
See it in the graphDiscuss this resultChallenge it