# ENTRY GROUP THEORY. [ENTRY GROUP THEORY] Authors: started Mark Lezama: October 2003 Literature: Algebra by Michael Artin, Mathworld.

Size: px
Start display at page:

Download "ENTRY GROUP THEORY. [ENTRY GROUP THEORY] Authors: started Mark Lezama: October 2003 Literature: Algebra by Michael Artin, Mathworld."

Transcription

1 ENTRY GROUP THEORY [ENTRY GROUP THEORY] Authors: started Mark Lezama: October 2003 Literature: Algebra by Michael Artin, Mathworld Group theory [Group theory] is studies algebraic objects called groups. The German mathematician Karl Friedrich Gauss ( ) developed but did not publish some of the mathematics of group theory. The French mathematician Evariste Galois ( ) is generally credited with being the first to develop the theory, which he did by developing new techniques to study the solubility of equations. Group theory is a powerful method for analyzing abstract and physical systems in which symmetry the intrinsic property of an object to remain invariant under certain classes of transformations is present because the mathematical study of symmetry is systematized and formalized in group theory. Consequently, group theory is an important tool in physics particularly in quantum mechanics. group A [group] is an object consisting of a set G and a law of composition (or binary operation) L on G satisfying: L is associative. L has an identity in G. Every element of G has an inverse. The study of groups is known as group theory. If a group G has n elements where n is a positive integer, then G is a finite group with order n. If a group is not finite it is infinite. Examples: Z +, the integers under addition; R + = (R, +), the real numbers under addition; R = (R {0}, ), the real numbers without zero under multiplication; GL n (C), the n n general linear group under matrix multiplication; S n, the symmetric group on n objects under composition. law of composition A [law of composition] or, binary operation, on a set S is a function from S S into S. That is, a law of composition on S prescribes a rule for combining pairs of elements in S to get an element in S. For convenience, functional notation is not used; that is, if a law of composition f sends (a, b) to c, one does not usually write f(a, b) = c. It is customary to instead use notation that resembles that used for multiplication or addition of real numbers, such as ab = c, a b = c, a b = c, a + b = c, and so on. An example of a law of composition is multiplication on the real numbers, R. If m: R R R defines multiplication on R then m(x, y) = x y. For example m(2, 5) = 2 5 = 10.

2 binary operation A [binary operation], or law of composition, on a set S is a function from S S into S. That is, a binary operation on S prescribes a rule for combining pairs of elements in S to get an element in S. For convenience, functional notation is not used; that is, if a binary operation f sends (a, b) to c, one does not usually write f(a, b) = c. It is customary to instead use notation that resembles that used for multiplication or addition of real numbers, such as ab = c, a b = c, a b = c, a + b = c, and so on. An example of a binary operation is multiplication on the real numbers, R. If m: R R R defines multiplication on R then m(x, y) = x y. For example m(2, 5) = 2 5 = 10. associative A law of composition on a set S is [associative] if for all a, b, c S, (ab)c = a(bc). The informal intuition behind associativity (the property of being associative) is that if one has an expression in which there are many parentheses and the only operation performed in this expression is that defined by an associative law of composition, then one may ignore the parentheses. For example, if is an associative law of composition on S and a, b, c, d S, then ((a (b c)) d = ((a b) c) d = (a b) (c d) and so on; thus one may write a b c d without being ambiguous. An example of an associative law of composition is addition on the integers, Z. That is, for all a, b, c Z, (a + b) + c = a + (b + c). identity An [identity] for a law of composition on a set S is an element e such that, for all a S, ea = a and ae = a. Note that a law of composition has at most one identity. The symbols e, 0 and 1 are commonly used to denote the identity element of a group. The number 0 is an identity for addition on the real numbers. identity Suppose a set S has a law of composition with identity 1. For every element a S, if there exists an element b S such that ab = 1 and ba = 1 then b is the [inverse] of a. When using multiplicative notation for the law of composition, the inverse of a can be written as a 1. As an example, the inverse of any integer n is n where the law of composition is addition and the identity is 0. As another example, the inverse of any nonzero real number x is 1 x, where the law of composition is multiplication and the identity is 1. general linear group The n n [general linear group] GL n (F ) is the set of n n matrices with entries in the field F and nonzero determinant, under the law of composition of matrix multiplication. Thus GL n (F ) is the group of n n invertible matrices with entries in F. If F is a finite field of field order q then sometimes the general linear group GL n (F ) is denoted by GL n (q). The general linear group often appears with respect to the real numbers, R, or the complex numbers, C; that is, the general linear group often appears as GL n (R) or GL n (C). The special linear group SL n (F ) is the subgroup of GL n (F ) whose elements have determinant equal to 1.

3 special linear group The n n [special linear group] SL n (F ) is the set of n n matrices with entries in the field F and determinant equal to 1, under the law of composition of matrix multiplication. If F is a finite field of field order q then sometimes the special linear group SL n (F ) is denoted by SL n (q). SL n (F ) is a subgroup of the general linear group GL n (F ). trivial A group is [trivial] if it contains exactly one element. The one element in the group is the identity element. As all trivial groups are isomorphic, one usually refers to a trivial group as the trivial group. A group that is not trivial is nontrivial. trivial The group containing exactly one element (the identity) is unique up to isomorphism and is therefore called the [trivial group]. The trivial group is a normal subgroup of every group. nontrivial A group is [nontrivial] if it is not trivial. abelian A group is [abelian] if its law of composition is commutative. Examples of abelian groups include the following: R + = (R, +), the real numbers under addition; R = (R {0}, ), the real numbers without zero under multiplication; any cyclic group. Examples of nonabelian groups, i.e. groups that are not abelian: GL n (C), the general linear group; The symmetric group on n objects, where n is a positive integer greater than 2. commutative A law of composition on a set S is [commutative] if for all a, b S ab = ba. An example of a commutative law of composition is addition on the real numbers: for example, = 7.2 =

4 cancellation Law The [cancellation Law] states that if a, b, and c are elements of a group and if ab = ac then b = c. Similarly, if ba = ca then b = c. The Cancellation Law follows from the fact that every element of a group has an inverse. permutation If S is a set, then a [permutation] of S is a bijective map from S into S. The intuition underlying the definition of a permutation is that a permutation determines a reordering of the elements in a list or the rearrangement of objects. For example, the permutation σ : {1, 2, 3} {1, 2, 3} defined by σ(1) = 2, σ(2) = 1, and σ(3) = 3 can be thought to represent the reordering of the list 1,2,3 that results in the list 2,1,3. There is an important kind of permutation called a transposition. A transposition of a set S is a permutation σ: S S satisfying the following: there exist s 1, s 2 S such that σ(s 1 ) = s 2 σ(s 2 ) = s 1 and for all s S, if s s 1 and s s 2, then σ(s) = s. Every permutation of a finite set can be written as the composition of a finite number of transpositions of that set. For example, the permutation σ : {1, 2, 3} {1, 2, 3} defined by σ(1) = 2, σ(2) = 3, and σ(3) = 1 is equivalent to the composition of two transpositions. Define σ 1 : {1, 2, 3} {1, 2, 3} by σ 1 (1) = 2, σ 1 (2) = 1, and σ(3) = 3, and define σ 2 : {1, 2, 3} {1, 2, 3} by σ 2 (1) = 3, σ 1 (2) = 2, and σ(3) = 1. Then σ 1 and σ 2 are transpositions and σ = σ 2 σ 1. The sign of a permutation σ is ( 1) n where n is a finite positive integer such that there exist n transpositions whose composition equals σ. If a permutation has sign 1, then it is called an even permutation. If a permutation has sign -1 then it is called an odd permutation. Thus the identity permutation is an even permutation (since it is equal to the composition of any transposition with itself), and any transposition is an odd permutation (since it is equal to one transposition). The sign map encapsulates the notion of the sign of a permutation of a finite set. The set of permutations on a set forms a group where the law of composition is composition of functions. One example of a group of permutations that appears frequently in group theory is the symmetric group on n objects, i.e. the group of permutations of the set {1, 2,..., n}. transposition A [transposition] of a set S is a permutation σ: S S satisfying the following: there exist s 1, s 2 S such that σ(s 1 ) = s 2 σ(s 2 ) = s 1 and for all s S, if s s 1 and s s 2, then σ(s) = s. Every permutation of a finite set can be written as the composition of a finite number of transpositions of that set. For example, the permutation σ : {1, 2, 3} {1, 2, 3} defined by σ(1) = 2, σ(2) = 3, and σ(3) = 1 is equivalent to the composition of two transpositions. Define σ 1 : {1, 2, 3} {1, 2, 3} by σ 1 (1) = 2, σ 1 (2) = 1, and σ(3) = 3, and define σ 2 : {1, 2, 3} {1, 2, 3} by σ 2 (1) = 3, σ 1 (2) = 2, and σ(3) = 1. Then σ 1 and σ 2 are transpositions and σ = σ 2 σ 1. Every transposition is an odd permutation.

5 sign The [sign] of a permutation σ is ( 1) n where n is a finite positive integer such that there exist n transpositions whose composition equals σ. If a permutation has sign 1, then it is called an even permutation. If a permutation has sign -1 then it is called an odd permutation. Thus the identity permutation is an even permutation (since it is equal to the composition of any transposition with itself), and any transposition is an odd permutation (since it is equal to one transposition). even permutation An [even permutation] is a permutation that has sign 1. That is, an even permutation is the composition of an even number of transpositions. Thus the identity permutation is an even permutation. odd permutation An [odd permutation] is a permutation that has sign -1. That is, an odd permutation is the composition of an odd number of transpositions. Thus every tranposition is an odd permutation. symmetric group The [symmetric group] on n objects, denoted S n, is the group of permutations of the set {1, 2,..., n}; the law of composition is composition of functions. The order of S n is n! for all positive integers n. For example, S 2 = {e, σ}, where e is the identity permutation, and σ is a transposition. That is, e is the identity element of S 2 and is defined by e(1) = 1 and e(2) = 2; σ is defined by σ(1) = 2 and σ(2) = 1. sign map The [sign map], denoted sign, is a group homomorphism from the symmetric group, S n, into the group {1, 1} (under multiplication). The sign map is defined by sign(σ) = ( 1) k where σ is equal to the composition of k transpositions. The sign map is well-defined because it is a standard result that if σ is any permutation (of any set), and if σ is equal to the composition of k transpositions and is also equal to the composition of m transpositions, then ( 1) k = ( 1) m. The kernel of the sign map is the alternating group, A n ; that is, A n is the group of even permutations on n objects. alternating group The [alternating group] is the kernel of the sign map. In other words, the alternating group on n objects, usually denoted A n, is a normal subgroup of the symmetric group on n objects: A n = {σ S n sign(σ) = 1}. Thus A n is the group of even permutations in S n. For n 5, A n is a simple group, i.e. a group that has no proper normal subgroup.

6 simple group A group G is a [simple group] if every normal subgroup N of G is not a proper subgroup. That is, G is simple if its only normal subgroups are G and the trivial group. The alternating group A n is simple for n 5. Any cyclic group of prime order is simple. Any cyclic group of prime order is simple. In fact, any simple abelian group is a cyclic group of prime order. subgroup A subset H of a group G is a [subgroup] of G if it satisfies the following properties: If a H and b H, then ab H. 1 H, where 1 is the identity element of G. If a H then the inverse of a, a 1, is also in H. When it is clear that G is a group, sometimes H G is used to denote that H is a subgroup of G (as opposed to merely being a subset of G). Every nontrivial group G has at least two subgroups: the whole group G and the subgroup {1} consisting exactly of the identity element of G. If G is trivial then these two subgroups are the same and G has exactly one subgroup. A subgroup is a proper subgroup if it is neither the whole group nor the trivial group. As an example, the integers under addition are a subgroup of the real numbers under addition. By Lagrange s Group Theorem, if H is a subgroup of a finite group G, the order of H divides the order of G. proper subgroup A [proper subgroup] of a group G is a nontrivial subgroup of G that is not equal to G. order A finite group G is said to have [order] n if G has n elements. More generally, the order of a group G is the cardinality of the set G, both of which are often denoted G. For any given element x of a given group, if there exists a positive integer k such that x k = 1, then x is said to have order m, where m is the least positive integer satisfying x m = 1. If x k 1 for all positive integers k, then x is said to have infinite order.

7 cyclic group If G is a group and if x is an element of G, the [cyclic group] x generated by x is the set of all powers of x: x = {..., x 2, x 1, 1, x, x 2,...}. Note that x is the smallest subgroup of G which contains x. Further note that any cyclic group is abelian. If x has infinite order then x is said to be infinite cyclic. Note that if x is infinite cyclic then x is isomorphic to Z +, the integers under addition. As a result, one sometimes refers to any infinite cyclic group as the infinite cyclic group, denoted Z +. If x has order n, then x has order n and is called a cyclic group of order n: x = {1, x, x 2,..., x n }. If x is a cyclic group of order n, then x is isomorphic to Z/n, where Z/n is the group satisfying the following properties (we use additive notation as opposed to multiplicative notation for the law of composition of Z/n): 1. Z/n = {0, 1, 2,..., n 1}. 2. for any x, y Z/n, x + 1 y is the unique element in Z/n which is congruent modulo n to x + y, where + 1 denotes the law of composition on Z/n and + denotes conventional integer addition. Normally + is used to denote the law of composition on Z/n, but + 1 is used here to distinguish it from conventional addition. Two integers a and b are congruent modulo n, written a b(modulo n), if n divides b a. As a result, one sometimes refers to any cyclic group of order n as the cyclic group of order n, often denoted Z/n. cyclic group Let G 1 and G 2 be groups. A map ϕ: G 1 G 2 is a group [homomorphism] if ϕ(ab) = ϕ(a)ϕ(b) for all a, b G 1. Here we use the same multiplicative notation for the laws of composition of G 1 and G 2, even though there is no requirement that their laws of composition be the same. Note that ϕ(1 G1 ) = 1 G2 and ϕ(a 1 ) = ϕ(a) 1 for all a G, where 1 Gi is the identity of G i. The kernel of ϕ, sometimes denoted ker ϕ, is the set {x G 1 ϕ(x) = 1 G2 }. Note that ker ϕ is a normal subgroup of G 2. Another subgroup of G 2 determined by ϕ is the image of ϕ, sometimes denoted im ϕ. The image of ϕ is im ϕ = {x G 2 x = ϕ(a) for some a G 1 }. Sometimes the image of ϕ is denoted ϕ(g 1 ). The following are examples of homomorphisms: The inclusion map i: H G defined by i(a) = a, where H is a subgroup of G. ker i = {1 G } and im i = H. For a fixed a G, the map ϕ: Z + G defined by ϕ(n) = a n, where Z + denotes the integers with addition. ker ϕ = {n a n = 1 G } and im ϕ = a (the cyclic subgroup generated by a). The determinant map det: GL n (R) R, where GL n (R) denotes the general linear group and R denotes the real numbers without zero under multiplication. kerdet = SL n (R), the special linear group, and imdet = R. The sign map on permutations sign: S n {1, 1}, where S n denotes the symmetric group on n objects. ker sign = A n, the alternating group, and im sign = {1, 1}. Let R 1 and R 2 be rings. A map ϕ: R 1 R 2 is a ring homomorphism if ϕ(a + b) = ϕ(a) + ϕ(b), ϕ(ab) = ϕ(a)ϕ(b), and ϕ(1 R1 ) = 1 R2, for all a, b R 1. Here we use the same additive and multiplicative notation for the laws of composition of R 1 and R 2, even though there is no requirement that their laws of composition be the same.

8 kernel The [kernel] of a group homomorphism ϕ: G 1 G 2 is the set ker ϕ = {x G 1 ϕ(x) = 1 G2 }, where 1 G2 denotes the identity of G 2. The kernel of a homomorphism is an important example of a normal subgroup. There are many results involving the kernel of a homomorphism. image The [image] of a map ϕ: G 1 G 2 is the set {x G 2 x = ϕ(a) for some a G 1 }. In general, the image of ϕ is often denoted ϕ(g 1 ). If ϕ is a group homomorphism, then the image of ϕ is a subgroup of G 2 and is sometimes denoted im ϕ. isomorphism A group [isomorphism] is a bijective group homomorphism. A ring isomorphism is a bijective ring homomorphism. isomorphic Two groups G 1 and G 2 are [isomorphic] if there exists a group isomorphism from G 1 into G 2. Sometimes G 1 = G2 is used to denote G 1 and G 2 are isomorphic. Note that = is an equivalence relation on the set of all groups. When one speaks of classifying groups, hat is usually referred to is the classification of isomorphism classes. Thus one might say that there are two groups of order 6 up to isomorphism, meaning that there are two isomorphism classes of groups of order 6. One sometimes says that G 1 is isomorphic to G 2 instead of saying G 1 and G 2 are isomorphic. automorphism An [automorphism] of a group G is an isomorphism from G into G. The identity map is a simple example of an automorphism. Conjugation by an element of the group is an important example of an automorphism. That is, for a fixed element b G, conjugation by b is the map ϕ: G G defined by ϕ(a) = bab 1. Here we use multiplicative notation for the group law of composition. Note that if G is abelian, then conjugation by any element is the identity map. However, if G is not abelian, then there exists a nontrivial conjugation (i.e. a conjugation not equal to the identity map) of G. automorphism Let G be a group and let b G. The map ϕ: G G defined by ϕ(a) = bab 1 is [conjugation] by b. Note that conjugation is an automorphism of G. Further note that if G is abelian, then conjugation by any element is the identity map. However, if G is not abelian, then there exists a nontrivial conjugation (i.e. a conjugation not equal to the identity map) of G.

9 conjugation Let G be a group and let H be a subgroup of G. H is a [normal subgroup] of G (sometimes written H G) if for all a H and for all x G, xax 1 H. Note that it follows that any subgroup of an abelian group is normal. Normal subgroups appear often in group theory. Every group G has at least one normal subgroup, called the center of G, denoted by Z or Z(G). The center of G is the set of elements that commute with every element of G: Z(G) = {z G zx = xz for all x G}. Another important example of a normal subgroup is the kernel of a group homomorphism. center The [center] of a group G, denoted by Z or Z(G) is the set of elements that commute with every element of G: Z(G) = {z G zx = xz for all x G}. Note that if G is abelian then Z(G) = G. coset Given a subgroup H of a group G, a [coset] of H is a subset H of G such that there exists an a G such that (1) H = ah = {ah h H}, in which case H is said to be a left coset; or (2) H = Ha = {ha h H}, in which case H is said to be a right coset. Given a G, ah is not necessarily equal to Ha. However, one can show that the subgroup H of G is a normal subgroup if and only if ah = Ha for every a G. In what follows, only left cosets will be discussed, though similar statements may be made about right cosets. The left cosets of H are the equivalence classes of the equivalence relation defined by a b if there exists h H such that a = bh. Since equivalence classes form a partition, the left cosets of H partition G. The cardinality of the set of left cosets of H is called the index of H in G and is denoted by [G : H]. Given a G, h ah defines a bijective map from H into ah. If G is finite, it follows that G = H [G : H], where G denotes the order of G. A very important result follows: if G is finite, then the order of H divides the order of G. Moreover, since the order of any element of G is the order of the cyclic subgroup it generates, if G is finite then the order of an element of G divides the order of G. These results follow from a special case of what is known as Lagrange s Group Theorem: if G is a group, H is a subgroup of G and K is a sugroup of H, then [G : K] = [G : H][H : K], where the products are taken as products of cardinals. An important result that follows from Lagrange s Theorem is that if the order of G is a prime number then G = a for any a G such that a is not the identity, where a denotes the cyclic group generated by a. Note that if ϕ: G G is a group [homomorphism], then [G : kerϕ] = imϕ. Thus another result of Langrange s Theorem is that G = kerϕ imϕ.

10 left coset Given a subgroup H of a group G, a [left coset] of H is a subset H of G such that there exists an a G such that H = ah = {ah h H}. Given a G, ah is not necessarily equal to Ha. However, one can show that the subgroup H of G is a normal subgroup if and only if ah = Ha for every a G. In what follows, only left cosets will be discussed, though similar statements may be made about right cosets. The left cosets of H are the equivalence classes of the equivalence relation defined by a b if there exists h H such that a = bh. Since equivalence classes form a partition, the left cosets of H partition G. The cardinality of the set of left cosets of H is called the index of H in G and is denoted by [G : H]. Given a G, h ah defines a bijective map from H into ah. If G is finite, it follows that G = H [G : H], where G denotes the order of G. A very important result follows: if G is finite, then the order of H divides the order of G. Moreover, since the order of any element of G is the order of the cyclic subgroup it generates, if G is finite then the order of an element of G divides the order of G. These results follow from a special case of what is known as Lagrange s Group Theorem: if G is a group, H is a subgroup of G and K is a sugroup of H, then [G : K] = [G : H][H : K], where the products are taken as products of cardinals. An important result that follows from Lagrange s Theorem is that if the order of G is a prime number then G = a for any a G such that a is not the identity, where a denotes the cyclic group generated by a. Note that if ϕ: G G is a group [homomorphism], then [G : ker(ϕ)] = im(ϕ). Thus another result of Langrange s Theorem is that G = ker(ϕ) im(ϕ). right coset Given a subgroup H of a group G, a [right coset] of H is a subset H of G such that there exists an a G such that H = Ha = {ha h H}. Given a G, ah is not necessarily equal to Ha. However, one can show that the subgroup H of G is a normal subgroup if and only if ah = Ha for every a G. In what follows, only left cosets will be discussed, though similar statements may be made about right cosets. The left cosets of H are the equivalence classes of the equivalence relation defined by a b if there exists h H such that a = bh. Since equivalence classes form a partition, the left cosets of H partition G. The cardinality of the set of left cosets of H is called the index of H in G and is denoted by [G : H]. Given a G, h ah defines a bijective map from H into ah. If G is finite, it follows that G = H [G : H], where G denotes the order of G. A very important result follows: if G is finite, then the order of H divides the order of G. Moreover, since the order of any element of G is the order of the cyclic subgroup it generates, if G is finite then the order of an element of G divides the order of G. These results follow from a special case of what is known as Lagrange s Group Theorem: if G is a group, H is a subgroup of G and K is a sugroup of H, then [G : K] = [G : H][H : K], where the products are taken as products of cardinals. An important result that follows from Lagrange s Theorem is that if the order of G is a prime number then G = a for any a G such that a is not the identity, where a denotes the cyclic group generated by a. Note that if ϕ: G G is a group homomorphism, then [G : ke(ϕ)] = im(ϕ). Thus another result of Langrange s Theorem is that G = ker(ϕ) im(ϕ). index The [index] of subgroup H of a group G is the cardinality of the set of left cosets of H in G. The index of H in G is denoted [G : H].

11 quotient group Given a group G and a normal subgroup N of G, the [quotient group] of N in G, written G/N and read G mod(ulo) N, is the set of cosets of N in G, under the law of composition that is defined as follows: (an)(bn) = abn, where xn = {xn n N}. Note that since N is normal, an = Na for all a G, so it is not necessary to define this law of composition in terms of left cosets instead of right cosets. The order of G/N is the index [G : N] of N in G. Quotient groups can be identified by the First Isomorphism Theorem: if ϕ: G G is a surjective group homomorphism and if N = ke(ϕ) then ψ: G/N G is an isomorphism, where ψ is defined by ψ(an) = ϕ(a). First Isomorphism Theorem The [First Isomorphism Theorem]. Suppose ϕ: G G is a surjective group homomorphism, and let N denote the kernel of ϕ. Then the quotient group G/N is isomorphic to G by the map ψ defined by ψ(an) = ϕ(a). The First Isomorphism Theorem is the principle method of identifying quotient groups. As an example, consider the group homomorphism ϕ from C, the nonzero complex numbers under multiplication, into R, the nonzero real numbers under multiplication, defined by ϕ(z) = z, where z denotes the absolute value of z. The kernel of ϕ is the unit circle, U, and the image of ϕ is the group of positive real numbers. So C /U is isomorphic to the multiplicative group of positive real numbers. operation Given a group G and a set S, an [operation] of a G on S is a map from G S into S - often written using multiplicative notation: (g, s) gs - satisfying: 1s = s for all s S, where 1 is the identity of G; and (gg )s = g(g s), for all g, g G and for all s S. There are some terms that are sometimes associated with a group operation: S is often called a G-set; G is sometimes called a transformation group; and the group operation is often also called a group action. Mathworld: Historically, the first group action studied was the action of the Galois group on the roots of a polynomial. However, there are numerous examples and applications of group actions in many branches of mathematics, including algebra, topology, geometry, number theory, and analysis, as well as the sciences, including chemistry and physics. This file is part of the Sofia project sponsored by the Provost s fund for teaching and learning at Harvard university. There are 44 entries in this file.

12 Index abelian, 3 alternating group, 5 associative, 2 automorphism, 8 binary operation, 2 cancellation Law, 4 center, 9 commutative, 3 conjugation, 9 coset, 9 cyclic group, 7 even permutation, 5 First Isomorphism Theorem, 11 general linear group, 2 group, 1 Group theory, 1 identity, 2 image, 8 index, 10 isomorphic, 8 isomorphism, 8 kernel, 8 law of composition, 1 left coset, 10 nontrivial, 3 odd permutation, 5 operation, 11 order, 6 permutation, 4 proper subgroup, 6 quotient group, 11 right coset, 10 sign, 5 sign map, 5 simple group, 6 special linear group, 3 subgroup, 6 symmetric group, 5 transposition, 4 trivial, 3 12

### Supplement. Dr. Bob s Modern Algebra Glossary Based on Fraleigh s A First Course on Abstract Algebra, 7th Edition, Sections 0 through IV.

Glossary 1 Supplement. Dr. Bob s Modern Algebra Glossary Based on Fraleigh s A First Course on Abstract Algebra, 7th Edition, Sections 0 through IV.23 Abelian Group. A group G, (or just G for short) is

### BASIC GROUP THEORY : G G G,

BASIC GROUP THEORY 18.904 1. Definitions Definition 1.1. A group (G, ) is a set G with a binary operation : G G G, and a unit e G, possessing the following properties. (1) Unital: for g G, we have g e

### PROBLEMS FROM GROUP THEORY

PROBLEMS FROM GROUP THEORY Page 1 of 12 In the problems below, G, H, K, and N generally denote groups. We use p to stand for a positive prime integer. Aut( G ) denotes the group of automorphisms of G.

### 5 Group theory. 5.1 Binary operations

5 Group theory This section is an introduction to abstract algebra. This is a very useful and important subject for those of you who will continue to study pure mathematics. 5.1 Binary operations 5.1.1

### Cosets, factor groups, direct products, homomorphisms, isomorphisms

Cosets, factor groups, direct products, homomorphisms, isomorphisms Sergei Silvestrov Spring term 2011, Lecture 11 Contents of the lecture Cosets and the theorem of Lagrange. Direct products and finitely

### Section 15 Factor-group computation and simple groups

Section 15 Factor-group computation and simple groups Instructor: Yifan Yang Fall 2006 Outline Factor-group computation Simple groups The problem Problem Given a factor group G/H, find an isomorphic group

### Math 2070BC Term 2 Weeks 1 13 Lecture Notes

Math 2070BC 2017 18 Term 2 Weeks 1 13 Lecture Notes Keywords: group operation multiplication associative identity element inverse commutative abelian group Special Linear Group order infinite order cyclic

### Introduction to Groups

Introduction to Groups Hong-Jian Lai August 2000 1. Basic Concepts and Facts (1.1) A semigroup is an ordered pair (G, ) where G is a nonempty set and is a binary operation on G satisfying: (G1) a (b c)

### DISCRETE MATH (A LITTLE) & BASIC GROUP THEORY - PART 3/3. Contents

DISCRETE MATH (A LITTLE) & BASIC GROUP THEORY - PART 3/3 T.K.SUBRAHMONIAN MOOTHATHU Contents 1. Cayley s Theorem 1 2. The permutation group S n 2 3. Center of a group, and centralizers 4 4. Group actions

### Algebraic Structures Exam File Fall 2013 Exam #1

Algebraic Structures Exam File Fall 2013 Exam #1 1.) Find all four solutions to the equation x 4 + 16 = 0. Give your answers as complex numbers in standard form, a + bi. 2.) Do the following. a.) Write

### Solutions for Assignment 4 Math 402

Solutions for Assignment 4 Math 402 Page 74, problem 6. Assume that φ : G G is a group homomorphism. Let H = φ(g). We will prove that H is a subgroup of G. Let e and e denote the identity elements of G

### CS 468: Computational Topology Group Theory Fall b c b a b a c b a c b c c b a

Q: What s purple and commutes? A: An abelian grape! Anonymous Group Theory Last lecture, we learned about a combinatorial method for characterizing spaces: using simplicial complexes as triangulations

### 2MA105 Algebraic Structures I

2MA105 Algebraic Structures I Per-Anders Svensson http://homepage.lnu.se/staff/psvmsi/2ma105.html Lecture 7 Cosets once again Factor Groups Some Properties of Factor Groups Homomorphisms November 28, 2011

### MATH 101: ALGEBRA I WORKSHEET, DAY #3. Fill in the blanks as we finish our first pass on prerequisites of group theory.

MATH 101: ALGEBRA I WORKSHEET, DAY #3 Fill in the blanks as we finish our first pass on prerequisites of group theory 1 Subgroups, cosets Let G be a group Recall that a subgroup H G is a subset that is

### φ(xy) = (xy) n = x n y n = φ(x)φ(y)

Groups 1. (Algebra Comp S03) Let A, B and C be normal subgroups of a group G with A B. If A C = B C and AC = BC then prove that A = B. Let b B. Since b = b1 BC = AC, there are a A and c C such that b =

### Section 13 Homomorphisms

Section 13 Homomorphisms Instructor: Yifan Yang Fall 2006 Homomorphisms Definition A map φ of a group G into a group G is a homomorphism if for all a, b G. φ(ab) = φ(a)φ(b) Examples 1. Let φ : G G be defined

### Lecture 4.1: Homomorphisms and isomorphisms

Lecture 4.: Homomorphisms and isomorphisms Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 4, Modern Algebra M. Macauley (Clemson) Lecture

### Theorems and Definitions in Group Theory

Theorems and Definitions in Group Theory Shunan Zhao Contents 1 Basics of a group 3 1.1 Basic Properties of Groups.......................... 3 1.2 Properties of Inverses............................. 3

### Note that a unit is unique: 1 = 11 = 1. Examples: Nonnegative integers under addition; all integers under multiplication.

Algebra fact sheet An algebraic structure (such as group, ring, field, etc.) is a set with some operations and distinguished elements (such as 0, 1) satisfying some axioms. This is a fact sheet with definitions

### Algebra homework 6 Homomorphisms, isomorphisms

MATH-UA.343.005 T.A. Louis Guigo Algebra homework 6 Homomorphisms, isomorphisms Exercise 1. Show that the following maps are group homomorphisms and compute their kernels. (a f : (R, (GL 2 (R, given by

### MATH 4107 (Prof. Heil) PRACTICE PROBLEMS WITH SOLUTIONS Spring 2018

MATH 4107 (Prof. Heil) PRACTICE PROBLEMS WITH SOLUTIONS Spring 2018 Here are a few practice problems on groups. You should first work through these WITHOUT LOOKING at the solutions! After you write your

### INTRODUCTION TO THE GROUP THEORY

Lecture Notes on Structure of Algebra INTRODUCTION TO THE GROUP THEORY By : Drs. Antonius Cahya Prihandoko, M.App.Sc e-mail: antoniuscp.fkip@unej.ac.id Mathematics Education Study Program Faculty of Teacher

### Algebra. Travis Dirle. December 4, 2016

Abstract Algebra 2 Algebra Travis Dirle December 4, 2016 2 Contents 1 Groups 1 1.1 Semigroups, Monoids and Groups................ 1 1.2 Homomorphisms and Subgroups................. 2 1.3 Cyclic Groups...........................

### Lecture Note of Week 2

Lecture Note of Week 2 2. Homomorphisms and Subgroups (2.1) Let G and H be groups. A map f : G H is a homomorphism if for all x, y G, f(xy) = f(x)f(y). f is an isomorphism if it is bijective. If f : G

### A Little Beyond: Linear Algebra

A Little Beyond: Linear Algebra Akshay Tiwary March 6, 2016 Any suggestions, questions and remarks are welcome! 1 A little extra Linear Algebra 1. Show that any set of non-zero polynomials in [x], no two

### book 2005/1/23 20:41 page 132 #146

book 2005/1/23 20:41 page 132 #146 132 2. BASIC THEORY OF GROUPS Definition 2.6.16. Let a and b be elements of a group G. We say that b is conjugate to a if there is a g G such that b = gag 1. You are

### Section 18 Rings and fields

Section 18 Rings and fields Instructor: Yifan Yang Spring 2007 Motivation Many sets in mathematics have two binary operations (and thus two algebraic structures) For example, the sets Z, Q, R, M n (R)

### 2) e = e G G such that if a G 0 =0 G G such that if a G e a = a e = a. 0 +a = a+0 = a.

Chapter 2 Groups Groups are the central objects of algebra. In later chapters we will define rings and modules and see that they are special cases of groups. Also ring homomorphisms and module homomorphisms

### 120A LECTURE OUTLINES

120A LECTURE OUTLINES RUI WANG CONTENTS 1. Lecture 1. Introduction 1 2 1.1. An algebraic object to study 2 1.2. Group 2 1.3. Isomorphic binary operations 2 2. Lecture 2. Introduction 2 3 2.1. The multiplication

### Homomorphisms. The kernel of the homomorphism ϕ:g G, denoted Ker(ϕ), is the set of elements in G that are mapped to the identity in G.

10. Homomorphisms 1 Homomorphisms Isomorphisms are important in the study of groups because, being bijections, they ensure that the domain and codomain groups are of the same order, and being operation-preserving,

### REU 2007 Discrete Math Lecture 2

REU 2007 Discrete Math Lecture 2 Instructor: László Babai Scribe: Shawn Drenning June 19, 2007. Proofread by instructor. Last updated June 20, 1 a.m. Exercise 2.0.1. Let G be an abelian group and A G be

### 1.1 Definition. A monoid is a set M together with a map. 1.3 Definition. A monoid is commutative if x y = y x for all x, y M.

1 Monoids and groups 1.1 Definition. A monoid is a set M together with a map M M M, (x, y) x y such that (i) (x y) z = x (y z) x, y, z M (associativity); (ii) e M such that x e = e x = x for all x M (e

### MA441: Algebraic Structures I. Lecture 26

MA441: Algebraic Structures I Lecture 26 10 December 2003 1 (page 179) Example 13: A 4 has no subgroup of order 6. BWOC, suppose H < A 4 has order 6. Then H A 4, since it has index 2. Thus A 4 /H has order

### Cosets and Normal Subgroups

Cosets and Normal Subgroups (Last Updated: November 3, 2017) These notes are derived primarily from Abstract Algebra, Theory and Applications by Thomas Judson (16ed). Most of this material is drawn from

### First Semester Abstract Algebra for Undergraduates

First Semester Abstract Algebra for Undergraduates Lecture notes by: Khim R Shrestha, Ph. D. Assistant Professor of Mathematics University of Great Falls Great Falls, Montana Contents 1 Introduction to

### Definition List Modern Algebra, Fall 2011 Anders O.F. Hendrickson

Definition List Modern Algebra, Fall 2011 Anders O.F. Hendrickson On almost every Friday of the semester, we will have a brief quiz to make sure you have memorized the definitions encountered in our studies.

### Problem 1. Let I and J be ideals in a ring commutative ring R with 1 R. Recall

I. Take-Home Portion: Math 350 Final Exam Due by 5:00pm on Tues. 5/12/15 No resources/devices other than our class textbook and class notes/handouts may be used. You must work alone. Choose any 5 problems

### (d) Since we can think of isometries of a regular 2n-gon as invertible linear operators on R 2, we get a 2-dimensional representation of G for

Solutions to Homework #7 0. Prove that [S n, S n ] = A n for every n 2 (where A n is the alternating group). Solution: Since [f, g] = f 1 g 1 fg is an even permutation for all f, g S n and since A n is

### Math 581 Problem Set 8 Solutions

Math 581 Problem Set 8 Solutions 1. Prove that a group G is abelian if and only if the function ϕ : G G given by ϕ(g) g 1 is a homomorphism of groups. In this case show that ϕ is an isomorphism. Proof:

### GROUPS AND THEIR REPRESENTATIONS. 1. introduction

GROUPS AND THEIR REPRESENTATIONS KAREN E. SMITH 1. introduction Representation theory is the study of the concrete ways in which abstract groups can be realized as groups of rigid transformations of R

### B Sc MATHEMATICS ABSTRACT ALGEBRA

UNIVERSITY OF CALICUT SCHOOL OF DISTANCE EDUCATION B Sc MATHEMATICS (0 Admission Onwards) V Semester Core Course ABSTRACT ALGEBRA QUESTION BANK () Which of the following defines a binary operation on Z

### Your Name MATH 435, EXAM #1

MATH 435, EXAM #1 Your Name You have 50 minutes to do this exam. No calculators! No notes! For proofs/justifications, please use complete sentences and make sure to explain any steps which are questionable.

### A. (Groups of order 8.) (a) Which of the five groups G (as specified in the question) have the following property: G has a normal subgroup N such that

MATH 402A - Solutions for the suggested problems. A. (Groups of order 8. (a Which of the five groups G (as specified in the question have the following property: G has a normal subgroup N such that N =

### ALGEBRA QUALIFYING EXAM PROBLEMS

ALGEBRA QUALIFYING EXAM PROBLEMS Kent State University Department of Mathematical Sciences Compiled and Maintained by Donald L. White Version: August 29, 2017 CONTENTS LINEAR ALGEBRA AND MODULES General

### Name: Solutions Final Exam

Instructions. Answer each of the questions on your own paper. Be sure to show your work so that partial credit can be adequately assessed. Put your name on each page of your paper. 1. [10 Points] All of

### ABSTRACT ALGEBRA: REVIEW PROBLEMS ON GROUPS AND GALOIS THEORY

ABSTRACT ALGEBRA: REVIEW PROBLEMS ON GROUPS AND GALOIS THEORY John A. Beachy Northern Illinois University 2000 ii J.A.Beachy This is a supplement to Abstract Algebra, Second Edition by John A. Beachy and

### 0 Sets and Induction. Sets

0 Sets and Induction Sets A set is an unordered collection of objects, called elements or members of the set. A set is said to contain its elements. We write a A to denote that a is an element of the set

### Modern Algebra (MA 521) Synopsis of lectures July-Nov 2015 semester, IIT Guwahati

Modern Algebra (MA 521) Synopsis of lectures July-Nov 2015 semester, IIT Guwahati Shyamashree Upadhyay Contents 1 Lecture 1 4 1.1 Properties of Integers....................... 4 1.2 Sets, relations and

### CSIR - Algebra Problems

CSIR - Algebra Problems N. Annamalai DST - INSPIRE Fellow (SRF) Department of Mathematics Bharathidasan University Tiruchirappalli -620024 E-mail: algebra.annamalai@gmail.com Website: https://annamalaimaths.wordpress.com

### MODEL ANSWERS TO THE FIFTH HOMEWORK

MODEL ANSWERS TO THE FIFTH HOMEWORK 1. Chapter 3, Section 5: 1 (a) Yes. Given a and b Z, φ(ab) = [ab] = [a][b] = φ(a)φ(b). This map is clearly surjective but not injective. Indeed the kernel is easily

### Assigment 1. 1 a b. 0 1 c A B = (A B) (B A). 3. In each case, determine whether G is a group with the given operation.

1. Show that the set G = multiplication. Assigment 1 1 a b 0 1 c a, b, c R 0 0 1 is a group under matrix 2. Let U be a set and G = {A A U}. Show that G ia an abelian group under the operation defined by

### Groups and Symmetries

Groups and Symmetries Definition: Symmetry A symmetry of a shape is a rigid motion that takes vertices to vertices, edges to edges. Note: A rigid motion preserves angles and distances. Definition: Group

### Section III.15. Factor-Group Computations and Simple Groups

III.15 Factor-Group Computations 1 Section III.15. Factor-Group Computations and Simple Groups Note. In this section, we try to extract information about a group G by considering properties of the factor

### PRACTICE FINAL MATH , MIT, SPRING 13. You have three hours. This test is closed book, closed notes, no calculators.

PRACTICE FINAL MATH 18.703, MIT, SPRING 13 You have three hours. This test is closed book, closed notes, no calculators. There are 11 problems, and the total number of points is 180. Show all your work.

### Math 210A: Algebra, Homework 5

Math 210A: Algebra, Homework 5 Ian Coley November 5, 2013 Problem 1. Prove that two elements σ and τ in S n are conjugate if and only if type σ = type τ. Suppose first that σ and τ are cycles. Suppose

### Supplementary Notes: Simple Groups and Composition Series

18.704 Supplementary Notes: Simple Groups and Composition Series Genevieve Hanlon and Rachel Lee February 23-25, 2005 Simple Groups Definition: A simple group is a group with no proper normal subgroup.

### Algebra SEP Solutions

Algebra SEP Solutions 17 July 2017 1. (January 2017 problem 1) For example: (a) G = Z/4Z, N = Z/2Z. More generally, G = Z/p n Z, N = Z/pZ, p any prime number, n 2. Also G = Z, N = nz for any n 2, since

### Definitions. Notations. Injective, Surjective and Bijective. Divides. Cartesian Product. Relations. Equivalence Relations

Page 1 Definitions Tuesday, May 8, 2018 12:23 AM Notations " " means "equals, by definition" the set of all real numbers the set of integers Denote a function from a set to a set by Denote the image of

### NOTES ON FINITE FIELDS

NOTES ON FINITE FIELDS AARON LANDESMAN CONTENTS 1. Introduction to finite fields 2 2. Definition and constructions of fields 3 2.1. The definition of a field 3 2.2. Constructing field extensions by adjoining

### Part IV. Rings and Fields

IV.18 Rings and Fields 1 Part IV. Rings and Fields Section IV.18. Rings and Fields Note. Roughly put, modern algebra deals with three types of structures: groups, rings, and fields. In this section we

### Teddy Einstein Math 4320

Teddy Einstein Math 4320 HW4 Solutions Problem 1: 2.92 An automorphism of a group G is an isomorphism G G. i. Prove that Aut G is a group under composition. Proof. Let f, g Aut G. Then f g is a bijective

### Modern Algebra I. Circle the correct answer; no explanation is required. Each problem in this section counts 5 points.

1 2 3 style total Math 415 Please print your name: Answer Key 1 True/false Circle the correct answer; no explanation is required. Each problem in this section counts 5 points. 1. Every group of order 6

### GROUP ACTIONS RYAN C. SPIELER

GROUP ACTIONS RYAN C. SPIELER Abstract. In this paper, we examine group actions. Groups, the simplest objects in Algebra, are sets with a single operation. We will begin by defining them more carefully

### 3.8 Cosets, Normal Subgroups, and Factor Groups

3.8 J.A.Beachy 1 3.8 Cosets, Normal Subgroups, and Factor Groups from A Study Guide for Beginner s by J.A.Beachy, a supplement to Abstract Algebra by Beachy / Blair 29. Define φ : C R by φ(z) = z, for

### IIT Mumbai 2015 MA 419, Basic Algebra Tutorial Sheet-1

IIT Mumbai 2015 MA 419, Basic Algebra Tutorial Sheet-1 Let Σ be the set of all symmetries of the plane Π. 1. Give examples of s, t Σ such that st ts. 2. If s, t Σ agree on three non-collinear points, then

### Groups Subgroups Normal subgroups Quotient groups Homomorphisms Cyclic groups Permutation groups Cayley s theorem Class equations Sylow theorems

Group Theory Groups Subgroups Normal subgroups Quotient groups Homomorphisms Cyclic groups Permutation groups Cayley s theorem Class equations Sylow theorems Groups Definition : A non-empty set ( G,*)

### GRE Subject test preparation Spring 2016 Topic: Abstract Algebra, Linear Algebra, Number Theory.

GRE Subject test preparation Spring 2016 Topic: Abstract Algebra, Linear Algebra, Number Theory. Linear Algebra Standard matrix manipulation to compute the kernel, intersection of subspaces, column spaces,

### Lecture Notes. Group Theory. Gunnar Traustason (Autumn 2016)

Lecture Notes in Group Theory Gunnar Traustason (Autumn 2016) 0 0 Introduction. Groups and symmetry Group Theory can be viewed as the mathematical theory that deals with symmetry, where symmetry has a

### Higher Algebra Lecture Notes

Higher Algebra Lecture Notes October 2010 Gerald Höhn Department of Mathematics Kansas State University 138 Cardwell Hall Manhattan, KS 66506-2602 USA gerald@math.ksu.edu This are the notes for my lecture

### SUMMARY ALGEBRA I LOUIS-PHILIPPE THIBAULT

SUMMARY ALGEBRA I LOUIS-PHILIPPE THIBAULT Contents 1. Group Theory 1 1.1. Basic Notions 1 1.2. Isomorphism Theorems 2 1.3. Jordan- Holder Theorem 2 1.4. Symmetric Group 3 1.5. Group action on Sets 3 1.6.

### Johns Hopkins University, Department of Mathematics Abstract Algebra - Spring 2009 Midterm

Johns Hopkins University, Department of Mathematics 110.401 Abstract Algebra - Spring 2009 Midterm Instructions: This exam has 8 pages. No calculators, books or notes allowed. You must answer the first

### Math 121 Homework 5: Notes on Selected Problems

Math 121 Homework 5: Notes on Selected Problems 12.1.2. Let M be a module over the integral domain R. (a) Assume that M has rank n and that x 1,..., x n is any maximal set of linearly independent elements

### Visual Abstract Algebra. Marcus Pivato

Visual Abstract Algebra Marcus Pivato March 25, 2003 2 Contents I Groups 1 1 Homomorphisms 3 1.1 Cosets and Coset Spaces............................... 3 1.2 Lagrange s Theorem.................................

### Exercises on chapter 1

Exercises on chapter 1 1. Let G be a group and H and K be subgroups. Let HK = {hk h H, k K}. (i) Prove that HK is a subgroup of G if and only if HK = KH. (ii) If either H or K is a normal subgroup of G

### Math 4400, Spring 08, Sample problems Final Exam.

Math 4400, Spring 08, Sample problems Final Exam. 1. Groups (1) (a) Let a be an element of a group G. Define the notions of exponent of a and period of a. (b) Suppose a has a finite period. Prove that

### Definitions, Theorems and Exercises. Abstract Algebra Math 332. Ethan D. Bloch

Definitions, Theorems and Exercises Abstract Algebra Math 332 Ethan D. Bloch December 26, 2013 ii Contents 1 Binary Operations 3 1.1 Binary Operations............................... 4 1.2 Isomorphic Binary

### Fall /29/18 Time Limit: 75 Minutes

Math 411: Abstract Algebra Fall 2018 Midterm 10/29/18 Time Limit: 75 Minutes Name (Print): Solutions JHU-ID: This exam contains 8 pages (including this cover page) and 6 problems. Check to see if any pages

### Fibers, Surjective Functions, and Quotient Groups

Fibers, Surjective Functions, and Quotient Groups 11/01/06 Radford Let f : X Y be a function. For a subset Z of X the subset f(z) = {f(z) z Z} of Y is the image of Z under f. For a subset W of Y the subset

### Groups. Chapter 1. If ab = ba for all a, b G we call the group commutative.

Chapter 1 Groups A group G is a set of objects { a, b, c, } (not necessarily countable) together with a binary operation which associates with any ordered pair of elements a, b in G a third element ab

### Math 546, Exam 2 Information.

Math 546, Exam 2 Information. 10/21/09, LC 303B, 10:10-11:00. Exam 2 will be based on: Sections 3.2, 3.3, 3.4, 3.5; The corresponding assigned homework problems (see http://www.math.sc.edu/ boylan/sccourses/546fa09/546.html)

### Reducibility of Polynomials over Finite Fields

Master Thesis Reducibility of Polynomials over Finite Fields Author: Muhammad Imran Date: 1976-06-02 Subject: Mathematics Level: Advance Course code: 5MA12E Abstract Reducibility of certain class of polynomials

### AM 106/206: Applied Algebra Madhu Sudan 1. Lecture Notes 11

AM 106/206: Applied Algebra Madhu Sudan 1 Lecture Notes 11 October 17, 2016 Reading: Gallian Chapters 9 & 10 1 Normal Subgroups Motivation: Recall that the cosets of nz in Z (a+nz) are the same as the

### 1 Fields and vector spaces

1 Fields and vector spaces In this section we revise some algebraic preliminaries and establish notation. 1.1 Division rings and fields A division ring, or skew field, is a structure F with two binary

### Algebra I. Randall R. Holmes Auburn University

Algebra I Randall R. Holmes Auburn University Copyright c 2008 by Randall R. Holmes Last revision: June 8, 2009 Contents 0 Introduction 2 1 Definition of group and examples 4 1.1 Definition.............................

### Mathematics for Cryptography

Mathematics for Cryptography Douglas R. Stinson David R. Cheriton School of Computer Science University of Waterloo Waterloo, Ontario, N2L 3G1, Canada March 15, 2016 1 Groups and Modular Arithmetic 1.1

### Ideals, congruence modulo ideal, factor rings

Ideals, congruence modulo ideal, factor rings Sergei Silvestrov Spring term 2011, Lecture 6 Contents of the lecture Homomorphisms of rings Ideals Factor rings Typeset by FoilTEX Congruence in F[x] and

### 2. Groups 2.1. Groups and monoids. Let s start out with the basic definitions. We will consider sets with binary operations, which we will usually

2. Groups 2.1. Groups and monoids. Let s start out with the basic definitions. We will consider sets with binary operations, which we will usually write multiplicatively, as a b, or, more commonly, just

### Elements of solution for Homework 5

Elements of solution for Homework 5 General remarks How to use the First Isomorphism Theorem A standard way to prove statements of the form G/H is isomorphic to Γ is to construct a homomorphism ϕ : G Γ

### DIHEDRAL GROUPS II KEITH CONRAD

DIHEDRAL GROUPS II KEITH CONRAD We will characterize dihedral groups in terms of generators and relations, and describe the subgroups of D n, including the normal subgroups. We will also introduce an infinite

### MATH 1530 ABSTRACT ALGEBRA Selected solutions to problems. a + b = a + b,

MATH 1530 ABSTRACT ALGEBRA Selected solutions to problems Problem Set 2 2. Define a relation on R given by a b if a b Z. (a) Prove that is an equivalence relation. (b) Let R/Z denote the set of equivalence

### SF2729 GROUPS AND RINGS LECTURE NOTES

SF2729 GROUPS AND RINGS LECTURE NOTES 2011-03-01 MATS BOIJ 6. THE SIXTH LECTURE - GROUP ACTIONS In the sixth lecture we study what happens when groups acts on sets. 1 Recall that we have already when looking

### Group Theory. Hwan Yup Jung. Department of Mathematics Education, Chungbuk National University

Group Theory Hwan Yup Jung Department of Mathematics Education, Chungbuk National University Hwan Yup Jung (CBNU) Group Theory March 1, 2013 1 / 111 Groups Definition A group is a set G with a binary operation

### Lecture 3. Theorem 1: D 6

Lecture 3 This week we have a longer section on homomorphisms and isomorphisms and start formally working with subgroups even though we have been using them in Chapter 1. First, let s finish what was claimed

### Math 581 Problem Set 9

Math 581 Prolem Set 9 1. Let m and n e relatively prime positive integers. (a) Prove that Z/mnZ = Z/mZ Z/nZ as RINGS. (Hint: First Isomorphism Theorem) Proof: Define ϕz Z/mZ Z/nZ y ϕ(x) = ([x] m, [x] n

### Group Theory

Group Theory 2014 2015 Solutions to the exam of 4 November 2014 13 November 2014 Question 1 (a) For every number n in the set {1, 2,..., 2013} there is exactly one transposition (n n + 1) in σ, so σ is

### 1 Rings 1 RINGS 1. Theorem 1.1 (Substitution Principle). Let ϕ : R R be a ring homomorphism

1 RINGS 1 1 Rings Theorem 1.1 (Substitution Principle). Let ϕ : R R be a ring homomorphism (a) Given an element α R there is a unique homomorphism Φ : R[x] R which agrees with the map ϕ on constant polynomials

### ABSTRACT ALGEBRA MODULUS SPRING 2006 by Jutta Hausen, University of Houston

ABSTRACT ALGEBRA MODULUS SPRING 2006 by Jutta Hausen, University of Houston Undergraduate abstract algebra is usually focused on three topics: Group Theory, Ring Theory, and Field Theory. Of the myriad

### Name: Solutions - AI FINAL EXAM

1 2 3 4 5 6 7 8 9 10 11 12 13 total Name: Solutions - AI FINAL EXAM The first 7 problems will each count 10 points. The best 3 of # 8-13 will count 10 points each. Total is 100 points. A 4th problem from