Let be the real vector space with basis . The Coxeter Gram matrix defines the symmetric bilinear form
Its diagonal entries are . The Geometric representation of a Coxeter group is generated by the reflections
Each has square one, and on the product has order . The reflections therefore satisfy the Coxeter relations and define a group representation .
Solved by gpt-5.6-sol high.
The Coxeter graph has vertex set . Distinct vertices are joined precisely when , and the edge is labelled when ; the customary unlabelled edge therefore means . The Coxeter system is an Irreducible Coxeter system precisely when this graph is connected.
Solved by gpt-5.6-sol high.
Put
After ordering before , the only nonzero off-diagonal entries between the two blocks occur at and , where they equal . Thus
where the coordinate vectors in the two blocks are understood. Expanding the determinant according to whether neither or both cross-block entries are selected gives
The minus sign is the sign of the transposition pairing the two cross-block entries. This formula remains valid when either diagonal block is singular, so no inverse or Schur complement is needed.
Solved by gpt-5.6-sol high.
All edges in the Type E(p,q,k) Coxeter graph are unlabelled, so the factor in part c is one. Separate the arm of length from the central vertex. The remaining two arms form a type chain, while deleting the central vertex leaves the disjoint type and type chains. Using in the formula from part c yields
The associated bilinear form is degenerate exactly when
The positive-integer solutions of , up to permutation, are , , and . Consequently the degenerate arm-length triples are the permutations of
For every other allowed the determinant is nonzero, so the form is nondegenerate.
Solved by gpt-5.6-sol high.

Articles by others on the same topic (0)

There are currently no matching articles.