DOCSLIB.ORG

WEEK 8 1. Isomorphism Theorems in Group Theory, There Are Three Main

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
WEEK 8 1. Isomorphism Theorems in Group Theory, There Are Three Main MATH 410 - ABSTRACT ALGEBRA DISCUSSIONS - WEEK 8 CAN OZAN OGUZ 1. Isomorphism Theorems In group theory, there are three main isomorphism theorems. They all follow from the first isomorphism theorem. Let's try to develop some intuition about these theorems and see how to apply them. We already say the first isomorphism theorem in the 6th discussion: First Isomorphism Theorem: Let Φ : G ! H be a group homomorphism. Then G=ker(Φ) ' Im(Φ) If you just consider the map Φ, it doesn't have to be injective or surjective. To ensure surjectivity, we restrict the target to the image of Φ. Injectivity is a bigger problem. Recall that a homomorphism is injective if and only if its kernel is trivial. But it may be the case that kerΦ contains many elements. Our strategy is to consider another group where ker(Φ) becomes a single element. This is exactly the quotient group G=ker(Φ). ker(Φ) G H 1G 1H Im(Φ) g1 h1 g 2 g3 g4 g5 G=ker(Φ) 1G=ker(Φ) Second Isomorphism Theorem: Let K; H ≤ G. Under some assumtions, we have HK=H ' K=(K \ H) The assumptions we need are to make sure we have a group on the right hand side, and on the left hand side. For example for two subgroups H; K, their product HK is not a group in general. We need one of them to be normal. Also we will quotient out by H to get a group, hence H should be normal in G. You should check if this guarantees K \ H is normal in K. Date: October 12th, 2017. 1 2 CAN OZAN OGUZ Let's just focus on the right hand side of the equation first: HK=H. We multiply K by H, and then divide by H. If we were doing this with number, they would just cancel each other. With sets and groups, it is a bit different. The reason is that intersection of H and K doesn't contribute to the product HK. For example, if we take H = K, then HK = KK = K, and we didn't gain anything by multiplication. However we will divide by H regardless of how big the product became. If we had H \ K = 1, then second isomorphism theorem tells us HK=H ' K , so multiplication and division cancel out. But with a non-trivial intersection, we need to quotient K by K \ H. Below is a diagrammatic picture of what is going on. Remember H is normal subgroup of G, so I will draw it as a vertical rectangle all the way to the left. It will partition G into its cosets. However K doesn't need to be normal. So I will draw it as a horizontal rectanlge. It has to contain 1G. H aH bH cH G H \ K h0 = k00 1G k1 k2 K h1 h1k1 h2 h2k2 HK In the above picture, you can see that H partitions HK into cosets just as H \K partitions K into cosets. This is exactly the content of the second isomorphism theorem. Multiplication of cosets of H in HK has the same multiplication structure as cosets of H \ K in K. Example Let G = Z, H = 6Z, K = 8Z. Since G is abelian, H is a normal subgroup. In general, K doesn't need to be normal in G to apply the second isomorphism theorem. In our case, K is also normal since every subgroup of an abelian group is normal. Let's start by understanding HK and H \ K: HK = 6Z8Z = fa + b : a 2 6Z; b 2 8Zg = f6k + 8` : k; ` 2 Zg = fgcd(6; 8)n : n 2 Zg = gcd(6; 8)Z since we saw in chapter one that the linear combinations of two integers is multiples of their gcd. Also H \ K = 6Z \ 8Z = lcm(6; 8)Z Therefore by second isomorphism theorem, we get an isomorphism gcd(6; 8)Z=6Z ' 8Z=lcm(6; 8)Z MATH 410 - ABSTRACT ALGEBRA DISCUSSIONS - WEEK 8 3 The two groups above are isomorphic, in particular have the same order: 6 lcm(6; 8) = gcd(6; 8) 8 or gcd(6; 8)lcm(6; 8) = 6 × 8 Of course this formula works for any pair of positive integers. Third Isomorphism Theorem Let H; K ≤ G. If we assume the above ex- pressions are groups, then . G=K H=K ' G=H It is easy to see that we need H and K to be normal subgroups, and moreover we need K ≤ H. Check that these assumptions are enough, that is with these assumptions, K is normal in H and H=K is normal in G=K. The interpretation of third isomorphism theorem is simpler. If we quotient out the nominator and denominator with K, they cancel. Exercise: Try to understand the above statement by drawing a diagram for G. Remember, H should partition G, and K should partition both H and G. Example Let G = R, H = Q and K = Z. By third isomorphism theorem, we have . R=Z Q=Z ' R=Q We saw earlier that R=Z gives us a circle via the homomorphism : R ! R2, f(θ) = (cos(2πθ); sin(2πθ)). So we have 1. S Q=Z ' R=Q We don't have an understanding of the groups Q=Z and R=Q yet, however if we understand one of them, third isomorphism theorem is going to let us understand the under. Also notice that the group Q=Z is a normal subgroup of S1. Correspondance Theorem: All isomorphism theorems require taking a quo- tient by a normal subgroup. Taking the quotient results in a smaller group. So these isomorphism theorems relate larger groups to smaller groups via quotients. Then we should think about the following question: Question: By studying G=H, how much information do we get about G? Suppose we have a chain of subgroups of G: 4 CAN OZAN OGUZ G G=H ≤ K1 ≤ K2 ≤ K3 ≤ H 1G=H ≤ K4 The image of H under the quotient map is going to be the identity element of the quotient group. Therefore you can easily tell that there isn't enough space left for the image of K4 under the quotient map. But for K3 the situation is different. It's image will be K3=H. This is a subgroup of G=H. Similarly K1=H and K2=H will be subgroups of G=H. They will have the same inclusion relation: G G=H ≤ ≤ K1 K1=H ≤ ≤ K2 K2=H ≤ ≤ K3 K3=H ≤ ≤ H 1G=H ≤ K4 This is the first part of the correspondance theorem. We have an inclusion preserving bijection between the sets bijection fSubgroups of G contatining Hg −−−−!fSubgroups of G=Hg Furthermore, Ki is normal in G if and only if Ki=H is normal in G. Moreover we have [G : Ki] = [G=H : Ki=H]. So we can study subgroups of G bu studying subgroup of G=H. Example Let G = GLn(R), the group of n by n invertible matrices. Recall that ∗ the determinant map was a surjective group homomorphism from GLn(R) to R , with kernel the special linear group SLn(R). Then by first isomorphism theorem, we get ∗ GLn(R)=SLn(R) ' R and R∗ is an abelian group. Therefore all of its subgroups are normal. This tells us an important fact about subgroups of GLn(R) containing SLn(R): They are normal in GLn(R) by the second part of correspondance theorem. MATH 410 - ABSTRACT ALGEBRA DISCUSSIONS - WEEK 8 5 2. Direct Products of Groups Now we will focus our attention to an important construction in group theory: Direct product of two groups. This is going to be a very valuable tool to obtain new groups from old ones, providing us many new examples to work on. The construction is simple and relies on the cartesian product of sets. Let (G; ∗) and (H; #) be two groups. Then G × H = f(g; h): g 2 G; h 2 Hg is the cartesian product the sets G and H. We can turn G × H into a group via: (g1; h1):G×H (g2; h2) := (g1 ∗ g2; h1#h2) Remark: G is not a subgroup of G × H since it is not a subset of it. Elements of G × H are pairs, and elements of G are not. However, the group G is isomorphic to the group G × f1H g, which is a subgroup of G × H. So we will say G × H has a subgroup isomorphic to G. Example Z=3Z × Z=5Z = fa(mod 3; b(mod 5) : a; b 2 Zg ' Z=15Z The last isomorphism comes from Chienese Remainder theorem: there is a unique integer modulo 15 which is a modulo 3 and b modulo 5. More generally we have if (m; n) = 1, then Z=nZ × Z=mZ ' Z=mnZ. Example Z=2Z × Z=2Z 6' Z=4Z. This is easy to see by comparing elements of order 4 on both sides. Z=4Z is a cyclic group generated by an element of order 4, however all elements of Z=2Z × Z=2Z have order two. In general, when m and n are not coprime, we have Z=nZ × Z=mZ 6' Z=nmZ An important result in group theory is the structure theorem for all finite abelian groups. You don't need to know this result for now, but I am writing it down to show importance of direct products: r1 r2 rk Theorem Any finite abelian group is of the form Z=p1 Z × Z=p2 Z × · · · × Z=pk Z where pi are distinc primes, ri are positive integers.
Load more

Recommended publications
  • Chapter 4. Homomorphisms and Isomorphisms of Groups
    Chapter 4. Homomorphisms and Isomorphisms of Groups 4.1 Note: We recall the following terminology. Let X and Y be sets. When we say that f is a function or a map from X to Y , written f : X ! Y , we mean that for every x 2 X there exists a unique corresponding element y = f(x) 2 Y . The set X is called the domain of f and the range or image of f is the set Image(f) = f(X) = f(x) x 2 X . For a set A ⊆ X, the image of A under f is the set f(A) = f(a) a 2 A and for a set −1 B ⊆ Y , the inverse image of B under f is the set f (B) = x 2 X f(x) 2 B . For a function f : X ! Y , we say f is one-to-one (written 1 : 1) or injective when for every y 2 Y there exists at most one x 2 X such that y = f(x), we say f is onto or surjective when for every y 2 Y there exists at least one x 2 X such that y = f(x), and we say f is invertible or bijective when f is 1:1 and onto, that is for every y 2 Y there exists a unique x 2 X such that y = f(x). When f is invertible, the inverse of f is the function f −1 : Y ! X defined by f −1(y) = x () y = f(x). For f : X ! Y and g : Y ! Z, the composite g ◦ f : X ! Z is given by (g ◦ f)(x) = g(f(x)).
    [Show full text]
  • The Isomorphism Theorems
    Lecture 4.5: The isomorphism theorems Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 4120, Modern Algebra M. Macauley (Clemson) Lecture 4.5: The isomorphism theorems Math 4120, Modern Algebra 1 / 10 The Isomorphism Theorems The Fundamental Homomorphism Theorem (FHT) is the first of four basic theorems about homomorphism and their structure. These are commonly called \The Isomorphism Theorems": First Isomorphism Theorem: \Fundamental Homomorphism Theorem" Second Isomorphism Theorem: \Diamond Isomorphism Theorem" Third Isomorphism Theorem: \Freshman Theorem" Fourth Isomorphism Theorem: \Correspondence Theorem" All of these theorems have analogues in other algebraic structures: rings, vector spaces, modules, and Lie algebras, to name a few. In this lecture, we will summarize the last three isomorphism theorems and provide visual pictures for each. We will prove one, outline the proof of another (homework!), and encourage you to try the (very straightforward) proofs of the multiple parts of the last one. Finally, we will introduce the concepts of a commutator and commutator subgroup, whose quotient yields the abelianation of a group. M. Macauley (Clemson) Lecture 4.5: The isomorphism theorems Math 4120, Modern Algebra 2 / 10 The Second Isomorphism Theorem Diamond isomorphism theorem Let H ≤ G, and N C G. Then G (i) The product HN = fhn j h 2 H; n 2 Ng is a subgroup of G. (ii) The intersection H \ N is a normal subgroup of G. HN y EEE yyy E (iii) The following quotient groups are isomorphic: HN E EE yy HN=N =∼ H=(H \ N) E yy H \ N Proof (sketch) Define the following map φ: H −! HN=N ; φ: h 7−! hN : If we can show: 1.
    [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]
  • Categories, Functors, and Natural Transformations I∗
    Lecture 2: Categories, functors, and natural transformations I∗ Nilay Kumar June 4, 2014 (Meta)categories We begin, for the moment, with rather loose definitions, free from the technicalities of set theory. Definition 1. A metagraph consists of objects a; b; c; : : :, arrows f; g; h; : : :, and two operations, as follows. The first is the domain, which assigns to each arrow f an object a = dom f, and the second is the codomain, which assigns to each arrow f an object b = cod f. This is visually indicated by f : a ! b. Definition 2. A metacategory is a metagraph with two additional operations. The first is the identity, which assigns to each object a an arrow Ida = 1a : a ! a. The second is the composition, which assigns to each pair g; f of arrows with dom g = cod f an arrow g ◦ f called their composition, with g ◦ f : dom f ! cod g. This operation may be pictured as b f g a c g◦f We require further that: composition is associative, k ◦ (g ◦ f) = (k ◦ g) ◦ f; (whenever this composition makese sense) or diagrammatically that the diagram k◦(g◦f)=(k◦g)◦f a d k◦g f k g◦f b g c commutes, and that for all arrows f : a ! b and g : b ! c, we have 1b ◦ f = f and g ◦ 1b = g; or diagrammatically that the diagram f a b f g 1b g b c commutes. ∗This talk follows [1] I.1-4 very closely. 1 Recall that a diagram is commutative when, for each pair of vertices c and c0, any two paths formed from direct edges leading from c to c0 yield, by composition of labels, equal arrows from c to c0.
    [Show full text]
  • Irreducible Representations of Finite Monoids
    U.U.D.M. Project Report 2019:11 Irreducible representations of finite monoids Christoffer Hindlycke Examensarbete i matematik, 30 hp Handledare: Volodymyr Mazorchuk Examinator: Denis Gaidashev Mars 2019 Department of Mathematics Uppsala University Irreducible representations of finite monoids Christoffer Hindlycke Contents Introduction 2 Theory 3 Finite monoids and their structure . .3 Introductory notions . .3 Cyclic semigroups . .6 Green’s relations . .7 von Neumann regularity . 10 The theory of an idempotent . 11 The five functors Inde, Coinde, Rese,Te and Ne ..................... 11 Idempotents and simple modules . 14 Irreducible representations of a finite monoid . 17 Monoid algebras . 17 Clifford-Munn-Ponizovski˘ıtheory . 20 Application 24 The symmetric inverse monoid . 24 Calculating the irreducible representations of I3 ........................ 25 Appendix: Prerequisite theory 37 Basic definitions . 37 Finite dimensional algebras . 41 Semisimple modules and algebras . 41 Indecomposable modules . 42 An introduction to idempotents . 42 1 Irreducible representations of finite monoids Christoffer Hindlycke Introduction This paper is a literature study of the 2016 book Representation Theory of Finite Monoids by Benjamin Steinberg [3]. As this book contains too much interesting material for a simple master thesis, we have narrowed our attention to chapters 1, 4 and 5. This thesis is divided into three main parts: Theory, Application and Appendix. Within the Theory chapter, we (as the name might suggest) develop the necessary theory to assist with finding irreducible representations of finite monoids. Finite monoids and their structure gives elementary definitions as regards to finite monoids, and expands on the basic theory of their structure. This part corresponds to chapter 1 in [3]. The theory of an idempotent develops just enough theory regarding idempotents to enable us to state a key result, from which the principal result later follows almost immediately.
    [Show full text]
  • Limits Commutative Algebra May 11 2020 1. Direct Limits Definition 1
    Limits Commutative Algebra May 11 2020 1. Direct Limits Definition 1: A directed set I is a set with a partial order ≤ such that for every i; j 2 I there is k 2 I such that i ≤ k and j ≤ k. Let R be a ring. A directed system of R-modules indexed by I is a collection of R modules fMi j i 2 Ig with a R module homomorphisms µi;j : Mi ! Mj for each pair i; j 2 I where i ≤ j, such that (i) for any i 2 I, µi;i = IdMi and (ii) for any i ≤ j ≤ k in I, µi;j ◦ µj;k = µi;k. We shall denote a directed system by a tuple (Mi; µi;j). The direct limit of a directed system is defined using a universal property. It exists and is unique up to a unique isomorphism. Theorem 2 (Direct limits). Let fMi j i 2 Ig be a directed system of R modules then there exists an R module M with the following properties: (i) There are R module homomorphisms µi : Mi ! M for each i 2 I, satisfying µi = µj ◦ µi;j whenever i < j. (ii) If there is an R module N such that there are R module homomorphisms νi : Mi ! N for each i and νi = νj ◦µi;j whenever i < j; then there exists a unique R module homomorphism ν : M ! N, such that νi = ν ◦ µi. The module M is unique in the sense that if there is any other R module M 0 satisfying properties (i) and (ii) then there is a unique R module isomorphism µ0 : M ! M 0.
    [Show full text]
  • Homomorphisms and Isomorphisms
    Lecture 4.1: Homomorphisms and isomorphisms Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 4120, Modern Algebra M. Macauley (Clemson) Lecture 4.1: Homomorphisms and isomorphisms Math 4120, Modern Algebra 1 / 13 Motivation Throughout the course, we've said things like: \This group has the same structure as that group." \This group is isomorphic to that group." However, we've never really spelled out the details about what this means. We will study a special type of function between groups, called a homomorphism. An isomorphism is a special type of homomorphism. The Greek roots \homo" and \morph" together mean \same shape." There are two situations where homomorphisms arise: when one group is a subgroup of another; when one group is a quotient of another. The corresponding homomorphisms are called embeddings and quotient maps. Also in this chapter, we will completely classify all finite abelian groups, and get a taste of a few more advanced topics, such as the the four \isomorphism theorems," commutators subgroups, and automorphisms. M. Macauley (Clemson) Lecture 4.1: Homomorphisms and isomorphisms Math 4120, Modern Algebra 2 / 13 A motivating example Consider the statement: Z3 < D3. Here is a visual: 0 e 0 7! e f 1 7! r 2 2 1 2 7! r r2f rf r2 r The group D3 contains a size-3 cyclic subgroup hri, which is identical to Z3 in structure only. None of the elements of Z3 (namely 0, 1, 2) are actually in D3. When we say Z3 < D3, we really mean is that the structure of Z3 shows up in D3.
    [Show full text]
  • Friday September 20 Lecture Notes
    Friday September 20 Lecture Notes 1 Functors Definition Let C and D be categories. A functor (or covariant) F is a function that assigns each C 2 Obj(C) an object F (C) 2 Obj(D) and to each f : A ! B in C, a morphism F (f): F (A) ! F (B) in D, satisfying: For all A 2 Obj(C), F (1A) = 1FA. Whenever fg is defined, F (fg) = F (f)F (g). e.g. If C is a category, then there exists an identity functor 1C s.t. 1C(C) = C for C 2 Obj(C) and for every morphism f of C, 1C(f) = f. For any category from universal algebra we have \forgetful" functors. e.g. Take F : Grp ! Cat of monoids (·; 1). Then F (G) is a group viewed as a monoid and F (f) is a group homomorphism f viewed as a monoid homomor- phism. e.g. If C is any universal algebra category, then F : C! Sets F (C) is the underlying sets of C F (f) is a morphism e.g. Let C be a category. Take A 2 Obj(C). Then if we define a covariant Hom functor, Hom(A; ): C! Sets, defined by Hom(A; )(B) = Hom(A; B) for all B 2 Obj(C) and f : B ! C, then Hom(A; )(f) : Hom(A; B) ! Hom(A; C) with g 7! fg (we denote Hom(A; ) by f∗). Let us check if f∗ is a functor: Take B 2 Obj(C). Then Hom(A; )(1B) = (1B)∗ : Hom(A; B) ! Hom(A; B) and for g 2 Hom(A; B), (1B)∗(g) = 1Bg = g.
    [Show full text]
  • Contents 3 Homomorphisms, Ideals, and Quotients
    Ring Theory (part 3): Homomorphisms, Ideals, and Quotients (by Evan Dummit, 2018, v. 1.01) Contents 3 Homomorphisms, Ideals, and Quotients 1 3.1 Ring Isomorphisms and Homomorphisms . 1 3.1.1 Ring Isomorphisms . 1 3.1.2 Ring Homomorphisms . 4 3.2 Ideals and Quotient Rings . 7 3.2.1 Ideals . 8 3.2.2 Quotient Rings . 9 3.2.3 Homomorphisms and Quotient Rings . 11 3.3 Properties of Ideals . 13 3.3.1 The Isomorphism Theorems . 13 3.3.2 Generation of Ideals . 14 3.3.3 Maximal and Prime Ideals . 17 3.3.4 The Chinese Remainder Theorem . 20 3.4 Rings of Fractions . 21 3 Homomorphisms, Ideals, and Quotients In this chapter, we will examine some more intricate properties of general rings. We begin with a discussion of isomorphisms, which provide a way of identifying two rings whose structures are identical, and then examine the broader class of ring homomorphisms, which are the structure-preserving functions from one ring to another. Next, we study ideals and quotient rings, which provide the most general version of modular arithmetic in a ring, and which are fundamentally connected with ring homomorphisms. We close with a detailed study of the structure of ideals and quotients in commutative rings with 1. 3.1 Ring Isomorphisms and Homomorphisms • We begin our study with a discussion of structure-preserving maps between rings. 3.1.1 Ring Isomorphisms • We have encountered several examples of rings with very similar structures. • For example, consider the two rings R = Z=6Z and S = (Z=2Z) × (Z=3Z).
    [Show full text]
  • 7.3 Isomorphisms and Composition
    392 Linear Transformations 7.3 Isomorphisms and Composition Often two vector spaces can consist of quite different types of vectors but, on closer examination, turn out to be the same underlying space displayed in different symbols. For example, consider the spaces 2 R = (a, b) a, b R and P1 = a + bx a, b R { | ∈ } { | ∈ } Compare the addition and scalar multiplication in these spaces: (a, b)+(a1, b1)=(a + a1, b + b1) (a + bx)+(a1 + b1x)=(a + a1)+(b + b1)x r(a, b)=(ra, rb) r(a + bx)=(ra)+(rb)x Clearly these are the same vector space expressed in different notation: if we change each (a, b) in R2 to 2 a + bx, then R becomes P1, complete with addition and scalar multiplication. This can be expressed by 2 noting that the map (a, b) a + bx is a linear transformation R P1 that is both one-to-one and onto. In this form, we can describe7→ the general situation. → Definition 7.4 Isomorphic Vector Spaces A linear transformation T : V W is called an isomorphism if it is both onto and one-to-one. The vector spaces V and W are said→ to be isomorphic if there exists an isomorphism T : V W, and → we write V ∼= W when this is the case. Example 7.3.1 The identity transformation 1V : V V is an isomorphism for any vector space V . → Example 7.3.2 T If T : Mmn Mnm is defined by T (A) = A for all A in Mmn, then T is an isomorphism (verify).
    [Show full text]
  • Monomorphism - Wikipedia, the Free Encyclopedia
    Monomorphism - Wikipedia, the free encyclopedia http://en.wikipedia.org/wiki/Monomorphism Monomorphism From Wikipedia, the free encyclopedia In the context of abstract algebra or universal algebra, a monomorphism is an injective homomorphism. A monomorphism from X to Y is often denoted with the notation . In the more general setting of category theory, a monomorphism (also called a monic morphism or a mono) is a left-cancellative morphism, that is, an arrow f : X → Y such that, for all morphisms g1, g2 : Z → X, Monomorphisms are a categorical generalization of injective functions (also called "one-to-one functions"); in some categories the notions coincide, but monomorphisms are more general, as in the examples below. The categorical dual of a monomorphism is an epimorphism, i.e. a monomorphism in a category C is an epimorphism in the dual category Cop. Every section is a monomorphism, and every retraction is an epimorphism. Contents 1 Relation to invertibility 2 Examples 3 Properties 4 Related concepts 5 Terminology 6 See also 7 References Relation to invertibility Left invertible morphisms are necessarily monic: if l is a left inverse for f (meaning l is a morphism and ), then f is monic, as A left invertible morphism is called a split mono. However, a monomorphism need not be left-invertible. For example, in the category Group of all groups and group morphisms among them, if H is a subgroup of G then the inclusion f : H → G is always a monomorphism; but f has a left inverse in the category if and only if H has a normal complement in G.
    [Show full text]
  • Classifying Categories the Jordan-Hölder and Krull-Schmidt-Remak Theorems for Abelian Categories
    U.U.D.M. Project Report 2018:5 Classifying Categories The Jordan-Hölder and Krull-Schmidt-Remak Theorems for Abelian Categories Daniel Ahlsén Examensarbete i matematik, 30 hp Handledare: Volodymyr Mazorchuk Examinator: Denis Gaidashev Juni 2018 Department of Mathematics Uppsala University Classifying Categories The Jordan-Holder¨ and Krull-Schmidt-Remak theorems for abelian categories Daniel Ahlsen´ Uppsala University June 2018 Abstract The Jordan-Holder¨ and Krull-Schmidt-Remak theorems classify finite groups, either as direct sums of indecomposables or by composition series. This thesis defines abelian categories and extends the aforementioned theorems to this context. 1 Contents 1 Introduction3 2 Preliminaries5 2.1 Basic Category Theory . .5 2.2 Subobjects and Quotients . .9 3 Abelian Categories 13 3.1 Additive Categories . 13 3.2 Abelian Categories . 20 4 Structure Theory of Abelian Categories 32 4.1 Exact Sequences . 32 4.2 The Subobject Lattice . 41 5 Classification Theorems 54 5.1 The Jordan-Holder¨ Theorem . 54 5.2 The Krull-Schmidt-Remak Theorem . 60 2 1 Introduction Category theory was developed by Eilenberg and Mac Lane in the 1942-1945, as a part of their research into algebraic topology. One of their aims was to give an axiomatic account of relationships between collections of mathematical structures. This led to the definition of categories, functors and natural transformations, the concepts that unify all category theory, Categories soon found use in module theory, group theory and many other disciplines. Nowadays, categories are used in most of mathematics, and has even been proposed as an alternative to axiomatic set theory as a foundation of mathematics.[Law66] Due to their general nature, little can be said of an arbitrary category.
    [Show full text]