DOCSLIB.ORG

Even More True-False Questions

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Even More True-False Questions Math 412 Practice True/False Questions By the amazing Winter 2018 Sections 1 and 21 (1) Let N be a subgroup of G and let K be a normal subgroup of N. Then K is normal in G. Solution. False. Take N = hx; yi inside G = D4 and take K = hxi. (2) Let n 2 N. Then [Sn;An] = 2. Solution. True- Several ways to see this. Here is one: consider the map φ : Sn ! Z2, σ 7! sign(σ). which takes add permu- tations to 1 and even permutations to 0. This is a surjective group homomorphism with kernel An. Applying FIT, we get ∼ Sn=An = Z2, hence jSn=Anj = [Sn : An] = 2. (3) Suppose N is a normal subgroup of G. Then N ⊆ Z(G). Solution. False. Consider R = hr2i, the group of rotations in D4. This is a normal subgroup of D4 and is not contained in 2 the centre of D4, which is fe; r g. (4) Let G be a group acting on a set X. If O(x) = O(y) for all x; y 2 X, then G is cyclic. Solution. False- Consider the natural action of Sn on f1 ··· ng. This action has a single orbit but Sn is not cyclic for n > 2. (5) Let G be a group and let H be a nonempty finite subset of G that is closed under the operation of G. Then H is a subgroup. Solution. True- See Theorem 7.12. (6) Let G be a group and let H be a nonempty subset of G that is closed under the operation of G. Then H is a subgroup. Solution. False- Consider f2a j a 2 Z; a 6= 0g ⊂ Z. But it is not a subgroup. (7) Let K be a subgroup of G such that ab = ba for all a; b 2 K. Then K is a normal subgroup of G. Solution. False- Consider K = hxi in D4. K is abelian but not normal. (8) Any group automorphism of the group Q under addition is of the form x 7! qx for some q 2 Q. Solution. True- This is more of a short proof question. To prove this suppose φ is an arbitrary automorphism pf (Q; +). 1Alison Elgass, Charlemagne McHaffie, Michael McMain, Ian Cleary, Tiffany Liu, Yuhan Liang, Daoheng Niu, Thomas Eberle, Ryan Yao, Shihui Wang, Paulina Czarnecki, Kendra Robbins, Haidan Tang, Rithvik Pasumarty, Rupal Nigam, Sahil Farishta, Carolyn Evans, Kristin Dona, Tianyu (Justin) Yang, John Koenig, Julia Rakas, Bennet Sakelaris, Xiang Li (Olivia), Ally Young, Yujia Xie, Steven Schaefer, Jenna King 1 2 Then φ(1) = q for some q 2 Q. Hence, φ(−1) = −φ(1) = −q and consequently we can argue that φ(n) = n for all integer n. Observe that for every integer b, q = φ(1) = φ(b=b) = φ(b(1=b)) = bφ(1=b). So, φ(1=b) = q=b. Now let a=b 2 Q. Then φ(a=b) = φ(a(1=b)) = aφ(1=b) = aq=b = q(a=b). (9) All non-trivial proper subgroups of (R; +) are cyclic. Solution. False- There are many counter examples. Here is one: consider the addition group of rational numbers. It is not cyclic (why?) and it is a proper non-trivial subgroup of R. (10) Some abelian group of order 102 cannot have a subgroup of order 18. Solution. True- 18 doesn't divide 102. So Lagrange doesn't let us to have such subgroup. (11) A subgroup H of a group G is a normal subgroup if and only if the number of left cosets of H is equal to the number of right cosets of H. Solution. False- Number of right and left cosets are equal for any subgroup. Any non-normal subgroup serves as counter example. My favourite is hxi in D4. (12) Let R be a ring. Then (a + b)2 = a2 + 2ab + b2 for all a; b 2 R. Solution. False- Any two non-commuting elements in an non abelian ring serves as a counter example. Here is one: Take 1 0 0 1 and in M ( ). 0 0 0 0 2 R (13) There exists a subgroup G of S5 that is isomorphic to the group Z3 × Z3. (14) A group of order 8 must contain an element of order 2. Solution. True- If we use the structure theorem, we will see that a group of order 8 is one of the following: Z2 × Z2 × Z2, Z4 × Z2 and Z8. Each of these groups have an element of order 2: take (1; 0; 0), (0; 1) and 4 respectively. (15) If a non-trivial group has an action on itself by conjugation, then there exists at least one fixed point. Solution. True- The identity is fixed by conjugation. (16) The only generators of an additive cyclic group Z, are +1 and −1. Solution. True-because hni for any n 2 Z only contains mul- tiples of n, hence in order to generate the entire Z, n should be ±1. (17) If all subgroups of a group G are normal, the group is abelian. 3 Solution. False- One example I can think of is Q8, the group of quaternions, which we met in a problem set, we almost proved that all the subgroups are normal (one needs to show that there are only one subgroup of a given order ). (18) If G is a cyclic group, every element of G is a generator for G. Solution. False- Take [4] 2 Z8. (19) The order of the intersection of two subgroups is the least com- mon multiple of the orders of each of the subgroups. Solution. False- Take h(12)i and h(34)i in S4. They intersect only at identity, whereas the least common multiple of their order is 2. (20) The intersection of a subgroup K of G with a normal subgroup N is normal in K. Solution. True- Take ghg−1 2 g(K \ N)g−1, for g 2 K. Since h 2 N, and N is normal in G, and g 2 K ⊂ G, then ghg−1 is in N. On the other hand K is closed under multiplication so ghg−1 is in K. Hence it is in the K \ N. (21) Let G be a group. Let a and b be elements in G where a has order m and b has order n. The order of ab divides mn. Solution. (22) Z3 × Z5 is isomorphic to Z15. Solution. True- If we use the structure theorem, we can see that there is only one abelian group of order 3 × 5 = 15 up to isomorphic and that is Z3 × Z5. So Z15 must be isomorphic to Z3 × Z5. Without the structure theorem, consider (1; 1) 2 ∼ Z3 × Z5 (abusing notation), it has order 15 so Z15 = h(1; 1)i = Z3 × Z5. (23) Let N be a subgroup of Sn such that the order of N is odd. N is a subgroup of An.T (24) All ideals of Z are both prime and maximal. F (25) f : R ! R× which takes x 7! 2x by the function f(x) = 2x is a group isomorphism. F (not surjective) (p−1) (26) In Zp, let p be prime and a nonzero. Then a = 1. Solution. True- This is Fermat's little theorem. An easy proof is to note that the group of units of Zp is of order p − 1 and the order of every element in the group divides the order of the group by Lagrange. (27) For every n > 2, can find a group G having n elements not isomorphic to group Zn. Solution. True- If n is prime, then we know that there is only one group of prime order and that is isomorphic to Zn. But if n 4 is not prime that is not true. For example take n = 4. Z2 × Z2 is not isomorphic to Z4. × (28) Z37 is isomorphic to Z36. Solution. True- Both are cyclic groups with order 36. (29) A group with order 62 has an element with order above 32, then the group is a cyclic group. Solution. True- the order of an element in a group divides the order of the group; if a natural number is greater that 32 and divides 62, it is equal to 62. A group with an element of the order of the group is cyclic. (30) The largest order of the element in the group (Zn × Zm; +) is max(m; n). Solution. false- when m and n are coprime, this group is cyclic of order m × n. (31) Let set X has 20 elements and a group G of order 12 acts set X, it is possible for X to contain only two orbits. Solution. False- The orbits of an action partition X. If there are only twi orbits, their cardinality should add up to 20. On the other hand, cardinality of each orbit divides the order of the group by the orbit stabilizer, i.e, the possibilities are 1; 2; 3; 4; 6; 12. No two if these add up to 20. (32) Sm is a normal subgroup for any Sn where n ≥ m. Solution. false- Sm is a subgroup of Sn where n ≥ m. However it is usually not normal. Example: take S4, we know all its non- trivial normal subgroups are A4 and a group we met in one of the problem sets (isomorphic to Klein group). (33) It is possible for integers to act on the set of whole numbers Solution. True- Consider the map Z × R ! R, sending (n; x) to n + x.
Load more

Recommended publications
  • Complete Objects in Categories
    Complete objects in categories James Richard Andrew Gray February 22, 2021 Abstract We introduce the notions of proto-complete, complete, complete˚ and strong-complete objects in pointed categories. We show under mild condi- tions on a pointed exact protomodular category that every proto-complete (respectively complete) object is the product of an abelian proto-complete (respectively complete) object and a strong-complete object. This to- gether with the observation that the trivial group is the only abelian complete group recovers a theorem of Baer classifying complete groups. In addition we generalize several theorems about groups (subgroups) with trivial center (respectively, centralizer), and provide a categorical explana- tion behind why the derivation algebra of a perfect Lie algebra with trivial center and the automorphism group of a non-abelian (characteristically) simple group are strong-complete. 1 Introduction Recall that Carmichael [19] called a group G complete if it has trivial cen- ter and each automorphism is inner. For each group G there is a canonical homomorphism cG from G to AutpGq, the automorphism group of G. This ho- momorphism assigns to each g in G the inner automorphism which sends each x in G to gxg´1. It can be readily seen that a group G is complete if and only if cG is an isomorphism. Baer [1] showed that a group G is complete if and only if every normal monomorphism with domain G is a split monomorphism. We call an object in a pointed category complete if it satisfies this latter condi- arXiv:2102.09834v1 [math.CT] 19 Feb 2021 tion.
    [Show full text]
  • Category of G-Groups and Its Spectral Category
    Communications in Algebra ISSN: 0092-7872 (Print) 1532-4125 (Online) Journal homepage: http://www.tandfonline.com/loi/lagb20 Category of G-Groups and its Spectral Category María José Arroyo Paniagua & Alberto Facchini To cite this article: María José Arroyo Paniagua & Alberto Facchini (2017) Category of G-Groups and its Spectral Category, Communications in Algebra, 45:4, 1696-1710, DOI: 10.1080/00927872.2016.1222409 To link to this article: http://dx.doi.org/10.1080/00927872.2016.1222409 Accepted author version posted online: 07 Oct 2016. Published online: 07 Oct 2016. Submit your article to this journal Article views: 12 View related articles View Crossmark data Full Terms & Conditions of access and use can be found at http://www.tandfonline.com/action/journalInformation?journalCode=lagb20 Download by: [UNAM Ciudad Universitaria] Date: 29 November 2016, At: 17:29 COMMUNICATIONS IN ALGEBRA® 2017, VOL. 45, NO. 4, 1696–1710 http://dx.doi.org/10.1080/00927872.2016.1222409 Category of G-Groups and its Spectral Category María José Arroyo Paniaguaa and Alberto Facchinib aDepartamento de Matemáticas, División de Ciencias Básicas e Ingeniería, Universidad Autónoma Metropolitana, Unidad Iztapalapa, Mexico, D. F., México; bDipartimento di Matematica, Università di Padova, Padova, Italy ABSTRACT ARTICLE HISTORY Let G be a group. We analyse some aspects of the category G-Grp of G-groups. Received 15 April 2016 In particular, we show that a construction similar to the construction of the Revised 22 July 2016 spectral category, due to Gabriel and Oberst, and its dual, due to the second Communicated by T. Albu. author, is possible for the category G-Grp.
    [Show full text]
  • Categories of Sets with a Group Action
    Categories of sets with a group action Bachelor Thesis of Joris Weimar under supervision of Professor S.J. Edixhoven Mathematisch Instituut, Universiteit Leiden Leiden, 13 June 2008 Contents 1 Introduction 1 1.1 Abstract . .1 1.2 Working method . .1 1.2.1 Notation . .1 2 Categories 3 2.1 Basics . .3 2.1.1 Functors . .4 2.1.2 Natural transformations . .5 2.2 Categorical constructions . .6 2.2.1 Products and coproducts . .6 2.2.2 Fibered products and fibered coproducts . .9 3 An equivalence of categories 13 3.1 G-sets . 13 3.2 Covering spaces . 15 3.2.1 The fundamental group . 15 3.2.2 Covering spaces and the homotopy lifting property . 16 3.2.3 Induced homomorphisms . 18 3.2.4 Classifying covering spaces through the fundamental group . 19 3.3 The equivalence . 24 3.3.1 The functors . 25 4 Applications and examples 31 4.1 Automorphisms and recovering the fundamental group . 31 4.2 The Seifert-van Kampen theorem . 32 4.2.1 The categories C1, C2, and πP -Set ................... 33 4.2.2 The functors . 34 4.2.3 Example . 36 Bibliography 38 Index 40 iii 1 Introduction 1.1 Abstract In the 40s, Mac Lane and Eilenberg introduced categories. Although by some referred to as abstract nonsense, the idea of categories allows one to talk about mathematical objects and their relationions in a general setting. Its origins lie in the field of algebraic topology, one of the topics that will be explored in this thesis. First, a concise introduction to categories will be given.
    [Show full text]
  • Homological Algebra Lecture 1
    Homological Algebra Lecture 1 Richard Crew Richard Crew Homological Algebra Lecture 1 1 / 21 Additive Categories Categories of modules over a ring have many special features that categories in general do not have. For example the Hom sets are actually abelian groups. Products and coproducts are representable, and one can form kernels and cokernels. The notation of an abelian category axiomatizes this structure. This is useful when one wants to perform module-like constructions on categories that are not module categories, but have all the requisite structure. We approach this concept in stages. A preadditive category is one in which one can add morphisms in a way compatible with the category structure. An additive category is a preadditive category in which finite coproducts are representable and have an \identity object." A preabelian category is an additive category in which kernels and cokernels exist, and finally an abelian category is one in which they behave sensibly. Richard Crew Homological Algebra Lecture 1 2 / 21 Definition A preadditive category is a category C for which each Hom set has an abelian group structure satisfying the following conditions: For all morphisms f : X ! X 0, g : Y ! Y 0 in C the maps 0 0 HomC(X ; Y ) ! HomC(X ; Y ); HomC(X ; Y ) ! HomC(X ; Y ) induced by f and g are homomorphisms. The composition maps HomC(Y ; Z) × HomC(X ; Y ) ! HomC(X ; Z)(g; f ) 7! g ◦ f are bilinear. The group law on the Hom sets will always be written additively, so the last condition means that (f + g) ◦ h = (f ◦ h) + (g ◦ h); f ◦ (g + h) = (f ◦ g) + (f ◦ h): Richard Crew Homological Algebra Lecture 1 3 / 21 We denote by 0 the identity of any Hom set, so the bilinearity of composition implies that f ◦ 0 = 0 ◦ f = 0 for any morphism f in C.
    [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]
  • A FRIENDLY INTRODUCTION to GROUP THEORY 1. Who Cares?
    A FRIENDLY INTRODUCTION TO GROUP THEORY JAKE WELLENS 1. who cares? You do, prefrosh. If you're a math major, then you probably want to pass Math 5. If you're a chemistry major, then you probably want to take that one chem class I heard involves representation theory. If you're a physics major, then at some point you might want to know what the Standard Model is. And I'll bet at least a few of you CS majors care at least a little bit about cryptography. Anyway, Wikipedia thinks it's useful to know some basic group theory, and I think I agree. It's also fun and I promise it isn't very difficult. 2. what is a group? I'm about to tell you what a group is, so brace yourself for disappointment. It's bound to be a somewhat anticlimactic experience for both of us: I type out a bunch of unimpressive-looking properties, and a bunch of you sit there looking unimpressed. I hope I can convince you, however, that it is the simplicity and ordinariness of this definition that makes group theory so deep and fundamentally interesting. Definition 1: A group (G; ∗) is a set G together with a binary operation ∗ : G×G ! G satisfying the following three conditions: 1. Associativity - that is, for any x; y; z 2 G, we have (x ∗ y) ∗ z = x ∗ (y ∗ z). 2. There is an identity element e 2 G such that 8g 2 G, we have e ∗ g = g ∗ e = g. 3. Each element has an inverse - that is, for each g 2 G, there is some h 2 G such that g ∗ h = h ∗ g = e.
    [Show full text]
  • Group Theory
    Group Theory Fall 2017 Paul Balister University of Memphis 7261 1. Semigroups, Monoids, Groups Fall 2017 A group (G; ?) is a set G with a binary operation ?: G × G ! G satisfying G1. ? is associative: For all a; b; c 2 G,(a ? b) ? c = a ? (b ? c). G2. ? has a two-sided identity e: For all a 2 G, a ? e = e ? a = a. G3. ? has two-sided inverses: For all a 2 G, there is an i(a) with a ? i(a) = i(a) ? a = e. A group is abelian if also G4. ? is commutative: For all a; b 2 G, a ? b = b ? a. A monoid is a set which satisfies G1 and G2 (associative with two-sided identity). A semigroup is a set which satisfies G1 (associative with no other assumptions). We usually just write G for (G; ?). The order jGj of a group (monoid, semigroup) G is the cardinality of the set G. Examples 1. The set of maps X ! X forms a monoid XX under composition. 2. The set of permutations X ! X forms a group SX under composition. (If the set is X = f1; : : : ; ng we write this group as Sn.) 3. The set Mn(R) of n × n matrices with entries in R forms a monoid under matrix multiplication (and a group under matrix addition). 4. The set GLn(R) of invertible n × n matrices forms a group under multiplication. 5. The set of linear maps (resp. invertible linear maps) from a vector space V to itself form a monoid (resp. group) under composition.
    [Show full text]
  • Groups of Prime Power Order. Vol. 1 (With a Foreword by Zvonimir Janko),Byyakov Berkovich, De Gruyter Expositions in Mathematics, 46, Walter De Gruyter Gmbh & Co
    BULLETIN (New Series) OF THE AMERICAN MATHEMATICAL SOCIETY Volume 48, Number 2, April 2011, Pages 315–323 S 0273-0979(2011)01298-8 Article electronically published on January 13, 2011 Groups of prime power order. Vol. 1 (with a foreword by Zvonimir Janko),byYakov Berkovich, de Gruyter Expositions in Mathematics, 46, Walter de Gruyter GmbH & Co. KG, Berlin, 2008, xx+512 pp., ISBN 978-3-11-020418-6 Groups of prime power order. Vol. 2, by Yakov Berkovich and Zvonimir Janko, de Gruyter Expositions in Mathematics, 47, Walter de Gruyter GmbH & Co. KG, Berlin, 2008, xvi+596 pp., ISBN 978-3-11-020419-3 Why study groups of prime power order? What are the interesting problems? What are the interesting results? What are the interesting techniques? The crudest and most obvious goal is to produce a classification of all groups of order pn, for all primes p and for all n>0; an impossible task. Nonetheless, refinements of this problem are of interest. So while it is impossible to classify the groups of order 2n for all n, it is a triviality (or a problem for number theorists) to classify the groups of order p for all p;and indeed the groups of order pn have been classified for n ≤ 7; see [22]. However, the difficulty of classifying the groups of order pn increases dramatically with n,so further progress in this style will be strictly limited. Moreover, there remains the question of what is meant by “classification”. It seems that there is no clear cut definition of this term, and words like “useful” and “interesting” are likely to be needed.
    [Show full text]
  • Introduction
    COVERING GROUPS OF NON-CONNECTED TOPOLOGICAL GROUPS REVISITED Ronald Brown and Osman Mucuk School of Mathematics University of Wales Bangor, Gwynedd LL57 1UT, U.K. Received 11 March 1993 , Revision 31 May 1993 Published in Math. Proc. Camb. Phil. Soc, 115 (1994) 97-110. This version: 18 Dec. 2006, with some new references. Introduction All spaces are assumed to be locally path connected and semi-locally 1-connected. Let X be a con- nected topological group with identity e, and let p : X~ ! X be the universal cover of the underlying space of X. It follows easily from classical properties of lifting maps to covering spaces that for any pointe ~ in X~ with pe~ = e there is a unique structure of topological group on X~ such thate ~ is the identity and p: X~ ! X is a morphism of groups. We say that the structure of topological group on X lifts to X~. It is less generally appreciated that this result fails for the non-connected case. The set ¼0X of path components of X forms a non-trivial group which acts on the abelian group ¼1(X; e) via conjugation in X. R.L. Taylor [20] showed that the topological group X determines an obstruction class kX in 3 H (¼0X; ¼1(X; e)), and that the vanishing of kX is a necessary and su±cient condition for the lifting of the topological group structure on X to a universal covering so that the projection is a morphism. Further, recent work, for example Huebschmann [15], shows there are geometric applications of the non-connected case.
    [Show full text]
  • 0. Introduction to Categories
    0. Introduction to categories September 21, 2014 These are notes for Algebra 504-5-6. Basic category theory is very simple, and in principle one could read these notes right away|but only at the risk of being buried in an avalanche of abstraction. To get started, it's enough to understand the definition of \category" and \functor". Then return to the notes as necessary over the course of the year. The more examples you know, the easier it gets. Since this is an algebra course, the vast majority of the examples will be algebraic in nature. Occasionally I'll throw in some topological examples, but for the purposes of the course these can be omitted. 1 Definition and examples of a category A category C consists first of all of a class of objects Ob C and for each pair of objects X; Y a set of morphisms MorC(X; Y ). The elements of MorC(X; Y ) are denoted f : X−!Y , where f is the morphism, X is the source and Y is the target. For each triple of objects X; Y; Z there is a composition law MorC(X; Y ) × MorC(Y; Z)−!MorC(X; Z); denoted by (φ, ) 7! ◦ φ and subject to the following two conditions: (i) (associativity) h ◦ (g ◦ f) = (h ◦ g) ◦ f (ii) (identity) for every object X there is given an identity morphism IdX satisfying IdX ◦ f = f for all f : Y −!X and g ◦ IdX = g for all g : X−!Y . Note that the identity morphism IdX is the unique morphism satisfying (ii).
    [Show full text]
  • CLASSIFICATION of FINITE SIMPLE GROUPS Contents 1. Background
    CLASSIFICATION OF FINITE SIMPLE GROUPS ABHINAV SHRESTHA Abstract. Analogous to the way the integers can be decomposed uniquely into prime factors, finite groups can be decomposed into finite simple groups, which cannot be further decomposed nontrivially. We will prove the Jordan- H¨olderTheorem and show that finite groups can always be decomposed uniquely into finite simple groups, and discuss the classification of these groups. In par- ticular, we will discuss two infinite families of simple groups, the cyclic groups of prime order, and the alternating groups on n ≥ 5 elements. Contents 1. Background Theorems and Definitions 1 2. Composition Series 2 3. The Cyclic Groups of Prime Order 3 4. Alternating Groups 4 Acknowledgments 11 References 11 1. Background Theorems and Definitions We assume the reader has some basic knowledge of group theory. We begin by defining two main concepts related to the classification of simple groups. Definition 1.1. A subgroup H of G is called a normal subgroup if for every g 2 G, gHg−1 = H. That is, H is closed under conjugation by elements of G. If H is normal in G, we write H E G. Definition 1.2. A group G 6= fidg is a simple group if its only normal subgroups are the trivial subgroup and G. We will also state the following theorems from group theory, which will be of some use to us in future proofs. First, we have two of the isomorphism theorems. Theorem 1.3. (First Isomorphism Theorem) Suppose α : G ! H is a surjective group homomorphism. Let K = ker α E G.
    [Show full text]
  • Category Theory Course
    Category Theory Course John Baez September 3, 2019 1 Contents 1 Category Theory: 4 1.1 Definition of a Category....................... 5 1.1.1 Categories of mathematical objects............. 5 1.1.2 Categories as mathematical objects............ 6 1.2 Doing Mathematics inside a Category............... 10 1.3 Limits and Colimits.......................... 11 1.3.1 Products............................ 11 1.3.2 Coproducts.......................... 14 1.4 General Limits and Colimits..................... 15 2 Equalizers, Coequalizers, Pullbacks, and Pushouts (Week 3) 16 2.1 Equalizers............................... 16 2.2 Coequalizers.............................. 18 2.3 Pullbacks................................ 19 2.4 Pullbacks and Pushouts....................... 20 2.5 Limits for all finite diagrams.................... 21 3 Week 4 22 3.1 Mathematics Between Categories.................. 22 3.2 Natural Transformations....................... 25 4 Maps Between Categories 28 4.1 Natural Transformations....................... 28 4.1.1 Examples of natural transformations........... 28 4.2 Equivalence of Categories...................... 28 4.3 Adjunctions.............................. 29 4.3.1 What are adjunctions?.................... 29 4.3.2 Examples of Adjunctions.................. 30 4.3.3 Diagonal Functor....................... 31 5 Diagrams in a Category as Functors 33 5.1 Units and Counits of Adjunctions................. 39 6 Cartesian Closed Categories 40 6.1 Evaluation and Coevaluation in Cartesian Closed Categories. 41 6.1.1 Internalizing Composition................. 42 6.2 Elements................................ 43 7 Week 9 43 7.1 Subobjects............................... 46 8 Symmetric Monoidal Categories 50 8.1 Guest lecture by Christina Osborne................ 50 8.1.1 What is a Monoidal Category?............... 50 8.1.2 Going back to the definition of a symmetric monoidal category.............................. 53 2 9 Week 10 54 9.1 The subobject classifier in Graph.................
    [Show full text]