Jump to content
 







Main menu
   


Navigation  



Main page
Contents
Current events
Random article
About Wikipedia
Contact us
Donate
 




Contribute  



Help
Learn to edit
Community portal
Recent changes
Upload file
 








Search  

































Create account

Log in
 









Create account
 Log in
 




Pages for logged out editors learn more  



Contributions
Talk
 



















Contents

   



(Top)
 


1 Definition  



1.1  Elements  





1.2  Group structure  





1.3  Matrix representation  





1.4  Other definitions  







2 Small dihedral groups  





3 The dihedral group as symmetry group in 2D and rotation group in 3D  



3.1  Examples of 2D dihedral symmetry  







4 Properties  



4.1  Conjugacy classes of reflections  







5 Automorphism group  



5.1  Examples of automorphism groups  





5.2  Inner automorphism group  







6 Generalizations  





7 See also  





8 References  





9 External links  














Dihedral group






العربية
Català
Čeština
Deutsch
Español
فارسی
Français

Bahasa Indonesia
Íslenska
Italiano
עברית
Magyar

Nederlands

Polski
Português
Română
Русский
Slovenščina
Suomi
Svenska
ி
Українська
Tiếng Vit

 

Edit links
 









Article
Talk
 

















Read
Edit
View history
 








Tools
   


Actions  



Read
Edit
View history
 




General  



What links here
Related changes
Upload file
Special pages
Permanent link
Page information
Cite this page
Get shortened URL
Download QR code
Wikidata item
 




Print/export  



Download as PDF
Printable version
 




In other projects  



Wikimedia Commons
 
















Appearance
   

 






From Wikipedia, the free encyclopedia
 

(Redirected from Dihedral symmetry)

The symmetry group of a snowflake is D6, a dihedral symmetry, the same as for a regular hexagon.

Inmathematics, a dihedral group is the groupofsymmetries of a regular polygon,[1][2] 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.

The notation for the dihedral group differs in geometry and abstract algebra. In geometry, DnorDihn refers to the symmetries of the n-gon, a group of order 2n. In abstract algebra, D2n refers to this same dihedral group.[3] This article uses the geometric convention, Dn.

Definition[edit]

The word "dihedral" comes from "di-" and "-hedron". The latter comes from the Greek word hédra, which means "face of a geometrical solid". Overall it thus refers to the two faces of a polygon.

Elements[edit]

The six axes of reflection of a regular hexagon

A regular polygon with sides has different symmetries: rotational symmetries and reflection symmetries. Usually, we take here. The associated rotations and reflections make up the dihedral group . If is odd, each axis of symmetry connects the midpoint of one side to the opposite vertex. If is even, there are axes of symmetry connecting the midpoints of opposite sides and axes of symmetry connecting opposite vertices. In either case, there are axes of symmetry and elements in the symmetry group.[4] Reflecting in one axis of symmetry followed by reflecting in another axis of symmetry produces a rotation through twice the angle between the axes.[5]

The following picture shows the effect of the sixteen elements of on a stop sign. Here, the first row shows the effect of the eight rotations, and the second row shows the effect of the eight reflections, in each case acting on the stop sign with the orientation as shown at the top left.

Group structure[edit]

As with any geometric object, the composition of two symmetries of a regular polygon is again a symmetry of this object. With composition of symmetries to produce another as the binary operation, this gives the symmetries of a polygon the algebraic structure of a finite group.[6]

The lines of reflection labelled S0, S1, and S2 remain fixed in space (on the page) and do not themselves move when a symmetry operation (rotation or reflection) is done on the triangle (this matters when doing compositions of symmetries).
The composition of these two reflections is a rotation.

The following Cayley table shows the effect of composition in the group D3 (the symmetries of an equilateral triangle). r0 denotes the identity; r1 and r2 denote counterclockwise rotations by 120° and 240° respectively, and s0, s1 and s2 denote reflections across the three lines shown in the adjacent picture.

r0 r1 r2 s0 s1 s2
r0 r0 r1 r2 s0 s1 s2
r1 r1 r2 r0 s1 s2 s0
r2 r2 r0 r1 s2 s0 s1
s0 s0 s2 s1 r0 r2 r1
s1 s1 s0 s2 r1 r0 r2
s2 s2 s1 s0 r2 r1 r0

For example, s2s1 = r1, because the reflection s1 followed by the reflection s2 results in a rotation of 120°. The order of elements denoting the composition is right to left, reflecting the convention that the element acts on the expression to its right. The composition operation is not commutative.[6]

In general, the group Dn has elements r0, ..., rn−1 and s0, ..., sn−1, with composition given by the following formulae:

In all cases, addition and subtraction of subscripts are to be performed using modular arithmetic with modulus n.

Matrix representation[edit]

The symmetries of this pentagon are linear transformations of the plane as a vector space.

If we center the regular polygon at the origin, then elements of the dihedral group act as linear transformations of the plane. This lets us represent elements of Dnasmatrices, with composition being matrix multiplication. This is an example of a (2-dimensional) group representation.

For example, the elements of the group D4 can be represented by the following eight matrices:

In general, the matrices for elements of Dn have the following form:

rk is a rotation matrix, expressing a counterclockwise rotation through an angle of 2πk/n. sk is a reflection across a line that makes an angle of πk/n with the x-axis.

Other definitions[edit]

Dn can also be defined as the group with presentation

Using the relation , we obtain the relation . It follows that is generated by and . This substitution also shows that has the presentation

In particular, Dn belongs to the class of Coxeter groups.

Small dihedral groups[edit]

Example subgroups from a hexagonal dihedral symmetry

D1isisomorphictoZ2, the cyclic group of order 2.

D2isisomorphictoK4, the Klein four-group.

D1 and D2 are exceptional in that:

The cycle graphs of dihedral groups consist of an n-element cycle and n 2-element cycles. The dark vertex in the cycle graphs below of various dihedral groups represents the identity element, and the other vertices are the other elements of the group. A cycle consists of successive powers of either of the elements connected to the identity element.

Cycle graphs
D1 = Z2 D2 = Z22 = K4 D3 D4 D5
D6 = D3 × Z2 D7 D8 D9 D10 = D5 × Z2
D3 = S3 D4

The dihedral group as symmetry group in 2D and rotation group in 3D[edit]

An example of abstract group Dn, and a common way to visualize it, is the group of Euclidean plane isometries which keep the origin fixed. These groups form one of the two series of discrete point groups in two dimensions. Dn consists of n rotations of multiples of 360°/n about the origin, and reflections across n lines through the origin, making angles of multiples of 180°/n with each other. This is the symmetry group of a regular polygon with n sides (for n ≥ 3; this extends to the cases n = 1 and n = 2 where we have a plane with respectively a point offset from the "center" of the "1-gon" and a "2-gon" or line segment).

Dnisgenerated by a rotation roforder n and a reflection s of order 2 such that

In geometric terms: in the mirror a rotation looks like an inverse rotation.

In terms of complex numbers: multiplication by and complex conjugation.

In matrix form, by setting

and defining and for we can write the product rules for Dnas

(Compare coordinate rotations and reflections.)

The dihedral group D2 is generated by the rotation r of 180 degrees, and the reflection s across the x-axis. The elements of D2 can then be represented as {e, r, s, rs}, where e is the identity or null transformation and rs is the reflection across the y-axis.

The four elements of D2 (x-axis is vertical here)

D2isisomorphic to the Klein four-group.

For n > 2 the operations of rotation and reflection in general do not commute and Dn is not abelian; for example, in D4, a rotation of 90 degrees followed by a reflection yields a different result from a reflection followed by a rotation of 90 degrees.

D4 is nonabelian (x-axis is vertical here).

Thus, beyond their obvious application to problems of symmetry in the plane, these groups are among the simplest examples of non-abelian groups, and as such arise frequently as easy counterexamples to theorems which are restricted to abelian groups.

The 2n elements of Dn can be written as e, r, r2, ... , rn−1, s, r s, r2s, ... , rn−1s. The first n listed elements are rotations and the remaining n elements are axis-reflections (all of which have order 2). The product of two rotations or two reflections is a rotation; the product of a rotation and a reflection is a reflection.

So far, we have considered Dn to be a subgroupofO(2), i.e. the group of rotations (about the origin) and reflections (across axes through the origin) of the plane. However, notation Dn is also used for a subgroup of SO(3) which is also of abstract group type Dn: the proper symmetry group of a regular polygon embedded in three-dimensional space (ifn ≥ 3). Such a figure may be considered as a degenerate regular solid with its face counted twice. Therefore, it is also called a dihedron (Greek: solid with two faces), which explains the name dihedral group (in analogy to tetrahedral, octahedral and icosahedral group, referring to the proper symmetry groups of a regular tetrahedron, octahedron, and icosahedron respectively).

Examples of 2D dihedral symmetry[edit]

Properties[edit]

The properties of the dihedral groups Dn with n ≥ 3 depend on whether n is even or odd. For example, the centerofDn consists only of the identity if n is odd, but if n is even the center has two elements, namely the identity and the element rn/2 (with Dn as a subgroup of O(2), this is inversion; since it is scalar multiplication by −1, it is clear that it commutes with any linear transformation).

In the case of 2D isometries, this corresponds to adding inversion, giving rotations and mirrors in between the existing ones.

For n twice an odd number, the abstract group Dn is isomorphic with the direct productofDn / 2 and Z2. Generally, if m divides n, then Dn has n/m subgroups of type Dm, and one subgroup m. Therefore, the total number of subgroups of Dn (n ≥ 1), is equal to d(n) + σ(n), where d(n) is the number of positive divisorsofn and σ(n) is the sum of the positive divisors of n. See list of small groups for the cases n ≤ 8.

The dihedral group of order 8 (D4) is the smallest example of a group that is not a T-group. Any of its two Klein four-group subgroups (which are normal in D4) has as normal subgroup order-2 subgroups generated by a reflection (flip) in D4, but these subgroups are not normal in D4.

Conjugacy classes of reflections[edit]

All the reflections are conjugate to each other whenever n is odd, but they fall into two conjugacy classes if n is even. If we think of the isometries of a regular n-gon: for odd n there are rotations in the group between every pair of mirrors, while for even n only half of the mirrors can be reached from one by these rotations. Geometrically, in an odd polygon every axis of symmetry passes through a vertex and a side, while in an even polygon there are two sets of axes, each corresponding to a conjugacy class: those that pass through two vertices and those that pass through two sides.

Algebraically, this is an instance of the conjugate Sylow theorem (for n odd): for n odd, each reflection, together with the identity, form a subgroup of order 2, which is a Sylow 2-subgroup (2 = 21 is the maximum power of 2 dividing 2n = 2[2k + 1]), while for n even, these order 2 subgroups are not Sylow subgroups because 4 (a higher power of 2) divides the order of the group.

For n even there is instead an outer automorphism interchanging the two types of reflections (properly, a class of outer automorphisms, which are all conjugate by an inner automorphism).

Automorphism group[edit]

The automorphism groupofDn is isomorphic to the holomorphof/n, i.e., to Hol(/n) = {ax + b | (a, n) = 1} and has order (n), where ϕ is Euler's totient function, the number of kin1, ..., n − 1 coprime to n.

It can be understood in terms of the generators of a reflection and an elementary rotation (rotation by k(2π/n), for k coprimeton); which automorphisms are inner and outer depends on the parity of n.

Examples of automorphism groups[edit]

D9 has 18 inner automorphisms. As 2D isometry group D9, the group has mirrors at 20° intervals. The 18 inner automorphisms provide rotation of the mirrors by multiples of 20°, and reflections. As isometry group these are all automorphisms. As abstract group there are in addition to these, 36 outer automorphisms; e.g., multiplying angles of rotation by 2.

D10 has 10 inner automorphisms. As 2D isometry group D10, the group has mirrors at 18° intervals. The 10 inner automorphisms provide rotation of the mirrors by multiples of 36°, and reflections. As isometry group there are 10 more automorphisms; they are conjugates by isometries outside the group, rotating the mirrors 18° with respect to the inner automorphisms. As abstract group there are in addition to these 10 inner and 10 outer automorphisms, 20 more outer automorphisms; e.g., multiplying rotations by 3.

Compare the values 6 and 4 for Euler's totient function, the multiplicative group of integers modulo n for n = 9 and 10, respectively. This triples and doubles the number of automorphisms compared with the two automorphisms as isometries (keeping the order of the rotations the same or reversing the order).

The only values of n for which φ(n) = 2 are 3, 4, and 6, and consequently, there are only three dihedral groups that are isomorphic to their own automorphism groups, namely D3 (order 6), D4 (order 8), and D6 (order 12).[7][8][9]

Inner automorphism group[edit]

The inner automorphism group of Dn is isomorphic to:[10]

Generalizations[edit]

There are several important generalizations of the dihedral groups:

See also[edit]

References[edit]

  1. ^ Weisstein, Eric W. "Dihedral Group". MathWorld.
  • ^ Dummit, David S.; Foote, Richard M. (2004). Abstract Algebra (3rd ed.). John Wiley & Sons. ISBN 0-471-43334-9.
  • ^ "Dihedral Groups: Notation". Math Images Project. Archived from the original on 2016-03-20. Retrieved 2016-06-11.
  • ^ Cameron, Peter Jephson (1998), Introduction to Algebra, Oxford University Press, p. 95, ISBN 9780198501954
  • ^ Toth, Gabor (2006), Glimpses of Algebra and Geometry, Undergraduate Texts in Mathematics (2nd ed.), Springer, p. 98, ISBN 9780387224558
  • ^ a b Lovett, Stephen (2015), Abstract Algebra: Structures and Applications, CRC Press, p. 71, ISBN 9781482248913
  • ^ Humphreys, John F. (1996). A Course in Group Theory. Oxford University Press. p. 195. ISBN 9780198534594.
  • ^ Pedersen, John. "Groups of small order". Dept of Mathematics, University of South Florida.
  • ^ Sommer-Simpson, Jasha (2 November 2013). "Automorphism groups for semidirect products of cyclic groups" (PDF). p. 13. Archived (PDF) from the original on 2016-08-06. Corollary 7.3. Aut(Dn) = Dn if and only if φ(n) = 2
  • ^ Miller, GA (September 1942). "Automorphisms of the Dihedral Groups". Proc Natl Acad Sci U S A. 28 (9): 368–71. Bibcode:1942PNAS...28..368M. doi:10.1073/pnas.28.9.368. PMC 1078492. PMID 16588559.
  • External links[edit]


    Retrieved from "https://en.wikipedia.org/w/index.php?title=Dihedral_group&oldid=1223141225"

    Categories: 
    Euclidean symmetries
    Finite reflection groups
    Properties of groups
    Hidden categories: 
    Articles with short description
    Short description matches Wikidata
    Articles lacking in-text citations from April 2015
    All articles lacking in-text citations
    Commons category link is on Wikidata
     



    This page was last edited on 10 May 2024, at 04:52 (UTC).

    Text is available under the Creative Commons Attribution-ShareAlike License 4.0; additional terms may apply. By using this site, you agree to the Terms of Use and Privacy Policy. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization.



    Privacy policy

    About Wikipedia

    Disclaimers

    Contact Wikipedia

    Code of Conduct

    Developers

    Statistics

    Cookie statement

    Mobile view



    Wikimedia Foundation
    Powered by MediaWiki