Abstract AlgebraSylow TheoremsSome Applications of the Sylow Theorems
Dihedral Groups and Groups of Order 2p
Groups of order 2p are the most concrete family among groups of order pq. When p is an odd prime, the group is either cyclic or has the symmetry pattern of a regular p-gon. In this lesson, the focus keyword is dihedral groups and groups of order 2p. The discussion links Sylow theory with the familiar presentation of a dihedral group. Students often remember the relation ba=a−1b but forget that it comes from a conjugation action on a normal cyclic subgroup.
:::definition[Dihedral Group]
Let n≥3 be an integer. A group Dn is called a dihedral group of degree n if it is generated by elements a and b such that
an=e,b2=e,ba=a−1b.
:::
The element a represents a rotation and the element b represents a reflection. The relation ba=a−1b says that reflecting and then rotating is the same as rotating in the opposite direction and then reflecting. Algebraically, this relation controls every word in the generators.
:::theorem
Let n≥3. The dihedral group Dn has order 2n.
:::
:::proof
Given that Dn=⟨a,b⟩ with an=e, b2=e, and ba=a−1b.
To prove that ∣Dn∣=2n.
Using ba=a−1b, every occurrence of b can be moved to the right of a power of a. Since b2=e, every element of Dn can be written in one of the forms
aioraib,
where 0≤i<n.
Thus
Dn={e,a,a2,…,an−1,b,ab,a2b,…,an−1b}.
The first n elements are rotations and the last n elements are reflections. These two types are distinct, and within each type the displayed elements are distinct because o(a)=n.
Therefore Dn has 2n elements.
Hence ∣Dn∣=2n.
□
:::
:::theorem
Let p be an odd prime. If G is a group of order 2p, then G is cyclic or isomorphic to Dp.
:::
:::proof
Given that p is an odd prime and G is a group of order 2p.
To prove that G is cyclic or isomorphic to Dp.
Let P be a Sylow p-subgroup of G. Since np≡1(modp) and np∣2, we have np=1. Therefore P⊴G.
Choose a∈P with P=⟨a⟩ and o(a)=p. By Cauchy's theorem, choose b∈G with o(b)=2.
Since P is normal, conjugation by b maps P to itself. Thus
bab−1=ar
for some integer r. Since b2=e, conjugation by b has order dividing 2. Therefore
r2≡1(modp).
Thus
r≡1(modp)orr≡−1(modp).
If r≡1(modp), then a and b commute. Since o(a)=p, o(b)=2, and gcd(p,2)=1, the element ab has order 2p. Therefore G is cyclic.
If r≡−1(modp), then
bab−1=a−1.
Equivalently,
ba=a−1b.
Thus G has the defining relations of Dp.
Hence G is cyclic or G≅Dp.
□
:::
This preview shows where the cyclic and dihedral cases come from. A group of order 2p has a normal cyclic subgroup ⟨a⟩ of order p. An element b of order 2 acts on ⟨a⟩ by conjugation, sending a to ar. The equation r2≡1(modp) leaves only the identity action and the inversion action.
:::scientific-preview[Order Two p Action Explorer]
:::
The two cases are two conjugation actions on the same normal cyclic subgroup. The identity action makes the factors commute, while the inversion action creates the dihedral relation.
This calculator checks an action value r modulo an odd prime p. The input is valid for a group of order 2p only when r2≡1(modp). The calculator identifies the cyclic case when r≡1 and the dihedral case when r≡−1. Try p=5, p=7, and p=11.
:::calculator[Cyclic or Dihedral Order Two p Calculator]
Dihedral Groups and Groups of Order 2p | BMLabs | Sylow Theorems | BMLabs Mathematics | BMLabs Mathematics
Groups of order 2p are the most concrete family among groups of order pq. When p is an odd prime, the group is either cyclic or has the symmetry pattern of a regular p-gon. In this lesson, the focus keyword is dihedral groups and groups of order 2p. The discussion links Sylow theory with the familiar presentation of a dihedral group. Students often remember the relation ba=a−1b but forget that it comes from a conjugation action on a normal cyclic subgroup.
Core definition02
Dihedral Group
Let n≥3 be an integer. A group Dn is called a dihedral group of degree n if it is generated by elements a and b such that
an=e,b2=e,ba=a−1b.
The element a represents a rotation and the element b represents a reflection. The relation ba=a−1b says that reflecting and then rotating is the same as rotating in the opposite direction and then reflecting. Algebraically, this relation controls every word in the generators.
Key result04
Let n≥3. The dihedral group Dn has order 2n.
Reasoning pathway05
Given that Dn=⟨a,b⟩ with an=e, b2=e, and ba=a−1b.
To prove that ∣Dn∣=2n.
Using ba=a−1b, every occurrence of b can be moved to the right of a power of a. Since b2=e, every element of Dn can be written in one of the forms
aioraib,
where 0≤i<n.
Thus
Dn={e,a,a2,…,an−1,b,ab,a2b,…,an−1b}.
The first n elements are rotations and the last n elements are reflections. These two types are distinct, and within each type the displayed elements are distinct because o(a)=n.
Therefore Dn has 2n elements.
Hence ∣Dn∣=2n.
□
Key result06
Let p be an odd prime. If G is a group of order 2p, then G is cyclic or isomorphic to Dp.
Reasoning pathway07
Given that p is an odd prime and G is a group of order 2p.
To prove that G is cyclic or isomorphic to Dp.
Let P be a Sylow p-subgroup of G. Since np≡1(modp) and np∣2, we have np=1. Therefore P⊴G.
Choose a∈P with P=⟨a⟩ and o(a)=p. By Cauchy's theorem, choose b∈G with o(b)=2.
Since P is normal, conjugation by b maps P to itself. Thus
bab−1=ar
for some integer r. Since b2=e, conjugation by b has order dividing 2. Therefore
r2≡1(modp).
Thus
r≡1(modp)orr≡−1(modp).
If r≡1(modp), then a and b commute. Since o(a)=p, o(b)=2, and gcd(p,2)=1, the element ab has order 2p. Therefore G is cyclic.
If r≡−1(modp), then
bab−1=a−1.
Equivalently,
ba=a−1b.
Thus G has the defining relations of Dp.
Hence G is cyclic or G≅Dp.
□
This preview shows where the cyclic and dihedral cases come from. A group of order 2p has a normal cyclic subgroup ⟨a⟩ of order p. An element b of order 2 acts on ⟨a⟩ by conjugation, sending a to ar. The equation r2≡1(modp) leaves only the identity action and the inversion action.
Visual laboratory
Order Two p Action Explorer
ORDER TWO P ACTION EXPLORER
Dynamic Sandbox
Initializing Workspace
The two cases are two conjugation actions on the same normal cyclic subgroup. The identity action makes the factors commute, while the inversion action creates the dihedral relation.
This calculator checks an action value r modulo an odd prime p. The input is valid for a group of order 2p only when r2≡1(modp). The calculator identifies the cyclic case when r≡1 and the dihedral case when r≡−1. Try p=5, p=7, and p=11.
Interactive calculator
Cyclic or Dihedral Order Two p Calculator
CYCLIC OR DIHEDRAL ORDER TWO P CALCULATOR
Initializing Workspace
The calculator makes the automorphism step explicit. For an odd prime p, the only solutions of r2≡1(modp) are 1 and −1, producing exactly the cyclic and dihedral cases.
Guided example13
The group D5 has order 10 and is not abelian.
Complete solution14
Let
D5=⟨a,b∣a5=e,b2=e,ba=a−1b⟩.
By the order theorem for dihedral groups,
∣D5∣=2⋅5=10.
If D5 were abelian, then ba=ab. But the defining relation gives
ba=a−1b.
Thus ab=a−1b. Multiplying on the right by b−1=b gives
a=a−1.
Therefore a2=e, contradicting o(a)=5.
Hence D5 is not abelian.
□
Worked problem15
Find the centre of Dn.
Complete solution16
Let
Dn=⟨a,b∣an=e,b2=e,ba=a−1b⟩.
Every element is of the form ai or aib.
First consider ai. It commutes with b if and only if
bai=aib.
Using bai=a−ib, this becomes
a−ib=aib.
Thus
a2i=e,
so n∣2i.
If n is odd, then i≡0(modn), so the only central rotation is e.
If n is even, then i≡0(modn) or i≡n/2(modn), so the central rotations are e and an/2.
Now consider aib. For it to be central, it must commute with a. But
(aib)aa(aib)=aia−1b=ai−1b,=ai+1b.
Equality would give ai−1=ai+1, so a2=e, impossible for n≥3 unless the rotation order collapses. Therefore no reflection is central.
Hence
Z(Dn)={e}
if n is odd, and
Z(Dn)={e,an/2}
if n is even.
□
Independent practice17
Classify all groups of order 14.
Show that a group of order 22 is cyclic or dihedral.
Prove that Dp is nonabelian for every odd prime p.
Answer18
Since 14=2⋅7, every group of order 14 is isomorphic to C14 or D7.
Since 22=2⋅11, every group of order 22 is isomorphic to C22 or D11.
In Dp, the relation ba=a−1b holds. If ab=ba, then a=a−1, so a2=e, contradicting o(a)=p.
Questions to consolidate
Frequently Asked Questions
3
1Why is the Sylow p-subgroup normal in a group of order 2p?
Its number divides 2 and is congruent to 1 modulo p, so it must be 1.
2Why are there only two cases?
Conjugation by an element of order 2 induces an automorphism of Cp whose square is the identity, giving multiplication by 1 or −1.
3Is every group of order 2p abelian?
No. The dihedral group Dp is nonabelian for odd prime p.