three_deletion_num_embeddings
def
For 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 increasing functions f from Fin n to Fin (n + 3) such that y (f i) = w i for all i.
Statement
def three_deletion_num_embeddings (n : ℕ) (w : Fin n → Bool) (y : Fin (n + 3) → Bool) : ℕ- Defined in
- arXiv:2611.01064 Section 2
- Verified
- 04 Nov 2026
- Axioms
- none listed
- Built on 2
- TotalPreorderA total preorder: a preorder where
≤is total (complete). This is weaker thanLinearOrder— it does NOT require antisymmetry or… - LinearOrder.toTotalPreorderEvery
LinearOrderis aTotalPreorder.
- TotalPreorderA total preorder: a preorder where
- Used by 2
- three_deletion_posteriorFor 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…
- three_deletion_num_embeddings_one_zeroThe binary word of length 1 constantly equal to false has exactly 4 embeddings in the binary word of length 4 constantly equal to false.
Read back from the Lean
Given a natural number n, a function w : Fin n → Bool, and a function y : Fin (n + 3) → Bool, three_deletion_num_embeddings n w y is defined as the cardinality of the finite set of functions f : Fin n → Fin (n + 3) that are strictly monotone (StrictMono f) and satisfy y (f i) = w i for all i : Fin n.
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
/-- Number of length-n subword embeddings of w in a length-(n+3) host word y. -/ def three_deletion_num_embeddings (n : ℕ) (w : Fin n → Bool) (y : Fin (n + 3) → Bool) : ℕ := (Finset.univ.filter (fun f : Fin n → Fin (n + 3) => StrictMono f ∧ ∀ i, y (f i) = w i)).card