AFTD Auto-Formalizing Theoretical Domains

two_deletion_posterior

def

For a received binary word w of length n, two_deletion_posterior n w y is the posterior probability of transmitting y of length n + 2 after two uniformly chosen deletions under a uniform prior, equal to the number of embeddings divided by 4 * Nat.choose (n + 2) 2.

Statement

noncomputable def two_deletion_posterior (n : ℕ) (w : Fin n → Bool) (y : Fin (n + 2) → Bool) : ℝ
Defined in
arXiv:2611.01064, Lemma 2.1
Verified
03 Nov 2026
Axioms
none listed
Built on 1
  • two_deletion_num_embeddingsFor a binary word w of length n and y of length n + 2, two_deletion_num_embeddings n w y is the number of strictly increasing index…
Used by 1
  • two_deletion_posterior_sum_twoFor every received binary word w of length 2, the posterior distribution two_deletion_posterior 2 w over words of length 4 sums to 1.

Read back from the Lean

A definition of two_deletion_posterior, which takes a natural number n, a sequence w : Fin n → Bool, and a sequence y : Fin (n + 2) → Bool, and returns the real number (two_deletion_num_embeddings n w y : ℝ) / (4 * Nat.choose (n + 2) 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

/-- Posterior probability of transmitted word y given received word w after two deletions under uniform prior. -/
noncomputable def two_deletion_posterior (n : ℕ) (w : Fin n → Bool) (y : Fin (n + 2) → Bool) : ℝ := (two_deletion_num_embeddings n w y : ℝ) / (4 * Nat.choose (n + 2) 2)
See it in the graphDiscuss this resultChallenge it