CommunicationComplexity.Functions.Equality.clog_two_two
theoremverifiedimported Lean
Ceiling logarithm of $2$ in base $2$. The base-$2$ ceiling logarithm of $2$ equals $1$: $\lceil \log_2 2 \rceil = 1$,
i.e.\ Nat.clog 2 2 = 1. This is a small arithmetic fact used in the
deterministic upper bound for the equality function.
Statement
set_option relaxedAutoImplicit false in set_option autoImplicit false in open MeasureTheory in theorem CommunicationComplexity.Functions.Equality.clog_two_two : Nat.clog 2 2 = 1
- Source
- TCSlib, `CommunicationComplexity.Functions.Equality.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.CommunicationComplexity.Functions.Equality.clog_two_two← CommunicationComplexity.Functions.Equality.clog_two_two (TCSlib/CommunicationComplexity/DeterministicCC/FuncEquality.lean:74): verbatim
- Verified
- 07 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Used by 1
- CommunicationComplexity.Functions.Equality.communicationComplexity_leDeterministic complexity upper bound for equality. For every natural number $n$, the deterministic communication complexity of the $n$-bit…
Lean source view module on GitHub
set_option relaxedAutoImplicit false in set_option autoImplicit false in open MeasureTheory in /-- `Nat.clog 2 2 = 1`, kernel-checked (replaces a former `native_decide`). -/ theorem CommunicationComplexity.Functions.Equality.clog_two_two : Nat.clog 2 2 = 1 := Nat.clog_eq_one le_rfl le_rfl