Element structure of dihedral group:D8
This article gives specific information, namely, element structure, about a particular group, namely: dihedral group:D8.
View element structure of particular groups | View other specific information about dihedral group:D8
We denote the identity element by . The dihedral group , sometimes called , also called the dihedral group of order eight or the dihedral group acting on four elements, is defined by the following presentation:
The row element is multiplied on the left and the column element is multiplied on the right.
CAUTION: You may be looking instead for dihedral group:D16, the dihedral group of degree 8 and order 16. If so, see element structure of dihedral group:D16.
|order of the whole group (total number of elements)||8|
|conjugacy class sizes|| 1,1,2,2,2|
maximum: 2, number of conjugacy classes: 5, lcm: 2
|order statistics|| 1 of order 1, 5 of order 2, 2 of order 4|
maximum: 4, lcm (exponent of the whole group): 4
Below, we list all the elements, also giving the interpretation of each element under the geometric description of the dihedral group as the symmetries of a 4-gon, and for the corresponding permutation representation (see D8 in S4). Note that for different conventions, one can obtain somewhat different correspondences, so this may not match up with other correspondences elsewhere. Note that the descriptions below assume the left action convention for functions and the corresponding convention for composition, and hence some of the entries may become different if you adopt the right action convention.:
|Element in terms of and||Geometric description||Permutation on vertices||Order of the element|
|(identity element)||does nothing, i.e., leaves the square invariant||1|
|rotation by angle of (i.e., ) counterclockwise||4|
|rotation by angle of (i.e., ), also called a half turn||2|
|rotation by angle of (i.e., ) counter-clockwise, or equivalently, by (i.e., ) clockwise||4|
|reflection about the diagonal joining vertices "2" and "4"||2|
|reflection about the line joining midpoints of opposite sides "14" and "23"||2|
|reflection about the diagonal joining vertices "1" and "3"||2|
|reflection about the line joining midpoints of opposite sides "12" and "34"||2|
Because of the fact that the inner automorphism group is an elementary abelian 2-group, it does not matter which of the two definitions of commutator map we choose ( or ) -- they are both the same map.
In fact, the commutator map sends a pair of elements to if they commute and to if they don't commute.
Conjugacy class structure
FACTS TO CHECK AGAINST FOR CONJUGACY CLASS SIZES AND STRUCTURE:
Divisibility facts: size of conjugacy class divides order of group | size of conjugacy class divides index of center | size of conjugacy class equals index of centralizer
Bounding facts: size of conjugacy class is bounded by order of derived subgroup
Counting facts: number of conjugacy classes equals number of irreducible representations | class equation of a group
|Conjugacy class in terms of||Geometric description of conjugacy class||Conjugacy class as permutations||Size of conjugacy class||Order of elements in conjugacy class||Centralizer of first element of class|
|identity element, does nothing||1||1||whole group|
|half turn, rotation by||1||2||whole group|
|reflections about diagonals||2||2||-- one of the Klein four-subgroups of dihedral group:D8|
|reflections about lines joining midpoints of opposite sides||2||2||-- one of the Klein four-subgroups of dihedral group:D8|
|rotations by odd multiples of||2||4||-- the cyclic maximal subgroup of dihedral group:D8|
The equivalence classes up to automorphisms are:
|Equivalence class under automorphisms in terms of||Geometric description of equivalence class||Equivalence class as permutations||Size of equivalence class||Number of conjugacy classes in it||Size of each conjugacy class|
|identity element, does nothing||1||1||1|
|rotations by odd multiples of||2||1||2|
Convolution algebra on conjugacy classes
Order and power information
Directed power graph
Below is a trimmed version of the directed power graph of the group. There is a dark edge from one vertex to another if the latter is the square of the former. A dashed edge means that the latter is an odd power of the former. We remove all the loops.
|Number||Elements of order exactly that number||Number of such elements||Number of conjugacy classes of such elements||Number of elements whose order divides that number||Number of conjugacy classes whose element order divides that number|
|Number||powers that are not powers for any larger divisor of the group order||Number of such elements||Number of conjugacy classes of such elements||Number of powers||Number of conjugacy classes of powers|