1. Introduction
Many topologies with important applications in mathematics have been defined using some additional mathematical structures. These structures include grills, ideals, filters, and primals. These classical structures are undoubtedly some of the most important objects in topology.
A very interesting area of application for these additional structures is the technique of induced topologies; namely, the creation of a new topology from a given topology derived from ideals, primals, filters, and grills.
The notion of ideal topological spaces was studied by Kuratowski [
1] and Vaidyanathaswamy [
2], a famous method of creating a new topology derived from an ideal. Roughly speaking, if an ideal is given on a topological space, a new topology (called an ideal topology) can be obtained by an ideal-associated local function or its dual operator. This concept was further investigated in various directions by Jankovic and Hamlett [
3,
4,
5,
6], Dontchev et al. [
7], Mandal and Mukherjee [
8] and Mukherjee et al. [
9]. Properties such as the decomposition of continuity, separation axioms, connectedness, compactness, resolvability, and the compatibility of topology with an ideal are central research topics of ideal topological spaces. The classical result is that if a given set is locally of the first category at every point, then it is of the first category proven by Banach [
10] for metric spaces and extended to arbitrary spaces by Kuratowski [
1]. Oxtoby [
11] proved that the union of open sets in the first category is also of the first category. Similar results were found by Kaniewski et al. for an ideal topological space [
12].
The other classical structure of general topology in the literature is the notion of grills. These were introduced by Choquet [
13] and further developed by Mandal [
14], Roy and Mukherjee [
15,
16,
17], Roy and et al. [
18], Thorn [
19] and many others. The main idea is based on a similar course to grill-associated topology. A few operators were introduced, and the basic properties of these operators and induced topologies were studied. Also, the suitability of topology for a given grill was defined. Grill topological spaces are still a focus of research; see Azzam et al. [
20], Kalaivani et al. [
21] and Rajasekaran et al. [
22].
Recently, Acharjee et al. [
23] introduced a new type of structure called primals. They defined the notion of primal topological space by utilizing two new operators and investigated many fundamental properties of this new structure and these two operators. Moreover, the notion of a primal is a dual grill structure. Furthermore, some new studies have been developed regarding primal topological spaces since the introduction of primals; for more details, see [
24,
25,
26,
27].
Filters that are used in general topology to characterize important concepts such as continuity, initial and final structures, compactness, etc., were introduced by Henri Cartan [
28]. They allow for a general theory of convergence in topological spaces when sequences do not suffice. For the purposes of our article, it is sufficient to state that ideals and filters are mutually dual concepts. Similarly, grills and primals are dual. This fact is stated in the literature, but the equality of local functions induced by primals, grills, filters, and ideals has rarely been explicitly proven. The exceptions to this are Kandil et al. [
29] and Renukadevi [
30], where the equality of local functions generated by ideals and grills is proven. Also, a new topology can be induced from a grill and a filter on the same set; see Modak [
31,
32]. At the end of this article, we will provide some other applications, where topological properties characterized by filters can be replaced by other structures; see Modak et al. [
33] and Selim et al. [
34].
In general, we can consider four systems, namely an ideal , a primal , a filter and a grill , on a topological space as in Definition 1. The derivation of a new topology that is finer than the original topology is as follows: The local functions , , and in Definition 1 are derived from , and , and defines the Kuratowski closure operators , , and ; see Definition 3. In the final step, a new topology on X is defined, and denoted by , , and (see Theorem 9). If we look at the achieved results, we can see a striking similarity. In fact, the local functions and topologies generated in this way are equivalent.
The main concept of this article is as follows: Using correspondence between two systems (Theorems 1–6), it is possible to define their equivalence in Definition 2. Two equivalent systems generate the same topology (Theorem 10), and the results achieved in one topology can be used in a topology determined by an equivalent system. In the last section, we will show the application of this equivalence on examples of compatibility and codense topologies.
Definition 1. Let X be a non-empty set. The non-empty systems , , and of subsets of X are respectively called an ideal, a primal, a filter and a grill on X if they satisfy the following conditions in order:
Furthermore, if τ is a topology on X and , for we define four local functions that map the set A in turn into sets with respect to the above-defined ideal, primal, filter and grill.
If is a topological space with an ideal , a primal , a filter , and a grill on X, then the triplets , , and are an ideal topological space, a primal topological space, a filter topological space and a grill topological space, respectively. Let be the families of all ideals, primals, filters and grills on X, respectively. Put . If , then is a -topological space.
2. Main Results
In the following two sections, we present sixteen operators (Theorems 1–6) between the system pairs and study their properties and compositions. Next, the equivalence between and is defined (Definition 2). The equality of local functions and the equality of the generated topologies are proven, provided that and are equivalent.
We define four identity operators as follows:
In the next six theorems, the proofs of items (1)–(10) are the direct consequences of the operators’ definitions and they are left to the reader. The rest will be proven.
Theorem 1. Let and be an ideal and a primal on X, respectively. Define
by ,
by .
Then, and are a primal and an ideal on X, respectively.
Proof. We prove that is a primal.
Since , .
Let and . Then, . Since and is an ideal, , so .
Let . Then, . Since is an ideal, or is not from . So, or . That means is a primal.
We prove that is an ideal.
Since , .
Let and . Then, . Since and is a primal, , so .
Let . Then, , and . So . That means is an ideal.
(11): if and only if for any neighborhood U of x. Then, the last holds if and only if . Finally, the last holds if and only if .
(12): if and only if for any neighborhood U of x. Then, the last holds if and only if . Finally, the last holds if and only if . □
Theorem 2. Let and be an ideal and a grill on X, respectively. Define
by ,
by .
Then, and are a grill and an ideal on X, respectively.
Proof. We prove that is a grill.
Since , .
Let and . Then, . Since is an ideal, , so .
Let . Then, . Since is an ideal, A or B is not from . So, or . That means is a grill.
We prove that is an ideal.
Since , .
Let and . Then, . Since is a grill, , so .
Let . Then, . Since is a grill, . So, . That means is an ideal.
(11): if and only if for any neighborhood U of x. Then, the last holds if and only if . Finally, the last holds if and only if .
(12): if and only if for any neighborhood U of x. Then, the last holds if and only if and if and only if . □
Theorem 3. Let and be a filter and a grill on X, respectively. Define
by ,
by .
Then, , and are a grill and a filter on X, respectively.
Proof. We prove that is a grill.
Since , .
Let and . Then, . Since is a filter and , , so .
Let . Then, . Since is an filter, or is not from . So, or . That means is a grill.
We prove that is a filter.
Since , .
Let and . Then, . Since is a grill and , , so .
Let . Then, , . Then, . So, . That means is a filter.
(11): if and only if for any neighborhood U of x. Then, the last holds if and only if . Finally, the last holds if and only if .
(12): if and only if for any neighborhood U of x. Then, the last holds if and only if . Finally, the last holds if and only if . □
Theorem 4. Let and be a filter and a primal on X, respectively. Define
by ,
by .
Then, and are a primal and a filter on X, respectively.
Proof. We prove that is a primal.
Since , .
Let and . Then, . Since is a filter, , so .
Let . Then . Since is a filter, A or B is not from . So, or . That means is a primal.
We prove that is a filter.
Since , .
Let and . Then, . Since is a primal, , so .
Let . Then, . Since is a primal, . So, . That means is a filter.
(11): if and only if for any neighborhood U of x. Then, the last holds if and only if . Finally, the last holds if and only if .
(12): if and only if for any neighborhood U of x. Then, the last holds if and only if . Finally, the last holds if and only if . □
Theorem 5. Let and be a grill and a primal on X, respectively. Define
by ,
by .
Then, and are a primal and a grill on X, respectively.
Proof. We prove that is a primal.
Since , .
Let and . Then, . Since is a grill and , , so .
Let . Then, . Since is a grill, or is from . So, or . That means is a primal.
We prove that is a grill.
Since , .
Let and . Then, . Since is a primal and , , so .
Let . Then, . Since is a primal, or is from . So, or . That means is a grill.
(11): if and only if for any neighborhood U of x. Then, the last holds if and only if . Finally, the last holds if and only if .
(12): if and only if for any neighborhood U of x. Then, the last holds if and only if . Finally, the last holds if and only if . □
Theorem 6. Let and be a filter and a ideal on X, respectively. Define
by ,
by .
Then, and are an ideal and a filter on X, respectively.
Proof. We prove that is an ideal.
Since , .
Let and . Then, . Since and is a filter, , so .
Let . Then, . Since is a filter, . So, . That means is an ideal.
We prove that is a filter.
Since , .
Let and . Then, . Since and is an ideal, , so .
Let . Then, . Since is an ideal, . So, . That means is a filter.
(11): if and only if for any neighborhood U of x. Then, the last holds if and only if . Finally, the last holds if and only if .
(12): if and only if for any neighborhood U of x. Then, the last holds if and only if . Finally, the last holds if and only if . □
Example 1. In this example, we give a few ideals and the equivalent systems.
- (1)
- (2)
, the ideal of all finite subsets of X (X-infinite)
- (3)
, the ideal of all countable subsets of X (X-uncountable)
- (4)
, an excluded point ideal on X ()
- (5)
, the family of all nowhere dense subsets of . Recall the set A is nowhere dense, if . A set which is not nowhere dense is called somewhere dense. In other words, A is somewhere dense if there exists a non-empty open set G such that .
The equivalent systems:
- (1)
, the primal of all proper subsets of X
, the grill of all non-empty subsets of X
- (2)
is infinite}-primal
is infinite}-grill
is finite}-filter of all co-finite sets
- (3)
is uncountable}-primal
is uncountable}-grill
is countable}-filter of all co-countable sets
- (4)
-primal
}-grill
}-filter
- (5)
is somewhere dense}-primal
is somewhere dense}-grill
is nowhere dense}-filter
Proposition 1. Let . If , then each of the twelve operators from Theorems 1–6 is bijective and . Consequently, and are mutually inverse, so .
Proof. Proposition 1 follows from items (9) and (10) of Theorems 1–6. □
Proposition 2. , , , .
Proof. , and , and ⇔, and , and , respectively. So, , .
, and , and , and , and , respectively. So, , . □
Proposition 3. Let . The following conditions are equivalent:
(1) (2)
(3) (4)
(5) (6)
Proof. :
⇔⇔
:
⇔
:
⇔⇔
:
⇔
:
⇔⇔□
Proposition 4. Let . Then, for 64 possibilities, the equation holds.
Proof. For Propositions 2 and 3, the equation holds for 24 possibilities ( and are mutually different):
Other cases for are trivial:
(12 possibilities), (12 possibilities),
(12 possibilities), (4 possibilities).
□
For a composition of finitely many operators, the domain (co-domain) of the resulting operator is equal to the domain (co-domain) of the first (last) operator and the value of the local function is independent of the operators, as the following theorem states.
Theorem 7. Let , , and . Then, Consequently,
- (1)
- (2)
- (3)
- (4)
Proof. For the first equation, we use mathematical induction. If , it follows from Proposition 4. Suppose the equation holds for . Then,
, as per Proposition 4. The second equation follows from the first one and from Theorems 1–6. □
The set consisting of 16 operators is enclosed under the composition. The results are interpreted by the next diagram.
3. Applications
We have defined 16 operators, which can be expressed by one notation , where . Between the members of and the members of , we can define an equivalence as the next definition states. Note that if , then for some .
Definition 2. Let . is equivalent to if and , where , and . This relation is denoted by .
Lemma 1. For any , , where and . Moreover, ∼ is an equivalence relation.
Proof. Since and , . It is clear that ∼ is reflexive and symmetric. Let . Then, and and , so . □
In the next section, we define a dual operator
(see Hamlett et al. [
4]) with the operator
, a closure
and an interior
operator.
Definition 3. Let . Define the operators
Lemma 2. Let . If , then , , , . Consequently, if , then .
Proof. Suppose . Then, . As per Theorem 7, . The other equalities are obvious. □
Remark 1. It is well known (see, for example, Jankovic and Hamlett [5]) that if an ideal topology , derived from a topology τ on a set X and an ideal on X, is defined by a Kuratowski closure operator , then is finer then τ. A base for is described as and . In the literature, we can find many properties of local functions. The designation of operators is different. For example,
,
in Al-Omari et al. [
24], or
,
in Roy et al. [
18]. We will list some of them below regardless of what system
they apply to.
Theorem 8. Let . Then,
- (1)
,
- (2)
If , then ,
- (3)
,
- (4)
,
- (5)
,
- (6)
If , then ,
- (7)
,
- (8)
.
Proof. Let
. Then
as per Theorem 7. Since all items hold for
(see, Jankovic and Hamlett [
5]), they hold for
analogously. □
Theorem 9. Let . A family is a topology finer then τ and the next conditions are equivalent:
- (1)
,
- (2)
,
- (3)
,
- (4)
,
- (5)
.
Proof. Since is a Kuratowski operator, is a topology.
Let . Then, is closed in . Put . Then, as per Theorem 7. Since F is closed, . That means , so . That means is finer then τ.
(1) ⇒ (2): ⇒⇒ ⇒
(2) ⇒ (3): ⇒ ⇒
(3) ⇒ (4):
⇒
(4) ⇒ (5): ⇒
(5) ⇒ (1): . Inclusion
is clear. That means , so . □
Theorem 10. Let . If , then . Consequently, if , then . A simple base for the open sets of and is described as follows:
,
,
,
, respectively.
Proof. The equality follows from Lemma 2.
As per Remark 1, is a base for . if and only if , where and if and only if , where and (as per Theorem 1 (4)), so if and only if , where and (as per Theorem 4 (5)), so if and only if , where and (by Theorem 3 (4)), so . □
Definition 4. A set A is -small (-small, -small, -small) if (, , ) and A is locally -small (-small, -small, -small) if for any there is a set containing a such that is -small (-small, -small, -small). Let . A topology τ is said to be compatible with if any locally -small set is -small, denoted by . Note the different meanings of the two designations. is a relation between a system from and a topology. On the other hand, is a relation between two systems from as per Definition 2.
Remark 2. Let . Then, , . So, . That means if and , then a set A is -small (locally -small) if and only if A is -small (locally -small) and if and only if . Consequently,
- (1)
If , then .
- (2)
If , then .
- (3)
If , then .
- (4)
If , then .
In the theory of ideal topological spaces, there are several characterizations of compatibility. For
, the most common equivalent conditions are as follows (see, for example, Hamlett and Jankovic [
4] and Jankovic and Hamlett [
5]).
Theorem 11. The following are equivalent:
- (1)
,
- (2)
for every , if , then ,
- (3)
for every , ,
- (4)
for every , if , then ,
- (5)
for every , .
Regardless of the concept we work with, compatibility can be characterized by another equivalent system.
Theorem 12. Let . If , then the following are equivalent:
- (1)
,
- (2)
for every , if , then A is -small,
- (3)
for every , is -small,
- (4)
for every , if , then A is -small,
- (5)
for every , is -small.
Proof. Let , where . Then, . As per Remark 2, if and only if and A is -small if and only if A is -small. Moreover, as per Lemma 2, , . Then, the following are equivalent (note ):
- (1)
,
- (i)
,
- (ii)
for every , if , then A is -small,
- (iii)
for every , is -small,
- (iv)
for every , if , then A is -small,
- (v)
for every , is -small.
- (2)
for every , if , then A is -small,
- (3)
for every , is -small,
- (4)
for every , if , then A is -small,
- (5)
for every , is -small.
□
Remark 3. Using the notion of compatibility in ideal topological space, the corresponding notion can be introduced for any system in the following way. A topology τ is compatible with a primal , a grill and a filter if τ is compatible with the corresponding ideals , and , respectively. Note that in a primal case (see Al-Omari et al. [24]), compatibility is called “a topology suitable for a primal”. Other examples of applications are given at the end of this section. Definition 5. A set A is -big (-big, -big, -big) if A is not -small (-small, -small, -small), and equivalently (, , ). Let . A topology τ is -codense if any non-empty open set is -big.
Remark 4. Let . Then, , , . So, . That means if and , a set A is -big if and only if A is -big and τ is -codense if and only if τ is -codense.
From the theory of ideal topological spaces, we can obtain the following characterization.
Theorem 13. τ is -codense if and only if .
The property of being -codense can be characterized by another equivalent system as the next theorem shows.
Theorem 14. Let . If , then the following are equivalent:
- (1)
τ is -codense,
- (2)
,
- (3)
.
Proof. Let , where . Then, . As per Remark 4 and Theorem 13, τ is -codense if and only if τ is -codense, and τ is -codense if and only if τ is -codense. The last holds if and only if (as per Theorem 7), so . The equivalence follows from equation . □
Finally, one more application in topology is presented. Many topological properties can be characterized by filters. Equivalent characterization can be performed by grills, primals and ideals in the following way. A primal
, a grill
and an ideal
converge to a point
x if the corresponding filters
,
and
converge to
x. Moreover,
,
and
are referred to as an ultraprimal, an ultragrill and an ultraideal if the corresponding filters
,
and
are the ultrafilters. For example, a topological space is Hausdorff (compact) if and only if each primal, grill and ideal have at most one limit (each ultraprimal, ultragrill and ultraideal converges to at least one point); see Modak et al. [
33] and Selim et al. [
34].
Another alternative approach can be used in cases of
-convergence of sequences in metric spaces, where
is an ideal of subsets of the set
of positive integers; see Kostyrko et al. [
35]. Let
be a fixed metric space and
be an ideal of subsets of
. A sequence
of elements of
X is said to be
-convergent to
if for each
the set
belongs to
. The element a is called the
-limit of the sequence
. Equivalent characterization can be performed by primals, grills and ideals in the following way. Let
,
and
be a primal, a grill and a filter, respectively. A sequence
is said to be
-convergent,
-convergent or
-convergent to
, if for each
the set
does not belong to
,
does not belong to
and
belongs to
, respectively. In a similar way, other concepts such as
-convergence,
-limit points and
-cluster points (see Kostyrko et al. [
35]) can be introduced with respect to
. A notion of admissible ideals is important in the study of various relationships. An ideal
is called admissible if any finite set is in
. An equivalent definition for
is as follows.
,
and
are admissible if and only if the corresponding ideals
,
and
are admissible, respectively, and equivalently, if any co-finite set is not in
, any finite set is not in
and any co-finite set is in
, respectively.
4. Direction of Further Research
In this section, we would like to point out possible directions for further research. On the basis of proven facts, we could say that the results established in topological spaces with grills, primals and filters are nothing but the results established in ideal topological spaces. The question is whether it is possible to achieve comparable results derived from more general systems. Before we introduce a general concept, let us recall some trivial cases. Definition 1 applies only to non-trivial systems. In the following remark, we deal with the trivial cases.
Remark 5. If , then , , , are vacuously an ideal, a primal, a grill and a filter, respectively. If , , , , then (power set of X). Then, the following is easy to check. The systems , , and are mutually equivalent; all local functions are equal to ∅ and all induced topologies are discrete. The systems , , , are mutually equivalent, and all local functions are equal to X. They do not induce topologies. The only open set is ∅.
Let us try to derive a local function from a system on which we do not impose any conditions.
Let
be a system of subsets of
X. For a subset A of a topological space
, we define the set
of all points
such that for any neighborhood
U of
x, the intersection
contains a set form
. A triplet
is called a cluster topological space; see Matejdes [
36], Matejdes [
37] and Thangamariappan and Renukadevi [
38], where one can find the basic notions of cluster topological space.
For a trivial case (), we have () for any . In the sequel, we suppose is not trivial, i.e., is a non-empty system of non-empty subsets of X.
Remark 6. Specially, if is an ideal on X, then a cluster system leads to -local function and . If , then and for any . If , then and for any .
Despite the generality of the definition of a cluster system, the following lemma copies the known properties of -local function. Let us mention some of them (compare with Theorem 8).
Lemma 3 - (1)
,
- (2)
if , then ,
- (3)
,
- (4)
and is closed,
- (5)
,
- (6)
if , then ,
In a cluster topological setting, we can introduce the following classification of sets.
Definition 6 ([
36,
37,
38]).
A set is called- (1)
-closed (-open, -dense in itself, -perfect), if ( is -closed, , ).
- (2)
-scattered, if A contains no set from .
- (3)
locally -scattered at a point , if there is an open set U containing x such that is -scattered (i.e., ).
- (4)
locally -scattered, if A is -scattered at any point from A (i.e., ).
- (5)
-nowhere dense, if for any non-empty open set U there is a non-empty open subset H of U such that contains no set from .
An ideal
represents small sets and a set not belonging to
is understood as large. A cluster system also has a similar interpretation. A set from
is understood as large. This means that any set containing a set from
is also large. On the other hand, a set containing no set from
(i.e., an
-scattered set) is small. For example, a set
A is
-small (in the sense of Definition 4) if and only if
A is
-scattered. If we use the terminology of [
12], a set
A locally belongs to
(i.e.,
) if and only if
A is locally
-scattered (i.e.,
).
Despite the many results achieved in [
36,
37,
38]), among other directions of research we could include relationships between the properties
,
and
inspired by a very interesting article [
12] that deals with three abstract versions of the Banach category theorem for an arbitrary ideal which are mutually equivalent for the ideal of meager sets.
Property : If A is a -nowhere dense set, then A is -scattered.
Property : If A is A locally -scattered, then A is -scattered.
Property : The union of any open -scattered sets is -scattered.
It is clear
. Other mutual relations are left for further research (see analogies in [
12]).