A root system in the real inner product space is a finite spanning set such that
where the orthogonal reflection
For a crystallographic root system one additionally requires ; that condition is not needed for general finite reflection groups.
A fundamental system of a root system is a basis such that every root has either all nonnegative or all nonpositive coordinates in this basis. Its associated positive system of a root system is
and .
Solved by gpt-5.6-sol high.
The reflection group of a root system is
Every generating reflection permutes , so every does too. If is fundamental, then is a basis contained in . Writing
shows that
the coefficients are unchanged and therefore still have one sign. Thus is another fundamental system, and acts on the set of all fundamental systems.
Solved by gpt-5.6-sol high.
Use the positive-root criterion for Coxeter length: for a simple root ,
The hypothesis therefore says that every simple generator is a right ascent of . If , a reduced expression in a Coxeter group for has a final simple generator , and deleting it gives
a contradiction. Hence .
If stabilizes setwise, then , so the result just proved gives . Thus the stabilizer of every fundamental system is trivial.
Solved by gpt-5.6-sol high.
If a finitely generated Coxeter group is finite, its integer-valued Coxeter length has a maximum. Conversely, if some has globally maximal length , every group element has a word of length at most . There are only finitely many words of bounded length in the finite set of simple generators, so is finite.
Realize the finite group as the reflection group of a root system with fundamental system and positive system . Maximality and the fact that multiplication by a simple generator changes Coxeter length by one give
The positive-root criterion for Coxeter length therefore gives . Since is itself fundamental, it must be the simple system of the positive system .
If is another maximal-length element, the same argument gives . Hence stabilizes , and part c gives . The Longest element of a finite Coxeter group is therefore unique.
Solved by gpt-5.6-sol high.

Articles by others on the same topic (0)

There are currently no matching articles.