AFTD Auto-Formalizing Theoretical Domains

CommunicationComplexity.Deterministic.FiniteMessage.Protocol.clog_two_two

theoremverifiedimported Lean

Ceiling logarithm of two. The ceiling base-$2$ logarithm of $2$ equals $1$: $\lceil \log_2 2 \rceil = 1$, i.e.\ Nat.clog 2 2 = 1. This is a numeric fact used when comparing the complexity of a binary protocol with its finite-message reformulation.

Statement

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
variable {X Y α : Type*} in
theorem CommunicationComplexity.Deterministic.FiniteMessage.Protocol.clog_two_two : Nat.clog 2 2 = 1
Source
TCSlib, `CommunicationComplexity.Deterministic.FiniteMessage.Protocol.clog_two_two`
Lean proof
By Lucy Horowitz, Timothe Kasriel, Mihir Singhal, from github.com/Shilun-Allan-Li/tcslib at c8a02591b1e5 (Copyright (c) 2026 Lucy Horowitz, Timothe Kasriel, and Mihir Singhal. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.25.0.
Verified
07 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Used by 1

Lean source view module on GitHub

set_option relaxedAutoImplicit false in
set_option autoImplicit false in
variable {X Y α : Type*} in
/-- `Nat.clog 2 2 = 1`, kernel-checked (replaces a former `native_decide`). -/
theorem CommunicationComplexity.Deterministic.FiniteMessage.Protocol.clog_two_two : Nat.clog 2 2 = 1 := Nat.clog_eq_one le_rfl le_rfl
See it in the graphDiscuss this resultChallenge it