DOCSLIB.ORG

Supplementary Notes on Direct Products of Groups and the Fundamental Theorem of Finite Abelian Groups

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Supplementary Notes on Direct Products of Groups and the Fundamental Theorem of Finite Abelian Groups Supplementary Notes on Direct Products of Groups and the Fundamental Theorem of Finite Abelian Groups Definition. Let G1;G2;:::Gn be groups. We can make the Cartesian product G1 × G2 × · · · × Gn into a group via coordinate-wise multiplication: 0 0 0 0 0 0 (g1; g2; : : : ; gn) · (g1; g2; : : : ; gn) = (g1g1; g2g2; : : : ; gngn): It is absolutely routine to check that with the above operation, G1 × G2 × · · · × Gn is a group, called the (external) direct product of G1;G2;:::Gn. In case G1;G2;:::;Gn are abelian groups written additively, then it is more customary to write the direct product as G1 ⊕ G2 ⊕ · · · ⊕ Gn, and refer to this as an (external) direct sum. To \internalize" this notion, recall first that if G is a group with normal sub- groups H; K / G, then the product HK is a subgroup of G. More generally, if we have normal subgroups H1;H2;:::;Hn /G, then the product H1H2 ··· Hn is also a subgroup of G. Sometimes this represents G as a direct product, as follows: Theorem 1. [Internal Direct Product Theorem] Let H1;H2;:::;Hn be normal subgroups of G, and assume that (i) G = H1H2 ··· Hn, (ii) For each i = 1; 2; : : : ; n, we have Hi \ (H1 ··· Hi−1Hi+1 ··· Hn) = feg. ∼ Then G = H1 × H2 × · · · × Hn; in fact the mapping φ : H1 × H2 × · · · × Hn −! G given by φ(h1; h2; : : : ; hn) = h1h2 ··· hn is an isomorphism. When this happens, we shall slur the distinction between \internal" and \external" and simply write G = H1 × H2 × · · · × Hn; keeping in mind that H1;H2;:::;Hn are actually subgroups of G. Proof. We claim first that if hi 2 Hi and hj 2 Hj with i 6= j, then hihj = hjhi. But this is easy: since both Hi and Hj are normal in G, we see that the \commutator" −1 −1 hihjhi hj 2 Hi \ Hj. But condition (ii) above clearly implies that Hi \ Hj = feg, and so it follows that hihj = hjhi, as required. Now define φ : H1 × H2 × · · · × Hn −! G by setting φ(h1; h2; : : : ; hn) = h1h2 ··· hn. Because of what we just proved above, φ is a homomorphism. By condition (i), φ is onto. Finally, if (h1; h2; : : : ; hn) 2 ker φ, −1 then h1h2 ··· hn = e implies that hi = h1 ··· hi−1hi+1 ··· hn 2 Hi\(H1 ··· Hi−1Hi+1 ··· Hn) = feg, i.e., hi = e. Since i was arbitrary, we conclude that (h1; h2; : : : ; hn) = (e; e; : : : ; e), and so φ is also injective. This proves the theorem. Please note that for abelian groups written additively, there is an obvious analogue of the above result. We shall now turn our attention to finite abelian groups. Basically we shall try to prove that every finite abelian group can be decomposed into cyclic groups. Without further stipulations, we can't really hope for a uniqueness result, basically because of the Theorem 2. [Chinese Remainder Theorem] Let m and n be relatively prime ∼ integers and let Zm;Zn;Zmn be cyclic groups of the given orders. Then Zm ×Zn = Zmn. n m Proof. Let Zmn be generated by the element z. Then the elements z1 = z ; z2 = z have orders m and n, respectively. Set H1 = hz1i;H2 = hz2i (cyclic groups of orders m and n, respectively), and note that the hypotheses of the above theorem are met, ∼ i.e., Zmn = H1 × H2. Notice that the Chinese Remainder Theorem allows us to consolidate many direct product decompositions of cyclic groups into fewer such products, or to reconfigure direct products, as the following examples indicate: ∼ Z6 × Z7 = Z42, ∼ Z2 × Z5 × Z7 = Z70, ∼ ∼ Z6 × Z35 = Z2 × Z3 × Z35 = Z2 × Z105. Now let A be a finite abelian group, which we continue to write multiplicatively. a1 a2 ak Let jAj = p1 p2 ··· pk be the decomposition of the order of A into distinct prime factors. We set n = jAj, and set n n n n1 = a1 ; n2 = a2 ; : : : ; nk = ak : p1 p2 pk Note that while the integers n1; n2; : : : ; nk are not pairwise relatively prime, they are collectively relatively prime, meaning that there is no integer greater than 1 than divides all of them. This implies, since Z is a principal ideal domain, that the ideal (n1; n2; : : : ; nk) = (1) = Z, which further implies that there exist integers s1; s2; : : : ; sk 2 Z, with s1n1 + s2ns + ··· sknk = 1. Using the above, we can prove the following fundamental result. Theorem 3. [Primary Decomposition Theorem] Let A be a finite abelian group a1 a2 ak of order jAj = n = p1 p2 ··· pk , and let Pi be the pi-Sylow subgroup of A; i = 1; 2; : : : ; k. Then A = P1 × P2 × · · · × Pk. Proof. We shall show that the hypotheses of Theorem 1 are satisfied. Note first that since A is abelian, then every subgroup of A is normal. In particular, the Sylow subgroups P1;P2;:::;Pk are all normal. Furthermore, if a 2 A is an element whose order is a power of pi, then it follows from Sylow's Theorem (the \covering" part) that a is contained in a pi-Sylow subgroup. But there is only one pi-Sylow subgroup since all are conjugate and any one is normal. Therefore, it follows that a 2 Pi. Next, let a 2 A be an arbitrary element. Using the result above, we have s1n1 + s2ns + ··· sknk = 1, for suitable s1; s2; : : : ; sk 2 Z, and so a = a1 = as1n1+s2ns+···sknk = as1n1 as2n2 ··· asknk : s n pai n s s s n However, (a i i ) i = (a ) i = e i = e and so a i i 2 Pi, for i = 1; 2; : : : ; k. This already proves that A = P1P2 ··· Pk. That Pi \(P1 ··· Pi−1Pi+1 ··· Pk) = feg should be obvious. This proves the theorem. At this stage, we see that the decomposition of a finite abelian group into a direct product of cyclic groups can be accomplished once we show that any abelian p-group can be factored into a direct product of cyclic p-groups. Theorem 4. Let P be a finite abelian p-group of order pm. Then there exist ∼ powers e1; e2; : : : ; er with e1 ≥ e2 ≥ · · · ≥ er such that P = Zpe1 × Zpe2 × · · · × Zper : Proof. We shall argue by induction on the order of P . First, let x1 2 P be an e element of maximal order p 1 in P . Clearly, e1 ≤ m. Set Z1 = hx1i. By induction, the quotient group A=Z1 is a direct product of cyclic groups: A=Z1 = hy2Z1i × hy3Z1i × · · · × hyrZ1i; e e where o(y2Z1) = p 2 ; : : : ; o(yrZ1) = p r ; e2 ≥ e3 ≥ · · · ≥ er. Note that since x1 has maximal order in A, it follows that e1 ≥ e2. Now we shall make some adjustments. Fix i, where 2 ≤ i ≤ r, and consider ei ei p the cyclic subgroup hyiZ1i ≤ A=Z1. Since o(yiZ1) = p we have yi 2 Z1, say e e −e e e −e e p i ki ki p 1 i p i p 1 i p 1 e e −e e y = x . Thus (x ) = (y ) = y = e and so p 1 jkip 1 i . Thus p i jki, i 1 1 e i e i e p i ki lip i −li say ki = lip i , so y = x = x . Now the adjustment: we set xi = yix , e e e i 1 1 1 p i p i −lip i so xi = yi x1 = e, and no smaller exponent kills xi. Doing this for each e i = 2; 3; : : : ; r produces elements x2; x3; : : : ; xr 2 P such that o(xi) = p i ; i = 2; 3; : : : ; r. Set Z2 = hx2i;Z3 = hx3i;:::;Zr = hxri. To finish the proof, we need to show: (i) P = Z1Z2 ··· Zr, (ii) Zi \ (Z1 ··· Zi−1Zi+1 ··· Zr) = feg: Let x 2 P . From the product decomposition above for A=Z1, we have powers f2; f3; : : : ; fr with f2 f3 fr (y2Z1) (y3Z1) ··· (yrZ1) = xZ1; f2 fr 0 0 li so it follows that y2 ··· yr = xx , for some x 2 Z1. Thus, since yi = xix1 , we get f2 f3 fr 00 x2 x3 ··· xr = xx ; 00 f1 00 −1 for some x 2 Z1. Now let f1 be such that x1 = (x ) , and conclude that f1 f2 fr x1 x2 ··· xr = x, proving part (i). To prove part (ii), note that it suffices to prove that if f1 f2 fr x1 x2 ··· xr = e; ei −li then p jfi; for i = 1; 2; : : : ; r: Again, since xi = yix1 ; i = 2; 3; : : : ; r we get an equation of the form 0 f2 f3 fr x y2 y3 ··· yr = e; 0 for some x 2 Z1, from which we conclude that f2 f3 fr (y2Z1) (y3Z1) ··· (yrZ1) = eZ1; ei f1 this implies that p jfi; i = 2; 3; : : : ; r: But then it follows immediately that x1 = e; e and so p 1 jf1, as well. This completes the proof. If we use the above theorem, together with the Chinese Remainder Theorem, we get the following "existence" theorem. Theorem 5. [Existence of Invariant Factors] Let A be a finite abelian group, and let n = jAj be the order of A. Then there exists a decreasing sequence n1 ≥ n2 ≥ · · · ≥ ns, with nsjns−1; ns−1jns−2; : : : ; n2jn1, and cyclic subgroups Z1;Z2;:::;Zs of orders n1; n2; : : : ; ns, respectively with A = Z1 × Z2 × · · · × Zs. The numbers n1; n2; : : : ; ns are called invariant factors of A. It is pretty easy to see how the direct product decompositions of the Sylow subgroups in the Primary Decomposition Theorem can be synthesized into a direct product decomposition of the type indicated above. For example, if we had a group A = P1 × P2 × P3 × P4, (direct decomposition into Sylow subgroups), with ∼ ∼ ∼ ∼ P1 = Z8 × Z4, P2 = Z9 × Z3, P3 = Z125 × Z5 × Z5 × Z5, and P4 = Z11, (note here that I've written Zn for a cyclic group of order n; sorry about being somewhat inconsistent in my usage), then we would have ∼ A = Z8 × Z4 × Z9 × Z3 × Z125 × Z5 × Z5 × Z5 × Z11; and so a reorganized direct product decomposition would look like: ∼ A = Z8·9·125·11 × Z4·3·5 × Z5 × Z5; and so the \invariant factors" are n1 = 8 · 9 · 125 · 11 = 99; 000; n2 = 4 · 3 · 5 = 60; n3 = 5; n4 = 5.
Load more

Recommended publications
  • Classification of Finite Abelian Groups
    Math 317 C1 John Sullivan Spring 2003 Classification of Finite Abelian Groups (Notes based on an article by Navarro in the Amer. Math. Monthly, February 2003.) The fundamental theorem of finite abelian groups expresses any such group as a product of cyclic groups: Theorem. Suppose G is a finite abelian group. Then G is (in a unique way) a direct product of cyclic groups of order pk with p prime. Our first step will be a special case of Cauchy’s Theorem, which we will prove later for arbitrary groups: whenever p |G| then G has an element of order p. Theorem (Cauchy). If G is a finite group, and p |G| is a prime, then G has an element of order p (or, equivalently, a subgroup of order p). ∼ Proof when G is abelian. First note that if |G| is prime, then G = Zp and we are done. In general, we work by induction. If G has no nontrivial proper subgroups, it must be a prime cyclic group, the case we’ve already handled. So we can suppose there is a nontrivial subgroup H smaller than G. Either p |H| or p |G/H|. In the first case, by induction, H has an element of order p which is also order p in G so we’re done. In the second case, if ∼ g + H has order p in G/H then |g + H| |g|, so hgi = Zkp for some k, and then kg ∈ G has order p. Note that we write our abelian groups additively. Definition. Given a prime p, a p-group is a group in which every element has order pk for some k.
    [Show full text]
  • BLECHER • All Numbers Below Are Integers, Usually Positive. • Read Up
    MATH 4389{ALGEBRA `CHEATSHEET'{BLECHER • All numbers below are integers, usually positive. • Read up on e.g. wikipedia on the Euclidean algorithm. • Diophantine equation ax + by = c has solutions iff gcd(a; b) doesn't divide c. One may find the solutions using the Euclidean algorithm (google this). • Euclid's lemma: prime pjab implies pja or pjb. • gcd(m; n) · lcm(m; n) = mn. • a ≡ b (mod m) means mj(a − b). An equivalence relation (reflexive, symmetric, transitive) on the integers. • ax ≡ b (mod m) has a solution iff gcd(m; a)jb. • Division Algorithm: there exist unique integers q and r with a = bq + r and 0 ≤ r < b; so a ≡ r (mod b). • Fermat's theorem: If p is prime then ap ≡ a (mod p) Also, ap−1 ≡ 1 (mod p) if p does not divide a. • For definitions for groups, rings, fields, subgroups, order of element, etc see Algebra fact sheet" below. • Zm = f0; 1; ··· ; m−1g with addition and multiplication mod m, is a group and commutative ring (= Z =m Z) • Order of n in Zm (i.e. smallest k s.t. kn ≡ 0 (mod m)) is m=gcd(m; n). • hai denotes the subgroup generated by a (the smallest subgroup containing a). For example h2i = f0; 2; 2+2 = 4; 2 + 2 + 2 = 6g in Z8. (In ring theory it may be the subring generated by a). • A cyclic group is a group that can be generated by a single element (the group generator). They are abelian. • A finite group is cyclic iff G = fg; g + g; ··· ; g + g + ··· + g = 0g; so G = hgi.
    [Show full text]
  • Direct Products and Homomorphisms
    Commuting properties Direct products and homomorphisms Simion Breaz logo Simion Breaz Direct products and homomorphisms Products and coproducts Commuting properties Contravariant functors Covariant functors Outline 1 Commuting properties Products and coproducts Contravariant functors Covariant functors logo Simion Breaz Direct products and homomorphisms Products and coproducts Commuting properties Contravariant functors Covariant functors Introduction Important properties of objects in particular categories (e.g. varieties of universal algebras) can be described using commuting properties of some canonical functors. For instance, in [Ad´amek and Rosicki: Locally presentable categories] there are the following examples: If V is a variety of finitary algebras and A ∈ V then A is finitely generated iff the functor Hom(A, −): V → Set preserves direct unions (i.e. directed colimits of monomorphisms); A is finitely presented (i.e. it is generated by finitely many generators modulo finitely many relations) iff the functor Hom(A, −): V → Set preserves directed colimits. logo Simion Breaz Direct products and homomorphisms Products and coproducts Commuting properties Contravariant functors Covariant functors Introduction Important properties of objects in particular categories (e.g. varieties of universal algebras) can be described using commuting properties of some canonical functors. For instance, in [Ad´amek and Rosicki: Locally presentable categories] there are the following examples: If V is a variety of finitary algebras and A ∈ V then A is finitely generated iff the functor Hom(A, −): V → Set preserves direct unions (i.e. directed colimits of monomorphisms); A is finitely presented (i.e. it is generated by finitely many generators modulo finitely many relations) iff the functor Hom(A, −): V → Set preserves directed colimits.
    [Show full text]
  • Cohomology Theory of Lie Groups and Lie Algebras
    COHOMOLOGY THEORY OF LIE GROUPS AND LIE ALGEBRAS BY CLAUDE CHEVALLEY AND SAMUEL EILENBERG Introduction The present paper lays no claim to deep originality. Its main purpose is to give a systematic treatment of the methods by which topological questions concerning compact Lie groups may be reduced to algebraic questions con- cerning Lie algebras^). This reduction proceeds in three steps: (1) replacing questions on homology groups by questions on differential forms. This is accomplished by de Rham's theorems(2) (which, incidentally, seem to have been conjectured by Cartan for this very purpose); (2) replacing the con- sideration of arbitrary differential forms by that of invariant differential forms: this is accomplished by using invariant integration on the group manifold; (3) replacing the consideration of invariant differential forms by that of alternating multilinear forms on the Lie algebra of the group. We study here the question not only of the topological nature of the whole group, but also of the manifolds on which the group operates. Chapter I is concerned essentially with step 2 of the list above (step 1 depending here, as in the case of the whole group, on de Rham's theorems). Besides consider- ing invariant forms, we also introduce "equivariant" forms, defined in terms of a suitable linear representation of the group; Theorem 2.2 states that, when this representation does not contain the trivial representation, equi- variant forms are of no use for topology; however, it states this negative result in the form of a positive property of equivariant forms which is of interest by itself, since it is the key to Levi's theorem (cf.
    [Show full text]
  • Lecture 1.3: Direct Products and Sums
    Lecture 1.3: Direct products and sums Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 8530, Advanced Linear Algebra M. Macauley (Clemson) Lecture 1.3: Direct products and sums Math 8530, Advanced Linear Algebra 1 / 5 Overview In previous lectures, we learned about vectors spaces and subspaces. We learned about what it meant for a subset to span, to be linearly independent, and to be a basis. In this lecture, we will see how to create new vector spaces from old ones. We will see several ways to \multiply" vector spaces together, and will learn how to construct: the complement of a subspace the direct sum of two subspaces the direct product of two vector spaces M. Macauley (Clemson) Lecture 1.3: Direct products and sums Math 8530, Advanced Linear Algebra 2 / 5 Complements and direct sums Theorem 1.5 (a) Every subspace Y of a finite-dimensional vector space X is finite-dimensional. (b) Every subspace Y has a complement in X : another subspace Z such that every vector x 2 X can be written uniquely as x = y + z; y 2 Y ; z 2 Z; dim X = dim Y + dim Z: Proof Definition X is the direct sum of subspaces Y and Z that are complements of each other. More generally, X is the direct sum of subspaces Y1;:::; Ym if every x 2 X can be expressed uniquely as x = y1 + ··· + ym; yi 2 Yi : We denote this as X = Y1 ⊕ · · · ⊕ Ym. M. Macauley (Clemson) Lecture 1.3: Direct products and sums Math 8530, Advanced Linear Algebra 3 / 5 Direct products Definition The direct product of X1 and X2 is the vector space X1 × X2 := (x1; x2) j x1 2 X1; x2 2 X2 ; with addition and multiplication defined component-wise.
    [Show full text]
  • Forcing with Copies of Countable Ordinals
    PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 143, Number 4, April 2015, Pages 1771–1784 S 0002-9939(2014)12360-4 Article electronically published on December 4, 2014 FORCING WITH COPIES OF COUNTABLE ORDINALS MILOSˇ S. KURILIC´ (Communicated by Mirna Dˇzamonja) Abstract. Let α be a countable ordinal and P(α) the collection of its subsets isomorphic to α. We show that the separative quotient of the poset P(α), ⊂ is isomorphic to a forcing product of iterated reduced products of Boolean γ algebras of the form P (ω )/Iωγ ,whereγ ∈ Lim ∪{1} and Iωγ is the corre- sponding ordinal ideal. Moreover, the poset P(α), ⊂ is forcing equivalent to + a two-step iteration of the form (P (ω)/Fin) ∗ π,where[ω] “π is an ω1- + closed separative pre-order” and, if h = ω1,to(P (ω)/Fin) . Also we analyze δ I the quotients over ordinal ideals P (ω )/ ωδ and the corresponding cardinal invariants hωδ and tωδ . 1. Introduction The posets of the form P(X), ⊂,whereX is a relational structure and P(X) the set of (the domains of) its isomorphic substructures, were considered in [7], where a classification of the relations on countable sets related to the forcing-related properties of the corresponding posets of copies is described. So, defining two structures to be equivalent if the corresponding posets of copies produce the same generic extensions, we obtain a rough classification of structures which, in general, depends on the properties of the model of set theory in which we work. For example, under CH all countable linear orders are partitioned in only two classes.
    [Show full text]
  • Ring (Mathematics) 1 Ring (Mathematics)
    Ring (mathematics) 1 Ring (mathematics) In mathematics, a ring is an algebraic structure consisting of a set together with two binary operations usually called addition and multiplication, where the set is an abelian group under addition (called the additive group of the ring) and a monoid under multiplication such that multiplication distributes over addition.a[›] In other words the ring axioms require that addition is commutative, addition and multiplication are associative, multiplication distributes over addition, each element in the set has an additive inverse, and there exists an additive identity. One of the most common examples of a ring is the set of integers endowed with its natural operations of addition and multiplication. Certain variations of the definition of a ring are sometimes employed, and these are outlined later in the article. Polynomials, represented here by curves, form a ring under addition The branch of mathematics that studies rings is known and multiplication. as ring theory. Ring theorists study properties common to both familiar mathematical structures such as integers and polynomials, and to the many less well-known mathematical structures that also satisfy the axioms of ring theory. The ubiquity of rings makes them a central organizing principle of contemporary mathematics.[1] Ring theory may be used to understand fundamental physical laws, such as those underlying special relativity and symmetry phenomena in molecular chemistry. The concept of a ring first arose from attempts to prove Fermat's last theorem, starting with Richard Dedekind in the 1880s. After contributions from other fields, mainly number theory, the ring notion was generalized and firmly established during the 1920s by Emmy Noether and Wolfgang Krull.[2] Modern ring theory—a very active mathematical discipline—studies rings in their own right.
    [Show full text]
  • Arxiv:1909.05807V1 [Math.RA] 12 Sep 2019 Cs T
    MODULES OVER TRUSSES VS MODULES OVER RINGS: DIRECT SUMS AND FREE MODULES TOMASZ BRZEZINSKI´ AND BERNARD RYBOLOWICZ Abstract. Categorical constructions on heaps and modules over trusses are con- sidered and contrasted with the corresponding constructions on groups and rings. These include explicit description of free heaps and free Abelian heaps, coprod- ucts or direct sums of Abelian heaps and modules over trusses, and description and analysis of free modules over trusses. It is shown that the direct sum of two non-empty Abelian heaps is always infinite and isomorphic to the heap associated to the direct sums of the group retracts of both heaps and Z. Direct sum is used to extend a given truss to a ring-type truss or a unital truss (or both). Free mod- ules are constructed as direct sums of a truss. It is shown that only free rank-one modules are free as modules over the associated truss. On the other hand, if a (finitely generated) module over a truss associated to a ring is free, then so is the corresponding quotient-by-absorbers module over this ring. 1. Introduction Trusses and skew trusses were defined in [3] in order to capture the nature of the distinctive distributive law that characterises braces and skew braces [12], [6], [9]. A (one-sided) truss is a set with a ternary operation which makes it into a heap or herd (see [10], [11], [1] or [13]) together with an associative binary operation that distributes (on one side or both) over the heap ternary operation. If the specific bi- nary operation admits it, a choice of a particular element could fix a group structure on a heap in a way that turns the truss into a ring or a brace-like system (which becomes a brace provided the binary operation admits inverses).
    [Show full text]
  • Arxiv:2007.07508V1 [Math.GR] 15 Jul 2020 Re H Aoia Eopstosaeapplied
    CANONICAL DECOMPOSITIONS OF ABELIAN GROUPS PHILL SCHULTZ Abstract. Every torsion–free abelian group of finite rank has two essentially unique complete direct decompositions whose summands come from specific classes of groups. 1. Introduction An intriguing feature of abelian group theory is that torsion–free groups, even those of finite rank, may fail to have unique complete decompositions; see for ex- ample [Fuchs, 2015, Chapter 12, §5] or [Mader and Schultz, 2018]). Therefore it is interesting to show that every such group has essentially unique complete de- compositions with summands from certain identifiable classes. For example, it was shown in [Mader and Schultz, 2018] that every finite rank torsion–free group G has a Main Decomposition, G = Gcd ⊕ Gcl where Gcd is completely decomposable and Gcl has no rank 1 direct summand; Gcd is unique up to isomorphism and Gcl unique up to near isomorphism. Let G be the class of torsion–free abelian groups of finite rank and let G ∈ G. The aim of this paper is to show that: • G = Gsd ⊕Gni where Gsd is a direct sum of strongly indecomposable groups and Gni has no strongly indecomposable direct summand. Gsd is unique up to isomorphism and Gni up to near isomorphism. • G = G(fq) ⊕ G(rq) ⊕ G(dq), where G(fq) is an extension of a completely decomposable group by a finite group, G(rq) is an extension of a completely decomposable group by an infinite reduced torsion group, and G(dq) is an extension of a completely decomposable group by an infinite torsion group which has a divisible summand.
    [Show full text]
  • Math 395: Category Theory Northwestern University, Lecture Notes
    Math 395: Category Theory Northwestern University, Lecture Notes Written by Santiago Can˜ez These are lecture notes for an undergraduate seminar covering Category Theory, taught by the author at Northwestern University. The book we roughly follow is “Category Theory in Context” by Emily Riehl. These notes outline the specific approach we’re taking in terms the order in which topics are presented and what from the book we actually emphasize. We also include things we look at in class which aren’t in the book, but otherwise various standard definitions and examples are left to the book. Watch out for typos! Comments and suggestions are welcome. Contents Introduction to Categories 1 Special Morphisms, Products 3 Coproducts, Opposite Categories 7 Functors, Fullness and Faithfulness 9 Coproduct Examples, Concreteness 12 Natural Isomorphisms, Representability 14 More Representable Examples 17 Equivalences between Categories 19 Yoneda Lemma, Functors as Objects 21 Equalizers and Coequalizers 25 Some Functor Properties, An Equivalence Example 28 Segal’s Category, Coequalizer Examples 29 Limits and Colimits 29 More on Limits/Colimits 29 More Limit/Colimit Examples 30 Continuous Functors, Adjoints 30 Limits as Equalizers, Sheaves 30 Fun with Squares, Pullback Examples 30 More Adjoint Examples 30 Stone-Cech 30 Group and Monoid Objects 30 Monads 30 Algebras 30 Ultrafilters 30 Introduction to Categories Category theory provides a framework through which we can relate a construction/fact in one area of mathematics to a construction/fact in another. The goal is an ultimate form of abstraction, where we can truly single out what about a given problem is specific to that problem, and what is a reflection of a more general phenomenom which appears elsewhere.
    [Show full text]
  • Chapter 3 Direct Sums, Affine Maps, the Dual Space, Duality
    Chapter 3 Direct Sums, Affine Maps, The Dual Space, Duality 3.1 Direct Products, Sums, and Direct Sums There are some useful ways of forming new vector spaces from older ones. Definition 3.1. Given p 2vectorspacesE ,...,E , ≥ 1 p the product F = E1 Ep can be made into a vector space by defining addition⇥···⇥ and scalar multiplication as follows: (u1,...,up)+(v1,...,vp)=(u1 + v1,...,up + vp) λ(u1,...,up)=(λu1,...,λup), for all ui,vi Ei and all λ R. 2 2 With the above addition and multiplication, the vector space F = E E is called the direct product of 1 ⇥···⇥ p the vector spaces E1,...,Ep. 151 152 CHAPTER 3. DIRECT SUMS, AFFINE MAPS, THE DUAL SPACE, DUALITY The projection maps pr : E E E given by i 1 ⇥···⇥ p ! i pri(u1,...,up)=ui are clearly linear. Similarly, the maps in : E E E given by i i ! 1 ⇥···⇥ p ini(ui)=(0,...,0,ui, 0,...,0) are injective and linear. It can be shown (using bases) that dim(E E )=dim(E )+ +dim(E ). 1 ⇥···⇥ p 1 ··· p Let us now consider a vector space E and p subspaces U1,...,Up of E. We have a map a: U U E 1 ⇥···⇥ p ! given by a(u ,...,u )=u + + u , 1 p 1 ··· p with u U for i =1,...,p. i 2 i 3.1. DIRECT PRODUCTS, SUMS, AND DIRECT SUMS 153 It is clear that this map is linear, and so its image is a subspace of E denoted by U + + U 1 ··· p and called the sum of the subspaces U1,...,Up.
    [Show full text]
  • 1.7 Categories: Products, Coproducts, and Free Objects
    22 CHAPTER 1. GROUPS 1.7 Categories: Products, Coproducts, and Free Objects Categories deal with objects and morphisms between objects. For examples: objects sets groups rings module morphisms functions homomorphisms homomorphisms homomorphisms Category theory studies some common properties for them. Def. A category is a class C of objects (denoted A, B, C,. ) together with the following things: 1. A set Hom (A; B) for every pair (A; B) 2 C × C. An element of Hom (A; B) is called a morphism from A to B and is denoted f : A ! B. 2. A function Hom (B; C) × Hom (A; B) ! Hom (A; C) for every triple (A; B; C) 2 C × C × C. For morphisms f : A ! B and g : B ! C, this function is written (g; f) 7! g ◦ f and g ◦ f : A ! C is called the composite of f and g. All subject to the two axioms: (I) Associativity: If f : A ! B, g : B ! C and h : C ! D are morphisms of C, then h ◦ (g ◦ f) = (h ◦ g) ◦ f. (II) Identity: For each object B of C there exists a morphism 1B : B ! B such that 1B ◦ f = f for any f : A ! B, and g ◦ 1B = g for any g : B ! C. In a category C a morphism f : A ! B is called an equivalence, and A and B are said to be equivalent, if there is a morphism g : B ! A in C such that g ◦ f = 1A and f ◦ g = 1B. Ex. Objects Morphisms f : A ! B is an equivalence A is equivalent to B sets functions f is a bijection jAj = jBj groups group homomorphisms f is an isomorphism A is isomorphic to B partial order sets f : A ! B such that f is an isomorphism between A is isomorphic to B \x ≤ y in (A; ≤) ) partial order sets A and B f(x) ≤ f(y) in (B; ≤)" Ex.
    [Show full text]