DOCSLIB.ORG

A Semigroup Is Finite Iff It Is Chain-Finite and Antichain-Finite

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
A Semigroup Is Finite Iff It Is Chain-Finite and Antichain-Finite axioms Article A Semigroup Is Finite Iff It Is Chain-Finite and Antichain-Finite Iryna Banakh 1,† , Taras Banakh 2,3,† and Serhii Bardyla 4,*,† 1 Pidstryhach Institute for Applied Problems of Mechanics and Mathematics, National Academy of Sciences of Ukraine, Naukova 3b, 79060 Lviv, Ukraine; [email protected] 2 Faculty of Mehcanics and Mathematics, Ivan Franko National University of Lviv, Universytetska 1, 79000 Lviv, Ukraine; [email protected] 3 Katedra Matematyki, Jan Kochanowski University in Kielce, Universytecka 7, 25-406 Kielce, Poland 4 Kurt Gödel Research Center, Institute of Mathematics, University of Vienna, 1090 Vienna, Austria * Correspondence: [email protected] † These authors contributed equally to this work. Abstract: A subset A of a semigroup S is called a chain (antichain) if ab 2 fa, bg (ab 2/ fa, bg) for any (distinct) elements a, b 2 A. A semigroup S is called periodic if for every element x 2 S there exists n 2 N such that xn is an idempotent. A semigroup S is called (anti)chain-finite if S contains no infinite (anti)chains. We prove that each antichain-finite semigroup S is periodic and for every p idempotent e of S the set ¥ e = fx 2 S : 9n 2 N (xn = e)g is finite. This property of antichain-finite semigroups is used to prove that a semigroup is finite if and only if it is chain-finite and antichain- finite. Furthermore, we present an example of an antichain-finite semilattice that is not a union of finitely many chains. Keywords: semigroup; semilattice; chain; antichain MSC: 20M10; 06F05; 05E16 Citation: Banakh, I.; Banakh, T.; 1. Introduction Bardyla, S. A Semigroup Is Finite It is well-known that a partially ordered set X is finite iff all chains and antichains Iff It Is Chain-Finite and in X are finite. The notions of chain and antichain are well-known in the theory of order Antichain-Finite. Axioms 2021, 10, 9. (see, e.g., ([1] (O-1.6)) or [2]). In this paper we present a similar characterization of finite https://doi.org/10.3390/axioms10 semigroups in terms of finite chains and antichains. 010009 Let us recall that a magma is a set S endowed with a binary operation S × S ! S, hx, yi 7! xy. If the binary operation is associative, then the magma S is called a semigroup.A Received: 8 December 2020 semilattice is a commutative semigroup whose elements are idempotents. Each semilattice Accepted: 13 January 2021 S carries a natural partial order ≤ defined by x ≤ y iff xy = yx = x. Observe that two Published: 16 January 2021 elements x, y of a semilattice are comparable with respect to the partial order ≤ if and only if xy 2 fx, yg. This observation motivates the following algebraic definition of chains and Publisher’s Note: MDPI stays neu- antichains in any magma. tral with regard to jurisdictional clai- ms in published maps and institutio- A subset A of a magma S is defined to be nal affiliations. •a chain if xy 2 fx, yg for any elements x, y 2 A; • an antichain if xy 2/ fx, yg for any distinct elements x, y 2 A. The definition implies that each chain consists of idempotents. S anti chain-finite Copyright: © 2021 by the authors. Li- A magma is defined to be ( ) if it contains no infinite (anti)chains. censee MDPI, Basel, Switzerland. Let us note that chain-finite semilattices play an important role in the theory of This article is an open access article complete topological semigroups. In [3], Stepp showed that for each homomorphism distributed under the terms and con- f : X ! Y from a chain-finite semilattice X to a Hausdorff topological semigroup Y, the ditions of the Creative Commons At- image f [X] is closed in Y. Banakh and Bardyla [4] extended the result of Stepp to the tribution (CC BY) license (https:// following characterization: creativecommons.org/licenses/by/ 4.0/). Theorem 1. For a semilattice X the following conditions are equivalent: Axioms 2021, 10, 9. https://doi.org/10.3390/axioms10010009 https://www.mdpi.com/journal/axioms Axioms 2021, 10, 9 2 of 6 • X is chain-finite; • X is closed in each Hausdorff topological semigroup containing X as a discrete subsemigroup; • For each homomorphism f : X ! Y into a Hausdorff topological semigroup Y, the image f [X] is closed; For other completeness properties of chain-finite semilattices see [4–6]. Antichain- finite posets and semilattices were investigated by Yokoyama [7]. The principal result of this note is the following theorem characterizing finite semigroups. Theorem 2. A semigroup S is finite if and only if it is chain-finite and antichain-finite. A crucial step in the proof of this theorem is the following proposition describing the (periodic) structure of antichain-finite semigroups. A semigroup S is called periodic if for every x 2 S there exists n 2 N such that xn is an idempotent of S. In this case [ p S = ¥ e, e2E(S) where E(S) = fx 2 S : xx = xg is the set of idempotents of S and p ¥ e = fx 2 S : 9n 2 N (xn = e)g for e 2 E(S). p Proposition 1. Each antichain-finite semigroup S is periodic and for every e 2 E(S) the set ¥ e is finite. Theorem2 and Proposition1 will be proved in the next section. Remark 1. Theorem2 does not generalize to magmas. To see this, consider the set of positive integers N endowed with the following binary operation: nm = n if n < m and nm = 1 if n ≥ m. This magma is infinite but each nonempty chain in the magma is of the form f1, ng for some n 2 N, and each nonempty antichain in this magma is a singleton. Next we present a simple example of an antichain-finite semilattice which is not a union of finitely many chains. Example 1. Consider the set S = fh2n − 1, 0i : n 2 Ng [ fh2n, mi : n, m 2 N, m ≤ 2ng endowed with the semilattice binary operation 8 >hx, ii if x = y and i = j; > <>hx − 1, 0i if x = y and i 6= j; hx, ii · hy, ji = >hx, ii if x < y; > :>hy, ji if y < x. It is straightforward to check that the semilattice S has the following properties: 1. S is antichain-finite; 2. S has arbitrarily long finite antichains; 3. S is not a union of finitely many chains; 4. The subsemilattice L = fh2n − 1, 0i : n 2 Ng of S is a chain; Axioms 2021, 10, 9 3 of 6 5.S admits a homomorphism r : S ! L such that r−1(hx, 0i) = fhy, ii 2 S : y 2 fx, x + 1gg is finite for every element hx, 0i 2 L. Example1 motivates the following question. Question 1. Let S be an antichain-finite semilattice. Is there a finite-to-one homomorphism r : S ! Y to a semilattice Y which is a finite union of chains? A function f : X ! Y is called finite-to-one if for every y 2 Y the preimage f −1(y) is finite. 2. Proofs of the Main Results In this section, we prove some lemmas implying Theorem2 and Proposition1. More precisely, Proposition1 follows from Lemmas1 and4; Theorem2 follows from Lemma5. The following lemma exploit ideas of Theorem 1.9 from [8]. Lemma 1. Every antichain-finite semigroup S is periodic. Proof. Given any element x 2 S we should find a natural number n 2 N such that xn is an idempotent. First we show that xn = xm for some n 6= m. Assuming that xn 6= xm for any distinct numbers n, m, we conclude that the set A = fxn : n 2 Ng is infinite and for any + n, m 2 N we have xnxm = xn m 2/ fxn, xmg, which means that A is an infinite antichain in S. However, such an antichain cannot exist as S is antichain-finite. This contradiction shows that xn = xm for some numbers n < m and then for the number k = m − n we have + + xn k = xm = xn. By induction we can prove that xn pk = xn for every p 2 N. Choose any numbers r, p 2 N such that r + n = pk and observe that xr+nxr+n = xr+nxpk = xrxn+pk = xrxn = xr+n, which means that xr+n is an idempotent and hence S is periodic. An element 1 2 S is called an identity of S if x1 = x = 1x for all x 2 S. For a semigroup S let S1 = S [ f1g where 1 is an element such that x1 = x = 1x for every x 2 S1. If S contains an identity, then we will assume that 1 is the identity of S and hence S1 = S. For a set A ⊆ S and element x 2 S we put xA = fxa : a 2 Ag and Ax = fax : a 2 Ag. For any element x of a semigroup S, the set 1 1 1 1 Hx = fy 2 S : yS = xS ^ S y = S xg is called the H-class of x. By Lemma I.7.9 [9], for every idempotent e its H-class He coincides with the maximal subgroup of S that contains the idempotent e. Lemma 2. If a semigroup S is antichain-finite, then for every idempotent e of S its H-class He is finite. Proof. Observe that the set He n feg is an antichain (this follows from the fact that the left and right shifts in the group He are injective).
Load more

Recommended publications
  • ON F-DERIVATIONS from SEMILATTICES to LATTICES
    Commun. Korean Math. Soc. 29 (2014), No. 1, pp. 27–36 http://dx.doi.org/10.4134/CKMS.2014.29.1.027 ON f-DERIVATIONS FROM SEMILATTICES TO LATTICES Yong Ho Yon and Kyung Ho Kim Abstract. In this paper, we introduce the notion of f-derivations from a semilattice S to a lattice L, as a generalization of derivation and f- derivation of lattices. Also, we define the simple f-derivation from S to L, and research the properties of them and the conditions for a lattice L to be distributive. Finally, we prove that a distributive lattice L is isomorphic to the class SDf (S,L) of all simple f-derivations on S to L for every ∧-homomorphism f : S → L such that f(x0) ∨ f(y0) = 1 for ∼ some x0,y0 ∈ S, in particular, L = SDf (S,L) for every ∧-homomorphism f : S → L such that f(x0) = 1 for some x0 ∈ S. 1. Introduction In some of the literature, authors investigated the relationship between the notion of modularity or distributivity and the special operators on lattices such as derivations, multipliers and linear maps. The notion and some properties of derivations on lattices were introduced in [10, 11]. Sz´asz ([10, 11]) characterized the distributive lattices by multipliers and derivations: a lattice is distributive if and only if the set of all meet- multipliers and of all derivations coincide. In [5] it was shown that every derivation on a lattice is a multiplier and every multiplier is a dual closure. Pataki and Sz´az ([9]) gave a connection between non-expansive multipliers and quasi-interior operators.
    [Show full text]
  • On Free Quasigroups and Quasigroup Representations Stefanie Grace Wang Iowa State University
    Iowa State University Capstones, Theses and Graduate Theses and Dissertations Dissertations 2017 On free quasigroups and quasigroup representations Stefanie Grace Wang Iowa State University Follow this and additional works at: https://lib.dr.iastate.edu/etd Part of the Mathematics Commons Recommended Citation Wang, Stefanie Grace, "On free quasigroups and quasigroup representations" (2017). Graduate Theses and Dissertations. 16298. https://lib.dr.iastate.edu/etd/16298 This Dissertation is brought to you for free and open access by the Iowa State University Capstones, Theses and Dissertations at Iowa State University Digital Repository. It has been accepted for inclusion in Graduate Theses and Dissertations by an authorized administrator of Iowa State University Digital Repository. For more information, please contact [email protected]. On free quasigroups and quasigroup representations by Stefanie Grace Wang A dissertation submitted to the graduate faculty in partial fulfillment of the requirements for the degree of DOCTOR OF PHILOSOPHY Major: Mathematics Program of Study Committee: Jonathan D.H. Smith, Major Professor Jonas Hartwig Justin Peters Yiu Tung Poon Paul Sacks The student author and the program of study committee are solely responsible for the content of this dissertation. The Graduate College will ensure this dissertation is globally accessible and will not permit alterations after a degree is conferred. Iowa State University Ames, Iowa 2017 Copyright c Stefanie Grace Wang, 2017. All rights reserved. ii DEDICATION I would like to dedicate this dissertation to the Integral Liberal Arts Program. The Program changed my life, and I am forever grateful. It is as Aristotle said, \All men by nature desire to know." And Montaigne was certainly correct as well when he said, \There is a plague on Man: his opinion that he knows something." iii TABLE OF CONTENTS LIST OF TABLES .
    [Show full text]
  • Class Semigroups of Prufer Domains
    JOURNAL OF ALGEBRA 184, 613]631Ž. 1996 ARTICLE NO. 0279 Class Semigroups of PruferÈ Domains S. Bazzoni* Dipartimento di Matematica Pura e Applicata, Uni¨ersita di Pado¨a, ¨ia Belzoni 7, 35131 Padua, Italy Communicated by Leonard Lipshitz View metadata, citation and similar papers at Receivedcore.ac.uk July 3, 1995 brought to you by CORE provided by Elsevier - Publisher Connector The class semigroup of a commutative integral domain R is the semigroup S Ž.R of the isomorphism classes of the nonzero ideals of R with the operation induced by multiplication. The aim of this paper is to characterize the PruferÈ domains R such that the semigroup S Ž.R is a Clifford semigroup, namely a disjoint union of groups each one associated to an idempotent of the semigroup. We find a connection between this problem and the following local invertibility property: an ideal I of R is invertible if and only if every localization of I at a maximal ideal of Ris invertible. We consider the Ž.a property, introduced in 1967 for PruferÈ domains R, stating that if D12and D are two distinct sets of maximal ideals of R, Ä 4Ä 4 then F RMM <gD1 /FRMM <gD2 . Let C be the class of PruferÈ domains satisfying the separation property Ž.a or with the property that each localization at a maximal ideal if finite-dimensional. We prove that, if R belongs to C, then the local invertibility property holds on R if and only if every nonzero element of R is contained only in a finite number of maximal ideals of R.
    [Show full text]
  • Noncommutative Unique Factorization Domainso
    NONCOMMUTATIVE UNIQUE FACTORIZATION DOMAINSO BY P. M. COHN 1. Introduction. By a (commutative) unique factorization domain (UFD) one usually understands an integral domain R (with a unit-element) satisfying the following three conditions (cf. e.g. Zariski-Samuel [16]): Al. Every element of R which is neither zero nor a unit is a product of primes. A2. Any two prime factorizations of a given element have the same number of factors. A3. The primes occurring in any factorization of a are completely deter- mined by a, except for their order and for multiplication by units. If R* denotes the semigroup of nonzero elements of R and U is the group of units, then the classes of associated elements form a semigroup R* / U, and A1-3 are equivalent to B. The semigroup R*jU is free commutative. One may generalize the notion of UFD to noncommutative rings by taking either A-l3 or B as starting point. It is obvious how to do this in case B, although the class of rings obtained is rather narrow and does not even include all the commutative UFD's. This is indicated briefly in §7, where examples are also given of noncommutative rings satisfying the definition. However, our principal aim is to give a definition of a noncommutative UFD which includes the commutative case. Here it is better to start from A1-3; in order to find the precise form which such a definition should take we consider the simplest case, that of noncommutative principal ideal domains. For these rings one obtains a unique factorization theorem simply by reinterpreting the Jordan- Holder theorem for right .R-modules on one generator (cf.
    [Show full text]
  • Semigroup C*-Algebras and Amenability of Semigroups
    SEMIGROUP C*-ALGEBRAS AND AMENABILITY OF SEMIGROUPS XIN LI Abstract. We construct reduced and full semigroup C*-algebras for left can- cellative semigroups. Our new construction covers particular cases already con- sidered by A. Nica and also Toeplitz algebras attached to rings of integers in number fields due to J. Cuntz. Moreover, we show how (left) amenability of semigroups can be expressed in terms of these semigroup C*-algebras in analogy to the group case. Contents 1. Introduction 1 2. Constructions 4 2.1. Semigroup C*-algebras 4 2.2. Semigroup crossed products by automorphisms 7 2.3. Direct consequences of the definitions 9 2.4. Examples 12 2.5. Functoriality 16 2.6. Comparison of universal C*-algebras 19 3. Amenability 24 3.1. Statements 25 3.2. Proofs 26 3.3. Additional results 34 4. Questions and concluding remarks 37 References 37 1. Introduction The construction of group C*-algebras provides examples of C*-algebras which are both interesting and challenging to study. If we restrict our discussion to discrete groups, then we could say that the idea behind the construction is to implement the algebraic structure of a given group in a concrete or abstract C*-algebra in terms of unitaries. It then turns out that the group and its group C*-algebra(s) are closely related in various ways, for instance with respect to representation theory or in the context of amenability. 2000 Mathematics Subject Classification. Primary 46L05; Secondary 20Mxx, 43A07. Research supported by the Deutsche Forschungsgemeinschaft (SFB 878) and by the ERC through AdG 267079.
    [Show full text]
  • Right Product Quasigroups and Loops
    RIGHT PRODUCT QUASIGROUPS AND LOOPS MICHAEL K. KINYON, ALEKSANDAR KRAPEZˇ∗, AND J. D. PHILLIPS Abstract. Right groups are direct products of right zero semigroups and groups and they play a significant role in the semilattice decomposition theory of semigroups. Right groups can be characterized as associative right quasigroups (magmas in which left translations are bijective). If we do not assume associativity we get right quasigroups which are not necessarily representable as direct products of right zero semigroups and quasigroups. To obtain such a representation, we need stronger assumptions which lead us to the notion of right product quasigroup. If the quasigroup component is a (one-sided) loop, then we have a right product (left, right) loop. We find a system of identities which axiomatizes right product quasigroups, and use this to find axiom systems for right product (left, right) loops; in fact, we can obtain each of the latter by adjoining just one appropriate axiom to the right product quasigroup axiom system. We derive other properties of right product quasigroups and loops, and conclude by show- ing that the axioms for right product quasigroups are independent. 1. Introduction In the semigroup literature (e.g., [1]), the most commonly used definition of right group is a semigroup (S; ·) which is right simple (i.e., has no proper right ideals) and left cancellative (i.e., xy = xz =) y = z). The structure of right groups is clarified by the following well-known representation theorem (see [1]): Theorem 1.1. A semigroup (S; ·) is a right group if and only if it is isomorphic to a direct product of a group and a right zero semigroup.
    [Show full text]
  • Semigroup C*-Algebras of Ax + B-Semigroups Li, X
    Semigroup C*-algebras of ax + b-semigroups Li, X © Copyright 2015 American Mathematical Society This is a pre-copyedited, author-produced PDF of an article accepted for publication in Transactions of the American Mathematical Society following peer review. The version of record is available http://www.ams.org/journals/tran/2016-368-06/S0002-9947-2015-06469- 1/home.html For additional information about this publication click this link. http://qmro.qmul.ac.uk/xmlui/handle/123456789/18071 Information about this research object was correct at the time of download; we occasionally make corrections to records, please therefore check the published record when citing. For more information contact [email protected] SEMIGROUP C*-ALGEBRAS OF ax + b-SEMIGROUPS XIN LI Abstract. We study semigroup C*-algebras of ax + b-semigroups over integral domains. The goal is to generalize several results about C*-algebras of ax + b- semigroups over rings of algebraic integers. We prove results concerning K-theory and structural properties like the ideal structure or pure infiniteness. Our methods allow us to treat ax+b-semigroups over a large class of integral domains containing all noetherian, integrally closed domains and coordinate rings of affine varieties over infinite fields. 1. Introduction Given an integral domain, let us form the ax + b-semigroup over this ring and con- sider the C*-algebra generated by the left regular representation of this semigroup. The particular case where the integral domain is given by the ring of algebraic inte- gers in a number field has been investigated in [C-D-L], [C-E-L1], [C-E-L2], [E-L], [Li4] and also [La-Ne], [L-R].
    [Show full text]
  • On the Representation of Boolean Magmas and Boolean Semilattices
    Chapter 1 On the representation of Boolean magmas and Boolean semilattices P. Jipsen, M. E. Kurd-Misto and J. Wimberley Abstract A magma is an algebra with a binary operation ·, and a Boolean magma is a Boolean algebra with an additional binary operation · that distributes over all finite Boolean joins. We prove that all square-increasing (x ≤ x2) Boolean magmas are embedded in complex algebras of idempotent (x = x2) magmas. This solves a problem in a recent paper [3] by C. Bergman. Similar results are shown to hold for commutative Boolean magmas with an identity element and a unary inverse operation, or with any combination of these properties. A Boolean semilattice is a Boolean magma where · is associative, com- mutative, and square-increasing. Let SL be the class of semilattices and let S(SL+) be all subalgebras of complex algebras of semilattices. All members of S(SL+) are Boolean semilattices and we investigate the question of which Boolean semilattices are representable, i.e., members of S(SL+). There are 79 eight-element integral Boolean semilattices that satisfy a list of currently known axioms of S(SL+). We show that 72 of them are indeed members of S(SL+), leaving the remaining 7 as open problems. 1.1 Introduction The study of complex algebras of relational structures is a central part of algebraic logic and has a long history. In the classical setting, complex al- gebras connect Kripke semantics for polymodal logics to Boolean algebras with normal operators. Several varieties of Boolean algebras with operators are generated by the complex algebras of a standard class of relational struc- tures.
    [Show full text]
  • Divisibility Theory of Semi-Hereditary Rings
    PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 138, Number 12, December 2010, Pages 4231–4242 S 0002-9939(2010)10465-3 Article electronically published on July 9, 2010 DIVISIBILITY THEORY OF SEMI-HEREDITARY RINGS P. N. ANH´ AND M. SIDDOWAY (Communicated by Birge Huisgen-Zimmermann) Abstract. The semigroup of finitely generated ideals partially ordered by in- verse inclusion, i.e., the divisibility theory of semi-hereditary rings, is precisely described by semi-hereditary Bezout semigroups. A Bezout semigroup is a commutative monoid S with 0 such that the divisibility relation a|b ⇐⇒ b ∈ aS is a partial order inducing a distributive lattice on S with multiplication dis- tributive on both meets and joins, and for any a, b, d = a ∧ b ∈ S, a = da1 there is b1 ∈ S with a1 ∧ b1 =1,b= db1. S is semi-hereditary if for each a ∈ S there is e2 = e ∈ S with eS = a⊥ = {x ∈ S | ax =0}. The dictionary is therefore complete: abelian lattice-ordered groups and semi-hereditary Be- zout semigroups describe divisibility of Pr¨ufer (i.e., semi-hereditary) domains and semi-hereditary rings, respectively. The construction of a semi-hereditary Bezout ring with a pre-described semi-hereditary Bezout semigroup is inspired by Stone’s representation of Boolean algebras as rings of continuous functions and by Gelfand’s and Naimark’s analogous representation of commutative C∗- algebras. Introduction In considering the structure of rings, classical number theory suggests a careful study of the semigroup of divisibility, defined as the semigroup of principal (or more generally finitely generated) ideals partially ordered by reverse inclusion.
    [Show full text]
  • Binary Opera- Tions, Magmas, Monoids, Groups, Rings, fields and Their Homomorphisms
    1. Introduction In this chapter, I introduce some of the fundamental objects of algbera: binary opera- tions, magmas, monoids, groups, rings, fields and their homomorphisms. 2. Binary Operations Definition 2.1. Let M be a set. A binary operation on M is a function · : M × M ! M often written (x; y) 7! x · y. A pair (M; ·) consisting of a set M and a binary operation · on M is called a magma. Example 2.2. Let M = Z and let + : Z × Z ! Z be the function (x; y) 7! x + y. Then, + is a binary operation and, consequently, (Z; +) is a magma. Example 2.3. Let n be an integer and set Z≥n := fx 2 Z j x ≥ ng. Now suppose n ≥ 0. Then, for x; y 2 Z≥n, x + y 2 Z≥n. Consequently, Z≥n with the operation (x; y) 7! x + y is a magma. In particular, Z+ is a magma under addition. Example 2.4. Let S = f0; 1g. There are 16 = 42 possible binary operations m : S ×S ! S . Therefore, there are 16 possible magmas of the form (S; m). Example 2.5. Let n be a non-negative integer and let · : Z≥n × Z≥n ! Z≥n be the operation (x; y) 7! xy. Then Z≥n is a magma. Similarly, the pair (Z; ·) is a magma (where · : Z×Z ! Z is given by (x; y) 7! xy). Example 2.6. Let M2(R) denote the set of 2 × 2 matrices with real entries. If ! ! a a b b A = 11 12 , and B = 11 12 a21 a22 b21 b22 are two matrices, define ! a b + a b a b + a b A ◦ B = 11 11 12 21 11 12 12 22 : a21b11 + a22b21 a21b12 + a22b22 Then (M2(R); ◦) is a magma.
    [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]
  • Steps in the Representation of Concept Lattices and Median Graphs Alain Gély, Miguel Couceiro, Laurent Miclet, Amedeo Napoli
    Steps in the Representation of Concept Lattices and Median Graphs Alain Gély, Miguel Couceiro, Laurent Miclet, Amedeo Napoli To cite this version: Alain Gély, Miguel Couceiro, Laurent Miclet, Amedeo Napoli. Steps in the Representation of Concept Lattices and Median Graphs. CLA 2020 - 15th International Conference on Concept Lattices and Their Applications, Sadok Ben Yahia; Francisco José Valverde Albacete; Martin Trnecka, Jun 2020, Tallinn, Estonia. pp.1-11. hal-02912312 HAL Id: hal-02912312 https://hal.inria.fr/hal-02912312 Submitted on 5 Aug 2020 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. Steps in the Representation of Concept Lattices and Median Graphs Alain Gély1, Miguel Couceiro2, Laurent Miclet3, and Amedeo Napoli2 1 Université de Lorraine, CNRS, LORIA, F-57000 Metz, France 2 Université de Lorraine, CNRS, Inria, LORIA, F-54000 Nancy, France 3 Univ Rennes, CNRS, IRISA, Rue de Kérampont, 22300 Lannion, France {alain.gely,miguel.couceiro,amedeo.napoli}@loria.fr Abstract. Median semilattices have been shown to be useful for deal- ing with phylogenetic classication problems since they subsume me- dian graphs, distributive lattices as well as other tree based classica- tion structures. Median semilattices can be thought of as distributive _-semilattices that satisfy the following property (TRI): for every triple x; y; z, if x ^ y, y ^ z and x ^ z exist, then x ^ y ^ z also exists.
    [Show full text]