Coxeter element

Last updated

In mathematics, a Coxeter element is an element of an irreducible Coxeter group which is a product of all simple reflections. The product depends on the order in which they are taken, but different orderings produce conjugate elements, which have the same order. This order is known as the Coxeter number. They are named after British-Canadian geometer H.S.M. Coxeter, who introduced the groups in 1934 as abstractions of reflection groups. [1]

Contents

Definitions

Note that this article assumes a finite Coxeter group. For infinite Coxeter groups, there are multiple conjugacy classes of Coxeter elements, and they have infinite order.

There are many different ways to define the Coxeter number h of an irreducible root system.

The Coxeter number for each Dynkin type is given in the following table:

Coxeter group Coxeter
diagram
Dynkin
diagram
Reflections
[2]
Coxeter number
h
Dual Coxeter numberDegrees of fundamental invariants
An[3,3...,3]CDel node.pngCDel 3.pngCDel node.pngCDel 3.png...CDel 3.pngCDel node.pngCDel 3.pngCDel node.pngDyn-node.pngDyn-3.pngDyn-node.pngDyn-3.png...Dyn-3.pngDyn-node.pngDyn-3.pngDyn-node.pngn + 1n + 12, 3, 4, ..., n + 1
Bn[4,3...,3]CDel node.pngCDel 4.pngCDel node.pngCDel 3.png...CDel 3.pngCDel node.pngCDel 3.pngCDel node.pngDyn-node.pngDyn-4a.pngDyn-node.pngDyn-3.png...Dyn-3.pngDyn-3.pngDyn-node.pngDyn-3.pngDyn-node.pngn22n2n 12, 4, 6, ..., 2n
CnDyn-node.pngDyn-4b.pngDyn-node.pngDyn-3.png...Dyn-3.pngDyn-3.pngDyn-node.pngDyn-3.pngDyn-node.pngn + 1
Dn[3,3,...31,1]CDel nodes.pngCDel split2.pngCDel node.pngCDel 3.png...CDel 3.pngCDel node.pngCDel 3.pngCDel node.pngDyn-branch1.pngDyn-node.pngDyn-3.png...Dyn-3.pngDyn-node.pngDyn-3.pngDyn-node.pngn(n 1)2n 22n 2n; 2, 4, 6, ..., 2n 2
E6[32,2,1]CDel nodea.pngCDel 3a.pngCDel nodea.pngCDel 3a.pngCDel branch.pngCDel 3a.pngCDel nodea.pngCDel 3a.pngCDel nodea.pngDyn2-node.pngDyn2-3.pngDyn2-node.pngDyn2-3.pngDyn2-branch.pngDyn2-3.pngDyn2-node.pngDyn2-3.pngDyn2-node.png3612122, 5, 6, 8, 9, 12
E7[33,2,1]CDel nodea.pngCDel 3a.pngCDel nodea.pngCDel 3a.pngCDel branch.pngCDel 3a.pngCDel nodea.pngCDel 3a.pngCDel nodea.pngCDel 3a.pngCDel nodea.pngDyn2-node.pngDyn2-3.pngDyn2-node.pngDyn2-3.pngDyn2-branch.pngDyn2-3.pngDyn2-node.pngDyn2-3.pngDyn2-node.pngDyn2-3.pngDyn2-node.png6318182, 6, 8, 10,
12, 14, 18
E8[34,2,1]CDel nodea.pngCDel 3a.pngCDel nodea.pngCDel 3a.pngCDel branch.pngCDel 3a.pngCDel nodea.pngCDel 3a.pngCDel nodea.pngCDel 3a.pngCDel nodea.pngCDel 3a.pngCDel nodea.pngDyn2-node.pngDyn2-3.pngDyn2-node.pngDyn2-3.pngDyn2-branch.pngDyn2-3.pngDyn2-node.pngDyn2-3.pngDyn2-node.pngDyn2-3.pngDyn2-node.pngDyn2-3.pngDyn2-node.png12030302, 8, 12, 14,
18, 20, 24, 30
F4[3,4,3]CDel node.pngCDel 3.pngCDel node.pngCDel 4.pngCDel node.pngCDel 3.pngCDel node.pngDyn-node.pngDyn-3.pngDyn-node.pngDyn-4a.pngDyn-node.pngDyn-3.pngDyn-node.png
Dyn-node.pngDyn-3.pngDyn-node.pngDyn-4b.pngDyn-node.pngDyn-3.pngDyn-node.png
241292, 6, 8, 12
G2[6]CDel node.pngCDel 6.pngCDel node.pngDyn-node.pngDyn-6a.pngDyn-node.png
Dyn-node.pngDyn-6b.pngDyn-node.png
6642, 6
H3[5,3]CDel node.pngCDel 5.pngCDel node.pngCDel 3.pngCDel node.png-15102, 6, 10
H4[5,3,3]CDel node.pngCDel 5.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.png-60302, 12, 20, 30
I2(p)[p]CDel node.pngCDel p.pngCDel node.png-pp2, p

The invariants of the Coxeter group acting on polynomials form a polynomial algebra whose generators are the fundamental invariants; their degrees are given in the table above. Notice that if m is a degree of a fundamental invariant then so is h + 2 m.

The eigenvalues of a Coxeter element are the numbers as m runs through the degrees of the fundamental invariants. Since this starts with m = 2, these include the primitive hth root of unity, which is important in the Coxeter plane, below.

The dual Coxeter number is 1 plus the sum of the coefficients of simple roots in the highest short root of the dual root system.

Group order

There are relations between the order g of the Coxeter group and the Coxeter number h: [3]

For example, [3,3,5] has h = 30:

Coxeter elements

Distinct Coxeter elements correspond to orientations of the Coxeter diagram (i.e. to Dynkin quivers): the simple reflections corresponding to source vertices are written first, downstream vertices later, and sinks last. (The choice of order among non-adjacent vertices is irrelevant, since they correspond to commuting reflections.) A special choice is the alternating orientation, in which the simple reflections are partitioned into two sets of non-adjacent vertices, and all edges are oriented from the first to the second set. [4] The alternating orientation produces a special Coxeter element w satisfying where w0 is the longest element, provided the Coxeter number h is even.

For the symmetric group on n elements, Coxeter elements are certain n-cycles: the product of simple reflections is the Coxeter element . [5] For n even, the alternating orientation Coxeter element is:

There are distinct Coxeter elements among the n-cycles.

The dihedral group Dihp is generated by two reflections that form an angle of and thus the two Coxeter elements are their product in either order, which is a rotation by

Coxeter plane

Projection of E8 root system onto Coxeter plane, showing 30-fold symmetry. E8Petrie.svg
Projection of E8 root system onto Coxeter plane, showing 30-fold symmetry.

For a given Coxeter element w, there is a unique plane P on which w acts by rotation by This is called the Coxeter plane [6] and is the plane on which P has eigenvalues and [7] This plane was first systematically studied in ( Coxeter 1948 ), [8] and subsequently used in ( Steinberg 1959 ) to provide uniform proofs about properties of Coxeter elements. [8]

The Coxeter plane is often used to draw diagrams of higher-dimensional polytopes and root systems – the vertices and edges of the polytope, or roots (and some edges connecting these) are orthogonally projected onto the Coxeter plane, yielding a Petrie polygon with h-fold rotational symmetry. [9] For root systems, no root maps to zero, corresponding to the Coxeter element not fixing any root or rather axis (not having eigenvalue 1 or 1), so the projections of orbits under w form h-fold circular arrangements [9] and there is an empty center, as in the E8 diagram at above right. For polytopes, a vertex may map to zero, as depicted below. Projections onto the Coxeter plane are depicted below for the Platonic solids.

In three dimensions, the symmetry of a regular polyhedron, {p, q}, with one directed Petrie polygon marked, defined as a composite of 3 reflections, has rotoinversion symmetry Sh, [2+,h+], order h. Adding a mirror, the symmetry can be doubled to antiprismatic symmetry, Dhd, [2+,h], order 2h. In orthogonal 2D projection, this becomes dihedral symmetry, Dihh, [h], order 2h.

Coxeter groupA3
Td
B3
Oh
H3
Ih
Regular
polyhedron
3-simplex t0.svg
Tetrahedron
{3,3}
CDel node 1.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.png
3-cube t0.svg
Cube
{4,3}
CDel node 1.pngCDel 4.pngCDel node.pngCDel 3.pngCDel node.png
3-cube t2.svg
Octahedron
{3,4}
CDel node 1.pngCDel 3.pngCDel node.pngCDel 4.pngCDel node.png
Dodecahedron H3 projection.svg
Dodecahedron
{5,3}
CDel node 1.pngCDel 5.pngCDel node.pngCDel 3.pngCDel node.png
Icosahedron H3 projection.svg
Icosahedron
{3,5}
CDel node 1.pngCDel 3.pngCDel node.pngCDel 5.pngCDel node.png
Symmetry S4, [2+,4+], (2×)
D2d, [2+,4], (2*2)
S6, [2+,6+], (3×)
D3d, [2+,6], (2*3)
S10, [2+,10+], (5×)
D5d, [2+,10], (2*5)
Coxeter plane
symmetry
Dih4, [4], (*4•)Dih6, [6], (*6•)Dih10, [10], (*10•)
Petrie polygons of the Platonic solids, showing 4-fold, 6-fold, and 10-fold symmetry.

In four dimensions, the symmetry of a regular polychoron, {p, q, r}, with one directed Petrie polygon marked is a double rotation, defined as a composite of 4 reflections, with symmetry +1/h[Ch×Ch] [10] (John H. Conway), (C2h/C1;C2h/C1) (#1', Patrick du Val (1964) [11] ), order h.

Coxeter groupA4B4F4H4
Regular
polychoron
4-simplex t0.svg
5-cell
{3,3,3}
CDel node 1.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.png
4-orthoplex.svg
16-cell
{3,3,4}
CDel node 1.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 4.pngCDel node.png
4-cube graph.svg
Tesseract
{4,3,3}
CDel node 1.pngCDel 4.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.png
24-cell t0 F4.svg
24-cell
{3,4,3}
CDel node 1.pngCDel 3.pngCDel node.pngCDel 4.pngCDel node.pngCDel 3.pngCDel node.png
120-cell graph H4.svg
120-cell
{5,3,3}
CDel node 1.pngCDel 5.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.png
600-cell graph H4.svg
600-cell
{3,3,5}
CDel node 1.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 5.pngCDel node.png
Symmetry+1/5[C5×C5]+1/8[C8×C8]+1/12[C12×C12]+1/30[C30×C30]
Coxeter plane
symmetry
Dih5, [5], (*5•)Dih8, [8], (*8•)Dih12, [12], (*12•)Dih30, [30], (*30•)
Petrie polygons of the regular 4D solids, showing 5-fold, 8-fold, 12-fold and 30-fold symmetry.

In five dimensions, the symmetry of a regular 5-polytope, {p, q, r, s}, with one directed Petrie polygon marked, is represented by the composite of 5 reflections.

Coxeter groupA5B5D5
Regular
polyteron
5-simplex t0.svg
5-simplex
{3,3,3,3}
CDel node 1.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.png
5-orthoplex.svg
5-orthoplex
{3,3,3,4}
CDel node 1.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 4.pngCDel node.png
5-cube graph.svg
5-cube
{4,3,3,3}
CDel node 1.pngCDel 4.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.png
5-demicube t0 D5.svg
5-demicube
h{4,3,3,3}
CDel nodes 10ru.pngCDel split2.pngCDel node.pngCDel 3.pngCDel node.pngCDel 3.pngCDel node.png
Coxeter plane
symmetry
Dih6, [6], (*6•)Dih10, [10], (*10•)Dih8, [8], (*8•)

In dimensions 6 to 8 there are 3 exceptional Coxeter groups; one uniform polytope from each dimension represents the roots of the exceptional Lie groups En. The Coxeter elements are 12, 18 and 30 respectively.

En groups
Coxeter group E6 E7 E8
Graph Up 1 22 t0 E6.svg
122
CDel nodea.pngCDel 3a.pngCDel nodea.pngCDel 3a.pngCDel branch 01lr.pngCDel 3a.pngCDel nodea.pngCDel 3a.pngCDel nodea.png
Gosset 2 31 polytope.svg
231
CDel nodea.pngCDel 3a.pngCDel nodea.pngCDel 3a.pngCDel nodea.pngCDel 3a.pngCDel branch.pngCDel 3a.pngCDel nodea.pngCDel 3a.pngCDel nodea 1.png
E8Petrie.svg
421
CDel nodea 1.pngCDel 3a.pngCDel nodea.pngCDel 3a.pngCDel nodea.pngCDel 3a.pngCDel nodea.pngCDel 3a.pngCDel branch.pngCDel 3a.pngCDel nodea.pngCDel 3a.pngCDel nodea.png
Coxeter plane
symmetry
Dih12, [12], (*12•)Dih18, [18], (*18•)Dih30, [30], (*30•)

See also

Notes

  1. Coxeter, Harold Scott Macdonald; Chandler Davis; Erlich W. Ellers (2006), The Coxeter Legacy: Reflections and Projections, AMS Bookstore, p. 112, ISBN   978-0-8218-3722-1
  2. Coxeter, Regular polytopes, §12.6 The number of reflections, equation 12.61
  3. Regular polytopes, p. 233
  4. George Lusztig, Introduction to Quantum Groups, Birkhauser (2010)
  5. ( Humphreys 1992 , p. 75 )
  6. Coxeter Planes Archived 2018-02-10 at the Wayback Machine and More Coxeter Planes Archived 2017-08-21 at the Wayback Machine John Stembridge
  7. ( Humphreys 1992 , Section 3.17, "Action on a Plane", pp. 76–78 )
  8. 1 2 ( Reading 2010 , p. 2)
  9. 1 2 ( Stembridge 2007 )
  10. On Quaternions and Octonions , 2003, John Horton Conway and Derek A. Smith ISBN   978-1-56881-134-5
  11. Patrick Du Val, Homographies, quaternions and rotations, Oxford Mathematical Monographs, Clarendon Press, Oxford, 1964.

Related Research Articles

<span class="mw-page-title-main">Regular icosahedron</span> Polyhedron with 20 regular triangular faces

In geometry, a regular icosahedron is a convex polyhedron with 20 faces, 30 edges and 12 vertices. It is one of the five Platonic solids, and the one with the most faces.

In geometry, a Platonic solid is a convex, regular polyhedron in three-dimensional Euclidean space. Being a regular polyhedron means that the faces are congruent regular polygons, and the same number of faces meet at each vertex. There are only five such polyhedra:

<span class="mw-page-title-main">Dihedral group</span> Group of symmetries of a regular polygon

In mathematics, a dihedral group is the group of symmetries of a regular polygon, which includes rotations and reflections. Dihedral groups are among the simplest examples of finite groups, and they play an important role in group theory, geometry, and chemistry.

<span class="mw-page-title-main">Dicyclic group</span>

In group theory, a dicyclic group (notation Dicn or Q4n, n,2,2⟩) is a particular kind of non-abelian group of order 4n (n > 1). It is an extension of the cyclic group of order 2 by a cyclic group of order 2n, giving the name di-cyclic. In the notation of exact sequences of groups, this extension can be expressed as:

<span class="mw-page-title-main">Orthogonal group</span> Type of group in mathematics

In mathematics, the orthogonal group in dimension , denoted , is the group of distance-preserving transformations of a Euclidean space of dimension that preserve a fixed point, where the group operation is given by composing transformations. The orthogonal group is sometimes called the general orthogonal group, by analogy with the general linear group. Equivalently, it is the group of orthogonal matrices, where the group operation is given by matrix multiplication. The orthogonal group is an algebraic group and a Lie group. It is compact.

In mathematics, a Coxeter group, named after H. S. M. Coxeter, is an abstract group that admits a formal description in terms of reflections. Indeed, the finite Coxeter groups are precisely the finite Euclidean reflection groups; the symmetry groups of regular polyhedra are an example. However, not all Coxeter groups are finite, and not all can be described in terms of symmetries and Euclidean reflections. Coxeter groups were introduced in 1934 as abstractions of reflection groups, and finite Coxeter groups were classified in 1935.

<span class="mw-page-title-main">Decagon</span> Shape with ten sides

In geometry, a decagon is a ten-sided polygon or 10-gon. The total sum of the interior angles of a simple decagon is 1440°.

In Euclidean geometry, a regular polygon is a polygon that is direct equiangular and equilateral. Regular polygons may be either convex, star or skew. In the limit, a sequence of regular polygons with an increasing number of sides approximates a circle, if the perimeter or area is fixed, or a regular apeirogon, if the edge length is fixed.

<span class="mw-page-title-main">Triacontagon</span> Polygon with 30 edges

In geometry, a triacontagon or 30-gon is a thirty-sided polygon. The sum of any triacontagon's interior angles is 5040 degrees.

In geometry, a Schwarz triangle, named after Hermann Schwarz, is a spherical triangle that can be used to tile a sphere, possibly overlapping, through reflections in its edges. They were classified in Schwarz (1873).

<span class="mw-page-title-main">Coxeter–Dynkin diagram</span> Pictorial representation of symmetry

In geometry, a Coxeter–Dynkin diagram is a graph with numerically labeled edges representing the spatial relations between a collection of mirrors. It describes a kaleidoscopic construction: each graph "node" represents a mirror and the label attached to a branch encodes the dihedral angle order between two mirrors, that is, the amount by which the angle between the reflective planes can be multiplied to get 180 degrees. An unlabeled branch implicitly represents order-3, and each pair of nodes that is not connected by a branch at all represents a pair of mirrors at order-2.

In mathematics, a complex reflection group is a finite group acting on a finite-dimensional complex vector space that is generated by complex reflections: non-trivial elements that fix a complex hyperplane pointwise.

In geometry, a complex polytope is a generalization of a polytope in real space to an analogous structure in a complex Hilbert space, where each real dimension is accompanied by an imaginary one.

<span class="mw-page-title-main">Regular 4-polytope</span> Four-dimensional analogues of the regular polyhedra in three dimensions

In mathematics, a regular 4-polytope or regular polychoron is a regular four-dimensional polytope. They are the four-dimensional analogues of the regular polyhedra in three dimensions and the regular polygons in two dimensions.

In geometry, the regular skew polyhedra are generalizations to the set of regular polyhedra which include the possibility of nonplanar faces or vertex figures. Coxeter looked at skew vertex figures which created new 4-dimensional regular polyhedra, and much later Branko Grünbaum looked at regular skew faces.

<span class="mw-page-title-main">Coxeter notation</span> Classification system for symmetry groups in geometry

In geometry, Coxeter notation is a system of classifying symmetry groups, describing the angles between fundamental reflections of a Coxeter group in a bracketed notation expressing the structure of a Coxeter-Dynkin diagram, with modifiers to indicate certain subgroups. The notation is named after H. S. M. Coxeter, and has been more comprehensively defined by Norman Johnson.

<span class="mw-page-title-main">Regular complex polygon</span> Polygons which have an accompanying imaginary dimension for each real dimension

In geometry, a regular complex polygon is a generalization of a regular polygon in real space to an analogous structure in a complex Hilbert space, where each real dimension is accompanied by an imaginary one. A regular polygon exists in 2 real dimensions, , while a complex polygon exists in two complex dimensions, , which can be given real representations in 4 dimensions, , which then must be projected down to 2 or 3 real dimensions to be visualized. A complex polygon is generalized as a complex polytope in .

In geometry, H. S. M. Coxeter called a regular polytope a special kind of configuration.

<span class="mw-page-title-main">Affine symmetric group</span> Mathematical structure

The affine symmetric groups are a family of mathematical structures that describe the symmetries of the number line and the regular triangular tiling of the plane, as well as related higher-dimensional objects. In addition to this geometric description, the affine symmetric groups may be defined in other ways: as collections of permutations (rearrangements) of the integers that are periodic in a certain sense, or in purely algebraic terms as a group with certain generators and relations. They are studied in combinatorics and representation theory.

References