DOCSLIB.ORG

GROUP THEORY – 3 (CYCLIC GROUPS – LAGRANGE's THEOREM) SOME DEFINITIONS, THEOREMS and SOME PROPERTIES: Definition: a Group

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
GROUP THEORY – 3 (CYCLIC GROUPS – LAGRANGE's THEOREM) SOME DEFINITIONS, THEOREMS and SOME PROPERTIES: Definition: a Group GROUP THEORY – 3 (CYCLIC GROUPS – LAGRANGE’S THEOREM) SOME DEFINITIONS, THEOREMS AND SOME PROPERTIES: Definition: A group G is said to be a cyclic group if G can be written as G = {an: n }. In additive notation a cyclic group G is written as {na: n }. This a is called a generator of the group. Definition: Let G be a group and H be a subgroup of G. For any element aG we define a left coset aH (right coset Ha) of H in G by aH = {ah: h H}, (Ha = {ha : h H}). Theorem 1: Every subgroup of a cyclic group is cyclic. Theorem 2: A group of prime order is cyclic. Theorem 3: If a is a generator of a cyclic group G, then a-1 is also a generator of G. Theorem 4: Every cyclic group is abelian. Theorem 5: Let G be a cyclic group generated by a. Then o(G) = n if and only if o(a) = n. Theorem 6: Let G be a cyclic group generated by a. Then g is infinite if and only if o(a) is infinite. Theorem 7: A finite group G of order n is cyclic if and only if there is some element b in G of order n such that o(b) = n. Theorem 8: Let G be a group of order n generated by a, then ar is also a generator of G if and only if r is less than n and prime to n. Corollary: A finite cyclic group G of order n has φ(n) generators. Theorem 9: Every non-trivial subgroup of an infinite cyclic group is infinite. Theorem 10: A finite cyclic group G of order n has a subgroup of order d for each divisor d of n. Theorem 11: Let H be a subgroup of a group G, then hH = H if and only if h H. Theorem 12: Let H be a subgroup of a group G, then any two left cosets of H in G are either disjoint or identical. Theorem 13: Let H be a subgroup of a group G and a,b G, then the left cosets aH and bH are identical if and only if a-1b H. Theorem 14: Let G be a group and H be a subgroup of G, then any two left cosets of H in G have the same cardinality. Theorem (Lagrange)15: The order of any subgroup of a finite group G divides the order of the group G. 1. G is a nontrivial group with no nontrivial proper subgroup. Show that G is a group of prime order . SOLUTION: Let G be a non-trivial group with identity element e. Let a be a non-identity element of G. Let us consider the cyclic subgroup H generated by a, i.e H = <a>. Since the group G has no proper subgroup so G = H. If G is an infinite cyclic group generated by a then <a2> is a cyclic subgroup generated by a2 and it is proper. So G can not be infinite. Therefore G is a finite group. Let G be a group of order n . If n is composite then n = pq for some integers p and q. G = <a> and o(G) = pq so o(a) = pq and hence o(ap) =q, i.e order of the cyclic group <ap> is q and it is also a proper subgroup of G. Hence G can not be a group of composite order. Therefore G is a group of prime order. 2. If an abelian group G of order 10 contains a subgroup of order 5, then show that G must be cyclic. SOLUTION: Let G be a group of order 10 containing a subgroup H of order 5. Since H is a group of prime order so H is cyclic. H = <a> . So o(a) = 5. If all elements are of order 5, then the group K = <b> where b G-H is also cyclic and is of order 5. Then HKis a subgroup of H as well as of K. So by Lagrange’s Theorem o( ) is a divisor of o(H) as well as of o(K) . If o( ) = 5, then =H =K. So o( ) = 1. Hence o(HK) = o(H)o(K)/o( ) = 5.5/1 = 25 but HK is a subgroup of G and o(G) = 10. Therefore each element of G- H is of order 2. Let b G-H. So o(b) = 2. Since G is commutative and gcd(2,5) = 1 so o(ab) = o(a)o(b) = 2.5 =10. Hence G is cyclic. 3. If G be a group of order pq where p,q are distinct primes, show that every proper subgroup of G is cyclic. SOLUTION: Same as problem no. 2. 4. Prove that all the proper subgroups of a group G of order 8 are commutative. SOLUTION: The orders of subgroups of a group G of order 8 are divisors of 8, i.e 1,2,4,8. So the orders of proper subgroups of G are 1,2,4. If H be a subgroup of order 1, then the group is obviously commutative. If H is of order 2 then H is a group of prime order hence H is cyclic, so H is commutative. If H is of order 4, then each non- identity element of H is of order 2 or 4, (divisors of 4). If there exists an element a of order 4 then H is cyclic and hence H is commutative. If each non-identity element is of order 2 then for any two elements a and b, o(a) = o(b) = o(ab) = 2, i.e a2 = b2 =(ab)2= e, where e is the identity element of G. So a = a-1, b = b-1 , (ab) = (ab)-1 = b-1a-1 = ba, i.e ab = ba. So H is commutative. Hence each proper subgroup of G is commutative. 5. G is a non-commutative group of order 10. Show that G must have a subgroup of order 5. SOLUTION: Let G be a non-commutative group of order 10. The order of each element of G is a divisor of 10 i.e 1,2,5 or 10. If there is some element of order 10 , then the group is cyclic and hence commutative but the group is non-commutative, a contradiction arises. So there is no element of order 10. If each non-identity element is of order 2, then a2 = e for all aG where e is the identity element of G. a2 = eaa1 for all aG . Then ab = (ab)-1 = b-1a-1 = ba, i.e G is commutative. Again we have arrived at a contradiction. So each non-identity element of G is not of order 2. Hence there is some element of order 5 and a subgroup of order 5. 6. G is a group of order 27. Prove that G must have a subgroup of order 3. SOLUTION: Let G be a group of order 27. The orders of elements of G are the divisors of order of G, i.e 1,3,9,27. If G contains an element of order 27, then the group is cyclic. Let G be generated by a and o(a) = 27, i.e o(a9) = 3. So the group <a9> is a subgroup of order 3. If there is some element b of order 9, then o(b3) = 3 and the subgroup <b3> is a subgroup of order 3. If there is some element c of order 3 then the group <c> is a subgroup of order 3. So in any case G contains a subgroup of order 3. 7. G is a non-abelian group of order 8. Prove that G must have an element of order 4. SOLUTION: Left as an exercise. 8. Let G be a nonabelian group of order 2p , p odd prime. Find the number of elements of order p. SOLUTION: Left as an exercise. .
Load more

Recommended publications
  • Classification of Finite Abelian Groups
    Math 317 C1 John Sullivan Spring 2003 Classification of Finite Abelian Groups (Notes based on an article by Navarro in the Amer. Math. Monthly, February 2003.) The fundamental theorem of finite abelian groups expresses any such group as a product of cyclic groups: Theorem. Suppose G is a finite abelian group. Then G is (in a unique way) a direct product of cyclic groups of order pk with p prime. Our first step will be a special case of Cauchy’s Theorem, which we will prove later for arbitrary groups: whenever p |G| then G has an element of order p. Theorem (Cauchy). If G is a finite group, and p |G| is a prime, then G has an element of order p (or, equivalently, a subgroup of order p). ∼ Proof when G is abelian. First note that if |G| is prime, then G = Zp and we are done. In general, we work by induction. If G has no nontrivial proper subgroups, it must be a prime cyclic group, the case we’ve already handled. So we can suppose there is a nontrivial subgroup H smaller than G. Either p |H| or p |G/H|. In the first case, by induction, H has an element of order p which is also order p in G so we’re done. In the second case, if ∼ g + H has order p in G/H then |g + H| |g|, so hgi = Zkp for some k, and then kg ∈ G has order p. Note that we write our abelian groups additively. Definition. Given a prime p, a p-group is a group in which every element has order pk for some k.
    [Show full text]
  • The General Linear Group
    18.704 Gabe Cunningham 2/18/05 [email protected] The General Linear Group Definition: Let F be a field. Then the general linear group GLn(F ) is the group of invert- ible n × n matrices with entries in F under matrix multiplication. It is easy to see that GLn(F ) is, in fact, a group: matrix multiplication is associative; the identity element is In, the n × n matrix with 1’s along the main diagonal and 0’s everywhere else; and the matrices are invertible by choice. It’s not immediately clear whether GLn(F ) has infinitely many elements when F does. However, such is the case. Let a ∈ F , a 6= 0. −1 Then a · In is an invertible n × n matrix with inverse a · In. In fact, the set of all such × matrices forms a subgroup of GLn(F ) that is isomorphic to F = F \{0}. It is clear that if F is a finite field, then GLn(F ) has only finitely many elements. An interesting question to ask is how many elements it has. Before addressing that question fully, let’s look at some examples. ∼ × Example 1: Let n = 1. Then GLn(Fq) = Fq , which has q − 1 elements. a b Example 2: Let n = 2; let M = ( c d ). Then for M to be invertible, it is necessary and sufficient that ad 6= bc. If a, b, c, and d are all nonzero, then we can fix a, b, and c arbitrarily, and d can be anything but a−1bc. This gives us (q − 1)3(q − 2) matrices.
    [Show full text]
  • Orders on Computable Torsion-Free Abelian Groups
    Orders on Computable Torsion-Free Abelian Groups Asher M. Kach (Joint Work with Karen Lange and Reed Solomon) University of Chicago 12th Asian Logic Conference Victoria University of Wellington December 2011 Asher M. Kach (U of C) Orders on Computable TFAGs ALC 2011 1 / 24 Outline 1 Classical Algebra Background 2 Computing a Basis 3 Computing an Order With A Basis Without A Basis 4 Open Questions Asher M. Kach (U of C) Orders on Computable TFAGs ALC 2011 2 / 24 Torsion-Free Abelian Groups Remark Disclaimer: Hereout, the word group will always refer to a countable torsion-free abelian group. The words computable group will always refer to a (fixed) computable presentation. Definition A group G = (G : +; 0) is torsion-free if non-zero multiples of non-zero elements are non-zero, i.e., if (8x 2 G)(8n 2 !)[x 6= 0 ^ n 6= 0 =) nx 6= 0] : Asher M. Kach (U of C) Orders on Computable TFAGs ALC 2011 3 / 24 Rank Theorem A countable abelian group is torsion-free if and only if it is a subgroup ! of Q . Definition The rank of a countable torsion-free abelian group G is the least κ cardinal κ such that G is a subgroup of Q . Asher M. Kach (U of C) Orders on Computable TFAGs ALC 2011 4 / 24 Example The subgroup H of Q ⊕ Q (viewed as having generators b1 and b2) b1+b2 generated by b1, b2, and 2 b1+b2 So elements of H look like β1b1 + β2b2 + α 2 for β1; β2; α 2 Z.
    [Show full text]
  • The Classical Groups and Domains 1. the Disk, Upper Half-Plane, SL 2(R
    (June 8, 2018) The Classical Groups and Domains Paul Garrett [email protected] http:=/www.math.umn.edu/egarrett/ The complex unit disk D = fz 2 C : jzj < 1g has four families of generalizations to bounded open subsets in Cn with groups acting transitively upon them. Such domains, defined more precisely below, are bounded symmetric domains. First, we recall some standard facts about the unit disk, the upper half-plane, the ambient complex projective line, and corresponding groups acting by linear fractional (M¨obius)transformations. Happily, many of the higher- dimensional bounded symmetric domains behave in a manner that is a simple extension of this simplest case. 1. The disk, upper half-plane, SL2(R), and U(1; 1) 2. Classical groups over C and over R 3. The four families of self-adjoint cones 4. The four families of classical domains 5. Harish-Chandra's and Borel's realization of domains 1. The disk, upper half-plane, SL2(R), and U(1; 1) The group a b GL ( ) = f : a; b; c; d 2 ; ad − bc 6= 0g 2 C c d C acts on the extended complex plane C [ 1 by linear fractional transformations a b az + b (z) = c d cz + d with the traditional natural convention about arithmetic with 1. But we can be more precise, in a form helpful for higher-dimensional cases: introduce homogeneous coordinates for the complex projective line P1, by defining P1 to be a set of cosets u 1 = f : not both u; v are 0g= × = 2 − f0g = × P v C C C where C× acts by scalar multiplication.
    [Show full text]
  • Semigroups and Monoids 
    S Luis Alonso-Ovalle // Contents Subgroups Semigroups and monoids Subgroups Groups. A group G is an algebra consisting of a set G and a single binary operation ◦ satisfying the following axioms: . ◦ is completely defined and G is closed under ◦. ◦ is associative. G contains an identity element. Each element in G has an inverse element. Subgroups. We define a subgroup G0 as a subalgebra of G which is itself a group. Examples: . The group of even integers with addition is a proper subgroup of the group of all integers with addition. The group of all rotations of the square h{I, R, R0, R00}, ◦i, where ◦ is the composition of the operations is a subgroup of the group of all symmetries of the square. Some non-subgroups: SEMIGROUPS AND MONOIDS . The system h{I, R, R0}, ◦i is not a subgroup (and not even a subalgebra) of the original group. Why? (Hint: ◦ closure). The set of all non-negative integers with addition is a subalgebra of the group of all integers with addition, because the non-negative integers are closed under addition. But it is not a subgroup because it is not itself a group: it is associative and has a zero, but . does any member (except for ) have an inverse? Order. The order of any group G is the number of members in the set G. The order of any subgroup exactly divides the order of the parental group. E.g.: only subgroups of order , , and are possible for a -member group. (The theorem does not guarantee that every subset having the proper number of members will give rise to a subgroup.
    [Show full text]
  • 1.6 Cyclic Subgroups
    1.6. CYCLIC SUBGROUPS 19 1.6 Cyclic Subgroups Recall: cyclic subgroup, cyclic group, generator. Def 1.68. Let G be a group and a ∈ G. If the cyclic subgroup hai is finite, then the order of a is |hai|. Otherwise, a is of infinite order. 1.6.1 Elementary Properties Thm 1.69. Every cyclic group is abelian. Thm 1.70. If m ∈ Z+ and n ∈ Z, then there exist unique q, r ∈ Z such that n = mq + r and 0 ≤ r ≤ m. n In fact, q = b m c and r = n − mq. Here bxc denotes the maximal integer no more than x. Ex 1.71 (Ex 6.4, Ex 6.5, p60). 1. Find the quotient q and the remainder r when n = 38 is divided by m = 7. 2. Find the quotient q and the remainder r when n = −38 is divided by m = 7. Thm 1.72 (Important). A subgroup of a cyclic group is cyclic. Proof. (refer to the book) Ex 1.73. The subgroups of hZ, +i are precisely hnZ, +i for n ∈ Z. Def 1.74. Let r, s ∈ Z. The greatest common divisor (gcd) of r and s is the largest positive integer d that divides both r and s. Written as d = gcd(r, s). In fact, d is the positive generator of the following cyclic subgroup of Z: hdi = {nr + ms | n, m ∈ Z}. So d is the smallest positive integer that can be written as nr + ms for some n, m ∈ Z. Ex 1.75. gcd(36, 63) = 9, gcd(36, 49) = 1.
    [Show full text]
  • And Free Cyclic Group Actions on Homotopy Spheres
    TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 220, 1976 DECOMPOSABILITYOF HOMOTOPYLENS SPACES ANDFREE CYCLICGROUP ACTIONS ON HOMOTOPYSPHERES BY KAI WANG ABSTRACT. Let p be a linear Zn action on C and let p also denote the induced Z„ action on S2p~l x D2q, D2p x S2q~l and S2p~l x S2q~l " 1m_1 where p = [m/2] and q = m —p. A free differentiable Zn action (£ , ju) on a homotopy sphere is p-decomposable if there is an equivariant diffeomor- phism <t>of (S2p~l x S2q~l, p) such that (S2m_1, ju) is equivalent to (£(*), ¿(*)) where S(*) = S2p_1 x D2q U^, D2p x S2q~l and A(<P) is a uniquely determined action on S(*) such that i4(*)IS p~l XD q = p and A(Q)\D p X S = p. A homotopy lens space is p-decomposable if it is the orbit space of a p-decomposable free Zn action on a homotopy sphere. In this paper, we will study the decomposabilities of homotopy lens spaces. We will also prove that for each lens space L , there exist infinitely many inequivalent free Zn actions on S m such that the orbit spaces are simple homotopy equiva- lent to L 0. Introduction. Let A be the antipodal map and let $ be an equivariant diffeomorphism of (Sp x Sp, A) where A(x, y) = (-x, -y). Then there is a uniquely determined free involution A($) on 2(4>) where 2(4») = Sp x Dp+1 U<¡,Dp+l x Sp such that the inclusions S" x Dp+l —+ 2(d>), Dp+1 x Sp —*■2(4>) are equi- variant.
    [Show full text]
  • Countable Torsion-Free Abelian Groups
    COUNTABLE TORSION-FREE ABELIAN GROUPS By M. O'N. CAMPBELL [Received 27 January 1959.—Read 19 February 1959] Introduction IN this paper we present a new classification of the countable torsion-free abelian groups. Since any abelian group 0 may be regarded as an extension of a periodic group (namely the torsion part of G) by a torsion-free group, and since there exists the well-known complete classification of the count- able periodic abelian groups due to Ulm, it is clear that the classification problem studied here is of great interest. By a group we shall always mean an abelian group, and the additive notation will be employed throughout. It is well known that all the maximal linearly independent sets of elements of a given group are car- dinally equivalent; the corresponding cardinal number is the rank of the group. Derry (2) and Mal'cev (4) have studied the torsion-free groups of finite rank only, and have given classifications of these groups in terms of certain equivalence classes of systems of matrices with £>-adic elements. Szekeres (5) attempted to abolish the finiteness restriction on rank; he extracted certain invariants, but did not derive a complete classification. By a basis of a torsion-free group 0 we mean any maximal linearly independent subset of G. A subgroup generated by a basis of G will be called a basal subgroup or described as basal in G. Thus U is a basal sub- group of G if and only if (i) U is free abelian, and (ii) the factor group G/U is periodic.
    [Show full text]
  • A STUDY on the ALGEBRAIC STRUCTURE of SL 2(Zpz)
    A STUDY ON THE ALGEBRAIC STRUCTURE OF SL2 Z pZ ( ~ ) A Thesis Presented to The Honors Tutorial College Ohio University In Partial Fulfillment of the Requirements for Graduation from the Honors Tutorial College with the degree of Bachelor of Science in Mathematics by Evan North April 2015 Contents 1 Introduction 1 2 Background 5 2.1 Group Theory . 5 2.2 Linear Algebra . 14 2.3 Matrix Group SL2 R Over a Ring . 22 ( ) 3 Conjugacy Classes of Matrix Groups 26 3.1 Order of the Matrix Groups . 26 3.2 Conjugacy Classes of GL2 Fp ....................... 28 3.2.1 Linear Case . .( . .) . 29 3.2.2 First Quadratic Case . 29 3.2.3 Second Quadratic Case . 30 3.2.4 Third Quadratic Case . 31 3.2.5 Classes in SL2 Fp ......................... 33 3.3 Splitting of Classes of(SL)2 Fp ....................... 35 3.4 Results of SL2 Fp ..............................( ) 40 ( ) 2 4 Toward Lifting to SL2 Z p Z 41 4.1 Reduction mod p ...............................( ~ ) 42 4.2 Exploring the Kernel . 43 i 4.3 Generalizing to SL2 Z p Z ........................ 46 ( ~ ) 5 Closing Remarks 48 5.1 Future Work . 48 5.2 Conclusion . 48 1 Introduction Symmetries are one of the most widely-known examples of pure mathematics. Symmetry is when an object can be rotated, flipped, or otherwise transformed in such a way that its appearance remains the same. Basic geometric figures should create familiar examples, take for instance the triangle. Figure 1: The symmetries of a triangle: 3 reflections, 2 rotations. The red lines represent the reflection symmetries, where the trianlge is flipped over, while the arrows represent the rotational symmetry of the triangle.
    [Show full text]
  • 17 Lagrange's Theorem
    Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan 17 Lagrange's Theorem A very important corollary to the fact that the left cosets of a subgroup partition a group is Lagrange's Theorem. This theorem gives a relationship between the order of a finite group G and the order of any subgroup of G(in particular, if jGj < 1 and H ⊆ G is a subgroup, then jHj j jGj). Theorem 17.1 (Lagrange's Theorem) Let G be a finite group, and let H be a subgroup of G: Then the order of H divides the order of G: Proof. By Theorem 16.1, the right cosets of H form a partition of G: Thus, each element of G belongs to at least one right coset of H in G; and no element can belong to two distinct right cosets of H in G: Therefore every element of G belongs to exactly one right coset of H. Moreover, each right coset of H contains jHj elements (Lemma 16.2). Therefore, jGj = njHj; where n is the number of right cosets of H in G: Hence, jHj j jGj: This ends a proof of the theorem. Example 17.1 If jGj = 14 then the only possible orders for a subgroup are 1, 2, 7, and 14. Definition 17.1 The number of different right cosets of H in G is called the index of H in G and is denoted by [G : H]: It follows from the above definition and the proof of Lagrange's theorem that jGj = [G : H]jHj: Example 17.2 6 Since jS3j = 3! = 6 and j(12)j = j < (12) > j = 2 then [S3; < (12) >] = 2 = 3: 1 The rest of this section is devoted to consequences of Lagrange's theorem; we begin with the order of an element.
    [Show full text]
  • Order (Group Theory) 1 Order (Group Theory)
    Order (group theory) 1 Order (group theory) In group theory, a branch of mathematics, the term order is used in two closely-related senses: • The order of a group is its cardinality, i.e., the number of its elements. • The order, sometimes period, of an element a of a group is the smallest positive integer m such that am = e (where e denotes the identity element of the group, and am denotes the product of m copies of a). If no such m exists, a is said to have infinite order. All elements of finite groups have finite order. The order of a group G is denoted by ord(G) or |G| and the order of an element a by ord(a) or |a|. Example Example. The symmetric group S has the following multiplication table. 3 • e s t u v w e e s t u v w s s e v w t u t t u e s w v u u t w v e s v v w s e u t w w v u t s e This group has six elements, so ord(S ) = 6. By definition, the order of the identity, e, is 1. Each of s, t, and w 3 squares to e, so these group elements have order 2. Completing the enumeration, both u and v have order 3, for u2 = v and u3 = vu = e, and v2 = u and v3 = uv = e. Order and structure The order of a group and that of an element tend to speak about the structure of the group.
    [Show full text]
  • (Order of a Group). the Number of Elements of a Group (finite Or Infinite) Is Called Its Order
    CHAPTER 3 Finite Groups; Subgroups Definition (Order of a Group). The number of elements of a group (finite or infinite) is called its order. We denote the order of G by G . | | Definition (Order of an Element). The order of an element g in a group G is the smallest positive integer n such that gn = e (ng = 0 in additive notation). If no such integer exists, we say g has infinite order. The order of g is denoted by g . | | Example. U(18) = 1, 5, 7, 11, 13, 17 , so U(18) = 6. Also, { } | | 51 = 5, 52 = 7, 53 = 17, 54 = 13, 55 = 11, 56 = 1, so 5 = 6. | | Example. Z12 = 12 under addition modulo n. | | 1 4 = 4, 2 4 = 8, 3 4 = 0, · · · so 4 = 3. | | 36 3. FINITE GROUPS; SUBGROUPS 37 Problem (Page 69 # 20). Let G be a group, x G. If x2 = e and x6 = e, prove (1) x4 = e and (2) x5 = e. What can we say 2about x ? 6 Proof. 6 6 | | (1) Suppose x4 = e. Then x8 = e = x2x6 = e = x2e = e = x2 = e, ) ) ) a contradiction, so x4 = e. 6 (2) Suppose x5 = e. Then x10 = e = x4x6 = e = x4e = e = x4 = e, ) ) ) a contradiction, so x5 = e. 6 Therefore, x = 3 or x = 6. | | | | ⇤ Definition (Subgroup). If a subset H of a group G is itself a group under the operation of G, we say that H is a subgroup of G, denoted H G. If H is a proper subset of G, then H is a proper subgroup of G.
    [Show full text]