SearcharxivSearch

arXiv · 2006.03705

Conjunctive Join Semi-Lattices

Abstract

A join-semilattice $L$ is said to be conjunctive if it has a top element $1$ and it satisfies the following first-order condition: for any two distinct $a,b\in L$, there is $c\in L$ such that either $a\vee c\not=1=b\vee c$ or $a\vee c=1\not=b\vee c$. Equivalently, a join-semilattice is conjunctive if every principal ideal is an intersection of maximal ideals. We present simple examples showing that a conjunctive join-semilattice may fail to have any prime ideals. (Maximal ideals of a join-semilattice need not be prime.) We show that every conjunctive join-semilattice is isomorphic to a join-closed subbase for a compact $T_1$-topology on $\mathrm{Max} L$, the set of maximal ideals of $L$. The representation is canonical in that when applied to a join-closed subbase for a compact $T_1$-space $X$, the space produced by the representation is homeomorphic with $X$. We say a join-semilattice morphism $\phi:L\to M$ is conjunctive if $\phi^{-1}(w)$ is an intersection of maximal ideals of $L$ whenever $w$ is a maximal ideal of $M$. We show that every conjunctive morphism between conjunctive join-semilattices is induced by a multi-valued function from $\mathrm{Max} M$ to $\mathrm{Max} L$. A base for a topological space is said to be annular if it is a lattice, and Wallman if it is annular and for any point $u$ in any basic open $U$, there a basic open $V$ that misses $u$ and together with $U$ covers $X$. It is easy to show that every Wallman base is conjunctive. We give an example of a conjunctive annular base that is not Wallman. Finally, we examine the free distributive lattice $dL$ over a conjunctive join semilattice $L$. In general, it is not conjunctive, but we show that a certain canonical, algebraically-defined quotient of $dL$ is isomorphic to the sub-lattice of the topology of the representation space that is generated by $L$. We describe numerous applications.

Explore related subjects

Keep this discovery

BibTeXRIS

Charles N. Delzell, Oghenetega Ighedo, James J. Madden. 2020-06-05. Conjunctive Join Semi-Lattices. https://arxiv.org/abs/2006.03705

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO