2. Main Results
In the following two parts we present sixteen operators (Theorem 1–6) between pairs of systems and their properties and compositions are studied. Next, the equivalence between is defined (Definotion 2). The equality of local functions and the equality of generated topologies are proved, provided that and and equivalent.
Define four identity operators
In the next six theorems the proofs of items (1)–(10) are left to the reader. The rest will be proven.
Theorem 1. Let , be an ideal, a primal on X, respectively. Define
by ,
by .
Then , is a primal, an ideal on X, respectively and
Proof. We prove 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 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 nbhd U of x if and only if if and only if .
(12): if and only if for any nbhd U of x if and only if if and only if . □
Theorem 2. Let , be an ideal, a grill on X, respectively. Define
by ,
by .
Then , is a grill, an ideal on X, respectively and
Proof. We prove 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 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 nbhd U of x if and only if if and only if .
(12): if and only if for any nbhd U of x if and only if if and only if . □
Theorem 3. Let , be a filter, a grill on X, respectively. Define
by ,
by .
Then , is a grill, a filter on X, respectively and
Proof. We prove 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 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 nbhd U of x if and only if if and only if .
(12): if and only if for any nbhd U of x if and only if if and only if . □
Theorem 4. Let , be a filter, a primal on X, respectively. Define
by ,
by .
Then , is a primal, a filter on X, respectively and
Proof. We prove 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 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 nbhd U of x if and only if if and only if .
(12): if and only if for any nbhd U of x if and only if if and only if . □
Theorem 5. Let , be a grill, a primal on X, respectively. Define
by ,
by .
Then , is a primal, a grill on X, respectively and
Proof. We prove 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 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 nbhd U of x if and only if if and only if .
(12): if and only if for any nbhd U of x if and only if if and only if . □
Theorem 6. Let , be a filter, a ideal on X, respectively. Define
by ,
by .
Then , is an ideal, a filter on X, respectively and
Proof. We prove 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 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 nbhd U of x if and only if if and only if .
(12): if and only if for any nbhd U of x if and only if if and only if . □
Proposition 1. Let . If , then each of the twelve operators from Theorem 1-6 is bijective and , consequently and are mutually inverse, so .
Proof. It follows from Theorem 1-6 items (9) and (10). □
Proposition 2. , , , .
Proof.
, , ⇔, respectively. So, , .
, , , respectively. So, , . □
Proposition 3. Let . The next conditions are equivalent
- (1)
(2)
- (3)
(4)
- (5)
(6)
Proof.
:
⇔⇔
:
⇔
:
⇔⇔
:
⇔
:
⇔⇔□
Proposition 4. Let . Then for 64 possibilities the equation holds.
Proof. By Proposition 2 and Proposition 3, the equation
holds for 24 possibilities (
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 (the codomain) of the resulting operator is equal to the domain (codomain) of the first (last) operator and the value of local function is independent on the operators as the following theorem states.
Theorem 7.
Let , and . Then
Consequently,
- (1)
- (2)
- (3)
- (4)
Proof. For the first equation we use the mathematical induction. If , it follows from Proposition 4. Suppose the equation holds for . Then
, by Proposition 4. The second equation follows from the first one and from Theorem 1–6. □
The set consisting of 16 operators is enclosed under composition. The results can be interpreted by the next diagram.
