Dihedral Groups
From Math Images
(44 intermediate revisions not shown.) | |||
Line 1: | Line 1: | ||
- | {{Image Description | + | {{Image Description Ready |
|ImageName=Dihedral Symmetry of Order 12 | |ImageName=Dihedral Symmetry of Order 12 | ||
|Image=17.jpg | |Image=17.jpg | ||
- | |ImageIntro=Each snowflake in the main image has the dihedral symmetry of a natual regular hexagon. The group formed by these symmetries is also called the dihedral group of degree 6. '''Order''' refers to the number of elements in the group, and '''degree''' refers to the number of the sides or the number of rotations. | + | |ImageIntro=Each snowflake in the main image has the dihedral symmetry of a natual regular hexagon. The group formed by these symmetries is also called the dihedral group of degree 6. '''Order''' refers to the number of elements in the group, and '''degree''' refers to the number of the sides or the number of rotations. The order is twice the degree. |
|ImageDescElem=In mathematics, a '''dihedral group''' is the group of symmetries of a regular polygon, including both '''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. | |ImageDescElem=In mathematics, a '''dihedral group''' is the group of symmetries of a regular polygon, including both '''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. | ||
Line 15: | Line 15: | ||
On this page, we will use the notation <math>D_n</math> to describe a dihedral group. For <math>D_n</math>, we will call it ''the dihedral group of order <math>2n</math>'' or ''the group of symmetries of a regular <math>n</math>-gon.'' | On this page, we will use the notation <math>D_n</math> to describe a dihedral group. For <math>D_n</math>, we will call it ''the dihedral group of order <math>2n</math>'' or ''the group of symmetries of a regular <math>n</math>-gon.'' | ||
+ | Below is an example of Dihedral symmetry of <math>D_3, D_4, D_5,</math> and <math>D_6</math>. | ||
+ | [[image:DG29.jpg|Example of Dihedral symmetry|thumb|300px|center]] | ||
|ImageDesc===Elements== | |ImageDesc===Elements== | ||
- | The <math>n^\text{th}</math> dihedral group is the symmetry group of the regular <math>n</math>-sided polygon. The group consists of <math>n</math> reflections, <math>n-1</math> rotations, and the identity transformation. | + | The <math>n^\text{th}</math> dihedral group is the symmetry group of the regular <math>n</math>-sided polygon. The group consists of <math>n</math> reflections, <math>n-1</math> rotations, and the {{EasyBalloon|Link=identity transformation|Balloon=Also called the identity element <math>I</math> (<math>R_0, 1,</math> or <math>e</math>) such that <math>IA=AI=A</math> for every element <math>A \in G</math>.}}. |
Here is an example of <math>D_6</math>. This group contains 12 elements, which are all rotations and reflections. The very first one is the identity transformation. | Here is an example of <math>D_6</math>. This group contains 12 elements, which are all rotations and reflections. The very first one is the identity transformation. | ||
Line 30: | Line 32: | ||
==Complex Plane Presentation== | ==Complex Plane Presentation== | ||
- | For <math>n \geqslant 3</math>, the dihedral group <math>D_n</math> is defined as the rigid motions of the plane preserving a regular <math>n</math>-gon, with the operation of composition. | + | For <math>n \geqslant 3</math>, the dihedral group <math>D_n</math> is defined as the rigid motions of the plane preserving a regular <math>n</math>-gon, with the operation of composition. On complex plane, our model <math>n</math>-gon will be an <math>n</math>-gon centered at the origin, with vertices at {{EasyBalloon|Link=the n-th roots of unity|Balloon=For any x, <math>x^n=1</math>, we can get <math>x=\sqrt[n]{1}</math>. We call this x n-th root of unity.}}. <math>1</math> is always an <math>n</math>-th root of unity, but <math>-1</math> is such a root only if <math>n</math> is even. In general, the roots of unity form a regular polygon with <math>n</math> sides, and each vertex lies on the unit circle. |
<center><gallery widths="250px" heights="250px"> | <center><gallery widths="250px" heights="250px"> | ||
- | Image: | + | Image:DG27.jpg| - <math>5</math>-th root of unity. <math>-1</math> is not a root of unity. |
- | Image: | + | Image:DG26.jpg| - <math>6</math>-th root of unity. <math>-1</math> is a root of unity. |
</gallery></center> | </gallery></center> | ||
+ | |||
+ | The <math>n</math>-th roots of unity are roots <math>\omega = e^{\frac{2 \pi i}{n}}</math> of the {{EasyBalloon|Link=cyclotomic equation|Balloon=Any equation in form of <math>x^p=1.</math>}} <math>x^n=1</math>. | ||
Since a vector on the complex plane can be described as <math>p=a+bi</math>, a vector with an angle <math>\theta</math> counterclockwise from x-axis can be described as <math>p=r\cos \theta +i r\sin \theta</math>, where <math>r=\sqrt{a^2+b^2}</math> is the magnitude of the vector. | Since a vector on the complex plane can be described as <math>p=a+bi</math>, a vector with an angle <math>\theta</math> counterclockwise from x-axis can be described as <math>p=r\cos \theta +i r\sin \theta</math>, where <math>r=\sqrt{a^2+b^2}</math> is the magnitude of the vector. | ||
- | Leonhard Euler's formula says that <math>e^{i \theta}=\cos \theta +i \sin \theta</math>, so any point on complex plane is <math>p=re^{i \theta}</math>. | + | Leonhard Euler's formula says that <math>e^{i \theta}=\cos \theta +i \sin \theta</math>, so any point on the complex plane is <math>p=re^{i \theta}</math>. |
- | For a regular <math>n</math>-gon, the first angle counterclockwise from the x-axis is <math>\frac{2 \pi}{n}</math>, so the | + | For a regular <math>n</math>-gon, the first angle counterclockwise from the x-axis is <math>\frac{2 \pi}{n}</math>, so the primitive root of unity is <math>\omega = e^{\frac{2 \pi i}{n}}</math>. |
<center><gallery widths="250px" heights="250px"> | <center><gallery widths="250px" heights="250px"> | ||
Image:DG19.jpg| - <math>p=a+bi</math> | Image:DG19.jpg| - <math>p=a+bi</math> | ||
Image:DG23.jpg| - <math>p=e^{i \theta}</math> | Image:DG23.jpg| - <math>p=e^{i \theta}</math> | ||
- | Image: | + | Image:DG25.jpg| - <math>\omega = e^{\frac{2 \pi i}{n}}</math> |
</gallery></center> | </gallery></center> | ||
- | Letting <math>\omega = \frac{2 \pi i}{n}</math> denote a primitive <math>n^ \text{th}</math> root of unity, and assuming the polygon is centered at the origin, the rotations <math>R_k</math>, <math>k=0 | + | Letting <math>\omega = \frac{2 \pi i}{n}</math> denote a primitive <math>n^ \text{th}</math> root of unity, and assuming the polygon is centered at the origin, the rotations <math>R_k</math>, <math>k=0, 1, 2, \cdots, n-1</math>(Note: <math>R_0</math> denotes the identity), are given by |
- | <center><math>R_k:z \mapsto \omega^k z,\quad z\in\cnums | + | <center><math>R_k:z \mapsto \omega^k z,\quad z\in\cnums.</math></center> |
- | + | Notation <math>\mapsto</math> means a function. For example: <math>input \mapsto output</math>. | |
+ | |||
+ | For the reflections, <math>S_k</math>, <math>k=0, 1, 2, \cdots, n-1</math>, the functions are given by | ||
<center><math>S_k: z\mapsto \omega^k \bar{z},\quad z\in\cnums.</math></center> | <center><math>S_k: z\mapsto \omega^k \bar{z},\quad z\in\cnums.</math></center> | ||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
==Matrix Representation== | ==Matrix Representation== | ||
Line 93: | Line 75: | ||
<gallery widths="190px" heights="170px"> | <gallery widths="190px" heights="170px"> | ||
- | Image: | + | Image:A001.jpg| - <math>R_0=\bigl(\begin{smallmatrix}1&0\\[0.2em]0&1\end{smallmatrix}\bigr)</math> |
- | Image: | + | Image:A002.jpg| - <math>R_1=\bigl(\begin{smallmatrix}0&-1\\[0.2em]1&0\end{smallmatrix}\bigr)</math> |
- | Image: | + | Image:A003.jpg| - <math>R_2=\bigl(\begin{smallmatrix}-1&0\\[0.2em]0&-1\end{smallmatrix}\bigr)</math> |
- | Image: | + | Image:A004.jpg| - <math>R_3=\bigl(\begin{smallmatrix}0&1\\[0.2em]-1&0\end{smallmatrix}\bigr)</math> |
</gallery> | </gallery> | ||
<gallery widths="190px" heights="170px"> | <gallery widths="190px" heights="170px"> | ||
- | Image: | + | Image:A005.jpg| - <math>S_0=\bigl(\begin{smallmatrix}1&0\\[0.2em]0&-1\end{smallmatrix}\bigr)</math> |
- | Image: | + | Image:A006.jpg| - <math>S_1=\bigl(\begin{smallmatrix}0&1\\[0.2em]1&0\end{smallmatrix}\bigr)</math> |
- | Image: | + | Image:A007.jpg| - <math>S_2=\bigl(\begin{smallmatrix}-1&0\\[0.2em]0&1\end{smallmatrix}\bigr)</math> |
- | Image: | + | Image:A008.jpg| - <math>S_3=\bigl(\begin{smallmatrix}0&-1\\[0.2em]-1&0\end{smallmatrix}\bigr)</math> |
</gallery> | </gallery> | ||
Line 113: | Line 95: | ||
where <math>R_k</math> is a rotation matrix, expressing a counterclockwise rotation through an angle of <math>\frac{2 \pi k}{n}</math>, and <math>S_k</math> is a reflection across a line that makes an angle of <math>\frac{\pi k}{n}</math> with the x-axis. | where <math>R_k</math> is a rotation matrix, expressing a counterclockwise rotation through an angle of <math>\frac{2 \pi k}{n}</math>, and <math>S_k</math> is a reflection across a line that makes an angle of <math>\frac{\pi k}{n}</math> with the x-axis. | ||
- | |||
- | |||
- | + | ==Group Presentation== | |
+ | A presentation of a group is a description of a set <math>I</math> and a subset <math>R</math> of the free group <math>F(I)</math> generated by <math>I</math>, written as <math>\left \langle (x_i)_{i \in I}|(r)_{r \in R} \right \rangle</math>, where the equation <math>r=1</math> (the identity element) is often written in place of the element <math>r</math>. A group presentation defines the quotient group of the free group <math>F(I)</math> by the normal subgroup generated by <math>R</math>, which is the group generated by the generators <math>x_i</math> subject to the relations <math>r \in R</math>. | ||
- | + | We can use the presentation: | |
- | + | <math>D_n = \left \langle r,s|r^n=1,s^2=1,srs=r^{-1} \right \rangle</math>, or | |
- | + | <math>D_n = \left \langle x,y|x^2=1,y^n=1,(xy)^2=1 \right \rangle</math> to define a group, isomorphic to the dihedral group <math>D_n</math> of finite order <math>2n</math>, which is the group of symmetries of a regular <math>n</math>-gon. | |
+ | We will use the second presentation, in which <math>x</math> refers to a reflection, and <math>y</math> refer to a primitive rotation. | ||
+ | |||
+ | :For <math>x^2=1</math>, <math>x</math> means an arbitrary mirror image of the <math>n</math>-gon, and <math>1</math> means the identity. This equation means that if we reflect the <math>n</math>-gon once, you get <math>x</math>. If reflect the <math>n</math>-gon twice, the result will return to the identity. | ||
+ | |||
+ | :For <math>y^n=1</math>, the equation means that <math>y</math> is a rotation, and its <math>n</math>th power <math>y^n</math> equals the identity. That is, if we rotate the <math>n</math>-gon <math>n</math> times, we get back to the identity. | ||
+ | |||
+ | :For <math>(xy)^2=1</math>, <math>xy</math> means the mirror image of <math>y</math>. Reflecting the <math>n</math>-gon through the axis of symmetry of <math>xy</math> twice, the result is the identity. | ||
+ | |||
+ | Following the group presentation, we can label all the reflections and rotations in terms of <math>x</math> and <math>y</math>. | ||
+ | |||
+ | :* Identity: <math>1</math> | ||
+ | :* Rotations: <math>y, y^2, y^3, \cdots, y^{n-1}</math>, and <math>y^n=1</math>, which is the identity. | ||
+ | :* Reflections: <math>x, xy, xy^2, \cdots, xy^{n-1}</math>. There is not <math>xy^n</math>, because <math>y^n=1</math>, and so <math>xy^n=x</math> is the reflection of the identity. | ||
=Properties= | =Properties= | ||
==Cayley Table== | ==Cayley Table== | ||
- | [[ | + | [[Image:Cayleymap.jpg|Image 2 - Cayley Table for <math>D_6</math>|thumb|right|300px]] |
- | + | ||
As with any geometric object, the composition of two symmetries of a regular polygon is again a symmetry. This operation gives the symmetries of a polygon the algebraic structure of a finite group. | As with any geometric object, the composition of two symmetries of a regular polygon is again a symmetry. This operation gives the symmetries of a polygon the algebraic structure of a finite group. | ||
Line 135: | Line 128: | ||
A Cayley table, named after the 19th century British mathematician Arthur Cayley, describes the structure of a finite group by arranging all the possible products of all the group's elements in a square table reminiscent of an addition or multiplication table. | A Cayley table, named after the 19th century British mathematician Arthur Cayley, describes the structure of a finite group by arranging all the possible products of all the group's elements in a square table reminiscent of an addition or multiplication table. | ||
- | + | Image 2 on the right shows the effect of composition in the group <math>D_6</math> (the symmetries of a hexagon). <math>R_0</math> denotes the identity; <math>R_1</math> to <math>R_5</math> denote counterclockwise rotations by 60, 120, 180, 240,and 300 degrees; and <math>S_0</math> to <math>S_5</math> denote reflections across the six diagonals. In general, <math>ab</math> denotes the entry at the intersection of the row with <math>a</math> at the left and the column with <math>b</math> at the top. | |
- | In the table, the same or different rotations and reflections work together and result in a new rotation or reflection. For example, look first at the vertical axis to find a element, <math>R_4</math>. Then look at the horizontal axis to get the second element for our composition. We choose <math>S_3</math>. Composing two elements is just the progression of a rotation or a reflection followed by another rotation or a reflection. In this case, our elements are <math>R_4</math> and <math>S_3</math>. First we rotate the hexagon counterclockwise 240 degrees, and then reflect it along the axis of symmetry of <math>S_3</math>. The result is the same as | + | In the table, the same or different rotations and reflections work together and result in a new rotation or reflection. For example, look first at the vertical axis to find a element, <math>R_4</math>. Then look at the horizontal axis to get the second element for our composition. We choose <math>S_3</math>. Composing two elements is just the progression of a rotation or a reflection followed by another rotation or a reflection. In this case, our elements are <math>R_4</math> and <math>S_3</math>. First we rotate the hexagon counterclockwise 240 degrees, and then reflect it along the axis of symmetry of <math>S_3</math>. The result is the same as reflecting the identity transformation through an angle of 60 degrees, which is <math>S_1</math>. See Example 1 below. |
- | <gallery widths="800px" heights="179px"> | + | <gallery widths="800px" heights="179px"> |
- | Image:DG10.jpg| Example 1 - Procedure of <math>R_4 S_3= | + | Image:DG10.jpg| Example 1 - Procedure of <math>R_4 S_3=S_1</math> |
</gallery> | </gallery> | ||
- | Now, look back to | + | Now, look back to Image 2, you will find that the intersection of <math>R_4</math> in left column and <math>S_3</math> in top row is <math>S_1</math>. However, you will find the intersection of <math>S_3 </math> in left column and <math>R_4</math> in top row is <math>R_5</math>. If you like, you can create your own Cayley table for a dihedral group of any order and find the natual rule for it. |
- | ===Explore Cayley Table=== | + | ===Explore the Cayley Table=== |
Perhaps the most important feature of this table is that it has been completely filled in without introducing any new motions. | Perhaps the most important feature of this table is that it has been completely filled in without introducing any new motions. | ||
Line 153: | Line 146: | ||
:* '''Closure:''' Algebraically, this says that if <math>A</math> and <math>B</math> are in <math>D_6</math>, then so is <math>AB</math>. This property is called closure, and it is one of the requirements for a mathematical system to be a group. | :* '''Closure:''' Algebraically, this says that if <math>A</math> and <math>B</math> are in <math>D_6</math>, then so is <math>AB</math>. This property is called closure, and it is one of the requirements for a mathematical system to be a group. | ||
- | :* '''identity:''' Notice that | + | :* '''identity:''' Notice that if <math>A</math> is any element of <math>D_6</math>, then <math>AR_0=R_0 A=A</math>. Thus, combining any element <math>A</math> on either side with <math>R_0</math> yields <math>A</math> back again. An element <math>R_0</math> with this property is called an identity, and every group must have one. |
- | :* '''Inverse:''' We see that for each element <math>B</math> in <math>D_6</math> such that <math>AB=BA=R_0</math>. In this case, <math>B</math> is said to be the inverse of <math>A</math> and vise versa. The term inverse is a descriptive one, for if <math>A</math> and <math>B</math> are inverses of each other, then <math>B</math> "un-does" whatever <math>A</math> "does", in the sense that <math>A</math> and <math>B</math> taken together in either order produce <math>R_0</math>, representing no change. | + | :* '''Inverse:''' We see that for each element <math>B</math> in <math>D_6</math>, there exists an element <math>A</math> such that <math>AB=BA=R_0</math>. In this case, <math>B</math> is said to be the inverse of <math>A</math> and vise versa. The term inverse is a descriptive one, for if <math>A</math> and <math>B</math> are inverses of each other, then <math>B</math> "un-does" whatever <math>A</math> "does", in the sense that <math>A</math> and <math>B</math> taken together in either order produce <math>R_0</math>, representing no change. |
- | :* '''Non-Abelian:''' Another property of <math>D_6</math> deserves special comment. Obverse that <math>S_1 R_3=R_3 S_1</math>, but <math>S_3 R_4 \neq R_4 S_3</math>. Thus in a group <math>ab</math> may or may not be the same as <math>ba</math>. If it happens that <math>ab=ba</math> for all choices of group elements <math>a</math> and <math>b</math>, we say the group is ''commutative'' or --better yet-- Abelian (in honor of the great Norwegian mathematician Niel Abel). Otherwise, we say the group is non-Abelian. All dihedral groups are non-Abelian, except <math>D_2</math>. | + | :* '''Non-Abelian:''' Another property of <math>D_6</math> deserves special comment. Obverse that <math>S_1 R_3=R_3 S_1</math>, but <math>S_3 R_4 \neq R_4 S_3</math>. Thus in a group <math>ab</math> may or may not be the same as <math>ba</math>. If it happens that <math>ab=ba</math> for all choices of group elements <math>a</math> and <math>b</math>, we say the group is ''commutative'' or --better yet-- Abelian (in honor of the great Norwegian mathematician Niel Abel). Otherwise, we say the group is non-Abelian. All dihedral groups are non-Abelian, except <math>D_1</math> and <math>D_2</math>. |
:* '''Associativity:''' For all dihedral groups, it holds true that <math>(ab)c=a(bc)</math> for all a, b, c in the group. | :* '''Associativity:''' For all dihedral groups, it holds true that <math>(ab)c=a(bc)</math> for all a, b, c in the group. | ||
- | [[ | + | [[Image:Multitable.jpg|Image 3 - Multiplication Table for <math>D_6</math>|thumb|right|200px]] |
- | If we want to know what is the composition of any two elements, it is | + | |
+ | |||
+ | If we want to know what is the composition of any two elements, it is convenient to use a Cayley map, because it tells us the result directly. But when we want to know the gradual change of the compositions, we will need another tool, a multi-colored Muplication Table. | ||
Line 172: | Line 167: | ||
<big>'''Muptiplication Table'''</big> | <big>'''Muptiplication Table'''</big> | ||
- | + | In a Multiplication Table, each color represents one rotation or reflection. In Image 3, pink colors represent rotations, and the deepest pink represents the identity transformation. Green colors represent all the six reflections. | |
- | From the changing of color, we can observe that the gradual change of the composition of two elements in <math>D_6</math>. However, we cannot | + | From the changing of color, we can observe that the gradual change of the composition of two elements in <math>D_6</math>. However, we cannot easily determine the exact result of composition by observing directly Image 3. |
Line 192: | Line 187: | ||
- | ==Uniqueness of the Identity== | + | ==Uniqueness of the Identity== |
''In a dihedral group <math>D_n</math>, there is only one identity element. | ''In a dihedral group <math>D_n</math>, there is only one identity element. | ||
'''PROOF:''' | '''PROOF:''' | ||
- | Suppose both <math>R_0</math> and R_0' are identities of <math>D_n</math>. Then, | + | Suppose both <math>R_0</math> and <math>R_0'</math> are identities of <math>D_n</math>. Then, |
:{{EquationRef2|Unique Identity|Eq. 1}} <math>aR_0=a</math> for all <math>a</math> in <math>D_n</math>, and | :{{EquationRef2|Unique Identity|Eq. 1}} <math>aR_0=a</math> for all <math>a</math> in <math>D_n</math>, and | ||
Line 238: | Line 233: | ||
Since <math>(ab)(ab)^{-1}=R_0</math> and | Since <math>(ab)(ab)^{-1}=R_0</math> and | ||
- | <math>(ab)(b^{-1} a^{-1})=a( | + | <math>(ab)(b^{-1} a^{-1})=a(bb^{-1})a^{-1}=aR_0a^{-1}=aa^{-1}=R_0</math>, |
- | we have by Uniqueness of Inverses theorem that <math>(ab)</math> | + | we have by the Uniqueness of Inverses theorem that <math>(ab)</math> has only one inverse <math>x</math> such that <math>(ab)x=R_0</math>. |
- | We get <math>(ab)^{-1}=(b^{-1} a^{-1})</math>. | + | We get <math>x=(ab)^{-1}=(b^{-1} a^{-1})</math>. |
- | ==3D | + | ==3D Rotational Symmetry== |
- | + | <math>Dn</math> consists of <math>n</math> rotations of multiples of <math>\frac{360^\circ}{n}</math> about the origin, and reflections across <math>n</math> lines through the origin, making angles of multiples of <math>\frac{180^\circ}{n}</math> with each other. | |
If we put a dihedral group in three dimensions, the reflections are also rotations of <math>180^\circ</math> | If we put a dihedral group in three dimensions, the reflections are also rotations of <math>180^\circ</math> | ||
Line 253: | Line 248: | ||
The proper symmetry group of a regular polygon embedded in three-dimensional space (if <math>n \geqslant 3</math>). 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. | The proper symmetry group of a regular polygon embedded in three-dimensional space (if <math>n \geqslant 3</math>). 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. | ||
- | = | + | =Infinite Dihedral Groups= |
+ | |||
+ | The infinite dihedral group <math>Dih(C_\infty)</math> is denoted by <math>D_\infty</math>. The infinite dihedral group can be described as the group of symmetries of a circle, which has infinite symmetries. | ||
+ | |||
+ | We use the group presentation: | ||
+ | |||
+ | <math>D_\infty = \langle r, s \mid s^2 = 1, srs = r^{-1} \rangle </math>, or | ||
+ | |||
+ | <math>D_\infty = \langle x, y \mid x^2 = y^2 = 1 \rangle </math> to represente the infinite dihedral group. | ||
+ | |||
+ | In the presentation, it says that because there are infinitely many symmetries, we can never rotate back to the identity, and so there are infinitely many rotations and reflections. | ||
+ | |||
+ | |||
+ | =Subgroups= | ||
'''Definition: A subgroup is a subset <math>H</math> of group elements of a group <math>G</math> that satisfies the four group requirements. It must therefore contain the identity element. "<math>H</math> is a subgroup of <math>G</math>" is written as <math>H \subseteq G</math>, or sometimes <math>H \leq G</math>.'''<sup>[[#References|[1]]]</sup> | '''Definition: A subgroup is a subset <math>H</math> of group elements of a group <math>G</math> that satisfies the four group requirements. It must therefore contain the identity element. "<math>H</math> is a subgroup of <math>G</math>" is written as <math>H \subseteq G</math>, or sometimes <math>H \leq G</math>.'''<sup>[[#References|[1]]]</sup> | ||
- | Now we want to know exactly how many subgroups for <math>D_n</math>, and what | + | Now we want to know exactly how many subgroups for <math>D_n</math>, and what they are. Fortunately, mathematician Stephan A. Cavior had already proved this for us in 1975. In the theorem, for any dihedral group in order of <math>2n</math>, there are <math>\tau(n) + \sigma(n)</math> subgroups in total, including <math>\{1\}</math> and <math>D_{n}</math>. <math>\{1\}</math> is just the identity itself. |
- | |||
- | |||
- | |||
- | :*<math>\ | + | <big>'''Definitions of Terms'''</big> |
+ | :*<math>\tau(n)</math>: the number of divisors of <math>n</math>, | ||
::e.g. <math>\tau(12)=6</math>. | ::e.g. <math>\tau(12)=6</math>. | ||
- | :*<math>\mathbb{Z}/n \mathbb{Z}</math>: the notation | + | :*<math>\sigma(n)</math>: the sum of divisors of <math>n</math>, |
+ | ::e.g. <math>\sigma(12)=1 + 2 + 3 + 4 + 6 + 12=28</math>. | ||
+ | |||
+ | :*<math>\mathbb{Z}/n \mathbb{Z}</math>: the notation for the cyclic group of order <math>n</math>, can be also written as <math>\mathbb{Z}_n</math>. This is a quotient group presentation. | ||
:*<math>d \mid n</math>: <math>d</math> is a divisor of <math>n</math>. | :*<math>d \mid n</math>: <math>d</math> is a divisor of <math>n</math>. | ||
Line 275: | Line 284: | ||
:*<math>[D_{n}:N]=2</math>: the index. <math>[D_{n}:N]=2</math> means <math>\frac{|D_n|}{|N|}=2</math>. | :*<math>[D_{n}:N]=2</math>: the index. <math>[D_{n}:N]=2</math> means <math>\frac{|D_n|}{|N|}=2</math>. | ||
- | :*<math>\{ab^{i+km}: \ 0 \leq k < d \}</math>: a set with elements | + | :*<math>\{ab^{i+km}: \ 0 \leq k < d \}</math>: a set with elements looking like <math>ab^{i+km}</math>. |
- | :*<math>G(i,d): this means a group. <math>i</math> is the index, which | + | :*<math>G(i,d)</math>: this means a group. <math>i</math> is the index, which labels all the elements; <math>d</math> is the order of the group. |
+ | {{SwitchPreview|ShowMessage=Click to show the proof|HideMessage=Click to hide the proof|PreviewText=This proof is complicated.|FullText= | ||
After we know what kind of group can be a subgroup of a dihedral group <math>D_n</math>, the dihedral group of order <math>2n</math>, we will start to find all subgroups of <math>D_n</math>. | After we know what kind of group can be a subgroup of a dihedral group <math>D_n</math>, the dihedral group of order <math>2n</math>, we will start to find all subgroups of <math>D_n</math>. | ||
Line 305: | Line 315: | ||
- | {{EquationRef2|Subgroup|Lemma 3.}}Given <math>d \mid n</math>, let <math>m = n/d</math>. For every <math>0 \leq i < n</math> let <math>A(i,d) = \{ab^{i+km}: \ 0 \leq k < d \}</math>. Let <math>B(i,d) = A(i,d) \cup \langle b^m \rangle</math>. Then <math>B(i,d)</math> is a subgroup of <math>D_{n}</math> and <math>|B(i,d)|=2d</math>. We also have <math>|\{B(i,d) : \ 0 \leq i < n \}|=m=n/d.</math> | + | {{EquationRef2|Subgroup|Lemma 3.}}Given <math>d \mid n</math>, let <math>m = n/d</math>. For every <math>0 \leq i < n</math> let <math>A(i,d) = \{ab^{i+km}: \ 0 \leq k < d \}</math>, where <math>a</math> denotes a reflection and <math>b</math> denotes a primitive rotation. Let <math>B(i,d) = A(i,d) \cup \langle b^m \rangle</math>. Then <math>B(i,d)</math> is a subgroup of <math>D_{n}</math> and <math>|B(i,d)|=2d</math>. We also have <math>|\{B(i,d) : \ 0 \leq i < n \}|=m=n/d.</math> |
{{HideThis|1=The Proof|2= | {{HideThis|1=The Proof|2= | ||
- | '''Proof.''' | + | '''Proof.''' If <math>ab^{i+km}=ab^{i+rm}</math>, for some <math>0 \leq k,r < d</math>, then <math>b^{(k-r)m}=1</math> and thus <math>d \mid k-r</math>, because <math>|b|=n=md</math>. |
- | + | ||
- | If <math>ab^{i+km}=ab^{i+rm}</math>, for some <math>0 \leq k,r < d</math>, then <math>b^{(k-r)m}=1</math> and thus <math>d \mid k-r</math>, because <math> | + | |
Therefore <math>k=r</math> because <math>0 \leq k,r < d</math>. | Therefore <math>k=r</math> because <math>0 \leq k,r < d</math>. | ||
Line 315: | Line 323: | ||
So we have proved that <math>|A(i,d)|=d</math>. | So we have proved that <math>|A(i,d)|=d</math>. | ||
- | Clearly <math>A(i,d) \cap \langle b^m \rangle = \emptyset</math> and <math>|\langle b^m \rangle = d</math>, because <math> | + | Clearly <math>A(i,d) \cap \langle b^m \rangle = \emptyset</math> and <math>|\langle b^m \rangle | = d</math>, because <math>|b|=n</math>. |
Thus <math>|B(i,d)|=|A(i,d)| + |\langle b^m \rangle|=2d</math>. | Thus <math>|B(i,d)|=|A(i,d)| + |\langle b^m \rangle|=2d</math>. | ||
Line 361: | Line 369: | ||
So, by '''Case 1.''' and '''Case 2.''' the number of subgroups of <math>D_{n}</math> is <math>\tau(n) + \sigma(n)\ </math>. | So, by '''Case 1.''' and '''Case 2.''' the number of subgroups of <math>D_{n}</math> is <math>\tau(n) + \sigma(n)\ </math>. | ||
- | + | }} | |
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
Line 383: | Line 380: | ||
==In Music== | ==In Music== | ||
- | The sequence of pitches which form a musical melody can be transposed or inverted. Since the 1970s, music theorists have modeled musical transposition and inversion in terms of an action of the dihedral group of order 24. More recently music theorists have found an intriguing second way that the dihedral group of order 24 acts on the set of major and minor chords.<sup>[[#References|[3]]]</sup> | + | The sequence of pitches which form a musical melody can be transposed or inverted. Since the 1970s, music theorists have modeled musical transposition and inversion in terms of an action of the dihedral group of order 24. More recently music theorists have found an intriguing second way that the dihedral group of order 24 acts on the set of major and minor chords.<sup>[[#References|[3]]]</sup> |
<div id="Example of Dihedral Groups in Music"></div> [[Image:DG17.jpg|frame| [[Dihedral Groups#Example of Dihedral Groups in Music|Example of Dihedral Groups in Music]]. Created by Benson, Dave J.[http://www.maths.abdn.ac.uk/~bensondj/html/music.pdf http://www.maths.abdn.ac.uk/~bensondj/html/music.pdf]|thumb|center|500px]] | <div id="Example of Dihedral Groups in Music"></div> [[Image:DG17.jpg|frame| [[Dihedral Groups#Example of Dihedral Groups in Music|Example of Dihedral Groups in Music]]. Created by Benson, Dave J.[http://www.maths.abdn.ac.uk/~bensondj/html/music.pdf http://www.maths.abdn.ac.uk/~bensondj/html/music.pdf]|thumb|center|500px]] | ||
- | Dihedral groups as a kind of special symmetric groups are studied in music. In music, we use operations | + | Dihedral groups as a kind of special symmetric groups are studied in music. In music, we use the operations Transposition and Inversion, which are denoted as <math>T</math> and <math>I</math>, to represente rotations and reflections in dihedral groups. |
- | Musicians usually study | + | Musicians usually study <math>D_{12}</math>, because 12 is the length of a normal cycle in music: C C<sup>♯</sup> D E<sup>♭</sup> E F F<sup>♯</sup> G G<sup>♯</sup> A B<sup>♭</sup> B, and then C again. |
- | Based on this 12 | + | Based on this 12 element cycle, <math>D_{12}</math> is important in music theory. Musicians use Transpositions and Inversions (rotations and reflections) of a simple note to create other notes to complete a final composition. |
A transposition of a sequence <math>x</math> of pitch classes by <math>n</math> semitones is the sequence <math>T^n(x)</math> in which each of the pitch classes in <math>x</math> has been increased by <math>n</math> semitones. | A transposition of a sequence <math>x</math> of pitch classes by <math>n</math> semitones is the sequence <math>T^n(x)</math> in which each of the pitch classes in <math>x</math> has been increased by <math>n</math> semitones. | ||
Line 397: | Line 394: | ||
So for example if | So for example if | ||
- | :<math>x=3 0 8</math>, | + | :<math>x=3 0 8</math>, where the numbers denote pitches, |
then | then | ||
Line 403: | Line 400: | ||
:<math>T^4(x)=T^4(3 0 8) = 7 4 0</math>. | :<math>T^4(x)=T^4(3 0 8) = 7 4 0</math>. | ||
- | When doing the operation <math>T^n(x)</math>, add <math>n</math> to each digit of <math>x</math>, and use | + | When doing the operation <math>T^n(x)</math>, add <math>n</math> to each digit of <math>x</math>, and use arithmetic modulo 12 (clock arithmetic) when the resulting digit is over 12. For instance, in adding 4 to 8, the result is 12, but <math>12 \equiv 0 \pmod{12}.\,</math> |
- | Turning to the next operation, inversion <math>I(x)</math> of a sequence <math>x</math> just | + | Turning to the next operation, inversion <math>I(x)</math> of a sequence <math>x</math> just replaces each pitch class by its negative (in clock arithmetic). |
So in the first example above with <math>x = 3 0 8</math>, we have | So in the first example above with <math>x = 3 0 8</math>, we have | ||
Line 411: | Line 408: | ||
:<math>I(x) = 9 0 4</math>. | :<math>I(x) = 9 0 4</math>. | ||
- | To do the operation <math>I(x)</math>, we need to do | + | To do the operation <math>I(x)</math>, we need to do subtraction in clock arithmetic. For instance, if we want to get 12 from 3, we need to add 9. 0 is already 12, so we need to add 0. |
<div id="Operation in Music"></div> [[Image:DG16.jpg|frame| [[Dihedral Groups#Operation in Music|Operation in Music]]. Created by Crans, Alissa S. [http://myweb.lmu.edu/acrans/MusicalActions.PDF http://myweb.lmu.edu/acrans/MusicalActions.PDF]|thumb|center|700px]] | <div id="Operation in Music"></div> [[Image:DG16.jpg|frame| [[Dihedral Groups#Operation in Music|Operation in Music]]. Created by Crans, Alissa S. [http://myweb.lmu.edu/acrans/MusicalActions.PDF http://myweb.lmu.edu/acrans/MusicalActions.PDF]|thumb|center|700px]] | ||
Line 431: | Line 428: | ||
[8] <sup>[[Dihedral Groups#References|[1]]]</sup>Scott, W. R. ''Group Theory.'' New York: Dover, 1987. | [8] <sup>[[Dihedral Groups#References|[1]]]</sup>Scott, W. R. ''Group Theory.'' New York: Dover, 1987. | ||
- | [9] <sup>[[Dihedral Groups#References|[2]]]</sup>Hungerford, Thomas W. ''Graduate Texts in Mathematics - Algebra.'' New York | + | [9] <sup>[[Dihedral Groups#References|[2]]]</sup>Hungerford, Thomas W. ''Graduate Texts in Mathematics - Algebra.'' New York: Springer, 1974. |
[10] <sup>[[Dihedral Groups#References|[3]]]</sup>Crans, Alissa S., Fiore, Thomas M. and Satyendra, Ramon. ''Musical Actions of Dihedral Groups.'' University of South Florida. Nov 3, 2007. Retrieved from [http://myweb.lmu.edu/acrans/MusicalActions.PDF http://myweb.lmu.edu/acrans/MusicalActions.PDF] | [10] <sup>[[Dihedral Groups#References|[3]]]</sup>Crans, Alissa S., Fiore, Thomas M. and Satyendra, Ramon. ''Musical Actions of Dihedral Groups.'' University of South Florida. Nov 3, 2007. Retrieved from [http://myweb.lmu.edu/acrans/MusicalActions.PDF http://myweb.lmu.edu/acrans/MusicalActions.PDF] | ||
Line 440: | Line 437: | ||
[13] Conrad, Keith. (n.d). ''DIHEDRAL GROUPS.'' Retrieved from [http://www.math.uconn.edu/~kconrad/blurbs/grouptheory/dihedral.pdf http://www.math.uconn.edu/~kconrad/blurbs/grouptheory/dihedral.pdf] | [13] Conrad, Keith. (n.d). ''DIHEDRAL GROUPS.'' Retrieved from [http://www.math.uconn.edu/~kconrad/blurbs/grouptheory/dihedral.pdf http://www.math.uconn.edu/~kconrad/blurbs/grouptheory/dihedral.pdf] | ||
- | |ToDo=:# | + | |ToDo=:#More information related to the other groups |
- | :#Add more about Dihedral Groups in 3D. I only talk one property in 3D, but there must be some more. | + | :#Add more about Dihedral Groups in 3D. I only talk about one property in 3D, but there must be some more. |
- | :#In | + | :#In the subgroups part, it is hard to explain only in words, so I use lots of notation, which is still not very clear. I hope can find a better way to illustrate it. |
- | :#Add more about | + | :#Add more about applications |
- | |InProgress= | + | :#Think about non-abelian in matrices which may relate to non-abelian in group theory. |
+ | |InProgress=No | ||
}} | }} |
Current revision
Dihedral Symmetry of Order 12 |
---|
Dihedral Symmetry of Order 12
- Each snowflake in the main image has the dihedral symmetry of a natual regular hexagon. The group formed by these symmetries is also called the dihedral group of degree 6. Order refers to the number of elements in the group, and degree refers to the number of the sides or the number of rotations. The order is twice the degree.
Contents |
Basic Description
In mathematics, a dihedral group is the group of symmetries of a regular polygon, including both 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.Dihedral groups arise frequently in art and nature. Many of the decorative designs used on floor coverings, pottery, and buildings have one of the dihedral groups of symmetry. Chrysler’s logo has as a symmetry group, and that Mercedes-Benz has . The ubiquitous five-pointed star has symmetry group .
Notation
There are two different kinds of notation for a dihedral group associated to a polygon with sides.
In geometry, we usually call it or , where indicates the number of the sides.
In algebra, we call it , where indicates the number of elements in the group.
On this page, we will use the notation to describe a dihedral group. For , we will call it the dihedral group of order or the group of symmetries of a regular -gon.
Below is an example of Dihedral symmetry of and .
A More Mathematical Explanation
- Note: understanding of this explanation requires: *Basic Abstract Algebra
Elements
The dihedral group is the symmetry group of the regular -sided polygon. The group consists of reflections, rotations, and the identity transformation .
Here is an example of . This group contains 12 elements, which are all rotations and reflections. The very first one is the identity transformation.
If is odd each axis of symmetry connects the mid-point of one side to the opposite vertex. If is even there are axes of symmetry connecting the mid-points of opposite sides and axes of symmetry connecting opposite vertices. In either case, there are n axes of symmetry altogether and elements in the symmetry group. Reflecting in one axis of symmetry followed by reflecting in another axis of symmetry produces a rotation through twice the angle between the axes. In Image 1, through to are the axes of symmetries. All the reflections can be described as reflections of the identity through six axes of symmetries.
Definition
There are several different way to define a Dihedral Group. We will introduce three of them.
We will use to represent the identity, , to represent the rotations, and , to represent the reflections.
Complex Plane Presentation
For , the dihedral group is defined as the rigid motions of the plane preserving a regular -gon, with the operation of composition. On complex plane, our model -gon will be an -gon centered at the origin, with vertices at the n-th roots of unity . is always an -th root of unity, but is such a root only if is even. In general, the roots of unity form a regular polygon with sides, and each vertex lies on the unit circle.
The -th roots of unity are roots of the cyclotomic equation .
Since a vector on the complex plane can be described as , a vector with an angle counterclockwise from x-axis can be described as , where is the magnitude of the vector.
Leonhard Euler's formula says that , so any point on the complex plane is .
For a regular -gon, the first angle counterclockwise from the x-axis is , so the primitive root of unity is .
Letting denote a primitive root of unity, and assuming the polygon is centered at the origin, the rotations , (Note: denotes the identity), are given by
Notation means a function. For example: .
For the reflections, , , the functions are given by
Matrix Representation
If we center the regular polygon at the origin, then the elements of the dihedral group act as linear transformations of the plane. This lets us represent elements of as matrices, with composition being matrix multiplication. This is an example of a (2-dimensional) group representation.
For example, the elements of the group can be represented by the following eight matrices:
If we represent the columns of each matrix as basis vectors, we can observe directly all the rotations and reflections.
In general, we can write any dihedral group as:
,
,
where is a rotation matrix, expressing a counterclockwise rotation through an angle of , and is a reflection across a line that makes an angle of with the x-axis.
Group Presentation
A presentation of a group is a description of a set and a subset of the free group generated by , written as , where the equation (the identity element) is often written in place of the element . A group presentation defines the quotient group of the free group by the normal subgroup generated by , which is the group generated by the generators subject to the relations .
We can use the presentation:
, or
to define a group, isomorphic to the dihedral group of finite order , which is the group of symmetries of a regular -gon.
We will use the second presentation, in which refers to a reflection, and refer to a primitive rotation.
- For , means an arbitrary mirror image of the -gon, and means the identity. This equation means that if we reflect the -gon once, you get . If reflect the -gon twice, the result will return to the identity.
- For , the equation means that is a rotation, and its th power equals the identity. That is, if we rotate the -gon times, we get back to the identity.
- For , means the mirror image of . Reflecting the -gon through the axis of symmetry of twice, the result is the identity.
Following the group presentation, we can label all the reflections and rotations in terms of and .
- Identity:
- Rotations: , and , which is the identity.
- Reflections: . There is not , because , and so is the reflection of the identity.
Properties
Cayley Table
As with any geometric object, the composition of two symmetries of a regular polygon is again a symmetry. This operation gives the symmetries of a polygon the algebraic structure of a finite group.
A Cayley table, named after the 19th century British mathematician Arthur Cayley, describes the structure of a finite group by arranging all the possible products of all the group's elements in a square table reminiscent of an addition or multiplication table.
Image 2 on the right shows the effect of composition in the group (the symmetries of a hexagon). denotes the identity; to denote counterclockwise rotations by 60, 120, 180, 240,and 300 degrees; and to denote reflections across the six diagonals. In general, denotes the entry at the intersection of the row with at the left and the column with at the top.
In the table, the same or different rotations and reflections work together and result in a new rotation or reflection. For example, look first at the vertical axis to find a element, . Then look at the horizontal axis to get the second element for our composition. We choose . Composing two elements is just the progression of a rotation or a reflection followed by another rotation or a reflection. In this case, our elements are and . First we rotate the hexagon counterclockwise 240 degrees, and then reflect it along the axis of symmetry of . The result is the same as reflecting the identity transformation through an angle of 60 degrees, which is . See Example 1 below.
Now, look back to Image 2, you will find that the intersection of in left column and in top row is . However, you will find the intersection of in left column and in top row is . If you like, you can create your own Cayley table for a dihedral group of any order and find the natual rule for it.
Explore the Cayley Table
Perhaps the most important feature of this table is that it has been completely filled in without introducing any new motions.
- Closure: Algebraically, this says that if and are in , then so is . This property is called closure, and it is one of the requirements for a mathematical system to be a group.
- identity: Notice that if is any element of , then . Thus, combining any element on either side with yields back again. An element with this property is called an identity, and every group must have one.
- Inverse: We see that for each element in , there exists an element such that . In this case, is said to be the inverse of and vise versa. The term inverse is a descriptive one, for if and are inverses of each other, then "un-does" whatever "does", in the sense that and taken together in either order produce , representing no change.
- Non-Abelian: Another property of deserves special comment. Obverse that , but . Thus in a group may or may not be the same as . If it happens that for all choices of group elements and , we say the group is commutative or --better yet-- Abelian (in honor of the great Norwegian mathematician Niel Abel). Otherwise, we say the group is non-Abelian. All dihedral groups are non-Abelian, except and .
- Associativity: For all dihedral groups, it holds true that for all a, b, c in the group.
If we want to know what is the composition of any two elements, it is convenient to use a Cayley map, because it tells us the result directly. But when we want to know the gradual change of the compositions, we will need another tool, a multi-colored Muplication Table.
Muptiplication Table
In a Multiplication Table, each color represents one rotation or reflection. In Image 3, pink colors represent rotations, and the deepest pink represents the identity transformation. Green colors represent all the six reflections.
From the changing of color, we can observe that the gradual change of the composition of two elements in . However, we cannot easily determine the exact result of composition by observing directly Image 3.
The abstract group structure is given by:
Uniqueness of the Identity
In a dihedral group , there is only one identity element.
PROOF: Suppose both and are identities of . Then,
- for all in , and
- for all in .
The choices of in Eq. 1 and in Eq. 2 yield and .
Thus, and are both equal to and so are equal to each other.
Cancellation
In a dihedral group , the right and left cancellation laws hold; that is, implies , and implies .
PROOF: Suppose . Let be an inverse of .
Then, muliplying on the right by yields .
Associativity yields .
Then, and, therefore, as desired.
Similarly, one can prove that implies by multiplying by on the left.
A consequence of the cancellation property is the fact that in a Cayley table for a dihedral group, each group element occurs exactly once in each row and column. Another consequence of the cancellation property is the uniqueness of inverses.
Uniqueness of Inverses
For each element in a dihedral group , there is a unique element in such that .
PROOF: Suppose and are both inverses of .
Then and , so that .
Canceling the on both sides gives , as desired.
Sock-Shoes property
For dihedral group elements and , .
PROOF: Since and
,
we have by the Uniqueness of Inverses theorem that has only one inverse such that .
We get .
3D Rotational Symmetry
consists of rotations of multiples of about the origin, and reflections across lines through the origin, making angles of multiples of with each other.
If we put a dihedral group in three dimensions, the reflections are also rotations of
The proper symmetry group of a regular polygon embedded in three-dimensional space (if ). 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.
Infinite Dihedral Groups
The infinite dihedral group is denoted by . The infinite dihedral group can be described as the group of symmetries of a circle, which has infinite symmetries.
We use the group presentation:
, or
to represente the infinite dihedral group.
In the presentation, it says that because there are infinitely many symmetries, we can never rotate back to the identity, and so there are infinitely many rotations and reflections.
Subgroups
Definition: A subgroup is a subset of group elements of a group that satisfies the four group requirements. It must therefore contain the identity element. " is a subgroup of " is written as , or sometimes .^{[1]}
Now we want to know exactly how many subgroups for , and what they are. Fortunately, mathematician Stephan A. Cavior had already proved this for us in 1975. In the theorem, for any dihedral group in order of , there are subgroups in total, including and . is just the identity itself.
Definitions of Terms
- : the number of divisors of ,
- e.g. .
- : the sum of divisors of ,
- e.g. .
- : the notation for the cyclic group of order , can be also written as . This is a quotient group presentation.
- : is a divisor of .
- : group is a subgroup generated by . It means .
- : the order of .
- : the index. means .
- : a set with elements looking like .
- : this means a group. is the index, which labels all the elements; is the order of the group.
This proof is complicated.
After we know what kind of group can be a subgroup of a dihedral group , the dihedral group of order , we will start to find all subgroups of .
- The number of subgroups of a cyclic group of order is . ^{[2]}
A cyclic group of order is the group of all the rotations including the identity of the dihedral group of order .
- Let be the element of order in and let be a subgroup of . Then either or and for some .
Proof. Let . Clearly is a normal subgroup of because . Thus is a subgroup of and hence the order of dihedral group is a divisor of , and we use the notation:
- to represent.
On the other hand,
- .
- Given , let . For every let , where denotes a reflection and denotes a primitive rotation. Let . Then is a subgroup of and . We also have
Proof. If , for some , then and thus , because .
Therefore because .
So we have proved that .
Clearly and , because .
Thus .
Proving that is a subgroup of is very easy.
Just note that every element of is the inverse of itself (because they all have order two) and also note that , for all , because .
Finally, the set has elements because clearly if and only if if and only if
Suppose that is a subgroup of . There are two disjoint cases to consider.
Case 1. .
- By Lemma 1. the number of these subgroups is .
Case 2. .
- In this case, by Lemma 2. we have and , for some .
- Let . Since is a subgroup of , which is a cyclic group of order , we have
- Let and be as were defined in Lemma 3.
- Now, since is not contained in , there exists some such that .
- Then, since is a subgroup, we must have , for all .
- Thus and so and therefore, by Eq. 1, we have .
- Thus, since , we must have .
- The converse is obvously true, i.e. given and , is a subgroup of , by Lemma 3., and because it contains .
- So the subgroups in this case are exactly the ones in the form , where and .
- Thus, by Lemma 3. the number of subgroups in this case is
So, by Case 1. and Case 2. the number of subgroups of is .
Why It's Interesting
In Music
The sequence of pitches which form a musical melody can be transposed or inverted. Since the 1970s, music theorists have modeled musical transposition and inversion in terms of an action of the dihedral group of order 24. More recently music theorists have found an intriguing second way that the dihedral group of order 24 acts on the set of major and minor chords.^{[3]}
Dihedral groups as a kind of special symmetric groups are studied in music. In music, we use the operations Transposition and Inversion, which are denoted as and , to represente rotations and reflections in dihedral groups.
Musicians usually study , because 12 is the length of a normal cycle in music: C C^{♯} D E^{♭} E F F^{♯} G G^{♯} A B^{♭} B, and then C again.
Based on this 12 element cycle, is important in music theory. Musicians use Transpositions and Inversions (rotations and reflections) of a simple note to create other notes to complete a final composition.
A transposition of a sequence of pitch classes by semitones is the sequence in which each of the pitch classes in has been increased by semitones.
So for example if
- , where the numbers denote pitches,
then
- .
When doing the operation , add to each digit of , and use arithmetic modulo 12 (clock arithmetic) when the resulting digit is over 12. For instance, in adding 4 to 8, the result is 12, but
Turning to the next operation, inversion of a sequence just replaces each pitch class by its negative (in clock arithmetic).
So in the first example above with , we have
- .
To do the operation , we need to do subtraction in clock arithmetic. For instance, if we want to get 12 from 3, we need to add 9. 0 is already 12, so we need to add 0.
Teaching Materials
- There are currently no teaching materials for this page. Add teaching materials.
Related Links
Additional Resources
- An applet to explore dihedral groups: http://www.mathlearning.net/learningtools/Flash/Dihedral/dihedralExplorer.html
References
[1] Wikipedia. (n.d.). Dihedral groups. Retrieved from http://en.wikipedia.org/wiki/Dihedral_group
[2] de Cornulier, Yves. (n.d). Group Presentation. From MathWorld--A Wolfram Web Resource, created by Eric W. Weisstein. http://mathworld.wolfram.com/GroupPresentation.html
[3] Wikipedia. (n.d.). Cayley table. Retrieved from http://en.wikipedia.org/wiki/Cayley_table
[4] Milson, Robert and Foregger, Thomas. dihedral group. From PlanetMath.org. June, 12. 2007. Retrieved from http://planetmath.org/encyclopedia/DihedralGroup.html
[5] Gallian, Joseph A. Contemporary Abstract Algebra Seventh Edition. Belmont: Brooks/Cole, Cengage Learning. 2010.
[6] Dahlke, Karl. (n.d). Groups, Dihedral and General Linear Groups. Retrieved from http://www.mathreference.com/grp,dih.html
[7] Sharifi, Yaghoub. Subgroups of dihedral groups (1)&(2). Feb, 17, 2011. Retrieved from http://ysharifi.wordpress.com/2011/02/17/subgroups-of-dihedral-groups-1/
[8] ^{[1]}Scott, W. R. Group Theory. New York: Dover, 1987.
[9] ^{[2]}Hungerford, Thomas W. Graduate Texts in Mathematics - Algebra. New York: Springer, 1974.
[10] ^{[3]}Crans, Alissa S., Fiore, Thomas M. and Satyendra, Ramon. Musical Actions of Dihedral Groups. University of South Florida. Nov 3, 2007. Retrieved from http://myweb.lmu.edu/acrans/MusicalActions.PDF
[11] Benson, Dave J. Music: A Mathematical Offering. Cambridge University Press. Nov 2006. Retrieved from http://www.maths.abdn.ac.uk/~bensondj/html/music.pdf
[12] Rowland, Todd and Weisstein, Eric W. (n.d). Root of Unity. From MathWorld--A Wolfram Web Resource. Retrieved from http://mathworld.wolfram.com/RootofUnity.html
[13] Conrad, Keith. (n.d). DIHEDRAL GROUPS. Retrieved from http://www.math.uconn.edu/~kconrad/blurbs/grouptheory/dihedral.pdf
Future Directions for this Page
- More information related to the other groups
- Add more about Dihedral Groups in 3D. I only talk about one property in 3D, but there must be some more.
- In the subgroups part, it is hard to explain only in words, so I use lots of notation, which is still not very clear. I hope can find a better way to illustrate it.
- Add more about applications
- Think about non-abelian in matrices which may relate to non-abelian in group theory.
Leave a message on the discussion page by clicking the 'discussion' tab at the top of this image page.