The Setting
The anchor in the ordered matrix construction is a fixed binary matrix of size . Lemma 4.1 concerns the patterns in its rows and columns and the words obtained by restricting a row to the last five columns.
Use zero-based indices, with for each of the row and column index sets. Put and .
For nonnegative integers and , the binary digit is the parity of the quotient in (1), where the exponent is truncated at zero: (1)✦
The anchor is the binary matrix defined by (2), where is when and otherwise: (2)✦
The anchor word associated to row , for , is its restriction to the last five columns in their order, as in (3): (3)✦
The Claim
Theorem 1. Let be the anchor in (2), and let be its word map in (3). Its row and column maps satisfy (4) and (5): (4)✦ (5)✦ The zero entries satisfy (6) and (7): (6)✦ (7)✦ The row and column weights obey (8) and (9): (8)✦ (9)✦ The word map satisfies (10): (10)✦
In the paper, the result reads: the rows of are pairwise distinct, as are its columns; every column has at most one zero in the first rows, and every row has at most one zero in the first columns; each row has at least ones and each column has at least ones; the restrictions of rows to columns are the distinct binary words of length five.
What Is Checked
The statements concern the explicit binary matrix of (2) and its word map of (3), defined using the binary digit function of (1).