The length of a pair of matrices is the smallest integer
such that words in the matrices with at most
factors span the unital algebra generated by the pair. Upper bounds for lengths have been much studied. If
is a rank one
(complex) matrix, the length of the irreducible pair
is
and the subwords of
form a basis for
. New examples are given of irreducible pairs of
matrices of length
. There exists an irreducible pair of
matrices of length
. We begin the study of determining lower bounds for lengths.