# CLASSIFYING FINITE SUBGROUPS OF SO 3

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 CLASSIFYING FINITE SUBGROUPS OF SO 3 HANNAH MARK Abstract. The goal of this paper is to prove that all finite subgroups of SO 3 are isomorphic to either a cyclic group, a dihedral group, or the rotational symmetry group of a regular solid. We begin by building up a set of definitions pertaining to groups, particularly permutation groups and matrix groups. Armed with these definitions and with the orbit-stabilizer and counting theorems, we will tackle the proof of the classification. Contents Introduction 1 1. Basic Group Theory 2 2. Conjugacy and Cosets 3 3. Permutation Groups 3 4. The Platonic Solids 5 5. Matrix Groups 6 6. Actions, Orbits, and Stabilizers 7 7. Important Theorems 8 8. Classifying Finite Subgroups of SO 3 10 Acknowledgements 15 References 15 Introduction This paper will prove that all finite subgroups of SO 3 are isomorphic to either a cyclic group, a dihedral group, or the rotational symmetry group of a regular solid. In order to get to this result we will need a number of definitions, as well as some ancillary results. We will start by defining the most basic concepts of group theory, including groups, subgroups, and isomorphisms. With these definitions in hand we will move on to definitions of conjugacy and cosets which will prove useful later on. All of the definitions are drawn from [1] and [3]. Then we will discuss permutation groups such as dihedral groups, which are one of the types of groups that feature in our main result. The next section, on the platonic solids, also pertains directly to that result: the section discusses the isomorphisms between symmteric groups and the rotational symmetry groups of the solids. A section on matrix groups follows, where we introduce special orthogonal groups, alongside other matrix groups. We next discuss group actions, orbits, and stabilizers. These concepts and definitions allow us to prove the orbit-stabilizer and counting theorems, which we will use extensively in the proof of the main result. Finally, the last section goes through Date: August 23,

2 2 HANNAH MARK two proofs: first, that of a less powerful classification of finite subgroups of O 2, and then that of our main result, the classification of finite subgroups of SO 3. Exposition on types of groups and the ancillary theorems is drawn from [1], and the proofs in the last section are also based on [1], with some explication adapted from [2]. 1. Basic Group Theory In order to classify anything, we have to know just what that thing is. To classify a finite subgroup, we must define what a subgroup is, and, before that, a group. These definitions constitute the essential mathematical framework in which our proof will reside. Therefore, we will begin by defining some central concepts of group theory. Definition 1.1. A group is a set G together with a multiplication on G which satisfies the following: (1) The multiplication is associative, i.e. for all x, y, z in G, (xy)z = x(yz). (2) There is an element e in G, called the identity, such that for every x in G, xe = x = ex. (3) For each element x in G, there exists an element x 1 in G, called the inverse of x, such that x 1 x = e = xx 1. Definition 1.2. The order of a finite group is the number of elements in the group. An infinite group has infinite order. If x is an element of a group, then the order of x is the smallest positive number n such that x n = e, if such an n exists. If no such n exists, then x is said to have infinite order. Once we know what a group is and how many elements its set contains, we need a way to figure out when two groups have the same structure. This leads us to the following definition: Definition 1.3. Two groups G and G are isomorphic if there is a bijection φ from G to G such that φ(xy) = φ(x)φ(y) for all x, y in G. We call the map φ an isomorphism. Note that the following are true of isomorphisms: (1) An isomorphism φ : G G is a bijection; therefore, G and G must be of the same order. (2) φ maps the identity in G to the identity in G, and inverses to inverses. (3) If φ : G G is an isomorphism, and H is a subgroup of G, then φ(h) is a subgroup of G. (4) An isomorphism preserves the order of each element. Given a group G, we can define a subgroup of G. Subgroups are more than just subsets of the set of G, since subgroups preserve the group s product. Definition 1.4. A subgroup of a group G is a subset of G which forms a group under the product of G. By the definition of a subgroup, it is clear that every subgroup must contain, at the very minimum, the identity element. Therefore, there is no empty subgroup. The next definition shows us one way in which a subgroup can be constructed: using a generating element.

3 CLASSIFYING FINITE SUBGROUPS OF SO 3 3 Definition 1.5. The subgroup generated by a subset X of G is the smallest subgroup of G that contains X. If the subgroup fills out all of G, then we say X is a set of generators for G. If there is an element x in G that generates all of G, then we call G a cyclic group. 2. Conjugacy and Cosets This next section deals with some ways in which group elements can interact. They may seem a bit tangential, but we will need these concepts to understand theorems which we will use in our classification proof. Definition 2.1. Let x, y be elements of a group G. We say that x is conjugate to y if gxg 1 = y for some g in G. The collection of elements conjugate to an element x is called the conjugacy class of x. For a fixed element g of the group G the function G G, x gxg 1 is an isomorphism called conjugation by g. We can see that conjugation by an element g of a group G is an isomorphism since it is invertible and preserves a product. Invertibility is obvious, and we have the simple calculation g(xy)g 1 = (gxg 1 )(gyg 1 ) to show that the product is preserved. Definition 2.2. Let G be a group and H a subgroup of G. The set gh = {gh h H} for some given element g of G is called the left coset of H determined by g. We can define, similarly, a right coset Hg = {hg h H} 3. Permutation Groups Building on these definitions, we narrow our focus to some of the types of groups that will figure in our classification: dihedral groups, symmetric groups, and alternating groups. Definition 3.1. A dihedral group is a non-commutative group of the symmetries of a polygon, i.e. a group of the rotational and reflectional symmetries of a given polygon. We denote the dihedral group of an n-gon by D n, and we write its elements as products of rotational symmetries r and reflectional symmetries s. A rotation r is, specifically, a rotation of the plane by 2π n, and s is any reflection. It is helpful to consider a simple example of a dihedral group, D 3. This group corresponds to the group of rotational symmetries of a triangular plate. We can rotate this plate about an axis through its center, perpendicular to the plane of the plate, or we can reflect it in a line that passes through a vertex of the plate and the midpoint of the opposite edge. With a little thought, we can see that D 3 has order 6.

4 4 HANNAH MARK Figure 1. Axes of a triangular plate. The dihedral group of an n-gon has order 2n: n rotational symmetries and n reflectional symmetries. It is easy to see that an n-gon will have n possible rotations about the axis perpendicular to its center (including the identity). For reflectional symmetries, if n is odd, then each axis of symmetry connects a vertex with the midpoint of its opposite side, giving n axes for the n vertices. If n is even, then there are n/2 axes of symmetry connecting pairs of vertices, and n/2 axes connecting midpoints of pairs of sides. Definition 3.2. A permutation of some set X is a bijection from X to itself. The collection of all permutations of a set X forms a group S X under the composition of functions. When X is the set of the first n positive integers, we have a group S n, which is called the symmetric group of degree n. Since S n is the collection of permutations of n elements, it is easy to see that there will be n! elements in the set of S n. Definition 3.3. A permutation written as (a 1, a 2,..., a k ) inside a single pair of brackets is called a cyclic permutation. The notation indicates that the permutation sends a 1 to a 2, a 2 to a 3, etc., and finally, a k to a 1. Cycles are sometimes referred to in terms of their length: a three-cycle would have three elements; an n-cycle, n elements. A two-cycle, which exchanges only two elements, is called a transposition. Every n-cycle can be written as a product of transpositions. While there can be several different ways to write an n-cycle as a product of transpositions, if the given cycle can be written as a product of an even number of transpositions, it cannot be expressed with an odd number, and vice versa. Symmetric groups and permutations are extremely useful. For example, we can express a dihedral group, say D 3 again, as a subgroup of a symmetric group of degree 3 by labelling the vertices of our triangular plate and seeing where each element of D 3 moves the various vertices. A rotation by 2π 3 about the axis perpendicular to the center of the plate would correspond to a permutation cycle (1, 2, 3).

5 CLASSIFYING FINITE SUBGROUPS OF SO 3 5 Figure 2. Rotation by 2π 3. Definition 3.4. An element of S n which can be expressed as the product of an even number of transpositions is called an even permutation, and the rest are, naturally, odd permutations. We now state, without proof, a proposition about an important subgroup of S n, called the Alternating Group. Proposition 3.5. The even permutations in S n form a subgroup of order n!/2 called the alternating group A n of degree n. Proof. See [1], p The Platonic Solids The five platonic solids are the only regular convex polyhedra that is, they are the only convex polyhedra that are made up of congruent regular polygons with the same number of faces meeting at each vertex. Although they may not seem to fit in with the content presented thus far in this paper, they are in fact very much connected to group theory in general, and to symmetry groups in particular. As we aim to show in our final proof, the rotational symmetry groups of the solids are isomorphic to finite subgroups of SO 3. More specifially, their rotational symmetry groups are isomorphic to particular symmetry groups. The five platonic solids are: the tetrahedron, the cube, the octahedron, the dodecahedron, and the icosahedron. Figure 3. The five platonic solids. The rotational symmetry groups of the solids are isomorphic to symmetry groups as follows:

6 6 HANNAH MARK solid: isomorphic to: tetrahedron A 4 cube S 4 octahedron S 4 dodecahedron A 5 icosahedron A 5 Note that the rotational symmetry groups of the cube and octahedron, and the icosahedron and dodecahedron, are isomorphic to the same symmetry groups. This is because they are what are called dual solids, meaning that one can be constructed from the other by connecting vertices placed at the centers of the faces of its dual. That is, dual solids are pairs of solids with faces and vertices interchanged. Figure 4. An octahedron can be drawn by connecting the centers of the faces of a cube. The cube and the octahedron are dual solids, and thus they have the same amount of symmetry; the dodecahedron and the icosahedron are also dual. The tetrahedron is self-dual. 5. Matrix Groups Matrix groups provide a useful way of representing the rotational symmetries we want to classify. In order to use these groups in our proof, we must first define the basic terminology of matrix groups. The set of all n n matrices with real-number entries forms a group under matrix multiplication. Each matrix A in this group determines an invertible linear transformation f A : R n R n defined by f A (x) = Ax for all vectors x in R n. The product matrix AB determines the composite linear transformation f AB. Definition 5.1. We call the group of n n invertible matrices with real number entries the General Linear Group, GL n (R). Definition 5.2. An n n matrix A over R is orthogonal if A t A is the identity matrix. The collection of all n n orthogonal matrices is a subgroup of GL n called the Orthogonal Group, O n. The elements of O n which have determinant equal to +1 form a subgroup of O n called the Special Orthogonal Group, SO n.

7 CLASSIFYING FINITE SUBGROUPS OF SO 3 7 If A is an element of O n, the corresponding linear transformation f A preserves distance and orthogonality. We can see this by taking two elements x and y in R n, applying f A, and taking a scalar product of f A (x) and f A (y). f A (x), f A (y) = A t Ax, y = x, y Since the length of x in R n is equal to x x, taking the scalar product of f A (x) with itself shows us that f A preserves the length of x. A 2 2 orthogonal matrix represents either a rotation of the plane about the origin, or a reflection in a straight line through the origin. Such a matrix is in SO 2 precisely when it represents a rotation. This may sound far-fetched, but we can intuit where the idea comes from by considering a matrix A in O 2. The columns of A are orthogonal, and let s say that they are unit vectors. Now we are working on the unit circle, and our matrix for a rotation counterclockwise through θ is: [ ] cos θ sin θ A = sin θ cos θ Trigonometric identities tell us that this matrix has a determinant of +1 for any angle θ. If we keep looking at the unit circle and take the orthogonal columns of a matrix B to be, once again, unit vectors, we find that a reflection matrix across a line through the origin at angle θ/2 is: [ ] cos θ sin θ B = sin θ cos θ and this matrix obviously has a determinant of 1. Similarly, each matrix in SO 3 represents a rotation of R 3 about an axis which passes through the origin. 6. Actions, Orbits, and Stabilizers Groups become even more interesting when we consider the ways in which they act on other mathematical objects. A group action, a way in which a group interacts with a set, can help us to understand both the group and the set it acts on in new ways. In this section, we deal with group actions and some concepts that follow. The definitions and the theorems in this section are integral to our classification proof, as they include the orbit-stabilizer and counting theorems, which we will use extensively. Definition 6.1. An action of a group G on a set X is a homomorphism from G to S X. That is, we can define a homomorphism φ : G S X where for each g in G, φ(g) gives us a permutation of the points of our set X. Written another way, an action of a group G on a set X is a map from G X to X satisfying the following conditions: (1) For all g 1, g 2 G, x X, (g 1 g 2 )(x) = g 1 (g 2 (x)) (2) For all x X, 1 x = x. Definition 6.2. Given an action G on a set X and a point x in X, the set of all images g(x) for all g in G is called the orbit of x, and is written G(x). That is, G(x) = {g(x) g G}. Our dihedral group of a triangular plate provides a very simple example of these concepts. The group D 3 consists of rotations and reflections which, as we noted

8 8 HANNAH MARK previously, can be represented by permutations of the numbers 1, 2, 3 by numbering the vertices of the triangular plate. Thus, the group D 3 acts on the set of the numbered vertices {1, 2, 3}. Since each vertex can switch places with either of the other two, the action has only one orbit. Definition 6.3. For a point x in our set X, the elements of G which leave x fixed form a subgroup of G called the stabilizer of x, G x. That is, for a fixed x in X, G x = {g G g(x) = x}. The stabilizer of any vertex of our triangular plate will contain two elements: the identity, and rotation by π about the axis through the given vertex and the midpoint of the opposite side. Figure 5. A rotation stabilizing 1. The rotation shown in the figure above would be in the stabilizer of the vertex labelled 1. We state the following without proof, as it will be used briefly in the proof of the counting theorem. Proposition 6.4. Points in the same orbit have conjugate stabilizers. Proof. See [1], p. 94. Our example of D 3 can help to clarify this proposition. Consider that all three vertices of the triangle are in one orbit. If we look at the reflection in the picture above, and call that reflection s, we can conjugate s by a rotation r which we define, in the left-hand triangle, as the permutation (1, 2, 3). It is easy to see that s fixes 1, and rsr 1 fixes Important Theorems These theorems are justly called important; they feature prominently in the classification proof, as well as being interesting results in their own right. They show us the connections between a group action, its orbits, and the stabilizers of the elements of the set that is acted upon. Theorem 7.1. The Orbit-Stabilizer Theorem: Let X be a set, and G a group acting on X. For each x in X, the correspondence g(x) gg x is a bijection between G(x) and the set of left cosets of G x in G. Proof. We want to show that the correspondence g(x) gg x is bijective. It is clear that this correspondence is surjective: For any x in X, every gg x obviously

9 CLASSIFYING FINITE SUBGROUPS OF SO 3 9 corresponds to one g(x) as g runs through G. In order to show that it is injective, let us consider g and g in G. If gg x = g G x, then we can say that gh 1 = g h 2 for some h 1, h 2 in G x. Then, setting h 2 h 1 1 = h, we get that g = g h for h in G x. But this means that g(x) = g h(x) = g (h(x)) = g (x) since h is in G x (i.e. h(x) = x). Thus we see that if gg x = g G x, then g(x) = g (x), proving that the correspondence is also injective, and therefore bijective. Corollary 7.2. If G is finite, the size of each orbit is a divisor of the order of G. Proof. By the Orbit-Stabilizer theorem, we know that the size of the orbit of x is equal to G / G x, so we have: G(x) G x = G Theorem 7.3. The Counting Theorem: Let G be a finite group acting on a set X, and write X g = {x gx = x}; that is, the set of x in X that are left fixed by a given element g of G. The number of distinct orbits is: 1 X g. G g G In other words, the number of distinct orbits is the average number of points left fixed by an element of G. Proof. We have the group action G X X which maps (g, x) g(x), and we will start by counting the pairs (g, x) where g(x) = x. By our definition of X g, that number is the sum: (7.4) X g. g G This sum counts pairs by summing the number of elements x of X that are left fixed by g in G as g runs through G. Since we define the stabilizer G x as the set of all elements g in G that fix a given x, we can rewrite equation 7.4 as (7.5) G x x X where we count the same pairs by summing all stabilizing elements g in G over X. Let us call the number of distinct orbits of our action k, and these orbits X 1, X 2,... X k. Since these distinct orbits together make up our set X, we can rewrite equation 7.5 as k (7.6) G x i=1 x X i We know from proposition 6.4 that points in the same orbit have conjugate stabilizers, and thus we know that the stabilizers of points in the same orbit are the same size. So, given any element x 1 in X i, we have: x X i G x = X i G x1 = G(x 1 ) G x1 = G

10 10 HANNAH MARK by the Orbit-Stabilizer theorem. We can then see that combining all of these equations gives G x = k G = X g x X g G And so, dividing through by G gives us our desired formula: (7.7) k = 1 X g G g G 8. Classifying Finite Subgroups of SO 3 The special orthogonal group SO 3 can be identified with the group of rotations of R 3 about a fixed origin. If we take an object and orient it appropriately at the origin, its rotational symmetry group will be isomorphic to a subgroup of SO 3. We will show that there are only three possibilities for these subgroups, provided they are finite: cyclic groups, dihedral groups, and rotational symmetry groups of regular solids. All three of these possibilities do, in fact, occur. First, we will prove a related but less complex result about finite subgroups of O 2. Theorem 8.1. A finite subgroup of O 2 is either cyclic or dihedral. Proof. Let G be a nontrivial subgroup of O 2. We have two cases to consider: G can be a subgroup of SO 2 as well as O 2, or it can have some elements in O 2 SO 2. First, suppose that G is a subgroup of SO 2. As we stated earlier with our definitions of orthogonal and special orthogonal groups, a 2 2 orthogonal matrix is in SO 2 precisely when it represents a rotation of the plane about the origin. Thus, we know that in this case every element of G represents a rotation of the plane. Take A θ to be the matrix in G which represents a counterclockwise rotation through θ about the origin, with 0 θ < 2π. Choose A φ in G so that φ is positive and as small as possible. Now, we can use the division theorem to write θ = kφ + ψ for some positive integer k and with 0 ψ < φ. This gives us: A θ = A kφ+ψ = (A φ ) k A ψ which can be rearranged to A ψ = (A φ ) k A θ. Since A θ and A φ are both in G, this means that A ψ will also be in G. We chose φ to be the smallest positive rotation in G, but ψ is less than φ, so ψ must be zero in order to avoid contradiction. Therefore, A φ generates G, meaning that in this case G is cyclic. Next we address the other case, where G is not completely contained in SO 2. Set H = G SO 2. Then H is a subgroup of G, and by the first case H will be cyclic since it is entirely contained in SO 2. Choose a generator A for H, and an element B which is in G but not in H. B is therefore in O 2 and not SO 2, and represents a reflection. Thus, we have that B 2 = I. If A = I, then G contains only I and B and is a cyclic group of order 2. Otherwise, A has order n 2, and the elements of G are: I, A,..., A n 1, B, AB,..., A n 1 B

11 CLASSIFYING FINITE SUBGROUPS OF SO 3 11 with B 2 = I, A n = I, and BA = A 1 B. We know that these are all the elements of G because the set includes all combinations of A and B where neither is raised to a power greater than its order. If we take A to correspond to rotational symmetry r and B to correspond to reflectional symmetry s, we have an isomorphism between G and the dihedral group of an n-gon D n. Now we can move on to the big theorem: classifying all of the finite subgroups of SO 3. Theorem 8.2. A finite subgroup of SO 3 is isomorphic either to a cyclic group, a dihedral group, or the rotational symmetry group of one of the regular solids. Proof. We will proceed in stages. First, we will show that a finite subgroup G of SO 3 acts on the set of poles fixed by the rotations in G. We will then use the counting theorem to show that the action must have either 2 or 3 distinct orbits. From the two-orbit case we will get cyclic groups, and from the three-orbit case we will get four subcases leading to dihedral groups and the rotational symmetry groups of the regular solids. Let G be a finite subgroup of SO 3. Each element in G (except for the identity) represents a rotation in R 3 about an axis through the origin. We notice that each axis defined by an element of G will intersect the unit sphere at two points. For an element g in G, call those two points the poles of g in G. Stated another way, the poles are the only points on the unit sphere that are left-fixed by a given element. Figure 6. The two poles of an element g. [1] p It would be nice if G defined a group action on some set this would allow us to gather more information about these poles and about the group G. Luckily, there is such a set: let X be the set of poles of elements in G {e}. We will show that G acts on X. Take an element x in X and two elements g, h in G. Let x be a pole of the rotation h. Then we have: (ghg 1 )g(x) = g(h(x)) = g(x) This means that g(x) is left-fixed by ghg 1, and so by definition g(x) is an element of X. Thus, we have found an action G X X, showing that G acts on X. To proceed with the proof, we will apply the counting theoreom to this action to restrict the possibilites for the sizes of X and the orbits of G. First, we need to find some basic limitations on the points in X. Using the counting theorem, the orbit-stabilizer theorem and some alegbraic manipulation we can discover constraints on X which allow us to reduce our classification problem to a small number of cases.

12 12 HANNAH MARK Let N be the number of distinct orbits of our action. Choose one pole from each orbit, and call these poles x 1,..., x N. Every element g in G {e} fixes two poles, and the identity fixes them all. The counting theorem tells us that the number of distinct orbits of an action is equal to the average number of points fixed by an element of G. We can therefore write: (8.3) N = 1 (2( G 1) + X ) G In order to understand what this equation tells us about our action, we have to do some algebraic manipulation. First, we know that by definition, X = N i=1 G(x i) ; that is, the size of the set is the sum of the sizes of all the distinct orbits of the action on the set. Plugging this into equation 8.3 and rearranging some terms gives us ( (8.4) ) = N 1 N G(x i ) G G Using the corollary to the orbit-stabilizer theorem, we can replace our sum of orbits with a sum of stabilizers, yielding the following equation: ( (8.5) ) N 1 = N G G xi i=1 i=1 And finally, we bring N inside the sum: ( (8.6) ) N = (1 1 G G xi ) At the beginning of the proof we stated that G was not the trivial subgroup. Therefore, the order of G is at least 2, meaning that the left hand side of equation 8.6 must be between 1 and 2, inclusive. We also know that the stabilizer G xi of a given element x i contains at least two elements, since each x i is fixed by both the identity and by the rotation g in G about the axis through the origin which contains x i. This constrains the right hand side of equation 8.6, giving us < 1 with 1 i N. G xi These constraints on the two sides of the equation tell us that N must be either 2 or 3. If N = 2, then equation 8.4 gives 2 = G(x 1 ) + G(x 2 ). There can only be two poles in this situation, and they determine a single axis. All rotations in G {e} must be about this axis. These rotations take the plane containing the origin and perpendicular to the axis to itself. Thus we see that G is isomorphic to a subgroup of SO 2 and, by theorem 8.1, G must be cyclic. When N = 3, we have multiple cases to deal with. Our first step is to identify these cases. We will begin by renaming our three orbits: for convenience s sake, G(x 1 ), G(x 2 ), G(x 3 ) will be called G(x), G(y), G(z). Equation 8.5 tells us that (8.7) G = 1 G x + 1 G y + 1 G z where the right hand side of the equation will, obviously, be strictly greater than 1. This narrows the number of cases we have to consider down considerably. Since we i=1

13 CLASSIFYING FINITE SUBGROUPS OF SO 3 13 know that the cardinality of each of the stabilizers is at least 2, the largest any of the fractions on the right can be is 1 2. If we start with halves and then reduce the fractions as much as possible, we find that only 4 cases remain where the right hand side of the equation is strictly greater than 1 and the cardinality of each stabilizer is at least 2. The cases are: (a) 1 2, 1 2, 1 n, where n 2 (b) 1 2, 1 3, 1 3 (c) 1 2, 1 3, 1 4 (d) 1 2, 1 3, 1 5 If we reduce the fractions beyond 1 5, the right hand side will not be greater than 1; therefore, these are all the possible cases. All that remains for us to do is to treat each of these cases in turn, and to show that all lead to the kinds of subgroups we expect. Case (a) First consider the subcase where G x = G y = G z = 2. By equation 8.7, G = 4. Every element in G other than the identity has order 2. We can see this by taking an element g in G x, not the identity, and supposing that g 2 is not the identity. Then g 2 will be equal to some element of another stabilizer, say h in G y, where h is not the identity. But since g fixes x, simple calculation shows that h would be in G x, providing a contradiction and confirming that the order of g is 2. We will call the elements of G (g 1, g 2, g 3, e). Let g 3 generate G z, and recall that any g in G preserves the distances between points. Selecting the pole called z, we see that x and g(x) are equidistant from z, as are y and g(y). Focusing on x instead, we see that z and g(z), and y and g(y), are similarly equidistant from x. We have, from the corollary to the orbit-stabilizer theorem, three orbits with two points each, and we see that it makes sense to rename the points g(x), g(y), g(z) as x, y z, as the conditions of equidistance define the familiar perpendicular axes of 3-dimensional space. Given three nontrivial elements each of order 2, with g 3 = g 1 g 2, we see that in this subcase we are dealing with the dihedral group with 4 elements, D 2. If we have G x = G y = 2 and G z = n 3, then the order of G will be equal to 2n by equation 8.7. The axis through z in X is fixed by g in G z, so G z is cyclic of order n. Take g to be the minimal rotation in G z, the generator of G z. Then we have x, g(x),..., g n 1 (x), all distinct. If we had g r (x) = g s (x) with r > s and such that r does not equal s mod n, then g r s (x) = x. But, since z and z are the only two poles fixed by g r s, and x cannot equal z since G x = 2, g r (x) cannot equal g s (x). Finally, we use the fact that g preserves distance, and we write (8.8) x g(x) = g(x) g 2 (x) =... = g n 1 (x) x. We can see that x, g(x),..., g n 1 (x) must be the vertices of a regular n-gon, and G is the rotational symmetry group of the n-gon, D n. Case (b) G x = 2, G y = G z = 3. By equation 8.7, G = 12. By the corollary to the orbit-stabilizer theorem, the cardinality of the orbit of z is 4. Choose g the generator of G z, and choose an element u in the orbit of z so that u is not z or z. We can see that u, g(u), g 2 (u) are distinct, equidistant from z, and lie at the

14 14 HANNAH MARK corners of an equilateral triangle. We can similarly choose to focus on u, or on any one of the other points in the orbit, and we see that for example z, g(u), g 2 (u) are equidistant from u and mark the corners of another equilateral triangle. Thus it is obvious that we are dealing with a regular tetrahedron, and that G is the rotational symmetry group of the solid. Figure 7. The rotational symmetries of a regular tetrahedron. [1] p Case (c) G x = 2, G y = 3, G z = 4. By equation 8.7, G = 24. By the corollary to the orbit-stabilizer theorem, the cardinality of the orbit of z is 6. Choose g the generator of G z, and choose an element u in the orbit of z so that u is neither z nor z. We can see that u, g(u), g 2 (u), g 3 (u) are distinct, equidistant from z, and lie at the corners of a square. The last point in the orbit of z is z. Similarly, we know that u will be in the orbit of u, which is also the orbit of z. u cannot be z or z, and it cannot be g(u) or g 3 (u) because those two points are adjacent to u. Therefore, u must be g 2 (u). We can look at the orbit starting at any one of the points, and we always see four equidistant points forming a square: thus, we see that the points are the vertices of a regular octahedron and G is the rotational symmetry group of the solid. We note in passing that since the octahedron and the cube are dual solids, G is also the rotational symmetry group of a cube. Figure 8. The rotational symmetries of an octahedron. [1] p Case (d) G x = 2, G y = 3, G z = 5. By equation 8.7, G = 60. By the corollary to the orbit-stabilizer theorem, the cardinality of the orbit of z is 12. Take g to be the minimal rotation which generates G z, and choose u, v in the orbit of z such that 0 < z u < z v < 2. This keeps everything in the unit circle, and

15 CLASSIFYING FINITE SUBGROUPS OF SO 3 15 allows us to see that we have u, g(u), g 2 (u), g 3 (u), g 4 (u), all distinct and equidistant from z, and similarly v, g(v), g 2 (v), g 3 (v), g 4 (v). These two sets of points lie at the vertices of two regular pentagons, and since the two sets of points are not the same distance away from z we have two separate regular pentagons. The 12th point in the orbit of z must be z. Once again, we can shift our perspective to view our 12 points looking out from any one of the 12, and we will see the same picture: two separate, equidistant regular pentagons, and then the negative point to our viewpoint. Thus we see that our points lie at the vertices of a regular icosahedron, and G is the rotational symmetry group of the solid. As with our octahedron and cube, the icosahedron and the dodecahedron are duals, so G is also the rotational symmetry group of a dodecahedron. Figure 9. The rotational symmetries of an icosahedron. [1] p Acknowledgements. Many thanks to my mentor Dileep Menon for his knowledge, patience, careful comments, and willingness to explain every concept until it made perfect sense. Thanks also to Wouter van Limbeek for his proofreading and advice on mathematical writing. References [1] M. A. Armstrong. Groups and Symmetry. Springer-Verlag [2] Michael Artin. Algebra. Prentice Hall [3] David S. Dummit and Richard M. Foote. Abstract Algebra. John Wiley and Sons

### 13 Solutions for Section 6

13 Solutions for Section 6 Exercise 6.2 Draw up the group table for S 3. List, giving each as a product of disjoint cycles, all the permutations in S 4. Determine the order of each element of S 4. Solution

### 1 Symmetries of regular polyhedra

1230, notes 5 1 Symmetries of regular polyhedra Symmetry groups Recall: Group axioms: Suppose that (G, ) is a group and a, b, c are elements of G. Then (i) a b G (ii) (a b) c = a (b c) (iii) There is an

### Problem Set 1 Solutions Math 109

Problem Set 1 Solutions Math 109 Exercise 1.6 Show that a regular tetrahedron has a total of twenty-four symmetries if reflections and products of reflections are allowed. Identify a symmetry which is

### Construction and Properties of the Icosahedron

Course Project (Introduction to Reflection Groups) Construction and Properties of the Icosahedron Shreejit Bandyopadhyay April 19, 2013 Abstract The icosahedron is one of the most important platonic solids

### Computing the Symmetry Groups of the Platonic Solids With the Help of Maple

Computing the Symmetry Groups of the Platonic Solids With the Help of Maple Patrick J. Morandi Department of Mathematical Sciences New Mexico State University Las Cruces NM 88003 USA pmorandi@nmsu.edu

### D-MATH Algebra I HS 2013 Prof. Brent Doran. Solution 5

D-MATH Algebra I HS 2013 Prof. Brent Doran Solution 5 Dihedral groups, permutation groups, discrete subgroups of M 2, group actions 1. Write an explicit embedding of the dihedral group D n into the symmetric

### GROUPS ACTING ON A SET

GROUPS ACTING ON A SET MATH 435 SPRING 2012 NOTES FROM FEBRUARY 27TH, 2012 1. Left group actions Definition 1.1. Suppose that G is a group and S is a set. A left (group) action of G on S is a rule for

### Geometrical symmetry and the fine structure of regular polyhedra

Geometrical symmetry and the fine structure of regular polyhedra Bill Casselman Department of Mathematics University of B.C. cass@math.ubc.ca We shall be concerned with geometrical figures with a high

### Calculus and the centroid of a triangle

Calculus and the centroid of a triangle The goal of this document is to verify the following physical assertion, which is presented immediately after the proof of Theorem I I I.4.1: If X is the solid triangular

### GROUP ACTIONS ON SETS WITH APPLICATIONS TO FINITE GROUPS

GROUP ACTIONS ON SETS WITH APPLICATIONS TO FINITE GROUPS NOTES OF LECTURES GIVEN AT THE UNIVERSITY OF MYSORE ON 29 JULY, 01 AUG, 02 AUG, 2012 K. N. RAGHAVAN Abstract. The notion of the action of a group

### They are congruent since the rst can be moved to coincide with the second. However, the next pair of triangles are not congruent.

Chapter 9 Symmetry In this chapter we explore a connection between algebra and geometry. One of the main topics of plane geometry is that of congruence; roughly, two geometric gures are said to be congruent

GROUP ACTIONS KEITH CONRAD 1. Introduction The symmetric groups S n, alternating groups A n, and (for n 3) dihedral groups D n behave, by their very definition, as permutations on certain sets. The groups

### Proof. Right multiplication of a permutation by a transposition of neighbors either creates a new inversion or kills an existing one.

GROUPS AROUND US Pavel Etingof Introduction These are notes of a mini-course of group theory for high school students that I gave in the Summer of 2009. This mini-course covers the most basic parts of

### Chapter 7: Products and quotients

Chapter 7: Products and quotients Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 42, Spring 24 M. Macauley (Clemson) Chapter 7: Products

### Group Theory (MA343): Lecture Notes Semester I Dr Rachel Quinlan School of Mathematics, Statistics and Applied Mathematics, NUI Galway

Group Theory (MA343): Lecture Notes Semester I 2013-2014 Dr Rachel Quinlan School of Mathematics, Statistics and Applied Mathematics, NUI Galway November 21, 2013 Contents 1 What is a group? 2 1.1 Examples...........................................

### PUZZLES WITH POLYHEDRA AND PERMUTATION GROUPS

PUZZLES WITH POLYHEDRA AND PERMUTATION GROUPS JORGE REZENDE. Introduction Consider a polyhedron. For example, a platonic, an arquemidean, or a dual of an arquemidean polyhedron. Construct flat polygonal

### (Q, ), (R, ), (C, ), where the star means without 0, (Q +, ), (R +, ), where the plus-sign means just positive numbers, and (U, ),

2 Examples of Groups 21 Some infinite abelian groups It is easy to see that the following are infinite abelian groups: Z, +), Q, +), R, +), C, +), where R is the set of real numbers and C is the set of

### 7. The Gauss-Bonnet theorem

7. The Gauss-Bonnet theorem 7. Hyperbolic polygons In Euclidean geometry, an n-sided polygon is a subset of the Euclidean plane bounded by n straight lines. Thus the edges of a Euclidean polygon are formed

### G = G 0 > G 1 > > G k = {e}

Proposition 49. 1. A group G is nilpotent if and only if G appears as an element of its upper central series. 2. If G is nilpotent, then the upper central series and the lower central series have the same

### Geometric Transformations

Geometric Transformations Definitions Def: f is a mapping (function) of a set A into a set B if for every element a of A there exists a unique element b of B that is paired with a; this pairing is denoted

### Notes on polyhedra and 3-dimensional geometry

Notes on polyhedra and 3-dimensional geometry Judith Roitman / Jeremy Martin April 23, 2013 1 Polyhedra Three-dimensional geometry is a very rich field; this is just a little taste of it. Our main protagonist

### I. GROUPS: BASIC DEFINITIONS AND EXAMPLES

I GROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 1: An operation on a set G is a function : G G G Definition 2: A group is a set G which is equipped with an operation and a special element e G, called

### Geometry Chapter 1 Vocabulary. coordinate - The real number that corresponds to a point on a line.

Chapter 1 Vocabulary coordinate - The real number that corresponds to a point on a line. point - Has no dimension. It is usually represented by a small dot. bisect - To divide into two congruent parts.

### CONJUGATION IN A GROUP KEITH CONRAD

CONJUGATION IN A GROUP KEITH CONRAD 1. Introduction A reflection across one line in the plane is, geometrically, just like a reflection across any other line. That is, any two reflections in the plane

### d(f(g(p )), f(g(q))) = d(g(p ), g(q)) = d(p, Q).

10.2. (continued) As we did in Example 5, we may compose any two isometries f and g to obtain new mappings f g: E E, (f g)(p ) = f(g(p )), g f: E E, (g f)(p ) = g(f(p )). These are both isometries, the

### Lecture 5 Group actions

Lecture 5 Group actions From last time: 1. A subset H of a group G which is itself a group under the same operation is a subgroup of G. Two ways of identifying if H is a subgroup or not: (a) Check that

### Geometric Group Theory Homework 1 Solutions. e a b e e a b a a b e b b e a

Geometric Group Theory Homework 1 Solutions Find all groups G with G = 3 using multiplications tables and the group axioms. A multiplication table for a group must be a Latin square: each element appears

### Notes on finite group theory. Peter J. Cameron

Notes on finite group theory Peter J. Cameron October 2013 2 Preface Group theory is a central part of modern mathematics. Its origins lie in geometry (where groups describe in a very detailed way the

### ENUMERATION BY ALGEBRAIC COMBINATORICS. 1. Introduction

ENUMERATION BY ALGEBRAIC COMBINATORICS CAROLYN ATWOOD Abstract. Pólya s theorem can be used to enumerate objects under permutation groups. Using group theory, combinatorics, and many examples, Burnside

### Mathematics Course 111: Algebra I Part II: Groups

Mathematics Course 111: Algebra I Part II: Groups D. R. Wilkins Academic Year 1996-7 6 Groups A binary operation on a set G associates to elements x and y of G a third element x y of G. For example, addition

### Adding vectors We can do arithmetic with vectors. We ll start with vector addition and related operations. Suppose you have two vectors

1 Chapter 13. VECTORS IN THREE DIMENSIONAL SPACE Let s begin with some names and notation for things: R is the set (collection) of real numbers. We write x R to mean that x is a real number. A real number

### What are the symmetries of an equilateral triangle?

What are the symmetries of an equilateral triangle? A In order to answer this question precisely, we need to agree on what the word symmetry means. What are the symmetries of an equilateral triangle? A

### Geometry of Vectors. 1 Cartesian Coordinates. Carlo Tomasi

Geometry of Vectors Carlo Tomasi This note explores the geometric meaning of norm, inner product, orthogonality, and projection for vectors. For vectors in three-dimensional space, we also examine the

### Mathematics Course 111: Algebra I Part IV: Vector Spaces

Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 1996-7 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are

### Tangent and normal lines to conics

4.B. Tangent and normal lines to conics Apollonius work on conics includes a study of tangent and normal lines to these curves. The purpose of this document is to relate his approaches to the modern viewpoints

### S on n elements. A good way to think about permutations is the following. Consider the A = 1,2,3, 4 whose elements we permute with the P =

Section 6. 1 Section 6. Groups of Permutations: : The Symmetric Group Purpose of Section: To introduce the idea of a permutation and show how the set of all permutations of a set of n elements, equipped

### The Mathematics of Origami

The Mathematics of Origami Sheri Yin June 3, 2009 1 Contents 1 Introduction 3 2 Some Basics in Abstract Algebra 4 2.1 Groups................................. 4 2.2 Ring..................................

### RELATIONS AND FUNCTIONS

Chapter 1 RELATIONS AND FUNCTIONS There is no permanent place in the world for ugly mathematics.... It may be very hard to define mathematical beauty but that is just as true of beauty of any kind, we

### Complete graphs whose topological symmetry groups are polyhedral

Algebraic & Geometric Topology 11 (2011) 1405 1433 1405 Complete graphs whose topological symmetry groups are polyhedral ERICA FLAPAN BLAKE MELLOR RAMIN NAIMI We determine for which m the complete graph

### Group Theory: Basic Concepts

Group Theory: Basic Concepts Robert B. Griffiths Version of 9 Feb. 2009 References: EDM = Encyclopedic Dictionary of Mathematics, 2d English edition (MIT, 1987) HNG = T. W. Hungerford: Algebra (Springer-Verlag,

### Chapter 7. Permutation Groups

Chapter 7 Permutation Groups () We started the study of groups by considering planar isometries In the previous chapter, we learnt that finite groups of planar isometries can only be cyclic or dihedral

### 3 Congruence arithmetic

3 Congruence arithmetic 3.1 Congruence mod n As we said before, one of the most basic tasks in number theory is to factor a number a. How do we do this? We start with smaller numbers and see if they divide

### The Isometry Dimension and Orbit Number of a Finite Group

The Isometry Dimension and Orbit Number of a Finite Group Michael O. Albertson Department of Mathematics Smith College, Northampton, MA 0106 albertson@math.smith.edu Debra L. Boutin Department of Mathematics

### Groups and Symmetry. Andrew Baker

Groups and Symmetry Andrew Baker [24/12/2005] Department of Mathematics, University of Glasgow. E-mail address: a.baker@maths.gla.ac.uk URL: http://www.maths.gla.ac.uk/ ajb Contents Chapter 1. Isometries

### Symmetry Operations and Elements

Symmetry Operations and Elements The goal for this section of the course is to understand how symmetry arguments can be applied to solve physical problems of chemical interest. To achieve this goal we

### LECTURE NOTES ON THE MATHEMATICS BEHIND ESCHER S PRINTS: FORM SYMMETRY TO GROUPS

LECTURE NOTES ON THE MATHEMATICS BEHIND ESCHER S PRINTS: FORM SYMMETRY TO GROUPS JULIA PEVTSOVA 1. Introduction to symmetries of the plane 1.1. Rigid motions of the plane. Examples of four plane symmetries

### The noblest pleasure is the joy of understanding. (Leonardo da Vinci)

Chapter 6 Back to Geometry The noblest pleasure is the joy of understanding. (Leonardo da Vinci) At the beginning of these lectures, we studied planar isometries, and symmetries. We then learnt the notion

### Linear Codes. In the V[n,q] setting, the terms word and vector are interchangeable.

Linear Codes Linear Codes In the V[n,q] setting, an important class of codes are the linear codes, these codes are the ones whose code words form a sub-vector space of V[n,q]. If the subspace of V[n,q]

### Group Theory. Contents

Group Theory Contents Chapter 1: Review... 2 Chapter 2: Permutation Groups and Group Actions... 3 Orbits and Transitivity... 6 Specific Actions The Right regular and coset actions... 8 The Conjugation

### Department of Pure Mathematics and Mathematical Statistics University of Cambridge GEOMETRY AND GROUPS

Department of Pure Mathematics and Mathematical Statistics University of Cambridge GEOMETRY AND GROUPS Albrecht Dürer s engraving Melencolia I (1514) Notes Michaelmas 2012 T. K. Carne. t.k.carne@dpmms.cam.ac.uk

### Lectures notes on orthogonal matrices (with exercises) 92.222 - Linear Algebra II - Spring 2004 by D. Klain

Lectures notes on orthogonal matrices (with exercises) 92.222 - Linear Algebra II - Spring 2004 by D. Klain 1. Orthogonal matrices and orthonormal sets An n n real-valued matrix A is said to be an orthogonal

### An important class of codes are linear codes in the vector space Fq n, where F q is a finite field of order q.

Chapter 3 Linear Codes An important class of codes are linear codes in the vector space Fq n, where F q is a finite field of order q. Definition 3.1 (Linear code). A linear code C is a code in Fq n for

### Equivalence relations

Equivalence relations A motivating example for equivalence relations is the problem of constructing the rational numbers. A rational number is the same thing as a fraction a/b, a, b Z and b 0, and hence

### Chapter Three. Functions. In this section, we study what is undoubtedly the most fundamental type of relation used in mathematics.

Chapter Three Functions 3.1 INTRODUCTION In this section, we study what is undoubtedly the most fundamental type of relation used in mathematics. Definition 3.1: Given sets X and Y, a function from X to

### alternate interior angles

alternate interior angles two non-adjacent angles that lie on the opposite sides of a transversal between two lines that the transversal intersects (a description of the location of the angles); alternate

### 4. FIRST STEPS IN THE THEORY 4.1. A

4. FIRST STEPS IN THE THEORY 4.1. A Catalogue of All Groups: The Impossible Dream The fundamental problem of group theory is to systematically explore the landscape and to chart what lies out there. We

### Colorings, monodromy, and impossible triangulations

Colorings, monodromy, and impossible triangulations Ivan Izmestiev FU Berlin Computational geometry in non-euclidean spaces Nancy, August 6 8, 015 Impossible triangulations Theorem If a triangulation of

### Session 9 Solids. congruent regular polygon vertex. cross section edge face net Platonic solid polyhedron

Key Terms for This Session Session 9 Solids Previously Introduced congruent regular polygon vertex New in This Session cross section edge face net Platonic solid polyhedron Introduction In this session,

### GROUP ALGEBRAS. ANDREI YAFAEV

GROUP ALGEBRAS. ANDREI YAFAEV We will associate a certain algebra to a finite group and prove that it is semisimple. Then we will apply Wedderburn s theory to its study. Definition 0.1. Let G be a finite

### MAT2400 Analysis I. A brief introduction to proofs, sets, and functions

MAT2400 Analysis I A brief introduction to proofs, sets, and functions In Analysis I there is a lot of manipulations with sets and functions. It is probably also the first course where you have to take

### Planarity Planarity

Planarity 8.1 71 Planarity Up until now, graphs have been completely abstract. In Topological Graph Theory, it matters how the graphs are drawn. Do the edges cross? Are there knots in the graph structure?

### Elements of Abstract Group Theory

Chapter 2 Elements of Abstract Group Theory Mathematics is a game played according to certain simple rules with meaningless marks on paper. David Hilbert The importance of symmetry in physics, and for

### ISOMETRIES OF R n KEITH CONRAD

ISOMETRIES OF R n KEITH CONRAD 1. Introduction An isometry of R n is a function h: R n R n that preserves the distance between vectors: h(v) h(w) = v w for all v and w in R n, where (x 1,..., x n ) = x

### Definition. Proof. Notation and Terminology

ÌÖ Ò ÓÖÑ Ø ÓÒ Ó Ø ÈÐ Ò A transformation of the Euclidean plane is a rule that assigns to each point in the plane another point in the plane. Transformations are also called mappings, or just maps. Examples

### Plane transformations and isometries

Plane transformations and isometries We have observed that Euclid developed the notion of congruence in the plane by moving one figure on top of the other so that corresponding parts coincided. This notion

### MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 2. x n. a 11 a 12 a 1n b 1 a 21 a 22 a 2n b 2 a 31 a 32 a 3n b 3. a m1 a m2 a mn b m

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS 1. SYSTEMS OF EQUATIONS AND MATRICES 1.1. Representation of a linear system. The general system of m equations in n unknowns can be written a 11 x 1 + a 12 x 2 +

### Pythagorean Triples, Complex Numbers, Abelian Groups and Prime Numbers

Pythagorean Triples, Complex Numbers, Abelian Groups and Prime Numbers Amnon Yekutieli Department of Mathematics Ben Gurion University email: amyekut@math.bgu.ac.il Notes available at http://www.math.bgu.ac.il/~amyekut/lectures

### MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS Systems of Equations and Matrices Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a

### Lecture #5 (Dihedral group, Symmetric group, The Quaternion group, Klein-4 group) MTH 232, Abstract Algebra

Lecture #5 (Dihedral group, Symmetric group, The Quaternion group, Klein-4 group) MTH 232, Abstract Algebra February 20, 2012 Dihedral groups An important family of examples of groups is the class of groups

### Group Theory G13GTH. Chris Wuthrich. 1 Definitions and examples Examples Direct and semi-direct products Small groups...

Group Theory G13GTH Chris Wuthrich 2012 13 Contents 1 Definitions and examples 3 1.1 Examples..................................... 3 1.2 Direct and semi-direct products......................... 4 1.3 Small

### 0.1 Linear Transformations

.1 Linear Transformations A function is a rule that assigns a value from a set B for each element in a set A. Notation: f : A B If the value b B is assigned to value a A, then write f(a) = b, b is called

### Solutions to Problems for Mathematics 2.5 DV Date: April 14,

Solutions to Problems for Mathematics 25 DV Date: April 14, 2010 1 Solution to Problem 1 The equation is 75 = 12 6 + 3 Solution to Problem 2 The remainder is 1 This is because 11 evenly divides the first

### Undergraduate Research Opportunity Programme in Science

Undergraduate Research Opportunity Programme in Science Polyhedra Name: Kavitha d/o Krishnan Supervisor: Associate Professor Helmer Aslaksen Department of Mathematics National University of Singapore 2001/2002

### To introduce the concept of a mathematical structure called an algebraic group. To illustrate group concepts, we introduce cyclic and dihedral groups.

1 Section 6. Introduction to the Algebraic Group Purpose of Section: To introduce the concept of a mathematical structure called an algebraic group. To illustrate group concepts, we introduce cyclic and

### Notes on spherical geometry

Notes on spherical geometry Math 130 Course web site: www.courses.fas.harvard.edu/5811 This handout covers some spherical trigonometry (following yan s exposition) and the topic of dual triangles. 1. Some

### Topological Treatment of Platonic, Archimedean, and Related Polyhedra

Forum Geometricorum Volume 15 (015) 43 51. FORUM GEOM ISSN 1534-1178 Topological Treatment of Platonic, Archimedean, and Related Polyhedra Tom M. Apostol and Mamikon A. Mnatsakanian Abstract. Platonic

### The Not-Formula Book for C1

Not The Not-Formula Book for C1 Everything you need to know for Core 1 that won t be in the formula book Examination Board: AQA Brief This document is intended as an aid for revision. Although it includes

### Equi-angled cyclic and equilateral circumscribed polygons

Equi-angled cyclic and equilateral circumscribed polygons MICHAEL DE VILLIERS Man muss immer generalisieren. (One should always generalize). Karl Jacobi (1804-1851). In P. Davis and R. Hersh, 1981, The

### Higher Geometry Problems

Higher Geometry Problems ( Look up Eucidean Geometry on Wikipedia, and write down the English translation given of each of the first four postulates of Euclid. Rewrite each postulate as a clear statement

### CHAPTER 3. Mapping Concepts and Mapping Problems for. Scalar Valued Functions of a Scalar Variable

A SERIES OF CLASS NOTES TO INTRODUCE LINEAR AND NONLINEAR PROBLEMS TO ENGINEERS, SCIENTISTS, AND APPLIED MATHEMATICIANS REMEDIAL CLASS NOTES A COLLECTION OF HANDOUTS FOR REMEDIATION IN FUNDAMENTAL CONCEPTS

### PURE MATHEMATICS AM 27

AM Syllabus (015): Pure Mathematics AM SYLLABUS (015) PURE MATHEMATICS AM 7 SYLLABUS 1 AM Syllabus (015): Pure Mathematics Pure Mathematics AM 7 Syllabus (Available in September) Paper I(3hrs)+Paper II(3hrs)

### PURE MATHEMATICS AM 27

AM SYLLABUS (013) PURE MATHEMATICS AM 7 SYLLABUS 1 Pure Mathematics AM 7 Syllabus (Available in September) Paper I(3hrs)+Paper II(3hrs) 1. AIMS To prepare students for further studies in Mathematics and

### ABSTRACT ALGEBRA. Romyar Sharifi

ABSTRACT ALGEBRA Romyar Sharifi Contents Introduction 7 Part 1. A First Course 11 Chapter 1. Set theory 13 1.1. Sets and functions 13 1.2. Relations 15 1.3. Binary operations 19 Chapter 2. Group theory

### Abstract Algebra Cheat Sheet

Abstract Algebra Cheat Sheet 16 December 2002 By Brendan Kidwell, based on Dr. Ward Heilman s notes for his Abstract Algebra class. Notes: Where applicable, page numbers are listed in parentheses at the

### SYMMETRY MATHEMATICAL CONCEPTS AND APPLICATIONS IN TECHNOLOGY AND ENGINEERING

Daniel DOBRE, Ionel SIMION SYMMETRY MATHEMATICAL CONCEPTS AND APPLICATIONS IN TECHNOLOGY AND ENGINEERING Abstract: This article discusses the relation between the concept of symmetry and its applications

### 10. Graph Matrices Incidence Matrix

10 Graph Matrices Since a graph is completely determined by specifying either its adjacency structure or its incidence structure, these specifications provide far more efficient ways of representing a

### Binary Operations. Discussion. Power Set Operation. Binary Operation Properties. Whole Number Subsets. Let be a binary operation defined on the set A.

Binary Operations Let S be any given set. A binary operation on S is a correspondence that associates with each ordered pair (a, b) of elements of S a uniquely determined element a b = c where c S Discussion

### CK-12 Geometry: Exploring Solids

CK-12 Geometry: Exploring Solids Learning Objectives Identify different types of solids and their parts. Use Euler s formula to solve problems. Draw and identify different views of solids. Draw and identify

### Assignment 8: Selected Solutions

Section 4.1 Assignment 8: Selected Solutions 1. and 2. Express each permutation as a product of disjoint cycles, and identify their parity. (1) (1,9,2,3)(1,9,6,5)(1,4,8,7)=(1,4,8,7,2,3)(5,9,6), odd; (2)

### STRAIGHT LINES. , y 1. tan. and m 2. 1 mm. If we take the acute angle between two lines, then tan θ = = 1. x h x x. x 1. ) (x 2

STRAIGHT LINES Chapter 10 10.1 Overview 10.1.1 Slope of a line If θ is the angle made by a line with positive direction of x-axis in anticlockwise direction, then the value of tan θ is called the slope

### Chapter 1: Essentials of Geometry

Section Section Title 1.1 Identify Points, Lines, and Planes 1.2 Use Segments and Congruence 1.3 Use Midpoint and Distance Formulas Chapter 1: Essentials of Geometry Learning Targets I Can 1. Identify,

### Transformations Packet Geometry

Transformations Packet Geometry 1 Name: Geometry Chapter 14: Transformations Date Due Section Topics Assignment 14.1 14.2 14.3 Preimage Image Isometry Mapping Reflections Note: Notation is different in

### 5.3 The Cross Product in R 3

53 The Cross Product in R 3 Definition 531 Let u = [u 1, u 2, u 3 ] and v = [v 1, v 2, v 3 ] Then the vector given by [u 2 v 3 u 3 v 2, u 3 v 1 u 1 v 3, u 1 v 2 u 2 v 1 ] is called the cross product (or

### Theorem Let G be a group and H a normal subgroup of G. Then the operation given by (Q) is well defined.

22. Quotient groups I 22.1. Definition of quotient groups. Let G be a group and H a subgroup of G. Denote by G/H the set of distinct (left) cosets with respect to H. In other words, we list all the cosets

### Another new approach to the small Ree groups

Another new approach to the small Ree groups Robert A. Wilson Abstract. A new elementary construction of the small Ree groups is described. Mathematics Subject Classification (2000). 20D06. Keywords. Groups

### Lecture 4 DISCRETE SUBGROUPS OF THE ISOMETRY GROUP OF THE PLANE AND TILINGS

1 Lecture 4 DISCRETE SUBGROUPS OF THE ISOMETRY GROUP OF THE PLANE AND TILINGS This lecture, just as the previous one, deals with a classification of objects, the original interest in which was perhaps

### ORDERS OF ELEMENTS IN A GROUP

ORDERS OF ELEMENTS IN A GROUP KEITH CONRAD 1. Introduction Let G be a group and g G. We say g has finite order if g n = e for some positive integer n. For example, 1 and i have finite order in C, since

### NOTES ON GROUP THEORY

NOTES ON GROUP THEORY Abstract. These are the notes prepared for the course MTH 751 to be offered to the PhD students at IIT Kanpur. Contents 1. Binary Structure 2 2. Group Structure 5 3. Group Actions