qary_all_zero_word
def
For an alphabet size q with 1 ≤ q and length n, the all-zero word is the word in Fin n → Fin q taking constant value 0 (represented by ⟨0, hq⟩ in Fin q).
Statement
def qary_all_zero_word (q n : ℕ) (hq : 1 ≤ q) : Fin n → Fin q- Defined in
- arXiv:2407.10026 "Conditional entropies of k-deletion/insertion channels"
- Verified
- 11 Nov 2026
- Axioms
- none listed
- Used by 4
- op_1534_binary_length_two_one_deletionFor every binary word y of length 2 (y : Fin 2 → Fin 2), the one-deletion hinge sums at thresholds r = 1 and r = 2 satisfy…
- 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)…
- op_1534_ternary_length_two_one_deletionFor every ternary word y of length 2 (y : Fin 2 → Fin 3), the one-deletion hinge sums at thresholds r = 1 and r = 2 satisfy…
- qary_all_zero_word_is_constantFor any alphabet size q with 1 ≤ q and length n, the all-zero word qary_all_zero_word q n hq is a constant word.
Read back from the Lean
The definition qary_all_zero_word takes natural numbers $q$ and $n$, along with a hypothesis $hq : 1 \le q$, and defines a function from $\mathrm{Fin}\ n$ to $\mathrm{Fin}\ q$ that maps every element to $0$ (specifically, the element $\langle 0, hq \rangle \in \mathrm{Fin}\ q$).
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 all-zero word of length n over an alphabet of size q ≥ 1. -/ def qary_all_zero_word (q n : ℕ) (hq : 1 ≤ q) : Fin n → Fin q := fun _ => ⟨0, hq⟩