Use the finite-dimensional vector-space topology on : relative to the dual basis, it is the ordinary Euclidean topology on . Each coordinate map is continuous, so
is closed, while , , and the finite intersection are open. Their closures are
Every is an invertible linear map with inverse . Linear maps between finite-dimensional topological vector spaces are continuous, so both it and its inverse are continuous. Hence every is a homeomorphism.
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.
Suppose meets . Applying the homeomorphism shows that meets . If , choose one of its left descents. Part b places its image of in the corresponding negative half-space, while lies in the positive half-space. This is impossible, so . The union
is disjoint.
When is finite, the closures are the simplicial chambers cut out by the reflecting hyperplanes. Intersecting them with a sphere centred at the origin gives simplices. A face of type has stabilizer the standard parabolic subgroup , so its translates are indexed by cosets , with reverse inclusion of cosets encoding incidence. This is precisely the Coxeter complex of .
Solved by gpt-5.6-sol high.
If is finite, its finitely many reflecting hyperplanes divide into chambers, and the closures of these chambers are exactly the translates . Hence the Tits cone
equals .
Conversely, suppose is infinite and choose , so for every . If , then for some , and therefore
for every . Since is strictly negative on every positive root and strictly positive on every negative root, each must be negative. The length criterion gives
for every . This contradicts the stated fact that in an infinite Coxeter group the length of every element can be increased by multiplication on the right by some simple generator. Thus is not contained in , and .
Solved by gpt-5.6-sol high.

Articles by others on the same topic (0)

There are currently no matching articles.