THE LATTICE OF SUBVARIETIES OF SEMILATTICE ORDERED ALGEBRAS
|
|
- Morgan Allen
- 6 years ago
- Views:
Transcription
1 THE LATTICE OF SUBVARIETIES OF SEMILATTICE ORDERED ALGEBRAS A. PILITOWSKA 1 AND A. ZAMOJSKA-DZIENIO 2 Abstract. This paper is devoted to the semilattice ordered V-algebras of the form (A, Ω, +), where + is a join-semilattice operation and (A, Ω) is an algebra from some given variety V. We characterize the free semilattice ordered algebras using the concept of extended power algebras. Next we apply the result to describe the lattice of subvarieties of the variety of semilattice ordered V-algebras in relation to the lattice of subvarieties of the variety V. 1. Introduction Ordered algebraic structures, particularly ordered fields, ordered vector spaces, ordered groups and semigroups, have a well-established tradition in mathematics. It is due to their internal interest and due to their applications in other areas. Special class of ordered algebras is given by semilattice ordered ones. Let be the variety of all algebras (A, Ω) of finitary type τ : Ω N and let V be a subvariety of. Definition 1.1. An algebra (A, Ω, +) is called a semilattice ordered V-algebra (or briefly semilattice ordered algebra) if (A, Ω) belongs to a variety V, (A, +) is a (join) semilattice (with semilattice order, i.e. x y x + y = y), and the operations from the set Ω distribute over the operation +, i.e. for each 0 n-ary operation ω Ω, and x 1,..., x i, y i,..., x n A (1.1.1) for any 1 i n. ω(x 1,..., x i + y i,..., x n ) = ω(x 1,..., x i,..., x n ) + ω(x 1,..., y i,..., x n ), Basic examples of semilattice ordered algebras are provided by additively idempotent semirings, distributive lattices, semilattice ordered semigroups and modals (semilattice ordered idempotent and entropic algebras). In 1979 R. McKenzie and A. Romanowska [10] showed that there are exactly five varieties of dissemilattices - semilattice ordered semilattices. Apart from the variety of all dissemilattices and the trivial variety, there are the variety of distributive lattices, the variety of stammered semilattices (where both basic semilattice operations are equal) and the variety of distributive dissemilattices. Date: May 24, Mathematics Subject Classification. 08B15, 08B20, 08A30, 06A12, 06F25. Key words and phrases. ordered structures, semilattices, power algebras, free algebras, fully invariant congruences, varieties, lattice of subvarieties. While working on this paper, the authors were supported by the Statutory Grant of Warsaw University of Technology 504P/1120/0025/000. 1
2 2 A. PILITOWSKA 1 AND A. ZAMOJSKA-DZIENIO 2 In 2005 S. Ghosh, F. Pastijn and X.Z. Zhao [5] described the lattice of all subvarieties of the variety generated by all ordered bands (semirings whose multiplicative reduct is an idempotent semigroup and additive reduct is a chain). They showed that the lattice is distributive and contains precisely 78 varieties. Each of them is finitely based and generated by a finite number of finite ordered bands. In the same year, M. Kuřil and L. Polák [9] introduced the certain closure operators on relatively free semigroup reducts and applied them to describe the lattice of subvarieties of the variety of all semilattice ordered semigroups. But, in general, very little is known about varieties of modals. In 1995 K. Kearnes [8] proved that to each variety V of entropic modals one can associate a commutative semiring R(V), whose structure determines many of the properties of the variety. In particular, Theorem 1.2 ([8]). The lattice of subvarieties of the variety V of entropic modals is dually isomorphic to the congruence lattice ConR(V) of the semiring R(V). Using Theorem 1.2, K. Ślusarska [17] described the lattice of subvarieties of entropic modals (D,, +) whose groupoid reducts (D, ) satisfy the additional identity: x(yz) xy. Just recently (see [13]) we described some family of fully invariant congruences on the free semilattice ordered idempotent and entropic algebras which can partially result in describing subvariety lattices of modals. The main aim of this paper is to describe a structure of the subvariety lattice of all semilattice ordered -algebras of a given type and study how it is related to the subvariety lattice of all -algebras. M. Kuřil and L. Polák introduced in [9] the notion of an admissible closure operator and applied it to describe the subvariety lattice of the variety of semilattice ordered semigroups. Description proposed by them is complicated and strictly depends on properties of semigroups. Applying the techniques from power algebras theory we simplify their description. Moreover, we generalize their results and obtain another type of description of the subvariety lattice of all semilattice ordered algebras. We start with the following easy observation. Lemma 1.3. Let (A, Ω, +) be a semilattice ordered -algebra, x 1,..., x n, y 1,..., y n A, and let ω Ω be an 0 n-ary operation. If x i y i for each 1 i n, then (1.3.1) ω(x 1,..., x n ) ω(y 1,..., y n ). Note, that by Lemma 1.3 each semilattice ordered -algebra (A, Ω, +) is an ordered algebra (A, Ω, ) in the sense of [3], [1], [4]. There are two other basic properties worth mentioning. Lemma 1.4. Let (A, Ω, +) be a semilattice ordered -algebra, and x ij A for 1 i n, 1 j r. Then for each 0 n-ary operation ω Ω we have (1.4.1) ω(x 11,..., x n1 ) ω(x 1r,..., x nr ) ω(x x 1r,..., x n x nr ). Lemma 1.5. Let (A, Ω, +) be a semilattice ordered -algebra and let ω Ω be an 0 n-ary operation. The algebra (A, Ω, +) satisfies for any x A the condition (1.5.1) ω(x,..., x) x,
3 THE LATTICE OF SUBVARIETIES OF SEMILATTICE ORDERED ALGEBRAS 3 if and only if for any x 1,..., x n A the following holds (1.5.2) ω(x 1,..., x n ) x x n. In particular, if a semilattice ordered -algebra (A, Ω, +) is idempotent then (1.5.2) holds. It is easy to see that in general both (1.3.1) and (1.4.1) hold also for term operations. The proofs go just by induction on the complexity of terms. Also, in such a case, for any term operation t, we obtain the inequality (1.5.3) t(x 1,..., x i,..., x n ) + t(x 1,..., y i,..., x n ) t(x 1,..., x i + y i,..., x n ), that generalizes the distributive law (1.1.1). The paper is organized as follows. In Section 2 examples of semilattice ordered V-algebras are provided, for some given varieties V. Among the others, we mention semilattice ordered n-semigroups, extended power algebras and modals. In Section 3 we describe the free semilattice ordered algebras (Theorem 3.4) and next we apply the result to describe the identities which are satisfied in varieties of semilattice ordered algebras (Corollary 3.10). Section 4 is devoted to present the main knots in the subvariety lattice of semilattice ordered algebras (Theorem 4.7). In Section 5 we characterize so called V-preserved subvarieties of the variety of all semilattice ordered algebras. In Theorem 5.9 we show that there is a correspondence between the set of all V-preserved subvarieties and the set of some fully invariant congruence relations on the extended power algebra of the V-free algebra. Theorem 5.12 contains the main result of this paper, i.e. the full description of the lattice of all subvarieties of the variety of all semilattice ordered algebras. The last Section 6 summarizes all results in the convenient form of the algorithm. The notation t(x 1,..., x n ) means the term t of the language of a variety V contains no other variables than x 1,..., x n (but not necessarily all of them). All operations considered in the paper are supposed to be finitary. We are interested here only in varieties of algebras, so the notation W V means that W is a subvariety of a variety V. 2. Examples In this section we discuss some basic and natural examples of semilattice ordered algebras. Example 2.1. Semilattice ordered semigroups. An algebra (A,, +), where (A, ) is a semigroup, (A, +) is a semilattice and for any a, b, c A, a (b + c) = a b + a c and (a + b) c = a c + b c is a semilattice ordered semigroup. In particular, semirings with an idempotent additive reduct ([18], [11]), distributive bisemilattices ([10]) and distributive lattices are semilattice ordered SG-algebras, where SG denotes the variety of all semigroups. Example 2.2. Semilattice ordered n-semigroups. Let 2 n N. An algebra (A, f) with one n-ary operation f is called an n-semigroup, if the following associative laws hold: f(f(a 1,..., a n ), a n+1,..., a 2n 1 ) = = f(a 1,..., a i, f(a i+1,..., a i+n ), a i+n+1,..., a 2n 1 ) = = f(a 1,..., a n 1, f(a n,..., a 2n 1 )),
4 4 A. PILITOWSKA 1 AND A. ZAMOJSKA-DZIENIO 2 for all a 1,..., a 2n 1 A. A semigroup is a 2-semigroup in this sense. An algebra (A, f, +), where (A, f) is an n-semigroup, (A, +) is a semilattice and the equations (1.1.1) are satisfied for the operation f, is a semilattice ordered n-semigroup. Let SG n be the variety of all n-semigroups, (A, +) be a semilattice and End(A, +) be the set of all endomorphisms of (A, +). For each 2 n N, we define n-ary composition ω n : (End(A, +)) n End(A, +), ω n (f 1,..., f n ) := f n... f 1. Then the algebra (End(A, +), ω n, ), with (f 1 f 2 )(x) := f 1 (x)+f 2 (x), for x A, is a semilattice ordered n-semigroup (semilattice ordered SG n -algebra). The algebra (End(A, +), {ω n : n N}, ) is also an example of a semilattice ordered algebra. Another example of a semilattice ordered n-semigroup can be obtained as follows. Let A be a set and Rel(A) be the set of all binary relations on A. For each 2 n N, we define n-ary relational product ω n : (Rel(A)) n Rel(A), ω n (r 1,..., r n ) := r n... r 1. Then the algebra (Rel(A), ω n, ), where is a set union, is a semilattice ordered SG n -algebra and the algebra (Rel(A), {ω n : n N}, ) is a semilattice ordered algebra. Example 2.3. Extended power algebras. For a given set A denote by P >0 A the family of all non-empty subsets of A. For any n-ary operation ω : A n A we define the complex operation ω : (P >0 A) n P >0 A in the following way: (2.3.1) ω(a 1,..., A n ) := {ω(a 1,..., a n ) a i A i }, where = A 1,..., A n A. The set P >0 A also carries a join semilattice structure under the set-theoretical union. B. Jónsson and A. Tarski proved in [7] that complex operations distribute over the union. Hence, for any algebra (A, Ω), the extended power algebra (P >0 A, Ω, ) is a semilattice ordered -algebra. The algebra (P <ω >0 A, Ω, ) of all finite non-empty subsets of A is a subalgebra of (P >0A, Ω, ). Example 2.4. Modals. An idempotent (in the sense that each singleton is a subalgebra) and entropic algebra (any two of its operations commute) is called a mode. Let M denote the variety of all modes. A modal is an algebra (M, Ω, +), such that (M, Ω) M, (M, +) is a (join) semilattice, and the Ω operations distribute over +. Examples of modals include distributive lattices, dissemilattices ([10]) - algebras (M,, +) with two semilattice structures (M, ) and (M, +) in which the operation distributes over the operation +, and the algebra (R, I 0, max) defined on the set of real numbers, where I 0 is the set of the following binary operations: p : R R R; (x, y) (1 p)x + py, for each p (0, 1) R. Each modal is in fact a semilattice ordered M-algebra. Modes and modals were introduced and investigated in detail by A. Romanowska and J.D.H. Smith ([15], [16]). If a modal (M, Ω, +) is entropic, then (M, Ω, +) is a mode and it is an example of a semilattice mode. Semilattice modes were described by K. Kearnes in [8]. 3. Free semilattice ordered algebras and identities Results of M. Kuřil and L. Polák [9] show that the problem of the characterization of semilattice ordered algebras requires the knowledge of the structure of the power
5 THE LATTICE OF SUBVARIETIES OF SEMILATTICE ORDERED ALGEBRAS 5 algebra of a given algebra. In this section we will describe the free semilattice ordered algebras using the concept of extended power algebras. Next we will apply the result to describe the identities which are satisfied in varieties of semilattice ordered algebras. Let be the variety of all algebras of finitary type τ : Ω N and let V be a subvariety of. Let (F V (X), Ω) be the free algebra over a set X in the variety V and let S V denote the variety of all semilattice ordered V-algebras. Theorem 3.1 (Universality Property for Semilattice Ordered Algebras). Let X be an arbitrary set and (A, Ω, +) S V. Each mapping h: X A can be extended to a unique homomorphism h: (P <ω >0 F V(X), Ω, ) (A, Ω, +), such that h/ X = h. Proof. Let (A, Ω, +) S V. By assumption, (A, Ω) V. So any mapping h: X A may be uniquely extended to an Ω-homomorphism h: (F V (X), Ω) (A, Ω). Further, Ω-homomorphism h can be extended to a unique {Ω, }-homomorphism h: (P <ω >0 F V(X), Ω, ) (A, Ω, +); h(t ) t T h(t), where T is a non-empty finite subset of F V (X). To show that h is an Ω-homomorphism, consider an n-ary operation ω Ω and non-empty finite subsets T 1,..., T n F V (X). Then h(ω(t 1,..., T n )) = h({ω(t 1,..., t n ) t i T i }) = h(ω(t 1,..., t n )) (t 1,...,t n) T 1... T n = ω(h(t 1 ),..., h(t n )) (t 1,...,t n ) T 1... T n = ω( h(t 1 ),..., h(t n )) = ω(h(t 1 ),..., h(t n )). t 1 T 1 t n T n Moreover, h is a semilattice homomorphism because h(t 1 T 2 ) = h(t) = h(t 1 ) + h(t 2 ) = h(t 1 ) + h(t 2 ). t T 1 T 2 t 1 T 1 t 2 T 2 The uniqueness of h is obvious. By Theorem 3.1, for an arbitrary variety V, the algebra (P <ω >0 F V(X), Ω, ) has the universality property for semilattice ordered algebras in S V, but in general, the algebra itself doesn t have to belong to the variety S V. Example 3.2. Let V be a variety of idempotent groupoids satisfying the identities: x (y z) x y (x y) x and (x y) y x. Consider the free groupoid (F V (X), ) over a set X in the variety V and its two generators x, y X. One can easily see that ({x}{x, y, xy, yx}){x, y, xy, yx} = {x, xy} {x}. This shows that the algebra (P <ω >0 F V(X),, ) does not belong to the variety S V.
6 6 A. PILITOWSKA 1 AND A. ZAMOJSKA-DZIENIO 2 Note that the semilattice ordered algebra (P >0 <ωf V(X), Ω, ) is generated by the set {{x} x X}. Hence, if (P >0 <ωf V(X), Ω, ) S V, then it is, up to isomorphism, the unique algebra in S V generated by a set X, with the universal mapping property. Corollary 3.3. The semilattice ordered algebra (P >0 <ωf V(X), Ω, ) is free over a set X in the variety S V if and only if (P >0 <ωf V(X), Ω, ) S V. In particular, one obtains Theorem 3.4. The semilattice ordered algebra (P >0 <ωf (X), Ω, ) is free over a set X in the variety S. Moreover, S = HSP((P >0 <ωf (X), Ω, )) for an infinite set X. With each subvariety S S of semilattice ordered -algebras we can associate a least subvariety V of with the property S S V. But, for two different subvarieties V and W of, the varieties S V and S W can be equal. Example 3.5. A differential groupoid is a mode groupoid (D, ) satisfying the additional identity: x(yz) xy. Each proper non-trivial subvariety of the variety D of differential groupoids (see [14]) is relatively based by a unique identity of the form (3.5.1) (... ((x y)y)...)y =: xy i xy i+j }{{} i times for some i N and positive integer j. Denote such a variety by D i,i+j. Obviously, the variety D 0,1 is exactly the variety LZ of left-zero semigroups (groupoids (A, ) such that a b = a for all a, b A). Let S D denote the variety of all differential modals (modals whose mode reduct is a differential groupoid) and let S D0,j S D be the variety of semilattice ordered D 0,j - groupoids. We showed in [12] that for each positive integer j, one has S D0,j = S LZ. Example above arises the question, for which different subvarieties V 1 V 2, the varieties S V1 and S V2 are different, too. To answer this, for an arbitrary binary relation Θ on the set P >0 <ωf V(X) we will introduce a new binary relation Θ F V X) F V (X). For t, u F V (X) (t, u) Θ ({t}, {u}) Θ. Example 3.6. It is easy to see that for the least equivalence relation id P <ω >0 F V (X) and the greatest equivalence relation T on the set P >0 <ωf V(X), we have ĩd P <ω >0 F V (X) = id FV (X) and T = F V (X) F V (X). Clearly, if Θ is an equivalence relation, then Θ is an equivalence relation, too. Additionally, if we consider the algebra (F V (X), Ω) and Θ is a congruence on (P <ω >0 F V(X), Ω, ), then also Θ is a congruence relation on (F V (X), Ω). Lemma 3.7. Let Θ be a fully invariant congruence relation on (P <ω >0 F V(X), Ω, ). Then the relation Θ is a fully invariant congruence on (F V (X), Ω). Proof. Let t, u F V (X). We have to prove that, if (t, u) Θ then also (α(t), α(u)) Θ, for any endomorphism α of the algebra (F V (X), Ω).
7 THE LATTICE OF SUBVARIETIES OF SEMILATTICE ORDERED ALGEBRAS 7 It was shown in [2] that if α: A B is a homomorphism of Ω-algebras (A, Ω) and (B, Ω), so is α + : P >0 <ωa P<ω >0 B, where α+ (S) := {α(s) s S} for any S P >0 <ωa. Obviously, α+ is also a homomorphism with respect to. If α is an endomorphism of the algebra (F V (X), Ω), then α + is an endomorphism of the algebra (P >0 <ωf V(X), Ω, ). Since, by assumption, Θ is a fully invariant congruence on (P >0 <ωf V(X), Ω, ), then in particular ({t}, {u}) Θ implies (α + ({t}), α + ({u})) Θ. Since α + ({x}) = {α(x)} for any x A, one obtains (α(t), α(u)) Θ. Let Con fi (F V (X)) be the set of all fully invariant congruences of the algebra (F V (X), Ω) and denote the set of all fully invariant congruences of the algebra (P <ω >0 F V(X), Ω, ) by Con fi (P <ω >0 F V(X)). From now through all over the paper, we assume X is an infinite set. By Lemma 3.7, each fully invariant congruence relation Θ on (P <ω >0 F (X), Ω, ) determines a subvariety Θ of : Θ := HSP((F (X)/ Θ, Ω)). Of course, it may happen that for Θ 1 Θ 2, the varieties Θ1 and Θ2 are equal. Example 3.8. By results of R. McKenzie and A. Romanowska [10] we have that there are at least 5 subvarieties of the variety of semilattice ordered groupoids which are also semilattice ordered semilattices. But the variety of semilattices has only two subvarieties. We will show in Theorem 3.14 that for Θ 1, Θ 2 Con fi (P <ω >0 F (X)), different congruences Θ 1 Θ 2 Con fi (F (X)) always determine different subvarieties of the variety S. But first we prove some auxiliary results. Lemma 3.9. Let Θ Con fi (P >0 <ωf (X)) and t = t(x 1,..., x k ), u = u(x 1,..., x k ) F (X) be k-ary terms. Then, the identity t u holds in (P >0 <ωf (X)/Θ, Ω, ) if and only if ({t}, {u}) Θ. Proof. Let the identity t u hold in (P >0 <ωf (X)/Θ, Ω, ). This means that for any P 1 /Θ,..., P k /Θ P >0 <ωf (X)/Θ, we have t(p 1,..., P k )/Θ = t(p 1 /Θ,..., P k /Θ) = u(p 1 /Θ,..., P k /Θ) = u(p 1,..., P k )/Θ. The latter implies that for any subsets P 1,..., P k P >0 <ωf (X), one has (t(p 1,..., P k ), u(p 1,..., P k )) Θ. In particular, for P 1 = {x 1 },..., P k = {x k }, we obtain ({t(x 1,..., x k )}, {u(x 1,..., x k )}) Θ. Now, let ({t}, {u}) Θ. Since Θ Con fi (P >0 <ωf (X)), then for any endomorphism α of (P >0 <ωf (X), Ω, ) we also have (α({t}), α({u})) Θ. In particular, for any subsets P 1,..., P k P >0 <ωf (X), we obtain (t(p 1,..., P k ), u(p 1,..., P k )) Θ. This means that the identity t u holds in (P >0 <ωf (X)/Θ, Ω, ). Corollary Let Θ Con fi (P >0 <ωf (X)) and t, u F (X). Then, the identity t u holds in (P >0 <ωf (X)/Θ, Ω) if and only if t u holds in (F (X)/ Θ, Ω). Corollary Let Θ Con fi (P <ω >0 F (X)). Then HSP((P <ω >0 F (X)/Θ, Ω, )) S Θ. Lemma Let Θ, Ψ Con fi (P <ω >0 F (X)) be such that (P <ω >0 F (X)/Ψ, Ω, ) S Θ. Then, Θ Ψ.
8 8 A. PILITOWSKA 1 AND A. ZAMOJSKA-DZIENIO 2 Proof. Let t, u F (X) and (t, u) Θ. By assumption, (P >0 <ωf (X)/Ψ, Ω) Θ. This means the identity t u holds also in (P >0 <ωf (X)/Ψ, Ω, ). By Lemma 3.9 we obtain (t, u) Ψ which shows Θ Ψ. Corollary Let Θ, Ψ Con fi (P <ω >0 F (X)) be such that Then, Ψ = Θ. S Θ = HSP((P<ω >0 F (X)/Ψ, Ω, )). Proof. By Lemma 3.12, we have Θ Ψ. Further, by Corollary 3.11 we also have HSP((P >0 <ωf (X)/Θ, Ω, )) HSP((P >0 <ωf (X)/Ψ, Ω, )). Therefore, Ψ Θ. Hence, Ψ Θ, which proves Ψ = Θ. By Corollary 3.11 and Lemma 3.12 one immediately obtains Theorem Let Θ 1, Θ 2 Con fi (P <ω >0 F (X)). Then Θ 1 Θ 2 S Θ 1 S Θ 2. Finally note that for each subvariety S V, with V the subvariety of, there exists a congruence Θ Con fi (P <ω >0 F (X)) such that V = Θ. Indeed, let S V = HSP((P >0 <ω F (X)/Θ, Ω, )) and S Θ = HSP((P >0 <ω F (X)/Ψ, Ω, )), for some Θ, Ψ Con fi (P >0 <ωf (X)). By Corollary 3.11, S V S Θ. Further, by Corollary 3.13 we have Θ = Ψ. Let t, u F (X) and let the identity t u hold in S V. By Corollary 3.10, we have that t u holds in Θ = Ψ. This implies that t u holds in (P >0 <ωf (X)/Ψ, Ω) and proves that S S Θ V. 4. Main knots in the lattice of subvarieties In previous section we have shown that for different congruences Θ 1 Θ 2 Con fi (F (X)), with Θ 1, Θ 2 Con fi (P >0 <ωf (X)), the subvarieties S Θ and S 1 Θ 2 are always different. To describe all fully invariant congruences of the algebra (P >0 <ωf (X), Ω, ) which uniquely determine subvarieties of the form S V, for some V, we have to introduce the next binary relation. Let us define a binary relation R on the set Con fi (P >0 <ωf (X)) in the following way: for Θ 1, Θ 2 Con fi (P >0 <ωf (X)) Obviously, R is an equivalence relation. Θ 1 R Θ 2 Θ 1 = Θ 2. Theorem 4.1. Let Θ, Ψ Con fi (P >0 <ωf (X)) be congruences such that S = Θ HSP((P >0 <ωf (X)/Ψ, Ω, )). Then, Ψ = Φ Θ/R Φ. Proof. Let Θ, Ψ Con fi (P >0 <ωf (X)) and S = HSP((P<ω Θ >0 F (X)/Ψ, Ω, )). By Corollary 3.13 we have Ψ Θ/R, thus obviously Φ Θ/R Φ Ψ. On the other hand, for Φ Θ/R, we have Φ = Θ. Hence, by Corollary 3.11 HSP((P <ω >0 F (X)/Φ, Ω, )) S Φ = S Θ = HSP((P<ω >0 F (X)/Ψ, Ω, )), which implies Ψ Φ Θ/R Φ, and consequently, Ψ = Φ Θ/R Φ.
9 THE LATTICE OF SUBVARIETIES OF SEMILATTICE ORDERED ALGEBRAS 9 Corollary 4.2. Let Θ 1, Θ 2 Con fi (P >0 <ωf (X)). Then Θ 1 Θ 2 Φ Φ. Φ Θ 1/R Φ Θ 2/R Proof. Let Θ 1, Θ 2, Ψ 1, Ψ 2 Con fi (P <ω >0 F (X)) be such that S Θ 1 = HSP((P <ω >0 F (X)/Ψ 1, Ω, )), and S Θ 2 = HSP((P <ω >0 F (X)/Ψ 2, Ω, )). Since, by assumption, Θ 1 Θ 2, then by Corollaries 3.10 and 3.13 we have S Θ 2 S Θ. 1 By Theorem 4.1, this is clear that Φ = Ψ 1 Ψ 2 = Φ, which finishes the proof. Φ Θ 1 /R Φ Θ 2 /R Lemma 4.3. Let I be a set and for each i I, let Θ i be an equivalence relation on P >0 <ωf (X). Then Θ i = Θ i. Let Θ Con fi (P >0 <ωf (X)), I be a set and for each i I, let Ψ i Θ/R. Then by Lemma 4.3, also Ψ i Θ/R. This shows that in each class of the relation R there is the least element with respect to the set inclusion. Let Con R fi(p >0 <ω F (X)) := {Θ Con fi (P >0 <ω F (X)) Θ = be the set of all such the least congruences in each R-class. Directly by Theorem 4.1 we obtain Corollary 4.4. Let Θ Con R fi (P<ω >0 F (X)). Then S Θ = HSP((P<ω >0 F (X)/Θ, Ω, )). Φ Θ/R We can say that subvarieties of the form S Θ, Θ ConR fi (P<ω >0 F (X)), are some kinds of main knots in the lattice of subvarieties of semilattice ordered algebras. Obviously, if Θ 1 Θ 2 then also Θ 1 Θ 2. As a consequence of Corollary 4.2 if Θ 1, Θ 2 Con R fi (P<ω >0 F (X)), then the converse is also true. Corollary 4.5. Let Θ 1, Θ 2 Con R fi (P<ω >0 F (X)). Then Θ 1 Θ 2 Θ 1 Θ 2. Let Θ 1 Θ 2 denote the least upper bound of two congruence relations Θ 1, Θ 2 Con fi (P >0 <ωf (X)) with respect to the set inclusion. Note that in general Θ 1 Θ 2 Θ 1 Θ 2. Corollary 4.5 allows us to formulate the following result. Φ}
10 10 A. PILITOWSKA 1 AND A. ZAMOJSKA-DZIENIO 2 Lemma 4.6. The ordered set (Con R fi (P<ω >0 F (X)), ) is a complete lattice. Let I be a set and for each i I, let Θ i Con R fi (P<ω >0 F (X)). Then, the relation Φ Φ ( Θ i )/R is the least upper bound of {Θ i }, and the congruence Φ is the greatest lower bound of {Θ i }. Φ ( Θ i )/R Let us introduce the following notation: L R ( ) := { Θ Θ Con R fi(p <ω >0 F (X))}. Clearly, the set L R ( ) is partially ordered by the set inclusion. Θ 1, Θ 2 Con R fi (P<ω >0 F (X)) Θ1 Θ2 Θ 2 Θ 1 Θ 2 Θ 1. Directly from Lemma 4.6 we obtain the following Moreover, for Theorem 4.7. The ordered set (L R ( ), ) is a complete lattice dually isomorphic to the lattice (Con R fi (P<ω >0 F (X)), ). For any two subvarieties, L R ( ), Θ1 Θ2 the variety Θ is the least upper bound of and, and the variety 1 Θ 2 Θ1 Θ2 Θ 1 Θ 2 is the greatest lower bound of and. Θ1 Θ2 By Lemma 4.3 it follows that the variety Θ is equal to the variety 1 Θ 2 Θ1, the least upper bound of and with respect to the set inclusion. But Θ2 Θ1 Θ2 the variety Θ has not to be equal to the variety. 1 Θ 2 Θ1 Θ2 By Theorem 3.14 we immediately obtain Corollary 4.8. The lattice ({S Θ ConR Θ fi (P<ω >0 F (X))}, ) of all main knots subvarieties is isomorphic to the lattice (L R ( ), ). For any two varieties S Θ1 and S Θ2, the variety S Θ1 Θ2 is their least upper bound and the variety S Θ is their greatest lower bound (see Figure 1). 1 Θ 2 S Θ 1 Θ 2 S Θ S 1 Θ 2 S Θ 1 Θ 2 Figure 1. The lattice ({S Θ Θ ConR fi (P<ω >0 F (X))}, )
11 THE LATTICE OF SUBVARIETIES OF SEMILATTICE ORDERED ALGEBRAS The lattice of subvarieties By Lemma 4.3 one obtains the following characterization of the ordered set (Θ/R, ) for Θ Con R fi (P<ω >0 F (X)). Lemma 5.1. Let Θ Con R fi (P<ω >0 F (X)), I be a set and for each i I, Ψ i Θ/R. Then (Θ/R, ) is a complete meet-semilattice with the relation Ψ i as the greatest lower bound of {Ψ i }. Let Ψ Θ/R. Note that by Corollary 3.10 the algebras (P <ω >0 F (X)/Ψ, Ω) and (F (X)/ Θ, Ω) satisfy exactly the same identities. This shows that the variety S = HSP((P <ω >0 F (X)/Ψ, Ω, )) is a subvariety of S Θ and is not included in S W for any proper subvariety W Θ. This justifies the introduction of the following definition. Definition 5.2. Let V be a subvariety of and S be a non-trivial subvariety of S V. The variety S is V-preserved, if S S W for any proper subvariety W of V. Lemma 5.3. Let Θ, Ψ Con fi (P <ω >0 F (X)). A non-trivial subvariety is Θ-preserved if and only if Ψ = Θ. S = HSP((P <ω >0 F (X)/Ψ, Ω, )) S Θ Proof. By Lemma 3.12, for each subvariety S = HSP((P >0 <ωf (X)/Ψ, Ω, )) S Θ, one has Θ Ψ. Now let S be Θ-preserved subvariety of S Θ. By definition, S is not included in any variety S W for a proper subvariety W Θ. This means that the algebra (P >0 <ωf (X)/Ψ, Ω) does not belong to any proper subvariety of Θ. Then, by Corollary 3.10, Ψ = Θ. Finally, let Ψ = Θ. Hence, by Corollary 3.10 the algebras (P >0 <ωf (X)/Ψ, Ω) and (F (X)/ Θ, Ω) satisfy exactly the same identities, which shows that S is Θpreserved. Let Θ Con R fi (P<ω >0 F (X)). By Lemma 5.3 with each congruence Ψ Θ/R one can associate the Θ-preserved subvariety HSP((P >0 <ωf (X)/Ψ, Ω, )) of S. Θ This mapping is the restriction of the dual isomorphism we have between lattice (Con fi (P >0 <ωf (X)), ) and the lattice of all subvarieties of S, to the set Θ/R. By Lemmas 4.3, 5.1 and 5.3 we immediately have Theorem 5.4. Let Θ Con R fi (P<ω >0 F (X)). The semilattice of all Θ-preserved subvarieties of S Θ is dually isomorphic to the complete semilattice (Θ/R, ). For any Θ-preserved subvarieties {S i } of S Θ, the variety S i is their least upper bound. In Theorem 5.9 we will show that there is also a correspondence between the set of Θ-preserved subvarieties of S Θ and the set of some fully invariant congruence relations on the algebra (P >0 <ω(f (X)/ Θ), Ω, ). First we will prove some auxiliary technical results. We introduce the following notation. For a set Q P >0 <ωf (X) and a congruence Ψ Con fi (P >0 <ωf (X)), Q Ψ := {q(x 1 / Ψ,..., x n / Ψ) q Q} = {q(x 1,..., x n )/ Ψ q Q} P <ω >0 (F (X)/ Ψ).
12 12 A. PILITOWSKA 1 AND A. ZAMOJSKA-DZIENIO 2 Now, we define a relation δ Ψ P <ω >0 (F (X)/ Ψ) P <ω >0 (F (X)/ Ψ) in the following way: for Q, R P <ω >0 F (X). (Q Ψ, R Ψ) δ Ψ (Q, R) Ψ Lemma 5.5. Let Ψ Con fi (P <ω >0 F (X)). The relation δ Ψ is a fully invariant congruence relation on (P <ω >0 (F (X)/ Ψ), Ω, ) such that δ Ψ = id F (X)/ Ψ and (P <ω >0 (F (X)/ Ψ)/δ Ψ, Ω) Ψ. Proof. Let Ψ Con fi (P <ω >0 F (X)). First note that the definition of the relation δ Ψ is correct. Let x 1,..., x k, y 1,..., y m F (X) and (x 1, t 1 ),..., (x k, t k ), (y 1, u 1 ),..., (y m, u m ) Ψ. Then ({x 1 }, {t 1 }),..., ({x k }, {t k }), ({y 1 }, {u 1 }),..., ({y m }, {u m }) Ψ. Since Ψ is a congruence on (P <ω >0 F (X), Ω, ) we obtain ({x 1,..., x k }, {t 1,..., t k }), ({y 1,..., y m }, {u 1,..., u m }) Ψ. Clearly, the relation δ Ψ is a congruence on (P >0 <ω(f (X)/ Ψ), Ω, ). We will show that δ Ψ is fully invariant. Let Q Ψ, R Ψ P >0 <ω(f (X)/ Ψ). We have to prove that for every endomorphism λ of (P >0 <ω(f (X)/ Ψ), Ω, ), if (Q Ψ, R Ψ) δ Ψ, then also (λ(q Ψ), λ(r Ψ)) δ Ψ. For each x i / Ψ X/ Ψ let us choose a subset P Ψ i P >0 <ω(f (X)/ Ψ). The mapping λ : P >0 <ω(f (X)/ Ψ) P >0 <ω(f (X)/ Ψ) (5.5.1) λ(q Ψ) = λ({q(x 1 / Ψ,..., x n / Ψ) q Q}) := q(p Ψ 1,..., P Ψ n ) is an endomorphism of the algebra (P <ω >0 (F (X)/ Ψ), Ω, ). Note that the algebra (F (X)/ Ψ, Ω) is generated by the set {x/ Ψ x X}. It follows then that the algebra (P <ω >0 (F (X)/ Ψ), Ω, ) is generated by the set {{x/ Ψ} x X} and for any {x i / Ψ}, we have λ({x i / Ψ}) = P Ψ i. Because each homomorphism is uniquely defined on generators of an algebra then we obtain that each endomorphism λ of (P <ω >0 (F (X)/ Ψ), Ω, ) is of the form (5.5.1). Recall we consider here only finite subsets of F (X). This assumption is crucial in what follows. Let Λ be an endomorphism of (P >0 <ωf (X), Ω, ). By above discussion, Λ is of the form (5.5.1) for subsets P 1,..., P n P >0 <ωf (X). Let Q, R P >0 <ωf (X). Hence we have (Q Ψ, R Ψ) δ Ψ (Q, R) Ψ. Therefore, because Ψ is, by assumption, a fully invariant congruence on (P >0 <ωf (X), Ω, ), for the endomorphism Λ we obtain (Λ(Q), Λ(R)) Ψ ( q(p 1,..., P n ), r(p 1,..., P n )) Ψ q Q r R (( q(p 1,..., P n )) Ψ, ( r(p 1,..., P n )) Ψ) δ Ψ q Q r R ( q(p Ψ 1,..., P Ψ n ), r(p Ψ 1,..., P Ψ n )) δ Ψ. q Q r R q Q
13 (t, u) Ψ t/ Ψ = u/ Ψ (t/ Ψ, u/ Ψ) id F (X)/ Ψ. THE LATTICE OF SUBVARIETIES OF SEMILATTICE ORDERED ALGEBRAS 13 This shows that for any endomorphism Υ of the algebra (P <ω >0 (F (X)/ Ψ), Ω, ), (Υ(Q Ψ), Υ(R Ψ)) δ Ψ and proves that the congruence δ Ψ is fully invariant. Now we will prove that (P >0 <ω(f (X)/ Ψ)/δ Ψ, Ω) Ψ. By Corollary 3.11, the variety HSP(P >0 <ωf (X)/Ψ, Ω, ) is included in S Ψ, which means that the algebra (P >0 <ωf (X)/Ψ, Ω) belongs to the variety Ψ. Hence, for any identity t(x 1,..., x m ) = t u = u(x 1,..., x m ) which holds in Ψ and arbitrary Q 1 /Ψ,..., Q m /Ψ P >0 <ωf (X)/Ψ we have This is equivalent to It follows then t(q 1,..., Q m )/Ψ = t(q 1 /Ψ,..., Q m /Ψ) = u(q 1 /Ψ,..., Q m /Ψ) = u(q 1,..., Q m )/Ψ. (t(q 1,..., Q m ), u(q 1,..., Q m )) Ψ. (t(q 1,..., Q m ) Ψ, u(q 1,..., Q m ) Ψ) δ Ψ (t(q Ψ 1,..., Q Ψ m ), u(q Ψ 1,..., Q Ψ m )) δ Ψ t(q Ψ 1,..., Q Ψ m )/δ Ψ = u(q Ψ 1,..., Q Ψ m )/δ Ψ t(q Ψ 1 /δ Ψ,..., Q Ψ m /δ Ψ ) = u(q Ψ 1 /δ Ψ,..., Q Ψ m /δ Ψ ). This proves that the identity t u holds in the algebra (P <ω >0 (F (X)/ Ψ)/δ Ψ, Ω). Finally, for t, u F (X) (t/ Ψ, u/ Ψ) δ Ψ ({t/ Ψ}, {u/ Ψ}) δ Ψ ({t}, {u}) Ψ Let Θ Con R fi (P<ω >0 F (X)). Denote by Con id fi (P<ω >0 F Θ (X)) the following set: {ψ Con fi (P >0 <ω F (X)) ψ Θ = id F (X) and (P <ω Θ >0 F Θ (X)/ψ, Ω) Θ}. Now, for ψ Con id fi (P<ω >0 F Θ (X)), define a relation ψ P <ω >0 F (X) P <ω >0 F (X) in the following way: (T, U) ψ (T Θ, U Θ) ψ. Again, by similar straightforward calculations as in the proof of Lemma 5.5 one can obtain the following. Lemma 5.6. Let Θ Con R fi (P<ω >0 F (X)) and ψ Con id fi (P<ω >0 F Θ (X)). Then, the relation ψ is a fully invariant congruence on (P >0 <ωf (X), Ω, ) with the properties ψ = Θ and HSP((P >0 <ωf (X)/ ψ, Ω)) Θ. Lemma 5.7. Let Θ Con R fi (P<ω >0 F (X)). If Ψ Θ/R then Ψ = δψ. For a congruence ψ Con id fi (P<ω >0 F Θ (X)) one has ψ = δ ψ.
14 14 A. PILITOWSKA 1 AND A. ZAMOJSKA-DZIENIO 2 Lemmas 5.5 and 5.7 immediately imply Corollary 5.8. Let Θ Con R fi (P<ω >0 F (X)). The map Ψ δ Ψ is a complete semilattice homomorphism between (Θ/R, ) and (Con id fi (P<ω >0 F Θ(X)), ). By Corollary 5.8 and Theorem 5.4 we obtain Theorem 5.9. Let Θ Con R fi (P<ω >0 F (X)). The complete semilattice of all Θ-preserved subvarieties of S Θ is dually isomorphic to the complete semilattice (Con id fi (P<ω >0 F Θ (X)), ). Before we formulate Theorem 5.12, the main result of the paper, let us summarize what we have already known. For each Ψ Con fi (P >0 <ωf (X)) such that Ψ = Θ, the subvariety S = HSP((P >0 <ωf (X)/Ψ, Ω, )) of S is an Θ-preserved subvariety of S Θ S according to Lemma 5.3. Therefore, to find any subvariety S of S we should proceed as follows: first find the proper main knot and then choose one of its subvarieties. By Theorem 3.14, Lemma 5.3, and Theorem 5.9 one can uniquely associate with the variety S two congruence relations: Θ Con R fi (P<ω >0 F (X)) such that Ψ = Θ (for the main knot S ), and then δψ Θ Con id fi (P<ω >0 F Θ (X)) (for the chosen Θ-preserved subvariety). On the other hand, any pair of congruences: Θ Con R fi (P<ω >0 F (X)) and α Con id fi (P<ω >0 F Θ (X)) describes a subvariety S = HSP((P<ω >0 F (X)/Ψ, Ω, )) of S such that Ψ = Θ and α = δ Ψ. Consider the set One has Con id fi( ) := Θ Con R fi (P<ω >0 F (X)) Con id fi(p <ω >0 F Θ (X)). α Con id fi( ) Θ Con R fi(p <ω >0 F (X)) such that α Con id fi(p <ω >0 F Θ(X)). To stress the fact that the congruence α depends on Θ we denote it by α Θ. Now, define on the set Con id fi ( ) a binary relation in the following way: for α Θ Con id fi (P<ω >0 F (X)) and β Ψ Θ Con id fi (P<ω >0 F (X)), with Θ, Ψ ConR Ψ fi (P<ω >0 F (X)) α Θ β Ψ Θ Ψ and (a 1,..., a k, b 1,..., b m F (X)) ({a 1 / Θ,..., a k / Θ}, {b 1 / Θ,..., b m / Θ}) α Θ ({a 1 / Ψ,..., a k / Ψ}, {b 1 / Ψ,..., b m / Ψ}) β Ψ. Clearly, the relation is a partial order. Remark Let Θ, Λ Con R fi (P<ω >0 F (X)) and let Ψ, Γ Con fi (P >0 <ωf (X)) be such that Ψ = Θ and Γ = Λ. Then for the congruences δ Ψ Con id fi (P<ω >0 F (X)), Θ δ Γ Con id fi (P<ω >0 F Λ (X)) one has δ Ψ δ Γ Ψ Γ.
15 THE LATTICE OF SUBVARIETIES OF SEMILATTICE ORDERED ALGEBRAS 15 Theorem The ordered set (Con id fi ( ), ) is a complete lattice. Let I be a set and for each i I, α Θ i Con id fi (P<ω >0 F Θ (X)). The binary relations i δ δ α Θ i P <ω >0 F Θ i (X) P <ω >0 F Θ i (X), and P <ω α Θ i >0 F Υ (X) P<ω >0 F (X), where Υ := Υ Φ ( α Θ )/R i are, respectively, the greatest lower bound and the least upper bound of {α Θ i } with respect to. Proof. Let Θ, Φ Con R fi (P<ω >0 F (X)). By Lemma 5.6, for any α Θ Con id fi ( ) we have α Θ = Θ. Then by Lemma 4.3, one obtains α Θ i = α Θ i = Θ i = Θ i and Hence, by Lemmas 5.5 and 5.6, the congruences δ to the set Con id fi ( ). Obviously, for each i I, α Θ i α Θ i = Υ. and δ α Θ i Φ, belong Θ i Θ i. Moreover, for t 1,..., t k, u 1,..., u m F (X) ({t 1 / Θ i,..., t k / Θ i }, {u 1 / Θ i,..., u m / Θ i }) δ (i I) ({t 1 / Θi,..., t k / Θi }, {u 1 / Θi,..., u m / Θi }) α Θ i. This implies that for each i I, δ α Θ i α Θ i. α Θ i Now let γ Φ Con id fi (P<ω >0 F (X)) and for each i I, γ Φ Φ α Θ i. Then, for each i I, Φ Θ i, and consequently, Φ Θ i. Further, for any t 1,..., t k, u 1,..., u m F (X) ({t 1 / Φ,..., t k / Φ}, {u 1 / Φ,..., u m / Φ}) γ Φ (i I) ({t 1,..., t / Θi k }, {u / Θi 1,..., u / Θi m }) α Θ i / Θi (i I) ({t 1,..., t k }, {u 1,..., u m }) α Θ i ({t 1,..., t k }, {u 1,..., u m }) α Θ i ({t 1 / Θ i,..., t k / Θ i }, {u 1 / Θ i,..., u m / Θ i }) δ. α Θ i This shows the relation δ is the greatest lower bound of {α Θ i } α Θ with i respect to. Now note that for each i I, α Θ i = Θ i Θ i = α Θ i α Θ i = Υ
16 16 A. PILITOWSKA 1 AND A. ZAMOJSKA-DZIENIO 2 and for t 1,..., t k, u 1,..., u m F (X) we have ({t 1,..., t / Θi k }, {u / Θi 1,..., u / Θi m }) α Θ i / Θi ({t 1,..., t k }, {u 1,..., u m }) α Θ i ({t 1,..., t k }, {u 1,..., u m }) α Θ i Thus, for each i I, α Θ i δ ({t 1 / Υ,..., t k / Υ}, {u 1 / Υ,..., u m / Υ}) δ. α Θ i. α Θ i Finally, let γ Φ Con id fi (P<ω >0 F Φ (X)) and for each i I, α Θ i γ Φ. Then, for each i I, Θ i Φ and for t 1,..., t k, u 1,..., u m F (X) ({t 1,..., t k }, {u 1,..., u m }) α Θi ({t 1 / Θi,..., t k / Θi }, {u 1 / Θi,..., u m / Θi }) α Θ i ({t 1 / Φ,..., t k / Φ}, {u 1 / Φ,..., u m / Φ}) γ Φ ({t 1,..., t k }, {u 1,..., u m }) γ Φ. Then, for each i I, α Θ i γ Φ. Hence α Θ i γ Φ, which implies Moreover, by Lemma 5.7 we have Υ = α Θ i γ Φ = Φ. ({t 1 / Υ,..., t k / Υ}, {u 1 / Υ,..., u m / Υ}) δ ({t 1,..., t k }, {u 1,..., u m }) α Θ i α Θ i ({t 1,..., t k }, {u 1,..., u m }) γ Φ ({t 1 / Φ,..., t k / Φ}, {u 1 / Φ,..., u m / Φ}) δ γ Φ = γ Φ, which means the relation δ is the least upper bound of {α Θ i }, and completes the proof. α Θ i By Theorem 5.11 we obtain a full description of the lattice of all subvarieties of the variety S. Let L(S ) denote the set of all subvarieties of the variety S. As we have already noticed each subvariety S of S may be uniquely described by two congruences: Θ Con R fi (P<ω >0 F (X)) and α Θ Con id fi (P<ω >0 F Θ (X)). Hence, we can denote each subvariety in the set L(S ) by S α Θ Θ. Thus, one has L(S ) = {S α Θ Θ Θ ConR fi(p <ω >0 F (X)), α Θ Con id fi(p <ω >0 F Θ (X))}. Theorem The lattice (L(S ), ) of all subvarieties of the variety S dually isomorphic to the lattice (Con id fi ( ), ). is
17 THE LATTICE OF SUBVARIETIES OF SEMILATTICE ORDERED ALGEBRAS 17 For any S α Θ, S β Ψ Θ L(S ) we have: Ψ and where Υ := S α Θ Θ S β Ψ δ α Θ = S β Ψ Ψ Θ Ψ S α Θ Ψ δ α Θ Θ Sβ = S β Ψ Ψ, Υ Φ, (see Figure 2). Φ ( α Θ β Ψ )/R S α Θ Θ δ α Θ S β Ψ Θ Ψ S β Ψ Ψ S δ α Θ β Ψ Υ Figure 2. The lattice (L(S ), ) Theorem 5.12 allows to describe the subvariety lattice L(S ) without knowledge of the set Con fi (P >0 <ωf (X)). But, if we know the latter, each congruence α Θ Con id fi (P<ω >0 F (X)) may be replaced by the congruence δ Θ Ψ, for Ψ Con fi (P >0 <ωf (X)) such that Ψ = Θ. Then, Theorem 5.12 may be considerably simplified. Corollary For any S δψ, S δφ L(S ) we have: Θ Γ S δ Ψ S δ Φ = S δ Ψ Φ Θ Γ Θ Γ and S δ Ψ S δ Φ Θ Γ = S δ Ψ Φ Υ= Ψ Φ. Υ 6. The lattice L(S ) - practical computations Now, for a subvariety V, we will present how to find the lattice (L(S V ), ) of all subvarieties of the variety S V, knowing the lattice (L(V), ). Of course, any lattice (L(S V ), ) is a sublattice of the lattice (L(S ), ). On the other hand, Example 3.5 shows that not for each subvariety V, the variety S V is uniquely defined. Let us consider two sets Con V := {ψ Con fi (P <ω >0 F V(X)) ψ = id FV (X) and (P <ω >0 F V(X)/ψ, Ω) V} and O V := {W V Con W }. By Lemma 5.6, if Con V then S V is not equal to S W for any proper subvariety W V. Therefore, to find the lattice (L(S V ), ), Theorems 5.9, 5.11 and 5.12 lead us to the procedure described on Figure 3. By Theorems 5.11 and 5.12, the algebra ( Con W,, ), with W O V α W 1 β W 2 := δ α W 1 β W 2 Con W1 W 2,
18 18 A. PILITOWSKA 1 AND A. ZAMOJSKA-DZIENIO 2 Take a subvariety V Create the set Con V Con V = Con V There is a subvariety W V such that S W = S V S V is the main knot in the lattice (L(S ), ) Create the set O V Choose subvarieties W 1, W 2 O V Take α W 1 Con W1 and β W 2 Con W2 ; Calculate the congruences: α W 1, β W 2, α W 1 β W 2, α W 1 β W 2, δ α W 1 β W 2, δ α W 1 β W 2 Calculate the set W O V Con W Figure 3. Algorithm of finding the lattice L(S V ) and α W1 β W2 := δ α W 1 β W 2 Con U, where U = HSP((P >0 <ω(f V(X)/ α W 1 β W 2 ), Ω, )), is a lattice dually isomorphic to the complete lattice (L(S V ), ) of all subvarieties of the variety S V. Example 6.1. Let be the variety of all binary algebras (A, ) and LZ be the subvariety of left-zero semigroups. It is known that LZ-free algebra (F LZ (X), ) on a set X is isomorphic to the left-zero groupoid (X, ). It is also easy to notice (P <ω >0 X, ) LZ.
19 THE LATTICE OF SUBVARIETIES OF SEMILATTICE ORDERED ALGEBRAS 19 By Corollary 3.3, for any V, the semilattice ordered algebra (P >0 <ωf V(X),, ) is free over a set X in the variety S V if and only if (P >0 <ωf V(X),, ) S V. Then the algebra (P >0 <ωx,, ) is free in the variety S LZ of all semilattice ordered LZalgebras. Moreover, the algebra (P >0 <ω X,, ) is generated by the set {{x} x X}. Let Q = {q 1,..., q k } X and α be an endomorphism of (P >0 <ω X,, ). Because each homomorphism is uniquely defined on generators of an algebra, α(q) = α({q 1 })... α({q k }) might be any finite subset of X. This implies Con LZ = {id P <ω >0 X } and shows there are only two subvarieties of the variety S LZ : S LZ itself and trivial one. Example 6.2. Let be the variety of all binary algebras (A, ), SG be the variety of all semigroups and SL denote the variety of all semilattices. By results of G. Grätzer and H. Lakser ([6, Prop. 1]), the algebra (P >0 <ωf SL(X), ) is a commutative semigroup, but it is not idempotent. Hence, the algebra (P >0 <ωf SL(X), ) does not belong to the variety S SL, and consequently by Corollary 3.3, it is not free in S SL. Let us consider the so-called S SL -replica congruence of (P >0 <ωf SL(X),, ): Φ SSL (X) := {ϕ Con(P <ω >0 F SL(X),, ) (P <ω >0 F SL(X)/ϕ,, ) S SL }. The algebra (P <ω >0 F SL(X)/Φ SSL (X),, ) is called the S SL -replica of (P <ω >0 F SL(X),, ). Obviously, each semilattice is a mode, then by results of [12], the S SL -replica of the algebra (P <ω >0 F SL(X),, ) is free over a set X in the variety S SL. The free semilattice (F SL (X), ) over a set X is isomorphic to the algebra (P >0 <ω We proved in [13] that S SL -replica congruence of (P <ω X),, ) is defined in the following way: for Q, R P <ω >0 (P<ω >0 X) >0 (P<ω >0 Q Φ SSL (X) R Q = R, where S denotes the subalgebra of (P >0 <ω X, ) generated by S. This shows the free algebra over a set X in the variety S SL is isomorphic to the algebra (S(P >0 <ω X), +) of all non empty, finitely generated subalgebras of the algebra (P >0 <ωx, ), with S 1 + S 2 := S 1 S 2. By results of M. Kuřil and L. Polák ([9]), there are three more non-trivial fully invariant congruences of (P >0 <ω(p<ω >0 X),, ) greater than Φ S SL (X), which belong to the set Con SL. They can be described as follows: for Q = {q 1,..., q k }, R = {r 1,..., r m } P >0 <ω(p<ω >0 X) Q Φ 1 R X, ). (q Q) (r R) r q r 1... r m and (r R) (q Q) q r q 1... q k, Q Φ 2 R (q Q) q r 1... r m and (r R) r q 1... q k, Q Φ 3 R (q Q) (r R) r q and (r R) (q Q) q r. This confirmed previous results of R. McKenzie and A. Romanowska (see [10]) that there are exactly five subvarieties of the variety S SL. References [1] Bloom S. L., Varieties of ordered algebras, Journal of Computer and System Sciences 13, (1976),
20 20 A. PILITOWSKA 1 AND A. ZAMOJSKA-DZIENIO 2 [2] Brink C., Power structures, Algebra Univers. 30(2), (1993), [3] Czédli G., Lenkehegyi A., On classes of ordered algebras and quasiorder distributivity, Acta Sci. Math. 46, (1983), [4] Fuchs L., On partially ordered algebras I, Colloquium Mathematicum 14, (1966), [5] Ghosh S., Pastijn F., Zhao X. Z., Varieties generated by ordered bands I, Order 22, (2005), [6] Grätzer G., Lakser H., Identities for globals (complex algebras) of algebras, Colloq. Math. 56, (1988), [7] Jónsson B., Tarski A., Boolean algebras with operators I, Am. J. Math. 73, (1951), [8] Kearnes K., Semilattice modes I: the associated semiring, Algebra Univers. 34, (1995), [9] Kuřil M., Polák L., On varieties of semilattice-ordered semigroups, Semigroup Forum 71, (2005), [10] McKenzie R., Romanowska A., Varieties of - distributive bisemilattices, Contributions to General Algebra (Proceedings of the Klagenfurt Conference, May 25-28, 1978) 1, (1979), [11] Pastijn F., Zhao X. Z., Varieties of idempotent semirings with commutative addition, Algebra Univers. 54, (2005), [12] Pilitowska A., Zamojska-Dzienio A., Representation of modals, Demonstr. Math. 44(3), (2011), [13] Pilitowska A., Zamojska-Dzienio A., On some congruences of power algebras, Cent. Eur. J. Math. 10(3), (2012), [14] Romanowska A. B., Roszkowska B., On some groupoid modes, Demonstr. Math. 20(1-2), (1987), [15] Romanowska A. B., Smith J. D. H., Modal Theory, Heldermann Verlag, Berlin, [16] Romanowska A. B., Smith J. D. H., Modes, World Scientific, Singapore, [17] Ślusarska K., Distributive differential modals, Discuss. Math. General Algebra and Applications 28, (2008), [18] Zhao X. Z., Idempotent semirings with a commutative additive reducts, Semigroup Forum 64, (2002), Faculty of Mathematics and Information Science, Warsaw University of Technology, Warsaw, Poland address: 1 apili@mini.pw.edu.pl address: 2 A.Zamojska-Dzienio@mini.pw.edu.pl URL: 1 ~apili URL: 2 ~azamojsk
The Lattice of Subvarieties of Semilattice Ordered Algebras
Order (2014) 31:217 238 DOI 10.1007/s11083-013-9297-1 The Lattice of Subvarieties of Semilattice Ordered Algebras A. Pilitowska A. Zamojska-Dzienio Received: 27 September 2012 / Accepted: 30 May 2013 /
More informationON SOME CONGRUENCES OF POWER ALGEBRAS
ON SOME CONGRUENCES OF POWER ALGEBRAS A. PILITOWSKA 1 AND A. ZAMOJSKA-DZIENIO 2 Abstract. In a natural way we can lift any operation defined on a set A to an operation on the set of all non-empty subsets
More informationVarieties generated by modes of submodes
Algebra Univers. 68 (2012) 221 236 DOI 10.1007/s00012-012-0201-4 Published online October 17, 2012 2012 The Author(s) Algebra Universalis This article is published with open access at Springerlink.com
More informationThe variety of commutative additively and multiplicatively idempotent semirings
Semigroup Forum (2018) 96:409 415 https://doi.org/10.1007/s00233-017-9905-2 RESEARCH ARTICLE The variety of commutative additively and multiplicatively idempotent semirings Ivan Chajda 1 Helmut Länger
More informationUniversal Algebra for Logics
Universal Algebra for Logics Joanna GRYGIEL University of Czestochowa Poland j.grygiel@ajd.czest.pl 2005 These notes form Lecture Notes of a short course which I will give at 1st School on Universal Logic
More informationSemilattice Modes II: the amalgamation property
Semilattice Modes II: the amalgamation property Keith A. Kearnes Abstract Let V be a variety of semilattice modes with associated semiring R. We prove that if R is a bounded distributive lattice, then
More informationERRATA: MODES, ROMANOWSKA & SMITH
ERRATA: MODES, ROMANOWSKA & SMITH Line 38 + 4: There is a function f : X Ω P(X) with xf = {x} for x in X and ωf = for ω in Ω. By the universality property (1.4.1) for (X Ω), the mapping f can be uniquely
More informationEQUATIONS OF TOURNAMENTS ARE NOT FINITELY BASED
EQUATIONS OF TOURNAMENTS ARE NOT FINITELY BASED J. Ježek, P. Marković, M. Maróti and R. McKenzie Abstract. The aim of this paper is to prove that there is no finite basis for the equations satisfied by
More information10. Finite Lattices and their Congruence Lattices. If memories are all I sing I d rather drive a truck. Ricky Nelson
10. Finite Lattices and their Congruence Lattices If memories are all I sing I d rather drive a truck. Ricky Nelson In this chapter we want to study the structure of finite lattices, and how it is reflected
More informationJónsson posets and unary Jónsson algebras
Jónsson posets and unary Jónsson algebras Keith A. Kearnes and Greg Oman Abstract. We show that if P is an infinite poset whose proper order ideals have cardinality strictly less than P, and κ is a cardinal
More informationSUBLATTICES OF LATTICES OF ORDER-CONVEX SETS, III. THE CASE OF TOTALLY ORDERED SETS
SUBLATTICES OF LATTICES OF ORDER-CONVEX SETS, III. THE CASE OF TOTALLY ORDERED SETS MARINA SEMENOVA AND FRIEDRICH WEHRUNG Abstract. For a partially ordered set P, let Co(P) denote the lattice of all order-convex
More informationSimultaneous congruence representations: a special case
Algebra univers. 54 (2005) 249 255 0002-5240/05/020249 07 DOI 10.1007/s00012-005-1931-3 c Birkhäuser Verlag, Basel, 2005 Algebra Universalis Mailbox Simultaneous congruence representations: a special case
More informationAlgebraic closure of some generalized convex sets
Algebraic closure of some generalized convex sets Anna B. ROMANOWSKA* Warsaw University of Technology, Poland Gábor CZÉDLI University of Szeged, Hungary 1 AFFINE SPACES AND CONVEX SETS 1. Real affine spaces
More informationOn the Structure of Rough Approximations
On the Structure of Rough Approximations (Extended Abstract) Jouni Järvinen Turku Centre for Computer Science (TUCS) Lemminkäisenkatu 14 A, FIN-20520 Turku, Finland jjarvine@cs.utu.fi Abstract. We study
More informationA note on congruence lattices of slim semimodular
A note on congruence lattices of slim semimodular lattices Gábor Czédli Abstract. Recently, G. Grätzer has raised an interesting problem: Which distributive lattices are congruence lattices of slim semimodular
More informationSUPERPRODUCTS, HYPERIDENTITIES, AND ALGEBRAIC STRUCTURES OF LOGIC PROGRAMMING
SUPERPRODUCTS, HYPERIDENTITIES, AND ALGEBRAIC STRUCTURES OF LOGIC PROGRAMMING YU.M.MOVSISYAN 1, A.B.ROMANOWSKA 2, AND J.D.H.SMITH 3 Abstract. Recent developments in logic programming are based on bilattices
More informationSubdirectly Irreducible Modes
Subdirectly Irreducible Modes Keith A. Kearnes Abstract We prove that subdirectly irreducible modes come in three very different types. From the description of the three types we derive the results that
More informationCONGRUENCES OF STRONGLY MORITA EQUIVALENT POSEMIGROUPS. 1. Introduction
Acta Math. Univ. Comenianae Vol. LXXXI, 2 (2012), pp. 247 254 247 CONGRUENCES OF STRONGLY MORITA EQUIVALENT POSEMIGROUPS T. TÄRGLA and V. LAAN Abstract. We prove that congruence lattices of strongly Morita
More informationEquational Logic. Chapter Syntax Terms and Term Algebras
Chapter 2 Equational Logic 2.1 Syntax 2.1.1 Terms and Term Algebras The natural logic of algebra is equational logic, whose propositions are universally quantified identities between terms built up from
More informationNOTES ON PLANAR SEMIMODULAR LATTICES. IV. THE SIZE OF A MINIMAL CONGRUENCE LATTICE REPRESENTATION WITH RECTANGULAR LATTICES
NOTES ON PLANAR SEMIMODULAR LATTICES. IV. THE SIZE OF A MINIMAL CONGRUENCE LATTICE REPRESENTATION WITH RECTANGULAR LATTICES G. GRÄTZER AND E. KNAPP Abstract. Let D be a finite distributive lattice with
More informationCONGRUENCES OF STRONGLY MORITA EQUIVALENT POSEMIGROUPS. 1. Introduction
CONGRUENCES OF STRONGLY MORITA EQUIVALENT POSEMIGROUPS T. TÄRGLA and V. LAAN Abstract. We prove that congruence lattices of strongly Morita equivalent posemigroups with common joint weak local units are
More informationA CHARACTERIZATION OF LOCALLY FINITE VARIETIES THAT SATISFY A NONTRIVIAL CONGRUENCE IDENTITY
A CHARACTERIZATION OF LOCALLY FINITE VARIETIES THAT SATISFY A NONTRIVIAL CONGRUENCE IDENTITY KEITH A. KEARNES Abstract. We show that a locally finite variety satisfies a nontrivial congruence identity
More informationBoolean Semilattices
Boolean Semilattices Clifford Bergman Iowa State University June 2015 Motivating Construction Let G = G, be a groupoid (i.e., 1 binary operation) Form the complex algebra G + = Sb(G),,,,,, G X Y = { x
More informationANNIHILATOR IDEALS IN ALMOST SEMILATTICE
BULLETIN OF THE INTERNATIONAL MATHEMATICAL VIRTUAL INSTITUTE ISSN (p) 2303-4874, ISSN (o) 2303-4955 www.imvibl.org /JOURNALS / BULLETIN Vol. 7(2017), 339-352 DOI: 10.7251/BIMVI1702339R Former BULLETIN
More informationHomework Problems Some Even with Solutions
Homework Problems Some Even with Solutions Problem 0 Let A be a nonempty set and let Q be a finitary operation on A. Prove that the rank of Q is unique. To say that n is the rank of Q is to assert that
More informationNOTES ON PLANAR SEMIMODULAR LATTICES. IV. THE SIZE OF A MINIMAL CONGRUENCE LATTICE REPRESENTATION WITH RECTANGULAR LATTICES
NOTES ON PLANAR SEMIMODULAR LATTICES. IV. THE SIZE OF A MINIMAL CONGRUENCE LATTICE REPRESENTATION WITH RECTANGULAR LATTICES G. GRÄTZER AND E. KNAPP Abstract. Let D be a finite distributive lattice with
More informationTopology Proceedings. COPYRIGHT c by Topology Proceedings. All rights reserved.
Topology Proceedings Web: http://topology.auburn.edu/tp/ Mail: Topology Proceedings Department of Mathematics & Statistics Auburn University, Alabama 36849, USA E-mail: topolog@auburn.edu ISSN: 0146-4124
More informationFinite Simple Abelian Algebras are Strictly Simple
Finite Simple Abelian Algebras are Strictly Simple Matthew A. Valeriote Abstract A finite universal algebra is called strictly simple if it is simple and has no nontrivial subalgebras. An algebra is said
More informationON VARIETIES OF LEFT DISTRIBUTIVE LEFT IDEMPOTENT GROUPOIDS
ON VARIETIES OF LEFT DISTRIBUTIVE LEFT IDEMPOTENT GROUPOIDS DAVID STANOVSKÝ Abstract. We describe a part of the lattice of subvarieties of left distributive left idempotent groupoids (i.e. those satisfying
More informationMath 588, Fall 2001 Problem Set 1 Due Sept. 18, 2001
Math 588, Fall 2001 Problem Set 1 Due Sept. 18, 2001 1. [Burris-Sanka. 1.1.9] Let A, be a be a finite poset. Show that there is a total (i.e., linear) order on A such that, i.e., a b implies a b. Hint:
More informationDISTRIBUTIVE, STANDARD AND NEUTRAL ELEMENTS IN TRELLISES. 1. Introduction
Acta Math. Univ. Comenianae Vol. LXXVII, 2 (2008), pp. 167 174 167 DISTRIBUTIVE, STANDARD AND NEUTRAL ELEMENTS IN TRELLISES SHASHIREKHA B. RAI Abstract. In this paper, the concepts of distributive, standard
More informationFuzzy M-solid subvarieties
International Journal of Algebra, Vol. 5, 2011, no. 24, 1195-1205 Fuzzy M-Solid Subvarieties Bundit Pibaljommee Department of Mathematics, Faculty of Science Khon kaen University, Khon kaen 40002, Thailand
More informationMAXIMAL ORDERS IN COMPLETELY 0-SIMPLE SEMIGROUPS
MAXIMAL ORDERS IN COMPLETELY 0-SIMPLE SEMIGROUPS John Fountain and Victoria Gould Department of Mathematics University of York Heslington York YO1 5DD, UK e-mail: jbf1@york.ac.uk varg1@york.ac.uk Abstract
More informationFREE SYSTEMS OF ALGEBRAS AND ULTRACLOSED CLASSES
Acta Math. Univ. Comenianae Vol. LXXV, 1(2006), pp. 127 136 127 FREE SYSTEMS OF ALGEBRAS AND ULTRACLOSED CLASSES R. THRON and J. KOPPITZ Abstract. There is considered the concept of the so-called free
More informationNOTES ON CONGRUENCE n-permutability AND SEMIDISTRIBUTIVITY
NOTES ON CONGRUENCE n-permutability AND SEMIDISTRIBUTIVITY RALPH FREESE Abstract. In [1] T. Dent, K. Kearnes and Á. Szendrei define the derivative, Σ, of a set of equations Σ and show, for idempotent Σ,
More informationTHE ENDOMORPHISM SEMIRING OF A SEMILATTICE
THE ENDOMORPHISM SEMIRING OF A SEMILATTICE J. JEŽEK, T. KEPKA AND M. MARÓTI Abstract. We prove that the endomorphism semiring of a nontrivial semilattice is always subdirectly irreducible and describe
More informationON HOW TO CONSTRUCT LEFT SEMIMODULES FROM THE RIGHT ONES
italian journal of pure and applied mathematics n. 32 2014 (561 578) 561 ON HOW TO CONSTRUCT LEFT SEMIMODULES FROM THE RIGHT ONES Barbora Batíková Department of Mathematics CULS Kamýcká 129, 165 21 Praha
More informationSubdirectly irreducible commutative idempotent semirings
Subdirectly irreducible commutative idempotent semirings Ivan Chajda Helmut Länger Palacký University Olomouc, Olomouc, Czech Republic, email: ivan.chajda@upol.cz Vienna University of Technology, Vienna,
More informationOn the variety generated by planar modular lattices
On the variety generated by planar modular lattices G. Grätzer and R. W. Quackenbush Abstract. We investigate the variety generated by the class of planar modular lattices. The main result is a structure
More informationChristopher J. TAYLOR
REPORTS ON MATHEMATICAL LOGIC 51 (2016), 3 14 doi:10.4467/20842589rm.16.001.5278 Christopher J. TAYLOR DISCRIMINATOR VARIETIES OF DOUBLE-HEYTING ALGEBRAS A b s t r a c t. We prove that a variety of double-heyting
More informationSets and Motivation for Boolean algebra
SET THEORY Basic concepts Notations Subset Algebra of sets The power set Ordered pairs and Cartesian product Relations on sets Types of relations and their properties Relational matrix and the graph of
More informationARCHIVUM MATHEMATICUM (BRNO) Tomus 48 (2012), M. Sambasiva Rao
ARCHIVUM MATHEMATICUM (BRNO) Tomus 48 (2012), 97 105 δ-ideals IN PSEUDO-COMPLEMENTED DISTRIBUTIVE LATTICES M. Sambasiva Rao Abstract. The concept of δ-ideals is introduced in a pseudo-complemented distributive
More informationHouston Journal of Mathematics. c 2016 University of Houston Volume 42, No. 1, 2016
Houston Journal of Mathematics c 2016 University of Houston Volume 42, No. 1, 2016 DIRECTIONAL ALGEBRAS J.D.H. SMITH Communicated by Mai Gehrke Abstract. Directional algebras are generalizations of dimonoids,
More informationA GUIDE FOR MORTALS TO TAME CONGRUENCE THEORY
A GUIDE FOR MORTALS TO TAME CONGRUENCE THEORY Tame congruence theory is not an easy subject and it takes a considerable amount of effort to understand it. When I started this project, I believed that this
More informationCONGRUENCE PROPERTIES IN SINGLE ALGEBRAS. Ivan Chajda
CONGRUENCE PROPERTIES IN SINGLE ALGEBRAS Radim Bělohlávek Department of Computer Science Technical University of Ostrava tř. 17. listopadu 708 33 Ostrava-Poruba Czech Republic e-mail: radim.belohlavek@vsb.cz
More informationAutomorphisms of the endomorphism semigroup of a free abelian diband
Algebra and Discrete Mathematics Volume 25 (208). Number 2, pp. 322 332 c Journal Algebra and Discrete Mathematics RESEARCH ARTICLE Automorphisms of the endomorphism semigroup of a free abelian diband
More informationMV-algebras and fuzzy topologies: Stone duality extended
MV-algebras and fuzzy topologies: Stone duality extended Dipartimento di Matematica Università di Salerno, Italy Algebra and Coalgebra meet Proof Theory Universität Bern April 27 29, 2011 Outline 1 MV-algebras
More informationCongruence Coherent Symmetric Extended de Morgan Algebras
T.S. Blyth Jie Fang Congruence Coherent Symmetric Extended de Morgan Algebras Abstract. An algebra A is said to be congruence coherent if every subalgebra of A that contains a class of some congruence
More informationA Discrete Duality Between Nonmonotonic Consequence Relations and Convex Geometries
A Discrete Duality Between Nonmonotonic Consequence Relations and Convex Geometries Johannes Marti and Riccardo Pinosio Draft from April 5, 2018 Abstract In this paper we present a duality between nonmonotonic
More informationSyntax. Notation Throughout, and when not otherwise said, we assume a vocabulary V = C F P.
First-Order Logic Syntax The alphabet of a first-order language is organised into the following categories. Logical connectives:,,,,, and. Auxiliary symbols:.,,, ( and ). Variables: we assume a countable
More informationPartially ordered monads and powerset Kleene algebras
Partially ordered monads and powerset Kleene algebras Patrik Eklund 1 and Werner Gähler 2 1 Umeå University, Department of Computing Science, SE-90187 Umeå, Sweden peklund@cs.umu.se 2 Scheibenbergstr.
More informationA NOTE ON MULTIPLIERS OF SUBTRACTION ALGEBRAS
Hacettepe Journal of Mathematics and Statistics Volume 42 (2) (2013), 165 171 A NOTE ON MULTIPLIERS OF SUBTRACTION ALGEBRAS Sang Deok Lee and Kyung Ho Kim Received 30 : 01 : 2012 : Accepted 20 : 03 : 2012
More informationCongruence Boolean Lifting Property
Congruence Boolean Lifting Property George GEORGESCU and Claudia MUREŞAN University of Bucharest Faculty of Mathematics and Computer Science Academiei 14, RO 010014, Bucharest, Romania Emails: georgescu.capreni@yahoo.com;
More informationClosure operators on sets and algebraic lattices
Closure operators on sets and algebraic lattices Sergiu Rudeanu University of Bucharest Romania Closure operators are abundant in mathematics; here are a few examples. Given an algebraic structure, such
More informationLOGICS OF VARIETIES, LOGICS OF SEMILATTICES, AND CONJUNCTION
LOGICS OF VARIETIES, LOGICS OF SEMILATTICES, AND CONJUNCTION JOSEP MARIA FONT AND TOMMASO MORASCHINI Abstract. This paper starts with a general analysis of the problem of how to associate a logic with
More informationUNIVERSALITY OF THE LATTICE OF TRANSFORMATION MONOIDS
UNIVERSALITY OF THE LATTICE OF TRANSFORMATION MONOIDS MICHAEL PINSKER AND SAHARON SHELAH Abstract. The set of all transformation monoids on a fixed set of infinite cardinality λ, equipped with the order
More informationIntroduction to generalized topological spaces
@ Applied General Topology c Universidad Politécnica de Valencia Volume 12, no. 1, 2011 pp. 49-66 Introduction to generalized topological spaces Irina Zvina Abstract We introduce the notion of generalized
More informationFREE STEINER LOOPS. Smile Markovski, Ana Sokolova Faculty of Sciences and Mathematics, Republic of Macedonia
GLASNIK MATEMATIČKI Vol. 36(56)(2001), 85 93 FREE STEINER LOOPS Smile Markovski, Ana Sokolova Faculty of Sciences and Mathematics, Republic of Macedonia Abstract. A Steiner loop, or a sloop, is a groupoid
More informationPeriodic lattice-ordered pregroups are distributive
Periodic lattice-ordered pregroups are distributive Nikolaos Galatos and Peter Jipsen Abstract It is proved that any lattice-ordered pregroup that satisfies an identity of the form x lll = x rrr (for the
More informationarxiv: v1 [math.ra] 25 May 2013
Quasigroups and Related Systems 20 (2012), 203 209 Congruences on completely inverse AG -groupoids Wieslaw A. Dudek and Roman S. Gigoń arxiv:1305.6858v1 [math.ra] 25 May 2013 Abstract. By a completely
More informationA CLOSURE SYSTEM FOR ELEMENTARY SITUATIONS
Bulletin of the Section of Logic Volume 11:3/4 (1982), pp. 134 138 reedition 2009 [original edition, pp. 134 139] Bogus law Wolniewicz A CLOSURE SYSTEM FOR ELEMENTARY SITUATIONS 1. Preliminaries In [4]
More informationFinite pseudocomplemented lattices: The spectra and the Glivenko congruence
Finite pseudocomplemented lattices: The spectra and the Glivenko congruence T. Katriňák and J. Guričan Abstract. Recently, Grätzer, Gunderson and Quackenbush have characterized the spectra of finite pseudocomplemented
More informationProperties of Boolean Algebras
Phillip James Swansea University December 15, 2008 Plan For Today Boolean Algebras and Order..... Brief Re-cap Order A Boolean algebra is a set A together with the distinguished elements 0 and 1, the binary
More informationAn Overview of Residuated Kleene Algebras and Lattices Peter Jipsen Chapman University, California. 2. Background: Semirings and Kleene algebras
An Overview of Residuated Kleene Algebras and Lattices Peter Jipsen Chapman University, California 1. Residuated Lattices with iteration 2. Background: Semirings and Kleene algebras 3. A Gentzen system
More informationWhen does a semiring become a residuated lattice?
When does a semiring become a residuated lattice? Ivan Chajda and Helmut Länger arxiv:1809.07646v1 [math.ra] 20 Sep 2018 Abstract It is an easy observation that every residuated lattice is in fact a semiring
More informationSYNTACTIC SEMIGROUP PROBLEM FOR THE SEMIGROUP REDUCTS OF AFFINE NEAR-SEMIRINGS OVER BRANDT SEMIGROUPS
SYNTACTIC SEMIGROUP PROBLEM FOR THE SEMIGROUP REDUCTS OF AFFINE NEAR-SEMIRINGS OVER BRANDT SEMIGROUPS JITENDER KUMAR AND K. V. KRISHNA Abstract. The syntactic semigroup problem is to decide whether a given
More informationA STUDY OF TRUTH PREDICATES IN MATRIX SEMANTICS
A STUDY OF TRUTH PREDICATES IN MATRIX SEMANTICS TOMMASO MORASCHINI Abstract. Abstract algebraic logic is a theory that provides general tools for the algebraic study of arbitrary propositional logics.
More informationAxioms of Kleene Algebra
Introduction to Kleene Algebra Lecture 2 CS786 Spring 2004 January 28, 2004 Axioms of Kleene Algebra In this lecture we give the formal definition of a Kleene algebra and derive some basic consequences.
More informationIDEMPOTENT n-permutable VARIETIES
IDEMPOTENT n-permutable VARIETIES M. VALERIOTE AND R. WILLARD Abstract. One of the important classes of varieties identified in tame congruence theory is the class of varieties which are n-permutable for
More informationNotes on Ordered Sets
Notes on Ordered Sets Mariusz Wodzicki September 10, 2013 1 Vocabulary 1.1 Definitions Definition 1.1 A binary relation on a set S is said to be a partial order if it is reflexive, x x, weakly antisymmetric,
More informationTROPICAL SCHEME THEORY
TROPICAL SCHEME THEORY 5. Commutative algebra over idempotent semirings II Quotients of semirings When we work with rings, a quotient object is specified by an ideal. When dealing with semirings (and lattices),
More informationA GENERAL THEORY OF ZERO-DIVISOR GRAPHS OVER A COMMUTATIVE RING. David F. Anderson and Elizabeth F. Lewis
International Electronic Journal of Algebra Volume 20 (2016) 111-135 A GENERAL HEORY OF ZERO-DIVISOR GRAPHS OVER A COMMUAIVE RING David F. Anderson and Elizabeth F. Lewis Received: 28 April 2016 Communicated
More informationJOIN-COMPLETIONS OF ORDERED ALGEBRAS
JOIN-COMPLETIONS OF ORDERED ALGEBRAS JOSÉ GIL-FÉREZ, LUCA SPADA, CONSTANTINE TSINAKIS, AND HONGJUN ZHOU Abstract. We present a systematic study of join-extensions and joincompletions of ordered algebras,
More informationTriregular Leftmost without Loop and Reverse Arc Graph Varieties of Graph Algebra of Type (2,0)
International Mathematical Forum, 5, 2010, no. 12, 557-571 Triregular Leftmost without Loop and Reverse Arc Graph Varieties of Graph Algebra of Type (2,0) Montri Thongmoon and Tiang Poomsa-ard Department
More informationTutorial on the Constraint Satisfaction Problem
Tutorial on the Constraint Satisfaction Problem Miklós Maróti Vanderbilt University and University of Szeged Nový Smokovec, 2012. September 2 7. Miklós Maróti (Vanderbilt and Szeged) The Constraint Satisfaction
More informationAdjunctions! Everywhere!
Adjunctions! Everywhere! Carnegie Mellon University Thursday 19 th September 2013 Clive Newstead Abstract What do free groups, existential quantifiers and Stone-Čech compactifications all have in common?
More informationPrimitive Ideals of Semigroup Graded Rings
Sacred Heart University DigitalCommons@SHU Mathematics Faculty Publications Mathematics Department 2004 Primitive Ideals of Semigroup Graded Rings Hema Gopalakrishnan Sacred Heart University, gopalakrishnanh@sacredheart.edu
More informationVARIETIES OF POSITIVE MODAL ALGEBRAS AND STRUCTURAL COMPLETENESS
VARIETIES OF POSITIVE MODAL ALGEBRAS AND STRUCTURAL COMPLETENESS TOMMASO MORASCHINI Abstract. Positive modal algebras are the,,,, 0, 1 -subreducts of modal algebras. We show that the variety of positive
More informationClass Notes on Poset Theory Johan G. Belinfante Revised 1995 May 21
Class Notes on Poset Theory Johan G Belinfante Revised 1995 May 21 Introduction These notes were originally prepared in July 1972 as a handout for a class in modern algebra taught at the Carnegie-Mellon
More informationPolynomial closure and unambiguous product
Polynomial closure and unambiguous product Jean-Eric Pin and Pascal Weil pin@litp.ibp.fr, weil@litp.ibp.fr 1 Introduction This paper is a contribution to the algebraic theory of recognizable languages,
More informationAn Introduction to the Theory of Lattice
An Introduction to the Theory of Lattice Jinfang Wang Λy Graduate School of Science and Technology, Chiba University 1-33 Yayoi-cho, Inage-ku, Chiba 263-8522, Japan May 11, 2006 Λ Fax: 81-43-290-3663.
More informationLinear identities in graph algebras
Comment.Math.Univ.Carolin. 50,1(2009)11 24 11 Linear identities in graph algebras Agata Pilitowska Abstract. Wefindthebasisofalllinearidentitieswhicharetrueinthevarietyofentropic graph algebras. We apply
More informationarxiv:math/ v1 [math.ra] 27 Oct 2006
ON COMPLEX ALGEBRAS OF SUBALGEBRAS arxiv:math/0610832v1 [math.ra] 27 Oct 2006 KIRA ADARICHEVA, AGATA PILITOWSKA, AND DAVID STANOVSKÝ Abstract. Let V be a variety of algebras. We establish a condition (so
More informationOn the lattice of congruences on a fruitful semigroup
On the lattice of congruences on a fruitful semigroup Department of Mathematics University of Bielsko-Biala POLAND email: rgigon@ath.bielsko.pl or romekgigon@tlen.pl The 54th Summer School on General Algebra
More informationCommon idempotents in compact left topological left semirings
arxiv:1002.1599v1 [math.gn] 8 Feb 2010 Common idempotents in compact left topological left semirings Denis I. Saveliev 24 January 2010, Muscat ICAA A classical result of topological algebra states that
More informationON THE SUBGROUPS OF TORSION-FREE GROUPS WHICH ARE SUBRINGS IN EVERY RING
italian journal of pure and applied mathematics n. 31 2013 (63 76) 63 ON THE SUBGROUPS OF TORSION-FREE GROUPS WHICH ARE SUBRINGS IN EVERY RING A.M. Aghdam Department Of Mathematics University of Tabriz
More informationCross Connection of Boolean Lattice
International Journal of Algebra, Vol. 11, 2017, no. 4, 171-179 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ija.2017.7419 Cross Connection of Boolean Lattice P. G. Romeo P. R. Sreejamol Dept.
More informationGiven a lattice L we will note the set of atoms of L by At (L), and with CoAt (L) the set of co-atoms of L.
ACTAS DEL VIII CONGRESO DR. ANTONIO A. R. MONTEIRO (2005), Páginas 25 32 SOME REMARKS ON OCKHAM CONGRUENCES LEONARDO CABRER AND SERGIO CELANI ABSTRACT. In this work we shall describe the lattice of congruences
More information1 Differentiable manifolds and smooth maps
1 Differentiable manifolds and smooth maps Last updated: April 14, 2011. 1.1 Examples and definitions Roughly, manifolds are sets where one can introduce coordinates. An n-dimensional manifold is a set
More informationREGULAR IDENTITIES IN LATTICES
TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 158, Number 1, July 1971 REGULAR IDENTITIES IN LATTICES BY R. PADMANABHANC) Abstract. An algebraic system 3i = is called a quasilattice
More informationSkew Boolean algebras
Skew Boolean algebras Ganna Kudryavtseva University of Ljubljana Faculty of Civil and Geodetic Engineering IMFM, Ljubljana IJS, Ljubljana New directions in inverse semigroups Ottawa, June 2016 Plan of
More informationSTRICTLY ORDER PRIMAL ALGEBRAS
Acta Math. Univ. Comenianae Vol. LXIII, 2(1994), pp. 275 284 275 STRICTLY ORDER PRIMAL ALGEBRAS O. LÜDERS and D. SCHWEIGERT Partial orders and the clones of functions preserving them have been thoroughly
More informationLattices, closure operators, and Galois connections.
125 Chapter 5. Lattices, closure operators, and Galois connections. 5.1. Semilattices and lattices. Many of the partially ordered sets P we have seen have a further valuable property: that for any two
More informationBoolean Algebras. Chapter 2
Chapter 2 Boolean Algebras Let X be an arbitrary set and let P(X) be the class of all subsets of X (the power set of X). Three natural set-theoretic operations on P(X) are the binary operations of union
More informationIntroduction to Kleene Algebras
Introduction to Kleene Algebras Riccardo Pucella Basic Notions Seminar December 1, 2005 Introduction to Kleene Algebras p.1 Idempotent Semirings An idempotent semiring is a structure S = (S, +,, 1, 0)
More informationJoseph Muscat Universal Algebras. 1 March 2013
Joseph Muscat 2015 1 Universal Algebras 1 Operations joseph.muscat@um.edu.mt 1 March 2013 A universal algebra is a set X with some operations : X n X and relations 1 X m. For example, there may be specific
More informationCLASSIFYING THE COMPLEXITY OF CONSTRAINTS USING FINITE ALGEBRAS
CLASSIFYING THE COMPLEXITY OF CONSTRAINTS USING FINITE ALGEBRAS ANDREI BULATOV, PETER JEAVONS, AND ANDREI KROKHIN Abstract. Many natural combinatorial problems can be expressed as constraint satisfaction
More informationIDEMPOTENT ELEMENTS OF THE ENDOMORPHISM SEMIRING OF A FINITE CHAIN
Доклади на Българската академия на науките Comptes rendus de l Académie bulgare des Sciences Tome 66, No 5, 2013 MATHEMATIQUES Algèbre IDEMPOTENT ELEMENTS OF THE ENDOMORPHISM SEMIRING OF A FINITE CHAIN
More informationINTRODUCTION TO LIE ALGEBRAS. LECTURE 10.
INTRODUCTION TO LIE ALGEBRAS. LECTURE 10. 10. Jordan decomposition: theme with variations 10.1. Recall that f End(V ) is semisimple if f is diagonalizable (over the algebraic closure of the base field).
More informationDuality in Logic. Duality in Logic. Lecture 2. Mai Gehrke. Université Paris 7 and CNRS. {ε} A ((ab) (ba) ) (ab) + (ba) +
Lecture 2 Mai Gehrke Université Paris 7 and CNRS A {ε} A ((ab) (ba) ) (ab) + (ba) + Further examples - revisited 1. Completeness of modal logic with respect to Kripke semantics was obtained via duality
More information