qary_constant_word_deletion_envelope
def
For deletion radius t, alphabet size q, length n, and threshold r, the explicit upper envelope for the constant-word deletion hinge sum is the sum over z from n to n + t of Nat.choose (n + t) z * (q - 1) ^ (n + t - z) * (Nat.choose z n - r).
Statement
def qary_constant_word_deletion_envelope (t q n r : ℕ) : ℕ- Defined in
- arXiv:2407.10026 "Conditional entropies of k-deletion/insertion channels"
- Verified
- 11 Nov 2026
- Axioms
- none listed
- Used by 1
- op_1534_constant_word_deletion_envelope_eqFor integers t ≥ 1, q ≥ 2, and n ≥ 1, and any threshold r, the t-deletion hinge sum of the all-zero word qary_all_zero_word q n (by omega)…
Read back from the Lean
Definition of a function qary_constant_word_deletion_envelope taking natural numbers t, q, n, and r, returning the natural number given by the sum over z from n to n + t (inclusive) of:
Nat.choose (n + t) z * (q - 1) ^ (n + t - z) * (Nat.choose z n - r)
where all operations (including subtraction) are in ℕ.
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 explicit closed-form upper envelope for the multiple-deletion hinge sum of the constant word. -/ def qary_constant_word_deletion_envelope (t q n r : ℕ) : ℕ := ∑ z ∈ Finset.Icc n (n + t), Nat.choose (n + t) z * (q - 1) ^ (n + t - z) * (Nat.choose z n - r)