Matsumoto's theorem (group theory)

In group theory, Matsumoto's theorem, proved by Hideya Matsumoto (1964), gives conditions for two reduced words of a Coxeter group to represent the same element.

Statement

If two reduced words represent the same element of a Coxeter group, then Matsumoto's theorem states that the first word can be transformed into the second by repeatedly transforming

xyxy... to yxyx... (or vice versa)

where

xyxy... = yxyx...

is one of the defining relations of the Coxeter group.

Applications

Matsumoto's theorem implies that there is a natural map (not a group homomorphism) from a Coxeter group to the corresponding braid group, taking any element of the Coxeter group represented by some reduced word in the generators to the same word in the generators of the braid group.

gollark: Is it a ewe bee priority queue or just a regular ewe bee queue?

gollark: ubq = uniquely binomial qualifiers

gollark: Some languages don't have "characters" in the same way.

gollark: Unicode does not actually define "characters".

gollark: Well, if you replace your keyboard with a touchscreen, and assign each 10 pixels a codepoint, you can make it work!

References

Matsumoto, Hideya (1964), "Générateurs et relations des groupes de Weyl généralisés", C. R. Acad. Sci. Paris, 258: 3419–3422, MR 0183818

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.