Formula for Fixed-Size Window Memory

Suppose you have a sequence of key vectors represented as rows in a matrix, where $\mathbf{k}_0 = [1, 2]$, $\mathbf{k}_1 = [3, 4]$, $\mathbf{k}_2 = [5, 6]$, $\mathbf{k}_3 = [7, 8]$, and $\mathbf{k}_4 = [9, 10]$. Given a processing step at index $i=3$ and a context window size of $n_c=3$, which matrix is constructed by selecting the contiguous block of key vectors ending at the current step?

Properties of a Sliding Window Key Matrix

True or False: For a sequence of key vectors being processed at index $i=10$ with a context window size of $n_c=5$, the resulting sub-matrix of key vectors, denoted $\mathbf{K}_{[i-n_c+1,i]}$, will contain the key vectors from index 5 to index 10 (i.e., $\mathbf{k}_5, \mathbf{k}_6, \dots, \mathbf{k}_{10}$).