DOCSLIB.ORG

Partial Order Embedding with Multiple Kernels

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Partial Order Embedding with Multiple Kernels Partial Order Embedding with Multiple Kernels Brian McFee [email protected] Department of Computer Science and Engineering, University of California, San Diego, CA 92093 USA Gert Lanckriet [email protected] Department of Electrical and Computer Engineering, University of California, San Diego, CA 92093 USA Abstract tirely different types of transformations may be natural for each modality. It may therefore be better to learn a sepa- We consider the problem of embedding arbitrary rate transformation for each type of feature. When design- objects (e.g., images, audio, documents) into Eu- ing metric learning algorithms for heterogeneous data, care clidean space subject to a partial order over pair- must be taken to ensure that the transformation of features wise distances. Partial order constraints arise nat- is carried out in a principled manner. urally when modeling human perception of simi- larity. Our partial order framework enables the Moreover, in such feature-rich data sets, a notion of simi- use of graph-theoretic tools to more efficiently larity may itself be subjective, varying from person to per- produce the embedding, and exploit global struc- son. This is particularly true of multimedia data, where ture within the constraint set. a person may not be able to consistently decide if two ob- We present an embedding algorithm based on jects (e.g., songs or movies) are similar or not, but can more semidefinite programming, which can be param- reliably produce an ordering of similarity over pairs. Al- eterized by multiple kernels to yield a unified gorithms in this regime must use a sufficiently expressive space from heterogeneous features. language to describe similarity constraints. Our goal is to construct an algorithm which integrates sub- jective similarity measurements and heterogeneous data to 1. Introduction produce a low-dimensional embedding. The main, novel contributions of this paper are two-fold. First, we develop A notion of distance between objects can be a powerful tool the partial order embedding framework, which allows us for predicting labels, retrieving similar objects, or visualiz- to apply graph-theoretic tools to solve relative comparison ing high-dimensional data. Due to its simplicity and math- embedding problems more efficiently. Our second contri- ematical properties, the Euclidean distance metric is often bution is a novel kernel combination technique to produce applied directly to data, even when there is little evidence a unified Euclidean space from multi-modal data. that said data lies in a Euclidean space. It has become the focus of much research to design algorithms which adapt The remainder of this paper is structured as follows. Sec- the space so that Euclidean distance between objects con- tion 2 formalizes the embedding problem and develops forms to some other presupposed notion of similarity, e.g., some mathematical tools to guide algorithm design. Sec- class labels or human perception measurements. tion 3 provides algorithms for non-parametric and multi- kernel embedding. Section 4 describes two experiments: When dealing with multi-modal data, the simplest first step one on synthetic and one on human-derived constraint sets. is to concatenate all of the features together, resulting in Section 5 discusses the complexity of exact dimensionality a single vector space on which metric learning algorithms minimization in the partial order setting. can be applied. This approach suffers in situations where features cannot be directly concatenated, such as in ker- 1.1. Related work nel methods, where the features are represented (implic- itly) by infinite-dimensional vectors. For example, if each Metric learning algorithms adapt the space to fit some pro- object consists of mixed audio, video, and text content, en- vided similarity constraints, typically consisting of pairs which are known to be neighbors or belong to the same th Appearing in Proceedings of the 26 International Conference class (Wagstaff et al., 2001; Xing et al., 2003; Tsang & on Machine Learning, Montreal, Canada, 2009. Copyright 2009 by the author(s)/owner(s). Partial Order Embedding with Multiple Kernels Kwok, 2003; Bilenko et al., 2004; Hadsell et al., 2006; A Euclidean embedding is a function g : X! Rn which Weinberger et al., 2006; Globerson & Roweis, 2007). maps X into n−dimensional space equipped with the Eu- clidean (` ) metric: kx − yk = p(x − y)T(x − y). Schultz and Joachims (2004) present an SVM-type algo- 2 rithm to learn a metric from relative comparisons, with ap- A symmetric matrix A 2 Rn×n has eigen-decomposition plications to text classification. Their formulation consid- A = V ΛV T, where Λ is a diagonal matrix con- ered metrics derived from axis-aligned scaling, which in taining the eigenvalues of A in descending order: the kernelized version, translates to a weighting over the λ1 ≥ λ2 ≥ · · · ≥ λn. A is positive semidefinite (PSD), de- training set. Agarwal et al. (2007), motivated by mod- noted A 0, if each of its eigen-values is non-negative. eling human perception data, present a semidefinite pro- For A 0, let A1=2 denote the matrix Λ1=2V T. Finally, th gramming (SDP) algorithm to construct an embedding of for any matrix B, let Bi denote its i column vector. general objects from paired comparisons. Both of these al- gorithms treat constraints individually, and do not exploit 2. Partial order embedding global structure (e.g., transitivity). Previous work has considered the setting where similar- Song et al. (2008) describe a metric learning algorithm that ity information is coded as tuples (i; j; k; `) where objects seeks a locally isometric embedding which is maximally (i; j) are more similar than (k; `), but treat each tuple in- aligned to a PSD matrix derived from side information. Al- dividually and without directly taking into consideration though our use of (multiple) side-information sources dif- larger-scale structure within the constraints. Such global fers from that of (Song et al., 2008), and we do not attempt structure can be revealed by the graph representation of the to preserve local isometry, the techniques are not mutually constraints. exclusive. If the constraints do not form a partial order, then the corre- Lanckriet et al. (2004) present a method to combine multi- sponding graph must contain a cycle, and therefore cannot ple kernels into a single kernel, outperforming the original be satisfied by any embedding. Moreover, it is easy to lo- kernels in a classification task. To our knowledge, simi- calize subsets of constraints which cannot all be satisfied by lar results have not yet been demonstrated for the present looking at the strongly-connected components of the graph. metric learning problem. We therefore restrict attention to constraint sets which sat- 1.2. Preliminaries isfy the properties of a partial order: transitivity and anti- symmetry. Exploiting transitivity allows us to more com- Let X denote a set of n objects. Let C denote a partial order pactly represent otherwise large sets of independently con- over pairs drawn from X : sidered local constraints, which can improve the efficiency of the algorithm. C = f(i; j; k; `): i; j; k; ` 2 X ; (i; j) < (k; `)g; 2.1. Problem statement where the less than relation is interpreted over dissimilar- Formally, the partial order embedding problem is defined ity between objects. Because C is a partial order, it can as follows: given a set X of n objects, and a partial order C 2 be represented by a DAG with vertices in X (see Fig- over X 2, produce a map g : X! Rn such that ure 1). For any pair (i; j), let depth(i; j) denote the length 2 2 of the longest path from a source to (i; j) in the DAG. 8 (i; j; k; `) 2 C : kg(i) − g(j)k < kg(k) − g(`)k : Let diam(C) denote the length of the longest (possibly For numerical stability, g is restricted to force margins be- weighted) source-to-sink path in C, and let length(C) de- tween constrained distances: note the number of edges in the path. 2 2 8 (i; j; k; `) 2 C : kg(i)−g(j)k +eijk` < kg(k)−g(`)k : Many algorithms take eijk` = 1 out of convenience, but jk uniform margins are not strictly necessary. We augment jl ik the DAG representation of C with positive edge weights il corresponding to the desired margins. We will refer to this ij representation as a margin-weighted constraint graph, and (X ; C) as a margin-weighted instance. Figure 1. A partial order over similarity in DAG form: vertices In the special case where C is a total ordering over all represent pairs, and a directed edge from (i; j) to (i; k) indicates pairs (i.e., a chain graph), the problem reduces to non- that (i; j) are more similar than (i; k). metric multidimensional scaling (Kruskal, 1964), and a Partial Order Embedding with Multiple Kernels Algorithm 1 Naïve total order construction that for all i 6= j, Input: objects X , margin-weighted partial order C p Output: symmetric dissimilarity matrix ∆ 2 Rn×n 1 ≤ kg(i) − g(j)k ≤ (4n + 1)(diam(C) + 1): for each i in 1 : : : n do Proof. Let ∆ be the output of Algorithm 1 on (X ; C), and ∆ii 0 A; A∗ as defined in (1) and (2). From (2), the squared- end for distance matrix derived from A∗ can be expressed as for each (k; `) in topological order do ∗ 1 if in-degree(k; `) = 0 then ∆ij = ∆ij − 2λn(A) i6=j: (3) ∆k`; ∆`k 1 else Expanding (1) yields ∆k`; ∆`k max ∆ij + eijk` (i;j;k;`)2C 1 1 1 A = ∆ − ∆T1 − 1T∆ + 1T∆1; end if ij ij n i n j n2 end for and since ∆ij ≥ 0, it is straightforward to verify the fol- lowing inequalities: constraint-satisfying embedding can always be found by 8i; j : − 2 max ∆xy ≤ Aij ≤ 2 max ∆xy: constant-shift embedding (Roth et al., 2003).
Load more

Recommended publications
  • 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]
  • The Complexity of Embedding Orders Into Small Products of Chains Olivier Raynaud, Eric Thierry
    The complexity of embedding orders into small products of chains Olivier Raynaud, Eric Thierry To cite this version: Olivier Raynaud, Eric Thierry. The complexity of embedding orders into small products of chains. 2008. hal-00261826 HAL Id: hal-00261826 https://hal.archives-ouvertes.fr/hal-00261826 Preprint submitted on 10 Mar 2008 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. THE COMPLEXITY OF EMBEDDING ORDERS INTO SMALL PRODUCTS OF CHAINS. 1 2 O. RAYNAUD AND E. THIERRY 1 LIMOS, Universit´e Blaise Pascal, Campus des C´ezeaux, Clermont-Ferrand, France. E-mail address: [email protected] 2 LIAFA, Universit´e Paris 7 & LIP, ENS Lyon, France. E-mail address: [email protected] Abstract. Embedding a partially ordered set into a product of chains is a classical way to encode it. Such encodings have been used in various fields such as object oriented programming or distributed computing. The embedding associates with each element a sequence of integers which is used to perform comparisons between elements. A critical measure is the space required by the encoding, and several authors have investigated ways to minimize it, which comes to embedding partially ordered sets into small products of chains.
    [Show full text]
  • Hyperbolic Disk Embeddings for Directed Acyclic Graphs
    Hyperbolic Disk Embeddings for Directed Acyclic Graphs Ryota Suzuki 1 Ryusuke Takahama 1 Shun Onoda 1 Abstract embeddings for model initialization leads to improvements Obtaining continuous representations of struc- in various of tasks (Kim, 2014). In these methods, sym- tural data such as directed acyclic graphs (DAGs) bolic objects are embedded in low-dimensional Euclidean has gained attention in machine learning and arti- vector spaces such that the symmetric distances between ficial intelligence. However, embedding complex semantically similar concepts are small. DAGs in which both ancestors and descendants In this paper, we focus on modeling asymmetric transitive of nodes are exponentially increasing is difficult. relations and directed acyclic graphs (DAGs). Hierarchies Tackling in this problem, we develop Disk are well-studied asymmetric transitive relations that can be Embeddings, which is a framework for embed- expressed using a tree structure. The tree structure has ding DAGs into quasi-metric spaces. Existing a single root node, and the number of children increases state-of-the-art methods, Order Embeddings and exponentially according to the distance from the root. Hyperbolic Entailment Cones, are instances of Asymmetric relations that do not exhibit such properties Disk Embedding in Euclidean space and spheres cannot be expressed as a tree structure, but they can be respectively. Furthermore, we propose a novel represented as DAGs, which are used extensively to model method Hyperbolic Disk Embeddings to handle dependencies between objects and information flow. For exponential growth of relations. The results of example, in genealogy, a family tree can be interpreted as a our experiments show that our Disk Embedding DAG, where an edge represents a parent child relationship models outperform existing methods especially and a node denotes a family member (Kirkpatrick, 2011).
    [Show full text]
  • Generalising Canonical Extensions of Posets to Categories
    Nandi Schoots Generalising canonical extensions of posets to categories Master's thesis, 21 December 2015 Thesis advisor: Dr. Benno van den Berg Coadvisor: Dr. Robin S. de Jong Mathematisch Instituut, D´epartement de Math´ematiques, Universiteit Leiden Universit´eParis-Sud Contents 1 Introduction3 1.1 Overview of the thesis........................3 1.2 Acknowledgements..........................4 1.3 Convention, notation and terminology...............4 2 Lower sets and Presheaves5 2.1 Lower sets...............................5 2.2 Some facts about presheaves and co-presheaves..........9 3 Ideal completion and Ind-completion 16 3.1 Ideal completion........................... 16 3.2 Inductive completion......................... 19 3.2.1 Reflective subcategories................... 23 3.2.2 The embedding C ,! Ind(C)................. 25 3.2.3 The embedding Ind(C) ,! [C op; Sets]............ 26 4 Dedekind-MacNeille completion and a categorical generalisa- tion of it 28 4.1 Dedekind-MacNeille completion of a poset............. 28 4.1.1 Existence and unicity of Dedekind-MacNeille completions 28 4.1.2 Some remarks on Dedekind-MacNeille completions of posets 30 4.2 Reflexive completion......................... 31 4.2.1 Universal properties of the reflexive completion...... 33 5 Canonical extensions of posets and categories 34 5.1 Canonical extensions of posets................... 34 5.1.1 Characterisation of canonical extension of posets..... 34 5.1.2 Existence and unicity of the canonical extension, a two- step process.......................... 35 5.2 Canonical extension of categories.................. 37 5.2.1 Explicit construction of a canonical extension of categories Can(C)............................ 37 5.2.2 Intermediate object of categories.............. 38 5.2.3 Characterisation of a canonical extension of categories Cδ 43 5.2.4 Link between Cδ and Can(C)?...............
    [Show full text]
  • ON MONOMORPHISMS and EPIMORPHISMS in VARIETIES of ORDERED ALGEBRAS 1. Preliminaries Every Variety of Ordered Universal Algebras
    ON MONOMORPHISMS AND EPIMORPHISMS IN VARIETIES OF ORDERED ALGEBRAS VALDIS LAAN AND SOHAIL NASIR Dedicated to Sydney Bulman-Fleming Abstract. We study morphisms in varieties of ordered universal algebras. We prove that (i) monomorphisms are precisely the injective homomorphisms, (ii) every regular monomorphism is an order embedding, but the converse is not true in general. Also, we give a necessary and sufficient condition for a morphism to be a regular epimorphism. Finally, we discuss factorizations in such varieties. 1. Preliminaries Every variety of ordered universal algebras (as defined in [3] or [7]) is a category. It is natural to ask, what meaning have the basic categorical notions in these cate- gories. In this article we ask: what are the (regular) epi- or monomorphisms in such varieties? It turns out that, although, for example, monomorphisms and regular monomorphisms coincide in the varieties of unordered algebras (reference), this is not the case in the ordered situation. After describing several types of mono- and epimorphisms we finally show that each variety of ordered algebras has two kinds of factorization systems. As usual in universal algebra, the type of an algebra is a (possibly empty) set Ω which is a disjoint union of sets Ωk, k 2 N [ f0g. Definition 1 ([3]). Let Ω be an ordered type. An ordered Ω-algebra (or simply ordered algebra) is a triplet A = (A; ΩA; ≤A) comprising a poset (A; ≤ −A) and a set ΩA of operations on A (for every k-ary operation symbol ! 2 Ωk there is a k-ary operation !A 2 ΩA on A) such that all the operations !A are monotone mappings, where monotonicity of !A (! 2 Ωk) means that 0 0 0 0 a1 ≤A a1 ^ ::: ^ ak ≤A ak =) !A(a1; : : : ; ak) ≤A !A(a1; : : : ; ak) 0 0 for all a1; : : : ; ak; a1; : : : ; ak 2 A.
    [Show full text]
  • Pdf 270.54 K
    Journal of Algebraic Systems Vol. 2, No. 2, (2014), pp 137-146 COGENERATOR AND SUBDIRECTLY IRREDUCIBLE IN THE CATEGORY OF S-POSETS GH. MOGHADDASI Abstract. In this paper we study the notions of cogenerator and subdirectly irreducible in the category of S-posets. First we give some necessary and sufficient conditions for an S-poset to be a cogenerator. Then we see that under some conditions, regular in- jectivity implies generator and cogenerator. Recalling Birkhoff's Representation Theorem for algebras, we study subdirectly irreducible S-posets and prove this theorem for the category of ordered right acts over an ordered monoid. Among other things, we present the relationship between cogenerators and subdirectly irreducible S-posets. 1. Introduction and Preliminaries Laan [8] studied the generators in the category of right S-posets, where S is a pomonoid. Also Knauer and Normak [7] gave a relation between cogenerators and subdirectly irreducibles in the category of right S-acts. The main objective of this paper is to study cogenerators and subdirectly irreducible S-posets. Some properties of the category of S-posets have been studied in many papers, and recently in [2, 3, 5]. Now we give some preliminaries about S-act and S-poset needed in the sequel. A pomonoid is a monoid S equipped with a partial order relation ≤ which is compatible with the monoid operation, in the sense that, if s ≤ t then su ≤ tu; us ≤ ut, for all s; t; u 2 S. Let MSC(2010): 08A60, 08B30, 08C05, 20M30 Keywords: S-poset, Cogenerator, Regular injective, Subdirectly irreducible. Received: 20 February 2014, Revised: 14 January 2015.
    [Show full text]
  • An Algorithmic Approach to Lattices and Order in Dynamics
    Manuscript: Preprint Version BTBR-5.tex Date: July 19, 2017. AN ALGORITHMIC APPROACH TO LATTICES AND ORDER IN DYNAMICS William D. Kalies,Dinesh Kasti Florida Atlantic University 777 Glades Road Boca Raton, FL 33431, USA Robert Vandervorst VU University De Boelelaan 1081a 1081 HV, Amsterdam, The Netherlands Abstract. Recurrent versus gradient-like behavior in global dynamics can be character- ized via a surjective lattice homomorphism between certain bounded, distributive lattices, that is, between attracting blocks (or neighborhoods) and attractors. Using this characteri- zation, we build finite, combinatorial models in terms of surjective lattice homomorphisms, which lay a foundation for a computational theory for dynamical systems that focuses on Morse decompositions and index lattices. In particular we present an algorithm that builds a combinatorial model that represents a Morse decomposition for the underlying dynamics. We give computational examples that illustrate the theory for both maps and flows. 1. Introduction. Recent work in computational dynamics has led to the use of combi- natorial representations of dynamical systems to extract rigorous statements about global dynamics and how this dynamics changes with respect to parameters, cf. [16,2,1,5,8]. Further development of these methods relies on understanding the way in which lattices and order naturally play a role in dynamics on the fundamental level of attractors, repellers, and invariant sets, cf. [19]. Analogues of these basic concepts in dynamical systems theory also exist in directed graphs and are used to analyze combinatorial representations of dynamical systems. Recent results have addressed how robustly these combinatorial representations may capture the global dynamics of an underlying dynamical system, cf.
    [Show full text]
  • Here Is a Recap of the Objects That We Have Counted Using the Catalan Numbers
    Recap Here is a recap of the objects that we have counted using the Catalan numbers. Theorem 1 Cn counts the number of 1) monotonic paths in an n  n grid that do not rise above the diagonal, 2) Dyck paths of length 2n that end on the horizontal axis, 3) ordered trees with n þ 1 vertices, 4) binary trees with n vertices, 5) full binary trees with 2n þ 1 vertices, 6) noncrossing, alternating trees with n þ 1 vertices, 7) ways to chord a convex 2n-gon with nonintersecting chords, 8) staircase tilings of an n  n grid using n tiles, 9) noncrossing, alternating, chorded convex (n + 1)-gons with n chords, 10) triangularizations of a convex polygon with n þ 2 sides, 11) ways to stack equal-sized disks with n disks on the bottom row, 12) ways to fully parenthesize a word of length n þ 1 under a nonassociative binary operation, 13) balanced strings of parentheses of length 2n, 14) multisets of size n in ℤnþ1 with null sum, 15) separated families of intervals in Int([n]), 16) covering antichains in Int([n]), 17) antichains (down sets) in IntðÞ½ n À 1 , 18) noncrossing partitions of [n], 19) noncrossing partitions of ½2n þ 1 into n þ 1 blocks, none of which contain two consecutive integers, 20) maximal normalized Davenport-Schinzel sequences on½ n þ 1 , 21) abc ‐ avoiding permutations of [n], for any given three-digit pattern abc, 22) semiorders on [n](up to isomorphism), 23) partial orders on [n] with no induced subposets of the form2 þ 2or3 þ 1, 24) unit interval orders on [n].
    [Show full text]
  • Hierarchical Density Order Embeddings
    Published as a conference paper at ICLR 2018 HIERARCHICAL DENSITY ORDER EMBEDDINGS Ben Athiwaratkun, Andrew Gordon Wilson Cornell University Ithaca, NY 14850, USA ABSTRACT By representing words with probability densities rather than point vectors, proba- bilistic word embeddings can capture rich and interpretable semantic information and uncertainty (Vilnis & McCallum, 2014; Athiwaratkun & Wilson, 2017). The uncertainty information can be particularly meaningful in capturing entailment relationships – whereby general words such as “entity” correspond to broad dis- tributions that encompass more specific words such as “animal” or “instrument”. We introduce density order embeddings, which learn hierarchical representations through encapsulation of probability distributions. In particular, we propose simple yet effective loss functions and distance metrics, as well as graph-based schemes to select negative samples to better learn hierarchical probabilistic representations. Our approach provides state-of-the-art performance on the WORDNET hypernym relationship prediction task and the challenging HYPERLEX lexical entailment dataset – while retaining a rich and interpretable probabilistic representation. 1 INTRODUCTION Learning feature representations of natural data such as text and images has become increasingly important for understanding real-world concepts. These representations are useful for many tasks, ranging from semantic understanding of words and sentences (Mikolov et al., 2013; Kiros et al., 2015), image caption generation (Vinyals et al., 2015), textual entailment prediction (Rocktäschel et al., 2015), to language communication with robots (Bisk et al., 2016). Meaningful representations of text and images capture visual-semantic information, such as hier- archical structure where certain entities are abstractions of others. For instance, an image caption “A dog and a frisbee” is an abstraction of many images with possible lower-level details such as a dog jumping to catch a frisbee or a dog sitting with a frisbee (Figure 1a).
    [Show full text]
  • Large Sets of Lattices Without Order Embeddings
    LARGE SETS OF LATTICES WITHOUT ORDER EMBEDDINGS GABOR´ CZEDLI´ To the memory of Ervin Fried Abstract. Let I and µ be an infinite index set and a cardinal, respectively, such that |I| ≤ µ and, starting from ℵ0, µ can be constructed in countably many steps by passing from a cardinal λ to 2λ at successor ordinals and forming suprema at limit ordinals. We prove that there exists a system X = {Li : i ∈ I} of complemented lattices of cardinalities less than |I| such that whenever i, j ∈ I and ϕ: Li → Lj is an order embedding, then i = j and ϕ is the identity map of Li. If |I| is countable, then, in addition, X consists of finite lattices of length 10. Stating the main result in other words, we prove that the category of (complemented) lattices with order embeddings has a discrete full subcategory with |I| many objects. Still in other words, the class of these lattices has large antichains (that is, antichains of size |I|) with respect to the quasiorder “embeddability”. As corollaries, we trivially obtain analogous statements for partially ordered sets and semilattices. 1. Introduction and the main result Although the main result we prove is a statement on lattices, the problem we deal with is meaningful for many other classes of algebras and structures, including partially ordered sets, ordered sets in short, and semilattices. A minimal knowledge of the rudiments of lattice theory is only assumed, as it is presented in any book on lattices or universal algebra; otherwise the paper is more or less self-contained for most algebraists.
    [Show full text]
  • 1-Completions of a Poset
    Order (2013) 30:39–64 DOI 10.1007/s11083-011-9226-0 1-completions of a Poset Mai Gehrke · Ramon Jansana · Alessandra Palmigiano Received: 10 October 2010 / Accepted: 5 July 2011 / Published online: 27 July 2011 © The Author(s) 2011. This article is published with open access at Springerlink.com Abstract A join-completion of a poset is a completion for which each element is obtainable as a supremum, or join, of elements from the original poset. It is well known that the join-completions of a poset are in one-to-one correspondence with the closure systems on the lattice of up-sets of the poset. A 1-completion of a poset is a completion for which, simultaneously, each element is obtainable as a join of meets of elements of the original poset and as a meet of joins of elements from the original poset. We show that 1-completions are in one-to-one correspondence with certain triples consisting of a closure system of down-sets of the poset, a closure system of up-sets of the poset, and a binary relation between these two systems. Certain 1-completions, which we call compact, may be described just by a collection of filters and a collection of ideals, taken as parameters. The compact 1-completions of a poset include its MacNeille completion and all its join- and all The research of the second author has been partially supported by SGR2005-00083 research grant of the research funding agency AGAUR of the Generalitat de Catalunya and by the MTM2008-01139 research grant of the Spanish Ministry of Education and Science.
    [Show full text]
  • Order Isomorphisms Between Cones of JB-Algebras
    Order isomorphisms between cones of JB-algebras Hendrik van Imhoff∗ Mathematical Institute, Leiden University, P.O.Box 9512, 2300 RA Leiden, The Netherlands Mark Roelands† School of Mathematics, Statistics & Actuarial Science, University of Kent, Canterbury, CT2 7NX, United Kingdom April 23, 2019 Abstract In this paper we completely describe the order isomorphisms between cones of atomic JBW-algebras. Moreover, we can write an atomic JBW-algebra as an algebraic direct summand of the so-called engaged and disengaged part. On the cone of the engaged part every order isomorphism is linear and the disengaged part consists only of copies of R. Furthermore, in the setting of general JB-algebras we prove the following. If either algebra does not contain an ideal of codimension one, then every order isomorphism between their cones is linear if and only if it extends to a homeomorphism, between the cones of the atomic part of their biduals, for a suitable weak topology. Keywords: Order isomorphisms, atomic JBW-algebras, JB-algebras. Subject Classification: Primary 46L70; Secondary 46B40. 1 Introduction Fundamental objects in the study of partially ordered vector spaces are the order isomorphisms between, for example, their cones or the entire spaces. By such an order isomorphism we mean an order preserving bijection with an order preserving inverse, which is not assumed to be linear. It is therefore of particular interest to be able to describe these isomorphisms and know for which partially ordered vector spaces the order isomorphisms between their cones are in fact linear. arXiv:1904.09278v2 [math.OA] 22 Apr 2019 Questions regarding the behaviour of order isomorphisms between cones originated from Special Rela- tivity.
    [Show full text]