scientific article; zbMATH DE number 1013874

Authors

Publication date 27 May 1997

distributivity non-commutative lattice of type \((G)\)

Partial orders, general (06A06) Lattices (06B99) Distributive lattices (06D99)

The second author introduced the noncommutative lattices \({\mathcal L}= (L; \wedge, \vee)\) of type \((G)\) [Mathematica 30(53), No. 2, 119-123 (1988; Zbl 0696.06002)]. He defines \({\mathcal L}\) to be an algebra with two associative binary operations \(\wedge\) and \(\vee\) satisfying the following four identities: \((L_1)\) \(x\wedge (x\vee y)=x\); \((L_2)\) \(x\wedge y=(x \wedge y\wedge z) \vee(y \wedge x)\); \((L_1')\) and \((L_2')\), where \((L_1')\) and \((L_2')\) are the respective dual identities of \((L_1)\) and \((L_2)\). In the paper under review the authors show that a non-commutative lattice of type \((G)\) is partially ordered if one defines the order relation \(\leq\) as follows: \(a\leq b\) if and only if \(a=b \wedge a\). Moreover, they define distributivity of these algebras by two additional identities: \((D_1)\) \(x\wedge (y\vee z)= (x \wedge y)\vee (x\wedge z)\) and \((D_2)\) \((y\vee z) \wedge x=(y\wedge x) \vee(z \wedge x)\). The main result: Let \({\mathcal L}\) be a noncommutative lattice of type \((G)\). Then the following conditions are equivalent: (a) \({\mathcal L}\) is distributive; (b) \({\mathcal L}\) is dual distributive, i.e. \(L\) satisfies \((D_1')\) and \((D_2')\), which are dual to \((D_1)\) and \((D_2)\), respectively; (c) In \({\mathcal L}\) (i) \(x\wedge y\leq y\) and (ii) \(x\wedge (y\vee z) \leq(x\wedge y) \vee(x \wedge z)\) for any \(x,y,z\in {\mathcal L}\).

Recommendations

Cited in

(11)

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 Q4337902)