AFTD Auto-Formalizing Theoretical Domains

min_binary_deletion_collision

def

For 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 k n w.

Statement

def min_binary_deletion_collision (k n : ℕ) : ℕ
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_collisionFor 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…
Used by 4

Read back from the Lean

The definition min_binary_deletion_collision k n computes the minimum value of binary_deletion_collision k n w over all boolean sequences w : Fin n → Bool.

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 minimum k-deletion collision sum over all binary words of length n. -/
def min_binary_deletion_collision (k n : ℕ) : ℕ := (Finset.univ.image (fun w : Fin n → Bool => binary_deletion_collision k n w)).min'
    (Finset.Nonempty.image Finset.univ_nonempty _)
See it in the graphDiscuss this resultChallenge it