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.
Contents
- Definition
- Properties
- Classification
- List of irreducible complex reflection groups
- Degrees
- Codegrees
- Well generated complex reflection groups
- Shephard groups
- Cartan matrices
- References
Complex reflection groups arise in the study of the invariant theory of polynomial rings. In the mid-20th century, they were completely classified in work of Shephard and Todd. Special cases include the symmetric group of permutations, the dihedral groups, and more generally all finite real reflection groups (the Coxeter groups or Weyl groups, including the symmetry groups of regular polyhedra).
Definition
A (complex) reflection r (sometimes also called pseudo reflection or unitary reflection) of a finite-dimensional complex vector space V is an element
A (finite) complex reflection group
Properties
Any real reflection group becomes a complex reflection group if we extend the scalars from R to C. In particular all Coxeter groups or Weyl groups give examples of complex reflection groups.
A complex reflection group W is irreducible if the only W-invariant proper subspace of the corresponding vector space is the origin. In this case, the dimension of the vector space is called the rank of W.
The Coxeter number
Classification
Any complex reflection group is a product of irreducible complex reflection groups, acting on the sum of the corresponding vector spaces. So it is sufficient to classify the irreducible complex reflection groups.
The irreducible complex reflection groups were classified by G. C. Shephard and J. A. Todd (1954). They found an infinite family G(m,p,n) depending on 3 positive integer parameters (with p dividing m), and 34 exceptional cases, that they numbered from 4 to 37, listed below. The group G(m,p,n), of order mnn!/p, is the semidirect product of the abelian group of order mn/p whose elements are (θa1,θa2, ...,θan), by the symmetric group Sn acting by permutations of the coordinates, where θ is a primitive mth root of unity and Σai≡ 0 mod p; it is an index p subgroup of the generalized symmetric group
Special cases of G(m,p,n):
List of irreducible complex reflection groups
There are a few duplicates in the first 3 lines of this list; see the previous section for details.
For more information, including diagrams, presentations, and codegrees of complex reflection groups, see the tables in (Michel Broué, Gunter Malle & Raphaël Rouquier 1998).
Degrees
Shephard and Todd proved that a finite group acting on a complex vector space is a complex reflection group if and only if its ring of invariants is a polynomial ring (Chevalley–Shephard–Todd theorem). For
Codegrees
For
Well-generated complex reflection groups
By definition, every complex reflection group is generated by its reflections. The set of reflections is not a minimal generating set, however, and every irreducible complex reflection groups of rank n has a minimal generating set consisting of either n or n + 1 reflections. In the former case, the group is said to be well-generated.
The property of being well-generated is equivalent to the condition
For irreducible well-generated complex reflection groups, the Coxeter number h defined above equals the largest degree,
Shephard groups
The well-generated complex reflection groups include a subset called the Shephard groups. These groups are the symmetry groups of regular complex polytopes. In particular, they include the symmetry groups of regular real polyhedra. The Shephard groups may be characterized as the complex reflection groups that admit a "Coxeter-like" presentation with a linear diagram. That is, a Shephard group has associated positive integers p1, …, pn and q1, …, qn − 1 such that there is a generating set s1, …, sn satisfying the relations
and
This information is sometimes collected in the Coxeter-type symbol p1[q1]p2[q2] … [qn − 1]pn, as seen in the table above.
Among groups in the infinite family G(m, p, n), the Shephard groups are those in which p = 1. There are also 18 exceptional Shephard groups, of which three are real.
Cartan matrices
An extended Cartan matrix defines the Unitary group. Shephard groups of rank n group have n generators.
Ordinary Cartan matrices have diagonal elements 2, while unitary reflections do not have this restriction.
For example, the rank 1 group, p[], , is defined by a 1×1 matrix [1-
Given: