Next Article in Journal
Statistical Machine Learning in Model Predictive Control of Nonlinear Processes
Previous Article in Journal
A Multiple Full Mediating Effect in a PLS Hierarchical Component Model: Application to the Collaborative Public Management
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Interior Operators Generated by Ideals in Complete Domains

1
Faculty of Mathematics, Alexandru Ioan Cuza University, 700506 Iaşi, Romania
2
Facutly of Computer Science, Alexandru Ioan Cuza University, 700506 Iaşi, Romania
*
Author to whom correspondence should be addressed.
Mathematics 2021, 9(16), 1911; https://doi.org/10.3390/math9161911
Submission received: 7 June 2021 / Revised: 6 August 2021 / Accepted: 7 August 2021 / Published: 11 August 2021
(This article belongs to the Section Mathematics and Computer Science)

Abstract

:
This article presents some properties of a special class of interior operators generated by ideals. The mathematical framework is given by complete domains, namely complete posets in which the set of minimal elements is a basis. The first part of the paper presents some preliminary results; in the second part we present the novel interior operator denoted by G ( i , I ) , an operator built starting from an interior operator i and an ideal I. Various properties of this operator are presented; in particular, the connection between the properties of the ideal I and the properties of the operator G ( i , I ) . Two such properties (denoted by P i and Q i ) are extensively analyzed and characterized. Additionally, some characterizations for compact elements are presented.
MSC:
AMS 2020 Subject Classification: 06A15; 18B35; 06B35; 06F30

1. Introduction

In potential theory and in the study of harmonic functions, the fine topology is the natural topology for subharmonic functions [1]. A good example of a fine topology is given by the density topology on the real line. The density topology is related to the interior and closure (topological) operators. The interior of a subset S of a topological space X can be defined as the union of all subsets of S that are open in X; it can also be defined as the largest open subset of X contained (as a subset) in S. Interior and closure are dual notions, the interior of S being the complement of the closure of the complement of S.
The density topology is a good example of a topology generated by ideals. The ideals used to generate the density topology is given by the negligible Lebesgue sets; more details are presented in [1]. In other approaches, the ideal of negligible Lebesgue sets is replaced by the ideal of meagre sets (also called sets of first category, namely sets that are small or negligible as a subset of a topological space). The advantage of the meagre sets is that the whole construction could be used in any topological space, and does not depend on the properties of the measure. After these approaches, new ideals were considered to generate specific topologies. In these topologies, the adherence could be expressed by using the elements of the ideal; thus, the interior could be expressed by using the ideal. However, the topological studies do not insist on these aspects (adherence and interior).
Moving to the algebraic theory of domains [2,3], it is worth noting that certain operators with properties similar to that of interior operators appear in Galois connections. Moreover, if we obtain such an operator, we can derive such a Galois connections. Inspired by the developments in potential and topology theory, we investigate the notion of interior generated by an ideal in the framework of domain theory. This article presents the results obtained using this novel approach.

2. Preliminaries

Considering a nonempty set X, by P ( X ) we denote the set of all subsets of X. If ( X , ) is a partially ordered set (poset) and A X , then by A is denoted the upper set of A, namely A = { x X | a A with a x } . The set A is the lower set of A, namely A = { x X | a A with x a } . Given x X , the notation { x } is abbreviated by x , and { x } is abbreviated by x . A subset A X is an upper (lower) set whenever A = A ( A = A ). In addition, the upper bound set of A is denoted by u b ( A ) and the lower bound set of A is denoted by l b ( A ) ; this means that u b ( A ) = { x X | a x for all a A } and l b ( A ) = { x X | x a for all a A } .
For a number α 2 , the set A is called α -directed if for all B A with | B | α we have A u b ( B ) . The 2-directed sets are simply called directed sets. The set A is an α -ideal if it is a lower set and α -directed; the set A is a complete ideal if it is a lower set and α -directed for any cardinal α 2 . If α is a finite cardinal, an α -ideal is simply called ideal. We denote by I α ( X ) the set of α -ideals of ( X , ) , and by I ( X ) the set of ideals of ( X , ) . If L P ( X ) , we denote by L d the family of directed sets of L .
If there exists the smallest element of X, it is denoted by and is called bottom. If there exists the biggest element of X, it is denoted by and is called top. A poset X is called pointed if it has the smallest element. If ( X , ) is a pointed poset, an element x X is called minimal if x and x = { x , } . We denote by m i n ( X ) the set of minimal elements of ( X , ) . If u b ( A ) has the smallest element z, then z is called the supremum of A and it is denoted by A . If l b ( A ) has the biggest element z, then z is called the infimum of A and it is denoted by A . For A = { x , y } , we denote A with x y , and A with x y .
A poset ( X , ) is called a poset or dcpo (directed complete partial order set) if any directed subset of X has supremum; a poset ( X , ) is called complete if each subset of X has supremum and infimum.
Let ( X , ) be a pointed poset, L a nonempty family of subsets of X, and there be a function g : X X . For x , z X we say either that z approximates x relative to ( g , L ) or z is essential part of x relative to ( g , L ) if for each set A L such that there exists A and x A , there is a A such that z g ( a ) ; this is denoted by z ( g , L ) x . We say that x is ( g , L ) -compact if it approximates itself relative to ( g , L ) . When L = P ( X ) and g = 1 X , z ( g , L ) x is denoted by z x , and we say that z approximates x. In addition, x is called simply compact if x is ( 1 X , P ( X ) ) -compact. The set of ( g , L ) -compact elements is denoted by K g , L ( X ) , and the set of compact elements by K ( X ) . More details can be found in [2].
For x X , the set { z X \ { } | z x } is denoted by x . Obviously, x x for all x X . A set B X is called a basis if for all x X \ { } there is ( B x ) = x . A domain is called continuous if it has a basis, and a domain is called algebraic if it has a basis given by compact elements.
Let f : X X be a function. We denote by f i x ( f ) the set of fixed points of f, i.e., { x X | f ( x ) = x } , and by f ( X ) the set { f ( x ) | x X } . A function f is called isotone (antitone) if x y f ( x ) f ( y ) (respectively, f ( y ) f ( x ) ). The composition f g is denoted by f g , and by f g we mean f ( x ) g ( x ) for all x X . The function f : X X is called ( g , L ) -Scott-continuous if f is isotone and for each A L there exists A , then there also exist f ( A ) and g ( f ( A ) ) = g f ( A ) ; f is simply called Scott-continuous if f is ( 1 X , P ( X ) ) -Scott-continuous [3].

3. Complete Domains

A poset ( X , ) is a complete domain if X is complete and m i n ( X ) is a basis. For instance, ( P ( Y ) , ) is a complete domain (for any nonempty set Y). From now on, we consider that ( X , ) is a complete domain.
Proposition 1.
K ( X ) \ { } = m i n ( X ) .
Proof. 
Let us consider x K ( X ) \ { } . Since m i n ( X ) is a basis, x = ( m i n ( X ) x ) . Since x x , there exists m m i n ( X ) x such that x m . Thus, x = m m i n ( X ) . Now let m m i n ( X ) . Since m = ( m i n ( X ) m ) , it follows that m , and there exists x m . Since x , x m m and m m i n ( X ) , it follows that x = m , and so m m . In conclusion, m K ( X ) \ { } . □
Corollary 1.
Any complete domain is an algebraic domain.
Corollary 2.
Let m m i n ( X ) and A m i n ( X ) . Then m A if and only if m A .
Proof. 
Let m A . Since m K ( X ) \ { } , we have m m A , and so there is a A such that m a . Since a m i n ( X ) , then m = a A . □
Let c : X X be the function defined by c ( x ) = { y X | y x = } for all x X . Just to simplify the notation, we use c x instead of c ( x ) .
Proposition 2.
c x = { y m i n ( X ) | y x } for all x X .
Proof. 
Let x X and y m i n ( X ) such that y x . If y x , since y m i n ( X ) and y x y , we have y = y x x , which is a contradiction! Therefore, y x = . Then { y m i n ( X ) | y x } { y X | y x = } , and { y m i n ( X ) | y x } c x .
On the other hand, c x = { y X | y x = } = { ( m i n ( X ) y ) | y x = }   = y x = ( m i n ( X ) y ) . However, y x = ( m i n ( X ) y ) = m i n ( X ) y x = y m i n ( X ) y x = y = { y m i n ( X ) | y x = } { y m i n ( X ) | y x } , and so y x = ( m i n ( X ) y ) { y m i n ( X ) | y x } . Thus, c x { y m i n ( X ) | y x } . □
If x m i n ( X ) , then { y m i n ( X ) | y x } = { y m i n ( X ) | y x } , and c x = ( m i n ( X ) \ { x } ) .
Proposition 3.
If x y then c y c x .
Proof. 
If x y then { z X | z y = } { z X | z x = } , meaning that c y c x . □
Proposition 4.
x c x = for all x X .
Proof. 
If we assume x c x , there is y m i n ( X ) such that y x c x . Since y m i n ( X ) , we have y K ( X ) , and because y c x = { z m i n ( X ) | z x } , there exists z m i n ( X ) such that z x and y z . Then z = y x , which is a contradiction. □
Proposition 5.
x c x = for all x X .
Proof. 
Let x X . Then x c x = ( { y m i n ( X ) | y x } )   ( { y m i n ( X ) | y x } ) =   m i n ( X ) = { z m i n ( X ) | z } = . □
Proposition 6.
If m m i n ( X ) and m x y , then either m x or m y .
Proof. 
x y = ( m i n ( X ) x ) ( m i n ( X ) y ) = ( m i n ( X ) ( x y ) ) . Since m m i n ( X ) , we have m x y if and only if m m i n ( X ) ( x y ) if and only if m m i n ( X ) x or m m i n ( X ) x if and only if m x or m y . □
Corollary 3.
If c x x y , then c x y .
Proof. 
Let m m i n ( X ) such that m c x . Since m x y , it follows that m x or m y . Since m c x , then m x , and so m y . Thus, c x y . □
Proposition 7.
x ( y z ) = ( x y ) ( x z ) for all x , y , z X .
Proof. 
Let x , y , z X . We have x y x ( y z ) and x z x ( y z ) . Let u X such that x y u and x z u , and let m m i n ( X ) such that m x ( y z ) . Since m y z and m K ( X ) , then either m y or m z . Since m x , we have m x y or m x z , and so m u . Thus, x ( y z ) = { m m i n ( X ) | m x ( y z ) } u , and x ( y z ) = ( x y ) ( x z ) . □
Proposition 8.
c ( A ) = { c a | a A } for all A X .
Proof. 
Let A X . Then c ( A ) = { y m i n ( X ) | y A } = { y m i n ( X ) | y a for all a A } { y m i n ( X ) | y a } for all a A . Let v X such that v { y m i n ( X ) | y a } for all a A , and let u m i n ( X ) such that u v . Then, for all a A , there exists y a m i n ( X ) such that y a a and u y a . Since u , y a m i n ( X ) and u y a , it follows that u = y a . Then u a ; hence, u a for all a A , and so u A . Thus, u c ( A ) . It follows that v c ( A ) . Thus, c ( A ) = a A { y m i n ( X ) | y a } = { c a | a A } . □
Proposition 9.
If c x = c y then x = y .
Proof. 
We have c x = { u m i n ( X ) | u x } and c y = { v m i n ( X ) | v y } . Let u m i n ( X ) with u x . Since u c x = c y , there exists v m i n ( X ) such that v y and u v . Then u = v , and u y . It follows that { u m i n ( X ) | u x } = { v m i n ( X ) | v y } , which is equivalent to { u m i n ( X ) | u x } = { v m i n ( X ) | v y } . Then x = { u m i n ( X ) | u x } = { v m i n ( X ) | v y } = y . □
Proposition 10.
c 2 = 1 X .
Proof. 
Let x X . Since c x = { z m i n ( X ) | z x } , we have c 2 x = c ( c x ) = c ( { z m i n ( X ) | z x } ) = { c z | z m i n ( X ) , z x } . Let z m i n ( X ) with z x , and let u m i n ( X ) with u x . Since u z , u m i n ( X ) \ { z } . Then u ( m i n ( X ) \ { z } ) = c z (because z m i n ( X ) ). It follows that x c z . Thus, for each z m i n ( X ) with z x we have x c z , and so x { c z | z m i n ( X ) , z x } = c 2 x . Thus, x c 2 x for all x X .
On the other hand, if x c 2 x then c x c 3 x = c 2 ( c x ) c x . Then c 3 x = c x . Since c ( c 2 x ) = c x , we obtain c 2 x = x . □
According to these results, the mapping c is a bijection.
Proposition 11.
For all A X we have c ( A ) = { c a | a A } .
Proof. 
Let A X . Then c ( { c a | a A } ) = { c c a | a A } = = { a | a A } = A . Thus, { c a | a A } = c c ( { c a | a A } ) = c ( A ) . □

4. Interior Operators over Complete Domains

Definition 1.
Let ( X , ) be a complete domain.
A function i : X X is called an interior operator (over X) if:
1.
i 1 X ;
2.
i 2 = i ;
3.
i ( A ) = i ( A ) for all finite subsets A of X.
Let i be an interior operator. From the third condition applied for A = , we have i ( ) = i ( ) = i ( ) = = . In fact, the third condition is equivalent to i ( ) = and i ( x y ) = i ( x ) i ( y ) for all x , y X . In addition, if x , y X such that x y , then i ( x ) = i ( x y ) = i ( x ) i ( y ) i ( y ) . Therefore, i is isotone. Since i 2 = i , it follows that i ( X ) = f i x ( i ) .
Let I be a nonempty subset of X. For each x X , we define the set
A i , I ( x ) = { m m i n ( X ) | u i ( X ) such that m u and u x I } .
Then, the function g i , I : X X given by
g i , I ( x ) = A i , I ( x ) , A i , I ( x ) , A i , I ( x ) =
is well-defined.
Proposition 12.
If I is a lower subset, then g i , I is antitone.
Proof. 
Given x , y X such that x y , if A i , I ( y ) = then g i , I ( y ) = g i , I ( x ) . We suppose that A i , I ( y ) , and m A i , I ( y ) . Then there exists u i ( X ) such that m u and u y I . If x y then u x u y , and so u x I . Thus, m A i , I ( x ) and m g i , I ( x ) . Hence, g i , I ( y ) g i , I ( x ) . □
In what follows, we assume that I is an ideal of ( X , ) , i.e., I I ( X ) .
Proposition 13.
g i , I ( x y ) = g i , I ( x ) g i , I ( y ) for all x , y X .
Proof. 
Let x , y X . Since x , y x y , we have g i , I ( x y ) g i , I ( x ) , g i , I ( y ) and so g i , I ( x y ) g i , I ( x ) g i , I ( y ) . If g i , I ( x ) g i , I ( y ) = , then g i , I ( x y ) = , and so g i , I ( x y ) = g i , I ( x ) g i , I ( y ) .
We suppose that g i , I ( x ) g i , I ( y ) ; let m m i n ( X ) such that m g i , I ( x ) g i , I ( y ) . Since m g i , I ( x ) = A i , I ( x ) and A i , I ( x ) m i n ( X ) , from Corollary 2 we have that m A i , I ( x ) , and so there exists u 1 i ( X ) such that m u 1 and u 1 x I . Since m g i , I ( y ) = A i , I ( x ) , there is u 2 i ( X ) such that m u 2 and u 2 y I . Let u = u 1 u 2 ; then i ( u ) = i ( u 1 u 2 ) = i ( u 1 ) i ( u 2 ) = u 1 u 2 = u , and so u i ( X ) . In addition, m u . Since u x u 1 x I and u y u 2 y I , we have u ( x y ) = ( u x ) ( u y ) I . Consequently, m A i , I ( x y ) and m g i , I ( x y ) . Thus, g i , I ( x ) g i , I ( y ) = { m m i n ( X ) | m g i , I ( x ) g i , I ( y ) } g i , I ( x y ) . □
Proposition 14.
g i , I ( X ) i ( X ) .
Proof. 
Let x X and m A i , I ( x ) . Then there is u i ( X ) such that m u and u x I . If u g i , I ( x ) , there exists m 1 m i n ( X ) such that m 1 u and m 1 g i , I ( x ) . However, m 1 g i , I ( x ) if and only if m 1 A i , I ( x ) , hence for all v i ( X ) such that m 1 v , we have v x I . Since u i ( X ) such that m 1 u , then u x I , which is a contradiction. Hence u g i , I ( x ) , and then m u = i ( u ) i ( g i , I ( x ) ) . Therefore, g i , I ( x ) i ( g i , I ( x ) ) . Since i ( g i , I ( x ) ) g i , I ( x ) , we have i ( g i , I ( x ) ) = g i , I ( x ) , i.e., g i , I ( x ) i ( X ) . □
Proposition 15.
g i , I g i , I c g i , I .
Proof. 
Let x X and we suppose that there exists m m i n ( X ) such that m g i , I ( x ) and m ( g i , I c g i , I ) ( x ) . Since m g i , I ( x ) if and only if m A i , I ( x ) , there is u i ( X ) such that m u and u x I . Since m g i , I ( c g i , I ( x ) ) if and only if m A i , I ( c g i , I ( x ) ) , it follows that for all v i ( X ) with m v we have v c g i , I ( x ) I . Then u c g i , I ( x ) I , and so there exists m 1 m i n ( X ) such that m 1 u c g i , I ( x ) . Since m 1 c g i , I ( x ) , we have m 1 g i , I ( x ) and m 1 A i , I ( x ) . Because m 1 m i n ( X ) and m 1 u , it follows that u x I , which is a contradiction. To conclude, for all m m i n ( X ) such that m g i , I ( x ) , we obtain m ( g i , I c g i , I ) ( x ) . Thus, g i , I ( x ) = ( m i n ( X ) g i , I ( x ) ) ( g i , I c g i , I ) ( x ) . □
Proposition 16.
i g i , I c .
Proof. 
Let x X , and assume that there is m m i n ( X ) such that m i ( x ) and m g i , I ( c x ) . Since m g i , I ( c x ) if and only if m A i , I ( x ) , we have m A i , I ( x ) . Thus, for all u i ( X ) with m u , we have u c x I . Since m i ( x ) and i ( x ) i ( X ) , we obtain i ( x ) c x I . On the other hand, if i ( x ) x then i ( x ) c x = I , which is a contradiction. Therefore, for all m m i n ( X ) such that m i ( x ) we have m g i , I ( c x ) . Thus, i ( x ) g i , I ( c x ) . □
Corollary 4.
We have i g i , I c i and i i g i , I c .
Proof. 
Since i g i , I c , it follows that i = i 2 g i , I c i . Since i is isotone, it follows that i = i 2 i g i , I c . □
From the previous result, it follows that = i ( ) g i , I c ( ) = g i , I ( ) , and so g i , I ( ) = . More generally, we have the following result.
Proposition 17.
I g i , I 1 ( ) .
Proof. 
Let x I . For all m m i n ( X ) there is u = i ( X ) such that m and u x = x I . Then m i n ( X ) A i , I ( x ) , and so A i , I ( x ) = m i n ( X ) . It follows that g i , I ( x ) = m i n ( X ) = . □
Proposition 18.
g i , I ( x y ) = g i , I ( x c y ) = g i , I ( x ) for all x X and y I .
Proof. 
If x X and y I , then g i , I ( x y ) = g i , I ( x ) g i , I ( y ) = g i , I ( x ) = g i , I ( x ) . Since x c y x , g i , I ( x ) g i , I ( x c y ) . Let m m i n ( X ) such that m g i , I ( x c y ) . Then m A i , I ( x c y ) , and so there is u i ( X ) such that m u and u x c y I . Since u x ( u x c y ) y and y I , we obtain u x I . Thus, m A i , I ( x ) and so g i , I ( x c y ) g i , I ( x ) . □
Proposition 19.
Let U X , U ˜ = { u c y | u U , y I } , L = P ( U ) , and L ˜ = P ( U ˜ ) .
For every function h : X X we have:
1.
K h g i , I , L ( X ) = K h g i , I , L ˜ ( X ) ;
2.
For all u 1 , u 2 U with u 1 u 2 U , we have x K c g i , I , L d ( X ) if and only if for all A L with x A , there exist a 1 , , a n A such that x c g i , I ( a 1 ) c g i , I ( a n ) .
Proof. 
1. Since I , we have U U ˜ and L L ˜ . Therefore, K h g i , I , L ˜ ( X ) K h g i , I , L ( X ) . Let x K h g i , I , L ( X ) and A L ˜ such that x A . If A U ˜ , then for all a A there exist u a U and y a I such that a = u a c y a . Let B = { u a | a A } . Then B L and x A B . Since x K h g i , I , L ( X ) , there is a A such that x h g i , I ( u a ) . Thus, g i , I ( u a ) = g i , I ( u a c y a ) , and so x h g i , I ( a ) . Therefore, x K h g i , I , L ˜ ( X ) .
2. “⇒”: Let x K c g i , I , L d ( X ) and A L such that x A . Let B = { M | M A , M finite } . Then B U and B is directed. Hence, B L d . Since x A = B , there is b B such that x c g i , I ( b ) . Let us suppose that b = { a 1 , , a n } , where a 1 , , a n A . Then c g i , I ( b ) = c g i , I ( a 1 a n ) = c ( g i , I ( a 1 ) g i , I ( a n ) ) = c g i , I ( a 1 ) c g i , I ( a n ) , and so x c g i , I ( a 1 ) c g i , I ( a n ) .
“⇐”: Let x X and A L d such that x A . From the hypothesis, it follows that there exist a 1 , , a n A such that x c g i , I ( a 1 ) c g i , I ( a n ) . Since A is directed, there is a A such that a 1 a n a . Then c g i , I ( a 1 ) c g i , I ( a n ) = c g i , I ( a 1 a n ) c g i , I ( a ) . Therefore, x K c g i , I , L d ( X ) . □
Since I g i , I 1 ( ) , from x I it follows that x g i , I ( x ) . If the converse is true, we say that I has the property P i . Therefore, P i = { I I ( X ) | x g i , I ( x ) implies x I } ; also, P i = { I I ( X ) | I = { x X | x g i , I ( x ) } } .
Proposition 20.
The following statements are equivalent:
1.
I P i ,
2.
x g i , I ( x ) I for all x X .
Proof. 
We suppose that I P i , and consider x X . Since x g i , I ( x ) g i , I ( x ) g i , I ( x ) g i , I ( g i , I ( x ) ) = g i , I ( x g i , I ( x ) ) , then x g i , I ( x ) I .
Conversely, suppose that x g i , I ( x ) I for all x X . If x g i , I ( x ) , then x = x g i , I ( x ) I . Therefore, I P i . □
Remark 1.
If I P i , then I = g i , I 1 ( ) .
Since g i , I is antitone, g i , I ( ) g i , I ( x ) for every x X . A special case is when g i , I ( ) = . We say that I has the property Q i if g i , I ( ) = . Thus, we have Q i = { I I ( X ) | g i , I ( ) = } .
Proposition 21.
The following statements are equivalent:
1.
I Q i ;
2.
i ( X ) I = { } .
Proof. 
I Q i if and only if g i , I ( ) = if and only if A i , I ( ) = if and only if for all m m i n ( X ) and u i ( X ) such that m u we have u I if and only if for all u i ( X ) such that u , u I we have i ( X ) I = { } . □
Proposition 22.
If I Q i , then g i , I = i c over i ( X ) .
Proof. 
Let x i ( X ) and m m i n ( X ) such that m g i , I ( x ) . Then m A i , I ( x ) , and so there is u i ( X ) such that m u and u x I . Since I Q i and u x i ( X ) , we have u x = . Then, since m u , it follows that m x and m c x . Thus, g i , I ( x ) c x and so i ( g i , I ( x ) ) i ( c x ) . Since g i , I ( x ) i ( X ) , then g i , I ( x ) = i ( g i , I ( x ) ) i ( c x ) . According to Proposition 16, it follows that i ( c x ) g i , I ( x ) . Therefore, g i , I ( x ) = i ( c x ) . □
Theorem 1.
G i , I = 1 X g i , I c is an interior operator on X such that i G i , I .
Proof. 
By definition, G i , I 1 X . Let x X . G i , I 2 ( x ) = G i , I ( G i , I ( x ) ) = G i , I ( x g i , I ( c x ) ) = ( x g i , I ( c x ) ) g i , I ( c ( x g i , I ( c x ) ) ) = x g i , I ( c x ) g i , I ( c x c g i , I ( c x ) ) = x g i , I ( c x ) g i , I ( c x ) g i , I ( c g i , I ( c x ) ) = x g i , I ( c x ) , since g i , I ( c x ) ( g i , I c g i , I ) ( c x ) (according to Proposition 15). Hence, G i , I 2 ( x ) = G i , I ( x ) .
Let x , y X . Then G i , I ( x y ) = ( x y ) g i , I ( c ( x y ) ) = ( x y ) g i , I ( c x c y ) = ( x y ) ( g i , I ( c x ) g i , I ( c y ) ) = G i , I ( x ) G i , I ( y ) . In addition, G i , I ( ) = g i , I ( ) = , and so G i , I is an interior operator. Since i 1 X and i g i , I c , it follows that i G i , I . □
To simplify the notation, the operator G i , I is denoted also by G ( i , I ) .
Proposition 23.
i ( X ) G i , I ( X ) .
Proof. 
Since i G i , I 1 X , x = i ( x ) G i , I ( x ) x for all x i ( X ) . Thus, x = G i , I ( x ) G i , I ( X ) . □
Proposition 24.
G i , I i = i G i , I = i .
Proof. 
From Corollary 4, we have i g i , I c i and i i g i , I c . Thus, G i , I i = i g i , I c i = i . In addition, i G i , I = i ( 1 X g i , I c ) = i 1 X i g i , I c = i i g i , I c = i . □
Proposition 25.
1.
G i , I ( X ) { u c ( v g i , I ( v ) ) | u i ( X ) , v X } ;
2.
G i , I ( X ) = { u c ( v g i , I ( v ) ) | u i ( X ) , v X } if and only if g i , I ( v g i , I ( v ) ) = for all v X .
Proof. 
1. Let x G i , I ( X ) . Then G i , I ( x ) = x g i , I ( c x ) = x if and only if x g i , I ( c x ) if and only if c g i , I ( c x ) c x . Therefore, c x = c x = c x ( c g i , I ( c x ) c c g i , I ( c x ) ) = c g i , I ( c x ) ( c x g i , I ( c x ) ) , and so x = g i , I ( c x ) c ( c x g i , I ( c x ) ) = u c ( v g i , I ( v ) ) , where u = g i , I ( c x ) i ( X ) and v = c x .
2. Let u i ( X ) and y X . Then u c y G i , I ( X ) if and only if G i , I ( u c y ) = u c y if and only if G i , I ( u ) G i , I ( c y ) = u c y if and only if u G i , I ( c y ) = u c y if and only if ( u c y ) g i , I ( y ) = u c y if and only if u c y g i , I ( y ) . Thus, u c y G i , I ( X ) if and only if u c y g i , I ( y ) ( )
“⇒”: Let v X . Since i ( X ) , it follows from the hypothesis that c ( v g i , I ( v ) ) = c ( v g i , I ( v ) ) G i , I ( X ) . Then, according to ( ) , we have c ( v g i , I ( v ) ) g i , I ( v g i , I ( v ) ) . However, c ( v g i , I ( v ) ) g i , I ( v g i , I ( v ) ) that implies c v c g i , I ( v ) g i , I ( v ) g i , I ( g i , I ( v ) ) that implies c g i , I ( v ) g i , I ( g i , I ( v ) ) . Then we obtain = g i , I ( v ) c g i , I ( v ) g i , I ( v ) g i , I ( g i , I ( v ) ) = g i , I ( v g i , I ( v ) ) . Thus, g i , I ( v g i , I ( v ) ) = .
“⇐”: Let u i ( X ) and v X . From the hypothesis we have g i , I ( v g i , I ( v ) ) = , and then u c ( v g i , I ( v ) ) = g i , I ( v g i , I ( v ) ) . From ( ) it follows that u c ( v g i , I ( v ) ) G i , I ( X ) . □
Corollary 5.
If I P i , then G i , I ( X ) = { u c y | u i ( X ) , y I } .
From Corollary 5, Propositions 19 and 22, the next result follows.
Proposition 26.
Let L = P ( i ( X ) ) , L ˜ = P ( G i , I ( X ) ) and h : X X be a mapping.
1.
If I P i , then K h g i , I , L ( X ) = K h g i , I , L ˜ ( X ) .
2.
If I P i Q i , then K 1 X , L ( X ) K c i c , L ( X ) = K c i c , L ˜ ( X ) .
Let i 1 , i 2 be two interior operators over X, and I 1 , I 2 I ( X ) .
Remark 2.
If i 1 i 2 and I 1 I 2 , then A i 1 , I 1 ( x ) A i 2 , I 2 ( x ) for all x X .
Moreover, g i 1 , I 1 g i 2 , I 2 and G ( i 1 , I 1 ) G ( i 2 , I 2 ) .
Proposition 27.
If I 1 P i 1 and I 1 I 2 , then g G ( i 1 , I 1 ) , I 2 g i 1 , I 2 .
Proof. 
Let x X and m A G ( i 1 , I 1 ) , I 2 ( x ) . Then m m i n ( X ) and there is u G ( i 1 , I 1 ) ( X ) such that m u and u x I 2 . From I 1 P i 1 , it follows that G ( i 1 , I 1 ) ( X ) = { v c y | v i 1 ( X ) , y I 1 } . Therefore, there is v i 1 ( X ) and y I 1 such that u = v c y , and m v and v x = v ( y c y ) x y ( u x ) . Since I 1 I 2 , y I 1 and u x I 2 , then y ( u x ) I 2 , and so v x I 2 . Hence, m A i 1 , I 2 . It follows that A G ( i 1 , I 1 ) , I 2 ( x ) A i 1 , I 2 , and so g G ( i 1 , I 1 ) , I 2 g i 1 , I 2 . □
Corollary 6.
If i 1 i 2 , I 1 I 2 and I 1 P i 1 , then G ( i 1 , I 1 ) G ( G ( i 1 , I 1 ) , I 2 ) G ( i 2 , I 2 ) .
Proof. 
From Theorem 1, the inequality G ( i 1 , I 1 ) G ( G ( i 1 , I 1 ) , I 2 ) is generally true (without the conditions of the hypothesis). Since g G ( i 1 , I 1 ) , I 2 g i 1 , I 2 g i 2 , I 2 , it follows also that G ( G ( i 1 , I 1 ) , I 2 ) G ( i 2 , I 2 ) . □
Corollary 7.
If I P i , then G ( G ( i , I ) , I ) = G ( i , I ) .
Corollary 8.
If I 1 I 2 and I 1 , I 2 P i 1 , then I 2 P G ( i 1 , I 1 ) .
Corollary 9.
If I P i , then I P G ( i , I ) .
Corollary 10.
If I 1 I 2 , I 1 P i 1 , and I 2 Q i 1 , then I 2 Q G ( i 1 , I 1 ) .
Corollary 11.
If I P i Q i , then I P G ( i , I ) Q G ( i , I ) .
We present some examples of α -ideals having the P i property.
Let us consider ( X , ) a complete domain, α 2 a cardinal number, and A X . We define S α ( A ) by S α ( A ) = { M | M A , | M | α } . If α 2 satisfies α 2 = α and J X is a complete ideal, then S α ( i 1 ( J ) ) I α ( X ) P i . Consequently, if α 2 with α 2 = α , then S α ( i 1 ( ) ) I α ( X ) P i . In addition, if α 2 is a cardinal number with α 2 = α , J X is a complete ideal such that c i c ( J ) J and h { ( i c ) 2 , ( c i ) 2 , i ( c i ) 2 , c ( i c ) 3 , ( c i ) 4 } , then S α ( h 1 ( J ) ) I α ( X ) P i . Thus, if α 2 is a cardinal number with α 2 = α and h { ( i c ) 2 , ( c i ) 2 , i ( c i ) 2 } , then S α ( h 1 ( ) ) I α ( X ) P i .
We also present some examples of α -ideals with the Q i property.
Let ( X , ) be a complete domain, and τ P ( m i n ( X ) ) be a topology. For A m i n ( X ) , we denote by i n t τ A the interior of A relative to τ . The function i : X X defined by i ( x ) = i n t τ ( m i n ( X ) x ) is an interior operator on X. Let α 2 be a cardinal number, I P ( m i n ( X ) ) be an α -ideal relative to inclusion and I = { A | A I } . Then I I α ( X ) and I Q i if and only if τ I = { } .
Let us consider ideals I with the property τ I = { } . From Baire’s theorem, each complete metric space is a Baire space [4]. We get the following result.
Theorem 2.
Let d be a metric on m i n ( X ) such that ( m i n ( X ) , d ) is a complete metric space, let τ be the metric topology and I an 0 -ideal of meagre sets. Then I I 0 ( X ) Q i .
An interesting situation is when m i n ( X ) can be organized as an algebraic domain. In such a case, based on the results presented in [5], we obtain the following result.
Theorem 3.
Let be a partial order on m i n ( X ) such that ( m i n ( X ) , ) is an algebraic domain, τ be the density topology (according to [5]), α 2 be a cardinal number and I be the ideal of all α-unions of τ-nowhere dense subsets of m i n ( X ) . Then I I α ( X ) Q i .

5. Conclusions

Inspired by the developments in topology and potential theory, we defined and studied an interior operator G ( i , I ) generated by a given interior operator i and an ideal I in a complete domain X. We presented various properties of this interior operator, and emphasized the connection between the properties of the ideal I and the properties of the operator G ( i , I ) . Two specific properties denoted by P i and Q i were investigated. Considering l : G ( i , I ) ( X ) X defined by l ( x ) = x for every x G ( i , I ) ( X ) , we obtained a Galois connection between G ( i , I ) ( X ) and X. As future work, we plan to study the properties of this connection, especially in the cases I P i and I Q i , in order to find new properties and a new class of Galois connections. On the other hand, if we consider a Galois connection ( l , u ) between the posets X and Y (with Y being a complete domain), we may expect some conditions such that the function l u could become an interior operator over Y having the form G ( i , I ) , eventually having the properties P i and Q i .

Author Contributions

All authors contributed equally to this work. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Acknowledgments

Many thanks to the anonymous referees for a careful reading of the manuscript, and their useful remarks and comments.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Lukes, J.; Moly, J.; Zaicek, L. Fine Topology Methods in Real Analysis and Potential Theory; Lecture Notes in Mathematics; Springer: Berlin/Heidelberg, Germany, 1986; Volume 1189. [Google Scholar]
  2. Abramsky, S.; Jung, A. Domain theory. In Handbook of Logic in Computer Science; Clarendon Press: Oxford, UK, 1994; Volume 3, pp. 1–168. [Google Scholar]
  3. Gierz, G.; Hofmann, K.H.; Keimel, K.; Lawson, J.D.; Mislove, M.; Scott, D.S. Continuous Lattices and Domains; Cambridge University Press: Cambridge, UK, 2003. [Google Scholar]
  4. Kuratowski, K. Topology; Academic Press: Cambridge, MA, USA, 2014. [Google Scholar]
  5. Rusu, D.; Ciobanu, G. Essential and density topologies of continuous domains. Ann. Pure Appl. Log. 2016, 167, 726–736. [Google Scholar] [CrossRef]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Rusu, D.; Ciobanu, G. Interior Operators Generated by Ideals in Complete Domains. Mathematics 2021, 9, 1911. https://doi.org/10.3390/math9161911

AMA Style

Rusu D, Ciobanu G. Interior Operators Generated by Ideals in Complete Domains. Mathematics. 2021; 9(16):1911. https://doi.org/10.3390/math9161911

Chicago/Turabian Style

Rusu, Dănuţ, and Gabriel Ciobanu. 2021. "Interior Operators Generated by Ideals in Complete Domains" Mathematics 9, no. 16: 1911. https://doi.org/10.3390/math9161911

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop