DOCSLIB.ORG

Isotone Maps on Lattices

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Isotone Maps on Lattices This is the final preprint version of a paper which appeared in Algebra Universalis, 68 (2012) 17-37. The published version is accessible to subscribers at http://dx.doi.org/10.1007/s00012-012-0191-2 . Isotone maps on lattices G. M. Bergman and G. Gratzer¨ Abstract. Let L = (Li j i 2 I) be a family of lattices in a nontrivial lattice vari- ety V, and let 'i : Li ! M, for i 2 I, be isotone maps (not assumed to be lattice homomorphisms) to a common lattice M (not assumed to lie in V). We show that the maps 'i can be extended to an isotone map ': L ! M, where L = FreeV L is the free product of the Li in V. This was known for L = V, the variety of all lattices. The above free product L can be viewed as the free lattice in V on the partial lattice P formed by the disjoint union of the Li. The analog of the above result does not, however, hold for the free lattice L on an arbitrary partial lattice P . We show that the only codomain lattices M for which that more general statement holds are the complete lattices. On the other hand, we prove the analog of our main result for a class of partial lattices P that are not-quite-disjoint unions of lattices. We also obtain some results similar to our main one, but with the relationship lat- tices : orders replaced either by semilattices : orders or by lattices : semilattices. Some open questions are noted. 1. Introduction By Yu. I. Sorkin [15, Theorem 3], if L = (Li j i 2 I) is a family of lattices and 'i : Li ! M are isotone maps of the lattices Li into a lattice M, then there exists an isotone map ' from the free product Free L of the Li to M that extends all the 'i. (There are some difficulties with Sorkin's original proof; but a simple, correct proof is given by G. Gr¨atzer,H. Lakser and C. R. Platt in [11, x4].) 2010 Mathematics Subject Classification: Primary: 06B25. Secondary: 06B20, 06B23. Key words and phrases: Free product of lattices; varieties, prevarieties and quasivarieties of lattices; isotone map; free lattice on a partial lattice; semilattice. 2 G. M. Bergman and G. Gr¨atzer Algebra univers. Our main result, proved in Section 2, is a generalization of this fact, with Free L replaced by FreeV L, the free product of the Li in any nontrivial va- riety V of lattices containing them | though not necessarily containing M. (In Section 3, we explore some variants of our proof of this result.) We may regard FreeV L as the free lattice in V on the partial lattice P given by the disjoint union of the Li. Does the analog of the above result hold for more general partial lattices P and their free lattices L? In Section 4 we find that the lattices M such that this statement holds for all partial lattices P are the complete lattices. On the other hand, we describe in Section 5 a class of partial lattices P , related to but distinct from the class considered in Section 2, for which the full analog of the result of that section holds. Since semilattices lie between orders and lattices, it is plausible that state- ments similar to our main result should hold, either with \lattice" weakened to \semilattice", or with \lattice" unchanged but \isotone map" strengthened to \semilattice homomorphism". In Section 6 we shall find that the former statement is easy to prove. In that section and Section 7, we obtain sev- eral approximations to the latter statement; we do not know whether the full statement holds. The reader familiar with the concepts of quasivariety and prevariety will find that the proofs given in this note for varieties of lattices in fact work for those more general classes. However, varieties are not sufficient for the result of Section 7, so we develop that in terms of prevarieties. In Section 8 we note some open questions. For general definitions and results in lattice theory, see [8] or [9]. For another context in which isotone maps among lattices have appeared in the literature|in this case, isotone sections of lattice homomorphisms|see R. Freese, J. Jeˇzek,and J. B. Nation [6, pp. 99{107, 133] and R. Freese [5]. We are indebted to R. Freese for pointing us to those works, and for the related observation following Corollary 4 below; and to A. V. Kravchenko for an extensive correspondence regarding Sorkin's original argument. 2. Extending isotone maps to free product lattices Let V be a nontrivial lattice variety, that is, a variety V of lattices having a member with more than one element. Let L = (Li j i 2 I) be a fam- ily of lattices in V, and L = FreeV L their free product in V. Finally, let ('i : Li ! M j i 2 I) be a family of isotone maps into a lattice M, not as- sumed to lie in V. To show that the 'i have a common extension to L, it suffices, by the 0 universal property of L, to find some L 2 V such that each map 'i factors 0 Li ! L ! M, where the first map is a lattice homomorphism, and the second an isotone map not depending on i. So let us, for now, forget free products, and obtain such a lattice L0. Vol. 00, XX Isotone maps on lattices 3 We first note (as remarked in [11, last paragraph] for V = L) that this is easy if M has a least element, or more generally, if its subsets 'i(Li) have a common lower bound e 2 M. In that case, we begin by enlarging all the Li to lattices L¯i = feig + Li, where ei is a new least element, and extend the 'i to maps 0 Q '¯i : L¯i ! M mapping ei to e. Now let L be the sublattice of (L¯i j i 2 I) consisting of the elements x = (xi j i 2 I) such that xi = ei for all but 0 finitely many i; and let us map each Li into L by the homomorphism sending x 2 Li to the element having i-component x, and j-component ej for all j 6= i. We now map L0 to M using the isotone map given by W 0 (x) = (' ¯i(xi) j i 2 I ) for x = (xi j i 2 I) 2 L . (1) This infinite join is defined because all but finitely many of the joinands are 0 e; and it is easy to verify that for each i, the composite map Li ! L ! M is the given isotone map 'i, as required. If, rather, the 'i(Li) have a common upper bound, the dual construction is, of course, available. In the absence of either sort of bound, we shall follow the same pattern of adjoining to the Li elements ei with a common image e in M (this time an arbitrary element of that lattice); but that construction takes a bit more work, as does the one analogous to the definition (1) of the isotone map : L0 ! M. The first of these steps is carried out in the following lemma (where L corre- sponds to the above Li). Lemma 1. Let ': L ! M be any isotone map of lattices, and e any ele- ment of M. Then there exists a lattice extension L¯ of L, and an isotone map '¯: L¯ ! M extending ', such that e 2 '¯(L¯). Moreover, L¯ can be taken to lie in any nontrivial lattice variety V containing L. Proof. Let L¯ = L × C2 × C2, where C2 is the 2-element lattice f0; 1g, and embed L in L¯ by x 7! (x; 0; 1). Define' ¯: L¯ ! M by 8 > '¯(x; 0; 1) = '(x); > > <> '¯(x; 1; 0) = e; (2) > '¯(x; 0; 0) = '(x) ^ e; > > :> '¯(x; 1; 1) = '(x) _ e: It is easy to check that' ¯ is isotone, and it clearly has e in its range. Since C2 = f0; 1g belongs to every nontrivial variety of lattices, L¯ will belong to any nontrivial variety V containing L. The next lemma gives the construction we will use to weld our I-tuple of isotone maps into one map. Lemma 2. Let M be a lattice, e any element of M, and I a nonempty set. Let M 0 be the sublattice of M I consisting of those elements f such that f(i) = e 4 G. M. Bergman and G. Gr¨atzer Algebra univers. for all but finitely many i 2 I. Then there exists a map : M 0 ! M such that is isotone (3) and For every i 2 I, and every f 2 M 0 satisfying f(j) = e for all j 6= i, (4) we have (f) = f(i). Proof. For f 2 M 0, define 8 <V( f(i) j i 2 I ) if f(i) ≤ e for all i 2 I, (f) = (5) W : ( f(i) j i 2 I; f(i) e ) otherwise. These meets and joins are defined because for each f 2 M 0, there are only finitely many distinct values f(i). It is easy to see that satisfies (4). To obtain (3), observe that For f ≤ g in M 0, we have fi j f(i) 6≤ eg ⊆ fi j g(i) 6≤ eg. (6) Hence given f ≤ g, there are three possibilities: Either the definitions of (f) and (g) both fall under the first case of (5), or they both fall under the second, or that of (f) falls under the first and that of (g) under the second.
Load more

Recommended publications
  • On the Lattice Structure of Quantum Logic
    BULL. AUSTRAL. MATH. SOC. MOS 8106, *8IOI, 0242 VOL. I (1969), 333-340 On the lattice structure of quantum logic P. D. Finch A weak logical structure is defined as a set of boolean propositional logics in which one can define common operations of negation and implication. The set union of the boolean components of a weak logical structure is a logic of propositions which is an orthocomplemented poset, where orthocomplementation is interpreted as negation and the partial order as implication. It is shown that if one can define on this logic an operation of logical conjunction which has certain plausible properties, then the logic has the structure of an orthomodular lattice. Conversely, if the logic is an orthomodular lattice then the conjunction operation may be defined on it. 1. Introduction The axiomatic development of non-relativistic quantum mechanics leads to a quantum logic which has the structure of an orthomodular poset. Such a structure can be derived from physical considerations in a number of ways, for example, as in Gunson [7], Mackey [77], Piron [72], Varadarajan [73] and Zierler [74]. Mackey [77] has given heuristic arguments indicating that this quantum logic is, in fact, not just a poset but a lattice and that, in particular, it is isomorphic to the lattice of closed subspaces of a separable infinite dimensional Hilbert space. If one assumes that the quantum logic does have the structure of a lattice, and not just that of a poset, it is not difficult to ascertain what sort of further assumptions lead to a "coordinatisation" of the logic as the lattice of closed subspaces of Hilbert space, details will be found in Jauch [8], Piron [72], Varadarajan [73] and Zierler [74], Received 13 May 1969.
    [Show full text]
  • Topological Duality and Lattice Expansions Part I: a Topological Construction of Canonical Extensions
    TOPOLOGICAL DUALITY AND LATTICE EXPANSIONS PART I: A TOPOLOGICAL CONSTRUCTION OF CANONICAL EXTENSIONS M. ANDREW MOSHIER AND PETER JIPSEN 1. INTRODUCTION The two main objectives of this paper are (a) to prove topological duality theorems for semilattices and bounded lattices, and (b) to show that the topological duality from (a) provides a construction of canonical extensions of bounded lattices. The paper is first of two parts. The main objective of the sequel is to establish a characterization of lattice expansions, i.e., lattices with additional operations, in the topological setting built in this paper. Regarding objective (a), consider the following simple question: Is there a subcategory of Top that is dually equivalent to Lat? Here, Top is the category of topological spaces and continuous maps and Lat is the category of bounded lattices and lattice homomorphisms. To date, the question has been answered positively either by specializing Lat or by generalizing Top. The earliest examples are of the former sort. Tarski [Tar29] (treated in English, e.g., in [BD74]) showed that every complete atomic Boolean lattice is represented by a powerset. Taking some historical license, we can say this result shows that the category of complete atomic Boolean lattices with complete lat- tice homomorphisms is dually equivalent to the category of discrete topological spaces. Birkhoff [Bir37] showed that every finite distributive lattice is represented by the lower sets of a finite partial order. Again, we can now say that this shows that the category of finite distributive lattices is dually equivalent to the category of finite T0 spaces and con- tinuous maps.
    [Show full text]
  • 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]
  • Lattice-Ordered Loops and Quasigroupsl
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector JOIJRNALOFALGEBRA 16, 218-226(1970) Lattice-Ordered Loops and Quasigroupsl TREVOREVANS Matkentatics Department, Emory University, Atlanta, Georgia 30322 Communicated by R. H, Brwk Received April 16, 1969 In studying the effect of an order on non-associativesystems such as loops or quasigroups, a natural question to ask is whether some order condition which implies commutativity in the group case implies associativity in the corresponding loop case. For example, a well-known theorem (Birkhoff, [1]) concerning lattice ordered groups statesthat if the descendingchain condition holds for the positive elements,then the 1.0. group is actually a direct product of infinite cyclic groups with its partial order induced in the usual way by the linear order in the factors. It is easy to show (Zelinski, [6]) that a fully- ordered loop satisfying the descendingchain condition on positive elements is actually an infinite cyclic group. In this paper we generalize this result and Birkhoff’s result, by showing that any lattice-ordered loop with descending chain condition on its positive elements is associative. Hence, any 1.0. loop with d.c.c. on its positive elements is a free abelian group. More generally, any lattice-ordered quasigroup in which bounded chains are finite, is isotopic to a free abelian group. These results solve a problem in Birkhoff’s Lattice Theory, 3rd ed. The proof uses only elementary properties of loops and lattices. 1. LATTICE ORDERED LOOPS We will write loops additively with neutral element0.
    [Show full text]
  • Representation Stability, Configuration Spaces, and Deligne
    Representation Stability, Configurations Spaces, and Deligne–Mumford Compactifications by Philip Tosteson A dissertation submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy (Mathematics) in The University of Michigan 2019 Doctoral Committee: Professor Andrew Snowden, Chair Professor Karen Smith Professor David Speyer Assistant Professor Jennifer Wilson Associate Professor Venky Nagar Philip Tosteson [email protected] orcid.org/0000-0002-8213-7857 © Philip Tosteson 2019 Dedication To Pete Angelos. ii Acknowledgments First and foremost, thanks to Andrew Snowden, for his help and mathematical guidance. Also thanks to my committee members Karen Smith, David Speyer, Jenny Wilson, and Venky Nagar. Thanks to Alyssa Kody, for the support she has given me throughout the past 4 years of graduate school. Thanks also to my family for encouraging me to pursue a PhD, even if it is outside of statistics. I would like to thank John Wiltshire-Gordon and Daniel Barter, whose conversations in the math common room are what got me involved in representation stability. John’s suggestions and point of view have influenced much of the work here. Daniel’s talk of Braids, TQFT’s, and higher categories has helped to expand my mathematical horizons. Thanks also to many other people who have helped me learn over the years, including, but not limited to Chris Fraser, Trevor Hyde, Jeremy Miller, Nir Gadish, Dan Petersen, Steven Sam, Bhargav Bhatt, Montek Gill. iii Table of Contents Dedication . ii Acknowledgements . iii Abstract . .v Chapters v 1 Introduction 1 1.1 Representation Stability . .1 1.2 Main Results . .2 1.2.1 Configuration spaces of non-Manifolds .
    [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]
  • Arxiv:1601.00302V2 [Math.AG] 31 Oct 2019 Obntra Rbe,Idpneto Hrceitc N[ in Characteristic
    UNIVERSAL STACKY SEMISTABLE REDUCTION SAM MOLCHO Abstract. Given a log smooth morphism f : X → S of toroidal embeddings, we perform a Raynaud-Gruson type operation on f to make it flat and with reduced fibers. We do this by studying the geometry of the associated map of cone complexes C(X) → C(S). As a consequence, we show that the toroidal part of semistable reduction of Abramovich-Karu can be done in a canonical way. 1. Introduction The semistable reduction theorem of [KKMSD73] is one of the foundations of the study of compactifications of moduli problems. Roughly, the main result of [KKMSD73] is that given a flat family X → S = Spec R over a discrete valua- tion ring, smooth over the generic point of R, there exists a finite base change ′ ′ ′ Spec R → Spec R and a modification X of the fiber product X ×Spec R Spec R such that the central fiber of X′ is a divisor with normal crossings which is reduced. Extensions of this result to the case where the base of X → S has higher di- mension are explored in the work [AK00] of Abramovich and Karu. Over a higher dimensional base, semistable reduction in the strictest sense is not possible; never- theless, the authors prove a version of the result, which they call weak semistable reduction. The strongest possible version of semistable reduction for a higher di- mensional base was proven recently in [ALT18]. In all cases, the statement is proven in two steps. In the first, one reduces to the case where X → S is toroidal.
    [Show full text]
  • The Structure of Residuated Lattices
    The Structure of Residuated Lattices Kevin Blount and Constantine Tsinakis May 23, 2002 Abstract A residuated lattice is an ordered algebraic structure L = hL, ∧, ∨, · , e, \ , / i such that hL, ∧, ∨i is a lattice, hL, ·, ei is a monoid, and \ and / are binary operations for which the equivalences a · b ≤ c ⇐⇒ a ≤ c/b ⇐⇒ b ≤ a\c hold for all a, b, c ∈ L. It is helpful to think of the last two operations as left and right division and thus the equivalences can be seen as “di- viding” on the right by b and “dividing” on the left by a. The class of all residuated lattices is denoted by RL. The study of such objects originated in the context of the theory of ring ideals in the 1930’s. The collection of all two-sided ideals of a ring forms a lattice upon which one can impose a natural monoid structure making this object into a residuated lattice. Such ideas were investi- gated by Morgan Ward and R. P. Dilworth in a series of important papers [15], [16],[45], [46], [47] and [48] and also by Krull in [33]. Since that time, there has been substantial research regarding some specific classes of residuated structures, see for example [1], [9], [26] and [38], but we believe that this is the first time that a general structural the- ory has been established for the class RL as a whole. In particular, we develop the notion of a normal subalgebra and show that RL is an “ideal variety” in the sense that it is an equational class in which con- gruences correspond to “normal” subalgebras in the same way that ring congruences correspond to ring ideals.
    [Show full text]
  • Algebraic Aspects of Orthomodular Lattices
    Algebraic Asp ects of Orthomo dular Lattices Gunter Bruns McMaster University Hamilton Ontario LS K Canada John Harding New Mexico State University Las Cruces NM USA In this pap er we try to give an uptodate account of certain asp ects of the the ory of ortholattices abbreviated OLs orthomo dular lattices abbreviated OMLs and mo dular ortholattices abbreviated MOLs not hiding our own research in terests Since most of the questions we deal with have their origin in Universal Alge bra we start with a chapter discussing the basic concepts and results of Universal Algebra without pro ofs In the next three chapters we discuss mostly with pro ofs the basic results and standard techniques of the theory of OMLs In the remaining ve chapters we work our way to the b order of present day research mostly no or only sketchy pro ofs Chapter deals with pro ducts and sub direct pro ducts chap ter with free structures and chapter with classes of OLs dened by equations In chapter we discuss emb eddings of OLs into complete ones The last chap ter deals with questions originating in Category Theory mainly amalgamation epimorphisms and monomorphisms The later chapters of this pap er contain an abundance of op en problems We hop e that this will initiate further research Basic Universal Algebra We assume a denition of natural numb ers which makes every natural numb er n the set of all natural numb ers k n An nary op eration on a set A is a map f of n n A into A An element a A gives rise to a sequence a a an of A more commonly written with indices
    [Show full text]
  • MOTIVIC VOLUMES of FIBERS of TROPICALIZATION 3 the Class of Y in MX , and We Endow MX with the Topology Given by the Dimension filtration
    MOTIVIC VOLUMES OF FIBERS OF TROPICALIZATION JEREMY USATINE Abstract. Let T be an algebraic torus over an algebraically closed field, let X be a smooth closed subvariety of a T -toric variety such that U = X ∩ T is not empty, and let L (X) be the arc scheme of X. We define a tropicalization map on L (X) \ L (X \ U), the set of arcs of X that do not factor through X \ U. We show that each fiber of this tropicalization map is a constructible subset of L (X) and therefore has a motivic volume. We prove that if U has a compactification with simple normal crossing boundary, then the generating function for these motivic volumes is rational, and we express this rational function in terms of certain lattice maps constructed in Hacking, Keel, and Tevelev’s theory of geometric tropicalization. We explain how this result, in particular, gives a formula for Denef and Loeser’s motivic zeta function of a polynomial. To further understand this formula, we also determine precisely which lattice maps arise in the construction of geometric tropicalization. 1. Introduction and Statements of Main Results Let k be an algebraically closed field, let T be an algebraic torus over k with character lattice M, and let X be a smooth closed subvariety of a T -toric variety such that U = X ∩ T 6= ∅. Let L (X) be the arc scheme of X. In this paper, we define a tropicalization map trop : L (X) \ L (X \ U) → M ∨ on the subset of arcs that do not factor through X \ U.
    [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]