On the coset laws for skew lattices (Q2428566)

Skew lattices are a noncommutative generalization of lattices. More precisely, a skew lattice is an algebra \((S;\vee, \wedge)\) of type \((2,2)\) such that both operations are associative and idempotent and satisfy the absorbtion identities \(x\wedge(x\vee y)=x=(y\vee x)\wedge x\) and \(x\vee(x\wedge y)=x=(y\wedge x)\vee x\). The author investigates varieties of symmetric, strongly symmetric and cancellative skew lattices. A skew lattice \(S\) is called symmetric if it satisfies the statement \(x\wedge y=y\wedge x\) iff \(x\vee y=y\vee x\) for any \(x, y\in S.\) Similarly, \(S\) is called strongly symmetric if it satisfies the identity \(x\vee (y\wedge x)=(x\vee y)\wedge x\) and the dual identity. Eventually, \(S\) is called cancellative if \(x\vee y=x\vee z\) and \(x\wedge y=x\wedge z\) imply \(y=z.\) It is known that the corresponding classes Can, SSym and Sym are varieties for which \(\mathrm{Can} \subset \mathrm{SSym} \subset \mathrm{Sym}\). In order to say more, we need additional notions. A relation \(\mathcal{D}\) on \(S\) is called a natural equivalence if: \(x\mathcal{D}y\) iff \(x\vee y\vee x=x\) and \(y\vee x\vee y=y\), or a dual statement is true. \textit{J. Leech} [Algebra Univers. 26, No. 1, 48--72 (1989; Zbl 0669.06006)] proved that \(\mathcal{D}\) is the smallest congruence relation on \(S\) such that \(S/\mathcal{D}\) is a lattice. (Note that elements of \(S/\mathcal{D}\) are called cosets.) In the paper under review the respective characterizations of cancellative, symmetric and strongly symmetric skew lattices are given. The author uses properties of the lattice \(S/\mathcal{D}\).