AFTD Auto-Formalizing Theoretical Domains

rate

defimported Lean

For $\delta \in [0,1]$, the asymptotic rate is \[ R(\delta) \;=\; \limsup_{n\to\infty} \frac{1}{n}\log_2 A(n, \lfloor \delta n \rfloor). \]

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open scoped BigOperators in
set_option maxHeartbeats 800000 in
noncomputable def rate (δ : ℝ) : ℝ
Defined in
TCSlib, `rate`
Lean proof
By Frederick Dehmel, Hydroxyi (from the file's git history), from github.com/Shilun-Allan-Li/tcslib at c8a02591b1e5 (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
none listed
Built on 1
  • codeAFor naturals $n$ and $d$, $A(n,d)$ is the supremum of the cardinalities $k$ for which there is a finite set $C$ of binary codewords…

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open scoped BigOperators in
set_option maxHeartbeats 800000 in
/-- **Definition 2 (asymptotic rate)** from the source file. For `δ ∈ [0,1]`, `rate δ = limsup_{n→∞} (1/n) · log₂ A(n, ⌊δn⌋)`. -/
noncomputable def rate (δ : ℝ) : ℝ :=
  Filter.limsup (fun (n : ℕ) =>
    Real.logb 2 ↑(codeA n ⌊δ * ↑n⌋₊) / (n : ℝ)) Filter.atTop
See it in the graphDiscuss this resultChallenge it