_{1}

^{*}

In point set topology, it is well known that the Kuratowski 14-set problem is one of the most interesting results. In this note, we first give a brief survey of the Kuratowski’s theorem. In particular, we will study and investigate the structure of the boundary of a given subset in a topological space. Some new results and topics which are related to the theorem of Kuratowski are presented and discussed. Finally, we pose some open problems of Kuratowskitype.

The problem of Kuratowski 14-sets was first proposed in 1922 by the famous Polish mathematician Kazimierz Kuratowski who discovered that at most 14 distinct sets can be generated by applying the closure operator and the com- plementation operator on a subset A of a topological space X in any order repeatedly (see [

Now, we denote the complementation of the set A by c ( A ) . As c ( c ( A ) ) = A = e ( A ) , where e is the identity operator, and so c 2 = e . We des- cribe this fact by saying that the operator c has the involution property, more- over if A ⊆ B , then c ( A ) ⊇ c ( B ) . Also,we use f ( A ) to denote the closure of the set A. It means the smallest closed set containing A. According to Kura- towski, the closure operator f has the following properties:

i) f ( ∅ ) = ∅ , (the closure of a void set).

ii) f ( A ) ⊇ A , (the expansion property).

iii) f ( f ( A ) ) = f ( A ) , (the idempotent property).

iv) f ( A ∪ B ) = f ( A ) ∪ f ( B ) , (the additivity property).

In point set topology, we usually use A − to denote the closure of a set A. However, for the sake of convenience, in dealing with the algebraic closure of a set A, we simply use f ( A ) to denote the closure of the set A. Thus, both A − and f ( A ) are used to denote the closure of a set A. Now, we also use the notation A ∘ and i ( A ) to denote the interior of a set A. For the sake of sim- plicity, We write B as the complement of the set A.It is clear that i ( A ) is the complete of f ( B ) . With the applications of the algebraic closure operator, It is well known that the interior of the set A is the set i ( A ) = c f ( B ) = A ∘ . Since B is used to denote c ( A ) , we now list the family of 14 sets generated by A in

In order to illustrate the inclusion relationship of the above 14 sets, we give the following relationship diagram. As the relationship diagram would look quite bulky if we put all the set inclusion symbols in the diagram. Thus, for the sake of simplicity, we use “®” to mean the inclusion relationship in the diagram. This nice relationship diagram was first given in Kuratowski in [

Diagram 1. The inclusion relationship of the 14 sets.

The papers [

Throughout this section, we use f and i to denote the algebraic closure operator, respectively. According to Kuratowski [

i) Monotonic property, i.e., if B ⊆ A , then f ( B ) ⊆ f ( A ) ,

ii) Expansive property, i.e., A ⊆ f ( A ) ,

iii) Idempotent property, i.e., f ( f ( A ) ) = f ( A ) , f 2 = f ,

iv) Additive property, i.e., f ( A ∪ B ) = f ( A ) ∪ f ( B ) .

On the other hand, the algebraic interior operator i has the following pro- perties:

a) Monotonic property, i.e., if B ⊆ A , then i ( B ) ⊆ i ( A ) ,

b) Shrinking property, i.e., i ( A ) ⊆ A ,

c) Idempotent property, i.e., i ( i ( A ) ) = i ( A ) , i.e., i 2 = i ,

d) Additive property, i.e., i ( A ∪ B ) = i ( A ) ∪ i ( B ) .

Consider A ⊆ B . By using the above properties of algebraic closure operator and the algebraic interior operator, we obtain immediately the following crucial theorem.

Theorem 2.1. Let f , i be the closure and interior operators. Then we derive the following identities, ( f i ) 2 = f i and ( i f ) 2 = i f .

Proof. By using the shrinking property of i , we have i f i ≤ f i . By applying the monotonic property and the idempotent property of f , we can easily deduce the equations ( f i ) 2 = f i f i ≤ f ( f i ) = f 2 i = f i . On the other hand, because i ≤ f i we have i = i 2 ≤ i f i , consequently, we derive that f i = ( f i ) 2 . Recall that i = c f c and f = c i c , by acting these two identities in the above equations, we obtain i f = ( i f ) 2 . Thus, our theorem is proved. ,

Corollary 2.2. Because f ( A ) = c i f ( A ) and i ( A ) = c f c ( A ) . We immediately see in the above

Let A , B be subsets of a given set M . Then, by applying the complementation operator c on these two sets. we have the following properties:

a) The inversion property, If A ⊆ B , then c ( A ) ⊇ c ( B ) , we simply denote this situation by c ↓ .

b) The involution property, c ( c ( A ) ) = A , i.e., c 2 = e , the identity.

c) The separation property. Since c ( A ) = M − A , c ( A ) ∩ A = ∅ , we simply denote this case by c ∧ e = 0 .

Now, we consider the complementation operator c on a bounded lattice ( L , ∧ , ∨ , 0 , 1 ) , where 0 is the minimum element of the lattice L and 1 is the greatest element of the lattice L. In general, the bounded lattice can be regarded as a power set of a give set L, if α ( x ) ≤ β ( x ) , then we write α ≤ β . The 0 ∈ L can always be regarded as the zero function. We notice that if c ↑ , then c ( g ∧ h ) ≤ c g ∧ c h , c ( g ∨ h ) ≥ c g ∨ c h . Moreover, if g ≤ h and α ↑ , then we always have α g ≤ α h .

For the complementation operator c, we have the following theorem.

Theorem 2.3. Let c be a complementation operator and e the identity operator on a bounded lattice ( L , ∧ , ∨ , 0 , 1 ) . Then c ( 1 ) = 0 and c ( 0 ) = 1 .

Proof. The proof is quite easy. For the sake of the interest of the readers, we provide here two proofs.

Proof i). Because c 2 = e , c is clearly surjective and injective. Thus, for 0 ∈ L , by the inversion property of c, i.e., c ↓ , we have 0 = c ( x L ) ≥ c ( 1 ) and hence c ( 1 ) = 0 . Now, by the involution property of c, we deduce that 1 = c ( c ( 1 ) ) = c ( 0 ) .

Proof ii). Suppose that c ( x ) ≠ 0 for any x ∈ L . Then we have c ( c ( x ) ) ≠ 0 . This contradicts to x = 0 , c ( c ( 0 ) ) = e ( 0 ) = 0 . Hence, there exists x L ∈ L such that c ( x L ) = 0 . Consequently, 0 ≤ x l ≤ 1 , 0 = c ( x L ) ≥ c ( 1 ) . Therefore, c ( 1 ) = 0 . The proof is now completed.

For any subset A in a topological space, the boundary of A is defined by b ( A ) = A − ∩ c ( A ) − . Hence, the boundary operator of A is denoted by b = f ∧ f c . Similarly, we can define the rim operator, r = e ∧ f c and the side operator by s = f ∧ c . Obviously, the boundary operator, the rim operator and the side operator are closely related on a distributive lattice. It is noted that we always have b = r ∨ s , e = i ∨ r . It is obvious that the boundary, the rim and the side of a subset A in a topological space are different concepts. The following example is an example of the above three notations.

Example 3.1. Let A = [ 2 , 3 ) be a closed-open interval in the real line R . Then according to the definitions of the boundary, the rim and the side of the given set A in a topological space X , we immediately see that b ( A ) = { 2 , 3 } , r ( A ) = { 2 } and s ( A ) = { 3 } . It is clear that the above three concepts are dis- tinct concepts, in fact, the rim and the side of a subset A in X are parts of the boundary of b ( A ) .

It is noteworthy that the sequence s , s 2 , s 3 , ⋯ , s n , ⋯ of powers of s is sometimes infinite(for i ≠ j , s i ≠ s j ).

In the following example, we construct an infinite sequence of side operator.

The construction of such an infinite sequence of side operator in a subset of positive integers is quite technical.

Example 3.2. We first consider the set N = { 1,2,3 , ⋯ } , F ( N ) = { A ⊆ N } . Now, we make F ( N ) a bounded lattice ( L , ∧ , ∨ ,0,1 ) . In this bounded lattice L , “0” is the empty set and “1” is the set N itself. The operation “ ∨ ” can be regarded as the set union and the operation “ ∧ ” can be regarded as the set intersection. Consider the subsets in this bounded lattice ( L , ∧ , ∨ ,0,1 ) .

Let N be the set of all positive integers. For all n ∈ N , let F n = { n , n + 1 , ⋯ } , denoted by [ n , ∞ ) with F ∞ = ∅ . Consider the set

F Σ = { F ∞ , F 1 , F 2 , ⋯ , F n , F n + 1 , ⋯ } .

Now for A ⊆ N . Define f ( A ) = ∩ { F i : F i ∈ F Σ and F i ⊇ A } . Then, we can

easily verify that f is an algebraic closure operator of P ( N ) → P ( N ) , where

P ( N ) is the power set of the set N . We first take N = { 1 , 3 , 5 , ⋯ } . Then we

have s ( A ) = { 2 , 4 , 6 , ⋯ } , and s 2 ( A ) = { 3,5,7, ⋯ } ; s 3 ( A ) = { 4 , 6 , 8 , ⋯ } , and so

s 2 k − 1 ( A ) = { 2 k , 2 k + 2 , 2 k + 4 , ⋯ } , s 2 k ( A ) = { 2 k + 1 , 2 k + 3 , ⋯ } .

Thus, for i ≠ j , we have s i ( A ) ≠ s j ( A ) . This shows that { s , s 2 , s 3 , ⋯ } is an infinite sequence.

We now call an expansive operator g a quasi algebraic closure operator if g 2 ≠ g but g 2 = g 3 . Obviously, the quasi algebraic closure operator is a generalized algebraic closure operator. Naturally, one would ask whether the Kuratowski’s theorem still holds for the quasi algebraic closure operator?

In the following example, we show that Kuratowski’s theorem does not hold for the quasi algebraic closure operator.

Example 3.3. For any arbitrary integer n , consider the subset S = { ( n , n + 1 ) } ∪ { R \ ( n , n + 1 ) } .

We first let P ( R ) be the power set of the real line R .

Define the function g 0 : S → P ( R ) by

g 0 ( n , n + 1 ) = ( − ∞ , n + 1 ] ∪ [ n + 1 , ∞ ) = R \ ( n + 1 , n + 2 ) ,

and

g 0 ( R \ ( n , n + 1 ) ) = R .

Now, we define a function g : P ( R ) → P ( R ) as follows:

g ( x ) = x ∪ { ∪ g 0 ( y ) | y ⊆ x , y ∈ S } ,

where, x ⊆ R . Then, after verification, we can easily see that if x 1 ⊂ x 2 , then g ( x 1 ) ⊆ g ( x 2 ) , also x ⊆ g ( x ) . Thus, g is an expansive operator.

By the definition of the operator g again, we can verify that g 2 ≠ g but g 2 = g 3 . Hence, g is indeed a quasi algebraic closure operator.

Let A = ( 0 , 1 ) . Then by applying the operator g on the set A = ( 0 , 1 ) , we have g ( ( 0,1 ) ) = ( − ∞ ,1 ] ∪ [ 2, ∞ ) .

Applying c and g by repetition on the above equality, we obtain the following sequence of sets:

c g ( ( 0 , 1 ) ) = ( 1 , 2 ) , ⋮ ( c g ) 2 ( ( 0 , 1 ) ) = ( ( 2 , 3 ) ) , ( c g ) k ( ( 0 , 1 ) ) = ( ( k , k + 1 ) ) , ⋮

Thus, it is clear that ( ( c g ) k ) k = 1 ∞ is an infinite sequence of sets.

This example illustrates that the theorem of Kuratowski does not hold anymore for quasi algebraic closure operators.

For the boundary operator and the rim operator, we have the following theorem. (see [

Theorem 3.4. (i) b 3 = b 2 (ii) r 2 = r .

Proof of i):

b 2 = b ( b ) = f ( b ) ∧ f c b = f ( f ∧ f c ) ∧ f c b ≤ f 2 ∧ f c ∧ f c b ≤ f ∧ f c ∧ ∗ ≤ f ∧ f c = b

Thus we have b 3 = b 2 ( b ) ≤ b ( b ) = b 2 . b 2 ∧ f c b = ( f b ∧ f c b ) ∧ f c b . On the other hand, by b 2 ≤ b , we deduce that c b 2 ≥ c b , f c b 2 ≥ f c b and b 3 = b ( b 2 ) = f b 2 ∧ f c b 2 ≥ f b 2 ∧ f c b ≥ b 2 ∧ f c b = ( f b ∧ f c b ) ∧ f c b = f b ∧ f c b = b ( b ) Math_209#. Hence, we have proved that b 2 = b 3 .

Proof of ii): Clearly, r 2 = r ( r ) = r ∧ f c r ≤ r . Also by r = e ∧ f c , we have r ≤ f c and thereby we obtain r 2 = r ( r ) = r ∧ f c r ≥ r ∧ f c = e ∧ f c ∧ f c = e ∧ f c = r . Thus, we deduce that r 2 ≤ r ≤ r 2 , and consequently r 2 = r .

Remark. The amalgamation of the boundary operator with the other algebraic operators also produces a number of useful equalities. (see [

Proposition 3.5. (i) b 2 f = b f .

Proof. By b f = f 2 ∧ f c f = f ∧ f c f , f ∧ f c f ≤ f c , f ∧ f c f ≤ f c f . Hence we have c ( f c f c f ) ≥ c f . Consequently,

c ( f ∧ f c c f ) ≥ f ( c f c f c f ) ≥ f c f f c f c f ≥ f c f .

This implies that f c b f ≥ f c f . Thus, b 2 f = b ( b f ) = f b f ∧ f c b f = b f ∧ f c b f = f ∧ f c f c b f = f ∧ f c f = b .

Remark 3.6. Using the equalities i = c f c , f = c i c , r = f ∧ f c , c 2 = e we can easily deduce that b c = b , b f = b i c , b 2 i = b i , i b i = 0 (that is, the zero operator), i b 2 = 0 , i r = r i = 0 , b f = f r , b 2 = r b , b 2 r = r b r = r f r , f r f = r f , r e = s , s c = r , ⋯ , etc.

Finally, we consider some questions which are closely related to the theorem of Kuratowski.

Let A , B be subsets of a space M. Then we call an operator c ′ an algebraic quasi-complmentation operator if c ′ satisfies the separation property c ′ ( A ) = M − A , c ′ ( A ) ∩ A = ∅ , simply denoted it by c ′ ∧ e = 0 ; also c ′ sa- tisfies the inversion property, i.e., if A ⊆ B , then c ( A ) ⊇ c ( B ) , we simply denote this situation by c ′ ↓ , but c ′ does not satisfies the involution property, c ( c ( A ) ) ≠ A , i.e., c 2 ≠ e , the identity

We now pose the following question.

Question 3.7. a) Let A be a given subset in a topological space X . How many distinct sets can be generated by applying the algebraic closure operator and the algebraic quasi-complementation operator successfully on A in any order?

b) Likewisely, we call a shrinking operator j an algebraic quasi-interior operator if j 2 = j 3 but not j 2 = j .Can we construct an algebraic quasi- interior open set for the set A , that j ( A ) = A ?

Now, we ask when will an algebraic quasi-interior operator j and the complementation operator c generate a finite semigroup under the usual operator composition?

In order to help answer the above questions, we construct an algebraic quasi-complementation operator c ′ .

Let R be a real line. For any element x ∈ R , define c ′ ( x ) = ( − ∞ , − x ] , c ′ ( − x ) = [ x , ∞ ) and c ′ ( 0 ) = { 0 } . Obviously, c ′ ∧ e = 0 ; and c ′ ↓ because if x ≤ y ,then c ′ ( x ) ≥ c ′ ( y ) , but c ′ 2 ≠ e . Thus, c ′ is indeed an algebraic quasi- complementation operator.

By using the idea of algebraic quasi closure operator described in Example 2.6, one can therefore construct an algebraic quasi interior operator. Hence, by the idea of the construction of an algebraic quasi interior operator, the reader should be able to answer the above questions.

We notice that an equivalent formulation of the Kuratowski’s theorem is that at most 7 distinct sets can be obtained by the composition of the algebraic closure operator f and the algebraic interior operator i . In order to show clearly the mutually inclusion relationship of these 7 distinct sets composed by f and i on a given set A . we give again the following Hasse diagram (Diagram 2).

Diagram 2. The inclusion relationship of 7 distinct sets.

For a given subset A in a topological space X, we call the sets generated from A by successive applications of the algebraic closure and complementation operations in any order on A the relatives of A. Thus, by Kuratowski’s theorem, a K-set A always have 14 relative sets.

It is natural to ask whether there exists a subset in a topological space with less than 14 relative sets? The following theorem gives an answer to the above question.

Theorem 4.1. If the rim of a set A is nowhere dense, then by successive applications of closure operator and complementation operator, in any order, on A , A has at most 10 relative sets.

Proof. We first denote the interior of the set A by i ( A ) . Then A = i ( A ) ∪ r ( A ) . Consequently, by using the algebraic closure operator, we have f ( A ) = f i ( A ) ∪ f r ( A ) . Now, i f ( A ) = i ( f i ( A ) ∪ f r ( A ) ) ⊆ f i ( A ) ∪ i f r ( A ) . Be- cause the rim of the set A , say r ( A ) is nowhere dense, we have f r ( A ) = ∅ and so, f ( A ) ⊆ f ( A ) . Thus, we see immediately that i ( i f ( A ) ) ⊆ i f i ( A ) , that is, f ( A ) ⊆ i f i ( A ) . Conversely, A ⊇ i ( A ) implies that f ( A ) ⊇ i f i ( A ) . Hence, we deduce that

f ( A ) = i f i ( A ) . (1)

Now we put A 1 = A , A 2 = f ( A ) and so on. For n ≥ 2 , we put A 2 n = ( f c ) n − 1 f ( A ) , for n > 1 , put A 2 n + 1 = ( c f ) n ( A ) . Also, similarly, we put B 1 = c ( A ) . For n ≥ 1 , B 2 n = ( f c ) n ( A ) , B 2 n + 1 = c ( f c ) n ( A ) . By using Kurato- wski’s theorem again, we always have B 8 = B 4 , A 8 = A 4 . By the equation ob- tained above, we see that A 5 = B 8 = B 4 . Thus A has at most 10 distinct relative sets.

In the literature, P. Halmos [

The following theorem is also an interesting theorem.

Theorem 4.2. If the rim of a set A is dense in a regular closed subset of a topological space X , then A has at most 12 distinct relative sets by taking the algebraic closure operator f and the the complementation operators c repeatedly in any order on A .

Proof. Let T be a regular closed set. Then by definition, we have f i ( T ) = T . Since A = i ( A ) ∪ r ( A ) , by the additive property of the algebraic closure, we have f ( A ) = f i ( A ) ∪ f r ( A ) = f i ( A ) ∪ T . This is because we assume that r ( A ) is dense in T . Now, we have f ( A ) ⊇ i ( f i ( A ) ) ∪ i ( T ) . This leads to f i f ( A ) ⊇ f i f ( A ) ∪ T = f i ( A ) ∪ T , and thereby f i f ( A ) ⊇ f ( A ) . Trivially, f i f ( A ) ⊆ f ( A ) . Hence, we have proved that f i f ( A ) = f ( A ) , that is, A 6 = A 2 . By the result of Kuratowski’s theorem, we always have B 8 = B 4 , A 8 = A 4 . Thus, we can easily see that A has at most 12 distinct relative.

It was stated by D. Sherman [

Diagram 3. The solution of the p ( f , i , ∧ ) problem and its dual problem p ( f , i , ∨ ) .

Proof. Let T be a regular closed set. Then f i ( T ) = T . Since A = i ( A ) ∪ r ( A ) , by the additive property of the relation “ ∧ ” on a given set A . This result is the answer to the well known problem p ( f , i , ∧ ) . If the union operation “ ∨ ” is also allowed to use, then at most 35 different operators can be formed. This problem is now called the p ( f , i , ∧ , ∨ ) problem. The solution of p ( f , i , ∧ ) and p ( f , i , ∨ ) are shown in the following Hasse diagrams [

Diagram 4. p ( f , i , ∧ ) .

Diagram 5. p ( f , i , ∨ ) .

It is clear that the p ( f , i , ∨ ) problem is the dual of the p ( f , i , ∧ ) problem.

One can verify the following subset T of the real line R

T = [ { 1 / n , n ∈ N } ] ∪ [ 2 , 4 ] − { 3 + 1 / n } ∪ [ [ 5 , 7 ] ∩ ( Q ∪ ( 6 + 1 / 2 n π , 6 + 1 / ( 2 n − 1 ) π ) ) ]

is a Shermann set, that is, it can generate 13 distinct sets by successively applications of the algebraic closure operator,the algebraic interior operator and the set intersection operations on T in any order (see also [

Let M be the set of all positive integers and A ⊆ M . Then Hammer in 1960 defined h ( A ) = ∪ n = 1 ∞ A n , where A n is the set product of n copies of A . Clearly, h ( A ) ⊇ A and h ( h ( A ) ) = h ( A ) . Thus, h is an expansive and ide- mpotent operator, we now call h the Hammer closure. Now, we define i = c h c and call it the Hammer interior operator. It is clear that i is also a shrinking and idempotent operator.

The following interesting question was asked by Hammer in 1960 [

We now give the following example to answer the open problem of Hammer in 1960. This example was given by Shum in 1996. (see [

Example 5.1. The following subset of the set of positive integers

A = { 5 , 2 2 × 3 2 , 7 , 2 × 5 2 , 2 2 × 5 3 , 3 × 7 2 , 3 2 × 7 3 }

is a K-set.

We list bellow the family of all the 14 relatives of the set A . This would help the readers to check the validity of the example.

A 1 = A = e ( A ) = { 5 , 2 2 × 3 2 , 7 , 2 × 5 2 , 2 2 × 5 3 , 3 × 7 2 , 3 2 × 7 3 } ;

A 2 = h ( A ) = A − = A 1 ∪ { 5 × 7 , 2 2 × 5 4 , 2 2 × 3 2 × 5 × 7 , 2 2 × 3 2 × 5 3 × 7 3 , ⋯ } ∪ ⋯ ;

A 3 = c h ( A ) = B ∘ = { 1 , 2 , 3 , 2 × 3 , 2 2 × 7 3 , 3 2 × 5 3 , 2 2 × 7 , 3 2 × 5 , ⋯ } ∪ ⋯ ;

A 4 = h ( h ( A ) ) = B ∘ − = A 3 ∪ { 2 2 × 3 2 , 2 2 × 3 2 × 5 3 × 7 3 , 2 2 × 3 2 × 5 × 7 , ⋯ } ∪ ⋯ ;

A 5 = c h c h ( A ) = A − ∘ = { 5 , 7 , 2 2 × 5 3 , 3 2 × 3 , 2 × 5 2 , 3 × 7 2 , ⋯ } ∪ ⋯ ;

A 6 = h c h c h ( A ) = A − ∘ − = A 5 ∪ { 5 × 7 , 2 2 × 3 2 , 2 2 × 3 2 × 5 3 × 7 3 , 2 × 3 × 5 2 × 7 2 , ⋯ } ∪ ⋯ ;

A 7 = c h c h ( A ) = A ∘ − ∘ = { 1 , 2 , 3 , 2 2 × 3 2 × 5 × 7 , ⋯ } ;

B 1 = c ( A ) = { 1 , 2 , 3 , 7 2 , 2 × 3 , 2 × 5 , 2 2 × 5 4 , 2 2 × 5 3 , 3 × 7 3 , ⋯ } ;

B 2 = h c ( A ) = B − = B 1 ∪ { 2 2 × 3 2 , 3 × 7 2 , 3 × 7 3 , 3 2 × 7 3 , ⋯ } ⋯ ;

B 3 = c h c ( A ) = A ∘ = { 5 , 7 , 2 × 5 , 3 × 7 , 2 × 5 3 , 3 2 × 5 3 , 2 × 7 3 } ⋯ ;

B 4 = h c h c ( A ) = A ∘ − = B 3 ∪ { 5 × 7 , 2 2 × 3 2 × 5 3 × 7 3 , 2 2 × 5 4 , 3 × 7 3 , ⋯ } ⋯ ;

B 5 = c h c h c ( A ) = B − ∘ = { 1 , 2 , 3 , 2 × 3 , 3 2 × 7 , 2 2 × 5 3 , 3 2 × 7 3 × 2 × 3 × 5 × 7 , ⋯ } ⋯ ;

B 6 = h c h c h c ( A ) = B − ∘ − = B 5 ∪ { 2 2 × 3 2 × 5 3 × 7 3 , 2 2 × 3 2 × 5 × 7 , ⋯ } ⋯ ;

B 7 = c h c h c h c ( A ) = B ∘ − ∘ = { 5 , 7 , 5 × 7 , 3 × 7 3 , ⋯ } .

The relationship of the above 14 sets can be seen in Diagram 6.

Diagram 6. The relationship of the 14 sets.

Recall that for a subset A in the set of positive integers Z + , the Hammer closure of A is defined by h ( A ) = ∪ n = 1 ∞ , where A n is the set product of n copies of A . It is natural to ask how to construct a K-set in the set Z + ? The following lemma gives some ideas and hints.

Lemma 5.2. Let p , q , r , s be prime numbers and i ( A ) = c h c ( A ) . If p n ∈ i ( A ) , then p ∈ i ( A ) , where n > 1 .

Proof. If p ∈ i ( A ) = c h c ( A ) , then p ∈ h c ( A ) . This implies that p n ∈ h c ( A ) and so we have p n ∉ c h c ( A ) = i ( A ) , a contradiction.

Lemma 5.3. Assume that i ( A ) = { p , p n } . Then n ≤ 3 .

Proof. If n ≥ 4 , then by our assumption, we have p n − 2 ∉ i ( A ) = c h c ( A ) , and so p 2 ∉ c h c ( A ) . This leads to p n − 2 ∈ h c ( A ) , and hence p n = p n − 2 p 2 ∈ h c ( A ) . Consequently, we deduce that p n ∉ c h c ( A ) = i ( A ) , a contradiction.

By using the arguments a ∉ i ( A ) , b ∈ i ( A ) , a b ∉ i ( A ) repeatedly, we de- duce the following lemma.

Lemma 5.4. 1) Let m be a composite number and p is a prime number. If i ( A ) = { p , m } , then p | m ;

2) If i ( A ) = { p , p n q } or i ( A ) = { p , p q n } , then n = 1 ;

3) If i ( A ) = { p , p 2 , n } , n is a composite number, then n = p 3 , p 4 , p 5 , p s or p 2 s , where s is a prime number but is not equal to p ;

4) If p 2 q ∈ i ( A ) , p n − 1 ∉ i ( A ) , then p ∈ i ( A ) ;

5) i ( A ) = { p , p q r } is impossible;

6) Let d ( m ) be the prime decomposition length of the composite number m . If i ( A ) = { p , m } , then d ( m ) ≤ 2 ;

7) i ( A ) = { m , n } is impossible if m , n are both composite numbers.

Proof. The proofs of this lemma are routine but quite tedious, we hence omit the details.

By summing up the above lemmas, we state the following theorem.

Theorem 5.5. If | i ( A ) | ≤ 3 , then A is not a K-set.

Proof. The proof is to check | i ( A ) | = 1 , 2 , 3 case by case. For example, we consider i ( A ) = { p } , i ( A ) = { p , q } , i ( A ) = { p , q , r } , i ( A ) = { p , m , n } or i ( A ) = { m , n , u } until all possible cases are exhausted and are impossible. There- fore we conclude that A is not a K-set if | i ( A ) | ≤ 3 .

Theorem 5.6. Let A be a subset of the set of all positive integers and p , q , r , s are prime numbers. Then we have the following statements:

1) If A is a K-set, then A contains at least five elements and the elements of A can be composed of not more than three distinct prime numbers.

2) If A is a K-set with five elements, then i ( A ) must be one of the following forms:

a) i ( A ) = { p , r , p r , p q r } ;

b) i ( A ) = { p , p q , r , r s } ;

c) i ( A ) = { p , p q , p r , p q r } ;

d) i ( A ) = { p , p q , p α + 1 , p α + 1 q | α ≥ 1 } .

For more information concerning the construction of a K-set, the reader is referred to K. P. Shum [

In view of Diagram 5, there are four distinct sets, namely the sets B 4 = A ∘ − , A 4 = A − ∘ − , B 7 = A ∘ − ∘ between the sets A 2 = A − and B 3 = A ∘ . Likewisely, there are also four distinct sets, namely, the sets B 6 = B − ∘ − , A 4 = B ∘ − , B 5 = B − ∘ and A 7 = B ∘ − ∘ between the sets B 2 = B − and A 3 = B ∘ .

Now, we perform the usual set operations of union intersection and subtraction on the above sets, we obtain the following equalities:

1) A ∘ = A ∘ ;

2) A ∘ − ∘ = A ∘ ∪ ( A ∘ − ∘ \ A ∘ ) ;

3) A ∘ − = A ∘ ∪ ( A ∘ − ∘ \ A ) ∪ ( A ∘ − ∩ A − ∘ \ A ∘ − ∘ ) ∪ ( A ∘ − \ A − ∘ ) ;

4) A − ∘ = A ∘ ∪ ( A ∘ − ∘ \ A ∘ ) ∪ ( A ∘ − ∩ A − ∘ \ A ∘ − ∘ ) ∪ ( A − ∘ \ A ∘ − ) ;

5) A − ∘ = A ∘ ∪ ( A ∘ − ∘ \ A ∘ ) ∪ ( A ∘ − ∩ A − ∘ \ A ∘ − ∘ ) ∪ ( A − ∘ \ A ∘ − ) ∪ ( A ∘ − \ A − ∘ ) ∪ ( A − ∘ − \ A ∘ − ∩ A − ∘ ) ；

6) A = A ∘ ∪ ( A \ A ∘ ) ;

7) A − = A − ∘ − ∪ ( A − \ A − ∘ − ) .

Because the boundary of a set A in the topological space X is defined by b ( A ) = A − ∩ c ( A ) − = f ( A ) ∩ f c ( A ) .

Since the rim of a set A is defined by r b ( A ) = A ∪ f c ( A ) and so r b ( A ) ⊆ A − ∩ c ( A ) − = b ( A ) . This means that the rim of A , r b ( A ) is a part of the boundary b ( A ) .

By using the equation i = c f c and f = c i c , we immediately see that the gain boundary of A G b ( A ) = A ∘ − ∘ \ A ∘ = i f i ( A ) ∩ c i ( A ) = i f i ( A ) ∩ c ( c f c ( A ) ) ⊆ f ( A ) ∩ f c ( A ) = b ( A ) . Likewisely, we can also see that the inner boundary of A , I ( A ∘ − ∩ A − ∘ \ A ∘ − ∘ ) ⊆ f ( A ) ∩ f c ( A ) = b ( A ) ; also, the public boundary of A , P b ( A ) = A ∘ − \ A − ∘ = f i ( A ) ∩ i f i f ( A ) ⊆ f i ( A ) ∩ c f ( A ) ⊆ f i ( A ) ∩ c f ( A ) = b ( A ) ; the neutral boundary N b ( A ) = A − ∘ \ A ∘ − ⊆ f ( A ) ∩ f c ( A ) = b ( A ) ; the outer boun- dary of A , O b ( A ) = A − ∘ − \ A ∘ − ∩ A − ∘ ⊆ f ( A ) ∩ f c ( A ) = b ( A ) ; the loss boun- dary of A L b ( A ) = A − \ A − ∘ − = f ( A ) ∩ c ( f i f ( A ) ) ⊆ f ( A ) ∩ i f c ( A ) ⊆ f ( A ) ∩ f c ( A ) = b ( A ) .

Now, by using the above concepts of the components of the boundary of a set A , we obtain the following equalities related to the above components of the boundaries and the 7 Kuratowski sets. (see [

1) A = A ∘ ∩ R b ( A ) ;

2) A ∘ ;

3) A ∘ − ∘ = A ∘ ∪ G b ( A ) ;

4) A ∘ − = A ∘ ∪ G b ( A ) ∪ I b ( A ) ∪ P b ( A ) ;

5) A − ∘ = A ∘ ∪ G b ( A ) ∪ I b ( A ) ∪ N b ( A ) ;

6) A − ∘ − = A ∘ ∪ G b ( A ) ∪ I b ( A ) ∪ N b ( A ) ∪ P b ( A ) ∪ O b ( A ) ;

7) A − = A ∘ ∪ G b ( A ) ∪ I b ( A ) ∪ N b ( A ) ∪ L b ( A ) .

We now consider the Structure of the boundary of a set A in a topological space.

The boundary of a set A and all its components in a topological space can be interpreted in the following “envelope diagram” (see [

Diagram 7. The boundary of a set A and all its components in a topological space.

In Diagram 6, A ∘ can be regarded as a troop of soldiers and B ∘ is the troop of the enemies of A ∘ .

In the diagram, P b ( A ) is the public boundary at which the troops A ∘ and B ∘ are in combatomg.

N b ( A ) can be regarded as the ceased fire zone or the negotiation area between the troops A ∘ and B ∘ , and therefore, we call this part of boundary the neutral boundary of A .

I b ( A ) , the inner boundary is the final defence frontier of A ∘ , that is, it can be regarded as the Mignot defence line of the troop A ∘ .

G b ( A ) , the gain boundary of A ∘ , it can be interpreted as the picket posts of the troop B ∘ and these posts will be seized and occupied by the troop A ∘ when the war begins.

O b ( A ) , the outer boundary of A ∘ which is the inner boundary of the troop B ∘ . Roughly speaking, the inner boundary of A ∘ can be regarded as the skin of A ∘ and the outer boundary can be regarded as the clothes of A ∘ . Then one can easily distinct the inner boundary and the outer boundary of a set A in a given space X .

L b ( A ) , the loss boundary of A ∘ which can be described as the gain boundary of the troop B ∘ .

R b ( A ) , the rim boundary of A . Of course,the rim of a set A is a part of the boundary of the set A but it is not necessarily belongs to the given set A . In considering the boundary of a set A , many people always overlook that there are rims of the set A .

Thus,in terms of the closure operator f , the interior operator i and the complementation operator c , we can express the above components of the boundary of the set A in the topological space X as follows:

We always use the equalities i = c f c and f = c i c to describe the different components of the boundary of the set A . These different components of the boundary of the set A are the followings:

P b ( A ) = f i ( A ) ∩ f c f ( A ) = f i ( A ) ∩ f i c ( A ) = B 4 ∩ A 4 ;

N b ( A ) = c f i ( A ) ∩ f i c ( A ) = c f c f c ( A ) ∩ c f c f c ( A ) = B 5 ∩ B 5 ;

I b ( A ) = f i ( A ) ∩ c f c f ( A ) ∩ f c f c f c ( A ) = B 4 ∩ A 5 ∩ B 6 ;

O b ( A ) = f i c ( A ) ∩ c f c f c ( A ) ∩ f c f c f ( A ) = A 4 ∩ B 5 ∩ A 6 ;

G b ( A ) = i f i ( A ) ∩ f c ( A ) = B 7 ∩ B 2 ;

L b ( A ) = f ( A ) ∩ c f i f ( A ) = A 7 ∩ A 2 ;

R b ( A ) = A ∩ f c ( A ) = A 1 ∩ B 2 .

After we have displayed all the possible components of the boundary of a set A , we can easily find out the conditions for a set A which leads to the set A to be a K-set. In fact, we have the following three different types of sets.

Type I. A set A is called a standard set if P b ( A ) , N b ( A ) , I b ( A ) , O b ( A ) , G b ( A ) , L b ( A ) and R b ( A ) are all non-empty sets.

One can easily observe that a set A is a K-set if and only if A is a standard set.

It may happen that I b ( A ) = O b ( A ) = N b ( A ) ≠ ∅ .

Type II. A set A is called an abnormal set if P b ( A ) = ∅ . It can be observed that an abnormal set A is a K-set if and only if N b ( A ) , I b ( A ) , O b ( A ) , G b ( A ) , L b ( A ) and R b ( A ) are all non-empty sets.

Type III. A set A is called a normal set if P b ( A ) ≠ ∅ . It is clear that a set A is a K-set if and only if N b ( A ) , I b ( A ) , O b ( A ) , G b ( A ) , L b ( A ) and R b ( A ) are all non-empty, moreover, I b ( A ) and O b ( A ) may be possibly empty.

Remark 5.7. Because I b ( A ) ⊆ N b ( A ) and O b ( A ) ⊆ N b ( A ) = A 3 ∩ B 5 . In this case, the set A is also a standard K-set.

Below are some examples of normal set and abnormal set.

Example 5.8. A = { 2 , 5 , 2 × 5 , 2 × 3 × 5 , 2 2 × 3 2 } is a normal set. In this set set, we can check that P b ( A ) = { 2 2 × 3 2 × 5 2 , ⋯ } , N b ( A ) = { 2 4 × 3, ⋯ } , O b ( A ) = ∅ , I b ( A ) = ∅ , G b ( A ) = { 2 2 × 3 × 5 , ⋯ } , L b ( A ) = { 2 3 × 3 2 , ⋯ } , R b ( A ) = { 2 2 × 3 2 } .

Therefore A is a normal K-set.

Example 5.9. The A = { 2 , 2 × 3 , 5 , 2 × 7 , 3 × 7 } is a abnormal set.

It is clear to see that i ( A ) = { 2 , 2 × 3 , 5 , 2 × 7 } . Since 3 ∉ i ( A ) , 7 ∉ i ( A ) , we know that 3 × 7 ∉ A ∩ f c ( A ) = R b ( A ) . Because we can easily see that 3,7,5 × 7,3 × 5 and 2 × 3 × 7, ⋯ are all in the interior of c ( A ) . Thus P b ( A ) = f i ( A ) ∩ f i ( c ( A ) ) = ∅ . This shows that A is an abnormal set.

The following example is also a standard K-set.

Example 5.10. A = { 2 , 2 × 3 , 3 3 , 2 3 × 3 , 3 × 5 2 } is a standard set. In this example, 3 ∉ i ( A ) , 5 2 ∉ i ( A ) and so 3 × 5 2 ∉ i ( A ) . Thus i ( A ) = { 2,2 × 3,3 3 ,2 3 × 3 } . Be- cause i c ( A ) = c f ( A ) { 3 , 5 , 7 , 2 × 5 , 3 × 5 , 2 × 5 2 , 2 × 3 × 5 , 3 2 × 5 , 2 2 × 7 , ⋯ } . By using the definitions of the components of the boundary, we can find that P b ( A ) = { 2 3 × 3 3 , ⋯ } , N b ( A ) = { 2 × 3 2 , ⋯ } , O b ( A ) = { 2 2 × 3 2 , ⋯ } , G b ( A ) = { 2 4 × 3 , ⋯ } , L b ( A ) = { 2 × 3 × 5 2 , ⋯ } and I b ( A ) = { 3 × 2 2 , ⋯ } , R b ( A ) = { 3 × 5 2 } . Thus, the boundary of the set A has components and so A is standard set. We have therefore verified that A is indeed a K-set.

In the above section, we have already considered the construction of a K-set in the set of positive integers. We now turn to the topological space X containing a K-set K . We concentrate on the so called 7 point space theorem, that is, if A is a subset of a n-point space then A has at most 2n relations by taking closure and complementation on A successively, in any order. This is a significant result in general topology. (see [

Theorem 6.1. Let X be a topological space and A a K-set in X . If exactly 2n n ≤ 7 distinct sets can be generated by A by successive applications, in any order of closure and complementation on A , then then the number of the elements of the space X can not be less that 7. (see [

Before we prove this theorem, we recall the process of solving the Kuratowski problem. We first take A = A 1 . Then A 2 = f ( A 1 ) , A 3 = c ( A 2 ) , ⋯ and B 1 = c ( A 1 ) , B 2 = f ( c ( A 1 ) ) , B 3 = c f c ( A 1 ) , ⋯ and so on.

We first let l be the maximum number of distinct sets generated by A in the above process of Kuratowski’s theorem.

Similarly, we let m be the maximum number of distinct sets generated by B in the above process. In order to prove Theorem 5.1, we need the following lemmas.

Lemma 6.2. If l = 7 , then | A 4 | ≥ 3 .

Proof. Let A = A 1 . Then A 2 = f ( A 1 ) , A 3 = c f ( A 1 ) = c ( A 2 ) , A 4 = f c f ( A 1 ) , ⋯ and A 7 = c f c f c f ( A 1 ) . It is clear to see that A 3 is an open set and is contained in A 4 . By i = c f c , we see that A 7 is in i ( A 4 ) . Hence, we have A 4 ⊇ A 7 ⊇ A 3 . Thus, | A 4 | ≥ 3 .

By using the identities i = c f c and f = c i c repeatedly, we can prove the following lemmas.

Lemma 6.3. If l ≥ 5, m ≥ 5 , then | A 3 ∩ B 5 | ≥ 2 , | A 5 | ≥ 3 and | B 5 | ≥ 3 .

Lemma 6.4. If l ≥ 5, m ≥ 3 , then | A 5 | ≥ 2 .

In the above section, we have already discussed the boundary structure of a K-set in a topological space X , in particular, we have A 5 = A ∘ − and B 5 = A − ∘ . By notice that the neutral boundary N b ( A ) of a K-set is non-empty, we can easily verify the following lemma.

Lemma 6.5. If the set A is a K-set, that is, the maximal number of relatives is attained, then | A 3 | ≤ 1 and | B 3 | < 1 .

Now, by using the above lemmas, we can prove Theorem 5.1. In fact, we recall that the standard set, the normal set and the abnormal set can all possibly be the K-set of the required components of the boundary of the set A in the topological space all exist, then we see immediately that This result was given by Anusiak and Shum in 1971. (see [

Theorem 6.6. Let X be an n-point set with n ≤ 7 . If A is a subset of X is a K-set under some “good” topology, then the number of non-homomorphic topologies T ( n ) for each n can be determined and is shown by the following table (

n | 1 | 2 | 3 | 4 | 5 | 6 | 7 |
---|---|---|---|---|---|---|---|

1 | 2 | 3 | 5 | 7 | 4 | 6 |

In view of the structure of the boundary of a given set and its seven components in a topological space. We can state the following theorem for a K- set in a topological space.

Theorem 6.7. Let A be a discrete set in a topological space X . If the set A is a K set, then the cardinality of the set A is ≥ 7 , conversely, if the cardinality of the set A is ≥ 7 then it is possible for the set A to be a K set. However, we still do not know whether A will be a K set or not if the cardinality of the set A is 6 or less.

We now discuss some topics related to the closure and the complementation operators.

(A) Abstract algebras.

By an abstract algebra ( X ; F ) , we mean a set X and a family of fun- damental operations consisting of X-valued functions of several variables run- ning over x of X { a , b , ⋯ } and F = { φ , ψ , ⋯ } . We sometimes write ( X ; φ , ψ , ⋯ ) to represent the abstract algebra ( X ; F ) . If A is a non-empty subset of the set X , then the smallest subalgebra containing A which is closed to an algebraic operator Φ is called the algebraic closure of Φ denoted by A ^ of Φ ^ . In application, we call the n-ary operations e k n ( x 1 , ⋯ , x n ) = x k , where ( k = 1 , 2 , ⋯ , n ; n = 1 , 2 , ⋯ ) . The smallest class which contains trivial operations and is closed under composition if these fundamental operations is called the class of algebraic operators. The values of constant algebraic operations are called the algebraic constants. We have the following version of Kuratowski’s theorem in the abstract algebra ( X ; F ) .

Theorem 7.1. can be constructed form A by taking the algebraic closure operation and complementation operator successively in any order.

Remark. According to Kuratowski’s theorem,the maximal number of relatives of a subset A in an n-element topological space X is 2 n ( n ≤ 7 ) . However, the same conclusion does not hold in abstract algebra.It should be noted that the classification of topological spaces by using closure and interior operators was also given by C.E. Aull in 1967 (see [

Example 7.2 Consider the abstract algebra ( X ; F ) = { a , b , c ; φ , ψ } , where φ ( x ) = b , φ ( a ) = b = ψ ( b ) , ψ ( c ) = a . Starting with A = { a } ⊂ X , we have { a ^ } = { a , b } , { c ^ } = X , Φ = { b } . Thus the maximal number generated by { c } ⊂ X is v ( 3 ) = 8 .

By routine verification, we have the following theorem. (see [

Theorem 7.3. Let X be an n-element set. Then there exists an abstract algebra ( X ; F ) and a subset A 1 of X such that, by taking algebraic closure and complementation operations to A 1 , in any order. We obtain we obtain the following results:

1) 2 n relatives of A if n ≤ 3 ;

2) 2 ( n + 1 ) relatives of A if 3 ≤ n ≤ 6 ;

3) 14 relatives of A if n ≥ 6 .

The number of relatives of A cannot be enlarged.

(B) An application of Kuratowski’s theorem in social science.

Suppose that the immigration rule for the Hong Kong citizens to apply to immigrate to the country U is the following:

1) The father can apply himself, his spouses and his dependent children to immigrate with him.

2) The mother can apply herself and her dependent children to immigrate with her.

3) The married son can apply himself, his spouses and his unmarried dependent brothers and sisters in the family to go with him.

4) The married daughter can only apply herself and the unmarried dependent bothers and sisters in the family to go with her.

5) The son in law in the family can only applying himself and his spouses to go with him but not the others.

6) The daughter in law in the family and also the independent children in the family do not have the privilege of application.

Now, Suppose a family have father g , mother m , son a , daughter in law b , daughter d , son in law e , unmarried dependents y .

If the following family members { a , m , d } first apply to immigrate to UK, then the rest of the family apply next.

The question is how many possible cases will be there for this family in total?

The answer is 14 possible cases because this is a typical application of Kuratowski’s theorem and the algebraic closure operator is the immigration rule f .

Let A 1 = { a , m , d } . Then under the above immigration rule, there will be the following 7 cases:

A 2 = f ( A 1 ) = { a , m , d , b , e , y } ;

A 3 = c ( A 2 ) = { g } ;

A 4 = f ( A 3 ) = { g , m , y } ;

A 5 = c ( A 4 ) = { a , b , e , d } ;

A 6 = f ( A 5 ) = { a , b , e , d , y } ;

A 7 = c ( A 6 ) = { m , g } ;

A 8 = f ( A 7 ) = { m , g , y } .

On the other hand, after the father has first applied to immigrate to country U . We have the following situations:

B 1 = c ( A 1 ) = { b , e , g , y } . and then

B 2 = f ( B 1 ) = { b , d , e , m , g , y } ;

B 3 = c ( B 2 ) = { a } ;

B 4 = f ( B 3 ) = { a , b , y } ;

B 5 = c ( B 4 ) = { d , e , g , m } ;

B 6 = f ( B 5 ) = { d , e , g , m , y } ;

B 7 = c ( B 6 ) = { a , b } ;

B 8 = f ( B 7 ) = { a , b , y } = B 4 .

Thus, in this immigration application for the family { a , m , d , b , e , y } , there are at most 14 distinct combinations (see [

(C) The Closure and interior operators in general algebras.

Let f be the closure operator and i = c f c , the interior operator acting on a subset A in a topological space X .

In the literature, a set A in a topological space X is called a regular open set by Halmos if f ( A ) = A . Dually, a set B in X is called regular closed if f i ( B ) = B . Because it has been known in Kuratowski problem that ( i f ) 2 = f i . Thus, if X is a K-space, then X contains simultaneously a regular closed set and a regular open set. It was also noticed by Shum [

We call a mapping φ : L → L an interior operator on the lattice L ( ∧ , ∨ ,0,1 ) if φ is a shrinking mapping, i.e., φ ( A ) ≤ A and is an idempotent mapping, i.e., φ ( φ ( A ) ) = φ ( A ) . The mapping φ is also called meet preserving if φ ( φ ( X ) ) ∧ φ ( Y ) = φ ( X ∧ Y ) .

For the closure operator of a lattice, the reader is referred to [

We give below the following definitions.

Definition 7.4. An interior operator ϕ is said to be a strong interior ope- rator if ϕ is shrinking, idempotent and meet preserving.

Definition 7.5. A sub semilattice S of a complete lattice L is called a closed join subsemilattice, if for all x i ∈ S ⊆ L and V L { x i ∈ S } exists then S u p L { x i ∈ S } ∈ S . In general, a closed join sub-semilattice is not necessarily closed. This fact can be seen in the following example (Diagram 8).

Diagram 8. A closed join sub-semilattice.

In the above lattice, S = { 0 , a , c , 1 } is a join semilattice of L . It is clear that a V L c = b ∉ S . Thus S = { 0 , a , c , 1 } is not a closed join semilattice.

By considering the closed join subsemilattice of a lattice L , we obtain the following result related with the Tarski fixed plank. (see [

For the strong interior operator on a closed join subsemilattice S , we have the following theorem.

Theorem 7.6. The mapping ϕ : L → S defined by ϕ ( x ) = V L { y ∈ S | y ≤ x } is a strong interior operator on S and moreover, S = R a n g e ( ϕ ) = F x ( ϕ ) , the fixed plank of ϕ .

Proof. We first let x ∈ L . Because S is a closed join semilattice in L . Then ϕ ( x ) = V l { y ∈ s | y ≤ x } from L → S is clearly a strong interior operator on S and is also surjective.

Trivially, ϕ is a shrinking mapping and ϕ ( x ) ≤ x for all x ∈ S . Suppose that u ≤ v in L . Then we have ϕ ( u ) = V L { y ∈ S | y ≤ u } = V L Σ 1 and ϕ ( v ) = V L { y ∈ S | y ≤ v } = V L Σ 2 . It can be easily verified that u ≤ v leads to V L Σ 1 ≤ V L Σ 2 . Thus ϕ is an expansive mapping. On the other hand we can check that for all x ∈ S , we have x ∈ Σ x = { y ∈ S | y ≤ x } and thereby V L Σ x ≥ x , that is ϕ ( x ) ≥ x . By the shrinking property of ϕ , we have ϕ ( x ) = x immediately. Thus x is a fixed point under the mapping ϕ . This means that S ≤ F i x ( ϕ ) .

Because ϕ ( ϕ ( x ) ) = V L { y ∈ S | y ≤ ϕ ( x ) = V L Σ ϕ ( x ) } , where

Σ ϕ ( x ) = { y ∈ S | y ≤ ϕ ( x ) } . Hence, if we take x ∈ Σ x , then by definition, we have y ∈ S and y ≤ x . Using the expansive property of ϕ , we get y = ϕ ( y ) ≤ ϕ ( x ) . Consequently, y ∈ Σ ϕ ( x ) , that is, Σ x ⊆ Σ ϕ ( x ) . Thus, we have proved that ϕ ( x ) ≤ ϕ ( ϕ ( x ) ) . Again by the shrinking property of ϕ ( x ) , we get ϕ ( ϕ ( x ) ) ≤ ϕ ( x ) . This proves that ϕ ( x ) = ϕ ( ϕ ( x ) ) and hence ϕ is an idem- potent mapping.

It remains to prove that the mapping ϕ is a meet preserving mapping. Since x ∧ L y ≤ x and x ∧ L y ≤ y , by the shrinking property of ϕ again, we have ϕ ( x ∧ L y ) ≤ ϕ ( x ) ∧ L ϕ ( y ) , also by ϕ ( x ) ≤ x and ϕ ( y ) ≤ y , we have ϕ ( x ) ∧ L ϕ ( y ) ≤ x ∧ L y . Now, we use again the properties of ϕ , we deduce that ϕ ( x ∧ L y ) = ϕ ( ϕ ( x ∧ L y ) ) ≤ ϕ ( ϕ ( x ) ∧ L ( y ) ) ≤ ϕ ( x ∧ L y ) . This proves that ϕ is a strong interior operator of L . Because F i x ( ϕ ) ⊆ R a n g e ( ϕ ) ⊂ S . Therefore, we

have shown that S = R a n g e ( ϕ ) = F i x ( ϕ ) , the fixed plank of ϕ .

Remark 7.7. Theorem 6.5 can also be extended to topological lattices and further modification of the strong interior operator to the so called topological interior operator. In modifying the strong interior operator to the topological interior operator,the additional requirement ϕ ( x ) = 1 is crucial. Thus, the Tarski-like results of subalgebras can also be established in a complete Boolean algebra ( B , ≤ , ∨ , ∧ , ∗ ,0,1 ) by using a topological interior operator. It was stated in [

(D) Galois connection

Let P ( A ) be the power set of a set A , P ( B ) be the power set of a set B . If R ⊆ A × B is a relation between the sets A and B , then, we define the operator σ : P ( A ) → P ( B ) and the operator τ : P ( B ) → P ( A ) as follows:

σ ( x ) = { y ∈ B | ∀ x ∈ X , ( x , y ) ∈ R } , X ⊆ A ;

τ ( y ) = { x ∈ A | ∀ y ∈ Y , ( x , y ) ∈ R } , Y ⊆ B .

Then, we can easily see that

X ⊆ X ′ ⇒ σ ( X ) ≥ σ ( Y ′ ) : Y ⊆ Y ′ ⇒ τ ( Y ) ≥ τ ( Y ′ ) ⊆ τ σ ( X ) : Y ≤ σ τ ( Y ) ,

where X , X ′ are the subsets of A , Y , Y ′ are subsets of B .

One can prove immediately that if A and B are partially ordered sets, then the mappings σ τ and τ σ are the pair of closure operators of A and B respectively. We now call the pair ( σ τ , τ σ ) a Galois connection of the partially ordered sets A and B . In fact, formed by all the transformations of a three dimensional space then we should be able to use all the invariant classes of G to define some kind of geometry and the new geometry will be generated by using some kind of Galois connection pairs. Hence, the affine geometry is closely linked with the invariant classes of geometry under the affine transformations. The relationship of the transformation groups and the invariant classes of geometry under transformations can be regarded as a pair of Galois connection. Thus, we can always make use of group theory to describe the geometry and conversely,we can also describe the extension of fields by using the structures of permutation groups. The set of identities can be used to describe the varieties of algebras concerning invariant properties and vice versa. To link the operation pair (f,i) with some other kinds of Galois connection pairs would be a useful tool in the future to study the recent developing topics in fuzzy algebraic structures, may be in the soft algebraic structures and in theoretical computer Science. There is an increasing need to use some kind of Galois connections to cope with many uncertainty problems of the real world to the existing mathematical systems. The readers are referred to the article on Galois connection by Denecke and Wismath in [

After the concept of Closure introduced by Kuratokski, a topological space was established by using the Kuratowski closure.

Recall that a topological semigroup S is a Hausdorff space endowed with a jointly continuous multiplication which is associative on the space. Therefore, the structure of the topological semigroup is closely related to the topological closure of the topological semigroup S .

Now, let any b ∈ S . Form the semigroup generated by b , that is, 〈 b 〉 = { b , b 2 , ⋯ } . Denote this semigroup by Γ ( b ) . Take the topological closure closure on Γ ( b ) . Then Γ ( b ) is clearly a compact semigroup of S . Consider

the set of accumulation points of Γ ( b ) , that is, K ( b ) = ∩ n = 1 { b i | i ≥ n } ¯ . It was

proved by A. D. Wallace in 1955 that K ( b ) is a minimal ideal of S and is

also a group. This is the well known theorem of A.D. Wallace [

We mention below a theorem concerning the expression of a prime ideal in a compact semigroup.

Theorem 8.1. Let P = J ∘ ( S \ e ) be an open prime ideal in a compact semi- group S with e 2 = e ∈ S . Consider the group H ( e ) , the maximum group generated by the idempotent e ∈ S . Then we have J ∘ ( S \ e ) = J ∘ ( S \ g ) for any group element g ∈ H ( e ) . In other words, the idempotent element e in the open prime ideal J ∘ ( S \ e ) can be replaced by any group element g ∈ H ( e ) .

Proof. We first prove that J ∘ ( S \ e ) ∩ H ( e ) ¯ = ∅ . If J ∘ ( S \ e ) ∩ H ( e ) ¯ ≠ ∅ , then there exists t ∈ J ∘ ( S \ e ) ∩ H ( e ) ¯ . Because J ∘ ( S \ e ) is the maximal ideal contained in the open set ( S − e ) and hence, the open neighborhood of t , namely V ( t ) ⊂ J ∘ ( S \ e ) . Since t ∈ H ( e ) ¯ as well so that the open neighborhood V ( t ) ∩ H ( e ) ≠ ∅ . Now, we let h ∈ V ( t ) ∩ H ( e ) , then we can find an element h − 1 in the group H ( e ) so that e = h h − 1 ∈ J ∘ ( S \ e ) as h ∈ V ( t ) ⊂ J ∘ ( S \ e ) , a contradiction. Thus we have proved that J ∘ ( S \ e ) ⊂ S \ H ( e ) . Because by definition J ∘ ( S \ e ) is the maximal ideal contained in the open set ( S − e ) , consequently, we have J ∘ ( S \ H ( e ) ) ⊂ J ∘ ( S \ e ) . This means that we can always replace the idempotent e 2 = e ∈ J ∘ ( S \ e ) by any group element g ∈ H ( e ) . Thus, the open prime ideal J ∘ ( S \ e ) in the topological semigroup S will have more different expressions. The theorem is proved.

For more information concerning the structure of topological semigroups and the properties of ideals and radicals in a topological semigroup, the reader is refereed to the monograph of Wallace [

In closing this paper, we conclude that the closure and complementation theorem is a very interesting theorem to study, especially the concept of the closure operation has penetrated into many branches in mathematics. My contribution to the Kuratowski Theorem is that I discovered the cardinality of a K-set is seven, that is, a K-set in a topological space contains at least seven points. (see [

We now pose the following open questions for solution.

Open problem Let A be a subset of the set of integers M . Define the Hammer closure of A to be h ( A ) = ∪ n = 1 ∞ { A n } , where n is a positive integer and A n is the cartesian set product of n copies, under usual multiplication. Let c ( A ) be the set complementation of A in M .

1) Find a subset A in M so that A will generate exactly 12 distinct sets by taking h and c successively on A in in any order.

2) Find a subset B in M so that B will generate exactly 10 distinct sets by acting h and c successively on B in any order.

We do not have an answer in hand at this moment for this problem, but Theorem 3.3, Theorem 3.4 and also the description of the boundary of the set A in a topological space have already given some hints to tackle this problem.

As an exercise, the readers are also encouraged to construct a subset A in the real line which will generate exactly 12 distinct subsets and 10 distinct subsets by taking the topological closure operation and the complementation operation, repeatedly on the set A in any order.

Shum, K.P. (2017) A Note on Kuratowski’s Theorem and Its Related Topics. Advances in Pure Mathematics, 7, 383-406. https://doi.org/10.4236/apm.2017.78025