AFTD Auto-Formalizing Theoretical Domains

binary_deletion_collision

def

For natural numbers k and n and a binary word w of length n, binary_deletion_collision k n w is the sum over all binary words u of length n - k of the square of binary_deletion_num_embeddings k n u w.

Statement

def binary_deletion_collision (k n : ℕ) (w : Fin n → Bool) : ℕ
Defined in
arXiv:2611.01064: Maximal input entropy for binary two-deletion and two-insertion channels
Verified
10 Nov 2026
Axioms
none listed
Built on 1
  • binary_deletion_num_embeddingsFor natural numbers k and n, a binary word u of length n - k, and a binary word w of length n, binary_deletion_num_embeddings k n u w is…
Used by 3

Read back from the Lean

For natural numbers k and n, and a binary word w : Fin n → Bool, binary_deletion_collision k n w is defined as the sum over all binary words u : Fin (n - k) → Bool of (binary_deletion_num_embeddings k n u w) ^ 2.

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

/-- The k-deletion collision sum of a binary word w of length n. -/
def binary_deletion_collision (k n : ℕ) (w : Fin n → Bool) : ℕ := ∑ u : Fin (n - k) → Bool, (binary_deletion_num_embeddings k n u w) ^ 2
See it in the graphDiscuss this resultChallenge it