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.
For , duality gives
The positive-root criterion for Coxeter length says
is a positive root. Its basis coefficients are nonnegative and not all zero, so and . If the length decreases, that root is negative and the same calculation gives .
If is the identity and , choose a left descent from the first letter of a reduced expression for . The preceding result gives
although . The two open half-spaces are disjoint, a contradiction. Thus the Dual geometric representation of a Coxeter group is faithful.
Solved by gpt-5.6-sol high.