DOCSLIB.ORG

Solutions to Assignment 1

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Solutions to Assignment 1 Solutions to Assignment 1 1. Determine all group structures on a set of n elements for 2 ≤ n ≤ 6. Determine the subgroups, quotient groups of these groups and also their Jordan-Holder series. Solution: n = 1: The trivial group. n = 2: The group Z2. n = 3: The group Z3. n = 4: Groups Z4 and Z2 × Z2. Jordan Holder series are given by, Z4 ⊃ Z2 ⊃ {e},Z2 × Z2 ⊃ Z2 ⊃ {e}. n = 5: The group Z5. n = 6: The groups Z6,S3. Jordan Holder series, Z6 ⊃ Z3 ⊃ {e}, S3 ⊃ H ⊃ {e}, where H is the subgroup of order 3 containing the identity and the 3-cycles. 2. Let A and B be subgroups of a group G. (a) Prove that for AB to be a group it is necessary and sufficient that A and B are permutable, that is AB = BA. Solution: Suppose that AB is a group. Let a ∈ A, b ∈ B. Then, ab ∈ AB. −1 −1 −1 −1 −1 But, (ab) = b a must also be in AB. Hence, b a = a1b1 for some −1 −1 a1 ∈ A, b1 ∈ B. Inverting again, ab = b1 a1 ∈ BA. Hence, AB ⊂ BA and by symmetry BA ⊂ AB. Now suppose, AB = BA. Let a1, a2 ∈ A and b1, b2 ∈ B. Now consider, a1b1a2b2. Since, BA = AB, b1a2 = a3b3 for some a3 ∈ A and b3 ∈ B. Thus, AB is closed −1 −1 −1 under multiplication. Also, (a1b1) = b1 a1 ∈ BA = AB. Thus, AB is also closed under taking inverses. (b) Prove that if A and B are permutable and C is a subgroup containing A, A is permutable with B ∩ C and A(B ∩ C) = C ∩ (AB). Solution: Let a ∈ A and b ∈ B ∩ C. Since, A, B are permutable, ab = b1a1 for some b1 ∈ B and a1 ∈ A. But since, A ⊂ C, a, b, ab, a1 are all in C, which implies that b1 ∈ C. Hence, A is permutable with B ∩ C. Clearly, A(B ∩ C) ⊂ C ∩ (AB). Now, let c = ab ∈ C ∩ (AB) for some a ∈ A, b ∈ B, c ∈ C. Now, b = a−1c ∈ C because a ∈ C. Hence, ab ∈ A(B ∩ C). 3. If a subgroup of a group G has index 2, show that it is a normal subgroup of G. Solution: Let H be a subgroup of G of index 2 and let g ∈ G \ H. Since, there are only two cosets and gH 6= H, gH = G \ H. But the same is true for Hg. Hence, gH = Hg for every g, proving that H is normal. 4. Let G be a group such that all elements of G other than the identity has order 2. Show that: 1 Solutions to Assignment 1 (a) G is commutative. Solution: Let a, b ∈ G. Then, (ab)2 = abab = e. Hence, ab = b−1a−1. But, b2 = e ⇒ b = b−1 and similarly a = a−1. Hence, ab = ba. (b) If G is finite, order of G is a power of 2. Solution: From the book, for a finite Abelian group the order of G must divide some power of any exponent of G. Clearly, 2 is an exponent and hence order of G must be a power of 2. 5. Let G be a group such that, for a fixed integer n > 1, (xy)n = xnyn for all x, y ∈ G. (n) n n Let G = {x |x ∈ G}, and G(n) = {x ∈ G|x = e}. (n) (a) Prove that G ,G(n) are normal subgroups of G. n Solution: It is easy to see by induction that for any g1, . , gk ∈ G,(g1 . gk) = n n n n n (n) g1 . gk . It is also clear from the property that (xy) = x y , that G ,G(n) are subgroups. Now, let g, x ∈ G and consider the element gxng−1. Clearly, n −1 −1 −1 −1 n (n) gx g = (gxg1)(gxg ) ... (gxg ) = (gxg ) ∈ G . This shows that, G(n) is a normal subgroup. n −1 n n n −n Now let y ∈ G(n). Hence, y = e. Now, (gyg ) = (g y g ) = e. Hence, −1 gyg ∈ G(n), which show that G(n) is a normal subgroup. (n) (b) If G is finite then the order of G is equal to the index of G(n). Solution: We will establish a bijection between the elements of G(n) and the left n (n) cosets of G(n). Namely, let x = g ∈ G map to gG(n). Clearly, the map is onto. Now, suppose that g1G(n) = g2G(n). Then, g1y1 = g2y2 for some y1, y2 ∈ G(n). n n n n n n n n n n But, y1 = y2 = e. Hence, (g1y1) = g1 y1 = g1 = (g2y2) = g2 . Hence, g1 = g2 proving that the map is 1-1. (c) Show that for all x, y ∈ G, x1−ny1−n = (xy)1−n and deduce that xn−1yn = ynxn−1. Solution: x1−ny1−n = xx−ny−ny = xx−1y−1ny = xx−1(y−1x−1)n−1y−1y = (y−1x−1)n−1 = (xy)−1n − 1 = (xy)1−n. Also, xn−1yn = (x−1)1−n(y−1)1 − ny = (x−1y−1)1−ny = (yx)n−1y = (yx)n−1yxx−1 = (yx)nx−1 = ynxn−1. (d) Conclude from the above that the set of elements of G of the form xn(n−1) generates a commutative subgroup of G. Solution: Let x, y ∈ G. Now, xn(n−1)yn(n−1) = (xn−1)n(yn−1)n = (xn−1yn−1)n = 2 Solutions to Assignment 1 (xn−1yny−1)n = (ynxn−1y−1)n = yn2 x(n−1)ny−n = yn2 (xn)n−1(y−1)n = yn2 (y−1)n(xn)n−1 = yn(n−1)xn(n−1). Thus, he set of elements of G of the form xn(n−1) commute with each other and hence, they generate a commutative subgroup. 6. Let G be a group. If S is a simple group, S is said to occur in G is there exist 0 0 0 ∼ two subgroups H, H of G, with H C H such that H /H = S. Let in(G) be the isomorphism classes of simple groups occuring in G. (a) Prove that, in(G) = ∅ ⇔ G = {e}. Solution: Clearly if G = {e} then in(G) = ∅. Now, suppose that in(G) = ∅. If G 6= {e} then there exists an element g ∈ G, g 6= e. Consider the cyclic subgroup 2 ∼ hgi generated by g. Now, if hgi is infinite then hgi/hg i = Z2, which must belong to in(G). If hgi is finite, then it is simple if |hgi| is prime. Otherwise, let H be a maximal proper subgroup of hgi, and hgi/H must be simple and belong to in(G). (b) If H is a subgroup of G, show that in(H) ⊂ in(G); if moreover, H is normal, then in(G) = in(H) ∪ in(G/H). Solution: If H is normal it follows easily from the third isomorphism theorem, that in(H) ∪ in(G/H) ⊂ in(G). Now, let S be a simple group, such that there exist two subgroups H1,H2 of G, ∼ with H1 C H2, and H2/H1 = S. Now, H2 ∩ H C H2, and hence H1(H2 ∩ H) C H2. Since, H2/H1 is simple, there is no proper normal subgroup of H2 properly containing H1. ∼ Hence, either H1(H2 ∩ H) = H2 or H1(H2 ∩ H) = H1. In the first case, S = ∼ ∼ H2/H1 = H1(H2 ∩ H)/H1 = (H2 ∩ H)/(H1 ∩ H2 ∩ H) ∈ in(H), where we used the second isomorphism theorem. 0 ∼ 0 In the second case, H = H2 ∩H ⊂ H1 and H2H/H = H2/H contains a subgroup isomorphic to S. Hence, S ∈ in(G/H). (c) Let G1,G2 be two groups. Show that the following two properties are equivalent: i. in(G1) ∩ in(G2) = ∅. ii. Every subgroup of G1 ×G2 is of the form H1 ×H2 with H1 ⊂ G1 and H2 ⊂ G2. Solution: Let in(G1) ∩ in(G2) = ∅. Let H be a subgroup of G1 × G2 and H1 = p1(H) and H2 = p2(H2) where p1, p2 are the projection homomorphisms. ∼ We claim that, H = H1 × H2. 0 −1 0 −1 0 Let H1 = p1(p2 (e2) ∩ H) and H2 = p2(p1 (e1) ∩ H). It is easy to verify that, H1 0 is a normal subgroup of H1 and similarly, H2 is a normal subgroup of H2. 3 Solutions to Assignment 1 Consider, the homomorphism 0 0 φ1 : H1 → H/(H1 × H2) −1 defined by, φ1(h1) = (h1, h2), where (h1, h2) is any element of p1 (h1)∩H. This is 0 −1 0 −1 well-defined since for any other element (h1, h2) of p1 (h1)∩H,(h1, h2)(h1, h2) = 0−1 0 0 0 0 (e1, h2h2 ) ∈ H1 × H2. Also, h1 ∈ ker(φ) iff h1 ∈ H1. Hence, ker(φ) = H1. 0 0 Moreover, let (h1, h2) ∈ H/(H1 × H2). Clearly, φ1(h1) = (h1, h2) and hence φ1 is 0 ∼ 0 0 surjective. Hence, H1/H1 = H/(H1 × H2). By symmetry, 0 ∼ 0 0 ∼ 0 H1/H1 = H/(H1 × H2) = H2/H2. 0 0 Now, in(H1/H1) ⊂ in(H1) ⊂ in(G1) and in(H2/H2) ⊂ in(H2) ⊂ in(G2). Since, 0 ∼ 0 0 0 in(G1)∩in(G2) = ∅, and H1/H1 = H2/H2, it follows that in(H1/H1) = in(H2/H2) = 0 0 ∅, and using part (a) this implies that H1 = H1 and H2 = H2. It is easy now to deduce that H = H1 × H2. In order to prove the converse, suppose there exists S ∈ in(G1) ∩ in(G2). This 0 0 implies that there exists subgroups H1 C H1 of G1 and H2 C H2 of G2, such that ∼ 0 ∼ 0 0 0 S = H1/H1 = H2/H2.
Load more

Recommended publications
  • On Abelian Subgroups of Finitely Generated Metabelian
    J. Group Theory 16 (2013), 695–705 DOI 10.1515/jgt-2013-0011 © de Gruyter 2013 On abelian subgroups of finitely generated metabelian groups Vahagn H. Mikaelian and Alexander Y. Olshanskii Communicated by John S. Wilson To Professor Gilbert Baumslag to his 80th birthday Abstract. In this note we introduce the class of H-groups (or Hall groups) related to the class of B-groups defined by P. Hall in the 1950s. Establishing some basic properties of Hall groups we use them to obtain results concerning embeddings of abelian groups. In particular, we give an explicit classification of all abelian groups that can occur as subgroups in finitely generated metabelian groups. Hall groups allow us to give a negative answer to G. Baumslag’s conjecture of 1990 on the cardinality of the set of isomorphism classes for abelian subgroups in finitely generated metabelian groups. 1 Introduction The subject of our note goes back to the paper of P. Hall [7], which established the properties of abelian normal subgroups in finitely generated metabelian and abelian-by-polycyclic groups. Let B be the class of all abelian groups B, where B is an abelian normal subgroup of some finitely generated group G with polycyclic quotient G=B. It is proved in [7, Lemmas 8 and 5.2] that B H, where the class H of countable abelian groups can be defined as follows (in the present paper, we will call the groups from H Hall groups). By definition, H H if 2 (1) H is a (finite or) countable abelian group, (2) H T K; where T is a bounded torsion group (i.e., the orders of all ele- D ˚ ments in T are bounded), K is torsion-free, (3) K has a free abelian subgroup F such that K=F is a torsion group with trivial p-subgroups for all primes except for the members of a finite set .K/.
    [Show full text]
  • On Finite Groups Whose Every Proper Normal Subgroup Is a Union
    Proc. Indian Acad. Sci. (Math. Sci.) Vol. 114, No. 3, August 2004, pp. 217–224. © Printed in India On finite groups whose every proper normal subgroup is a union of a given number of conjugacy classes ALI REZA ASHRAFI and GEETHA VENKATARAMAN∗ Department of Mathematics, University of Kashan, Kashan, Iran ∗Department of Mathematics and Mathematical Sciences Foundation, St. Stephen’s College, Delhi 110 007, India E-mail: ashrafi@kashanu.ac.ir; geetha [email protected] MS received 19 June 2002; revised 26 March 2004 Abstract. Let G be a finite group and A be a normal subgroup of G. We denote by ncc.A/ the number of G-conjugacy classes of A and A is called n-decomposable, if ncc.A/ = n. Set KG ={ncc.A/|A CG}. Let X be a non-empty subset of positive integers. A group G is called X-decomposable, if KG = X. Ashrafi and his co-authors [1–5] have characterized the X-decomposable non-perfect finite groups for X ={1;n} and n ≤ 10. In this paper, we continue this problem and investigate the structure of X-decomposable non-perfect finite groups, for X = {1; 2; 3}. We prove that such a group is isomorphic to Z6;D8;Q8;S4, SmallGroup(20, 3), SmallGroup(24, 3), where SmallGroup.m; n/ denotes the mth group of order n in the small group library of GAP [11]. Keywords. Finite group; n-decomposable subgroup; conjugacy class; X-decompo- sable group. 1. Introduction and preliminaries Let G be a finite group and let NG be the set of proper normal subgroups of G.
    [Show full text]
  • Mathematics 310 Examination 1 Answers 1. (10 Points) Let G Be A
    Mathematics 310 Examination 1 Answers 1. (10 points) Let G be a group, and let x be an element of G. Finish the following definition: The order of x is ... Answer: . the smallest positive integer n so that xn = e. 2. (10 points) State Lagrange’s Theorem. Answer: If G is a finite group, and H is a subgroup of G, then o(H)|o(G). 3. (10 points) Let ( a 0! ) H = : a, b ∈ Z, ab 6= 0 . 0 b Is H a group with the binary operation of matrix multiplication? Be sure to explain your answer fully. 2 0! 1/2 0 ! Answer: This is not a group. The inverse of the matrix is , which is not 0 2 0 1/2 in H. 4. (20 points) Suppose that G1 and G2 are groups, and φ : G1 → G2 is a homomorphism. (a) Recall that we defined φ(G1) = {φ(g1): g1 ∈ G1}. Show that φ(G1) is a subgroup of G2. −1 (b) Suppose that H2 is a subgroup of G2. Recall that we defined φ (H2) = {g1 ∈ G1 : −1 φ(g1) ∈ H2}. Prove that φ (H2) is a subgroup of G1. Answer:(a) Pick x, y ∈ φ(G1). Then we can write x = φ(a) and y = φ(b), with a, b ∈ G1. Because G1 is closed under the group operation, we know that ab ∈ G1. Because φ is a homomorphism, we know that xy = φ(a)φ(b) = φ(ab), and therefore xy ∈ φ(G1). That shows that φ(G1) is closed under the group operation.
    [Show full text]
  • Math 412. Simple Groups
    Math 412. Simple Groups DEFINITION: A group G is simple if its only normal subgroups are feg and G. Simple groups are rare among all groups in the same way that prime numbers are rare among all integers. The smallest non-abelian group is A5, which has order 60. THEOREM 8.25: A abelian group is simple if and only if it is finite of prime order. THEOREM: The Alternating Groups An where n ≥ 5 are simple. The simple groups are the building blocks of all groups, in a sense similar to how all integers are built from the prime numbers. One of the greatest mathematical achievements of the Twentieth Century was a classification of all the finite simple groups. These are recorded in the Atlas of Simple Groups. The mathematician who discovered the last-to-be-discovered finite simple group is right here in our own department: Professor Bob Greiss. This simple group is called the monster group because its order is so big—approximately 8 × 1053. Because we have classified all the finite simple groups, and we know how to put them together to form arbitrary groups, we essentially understand the structure of every finite group. It is difficult, in general, to tell whether a given group G is simple or not. Just like determining whether a given (large) integer is prime, there is an algorithm to check but it may take an unreasonable amount of time to run. A. WARM UP. Find proper non-trivial normal subgroups of the following groups: Z, Z35, GL5(Q), S17, D100.
    [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]
  • Solutions to Exercises for Mathematics 205A
    SOLUTIONS TO EXERCISES FOR MATHEMATICS 205A | Part 6 Fall 2008 APPENDICES Appendix A : Topological groups (Munkres, Supplementary exercises following $ 22; see also course notes, Appendix D) Problems from Munkres, x 30, pp. 194 − 195 Munkres, x 26, pp. 170{172: 12, 13 Munkres, x 30, pp. 194{195: 18 Munkres, x 31, pp. 199{200: 8 Munkres, x 33, pp. 212{214: 10 Solutions for these problems will not be given. Additional exercises Notation. Let F be the real or complex numbers. Within the matrix group GL(n; F) there are certain subgroups of particular importance. One such subgroup is the special linear group SL(n; F) of all matrices of determinant 1. 0. Prove that the group SL(2; C) has no nontrivial proper normal subgroups except for the subgroup { Ig. [Hint: If N is a normal subgroup, show first that if A 2 N then N contains all matrices that are similar to A. Therefore the proof reduces to considering normal subgroups containing a Jordan form matrix of one of the following two types: α 0 " 1 ; 0 α−1 0 " Here α is a complex number not equal to 0 or 1 and " = 1. The idea is to show that if N contains one of these Jordan forms then it contains all such forms, and this is done by computing sufficiently many matrix products. Trial and error is a good way to approach this aspect of the problem.] SOLUTION. We shall follow the steps indicated in the hint. If N is a normal subgroup of SL(2; C) and A 2 N then N contains all matrices that are similar to A.
    [Show full text]
  • Normal Subgroups of Invertibles and of Unitaries In
    Normal subgroups of invertibles and of unitaries in a C∗-algebra Leonel Robert We investigate the normal subgroups of the groups of invertibles and unitaries in the connected component of the identity. By relating normal subgroups to closed two-sided ideals we obtain a “sandwich condition” describing all the closed normal subgroups both in the invertible and in the the unitary case. We use this to prove a conjecture by Elliott and Rørdam: in a simple C∗-algebra, the group of approximately inner automorphisms induced by unitaries in the connected com- ponent of the identity is topologically simple. Turning to non-closed subgroups, we show, among other things, that in simple unital C∗-algebra the commutator subgroup of the group of invertibles in the connected component of the identity is a simple group modulo its center. A similar result holds for unitaries under a mild extra assumption. 1 Introduction We investigate below the normal subgroups of the group of invertibles and of the group of unitaries of a C∗-algebra. We confine ourselves to the connected component of the identity. Let GA denote the group of invertibles connected to the identity and UA the unitaries connected to the identity, A being the ambient C∗-algebra. The problem of calculating the normal subgroups of GA and UA goes to back to Kadison’s papers [Kad52, Kad55, Kad54], where the (norm) closed normal subgroups of GA and UA, for A a von Neumann algebra factor, were fully described. Over the years various authors have returned to this problem, arXiv:1603.01884v1 [math.OA] 6 Mar 2016 focusing on the case that A is a simple C∗-algebra, and assuming further structural properties on A.
    [Show full text]
  • 18.704 Supplementary Notes March 23, 2005 the Subgroup Ω For
    18.704 Supplementary Notes March 23, 2005 The subgroup Ω for orthogonal groups In the case of the linear group, it is shown in the text that P SL(n; F ) (that is, the group SL(n) of determinant one matrices, divided by its center) is usually a simple group. In the case of symplectic group, P Sp(2n; F ) (the group of symplectic matrices divided by its center) is usually a simple group. In the case of the orthog- onal group (as Yelena will explain on March 28), what turns out to be simple is not P SO(V ) (the orthogonal group of V divided by its center). Instead there is a mysterious subgroup Ω(V ) of SO(V ), and what is usually simple is P Ω(V ). The purpose of these notes is first to explain why this complication arises, and then to give the general definition of Ω(V ) (along with some of its basic properties). So why should the complication arise? There are some hints of it already in the case of the linear group. We made a lot of use of GL(n; F ), the group of all invertible n × n matrices with entries in F . The most obvious normal subgroup of GL(n; F ) is its center, the group F × of (non-zero) scalar matrices. Dividing by the center gives (1) P GL(n; F ) = GL(n; F )=F ×; the projective general linear group. We saw that this group acts faithfully on the projective space Pn−1(F ), and generally it's a great group to work with.
    [Show full text]
  • Problem Sheet 8 Normal Subgroups and Quotients
    MAST20022 Group Theory and Linear Algebra Semester 2, 2020 Problem sheet 8 Normal subgroups and quotients Vocabulary (1) Let G be a group and let H be a subgroup. Define a left coset of H,arightcosetofH and the index of H in G and give some illustrative examples. (2) Let G be a group and let H be a subgroup. Define G/H and give some illustrative examples. (3) Let G be a group. Define normal subgroup of G and give some illustrative examples. (4) Let G be a group and let H be a normal subgroup. Define the quotient group G/H and give some illustrative examples. Results (1) Let G be a group and let H be a subgroup of G.Leta, b G.ShowthatHa = Hb if 1 2 and only if ab− H. 2 (2) Let G be a group and let H be a subgroup of G. Show that each element of G lies in exactly one coset of G. (3) Let G be a group and let H be a subgroup of G.Leta, b G. Show that the function f : Ha Hb given by f(ha)=hb is a bijection. 2 ! (4) Let G be a group and let H be a subgroup of G.ShowthatG/H is a partition of G. (5) Let G be a group and let H be a subgroup of G.Letg G. Show that gH and H have the same number of elements. 2 (6) Let G be a group of finite order and let H be a subgroup of G.ShowthatCard(H)divides Card(G).
    [Show full text]
  • The Alternating Group
    The Alternating Group R. C. Daileda 1 The Parity of a Permutation Let n ≥ 2 be an integer. We have seen that any σ 2 Sn can be written as a product of transpositions, that is σ = τ1τ2 ··· τm; (1) where each τi is a transposition (2-cycle). Although such an expression is never unique, there is still an important invariant that can be extracted from (1), namely the parity of σ. Specifically, we will say that σ is even if there is an expression of the form (1) with m even, and that σ is odd if otherwise. Note that if σ is odd, then (1) holds only when m is odd. However, the converse is not immediately clear. That is, it is not a priori evident that a given permutation can't be expressed as both an even and an odd number of transpositions. Although it is true that this situation is, indeed, impossible, there is no simple, direct proof that this is the case. The easiest proofs involve an auxiliary quantity known as the sign of a permutation. The sign is uniquely determined for any given permutation by construction, and is easily related to the parity. This thereby shows that the latter is uniquely determined as well. The proof that we give below follows this general outline and is particularly straight- forward, given that the reader has an elementary knowledge of linear algebra. In particular, we assume familiarity with matrix multiplication and properties of the determinant. n We begin by letting e1; e2;:::; en 2 R denote the standard basis vectors, which are the columns of the n × n identity matrix: I = (e1 e2 ··· en): For σ 2 Sn, we define π(σ) = (eσ(1) eσ(2) ··· eσ(n)): Thus π(σ) is the matrix whose ith column is the σ(i)th column of the identity matrix.
    [Show full text]
  • Normal Subgroups of SL2(K[T ]) with Or Without Free Quotients
    JOURNAL OF ALGEBRA 150) 281--295 (1992) Normal Subgroups of SL2(k[t ]) with or without Free Quotients A. W. MASON Department of Mathematics, Unirersity of Glasgow, Glasgow GI2 8Q II", Scotlamt, United I~ingdom Communicated b)' Walter Feit Received January 3, 1990 INTRODUCTION Throughout this paper we use "free" as an abbreviation for "free, non- trivial, possibly infinite cyclic." Here we are concerned with the structure of the normal subgroups of SL2(k[t]), where k is a field. We prove that there are uncountably many normal subgroups N Qf SL2(k[t]) with a non- cyclic, free quotient F whose rank is infinite when k is infinite or N has infinite index in SL2(k[t]). (Otherwise F has finite rank.) We prove al~o that there are uncountably many normal subgroups of SL2(k[t]) with no free quotients. These subgroups correspond in a natural way with special subsets of (the vector space) kit] which we call quasi-sub- spaces. (Every subspace of kit] is a quasi-subspace and, conversely, every quasi-subspace is a subspace when for example char k ~ 2. However, not every quasi-subspace is a subspace.) Our terminology is motivated by the fact that there are examples of quasi-subspaces of k[t] which are also quasi-ideals ofk[t] as defined in [20, p. 192]. We conclude by proving the existence of free, normal subgroups of SL2(k[t]). All such subgroups have infinite rank. Our results are based on a well known result of Nagao [14] which shows that SL2(k[t]) is a (non-trivial) free product of groups with amalgamated subgroup.
    [Show full text]
  • Special Orthogonal Groups and Rotations
    Special Orthogonal Groups and Rotations Christopher Triola Submitted in partial fulfillment of the requirements for Honors in Mathematics at the University of Mary Washington Fredericksburg, Virginia April 2009 This thesis by Christopher Triola is accepted in its present form as satisfying the thesis require- ment for Honors in Mathematics. Date Approved Randall D. Helmstutler, Ph.D. thesis advisor Manning G. Collier, Ph.D. committee member J. Larry Lehman, Ph.D. committee member Contents 1 Introduction to Rotation Groups 1 1.1 Linear Isometries . 1 1.2 Orthogonal Groups . 2 1.3 Group Properties of SO(2) ................................ 4 1.4 Group Properties of SO(n), n ≥ 3 ............................ 5 2 Eigenvalue Structure 6 2.1 First Results . 6 2.2 SO(2)............................................ 7 2.3 SO(3)............................................ 9 2.4 SO(4)............................................ 12 2 3 4 2.5 R , R , and R ....................................... 15 3 Other Representations 17 3.1 C and SO(2) ........................................ 17 3.2 H and SO(3) ........................................ 19 3.3 H × H and SO(4)...................................... 22 References 24 Abstract The rotational geometry of n-dimensional Euclidean space is characterized by the special or- thogonal groups SO(n). Elements of these groups are length-preserving linear transformations whose matrix representations possess determinant +1. In this paper we investigate some of the group properties of SO(n). We also use linear algebra to study algebraic and geometric prop- erties of SO(2), SO(3), and SO(4). Through this work we find quantifiable differences between rotations in R2, R3, and R4. Our focus then shifts to alternative representations of these groups, with emphasis on the ring H of quaternions.
    [Show full text]