Element structure of dihedral groups

From Groupprops
Jump to: navigation, search
This article gives specific information, namely, element structure, about a family of groups, namely: dihedral group.
View element structure of group families | View other specific information about dihedral group

This article discusses the element structure of the dihedral group D_{2n} of degree n and order 2n, given by the presentation:

\langle x,a \mid a^n = x^2 = e, xax^{-1} = a^{-1} \rangle

Here e denotes the identity element.

Summary

The information below is for D_{2n}.

Item Value
order 2n
conjugacy class sizes Case n odd: 1 (1 time), 2 ((n-1)/2 times), n (1 time)
Case n even: 1 (2 times), 2 ((n-2)/2 times), n/2 (2 times)
number of conjugacy classes (n + 3)/2 if n odd, (n + 6)/2 if n even
number of orbits under automorphism group d(n) + 1 where d is the divisor count function if n \ge 3, 2 if n = 2
order statistics Case n odd: \varphi(d) of order d for d | n, n of order 2


Particular cases

n (degree) 2n (order) Degree parity Group Second part of GAP ID number of conjugacy classes ((n+3)/2 if n odd, (n+6)/2 if n even) number of orbits under automorphism group (d(n) + 1 if n \ge 3, 2 if n = 2) element structure page
1 2 odd cyclic group:Z2 1 2 2 element structure of cyclic group:Z2
2 4 even Klein four-group 2 4 2 element structure of Klein four-group
3 6 odd symmetric group:S3 1 3 3 element structure of symmetric group:S3
4 8 even dihedral group:D8 3 5 4 element structure of dihedral group:D8
5 10 odd dihedral group:D10 1 4 3 element structure of dihedral group:D10
6 12 even dihedral group:D12 4 6 5 element structure of dihedral group:D12
7 14 odd dihedral group:D14 1 5 3 element structure of dihedral group:D14
8 16 even dihedral group:D16 7 7 5 element structure of dihedral group:D16
9 18 odd dihedral group:D18 1 6 4 element structure of dihedral group:D18
10 20 even dihedral group:D20 4 8 5 element structure of dihedral group:D20

Odd degree case

This is the case n is odd, so 2n is twice an odd number.

Conjugacy class structure

Nature of conjugacy class Size of each conjugacy class Number of such conjugacy classes Total number of elements
Identity element 1 1 1
Non-identity elements in cyclic subgroup \langle a \rangle, where each element and its inverse form a conjugacy class 2 (n - 1)/2 n - 1
Elements outside the cyclic subgroup \langle a \rangle, all form a single conjugacy class n 1 n
Total -- (n + 3)/2 (number of conjugacy classes) 2n (order of group)


Order information

We have the following number of elements of various orders:

Order type Number of elements of that order Specifics about the elements Number of such order types Total number of elements
d a divisor of n (hence d is odd)</math> \varphi(d), \varphi is the Euler totient function These are all the generators of the cyclic subgroup \langle a^{n/d} \rangle d(n) where d is the divisor count function. \sum_{d | n} \varphi(d) which becomes n
2 n All the elements outside \langle a \rangle 1 n

Equivalence classes up to automorphism

It turns out that the equivalence classes up to automorphism are given precisely by order of elements, i.e., two elements are automorphic elements if and only if they have the same order. Equivalently, two elements are automorphic if and only if they generate the same cyclic subgroup. More explicitly:

Description of equivalence class Number of conjugacy classes per equivalence class Size of each conjugacy class Total number of elements in each equivalence class Number of equivalence classes Total number of conjugacy classes Total number of elements across equivalence classes
Identity element 1 1 1 1 1 1
For each nontrivial divisor d of n, the elements of order d (generators of \langle a^{n/d}) form one equivalence class \varphi(d)/2 2 \varphi(d), \varphi is the Euler totient function d(n) - 1, d(n) is the divisor count function (n - 1)/2 \sum_{d | n, d > 1} \varphi(d) = n - 1
Elements outside the cyclic subgroup \langle a \rangle, of order 2 1 n n 1 1 n
Total -- -- -- d(n) + 1 (n + 3)/2 2n

Even degree case

Suppose n = 2m, and D_{2n} is the dihedral group of order 2n. Then, D_{2n} has the following conjugacy classes (a total of (n + 6)/2 conjugacy classes):

Conjugacy class structure

Nature of conjugacy class Size of each conjugacy class Number of such conjugacy classes Total number of elements
Identity element 1 1 1
Non-identity element a^{n/2} of order 2 in \langle a \rangle 1 1 1
Non-identity elements in cyclic subgroup \langle a \rangle, where each element and its inverse form a conjugacy class 2 (n - 2)/2 n - 2
Elements outside \langle a \rangle, form two conjugacy classes, one for elements of the form a^{2k}x, and the other for elements of the form a^{2k+1}x n/2 2 n
Total -- (n + 6)/2 (number of conjugacy classes) 2n (order of group)

Order information

We have the following number of elements of various orders:

Order Number of elements of that order Specifics about the elements
d a divisor of n other than 2 \varphi(d), \varphi is the Euler totient function These are all the generators of the cyclic subgroup \langle a^{n/d} \rangle
2 n + 1 All the elements outside \langle a \rangle, as well as the element a^{n/2}

Equivalence classes up to automorphism

Note that the data in the table below is not correct for the case n = 2, in which case we get the Klein four-group.

The equivalence classes up to automorphism are as follows:

Description of equivalence class Number of conjugacy classes per equivalence class Size of each conjugacy class Total number of elements in each equivalence class Number of equivalence classes Total number of conjugacy classes Total number of elements across equivalence classes
Identity element 1 1 1 1 1 1
Element a^{n/2} 1 1 1 1 1 1
For each nontrivial divisor d of n other than 2, the elements of order d (generators of \langle a^{n/d}) form one equivalence class \varphi(d)/2 2 \varphi(d), \varphi is the Euler totient function d(n) - 2, d(n) is the divisor count function (n - 2)/2 \sum_{d | n, d > 2} \varphi(d) = n - 2
Elements outside the cyclic subgroup \langle a \rangle, of order 2 2 n/2 n 1 2 n
Total -- -- -- d(n) + 1 (n + 6)/2 2n