AFTD Auto-Formalizing Theoretical Domains

three_deletion_posterior

def

For a natural number n, a binary word w : Fin n → Bool, and a binary word y : Fin (n + 3) → Bool, three_deletion_posterior n w y is the real number defined by ((three_deletion_num_embeddings n w y : ℝ) / (8 * ((Nat.choose (n + 3) 3 : ℕ) : ℝ))).

Statement

noncomputable def three_deletion_posterior (n : ℕ) (w : Fin n → Bool) (y : Fin (n + 3) → Bool) : ℝ
Defined in
arXiv:2611.01064 Lemma 2.1
Verified
04 Nov 2026
Axioms
none listed
Built on 1
  • three_deletion_num_embeddingsFor a binary word w of length n and a binary word y of length n + 3, three_deletion_num_embeddings n w y is the number of strictly…
Used by 1
  • three_deletion_entropyFor a natural number n and a binary word w : Fin n → Bool, three_deletion_entropy n w is the real number defined as shannon_entropy…

Read back from the Lean

Given a natural number $n$, a sequence $w : \text{Fin } n \to \text{Bool}$, and a sequence $y : \text{Fin } (n + 3) \to \text{Bool}$, three_deletion_posterior n w y is defined as the real number $\frac{\text{three\_deletion\_num\_embeddings}(n, w, y)}{8 \binom{n + 3}{3}}$.

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

/-- Posterior distribution on transmitted words under three uniform deletions with uniform prior, valued in ℝ. -/
noncomputable def three_deletion_posterior (n : ℕ) (w : Fin n → Bool) (y : Fin (n + 3) → Bool) : ℝ := (three_deletion_num_embeddings n w y : ℝ) / (8 * ((n + 3).choose 3 : ℝ))
See it in the graphDiscuss this resultChallenge it