“…For every , , and , the sequence of (unreduced) words is eventually constant, so that we may define functions by for sufficiently large , and obtain commutative diagrams with injective functions that output stabilized word sequences. (See, for example, [12] or [24]. )…”