DOCSLIB.ORG

Introduction to Universal Algebra

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Introduction to Universal Algebra Introduction to Universal Algebra George Voutsadakis1 1 Mathematics and Computer Science Lake Superior State University LSSU Math 400 George Voutsadakis (LSSU) Universal Algebra June 2020 1 / 85 Outline 1 Algebras, Subalgebras, Homomorphisms & Direct Products Definition and Examples of Algebras Isomorphic Algebras and Subalgebras Algebraic Lattices and Subuniverses Congruences and Quotient Algebras Homomorphisms and the Homomorphism Theorems Direct Products and Factor Congruences Subdirect Products and Simple Algebras George Voutsadakis (LSSU) Universal Algebra June 2020 2 / 85 Algebras, Subalgebras, Homomorphisms & Direct Products Definition and Examples of Algebras Subsection 1 Definition and Examples of Algebras George Voutsadakis (LSSU) Universal Algebra June 2020 3 / 85 Algebras, Subalgebras, Homomorphisms & Direct Products Definition and Examples of Algebras Operations Definition For A a nonempty set and n a nonnegative integer, we define A0 = {;} and, for n > 0, An is the set of n-tuples of elements from A. An n-ary operation (or function) on A is any function f from An to A; n is the arity (or rank) of f . A finitary operation is an n-ary operation, for some n. The image of 〈a1,...,an〉 under an n-ary operation f is denoted by f (a1,...,an). An operation f on A is called a nullary operation (or constant) if its arity is zero; it is completely determined by the image f (;) in A of the only element ; in A0. As such it is convenient to identify it with the element f (;). Thus a nullary operation is thought of as an element of A. An operation f on A is unary, binary or ternary if its arity is 1,2, or 3, respectively. George Voutsadakis (LSSU) Universal Algebra June 2020 4 / 85 Algebras, Subalgebras, Homomorphisms & Direct Products Definition and Examples of Algebras Languages and Algebras Definition A language (or type) of algebras is a set F of function symbols such that a nonnegative integer n is assigned to each member f of F . This integer is called the arity (or rank) of f , and f is said to be an n-ary function symbol. The subset of n-ary function symbols in F is denoted by Fn. Definition If F is a language of algebras, then an algebra A of type F is an ordered pair 〈A,F 〉, where: A is a nonempty set; F is a family of finitary operations on A indexed by the language F , such that corresponding to each n-ary function symbol f in F , there is an n-ary operation f A on A. The set A is called the universe (or underlying set) of A =〈A,F 〉. The f A’s are called the fundamental operations of A. George Voutsadakis (LSSU) Universal Algebra June 2020 5 / 85 Algebras, Subalgebras, Homomorphisms & Direct Products Definition and Examples of Algebras More Algebraic Notation and Terminology If F is finite, say F = {f1,...,fk }, we often write 〈A,f1,...,fk 〉 for 〈A,F 〉, usually adopting the convention: arityf1 ≥ arityf2 ≥···≥ arityfk . An algebra A is unary if all of its operations are unary. It is mono-unary if it has just one unary operation. A is a groupoid if it has just one binary operation. The operation is usually denoted by + or ·, and we write a + b or a · b (or just ab) for the image of 〈a,b〉 under this operation and call it the sum or product of a and b, respectively. An algebra A is finite if |A| is finite. An algebra A is trivial if |A| = 1. George Voutsadakis (LSSU) Universal Algebra June 2020 6 / 85 Algebras, Subalgebras, Homomorphisms & Direct Products Definition and Examples of Algebras Groups and Abelian Groups A group G is an algebra 〈G ,·, −1,1〉 with a binary, a unary, and a nullary operation in which the following identities are true: G1 x · (y · z) ≈ (x · y) · z; G2 x · 1 ≈ 1 · x ≈ x; G3 x · x −1 ≈ x −1 · x ≈ 1. A group G is Abelian (or commutative) if the following identity is true: G4 x · y ≈ y · x. George Voutsadakis (LSSU) Universal Algebra June 2020 7 / 85 Algebras, Subalgebras, Homomorphisms & Direct Products Definition and Examples of Algebras Monoids and Quasigroups Groups are generalized to semigroups and monoids in one direction, and to quasigroups and loops in another direction. A semigroup is a groupoid 〈G ,·〉 in which (G1) is true. It is commutative (or Abelian) if (G4) holds. A monoid is an algebra 〈M,·,1〉 with a binary and a nullary operation satisfying (G1) and (G2). A quasigroup is an algebra 〈Q, ,·, 〉 with three binary operations satisfying the following identities:± ² Q1 x (x · y) ≈ y; (x · y) y ≈ x; Q2 x²· (x y) ≈ y; (x y)±· y ≈ x. A loop is² a quasigroup± with identity, i.e., an algebra 〈Q, ,·, ,1〉 which satisfies (Q1), (Q2) and (G2). ± ² George Voutsadakis (LSSU) Universal Algebra June 2020 8 / 85 Algebras, Subalgebras, Homomorphisms & Direct Products Definition and Examples of Algebras Rings A ring is an algebra 〈R,+,·,−,0〉, where + and · are binary, − is unary and 0 is nullary, satisfying the following conditions: R1 〈R,+,−,0〉 is an Abelian group; R2 〈R,·〉 is a semigroup; R3 x · (y + z) ≈ (x · y) + (x · z) (x + y) · z ≈ (x · z) + (y · z). A ring with identity is an algebra 〈R,+,·,−,0,1〉, such that (R1)-(R3) and (G2) hold. George Voutsadakis (LSSU) Universal Algebra June 2020 9 / 85 Algebras, Subalgebras, Homomorphisms & Direct Products Definition and Examples of Algebras Modules and Algebras Over a (Fixed) Ring Let R be a given ring. A (left) R-module is an algebra 〈M,+,−,0,(fr )r∈R 〉, where + is binary, − is unary, 0 is nullary, and each fr is unary, such that the following hold: M1 〈M,+,−,0〉 is an Abelian group; M2 fr (x + y) ≈ fr (x) + fr (y), for r ∈ R; M3 fr+s(x) ≈ fr (x) + fs (x) for r,s ∈ R; M4 fr (fs (x)) ≈ frs (x), for r,s ∈ R. Let R be a ring with identity. A unitary R-module is an algebra as above satisfying (M1)-(M4) and: M5 f1(x) ≈ x. Let R be a ring with identity. An algebra over R is an algebra 〈A,+,·,−,0,(fr )r∈R 〉, such that the following hold: A1 〈A,+,−,0,(fr )r∈R 〉 is a unitary R-module; A2 〈A,+,·,−,0〉 is a ring; A3 fr (x · y) ≈ (fr (x)) · y ≈ x · fr (y), for r ∈ R. George Voutsadakis (LSSU) Universal Algebra June 2020 10 / 85 Algebras, Subalgebras, Homomorphisms & Direct Products Definition and Examples of Algebras Semilattices and Lattices A semilattice is a semigroup 〈S,·〉 which satisfies the commutative law (G4) and the idempotent law S1 x · x ≈ x. A lattice is an algebra 〈L,∨,∧〉, with two binary operations which satisfies L1 (commutative laws) L3 (idempotent laws) (a) x ∨ y ≈ y ∨ x; (a) x ∨ x ≈ x; (b) x ∧ y ≈ y ∧ x; (b) x ∧ x ≈ x; L2 (associative laws) L4 (absorption laws) (a) x ∨ (y ∨ z) ≈ (x ∨ y) ∨ z; (a) x ≈ x ∨ (x ∧ y); (b) x ∧ (y ∧ z) ≈ (x ∧ y) ∧ z; (b) x ≈ x ∧ (x ∨ y). An algebra 〈L,∨,∧,0,1〉, with two binary and two nullary operations is a bounded lattice if it satisfies: BL1 〈L,∨,∧〉 is a lattice; BL2 x ∧ 0 ≈ 0; x ∨ 1 ≈ 1. George Voutsadakis (LSSU) Universal Algebra June 2020 11 / 85 Algebras, Subalgebras, Homomorphisms & Direct Products Isomorphic Algebras and Subalgebras Subsection 2 Isomorphic Algebras and Subalgebras George Voutsadakis (LSSU) Universal Algebra June 2020 12 / 85 Algebras, Subalgebras, Homomorphisms & Direct Products Isomorphic Algebras and Subalgebras Isomorphism Definition Let A and B be two algebras of the same type F . Then a function α : A → B is an isomorphism from A to B if: α is one-to-one and onto; for every n-ary f ∈ F and for all a1,...,an ∈ A, we have A B α(f (a1,...,an)) = f (α(a1),...,α(an)). We say A is isomorphic to B, written A =∼ B, if there is an isomorphism from A to B. The properties of algebras that are invariant under isomorphism are called algebraic properties. Isomorphic algebras can be regarded as equal or the same, having the same algebraic structure, and differing only in the nature of the elements: The phrase “equal up to isomorphism” is often used. George Voutsadakis (LSSU) Universal Algebra June 2020 13 / 85 Algebras, Subalgebras, Homomorphisms & Direct Products Isomorphic Algebras and Subalgebras Subalgebras and Subuniverses Definition Let A and B be two algebras of the same type. Then B is a subalgebra of A if B ⊆ A and every fundamental operation of B is the restriction of the corresponding operation of A; i.e., for each function symbol f , f B is f A restricted to B. We write simply B ≤ A. A subuniverse of A is a subset B of A which is closed under the fundamental operations of A; i.e., if f is a fundamental n-ary operation of A and a1,...,an ∈ B we would require f (a1,...,an) ∈ B. Thus, if B is a subalgebra of A, then B is a subuniverse of A. The empty set may be a subuniverse, but it is not the underlying set of any subalgebra. If A has nullary operations then every subuniverse contains them as well. George Voutsadakis (LSSU) Universal Algebra June 2020 14 / 85 Algebras, Subalgebras, Homomorphisms & Direct Products Isomorphic Algebras and Subalgebras Embeddings (or Monomorphisms) Definition Let A and B be of the same type. A function α : A → B is an embedding of A into B if α is one-to-one and satisfies A B α(f (a1,...,an)) = f (α(a1),...,α(an)). Such an α is also called a monomorphism. For brevity we simply say “α : A → B is an embedding”.
Load more

Recommended publications
  • Linear Induction Algebra and a Normal Form for Linear Operators Laurent Poinsot
    Linear induction algebra and a normal form for linear operators Laurent Poinsot To cite this version: Laurent Poinsot. Linear induction algebra and a normal form for linear operators. 2013. hal- 00821596 HAL Id: hal-00821596 https://hal.archives-ouvertes.fr/hal-00821596 Preprint submitted on 10 May 2013 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Linear induction algebra and a normal form for linear operators Laurent Poinsot Universit´eParis 13, Sorbonne Paris Cit´e, LIPN, CNRS (UMR 7030), France, [email protected], http://lipn.univ-paris13.fr/~poinsot/ Abstract. The set of natural integers is fundamental for at least two reasons: it is the free induction algebra over the empty set (and at such allows definitions of maps by primitive recursion) and it is the free monoid over a one-element set, the latter structure being a consequence of the former. In this contribution, we study the corresponding structure in the linear setting, i.e. in the category of modules over a commutative ring rather than in the category of sets, namely the free module generated by the integers. It also provides free structures of induction algebra and of monoid (in the category of modules).
    [Show full text]
  • A Guide to Self-Distributive Quasigroups, Or Latin Quandles
    A GUIDE TO SELF-DISTRIBUTIVE QUASIGROUPS, OR LATIN QUANDLES DAVID STANOVSKY´ Abstract. We present an overview of the theory of self-distributive quasigroups, both in the two- sided and one-sided cases, and relate the older results to the modern theory of quandles, to which self-distributive quasigroups are a special case. Most attention is paid to the representation results (loop isotopy, linear representation, homogeneous representation), as the main tool to investigate self-distributive quasigroups. 1. Introduction 1.1. The origins of self-distributivity. Self-distributivity is such a natural concept: given a binary operation on a set A, fix one parameter, say the left one, and consider the mappings ∗ La(x) = a x, called left translations. If all such mappings are endomorphisms of the algebraic structure (A,∗ ), the operation is called left self-distributive (the prefix self- is usually omitted). Equationally,∗ the property says a (x y) = (a x) (a y) ∗ ∗ ∗ ∗ ∗ for every a, x, y A, and we see that distributes over itself. Self-distributivity∈ was pinpointed already∗ in the late 19th century works of logicians Peirce and Schr¨oder [69, 76], and ever since, it keeps appearing in a natural way throughout mathematics, perhaps most notably in low dimensional topology (knot and braid invariants) [12, 15, 63], in the theory of symmetric spaces [57] and in set theory (Laver’s groupoids of elementary embeddings) [15]. Recently, Moskovich expressed an interesting statement on his blog [60] that while associativity caters to the classical world of space and time, distributivity is, perhaps, the setting for the emerging world of information.
    [Show full text]
  • Semilattice Sums of Algebras and Mal'tsev Products of Varieties
    Mathematics Publications Mathematics 5-20-2020 Semilattice sums of algebras and Mal’tsev products of varieties Clifford Bergman Iowa State University, [email protected] T. Penza Warsaw University of Technology A. B. Romanowska Warsaw University of Technology Follow this and additional works at: https://lib.dr.iastate.edu/math_pubs Part of the Algebra Commons The complete bibliographic information for this item can be found at https://lib.dr.iastate.edu/ math_pubs/215. For information on how to cite this item, please visit http://lib.dr.iastate.edu/ howtocite.html. This Article is brought to you for free and open access by the Mathematics at Iowa State University Digital Repository. It has been accepted for inclusion in Mathematics Publications by an authorized administrator of Iowa State University Digital Repository. For more information, please contact [email protected]. Semilattice sums of algebras and Mal’tsev products of varieties Abstract The Mal’tsev product of two varieties of similar algebras is always a quasivariety. We consider when this quasivariety is a variety. The main result shows that if V is a strongly irregular variety with no nullary operations, and S is a variety, of the same type as V, equivalent to the variety of semilattices, then the Mal’tsev product V ◦ S is a variety. It consists precisely of semilattice sums of algebras in V. We derive an equational basis for the product from an equational basis for V. However, if V is a regular variety, then the Mal’tsev product may not be a variety. We discuss examples of various applications of the main result, and examine some detailed representations of algebras in V ◦ S.
    [Show full text]
  • 2-Semilattices: Residual Properties and Applications to the Constraint Satisfaction Problem
    2-Semilattices: Residual Properties and Applications to the Constraint Satisfaction Problem by Ian Payne A thesis presented to the University of Waterloo in fulfillment of the thesis requirement for the degree of Doctor of Philosophy in Pure Mathematics Waterloo, Ontario, Canada, 2017 c Ian Payne 2017 Examining Committee Membership The following served on the Examining Committee for this thesis. The decision of the Examining Committee is by majority vote. External Examiner George McNulty Professor University of South Carolina Supervisor Ross Willard Professor University of Waterloo Internal Member Stanley Burris Distinguished Professor Emeritus Adjunct Professor University of Waterloo Internal Member Rahim Moosa Professor University of Waterloo Internal-external Member Chris Godsil Professor University of Waterloo ii I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis, including any required final revisions, as accepted by my examiners. I understand that my thesis may be made electronically available to the public. iii Abstract Semilattices are algebras known to have an important connection to partially ordered sets. In particular, if a partially ordered set (A; ≤) has greatest lower bounds, a semilattice (A; ^) can be associated to the order where a ^ b is the greatest lower bound of a and b. In this thesis, we study a class of algebras known as 2-semilattices, which is a generalization of the class of semilattices. Similar to the correspondence between partial orders and semilattices, there is a correspondence between certain digraphs and 2-semilattices. That is, to every 2-semilattice, there is an associated digraph which holds information about the 2-semilattice.
    [Show full text]
  • Semigroups of Terms, Tree Languages, Menger Algebra of N-Ary Functions and Their Embedding Theorems
    S S symmetry Article Semigroups of Terms, Tree Languages, Menger Algebra of n-Ary Functions and Their Embedding Theorems Thodsaporn Kumduang 1 and Sorasak Leeratanavalee 1,2,* 1 Department of Mathematics, Faculty of Science, Chiang Mai University, Chiang Mai 50200, Thailand; [email protected] 2 Research Center in Mathematics and Applied Mathematics, Department of Mathematics, Faculty of Science, Chiang Mai University, Chiang Mai 50200, Thailand * Correspondence: [email protected] Abstract: The concepts of terms and tree languages are significant tools for the development of research works in both universal algebra and theoretical computer science. In this paper, we es- tablish a strong connection between semigroups of terms and tree languages, which provides the tools for studying monomorphisms between terms and generalized hypersubstitutions. A novel concept of a seminearring of non-deterministic generalized hypersubstitutions is introduced and some interesting properties among subsets of its are provided. Furthermore, we prove that there are monomorphisms from the power diagonal semigroup of tree languages and the monoid of generalized hypersubstitutions to the power diagonal semigroup of non-deterministic generalized hypersubstitutions and the monoid of non-deterministic generalized hypersubstitutions, respectively. Finally, the representation of terms using the theory of n-ary functions is defined. We then present the Cayley’s theorem for Menger algebra of terms, which allows us to provide a concrete example via full transformation semigroups. Citation: Kumduang, T.; Leeratanavalee, S. Semigroups of Keywords: terms; tree languages; generalized hypersubstitutions; n-ary functions Terms, Tree Languages, Menger Algebra of n-Ary Functions and Their MSC: 08A02; 08A40; 08A70; 20N15 Embedding Theorems. Symmetry 2021, 13, 558.
    [Show full text]
  • UNIVERSAL ALGEBRA Abstract Approved _____MMEMIIIMI Norman Franzen
    AN ABSTRACT OF THE THESIS OF JUNPEI SEKINO for the MASTER OF SCIENCE (Name) (Degree) ,, in MATHEMATICS presented on () t ,{, i >_: ¡ ``¡2 (Major) (Date) Title: UNIVERSAL ALGEBRA Abstract approved _____MMEMIIIMI Norman Franzen In this paper, we are concerned with the very general notion of a universal algebra. A universal algebra essentially consists of a set A together with a possibly infinite set of finitary operations on. A. Generally, these operations are related by means of equations, yield- ing different algebraic structures such as groups, groups with oper- ators, modules, rings, lattices, etc. This theory is concerned with those theorems which are common to all these various algebraic sys- tems. In particular, the fundamental isomorphism and homomorphism theorems are covered, as well as, the Jordan- Holder theorem and the Zassenhaus lemma. Furthermore, new existence proofs are given for sums and free algebras in any primitive class of universal algebras. The last part treats the theory of groups with multi- operators in a manner essentially different from that of P. J. Higgins. The ap- proach taken here generalizes the theorems on groups with operators as found in Jacobson's "Lectures in Abstract Algebra, " vol. I. The basic language of category theory is used whenever conven- ient. Universal Algebra by Junpei Sekino A THESIS submitted to Oregon State University in partial fulfillment of the requirements for the degree of Master of Science June 1969 APPROVED: Assistant Professor of Mathematics in charge of major Acting Chairman of Department of Mathematics Dean of ra uate c ool Date thesis is presented ( ;( Typed by Clover Redfern for JUNPEI SEKINO ACKNOWLEDGMENT I wish to acknlowledge my gratitude to Mr.
    [Show full text]
  • Locally Compact Vector Spaces and Algebras Over Discrete Fieldso
    LOCALLY COMPACT VECTOR SPACES AND ALGEBRAS OVER DISCRETE FIELDSO BY SETH WARNER The structure of locally compact vector spaces over complete division rings topologized by a proper absolute value (or, more generally, over complete division rings of type V) is summarized in the now classical theorem that such spaces are necessarily finite-dimensional and are topologically isomorphic to the cartesian product of a finite number of copies of the scalar division ring [9, Theorems 5 and 7], [6, pp. 27-31]. Here we shall continue a study of locally compact vector spaces and algebras over infinite discrete fields that was initiated in [16]. Since any topological vector space over a topological division ring K remains a topological vector space if K is retopologized with the discrete topology, some restriction needs to be imposed in our investigation, and the most natural restriction is straightness : A topological vector space F over a topological division ring K is straight if for every nonzero ae E,fa: X -^ Xa is a homeomorphism from K onto the one-dimensional subspace generated by a. Thus if K is discrete, a straight A^-vector space is one all of whose one-dimensional subspaces are discrete. Any Hausdorff vector space over a division ring topologized by a proper absolute value is straight [6, Proposition 2, p. 25]. In §1 we shall prove that if F is an indiscrete straight locally compact vector space over an infinite discrete division ring K, then K is an absolutely algebraic field of prime characteristic and [F : K] > X0. In §2 we shall see that finite- dimensional subspaces of straight locally compact vector spaces need not be discrete.
    [Show full text]
  • Universal Algebra Today Part I
    Universal Algebra Today Part I Libor Barto Charles University, Prague 55th Summer School on Algebra and Ordered Sets Nov´ySmokovec, 3{8 Sep 2017 L. Barto (CUNI) UA Today I SSAOS 2017 1 / 26 Outline I Today: Universal Algebra yesterday I Tommorow: Universal Algebra today I Thursday: Universal Algebra tommorow L. Barto (CUNI) UA Today I SSAOS 2017 2 / 26 About the tutorial I I will give you my (present) opinions on I What is Universal Algebra =UA (Part I) I Basic concepts and ideas in UA (Part I) I More advanced concepts and ideas (Part II) I Directions (Part III) I I will concentrate on concepts and proofs. This is not a survey of the most important results. I Interrupt me! I Apologies: typos, ugly slides, incorrect theorems and proofs, . L. Barto (CUNI) UA Today I SSAOS 2017 3 / 26 UA = study of general algebraic structures I Algebras in mathematics I Classic algebras { fields, rings, modules (geometry, analysis, number theory) I Groups as symmetries (algebra, geometry, combinatorics) I Lattices (combinatorics, logic, semantics in CS) I Semigroups (combinatorics, automata and languages) I Quasigroups, . (combinatorics, geometry) I GM: What do you do in UA? I UA: Generalize (HSP, iso theorems, decompositions) I UA: Organize (Mal'tsev conditions) I UA: Study particular classes above { not this tutorial I UA: Develop complicated, monumental, deep, great theories for large classes (commutator theory, TCT) I GM: Why? L. Barto (CUNI) UA Today I SSAOS 2017 4 / 26 Why? I GM: Why do you develop general theories? I UA: To answer complicated questions . in UA For some reason, we are especially excited about identities = universally quantified equations (GM: \hmm, interesting .
    [Show full text]
  • GENERATING SUBDIRECT PRODUCTS 1. Introduction A
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by St Andrews Research Repository GENERATING SUBDIRECT PRODUCTS PETER MAYR AND NIK RUSKUCˇ Abstract. We study conditions under which subdirect products of various types of algebraic structures are finitely generated or finitely presented. In the case of two factors, we prove general results for arbitrary congruence per- mutable varieties, which generalise previously known results for groups, and which apply to modules, rings, K-algebras and loops. For instance, if C is a fiber product of A and B over a common quotient D, and if A, B and D are finitely presented, then C is finitely generated. For subdirect products of more than two factors we establish a general connection with projections on pairs of factors and higher commutators. More detailed results are provided for groups, loops, rings and K-algebras. In particular, let C be a subdirect product of K- algebras A1;:::;An for a Noetherian ring K such that the projection of C onto any Ai × Aj has finite co-rank in Ai × Aj. Then C is finitely generated (resp. finitely presented) if and only if all Ai are finitely generated (resp. finitely presented). Finally, examples of semigroups and lattices are provided which indicate further complications as one ventures beyond congruence permutable varieties. 1. Introduction A subdirect product of algebraic structures A and B is a subalgebra C of the direct product A × B such that the projections of A × B onto A and B both remain surjective when restricted to C.
    [Show full text]
  • Subgroups of Direct Products of Limit Groups
    ANNALS OF MATHEMATICS Subgroups of direct products of limit groups By Martin R. Bridson, James Howie, Charles F. Miller III, and Hamish Short SECOND SERIES, VOL. 170, NO. 3 November, 2009 anmaah Annals of Mathematics, 170 (2009), 1447–1467 Subgroups of direct products of limit groups By MARTIN R. BRIDSON, JAMES HOWIE, CHARLES F. MILLER III, and HAMISH SHORT Dedicated to the memory of John Stallings Abstract If 1; : : : ; n are limit groups and S 1 n is of type FPn.Q/ then S contains a subgroup of finite index that is itself a direct product of at most n limit groups. This answers a question of Sela. 1. Introduction The systematic study of the higher finiteness properties of groups was initiated forty years ago by Wall [28] and Serre [25]. In 1963, Stallings [27] constructed the first example of a finitely presented group with infinite-dimensional H3. Q/; I his example was a subgroup of a direct product of three free groups. This was the first indication of the great diversity to be found amongst the finitely presented subgroups of direct products of free groups, a theme developed in [5]. In contrast, Baumslag and Roseblade [3] proved that in a direct product of two free groups the only finitely presented subgroups are the obvious ones: such a subgroup is either free or has a subgroup of finite index that is a direct product of free groups. In [10] the present authors explained this contrast by proving that the exotic behaviour among the finitely presented subgroups of direct products of free groups is accounted for entirely by the failure of higher homological-finiteness conditions.
    [Show full text]
  • Lectures on Universal Algebra
    Lectures on Universal Algebra Matt Valeriote McMaster University November 8, 1999 1 Algebras In this ¯rst section we will consider some common features of familiar alge- braic structures such as groups, rings, lattices, and boolean algebras to arrive at a de¯nition of a general algebraic structure. Recall that a group G consists of a nonempty set G, along with a binary ¡1 operation ¢ : G ! G, a unary operation : G ! G, and a constant 1G such that ² x ¢ (y ¢ z) = (x ¢ y) ¢ z for all x, y, z 2 G, ¡1 ¡1 ² x ¢ x = 1G and x ¢ x = 1G for all x 2 G, ² 1G ¢ x = x and x ¢ 1G = x for all x 2 G. A group is abelian if it additionally satis¯es: x ¢ y = y ¢ x for all x, y 2 G. A ring R is a nonempty set R along with binary operations +, ¢, a unary operation ¡, and constants 0R and 1R which satisfy ² R, along with +, ¡, and 0R is an abelian group. ² x ¢ (y ¢ z) = (x ¢ y) ¢ z for all x, y, z 2 G. ² x ¢ (y + z) = (x ¢ y) + (x ¢ z) and (y + z) ¢ x = (y ¢ x) + (z ¢ x) for all x, y, z 2 G. 1 ² 1G ¢ x = x and x ¢ 1G = x for all x 2 G. Lattices are algebras of a di®erent nature, they are essentially an algebraic encoding of partially ordered sets which have the property that any pair of elements of the ordered set has a least upper bound and a greatest lower bound. A lattice L consists of a nonempty set L, equipped with two binary operations ^ and _ which satisfy: ² x ^ x = x and x _ x = x for all x 2 L, ² x ^ y = y ^ x and x _ y = y _ x for all x, y 2 L, ² x ^ (y _ x) = x and x _ (y ^ x) = x for all x, y 2 L.
    [Show full text]
  • Universal Algebra and Diagrammatic Reasoning
    Universal Algebra and Diagrammatic Reasoning John Baez Geometry of Computation 2006 January 30 - Feburary 3 = figures by Aaron D. Lauda available online at http://math.ucr.edu/home/baez/universal/ 1 Universal Algebra Modern universal algebra is the study of general mathematical structures, especially those with an `algebraic' flavor. For example: Monads describe `extra algebraic • structure on objects of one fixed category'. PROs describe `extra algebraic • structure on objects of any monoidal category'. PROPs describe `extra algebraic • structure on objects of any sym- metric monoidal category'. Algebraic Theories describe `ex- • tra algebraic structure on objects of any category with finite prod- ucts'. 2 For example: There's a monad on Set whose • algebras are groups. There's an algebraic theory whose • algebras in any category with finite products C are `groups in C'. There's no PROP whose algebras • are groups, but there's a PROP for monoids. PROPs describe fewer structures, but apply to more contexts: e.g., the category of Hilbert spaces with its tensor product. In this quantum- mechanical context we cannot `du- plicate or delete information', so the group axiom g g 1 = 1 · − cannot be expressed. 3 In modern universal algebra we de- scribe operations using diagrams with inputs and outputs. Physicists do the same with Feynman diagrams: ' - ' J - ' K - ÙI ' #c -- ÙI ' K -- ÙI '' _ J ×G - ÙI '' K -ÙI ' J ×G - ÙI ' '' J V ' K Z ' J Q Y Y + U + M + + Y T + O J ^ ^ O ÙI ×G ^ J ÔD ÓC · · · ÕE · · · For example, all the diagrams above stand for operators between Hilbert spaces: He Hγ He ⊗ ! Similar diagrams show up in other contexts: electrical circuits • logic circuits • flow charts • and part of our job is to unify these.
    [Show full text]