DOCSLIB.ORG

(Order of a Group). the Number of Elements of a Group (finite Or Infinite) Is Called Its Order

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read 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. e is the trivial subgroup of G. If H = e and H G, H is called nontrivial. { } 6 { } Theorem (3.1 — One-Step Subgroup Test). Let G be a group and = 1 ; 6 H G. Then H is a subgroup of G if a, b H = ab− H (for additive notation,✓ a b H). 2 ) 2 Proof. − 2 Associativity of H derives from that of G. 1 [To show e H.] H = , so x H. Then xx− = e H by hypothesis. 2 6 ; 9 2 2 1 1 1 [To show x− H.] Also, ex− = x− H by hypothesis. 2 2 1 [To show H is closed.] Suppose x, y H. Then y− H and, by hypothesis, 1 1 2 2 xy = x(y− )− H. 2 Thus H G. ⇤ 38 3. FINITE GROUPS; SUBGROUPS Problem (Page 74 # 73). Let 2 2 H = a + bi a, b R, a + b = 1 . { | 2 } This is the set of points on the unit circle in the complex plane. Then H C⇤ under complex multiplication. Proof. 1 = 1 + 0i H since 12 + 02 = 1. 2 Suppose a + bi, c + di H. Then a2 + b2 = 1 and c2 + d2 = 1. 2 1 a + bi (a + bi)(c di) (a + bi)(c + di)− = = − = c + di (c + di)(c di) − ac + bd + bci adi − = (ac + bd) + (bc ad)i c2 + d2 − and (ac + bd)2 + (bc ad)2 = a2c2 + 2abcd + b2d2 + b2c2 2abcd + a2d2 = − − a2c2 + a2d2 + b2c2 + b2d2 = a2(c2 + d2) + b2(c2 + d2) = (a2 + b2)(c2 + d2) = 1 + 1 = 1, 1 so (a + bi)(c + di)− H. Thus H C⇤. 2 ⇤ Theorem (3.2 — Two-Step Subgroup Test). Let G be a group and = H G. Then H G if ; 6 ✓ (1) a, b H = ab H (closed under multiplication); 2 ) 2 1 (2) a H = a− H (closed under inverses). 2 ) 2 Proof. 1 1 Suppose a, b H. Then b− H by (2). By (1), ab− H, so H G by 2 2 2 Theorem 3.1. ⇤ 3. FINITE GROUPS; SUBGROUPS 39 Example. R360/n Dn. Proof. h i R360/n = R0, R360 , R2 360 , , R(n 1)360 h i n ·n · · · −n where Ri + Rj = R(i+j) mod 360n . o a 360 b 360 Let R , R R and suppose i = · and j = · . i j 2 h 360/ni n n Now a + b = qn + r, 0 r < n, so (a + b)360 (qn + r)360 r 360 i + j = = = q 360 + · . n n · n Then r 360 (i + j) mod 360 = · , 0 r < n, n so R mod 360 R . i+j 2 h 360/ni a 360 Now suppose R R , i = · . i 2 h 360/ni n a 360 n 360 a 360 (n a)360 360 i = 360 · = · − · = − , − − n n n so R360 i R360/n . Since − 2 h i Ri + R360 i = R360 mod 360 = R0 and R360 i + Ri = R360 mod 360 = R0, − − 1 R360 i = Ri− . Thus, by the Two-Step Subgroup Test, R360/n Dn. ⇤ − h i 40 3. FINITE GROUPS; SUBGROUPS Theorem (3.3 — Finite Subgroup Test). Let H be a finite nonempty subset of a group G. If H is closed under the operation of G, then H is a subgroup of G. Proof. 1 In view of Theorem 3.2, we need only show that a− H whenever a H. 2 2 1 If a = e, then a− = a, and we are done. So suppose a = e. 6 Consider the sequence a, a2, . By closure, each of these elements are in H. Since H is finite, not all of these elements are distinct. Suppose ai = aj, i > j. i j Then a − = e, and since a = e, i j > 1. Thus, 6 − i j 1 i j i j 1 1 aa − − = a − = e, so a − − = a− . i j 1 But i j 1 1, so a − − H and we are done. − − ≥ 2 ⇤ Suppose H G. To show H G, show any of the following: ✓ 6 (1) The identity is not in H. (2) an element of H whose inverse is not in H. 9 (3) two elements of H whose product is not in H. 9 Notation. Let G be a group, a G, and let 2 n a = a n Z . h i { | 2 } Note a0 = e. Theorem (3.4 — a is a Subgroup). h i Let G be a group and a G. Then a G. Proof. 2 h i Since a a , a = . Let an, am a . Then 2 h i h i 6 ; 2 h i n m 1 n m n m a (a )− = a a− = a − a , 2 h i so by Theorem 3.1, a G. h i ⇤ 3. FINITE GROUPS; SUBGROUPS 41 Example. In U(14), find 9 . h i 91 = 9, 92 = 81 = 11 mod 14, 93 = 99 = 1 mod 14. 1 1 Thus 9 = 1, 9, 11 with 9− = 11 and 11− = 9. h i { } Example. In D , R = R , R , R , R D . 4 h 270i { 0 90 180 270} 4 R270 + R270 = R180, R180 + R270 = R90, R90 + R270 = R0. Example. In Z15, 3 = 3, 6, 9, 12, 0 Z15. h i { } Recall here that an is na since the operation is addition modulo n. Definition (Center of a Group). The center, Z(G), lof a group G is the subset of elements of G that commute with every element of G: Z(G) = a G ax = xa x G . { 2 | 8 2 } Theorem (3.5 — Center is a Subgroup). Z(G) G. Proof. e Z(G), so Z(G) = . Suppose a, b Z(G). Then 2 6 ; 2 (ab)x = a(bx) = a(xb) = (ax)b = (xa)b = x(ab) x G, 8 2 so ab Z(G). 2 Now suppose a Z(G). Then ax = xa x G, so 2 8 2 1 1 1 1 1 1 1 1 a− (ax)a− = a− (xa)a− = (a− a)xa− = a− x(aa− ) = ) ) 1 1 1 1 exa− = a− xe = xa− = a− x. ) 1 Thus a− Z(G), and so Z(G) G by Theorem 3.2. 2 ⇤ 42 3. FINITE GROUPS; SUBGROUPS Problem (Page 75 # 79c). Let G = GL(2, R). Find Z(G). Solution. a b Suppose Z(G). Then c d 2 a b e f e f a b e f = GL(2, R) = c d g h g h c d 8 g h 2 ) ae + bg af + bh ae + cf be + df = e, f, g, h R eh fg = 0. ce + dg cf + dh ag + ch bg + dh 8 2 −3− − 6 Now ae + bg = ae + cf = bg = cf. ) For e = f = g = 1 and h = 0, eh fg = 1 = b = c. − − ) For e = g = h = 1 and f = 0, eh fg = 1 = b = 0 = c = 0. − ) ) Also, for e = h = 0 and f = g = 1, af + bh = be + df = af = df = a = d. ) ) a 0 Thus Z(G) = a = 0 . 0 a 6 ⇤ ⇢ Definition (Centralizer of a in G). Let a G, G a group. The centralizer of a in G is the set of all elements in G that comm2 ute with a: C(a) = g G ga = ag . { 2 | } Example. In D4, C(R ) = R , R , R , R = C(R ). 90 { 0 90 180 270} 270 C(R0) = D4 = C(R180). C(H) = R , H, R , V = C(V ). { 0 180 } C(D) = R , D, R , D0 = C(D0). { 0 180 } Thus Z(D ) = R , R . 4 { 0 180} 3. FINITE GROUPS; SUBGROUPS 43 Theorem (3.6 — C(a) is a Subgroup). For each a in a group G, C(a) G. Proof. Will be assigned as homework (Page 72 # 41). Similar to the proof of Theorem 3.5. ⇤ 1 1 Problem (Page 75 # 79a). Let G = GL(2, ). Find C . R 1 0 Solution. ✓ ◆ a b 1 1 Let C . Then c d 2 1 0 ✓ ◆ 1 1 a b a b 1 1 a + c b + d a + b a = = = = 1 0 c d c d 1 0 ) a b c + d c ) b = c and a = b + d = d = a b.
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]
  • Unitary Group - Wikipedia
    Unitary group - Wikipedia https://en.wikipedia.org/wiki/Unitary_group Unitary group In mathematics, the unitary group of degree n, denoted U( n), is the group of n × n unitary matrices, with the group operation of matrix multiplication. The unitary group is a subgroup of the general linear group GL( n, C). Hyperorthogonal group is an archaic name for the unitary group, especially over finite fields. For the group of unitary matrices with determinant 1, see Special unitary group. In the simple case n = 1, the group U(1) corresponds to the circle group, consisting of all complex numbers with absolute value 1 under multiplication. All the unitary groups contain copies of this group. The unitary group U( n) is a real Lie group of dimension n2. The Lie algebra of U( n) consists of n × n skew-Hermitian matrices, with the Lie bracket given by the commutator. The general unitary group (also called the group of unitary similitudes ) consists of all matrices A such that A∗A is a nonzero multiple of the identity matrix, and is just the product of the unitary group with the group of all positive multiples of the identity matrix. Contents Properties Topology Related groups 2-out-of-3 property Special unitary and projective unitary groups G-structure: almost Hermitian Generalizations Indefinite forms Finite fields Degree-2 separable algebras Algebraic groups Unitary group of a quadratic module Polynomial invariants Classifying space See also Notes References Properties Since the determinant of a unitary matrix is a complex number with norm 1, the determinant gives a group 1 of 7 2/23/2018, 10:13 AM Unitary group - Wikipedia https://en.wikipedia.org/wiki/Unitary_group homomorphism The kernel of this homomorphism is the set of unitary matrices with determinant 1.
    [Show full text]
  • Janko's Sporadic Simple Groups
    Janko’s Sporadic Simple Groups: a bit of history Algebra, Geometry and Computation CARMA, Workshop on Mathematics and Computation Terry Gagen and Don Taylor The University of Sydney 20 June 2015 Fifty years ago: the discovery In January 1965, a surprising announcement was communicated to the international mathematical community. Zvonimir Janko, working as a Research Fellow at the Institute of Advanced Study within the Australian National University had constructed a new sporadic simple group. Before 1965 only five sporadic simple groups were known. They had been discovered almost exactly one hundred years prior (1861 and 1873) by Émile Mathieu but the proof of their simplicity was only obtained in 1900 by G. A. Miller. Finite simple groups: earliest examples É The cyclic groups Zp of prime order and the alternating groups Alt(n) of even permutations of n 5 items were the earliest simple groups to be studied (Gauss,≥ Euler, Abel, etc.) É Evariste Galois knew about PSL(2,p) and wrote about them in his letter to Chevalier in 1832 on the night before the duel. É Camille Jordan (Traité des substitutions et des équations algébriques,1870) wrote about linear groups defined over finite fields of prime order and determined their composition factors. The ‘groupes abéliens’ of Jordan are now called symplectic groups and his ‘groupes hypoabéliens’ are orthogonal groups in characteristic 2. É Émile Mathieu introduced the five groups M11, M12, M22, M23 and M24 in 1861 and 1873. The classical groups, G2 and E6 É In his PhD thesis Leonard Eugene Dickson extended Jordan’s work to linear groups over all finite fields and included the unitary groups.
    [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]
  • Normal Subgroups of the General Linear Groups Over Von Neumann Regular Rings L
    PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 96, Number 2, February 1986 NORMAL SUBGROUPS OF THE GENERAL LINEAR GROUPS OVER VON NEUMANN REGULAR RINGS L. N. VASERSTEIN1 ABSTRACT. Let A be a von Neumann regular ring or, more generally, let A be an associative ring with 1 whose reduction modulo its Jacobson radical is von Neumann regular. We obtain a complete description of all subgroups of GLn A, n > 3, which are normalized by elementary matrices. 1. Introduction. For any associative ring A with 1 and any natural number n, let GLn A be the group of invertible n by n matrices over A and EnA the subgroup generated by all elementary matrices x1'3, where 1 < i / j < n and x E A. In this paper we describe all subgroups of GLn A normalized by EnA for any von Neumann regular A, provided n > 3. Our description is standard (see Bass [1] and Vaserstein [14, 16]): a subgroup H of GL„ A is normalized by EnA if and only if H is of level B for an ideal B of A, i.e. E„(A, B) C H C Gn(A, B). Here Gn(A, B) is the inverse image of the center of GL„(,4/S) (when n > 2, this center consists of scalar invertible matrices over the center of the ring A/B) under the canonical homomorphism GL„ A —►GLn(A/B) and En(A, B) is the normal subgroup of EnA generated by all elementary matrices in Gn(A, B) (when n > 3, the group En(A, B) is generated by matrices of the form (—y)J'lx1'Jy:i''1 with x € B,y £ A,l < i ^ j < n, see [14]).
    [Show full text]
  • Generalized Quaternions
    GENERALIZED QUATERNIONS KEITH CONRAD 1. introduction The quaternion group Q8 is one of the two non-abelian groups of size 8 (up to isomor- phism). The other one, D4, can be constructed as a semi-direct product: ∼ ∼ × ∼ D4 = Aff(Z=(4)) = Z=(4) o (Z=(4)) = Z=(4) o Z=(2); where the elements of Z=(2) act on Z=(4) as the identity and negation. While Q8 is not a semi-direct product, it can be constructed as the quotient group of a semi-direct product. We will see how this is done in Section2 and then jazz up the construction in Section3 to make an infinite family of similar groups with Q8 as the simplest member. In Section4 we will compare this family with the dihedral groups and see how it fits into a bigger picture. 2. The quaternion group from a semi-direct product The group Q8 is built out of its subgroups hii and hji with the overlapping condition i2 = j2 = −1 and the conjugacy relation jij−1 = −i = i−1. More generally, for odd a we have jaij−a = −i = i−1, while for even a we have jaij−a = i. We can combine these into the single formula a (2.1) jaij−a = i(−1) for all a 2 Z. These relations suggest the following way to construct the group Q8. Theorem 2.1. Let H = Z=(4) o Z=(4), where (a; b)(c; d) = (a + (−1)bc; b + d); ∼ The element (2; 2) in H has order 2, lies in the center, and H=h(2; 2)i = Q8.
    [Show full text]
  • Dihedral Groups Ii
    DIHEDRAL GROUPS II KEITH CONRAD We will characterize dihedral groups in terms of generators and relations, and describe the subgroups of Dn, including the normal subgroups. We will also introduce an infinite group that resembles the dihedral groups and has all of them as quotient groups. 1. Abstract characterization of Dn −1 −1 The group Dn has two generators r and s with orders n and 2 such that srs = r . We will show every group with a pair of generators having properties similar to r and s admits a homomorphism onto it from Dn, and is isomorphic to Dn if it has the same size as Dn. Theorem 1.1. Let G be generated by elements x and y where xn = 1 for some n ≥ 3, 2 −1 −1 y = 1, and yxy = x . There is a surjective homomorphism Dn ! G, and if G has order 2n then this homomorphism is an isomorphism. The hypotheses xn = 1 and y2 = 1 do not mean x has order n and y has order 2, but only that their orders divide n and divide 2. For instance, the trivial group has the form hx; yi where xn = 1, y2 = 1, and yxy−1 = x−1 (take x and y to be the identity). Proof. The equation yxy−1 = x−1 implies yxjy−1 = x−j for all j 2 Z (raise both sides to the jth power). Since y2 = 1, we have for all k 2 Z k ykxjy−k = x(−1) j by considering even and odd k separately. Thus k (1.1) ykxj = x(−1) jyk: This shows each product of x's and y's can have all the x's brought to the left and all the y's brought to the right.
    [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]
  • Lie Group and Geometry on the Lie Group SL2(R)
    INDIAN INSTITUTE OF TECHNOLOGY KHARAGPUR Lie group and Geometry on the Lie Group SL2(R) PROJECT REPORT – SEMESTER IV MOUSUMI MALICK 2-YEARS MSc(2011-2012) Guided by –Prof.DEBAPRIYA BISWAS Lie group and Geometry on the Lie Group SL2(R) CERTIFICATE This is to certify that the project entitled “Lie group and Geometry on the Lie group SL2(R)” being submitted by Mousumi Malick Roll no.-10MA40017, Department of Mathematics is a survey of some beautiful results in Lie groups and its geometry and this has been carried out under my supervision. Dr. Debapriya Biswas Department of Mathematics Date- Indian Institute of Technology Khargpur 1 Lie group and Geometry on the Lie Group SL2(R) ACKNOWLEDGEMENT I wish to express my gratitude to Dr. Debapriya Biswas for her help and guidance in preparing this project. Thanks are also due to the other professor of this department for their constant encouragement. Date- place-IIT Kharagpur Mousumi Malick 2 Lie group and Geometry on the Lie Group SL2(R) CONTENTS 1.Introduction ................................................................................................... 4 2.Definition of general linear group: ............................................................... 5 3.Definition of a general Lie group:................................................................... 5 4.Definition of group action: ............................................................................. 5 5. Definition of orbit under a group action: ...................................................... 5 6.1.The general linear
    [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]
  • Bott Periodicity for the Unitary Group
    Bott Periodicity for the Unitary Group Carlos Salinas March 7, 2018 Abstract We will present a condensed proof of the Bott Periodicity Theorem for the unitary group U following John Milnor’s classic Morse Theory. There are many documents on the internet which already purport to do this (and do so very well in my estimation), but I nevertheless will attempt to give a summary of the result. Contents 1 The Basics 2 2 Fiber Bundles 3 2.1 First fiber bundle . .4 2.2 Second Fiber Bundle . .5 2.3 Third Fiber Bundle . .5 2.4 Fourth Fiber Bundle . .5 3 Proof of the Periodicity Theorem 6 3.1 The first equivalence . .7 3.2 The second equality . .8 4 The Homotopy Groups of U 8 1 The Basics The original proof of the Periodicity Theorem relies on a deep result of Marston Morse’s calculus of variations, the (Morse) Index Theorem. The proof of this theorem, however, goes beyond the scope of this document, the reader is welcome to read the relevant section from Milnor or indeed Morse’s own paper titled The Index Theorem in the Calculus of Variations. Perhaps the first thing we should set about doing is introducing the main character of our story; this will be the unitary group. The unitary group of degree n (here denoted U(n)) is the set of all unitary matrices; that is, the set of all A ∈ GL(n, C) such that AA∗ = I where A∗ is the conjugate of the transpose of A (conjugate transpose for short).
    [Show full text]