Sectionally pseudocomplemented posets

From MaRDI portal
Publication:2665835



Abstract: The concept of a sectionally pseudocomplemented lattice was introduced by I. Chajda as an extension of relative pseudocomplementation for not necessarily distributive lattices. The typical example of such a lattice is the non-modular lattice N5. The aim of this paper is to extend the concept of sectional pseudocomplementation from lattices to posets. At first we show that the class of sectionally pseudocompelemented lattices forms a variety of lattices which can be described by two simple identities. This variety has nice congruence properties. We summarize properties of sectionally pseudocomplemented posets and show differences to relative pseudocomplementation. We prove that every sectionally pseudocomplemented poset is completely L-semidistributive. We introduce the concept of congruence on these posets and show when the quotient structure becomes a poset again. Finally, we study the Dedekind-MacNeille completion of sectionally pseudocomplemented posets. We show that contrary to the case of relatively pseudocomplemented posets, this completion need not be sectionally pseudocomplemented but we present the construction of a so-called generalized ordinal sum which enables us to construct the Dedekind-MacNeille completion provided the completions of the summands are known.


\par A lattice \(L=(L,\vee,\wedge)\) is said to be \textit{sectionally pseudocomplemented} provided that for every \(a,b\in L\), there exists the pseudocomplement of \(a\vee b\) with respect to \(b\) in the interval \([b)=\{x\in L\,|\,b\leqslant x\}\), i.e., there exists the greatest element \(c\in L\) satisfying \((a\vee b)\wedge c=b\). This element \(c\) is called the \textit{sectional pseudocomplement of \(a\) with respect to \(b\)} and is denoted \(a\ast b\) [the first author, Acta Sci. Math. 69, No. 3--4, 491--496 (2003; Zbl 1048.06005)]. The present paper introduces the concept of sectionally pseudocomplemented partially ordered set (poset) as follows. \par Given a poset \(P=(P,\leqslant)\) and a subset \(A\subseteq P\), one defines \(L(A)=\{x\in P\mid x\leqslant a\) for every \(a\in A\}\) and \(U(A)=\{x\in P\mid a\leqslant x\) for every \(a\in A\}\). Then \(P\) is called \textit{sectionally pseudocomplemented} provided that for every \(a,b\in P\), there exists the greatest element \(c\in P\) such that \(L(U(\{a,b\})\bigcup\{c\}) = L(\{b\})\). This element \(c\) is called the \textit{sectional pseudocomplement \(a\ast b\) of \(a\) with respect to \(b\)}. \par The authors study properties of sectionally pseudocomplemented posets, e.g., compare them with relatively pseudocomplemented posets of [the first author et al., Math. Slovaca 70, No. 2, 239--250 (2020; Zbl 1505.06005)], consider their congruences, and construct the respective Dedekind-MacNeille completion, stating some sufficient conditions under which the Dedekind-MacNeille completion of a sectionally pseudocomplemented poset is sectionally pseudocomplemented. The paper also shows that the class of sectionally pseudocomplemented lattices forms a variety, which (besides the lattice axioms) is determined by two simple identities. \par The paper is well written, provides most of its required preliminaries (the omitted concepts can be found in one of the references at the end of the paper), and will be of interest to the researchers studying ordered algebraic structures.











This page was built for publication: Sectionally pseudocomplemented posets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2665835)