Context
Algebra
- algebra, higher algebra
- universal algebra
- monoid, semigroup, quasigroup
- nonassociative algebra
- associative unital algebra
- commutative algebra
- Lie algebra, Jordan algebra
- Leibniz algebra, pre-Lie algebra
- Poisson algebra, Frobenius algebra
- lattice, frame, quantale
- Boolean ring, Heyting algebra
- commutator, center
- monad, comonad
- distributive law
Group theory
Ring theory
Module theory
Contents
Idea
The notion of skew lattices is that of lattices (as an algebraic structure ), except that commutativity axioms are dropped.
Definition
A skew lattice is a set equipped with two associative operations that satisfy the following versions of absorption laws:
Observe that the notion of skew lattice is self-dual: a statement in the language of skew lattices holds iff the dual statement, obtained by swapping all instances of with and vice-versa, also holds.
Properties
Proposition
In a skew-lattice, every element satisfies . Dually, .
Proof
We have
where the first equation is from the first absorption law and the second equation is from the second absorption law.
It follows that a skew lattice is a band under either operation , . Accordingly (see there), there is a natural preorder structure definable from either operation; call them and . These two preorder structures are opposite to one another, by the following results (as adapted from a relevant MathStackExchange discussion):
Lemma
In a skew lattice, iff . Similarly, iff .
Proof
Immediate from the absorption laws.
Proposition
In a skew lattice, we have iff .
Proof
The two relations mean, by definition, and . We are to show that these are equivalent. By duality, only the forward implication needs to be proven.
By hypothesis and the lemma, we have . Denote the last equation by .
Then
Then, from and the lemma, we have , as was to be shown.
References