AFTD Auto-Formalizing Theoretical Domains

three_deletion_S3

def

For n ≥ 1, three_deletion_S3 n is 3 * n * f 2 + 2 * n * f 3 + n^2 * f 4 + n * (n - 1) * f 6 + Nat.choose n 3 * f 8 + n * f (2 * n) + 2 * f (2 * n + 1) + 2 * f (n + 1), where f t = if t = 0 then 0 else t * Real.logb 2 t.

Statement

noncomputable def three_deletion_S3 (n : ℕ) : ℝ
Defined in
arXiv:2611.01064 Eq. 21
Verified
04 Nov 2026
Axioms
none listed

Read back from the Lean

The definition of a function three_deletion_S3 which takes a natural number $n$ and produces a real number, defined as follows: Let $f : \mathbb{R} \to \mathbb{R}$ be the function mapping $t$ to $0$ if $t = 0$, and to $t \log_2(t)$ if $t \neq 0$. Then three_deletion_S3 n is the sum: $$3n \cdot f(2) + 2n \cdot f(3) + n^2 \cdot f(4) + (n(n - 1)) \cdot f(6) + \binom{n}{3} \cdot f(8) + n \cdot f(2n) + 2 \cdot f(2n + 1) + 2 \cdot f(n + 1)$$ where $n(n - 1)$ and $\binom{n}{3}$ are evaluated on natural numbers (with truncated subtraction on $\mathbb{N}$) before being coerced to $\mathbb{R}$.

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

Lean source view module on GitHub

/-- Entropy correction sum S_3(n) for the three-deletion channel on alternating inputs. -/
noncomputable def three_deletion_S3 (n : ℕ) : ℝ :=
  let f : ℝ → ℝ := fun t => if t = 0 then 0 else t * Real.logb 2 t
  3 * (n : ℝ) * f 2 + 2 * (n : ℝ) * f 3 + (n : ℝ) ^ 2 * f 4 + ((n * (n - 1) : ℕ) : ℝ) * f 6 +
  ((n.choose 3 : ℕ) : ℝ) * f 8 + (n : ℝ) * f (2 * (n : ℝ)) + 2 * f (2 * (n : ℝ) + 1) + 2 * f ((n : ℝ) + 1)
See it in the graphDiscuss this resultChallenge it