- About this Journal ·
- Abstracting and Indexing ·
- Advance Access ·
- Aims and Scope ·
- Article Processing Charges ·
- Articles in Press ·
- Author Guidelines ·
- Bibliographic Information ·
- Citations to this Journal ·
- Contact Information ·
- Editorial Board ·
- Editorial Workflow ·
- Free eTOC Alerts ·
- Publication Ethics ·
- Reviewers Acknowledgment ·
- Submit a Manuscript ·
- Subscription Information ·
- Table of Contents

Journal of Mathematics

Volume 2013 (2013), Article ID 289854, 9 pages

http://dx.doi.org/10.1155/2013/289854

## The Monoid Consisting of Kuratowski Operations

Institute of Mathematics, University of Silesia, ul. Bankowa 14, 40-007 Katowice, Poland

Received 30 August 2012; Accepted 1 November 2012

Academic Editor: Nan-Jing Huang

Copyright © 2013 Szymon Plewik and Marta Walczyńska. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

#### Abstract

The paper fills gaps in knowledge about Kuratowski operations which are already in the literature. The Cayley table for these operations has been drawn up. Techniques, using only paper and pencil, to point out all semigroups and its isomorphism types are applied. Some results apply only to topology, and one cannot bring them out, using only properties of the complement and a closure-like operation. The arguments are by systematic study of possibilities.

#### 1. Introduction

Let be a topological space. Denote by closure of the set . Let be the complement of ; that is, . The aim of this paper is to examine monoids generated under compositions from the closure and the complement. A widely known fact due to Kuratowski [1] states that at most 14 distinct operations can be formed from such compositions. Mark them as follows. *Kuratowski operations*: (the identity), (the complement), (the closure), , , (the interior), , , , , , , , . The following rules was found in the original paper by Kuratowski [1, pages 183-184]. In the Engelking book [2], they are commented by a hint on page 81. *Cancellation rules*:

Kuratowski operations have been studied by several authors, for example, [3] or [4]. A list of some other authors one can find in the paper [5] by Gardner and Jackson. For the first time these operations were systematically studied in the dissertation by Kuratowski, whose results were published in [1]. Tasks relating to these operations are usually resolved at lectures or exercises with general topology. They are normally left to students for independent resolution. For example, determine how many different ways they convert a given set.

This note is organized as follows. Kuratowski operations and their marking are described in the introduction. Their properties of a much broader context than for topologies are presented in Section 2. The Cayley table, for the monoid of all Kuratowski operations, has been drawn up in Section 3. We hope that this table has not yet been published in the literature. Having this table, one can create a computer program that calculates all the semigroups contained in . However, in Sections 4–8, we present a framework (i.e., techniques using only paper and pencil) to point out all 118 semigroups and 56 isomorphism types of them. The list of 43 semigroups which are not monoids is presented in Section 9. In this section, also isomorphism types are discussed in order of the number of elements in semigroups. Finally, we present cancellation rules (relations) motivated by some topological spaces.

#### 2. Cancellation Rules

A map is called: (i)*increasing*, if implies ; (ii)*decreasing*, if implies ; (iii)*an involution*, if the composition is the identity; (iv)*an idempotent*, if . Assume that is the identity, is a decreasing involution, and is an increasing idempotent map. Other operations let be compositions of and as it was with the kuratowski operations. We get the following cancellation rules.

Lemma 1. *If , then
*

*Proof. *For clarity of this proof, use designations and . Thus, we shall prove
We start with , substituting in . This corresponds to , since is a decreasing involution. Hence , since an increasing idempotent.

Since is decreasing, is increasing, and , we have
Thus , if we put . Again using that is increasing and is decreasing, we obtain and then . Finally, we get .

With in the place of in the rule we get the second rule.

In academic textbooks of general topology, for example, [2, Problem 1.7.1.], one can find a hint suggested to prove the above cancellation rules. Students go like this: steps and lead to ; the special case (of ) leads to ; steps and lead to ; at the end, use the last step of the proof of Lemma 1. Note that, the above proofs do not use the axioms of topology as follows: (i); (ii). In the literature there are articles in which Kuratowski operations are replaced by some other mappings. For example, Koenen [6] considered linear spaces and put to be the convex hull of . In fact, Shum [7] considered as the closure due to the algebraic operations. Add to this, that these operations can be applied to so-called Fréchet (V) spaces, which were considered in the book [8, pages 3–37].

#### 3. The Monoid

Let be the monoid consisting of all Kuratowski operations; that is, there are assumed cancellation rules: and . Fill in the Cayley table for , where the row and column marked by the identity are omitted. Similarly as in [9], the factor that labels the row comes first, and that the factor that labels the column is second. For example, is in the row marked by and the column marked by

It turns out that the above table allows us to describe all semigroups contained in , using pencil-and-paper techniques, only. The argument will be by a systematic study of possibilities. Preparing the list of all semigroups consisting of Kuratowski operations we used following principles: minimal collection of generators is written using , where letters denote generators; when a semigroup has a few minimal collections of generators, then its name is the first collection in the dictionary order; all minimal collections of generators are written with the exception of some containing ; we leave to the readers verification that our list is complete, sometimes we add hints.

#### 4. Semigroups with

Observe that each semigroup which contains is a monoid. Since , a semigroup which contains is a monoid, too.

Theorem 2. *There are three monoids containing : **; **, where ; ** let . If , then
*

*Proof. *The equality is obvious.

Since , we have .

If , then any composition or belongs to , and so . We have , , , , , , and , and so .

Since and , we have for .

Consider the permutation It determines an automorphism .

Theorem 3. *The identity and are the only automorphisms of . *

*Proof. *Delete rows and columns marked by in the Cayley table for . Then, check that the operation is in the row or the column marked by only. Also, the operation is in the row or the column marked by only. Therefore the semigroup
has a unique minimal set of generators . The reader is left to check this with the Cayley table for .

Suppose is an automorphism of . By Theorem 2, transforms the set onto itself. However and are idempotents, but and are not idempotents. So, there are two possibilities: and , which implies that is the identity; and , which implies . The reader is left to check this with the Cayley table for . We offer hints: , , , , , , , , , and , to verify the details of this proof.

#### 5. The Monoid of All Idempotents

The set consists of all squares in . These squares are idempotents and lie on the main diagonal in the Cayley table for . They constitute a monoid and The permutation determines the bijection , such that for any . To verify this, apply equalities , , , and . Any bijection , having property , transposes Cayley tables for semigroups and . Several semigroups contained in have this property. We leave the reader to verify this.

We shall classify all semigroups contained in the semigroup . Every such semigroup can be extended to a monoid by attaching to it. This gives a complete classification of all semigroups in .

The semigroup contains six groups with exactly one element.

Semigroups and are monoids. Both consist of exactly two elements and are not groups, so they are isomorphic.

Semigroups and are isomorphic, in particular . Also, semigroups and are isomorphic by . Every of these four semigroups has exactly two elements. None of them is a monoid. They form two types of nonisomorphic semigroups, because the bijections and are not isomorphisms.

Semigroups and are isomorphic. Also, semigroups and are isomorphic. In fact, and . None of these semigroups is a monoid. They form two types of nonisomorphic semigroups. Indeed, any isomorphism between and must be the identity on the monoid . Therefore would have to be the restriction of . But restricted to is not an isomorphism.

Semigroups and are not monoids. They are isomorphic by .

The semigroup contains exactly one semigroup with four elements which is not a monoid.

Note that contains twenty different semigroups with nine non-isomorphism types. These are six isomorphic groups with exactly one element , two isomorphic monoids with exactly two elements , two pairs of isomorphic semigroups with exactly two elements and , two pairs of isomorphic semigroups with exactly three elements and , a semigroup with exactly four elements , and two isomorphic semigroups with exactly five elements and also . Thus, contains twenty different semigroups with nine isomorphism types. But contains forty-one different semigroups with seventeen isomorphism types. Indeed, adding to semigroups contained in , which are not monoids, we get twenty monoids with eight non-isomorphism types. Adding to a group contained in we get a monoid isomorphic to .

#### 6. The Semigroup Consisting of

Using the Cayley table for , check that Similarly, check that the semigroup can be represented as , , , , or . Also . These representations exhaust all minimal collections of the Kuratowski operations which generate . Other semigroups included in have one or two minimal collection of generators. One generator has groups , , , and . Each of them has exactly two elements, so they are isomorphic. Semigroups , , , , and are discussed in the previous section. Contained in and not previously discussed semigroups are , ,, and . We leave the reader to verify that the following are all possible pairs of Kuratowski operations which constitute a minimal collection of generators for semigroups contained in , but different from the whole. One has ; ; ; .

Proposition 4. *Semigroups and are isomorphic, and also semigroups and are isomorphic, but semigroups , are not isomorphic. *

*Proof. *Isomorphisms are defined by . Suppose is an isomorphism. Thus . Given , we get . But implies . Both possibilities lead to a contradiction.

So, contains eighteen different semigroups with eight non-isomorphism types. Indeed, these are four isomorphic groups with exactly one element , four isomorphic groups with exactly two elements , two pairs of isomorphic semigroups with exactly two elements and , and five semigroups with exactly four elements , , , and also .

#### 7. Remaining Semigroups in

We have yet to discuss semigroups included in , not included in and containing at least one of Kuratowski operation , , , or . It will be discussed up to the isomorphism . Obviously, and are groups.

##### 7.1. Extensions of and with Elements of

Monoids and have different numbers of elements. Also, is isomorphic to . Nonisomorphic semigroups and are discussed above. The following three semigroups: , , are not monoids. They are not isomorphic. Indeed, any isomorphism between these semigroups would lead an isomorphism between , , or . This is impossible, by Proposition 4 and because consists of idempotents, but is not an idempotent. The nine-element semigroup on the set is represented as . So, we have added four new semigroups, which are not isomorphic with the semigroups previously discussed. These are , , , and .

Using , we have described eight semigroups—each one isomorphic to a semigroup previously discussed—which contains and elements (at least one) of . Collections of generators: , , , , , and are minimal in . Also, collections of generators: , , , , , and are minimal in .

##### 7.2. Extensions of and by Elements from the Semigroup

Semigroups and are isomorphic by . They are not monoids. The semigroup can be extended using elements of , in three following ways:; ; .Semigroups and are not isomorphic. Indeed, suppose is an isomorphism. Thus, is the identity on , , and . This gives a contradiction, since and .

Neither nor has a minimal collection of generators with three elements, so they give new isomorphism types. Also, is not isomorphic to , since has a unique pair of generators and .

Using , we get—isomorphic to previously discussed ones—semigroups , , and . There exist minimal collections of generators, such as follows:

##### 7.3. More Generators from the Set

Now we check that and and also and are two pairs of isomorphic semigroups which give two new isomorphism types. Each of these semigroups has six element, so in there are five six-element semigroups of three isomorphism types, since has elements which are idempotents.

In there are seven semigroups which have three generators and have not two generators. These are ; ; ; ; ; ; .

#### 8. Semigroups which Are Contained in

Groups have one element and are isomorphic.

Groups , monoids , and also semigroups and have two elements and Cayley tables as follows:

Monoids , and also semigroups , , and have three elements and Cayley tables as follows:

Semigroups , , and have four elements and Cayley tables as follows:

Semigroups , , , , and have five elements. Semigroups , , and have six elements. Construction of Cayley tables for these semigroups, as well as other semigroups, we leave it to the readers. One can prepare such tables removing from the Cayley table for some columns and rows. Then change Kuratowski operations onto letters of the alphabet. For example, has the following Cayley table: Preparing the Cayley table for we put , and . This table immediately shows that semigroups and have exactly two automorphisms. These are identities and restrictions of .

Semigroup has eight elements. Semigroups and have nine elements. Semigroups , , and have ten elements. Semigroups have eleven elements. In the end, the semigroup has twelve elements.

Thus, the semigroup includes fifty-seven semigroups, among which there are ten groups, fourteen monoids, and also forty-three semigroups which are not monoids. These semigroups consist of twenty-eight types of nonisomorphic semigroups, two non-isomorphism types of groups, two non-isomorphism types of monoids which are not groups, and twenty four non-isomorphism types of semigroups which are not monoids.

#### 9. Viewing Semigroups Contained in

##### 9.1. Descriptive Data on Semigroups which Are Contained in

There are one hundred eighteen, that is, , semigroups which are contained in . These are fifty-seven semigroups contained in , fifty-seven monoids formed by adding to a semigroup contained in , groups , , and monoids and .

There are fifty-six types of nonisomorphic semigroups in . These are twenty-eight non-isomorphism types of semigroups contained in , twenty-six types of nonisomorphic monoids formed by adding to a semigroup contained in , and also and . Indeed, adding to a semigroup which is not a monoid we obtain a monoid. In this way, we get twenty-four types of nonisomorphic monoids. Adding to a monoid contained in we get two new non-isomorphism types of monoids. But, adding to a group contained in we get no new type of monoid, since we get a monoid isomorphic to or . The other two types are and .

##### 9.2. Semigroups which Are Not Monoids

Below we have reproduced, using the smallest number of generators and the dictionary order, a list of all 43 semigroups, which are included in the as follows:(1).(2).(3). (4).(5).(6).(7).(8).(9).(10).(11) = .(12).(13).(14).(15).(16).(17).(18).(19).(20).(21).(22).(23).(24).(25).(26).(27).(28) = .(29).(30).(31).(32).(33).(34).(35).(36) = = .(37).(38).(39).(40).(41).(42).(43).

##### 9.3. Isomorphism Types of Semigroups Contained in

Systematize the list of all isomorphism types of semigroups contained in the monoid . Isomorphisms, which are restrictions of the isomorphism , will be regarded as self-evident, and therefore they will not be commented on.(i)The monoid contains 12 groups with 2 isomorphism types. These are 7 one-element groups and 5 two-element groups.(ii)The monoid contains 8 two-element monoids with isomorphism types. These are added to 6 one-element groups and . Also, it contains 4 two-element semigroups, not monoids, with 2 isomorphism types. These are and .(iii)The monoid contains 12 three-element monoids with 5 isomorphism types. These are added to 4 two-element groups and also , , , and .(iv)The monoid contains 6 three-element semigroups, not monoids, with 3 isomorphism types. These are , , and .(v)The monoid contains 8 four-element monoids, each contains , with 4 isomorphism types. These are semigroups from two preceding items that can be substantially extended by .(vi)The monoid contains 5 four-element semigroups, not monoids, with 3 isomorphism types. These are , and . These semigroups extended by yield 5 monoids, all which consist of five elements, with 3 isomorphism types.(vii)The monoid contains 10 five-element semigroups—not monoids, with 5 isomorphism types. These are , , , , and . These semigroups extended by yield 10 monoids, all of which consist of six elements, with 5 isomorphism types. We get 10 new isomorphism types, since the semigroups are distinguished by semigroups and , and by nonisomorphic semigroups , , and .(viii)The monoid contains 5 six-element semigroups, not monoids, with 3 isomorphism types. These are , , and . These semigroups extended by yield 5 monoids, all of which consist of seven elements, with 3 isomorphism types. We get 6 new isomorphism types, since the semigroups are distinguished by non isomorphic semigroups , , and .(ix)The monoid contains no seven-element semigroup, not a monoid, no eight-element monoid and the only semigroup with exactly eight elements and the only monoid with exactly nine elements.(x)The monoid contains 4 nine-element semigroups, not monoids, with 2 isomorphism types. These are and . The semigroup does not contain a semigroup isomorphic to , hence it is not isomorphic to . These semigroups extended by yield 4 monoids, all of which consist of ten elements, with 2 isomorphism types.(xi)The monoid contains 6 ten-element semigroups, not monoids, with 4 isomorphism types. These are , , , and . These semigroups (except ) extended by yield 5 monoids, all of which consist of ten elements, with 3 isomorphism types. We get 6 new isomorphism types, since the semigroups are distinguished by not isomorphic semigroups , , and .(xii)The monoid contains 2 isomorphic semigroups, not monoids, which consist of 11 elements, that is, . These semigroups extended by yield 2 isomorphic monoids, which consist of 12 elements. The monoid contains no larger semigroup with the exception of itself.

#### 10. Cancellation Rules Motivated by Some Topological Properties

##### 10.1. Some Consequences of the Axiom

So far, we used only the following relations (above named cancellation rules): , , , and . When one assumes , then Using the substitution , one obtains equivalent relations between operations from the set , and conversely. Therefore, cancellation rules are topologically reasonable only between the operations from the monoid as follows: Chapman, see [3], considered properties of subsets with respect to such relations. Below, we are going to identify relations that are determined by some topological spaces; compare [10, 11].

##### 10.2. The Relation

If a topological space is discrete, then there exist two Kuratowski operation, only. These are and . So, the monoid of Kuratowski operations reduced to the group .

The relation is equivalent to any relation , where . Any such relation implies that every subset of has to be closed and open; that is, has to be discrete. However, one can check these using (only) the facts that is an involution and is an idempotent and the cancellation rules, that is, the Cayley table for . So, follows

##### 10.3. The Relation

Topologically, means that must be discrete. This is so because for any .

##### 10.4. The Relation

Topologically, the relation implies . But it requires the use of topology axioms and for each and .

Lemma 5. *For any topological space implies . *

*Proof. *If , then , for any . Indeed, if , then . Since , then . Hence , a contradiction.

The axiom implies that always
Thus, the additional assumption follows that always . Therefore, always , but this means that any closed set has to be open; in other words, .

Proposition 6. *For any topological space implies .*

*Proof. *But the relation is equivalent with . By Lemma 5, we get . Finally .

The relation has interpretation without the axiom . Indeed, suppose . Put Then, check that and in other words, and . However, is equivalent to .

This relation implies , , , and . For this interpretation, the monoid , consisting of Kuratowski operation over a such , has six elements, only. In , there are relations covered by the following proposition, only.

Proposition 7. *For any monoid with the Cayley table as for , the relation implies *; ; (iii); .

Thus, the Cayley table does not contain the complete information resulting from the axioms of topology.

##### 10.5. The Relation

Topologically, the relation means that any closed set is open, too. Thus, if is a topological space with the open sets , , , and , then is the monoid of all Kuratowski operations over . Relations and are equivalent. They imply relations: , , , and . The permutation determines the isomorphism between monoids and .

##### 10.6. The Relations and

Topologically, the relation means that any nonempty closed set has nonempty interior. For each , the closed set has empty interior, so the relation implies that is closed. Hence, any open set has to be closed, so it implies . The relation follows that each closed set has to be open, so it implies , too.

##### 10.7. The Relation

Using the Cayley table for , one can check that the relations and are equivalent. Each of them gives and . If is a topological space with the open sets , , and , then is the monoid of all Kuratowski operations over and consists of elements.

##### 10.8. The Relation

Using the Cayley table for , one can check that the relations , , , and are equivalent. If is a sequence converging to the point and , then is the monoid of all Kuratowski operations over and consists of elements.

##### 10.9. The Relation

Using the Cayley table for , one can check that the relations and are equivalent. Also and . These relations give the monoid with the following Cayley table, where the row and column marked by the identity are omitted:

If a space is extremally disconnected, then the closures of open sets are open; compare [2, page 452]. It follows that . The space