Title. Splitting residuated (semi)lattices
Speaker. P. Aglianó
Institution. Via Roma 56 53100, Siena, Italy
Abstract. The concept of splitting is of lattice-theoretic origin; if is any lattice a pair of elements of is a splitting pair if is equal to the disjoint union of the ideal generated by and the filter generated by . If is any variety, an algebra is splitting in if is the right member of a splitting pair in the lattice of subvarieties of . A more transparent definition is the following: is splitting in if there is a subvariety (the {\bf conjugate variety of }) such that for any variety either or .
Splitting lattices were introduced by P. Whitman (1943) in the early 40’s; thirty years later R. McKenzie (1972) explored the concept with greater fortune. Note that if is a splitting pair then, by a standard lattice theoretic argument, must be completely meet prime and completely join prime. If we apply this to the splitting pair then is axiomatized by a single equation and is a finitely generated subdirectly irreducible algebra. If moreover is generated by its finite algebras, then must in fact be finite and if is also congruence distributive then (by Jónsson Lemma) is in fact unique. We summarize all this in a theorem:
Theorem 1. [McKenzie (1972)] Let be a congruence distributive variety that is generated by its finite algebras; then any splitting algebra in is finite and subdirectly irreducible. Moreover the conjugate variety is axiomatizable by a single equation in the language of .
Being generated by its finite algebras is the finite model property for the equational theory of : if an equation fails in , then it fails in some finite algebra in . The equation whose existence is postulated by Theorem 1 is called the splitting equation of . Note that the theorem does not say that if the hypotheses hold, then there is a splitting algebra in ; nor its proof produces an effective way of determining the splitting equation of , in case it is splitting. Both the existence and the splitting equation require ad hoc arguments; and in 1972 McKenzie did exactly that, characterizing the splitting algebras in the variety of all lattices and also giving an algorithm (still the only one available) for their splitting equations.
Almost in the same period of time in which R. McKenzie was working towards his results, in a different part of the world V. Jankov was studying intermediate logics, which amounts to studying subvarieties of the variety of Heyting algebras. In his investigations Jankov (1968) found a way to associate to any finite subdirectly irreducible Heyting algebra a term (called the Jankov formula) and was able to prove essentially that:
- the largest variety of Heyting algebras not containing is axiomatized by ;
- hence any finite subdirectly irreducible Heyting algebra is splitting in with splitting equation .
Subdirectly irreducible Heyting algebras are easily described: they are exactly all Heyting algebras having a unique maximal element below the top element ; a fancy way of saying that it that they can be represented as , where is the two element Boolean algebra and is the ordinal sum. So we can restate Jankov’s result in this fashion:
Theorem 2. A finite Heyting algebra is splitting if and only if it is of the form for some Heyting algebra .
We will explain how this result can be generalized to several classes of residuated (semi)lattices.