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
- min_binary_deletion_collisionFor natural numbers k and n, min_binary_deletion_collision k n is the minimum over all binary words w of length n of…
- binary_deletion_collision_eq_q_ary_twoFor every k, n and binary word w of length n, the binary k-deletion collision sum of w equals the q-ary k-deletion collision sum (q = 2)…
- min_q_ary_deletion_collision_two_eq_min_binaryFor all k and n, the minimum q-ary k-deletion collision sum over words of length n with q = 2 equals the minimum binary k-deletion…
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