scientific article; zbMATH DE number 1776310

Publication date 5 August 2002

chain distributive lattice kite-tail lattice

Total orders (06A05) Structure theory of lattices (06B05) Structure and representation theory of distributive lattices (06D05)

Review text

A chain \((L,\leq)\) can be characterized by the property: \(\forall A\subset L\), \(\forall u \in L:\inf A<u \Rightarrow \exists a \in A\), \(a<u\). An equivalent characterization through sup can be introduced, too. The author generalizes the chain property of lattices modifying the last strict inequality in the above property by a non-strict one. Note that this weakened property was already introduced and applied previously, e.g., by \textit{C.~V. Negoita} and \textit{D.~A. Ralescu} [Applications of fuzzy sets to systems analysis. Birkhäuser Verlag, Basel (1975; Zbl 0326.94002)]. The paper is the first one devoted to the study of lattices with weakened chain property. Its sup-version is shown to be still equivalent to the inf-version. Moreover, it is shown that weakened chain properties hold if and only if \(\forall a, b, c\in L: \inf (a,b)<c\Rightarrow a\leq c\) and \(b\leq c\), or, equivalently, \(\forall a, b, c \in L: \sup (a,b) > c \Rightarrow a\geq c\) and \(b\leq c\). In the case of finite lattices, some previous results of the author are recovered, leading to the so-called kite-tail lattices [\textit{B. De Baets} and \textit{E. Kerre}, ``Kite-tail lattices and their characterization, Far East J. Math. Sci. 1, 1-11 (1993; Zbl 0806.06007)], in which case for all \(a, b, c \in L\), the element \(c\) is comparable both with \(\inf(a,b)\) and with \(\sup(a,b)\) whenever all elements \( a, b, c\) are different, and \(\{ u\in L: \inf(a,b) < u < \sup(a,b)\}\subset (a,b)\). Finally, dense chains are characterized. The paper is an interesting enrichment of lattice theory.

Recommendations

Cited in

(5)

This page was built for publication:

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