Unitary laws satisfy lambda(w*) = conj lambda(w) and |lambda| <= 1, reduce to cyclically reduced words, are determined by them, and the constant law 1 exists.
Let be the set of natural numbers and let . Let , the inverse letters, the lengths , the adjoint words , the reduced words and the set of cyclically reduced words be as in Words in Unitary Letters: Generators, Signs, Inverse Letters, Lengths and Adjoint Words and Reduced and Cyclically Reduced Words in Unitary Letters, with concatenation written ; products of several words are unambiguous by Basic Properties of Words: Associativity, Reversal, Finitely Many Factorisations, and Countability §monoid. Let be the set of unitary laws of -tuples. Let be the field of complex numbers with conjugation and modulus .
Then the following hold.
1. (Adjoints) For every and every , .
2. (Bound) For every and every , .
3. (Stripping a reduced word) Let be reduced. Then there are and with and .
4. (Conjugation invariance) For all and every , . In particular, whenever a reduced satisfies with and , then for every .
5. (Reduction) For every there is with and for every .
6. (Determination by cyclically reduced words) If satisfy for every , then .
7. (Nonemptiness) The map with constant value belongs to ; in particular is nonempty.
Loading…
No relations recorded yet.