G i. h i f i G h f j. G j
|
|
- Laurence Kennedy
- 5 years ago
- Views:
Transcription
1 2. TWO BASIC CONSTRUCTIONS Free Products with amalgamation. Let {G i i I} be a family of gps, A a gp and α i : A G i a monomorphism, i I. A gp G is the free product of the G i with A amalgamated (via the α i ) if homomorphisms f i : G i G such that f i α i = f j α j i, j I, and if h i : G i H are homomorphisms with h i α i = h j α j for all i, j I, then there is a unique homomorphism h : G H such that h f i = h i for all i I. Call h an extension of the homoms. h i. A G i α i h i f i G h f j α j h j G j Note. Follows: G is generated by i I f i (G i ). Let G 0 be the subgroup of G generated by this set. Take H = G 0 and h i = f i, viewed as a mapping to G 0, in the defn. an extn to a homomorphism f : G G 0. Let e : G 0 G be the inclusion map. Then e f and id G : G G are both extns of the maps f i : G i G. Since the extn is unique, e f = id G, so e is onto, hence G = G 0. Uniqueness. Let f i : G i G be homomorphisms such that f i α i = f j α j for all i, j I, and if h i : G i H are homomorphisms with h i α i = h j α j for all i, j I, then there is a unique homomorphism h : G H such that h f i = h i for all i I. In the defn, take h i = f i, to obtain a homomorphism f : G G such that f f i = f i for all i. Interchanging G and G, get f : G G such that f f i = f i for all i. Take H = G, h i = f i in the defn; both f f and id G : G G are extensions of the f i : G i G. Since the extension is unique, f f = id G. Interchanging G and G, f f = id G, so f and f are inverse isomorphisms. Existence. let X i R i be a presn of G i, with X i X j = /0 for i j. Let Y be a set of generators for A and, for each y Y, i I let a i,y be a word in X ±1 i representing α i (y). Let S = { a i,y a 1 j,y y Y, i, j I, i j}. Let G be the group with presentation i I X i i I R i S. Then G is the free product with amalgamation. There is an obvious mapping X i G, 1 H
2 which (by defn of a presentation) induces a homomorphism f i : G i G. The existence and uniqueness of the mapping h in the definition follows by defn of a presentation. If G is the free product of {G i i I} with A amalgamated, write G = A G i. In case of two groups {G 1,G 2 }, write G = G 1 A G 2. Example. let G 1 = x, G 2 = y, A = a inf. cyclic. α 1 : a x 2, α 2 : a y 3. G = G 1 A G 2 has presentation x,y x 2 = y 3, after Tietze transformations. Structure of free prods with amalgamation. Let G = A G i via α i : A G i, i I. To represent elts of G by certain words, identify A with α i (A) and assume G i G j = A for i j. Define a word to be a finite sequence w = (g 1,...,g k ), where k 1 and g 1 G i1,...,g k G ik for some i 1,...,i k I. Elt. of G represented by w is f i1 (g 1 )... f ik (g k ). Since i I f i (G i ) generates G and the f i are homoms, every element of G is repd by some word. Definition. Let w = (g 1,...,g k ) be a word with g j G i j, 1 j k. Then w is reduced if (1) i j i j+1 for 1 j k 1; (2) g j A for 1 j k, unless k = 1. If (1) fails, can replace w by (g 1,...,g j g j+1,...,g k ), representing the same element of G. If (2) fails, can also replace w by a shorter word. Hence every elt of G is represented by a reduced word (take a word of shortest length representing it). For every i I, choose a transversal T i for the cosets {Ax x G i }, with 1 T i. Let g G be represented by the reduced word (g 1,...,g k ) with g j G i j. Can write: g k = a k r k (a k A, r k T ik ) g k 1 a k = a k 1 r k 1 (a k 1 A, r k 1 T ik 1 ). g 1 a 2 = a 1 r 1 (a 1 A, r 1 T i1 ).. 2
3 Then g 1 = a 1 r 1 a 1 2, g 2 = a 2 r 2 a 1 3,...,g k = a k r k and (a 1,r 1,r 2,...,r k ) is a word representing g. Definition. A normal word is a word (a,r 1,...,r k ) where a A, k 0, r j T i j \ {1} for some i j I (1 j k), and i j i j+1 for 1 j k 1. Thus any element of G is represented by a normal word. (a A is represented by the normal word (a).) 3 Theorem 2.1 (Normal Form Theorem). Any element of G is represented by a unique normal word. Proof. Need to show uniqueness. Let W = set of normal words. Will define an action of G on W, equivalently, a homom. h : G S(W) (symmetric group on W). By defn of G, suffices to define, for i I, a homom. h i : G i S(W) with h i α i = h j α j for all i, j I. So with the identifications made, need homomorphisms h i which agree on A. Let W i = {(1,r 1,...,r k ) W r 1 T i } (i I). Define θ i : G i W i W as follows. If g G i, write g = ar, where r T i, a A. Then θ i (g,(1,r 1,...,r k )) = θ i is bijective (exercise). { (a,r,r 1,...,r k ) if r 1 (i.e. g A) (a,r 1,...,r k ) if r = 1. Now G i acts on G i W i by left mult. on the first co-ordinate, giving a homomorphism λ i : G i S(G i W i ), where λ i (g)(x,w) = (gx,w). Set h i (g) = θ i λ i (g)θ 1 i. Since λ i is a homomorphism, so is h i. If a A, h i (a)(a,r 1,...,r k ) = (aa,r 1,...,r k ) and RHS is independent of i. Thus the h i define a homomorphism h : G S(W). Let g G be represented by the normal word w = (a,r 1,...,r k ). Then h(g)(1) = w (induction on k) so w is uniquely determined by g. Corollary 2.2. (1) The homomorphisms f i are injective; (2) no reduced word of length greater than 1 represents the identity element of G. Proof. (1) If f i (g) = 1, write g = ar with a A, r T i. Then the normal word (a,r) (or (a), if r = 1) represents 1, so a = r = 1, ie g = 1.
4 (2) If a reduced word has length k > 1, procedure above gives a normal word of length k + 1 representing same elt of G, which cannot be 1 by Theorem 2.1. By Cor. 2.2(1), the f i can be suppressed. Important special case: A = {1}. G is called the free product of the family {G i i I}, written G = i I G i (or G = G 1 G 2 for two groups). A reduced word is a word (g 1,...,g k ) such that g j G i j, g j 1 unless k = 1, and i j i j+1 for 1 j k 1. Normal Form Theorem simplifies: every element of G is represented by a unique reduced word. Also, the G i embed in G. Defining property simplifies to: given any collection of homomorphisms h i : G i H, there is a unique extension to a homomorphism h : G H. Presn used to show existence simplifies. Let X i R i be a presentation of G i (via some mapping which will be suppressed), with X i X j = /0 for i j. Then i I G i has presentation i I X i i I R i. [This is obtained from the presentation above by taking the empty presentation of the trivial group, with no generators and no relations.] Examples. (1) x,y x 2 = 1, y 2 = 1 is a presentation of C 2 C 2, the infinite dihedral group. Has D n as a homomorphic image. (2) C 2 C 3 has presentation x,y x 2 = 1, y 3 = 1. This group is called the modular group, and is isomorphic to PSL 2 (Z). (3) F free with basis {x i i I}; then F = i I x i, a free product of infinite cyclic groups. (4) Trefoil knot K; group of the knot, π 1 (R 3 K) has presn a,b aba = bab 4 Tietze transf. x,y x 2 = y 3 (previous example). HNN-extensions. Suppose B, C are subgroups of a group A and γ : B C is an isomorphism.
5 Let G have presentation {t} X R 1 R 2, where X = { x g g A }, t X { } R 1 = x g x h xgh 1 g,h A { R 2 = tx b t 1 x 1 γ(b) }. b B a homom. f : A G given by a x a ; will show f is injective. Definition. The group G is called an HNN-extension with base A, associated pair of subgroups B, C and stable letter t. Presn is often abbreviated to t,a rel(a),tbt 1 = γ(b) or just t,a rel(a),tbt 1 = C. More generally, Let Y S be a presentation of A, let { b j j J } be a set of words in Y ±1 representing a set of generators for B, and let c j be a word representing γ(b j ) [more accurately, γ(the generator represented by b j )]. Then {t} Y S { tb j t 1 = c j j J } is also a presentation of G. (Exercise.) Example. (Baumslag-Solitar) x,y xy 2 x 1 = y 3 is an HNN-extension, base an infinite cyclic group A = y, stable letter x, assoc.pair y 2, y 3. (Famous example of a non-hopfian group.) In general, G is generated by f (A) {t}, so every element of G is represented in an obvious way by a word (g 0,t e 1,g 1,t e 2,g 2,...,t e k,g k ) where k 0, e i = ±1 and g i A for 0 i k. Definition. Such a word is reduced if it has no part of the form t,b,t 1 with b B or t 1,c,t with c C. Any element of G is represented by a reduced word (take a word of minimal length representing it). Choose a transversal T B for the cosets {Bg g A} and a transversal T C for the cosets {Cg g A}, with 1 T B, T C. Definition. A normal word is a reduced word (g 0,t e 1,r 1,t e 2,r 2,...,t e k,r k ), where g 0 A, r i T B if e i = 1 and r i T C if e i = 1. Suppose (g 0,t e 1,g 1,t e 2,g 2,...,t e k,g k ) is a reduced word with k 1. If e k = 1, write g k = br with b B, r T B. Then (g 0,t e 1,g 1,t e 2,g 2,...,g k 1,te k,r) 5
6 where g k 1 = g k 1γ(b), represents the same element of G. If e k = 1, write g k = cr with c C and r T C. Then (g 0,t e 1,g 1,t e 2,g 2,...,g k 1,te k,r) where g k 1 = g k 1γ 1 (c), represents the same element of G. Repetition leads to a normal word representing the same element of G. Theorem 2.3. (Normal Form Theorem.) Every element of G is represented by a unique normal word. Proof. Omitted. Corollary 2.4. (1) The homomorphism f : A G is injective; (2) (Britton s Lemma) no reduced word (g 0,t e 1,g 1,t e 2,g 2,...,t e k,g k ) with k > 0 represents the identity element of G. More generally, given A and a family γ i : B i C i (i I) of isomorphisms, where B i, C i are subgroups of A, we can form the HNN-extension with presentation (in abbreviated form) t i (i I), G rel(g), t i B i ti 1 = γ i (B i ) (i I). There are generalisations of the Normal Form Theorem and its corollary. An application. Theorem 2.5. Any countable group can be embedded in a 2-generator group. Proof. Let G = {g 0,g 1,g 2,...}, where g 0 = 1. Let F be free with basis {a,b}. b n ab n (n 0) is a free subgp of F with the given elts as basis. Similarly a n ba n (n 0) is a free subgp. (See Exercise 2, Sheet 1.) Claim: in G F, g n a n ba n (n 0) is free with basis the given elts. For the homoms. G F, g 1 and id F : F F have an extn to a homom. f : G F F. If w is repd by a non-empty reduced word in {g n a n ba n (n 0)} ±1 of positive length, then f (w) is repd by a corresponding reduced word in {a n ba n (n 0)} ±1, so f (w) 1, hence w 1. Claim follows (see Exercise 1, Sheet 1). Can form HNN-extn H = t,g F rel(g F),t(b n ab n )t 1 = g n a n ba n (n 0). Then G G F H, g n t,a,b, and (n = 0) tat 1 = b, so H = t,a. 6
n ) = f (x 1 ) e 1... f (x n ) e n
1. FREE GROUPS AND PRESENTATIONS Let X be a subset of a group G. The subgroup generated by X, denoted X, is the intersection of all subgroups of G containing X as a subset. If g G, then g X g can be written
More informationON THE RESIDUALITY A FINITE p-group OF HN N-EXTENSIONS
1 ON THE RESIDUALITY A FINITE p-group OF HN N-EXTENSIONS D. I. Moldavanskii arxiv:math/0701498v1 [math.gr] 18 Jan 2007 A criterion for the HNN-extension of a finite p-group to be residually a finite p-group
More informationBACHELORARBEIT. Graphs of Groups. and their Fundamental Groups
BACHELORARBEIT Graphs of Groups and their Fundamental Groups Verfasserin: Martina Pflegpeter Matrikel-Nummer: 0606219 Studienrichtung: A 033 621 Mathematik Betreuer: Bernhard Krön Wien, am 01. 03. 2011
More informationDefinitions, 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
More informationINVERSE LIMITS AND PROFINITE GROUPS
INVERSE LIMITS AND PROFINITE GROUPS BRIAN OSSERMAN We discuss the inverse limit construction, and consider the special case of inverse limits of finite groups, which should best be considered as topological
More informationLectures - XXIII and XXIV Coproducts and Pushouts
Lectures - XXIII and XXIV Coproducts and Pushouts We now discuss further categorical constructions that are essential for the formulation of the Seifert Van Kampen theorem. We first discuss the notion
More information3. GRAPHS AND CW-COMPLEXES. Graphs.
Graphs. 3. GRAPHS AND CW-COMPLEXES Definition. A directed graph X consists of two disjoint sets, V (X) and E(X) (the set of vertices and edges of X, resp.), together with two mappings o, t : E(X) V (X).
More informationResidual finiteness of infinite amalgamated products of cyclic groups
Journal of Pure and Applied Algebra 208 (2007) 09 097 www.elsevier.com/locate/jpaa Residual finiteness of infinite amalgamated products of cyclic groups V. Metaftsis a,, E. Raptis b a Department of Mathematics,
More informationWinter School on Galois Theory Luxembourg, February INTRODUCTION TO PROFINITE GROUPS Luis Ribes Carleton University, Ottawa, Canada
Winter School on alois Theory Luxembourg, 15-24 February 2012 INTRODUCTION TO PROFINITE ROUPS Luis Ribes Carleton University, Ottawa, Canada LECTURE 2 2.1 ENERATORS OF A PROFINITE ROUP 2.2 FREE PRO-C ROUPS
More information12. Projective modules The blanket assumptions about the base ring k, the k-algebra A, and A-modules enumerated at the start of 11 continue to hold.
12. Projective modules The blanket assumptions about the base ring k, the k-algebra A, and A-modules enumerated at the start of 11 continue to hold. 12.1. Indecomposability of M and the localness of End
More informationSOLVABLE GROUPS OF EXPONENTIAL GROWTH AND HNN EXTENSIONS. Roger C. Alperin
SOLVABLE GROUPS OF EXPONENTIAL GROWTH AND HNN EXTENSIONS Roger C. Alperin An extraordinary theorem of Gromov, [Gv], characterizes the finitely generated groups of polynomial growth; a group has polynomial
More information1.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
More informationCONJUGACY SEPARABILITY OF CERTAIN HNN EXTENSIONS WITH NORMAL ASSOCIATED SUBGROUPS. Communicated by Derek J. S. Robinson. 1.
International Journal of Group Theory ISSN (print): 2251-7650, ISSN (on-line): 2251-7669 Vol 5 No 4 (2016), pp 1-16 c 2016 University of Isfahan wwwtheoryofgroupsir wwwuiacir CONJUGACY SEPARABILITY OF
More information20 Group Homomorphisms
20 Group Homomorphisms In Example 1810(d), we have observed that the groups S 4 /V 4 and S 3 have almost the same multiplication table They have the same structure In this paragraph, we study groups with
More informationBASIC 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
More informationTCC Homological Algebra: Assignment #3 (Solutions)
TCC Homological Algebra: Assignment #3 (Solutions) David Loeffler, d.a.loeffler@warwick.ac.uk 30th November 2016 This is the third of 4 problem sheets. Solutions should be submitted to me (via any appropriate
More informationAbstract Algebra II Groups ( )
Abstract Algebra II Groups ( ) Melchior Grützmann / melchiorgfreehostingcom/algebra October 15, 2012 Outline Group homomorphisms Free groups, free products, and presentations Free products ( ) Definition
More informationMath 120: Homework 6 Solutions
Math 120: Homewor 6 Solutions November 18, 2018 Problem 4.4 # 2. Prove that if G is an abelian group of order pq, where p and q are distinct primes then G is cyclic. Solution. By Cauchy s theorem, G has
More informationits image and kernel. A subgroup of a group G is a non-empty subset K of G such that k 1 k 1
10 Chapter 1 Groups 1.1 Isomorphism theorems Throughout the chapter, we ll be studying the category of groups. Let G, H be groups. Recall that a homomorphism f : G H means a function such that f(g 1 g
More informationON THE ISOMORPHISM CONJECTURE FOR GROUPS ACTING ON TREES
ON THE ISOMORPHISM CONJECTURE FOR GROUPS ACTING ON TREES S.K. ROUSHON Abstract. We study the Fibered Isomorphism conjecture of Farrell and Jones for groups acting on trees. We show that under certain conditions
More informationCourse 311: Abstract Algebra Academic year
Course 311: Abstract Algebra Academic year 2007-08 D. R. Wilkins Copyright c David R. Wilkins 1997 2007 Contents 1 Topics in Group Theory 1 1.1 Groups............................... 1 1.2 Examples of Groups.......................
More informationSolutions of Assignment 10 Basic Algebra I
Solutions of Assignment 10 Basic Algebra I November 25, 2004 Solution of the problem 1. Let a = m, bab 1 = n. Since (bab 1 ) m = (bab 1 )(bab 1 ) (bab 1 ) = ba m b 1 = b1b 1 = 1, we have n m. Conversely,
More informationPRACTICE 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.
More informationTheorems 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
More informationMATH 42041/62041: NONCOMMUTATIVE ALGEBRA UNIVERSITY OF MANCHESTER, AUTUMN Preliminaries and examples.
MATH 42041/62041: NONCOMMUTATIVE ALGEBRA UNIVERSITY OF MANCHESTER, AUTUMN 2016 TOBY STAFFORD 1. Preliminaries and examples. Definition 1.1. A ring R is a set on which two binary operations are defined,
More informationNotes on Geometry of Surfaces
Notes on Geometry of Surfaces Contents Chapter 1. Fundamental groups of Graphs 5 1. Review of group theory 5 2. Free groups and Ping-Pong Lemma 8 3. Subgroups of free groups 15 4. Fundamental groups of
More informationGraphs of groups, Lecture 5
Graphs of groups, Lecture 5 Olga Kharlampovich NYC, Sep. 23 1 / 32 Amalgamated free products Graphs of groups. Definition Let A, B, C be groups and let σ : C A and τc A be injective homomorphisms. If the
More informationDiscrete groups and the thick thin decomposition
CHAPTER 5 Discrete groups and the thick thin decomposition Suppose we have a complete hyperbolic structure on an orientable 3-manifold. Then the developing map D : M H 3 is a covering map, by theorem 3.19.
More informationFrobenius Green functors
UC at Santa Cruz Algebra & Number Theory Seminar 30th April 2014 Topological Motivation: Morava K-theory and finite groups For each prime p and each natural number n there is a 2-periodic multiplicative
More informationThe Cyclic Subgroup Separability of Certain HNN Extensions
BULLETIN of the Malaysian Mathematical Sciences Society http://math.usm.my/bulletin Bull. Malays. Math. Sci. Soc. (2) 29(1) (2006), 111 117 The Cyclic Subgroup Separability of Certain HNN Extensions 1
More informationDISCRETE 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
More informationA Slick Proof of the Unsolvability of the Word Problem for Finitely Presented Groups
A Slick Proof of the Unsolvility of the Word Problem for Finitely Presented Groups Stephen G. Simpson First draft: May 17, 2005 This draft: May 18, 2005 Abstract A famous theorem of P. Novikov 1955 and
More informationHomework #11 Solutions
Homework #11 Solutions p 166, #18 We start by counting the elements in D m and D n, respectively, of order 2. If x D m and x 2 then either x is a flip or x is a rotation of order 2. The subgroup of rotations
More informationSolutions to odd-numbered exercises Peter J. Cameron, Introduction to Algebra, Chapter 3
Solutions to odd-numbered exercises Peter J. Cameron, Introduction to Algebra, Chapter 3 3. (a) Yes; (b) No; (c) No; (d) No; (e) Yes; (f) Yes; (g) Yes; (h) No; (i) Yes. Comments: (a) is the additive group
More informationIndependent generating sets and geometries for symmetric groups
Independent generating sets and geometries for symmetric groups Peter J. Cameron School of Mathematical Sciences Queen Mary, University of London Mile End Road London E1 4NS UK Philippe Cara Department
More informationALGEBRA II: RINGS AND MODULES OVER LITTLE RINGS.
ALGEBRA II: RINGS AND MODULES OVER LITTLE RINGS. KEVIN MCGERTY. 1. RINGS The central characters of this course are algebraic objects known as rings. A ring is any mathematical structure where you can add
More informationHomological Decision Problems for Finitely Generated Groups with Solvable Word Problem
Homological Decision Problems for Finitely Generated Groups with Solvable Word Problem W.A. Bogley Oregon State University J. Harlander Johann Wolfgang Goethe-Universität 24 May, 2000 Abstract We show
More informationD-MATH Algebra I HS 2013 Prof. Brent Doran. Solution 3. Modular arithmetic, quotients, product groups
D-MATH Algebra I HS 2013 Prof. Brent Doran Solution 3 Modular arithmetic, quotients, product groups 1. Show that the functions f = 1/x, g = (x 1)/x generate a group of functions, the law of composition
More information2. Prime and Maximal Ideals
18 Andreas Gathmann 2. Prime and Maximal Ideals There are two special kinds of ideals that are of particular importance, both algebraically and geometrically: the so-called prime and maximal ideals. Let
More informationA CONTINUALLY DESCENDING ENDOMORPHISM OF A FINITELY GENERATED RESIDUALLY FINITE GROUP
A CONTINUALLY DESCENDING ENDOMORPHISM OF A FINITELY GENERATED RESIDUALLY FINITE GROUP DANIEL T. WISE Abstract Let φ : G G be an endomorphism of a finitely generated residually finite group. R. Hirshon
More informationPart II Permutations, Cosets and Direct Product
Part II Permutations, Cosets and Direct Product Satya Mandal University of Kansas, Lawrence KS 66045 USA January 22 8 Permutations Definition 8.1. Let A be a set. 1. A a permuation of A is defined to be
More informationIntroduction 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)
More informationNotas de Aula Grupos Profinitos. Martino Garonzi. Universidade de Brasília. Primeiro semestre 2018
Notas de Aula Grupos Profinitos Martino Garonzi Universidade de Brasília Primeiro semestre 2018 1 Le risposte uccidono le domande. 2 Contents 1 Topology 4 2 Profinite spaces 6 3 Topological groups 10 4
More informationWritten Homework # 2 Solution
Math 516 Fall 2006 Radford Written Homework # 2 Solution 10/09/06 Let G be a non-empty set with binary operation. For non-empty subsets S, T G we define the product of the sets S and T by If S = {s} is
More informationSchool of Mathematics and Statistics. MT5824 Topics in Groups. Problem Sheet I: Revision and Re-Activation
MRQ 2009 School of Mathematics and Statistics MT5824 Topics in Groups Problem Sheet I: Revision and Re-Activation 1. Let H and K be subgroups of a group G. Define HK = {hk h H, k K }. (a) Show that HK
More informationAmin Saied Finitely Presented Metabelian Groups 1
Amin Saied Finitely Presented Metabelian Groups 1 1 Introduction Motivating Question There are uncountably many finitely generated groups, but there are only countably many finitely presented ones. Which
More informationSECTION 9: FIBER BUNDLES AND PRINCIPAL BUNDLES
SECTION 9: FIBER BUNDLES AND PRINCIPAL BUNDLES Definition 1. A fiber bundle with fiber F is a map p: E X with the property that any point x X has a neighbourhood U X for which there exists a homeomorphism
More informationINVARIANTS FOR COMMUTATIVE GROUP ALGEBRAS
INVARIANTS FOR COMMUTATIVE GROUP ALGEBRAS BY WARREN MAY Let K be a commutative ring with identity and G an abelian group. Then the structure of KG as a K-algebra depends to some extent upon the primes
More informationNormal Subgroups and Factor Groups
Normal Subgroups and Factor Groups Subject: Mathematics Course Developer: Harshdeep Singh Department/ College: Assistant Professor, Department of Mathematics, Sri Venkateswara College, University of Delhi
More informationSemilattice Modes II: the amalgamation property
Semilattice Modes II: the amalgamation property Keith A. Kearnes Abstract Let V be a variety of semilattice modes with associated semiring R. We prove that if R is a bounded distributive lattice, then
More informationFINITE ABELIAN GROUPS Amin Witno
WON Series in Discrete Mathematics and Modern Algebra Volume 7 FINITE ABELIAN GROUPS Amin Witno Abstract We detail the proof of the fundamental theorem of finite abelian groups, which states that every
More informationAuthor: Bob Howlett Group representation theory Lecture 1, 28/7/97. Introduction
Author: Bob Howlett Group representation theory Lecture 1, 28/7/97 Introduction This course is a mix of group theory and linear algebra, with probably more of the latter than the former. You may need to
More information(1) A frac = b : a, b A, b 0. We can define addition and multiplication of fractions as we normally would. a b + c d
The Algebraic Method 0.1. Integral Domains. Emmy Noether and others quickly realized that the classical algebraic number theory of Dedekind could be abstracted completely. In particular, rings of integers
More informationMATH FINAL EXAM REVIEW HINTS
MATH 109 - FINAL EXAM REVIEW HINTS Answer: Answer: 1. Cardinality (1) Let a < b be two real numbers and define f : (0, 1) (a, b) by f(t) = (1 t)a + tb. (a) Prove that f is a bijection. (b) Prove that any
More informationSF2729 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
More information1. (7 points)state and PROVE Cayley s Theorem.
Math 546, Final Exam, Fall 2004 The exam is worth 100 points. Write your answers as legibly as you can on the blank sheets of paper provided. Use only one side of each sheet. Take enough space for each
More informationif G permutes the set of its subgroups by conjugation then Stab G (H) = N G (H),
1 0.1 G-sets We introduce a part of the theory of G-sets, suitable for understanding the approach GAP uses to compute with permutation groups, using stabilizer chains. Rotman s book describes other results
More informationExercises MAT2200 spring 2013 Ark 4 Homomorphisms and factor groups
Exercises MAT2200 spring 2013 Ark 4 Homomorphisms and factor groups This Ark concerns the weeks No. (Mar ) and No. (Mar ). Plans until Eastern vacations: In the book the group theory included in the curriculum
More informationANALYSIS OF SMALL GROUPS
ANALYSIS OF SMALL GROUPS 1. Big Enough Subgroups are Normal Proposition 1.1. Let G be a finite group, and let q be the smallest prime divisor of G. Let N G be a subgroup of index q. Then N is a normal
More informationarxiv: v1 [math.gr] 26 Jul 2013
On hopfian cofinite subsemigroups Victor Maltcev and N. Ruškuc arxiv:1307.6929v1 [math.gr] 26 Jul 2013 October 1, 2018 Abstract If a finitely generated semigroup S has a hopfian (meaning: every surjective
More information17 More Groups, Lagrange s Theorem and Direct Products
7 More Groups, Lagrange s Theorem and Direct Products We consider several ways to produce groups. 7. The Dihedral Group The dihedral group D n is a nonabelian group. This is the set of symmetries of a
More informationMATH 101B: ALGEBRA II PART A: HOMOLOGICAL ALGEBRA
MATH 101B: ALGEBRA II PART A: HOMOLOGICAL ALGEBRA These are notes for our first unit on the algebraic side of homological algebra. While this is the last topic (Chap XX) in the book, it makes sense to
More informationON FINITELY GENERATED SUBGROUPS OF A FREE GROUP
ON FINITELY GENERATED SUBGROUPS OF A FREE GROUP A. KARRASS AND D. SOLITAR 1. Introduction. In [2], M. Hall, Jr. proved the following theorem: Let 77 be a finitely generated subgroup of a free group Fand
More informationMATH 101A: ALGEBRA I PART A: GROUP THEORY 39
MAT 101A: ALEBRA I PART A: ROUP TEORY 39 11. Categorical limits (Two lectures by Ivan orozov. Notes by Andrew ainer and Roger Lipsett. [Comments by Kiyoshi].) We first note that what topologists call the
More informationRepresentations. 1 Basic definitions
Representations 1 Basic definitions If V is a k-vector space, we denote by Aut V the group of k-linear isomorphisms F : V V and by End V the k-vector space of k-linear maps F : V V. Thus, if V = k n, then
More informationFinitary Permutation Groups
Finitary Permutation Groups Combinatorics Study Group Notes by Chris Pinnock You wonder and you wonder until you wander out into Infinity, where - if it is to be found anywhere - Truth really exists. Marita
More information5 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
More informationCONSEQUENCES OF THE SYLOW THEOREMS
CONSEQUENCES OF THE SYLOW THEOREMS KEITH CONRAD For a group theorist, Sylow s Theorem is such a basic tool, and so fundamental, that it is used almost without thinking, like breathing. Geoff Robinson 1.
More informationPERFECT SUBGROUPS OF HNN EXTENSIONS
PERFECT SUBGROUPS OF HNN EXTENSIONS F. C. TINSLEY (JOINT WITH CRAIG R. GUILBAULT) Introduction This note includes supporting material for Guilbault s one-hour talk summarized elsewhere in these proceedings.
More informationGroups. 3.1 Definition of a Group. Introduction. Definition 3.1 Group
C H A P T E R t h r e E Groups Introduction Some of the standard topics in elementary group theory are treated in this chapter: subgroups, cyclic groups, isomorphisms, and homomorphisms. In the development
More informationarxiv: v2 [math.gr] 22 Aug 2016
THEORY OF DISGUISED-GROUPS EDUARDO BLANCO GÓMEZ arxiv:1607.07345v2 [math.gr] 22 Aug 2016 Abstract. In this paper we define a new algebraic object: the disguised-groups. We show the main properties of the
More informationSolutions of exercise sheet 4
D-MATH Algebra I HS 14 Prof. Emmanuel Kowalski Solutions of exercise sheet 4 The content of the marked exercises (*) should be known for the exam. 1. Prove the following two properties of groups: 1. Every
More informationarxiv: v1 [math.gr] 5 Aug 2013
A CHARACTERIZATION OF ROOT CLASSES OF GROUPS E. V. Sokolov arxiv:1308.1039v1 [math.gr] 5 Aug 2013 Abstract We prove that a class of groups is root in a sense of K. W. Gruenberg if, and only if, it is closed
More informationNominal Automata. Mikolaj Bojanczyk 1, Bartek Klin 12, Slawomir Lasota 1 1. University of Cambridge. Warsaw University 2. Leicester, 04/03/11
Nominal Automata Mikolaj Bojanczyk 1, Bartek Klin 12, Slawomir Lasota 1 1 Warsaw University 2 University of Cambridge Leicester, 04/03/11 Finite automata An automaton: - set Q of states - alphabet A -
More informationNon-cocompact Group Actions and π 1 -Semistability at Infinity
Non-cocompact Group Actions and π 1 -Semistability at Infinity arxiv:1709.09129v1 [math.gr] 26 Sep 2017 Ross Geoghegan, Craig Guilbault and Michael Mihalik September 27, 2017 Abstract A finitely presented
More information120A 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
More informationGalois theory. Philippe H. Charmoy supervised by Prof Donna M. Testerman
Galois theory Philippe H. Charmoy supervised by Prof Donna M. Testerman Autumn semester 2008 Contents 0 Preliminaries 4 0.1 Soluble groups........................... 4 0.2 Field extensions...........................
More informationBasic Definitions: Group, subgroup, order of a group, order of an element, Abelian, center, centralizer, identity, inverse, closed.
Math 546 Review Exam 2 NOTE: An (*) at the end of a line indicates that you will not be asked for the proof of that specific item on the exam But you should still understand the idea and be able to apply
More informationCATEGORICAL GROTHENDIECK RINGS AND PICARD GROUPS. Contents. 1. The ring K(R) and the group Pic(R)
CATEGORICAL GROTHENDIECK RINGS AND PICARD GROUPS J. P. MAY Contents 1. The ring K(R) and the group Pic(R) 1 2. Symmetric monoidal categories, K(C), and Pic(C) 2 3. The unit endomorphism ring R(C ) 5 4.
More information(5.11) (Second Isomorphism Theorem) If K G and N G, then K/(N K) = NK/N. PF: Verify N HK. Find a homomorphism f : K HK/N with ker(f) = (N K).
Lecture Note of Week 3 6. Normality, Quotients and Homomorphisms (5.7) A subgroup N satisfying any one properties of (5.6) is called a normal subgroup of G. Denote this fact by N G. The homomorphism π
More informationTHE WORD PROBLEM AND RELATED RESULTS FOR GRAPH PRODUCT GROUPS
proceedings of the american mathematical society Volume 82, Number 2, June 1981 THE WORD PROBLEM AND RELATED RESULTS FOR GRAPH PRODUCT GROUPS K. J. HORADAM Abstract. A graph product is the fundamental
More informationTHE EULER CHARACTERISTIC OF A LIE GROUP
THE EULER CHARACTERISTIC OF A LIE GROUP JAY TAYLOR 1 Examples of Lie Groups The following is adapted from [2] We begin with the basic definition and some core examples Definition A Lie group is a smooth
More information4. Permutations - worked solutions Alastair Farrugia MAT (a) What is the length of (abcd)? Its order? Its parity? (abcd) has length 4
4. Permutations - worked solutions Alastair Farrugia MAT 1101 1. (a) What is the length of (abcd)? Its order? Its parity? (abcd) has length 4 [because there are 4 elements in the cycle], and order 4 [because
More informationGroup theory. Victor Reyes. address: Dedicated to Conacyt.
Group theory Victor Reyes E-mail address: Vreyes@gc.edu Dedicated to Conacyt. Abstract. This course was given at GC. Contents Preface vii Part 1. The First Part 1 Chapter 1. The First Chapter 3 1. Universal
More informationFINITE GROUPS IN WHICH EVERY ELEMENT IS CONJUGATE TO ITS INVERSE
PACIFIC JOURNAL OF MATHEMATICS Vol. 28, No. 2, 1969 FINITE GROUPS IN WHICH EVERY ELEMENT IS CONJUGATE TO ITS INVERSE J. L. BERGGREN Let denote the class of all finite groups all of whose irreducible characters
More informationSection II.1. Free Abelian Groups
II.1. Free Abelian Groups 1 Section II.1. Free Abelian Groups Note. This section and the next, are independent of the rest of this chapter. The primary use of the results of this chapter is in the proof
More informationFinite Fields. [Parts from Chapter 16. Also applications of FTGT]
Finite Fields [Parts from Chapter 16. Also applications of FTGT] Lemma [Ch 16, 4.6] Assume F is a finite field. Then the multiplicative group F := F \ {0} is cyclic. Proof Recall from basic group theory
More informationSection 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
More information10. The subgroup subalgebra correspondence. Homogeneous spaces.
10. The subgroup subalgebra correspondence. Homogeneous spaces. 10.1. The concept of a Lie subgroup of a Lie group. We have seen that if G is a Lie group and H G a subgroup which is at the same time a
More informationFUNDAMENTAL GROUPS AND THE VAN KAMPEN S THEOREM
FUNDAMENTAL GROUPS AND THE VAN KAMPEN S THEOREM ANG LI Abstract. In this paper, we start with the definitions and properties of the fundamental group of a topological space, and then proceed to prove Van-
More informationFactorization in Polynomial Rings
Factorization in Polynomial Rings Throughout these notes, F denotes a field. 1 Long division with remainder We begin with some basic definitions. Definition 1.1. Let f, g F [x]. We say that f divides g,
More information12. Hilbert Polynomials and Bézout s Theorem
12. Hilbert Polynomials and Bézout s Theorem 95 12. Hilbert Polynomials and Bézout s Theorem After our study of smooth cubic surfaces in the last chapter, let us now come back to the general theory of
More informationSets, Logic and Categories Solutions to Exercises: Chapter 2
Sets, Logic and Categories Solutions to Exercises: Chapter 2 2.1 Prove that the ordered sum and lexicographic product of totally ordered (resp., well-ordered) sets is totally ordered (resp., well-ordered).
More informationGROUP ACTIONS EMMANUEL KOWALSKI
GROUP ACTIONS EMMANUEL KOWALSKI Definition 1. Let G be a group and T a set. An action of G on T is a map a: G T T, that we denote a(g, t) = g t, such that (1) For all t T, we have e G t = t. (2) For all
More information10. Noether Normalization and Hilbert s Nullstellensatz
10. Noether Normalization and Hilbert s Nullstellensatz 91 10. Noether Normalization and Hilbert s Nullstellensatz In the last chapter we have gained much understanding for integral and finite ring extensions.
More informationLECTURES 11-13: CAUCHY S THEOREM AND THE SYLOW THEOREMS
LECTURES 11-13: CAUCHY S THEOREM AND THE SYLOW THEOREMS Recall Lagrange s theorem says that for any finite group G, if H G, then H divides G. In these lectures we will be interested in establishing certain
More informationSome non-trivial PL knots whose complements are homotopy circles
Some non-trivial PL knots whose complements are homotopy circles Greg Friedman Vanderbilt University May 16, 2006 Dedicated to the memory of Jerry Levine (May 4, 1937 - April 8, 2006) 2000 Mathematics
More informationFUNCTORS AND ADJUNCTIONS. 1. Functors
FUNCTORS AND ADJUNCTIONS Abstract. Graphs, quivers, natural transformations, adjunctions, Galois connections, Galois theory. 1.1. Graph maps. 1. Functors 1.1.1. Quivers. Quivers generalize directed graphs,
More informationMODEL 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
More informationSome practice problems for midterm 2
Some practice problems for midterm 2 Kiumars Kaveh November 14, 2011 Problem: Let Z = {a G ax = xa, x G} be the center of a group G. Prove that Z is a normal subgroup of G. Solution: First we prove Z is
More information