In the chapter below, we introduce a class of functions called products, which play an analogous role to the functions of type used in the definition of cluster operators. For this purpose, we shall need a special type of functions from to . Here, we introduce the general form of such functions.
3.1. The Monoid of Products
Let us consider a Cartesian product , of a directed set and a topological space . denotes the filter base of sections of , more precisely, = , where = . To simplify, we will write instead of , where . Of course, and hence we can contemplate the use of the functions
, where .
Since for any , one can then consider the following compositions
Definition 6. Let be a directed set and let be a topological space. Then, the functions of the form , where n, p, q are non-negative integers such that , will be called the products of the pair , (or simply of ).
By , we will denote the set of all products of .
Adequately to the formulas given in Remark 7, any product of is uniquely determined by the structure of the 2(n + 1)-tuple of the sets of indices as the lemma below shows, where, according to Remark 7 (ii), we will use the notations:
= for ;
= for .
We will, in the lemma below, introduce a uniform denotation for these two types of index sets as follows:
for .
Lemma 13. Let n, s, q be non-negative integers such that and . Then, any 2(n + 1)-tuple of index sets of is of the form
any product is of the form
.
Proof. According to Remark 7, belongs to the domain of and thus,
=
.
By the definition, we have and in this exposition of , we have used the following sequence of sets of indices:
Analogously, =
and, by definition, So, we have used the following sequence of sets of indices
.
Finally,
and, we have used the following sequence of sets of indices
.
So, , and taken together show that any 2(n + 1)-tuple of index sets of is of the form
Remark 11. With the above lemma, we can see that the equivalences established in Remark 7 (iv) take the following form:
if and only if ,
where and .
Theorem 2. Let be a topological space, and a directed set. Then, the set of all products of forms an Abelian monoid under the operation ⊕ defined by
,
The monoid is generated by the subset of all six products of the form .
Proof. The axioms for commutative monoids are clearly fulfilled. We will show that is generated by the family
and , where .
Let us consider the functions defined by
for all and .
Firstly, we will show that
Indeed, basing on the description and given in the proof of Lemma 3, we have
,
and = , where, according to the notation of Remark 7 and Lemma 3, we have (X) for j = 1, 2, … and . So, any 2(n + 1)-tuple of index sets of such description of belongs to
.
It follows by definition, that
, where
= , = , i and . So, any 2k-tuple of index sets of belongs to
and consequently, the structure of is determined by
which corresponds to . Thus, we have proved the equality .
We now show that every product , where , can be presented in the following form:
= ,
where and, belongs to the set of all products of type
, or
, where
For this purpose, let us first note that
= ,
which follows directly from . Next, we note that is of the form or , where .
Now, it is enough to decompose as follows:
.
So, we obtain
= ,
We will now show that is generated by .
Let us take , where and suppose that , where i = 0, 1, … Then, we have
i.e.,
.
If we assume that , where i = 1, 2, … Then,
.
Let us now check the products , where and first suppose that , where i = 0, 1, … Then,
i.e.,
.
If , where i = 1, 2, … Then,
i.e.,
.
So, and together prove that the part of the presentation can be built from the members of the set .
Finally, let us note that for every product , hold
and, according to ,
.
Indeed,
.
Similarly, we have
.
Therefore, the presentation has the form , i.e., one of the following forms:
- (i)
, i = 0, 1, …,
- (ii)
, i = 1, 2, …,
- (iii)
, i = 0, 1, …, or
- (iv)
, i = 1, 2, ….
This finishes the proof. □
3.3. Classical Types of Convergence in Terms of the Convergence Operators
We will show that the convergence operators characterize the classical types of convergence of nets of multifunctions. In this connection, we need to recall some definitions.
For a net,
of subsets
of a topological space
X, a point
is called a limit point (resp. cluster point) of
shortly,
(resp.
) [
32,
55], if for every open subset
such that
, there is
such that
U meets
for each
(resp. for every
there is
such that
U meets
.
We say that a net topologically converges to a subset A, denoted by , if .
By
and
we denote the upper and lower limits in the sense of the set-theory, i.e., the set and , respectively.
The concepts of convergence of nets of subsets and convergence of nets of multi-functions are closely related. Generally, one could consider the following properties for a given multifunction , a net of multifunctions and a point :
(PC1) ;
(PC2) ;
(PC3) ;
(PC4) ;
(PC5) ;
(PC6) ;
(PC7) .
For the graphs of multifunctions, one can formulate conditions analogous to the above.
(GC1) ;
(GC2) ;
(GC3) ;
(GC4) ;
(GC5) ;
(GC6) ;
(GC7) .
The theorem below shows that the types of convergences listed above can be characterized in terms of convergence operators.
Let us first recall some definitions. A subset B of a topological space is
-paracompact [
56], if every open cover of B has a locally finite open covering refinement.
We will use the following two properties of -paracompact subsets:
For every −paracompact subset B of a regular topological space and for every open subset W with there exists an open subset V such that ;
For every −paracompact subset B of a topological space and for every point there exist disjoint open subsets V and W such that and .
Theorem 3. The following conditions hold for an arbitrary net of multifunctions , a multifunction and a point
- (i)
if and only if ;
- (ii)
if and only if ;
- (iii)
if and only if ;
- (iv)
if and only if ;
- (v)
if is and the values of F are α-paracompact, then
- (a)
whenever ;
- (b)
whenever ;
- (c)
whenever ;
- (d)
whenever .
Proof. (i): According to the definition,
.
The assumption , implies that, for every , we have because . Consequently, according to , for every open set W containing y, there exists such that for every , , i.e., , which proves that .
Now, conversely, assume that . Since is a closed subset in the space , it is enough to show that for every , the property implies that . So, let us take such that , i.e., ; then, and consequently, there exists such that for every , or equivalently, . Thus, using Remark 1, we get for some and, according to (1) we have .
Proof of . It is clear that
The assumption that for all , and for some and , implies , i.e., and consequently we obtain . According to , we get
i.e.,
there exists such that for every
we have for some .
The condition is equivalent to , i.e., for some , so and, according to , this ends the proof that .
For the converse implication, suppose that , i.e., , where and . Then, for every we have for some and according to the assumption, . So, there exists such that for every we have .
The condition is equivalent to the existence of such that , so or equivalently, and consequently, for all . Finally, in accordance with Remark 1, we obtain for all and again Remark 1 yields which means, according to (2), that and finishes the proof.
Proof of : In an entirely analogous way to the above, we have
.
If , and , where , then and consequently, according to (4), for every there exists such that , i.e., . So, .
Now, assume that and let , where . It is enough to show that . It is clear that and therefore by the assumption, for every , there exists such that , i.e., . So, for all and using Remark 1 we get which, according to (4), finishes the proof.
Proof of . Similarly to the previous cases, we note that
If for all , and for some , and , then , equivalently, and therefore, according to (5), we have Consequently, i.e., for every there exist and such that , i.e., . Thus, for some we have thus and the proof that is finished.
Conversely, assume now that , and . It is enough to prove that , i.e., considering (V), that . It is clear that , so for some and therefore, according to that assumption, for every , we have . Hence, for every there exists such that , i.e, there exist and such that . So, or equivalently, and, we have shown that for all . Now, using Remark 1, we get for all , and reusing Remark 1 finished the proof.
Proof of of . Suppose on the contrary that , i.e., for some . Because of the property of and −paracompactness of there exist two disjoint open subsets W and V of Y such that and . Consequently, since , we have , and since , there exists such that , i.e., holds for every . This, according to Remark 1, means that , i.e., by (I), . Since, according to Lemma 1, , we obtain which gives a contradiction.
Proof of . Let us assume on the contrary that , i.e., that there exists such that . Then, the property of the space and the paracompactness of imply the existence of two disjoint open subsets W and V of Y such that and . Therefore, since , we have . But, analogously to (2), . So, the following holds for some :
for every there exists such that
for all .
Of course, , hence there exists such that for all we have , i.e., for some , which contradicts because .
The proof of goes analogously to (a). The assumption that implies the existence of two disjoint open subsets W and V of Y that satisfy the following conditions: and . So, or equivalently, which implies and gives a contradiction.
The proof of . Analogously to the proof of , let us assume that there exist such that , and disjoint open subsets W and V of Y such that and . Consequently, we have or equivalently, which means that, for some , the following holds:
there exists such that for every we have
for all .
Since , for every there exists such that , i.e., for some . This gives, in accordance with , , i.e., we have a contradiction. □
Let us quote some direct conclusions of the above theorem.
Corollary 1. Let be a net of multifunctions from a topological space to a topological space , a multifunction whose values are α-paracompact and let . Then, the following statements hold:
- (i)
If and ,
then ;
- (ii)
If and ,
then ;
- (iii)
If and ,
then ;
- (iv)
If and ,
then ;
- (v)
If and ,
then ;
- (vi)
If and ,
then .
The property
is called topologically convergence in point [
57], topologically convergence [
58], or pointwise topologically convergence [
59].
The property
is called topological convergence in graphs [
57], graph convergence [
58], topological convergence [
60,
61], Hausdorff topological convergence of graphs [
62], or topologically graph convergence [
59].
The set
(resp.
) is called the topological upper Kuratowski limit of
(resp. the pointwise upper Kuratowski limit of
at
x) in [
23,
24,
63].
It is easy to check [
64], (Lemmas 1.4 and 1.5), that the property
is equivalent to the lower pointwise convergence defined in [
65] as follows:
Definition 9. A net of multifunctions is said to be lower (resp. upper) pointwise convergent to at if for each open subset such that ) (resp. ), there exists such that (resp. ) for all . Equivalently,
lim inf (resp. lim inf ) for every open subset such that (resp. .
Remark 12. As we can see (Theorem 3 (i)), the lower pointwise convergence can be characterized by the following three equivalent sentences:
- (i)
implies lim inf for every open ;
- (ii)
;
- (iii)
.
In the case of the upper pointwise convergence, analogously as in the proof of Theorem 3 (i), one can prove that this property is characterized by the following two equivalent sentences:
- (iv)
implies lim inf for every open ;
- (v)
.
Remark 13. The reasoning analogous to the above remark leads to the following two types of equivalent sentences:
Type lower:
- (i)
implies lim sup for every open ;
- (ii)
;
- (iii)
.
Type upper:
- (iv)
implies lim sup for every open ;
- (v)
.
Those types of convergence are called the lower pointwise sub convergence and upper pointwise sub convergence [
66], respectively.
Analogously to Remark 12, below we present the characterizations of the global version of the point types of graph convergences defined as follows:
Definition 10. A net of multifunctions is said to be lower (resp. upper) graph-convergent to at [65], if (resp. ) for every open subset such that (resp. . Remark 14. The following two lists of sentences present equivalent characterizations, respectively, for the lower and upper graph-convergence at all points
Type lower:
- (i)
implies for every open subset
and all ;
- (ii)
;
- (iii)
.
Type upper:
- (iv)
implies Li for every open subset
and all ;
- (v)
.
The equivalence of (ii) and (iii) is proved in Theorem 3 (ii). We will show that (i) and (ii) are equivalent, as well as the sentences (iv) and (v).
Proof. If , and W is an open subset of Y such that , i.e., , then there exists such that for every open subset U of X containing x we have . Consequently, there exists such that for all . The property means that, for some we have and hence which ends the proof that .
Conversely, if and for some open subsets and , then and therefore, . According to (i), we have and consequently, there exists such that for all . The property means that for some which implies the existence of such that . This proves that .
To prove the equivalence of (iv) and (v) let us assume that and let , i.e., , for some open subset , which means that . Therefore, , i.e., . Consequently, for every open set U containing x there exists such that, for all , , i.e., for some or equivalently, . So, .
Conversely, assume that (iv) holds and let , where . Then, , i.e., and, according to the assumption, Li . So, for every open set U containing x there exists such that for all , , i.e., for some . It means that for all which, according to Remark 1, gives . In the same way, one can show that which is equivalent to and finishes the proof. □
The replacement of the
operation by the
in Definition 10 gives the type of convergence called the lower (resp. upper) graph-subconvergence at the points [
66]. Analogously to the remark above, we obtain the following characterizations.
Remark 15. The following two lists of sentences give equivalent characterizations, respectively, for the lower and upper graph-subconvergence at all points
Type lower:
- (i)
implies for every open subset
and all ;
- (ii)
;
- (iii)
.
Type upper:
- (iv)
implies Ls for every open subset
and all ;
- (v)
.
The equivalence of (ii) and (iii) is proved in Theorem 3 (iv). The proof that (i) and (ii) are equivalent is quite analogous to that in Remark 14. We will show the equivalence of (iv) and (v).
Proof. If i.e., and , then , i.e., . So, for every open set U containing x and there exist and such that , i.e., which proves that Ls .
Conversely, assume that (iv) holds and let , where . Then, and, according to the assumption, Ls . So, for every open set U containing x and there exists such that , i.e., for some , or equivalently, for every and . Hence, in accordance with Remark 1.1 we get , i.e., or equivalently, , which finishes the proof. □
In the present work, we are particularly interested in the concept of convergence defined by O. Frink in [
67]:
Definition 11. A net of functions ) is said to be:
- (i)
Continuously convergent to ) at if, for each open subset such that there exists an open subset U containing x and such that for all and ;
- (ii)
Quasi-continuously convergent to ) at if, for each open subset such that there exists an open subset U containing x such that for every there exists such that for all .
The basic result concerning those types of convergence is the following:
Theorem 4 ([
67]).
Let be a net of functions from a topological space X to a regular topological space Y convergent pointwise to a function . Then, f is continuous if and only if the convergence is quasi-continuous. This leads to the following conclusion:
Corollary 2 ([
67]).
The limit f of a continuously convergent net of functions from a topological space X to a regular topological space Y is continuous. The continuous convergence was extended to the case of multifunctions in [
57] as follows.
Definition 12. A net of multifunctions ) is said to be lower (resp. upper) continuously convergent to F at x, if for each open subset such that (resp. ), there exists an open subset U containing x and such that (resp. ) for all and .
Remark 16. It follows directly from the definition that a net of multifunctions ) is lower (resp. upper) continuously convergent to F at x if and only if for every open subset ,
These types of convergence have the following characterization in terms of convergence operators.
Lemma 14. A net of multifunctions is lower (resp. upper) continuously convergent to at a point if and only if (resp. ).
Proof. According to the definition,
Analogously,
So, (resp. ) is equivalent to the existence of an open subset containing and such that for all and , (resp. ). Moreover, of course, the condition (resp. ) means that (resp. ) and the proof is finished. □
Remark 17. A simple analysis of the above proof shows that
.
Using Theorem 3 (v), (d), we immediately get the following fact:
Corollary 3 ([
56], Theorem 3.2 (2)).
If is a topological space and the values of are α-paracompact, then the upper continuous convergence of to F at any point implies that . Proceeding analogously as in the case of continuous convergence, one can define quasi-continuous convergence for multifunctions as a generalization of Frink’s notion of quasi-continuous convergence for single-valued functions as follows.
Definition 13. A net of multifunctions ) is said to be lower (resp. upper) quasi-continuously convergent to ) at if, for each open subset such that (resp. ), there exists an open subset U containing such that for every there exists such that (resp. ) for all .
Remark 18. Analogously to Remark 16, we can say that a net of multifunctions ) is lower (resp. upper) quasi-continuously convergent to F at x if and only if for every open subset ,
The characterization of these types of convergence in terms of the convergence operators may be proven in an entirely analogous manner to such characterization for the continuous convergence given in the previous lemma.
Lemma 15. A net of multifunctions is lower (resp. upper) quasi-continuously convergent to at a point if and only if (resp. ).
Proof. It is enough to observe that, by definition, for any point , we have
and analogously,
. □
A direct generalization and extension of Frink’s result take the form of the following pair of theorems. We omit the proof because those theorems immediately follow from a general theorem about the continuity of the limit multifunctions, which we will state in the next chapter.
Theorem 5. If is a net of multifunctions from to a regular topological space , then for every multifunction the following hold:
- (i)
Under the assumption that ,
the lower quasi-continuous convergence at implies that .
- (ii)
If is α-paracompact, then under the assumption that
, the upper quasi-continuous convergence at
implies that .
Theorem 6. If is a net of multifunctions from to , then for every multifunction the following hold:
- (i)
Under the assumption that ,
implies the lower quasi-continuous convergence at .
- (ii)
Under the assumption that ,
implies the upper quasi-continuous convergence at .
Remark 19. In the case of single-valued functions, the assumption means the pointwise convergence, so Theorem 5 is an extension of Frink’s result to multifunctions. What is more, in the case of single-valued functions, the assumption is weaker than the pointwise convergence. Thus, Theorem 5 improves Frink’s result in the part concerning the sufficient condition for the continuity of the limit functions.
Indeed, if the single-valued functions , are interpreted as multifunctions F and given by and , respectively, for all , then we have , or equivalently, and of course, .
Analogously, and, because we are using the function given by for , the following four conditions are equivalent for any open subset and :
;
;
;
.
Of course, for the same reasons, for any open subset and , the following three conditions are equivalent:
So, the pointwise convergence of a net to a function f can be phrased in one of the following two equivalent ways:
;
.
Analogously, according to Lemmas 14 and 15, the continuous convergence (resp. quasi-continuous convergence) at a point in the sense of Frink means that
(resp. ) or equivalently,
(resp. ).
Finalle, let us note that the condition considered in the case of single-valued functions, means
or equivalently,
.
And, this condition turns out to be weaker than the pointwise convergence because it means that ⊂
for all open subset , whereas the pointwise convergence means that ⊂
for all open subset .
3.5. The Monoid of Convergence Operators
The basic idea in this chapter is to consider the binary operation
,
where denotes the set of all convergence operators for given (), and .
It is easy to see that the operator is the neutral element for this operation. We will denote this operator by adequately to the notations used in Theorem 2.
The associativity of the operation ⊙ can be shown in the same manner as in the proof of Lemma 8. So, the set forms a monoid.
In this chapter, we will consider the question of how many convergence operators are there. An application of the lemma below significantly narrows down the search area.
Lemma 16. Any convergence operator can be presented in the following form
,
where or, both s and q are even numbers.
Proof. Assume that there exists a convergence function
such that s≠q and s is an odd number.
We will show that
=
for some even number .
Let us consider the segment of our convergence function. It is clear that this segment has one of the following forms:
- (i)
;
- (ii)
;
- (iii)
;
- (iv)
.
The following equalities for the cases (i), (ii) and (iii) follow directly from the definition of the functions u and l:
(i.e., );
(i.e., );
(i.e., ).
We will prove that the following equality, corresponding to the case (iv), is also true:
.
According to the definition of convergence function and Lemma 13 we have
and
.
Of course, the number is even, so and this means that depends on . Therefore, denoting by the function defined on the product by
for all , we obtain
.
Now, using Remark 11 for the case that , since and of course , we have
.
So, the structure of is represented by the sequence
, i.e., the structure of . Therefore,
=
.
We will show that
=
.
So, it is enough to prove that
= , i.e., the family
is equal to the family
.
For this purpose, let us note that . So,
for all .
Therefore, and thus, because the set is closed in the space .
Now let us observe that because , so
which means that and ends the proof of the equality .
Now, let us consider a convergence function
such that s ≠ q and q is an odd number. We will show that
=
for some even number .
Analogously to the previous case (with the number s), let us consider the segment of our convergence function, in one of the following forms:
(v) ;
(vi);
(vii) ;
(viii) .
Of course,
(i.e., );
(i.e., );
(i.e., ).
For the case (viii) we will prove the following equality which will finish the proof of the lemma:
.
Analogously to the first part of this proof, we have
and
.
Since is an even number, we have . So, depends on and denoting by the function given by
for all , we get
.
Using Remark 11 for , we have
.
Therefore,
.
We will show that the family
is equal to the family
.
We claim that
, i.e.,
the family
is equal to the family
.
Indeed, for any and the inclusion
holds.
So,
for any and
hence,
which gives
.
Now let us note that the family belongs to
because of
and consequently, .
But since
for all and any , and consequently, for all we have
. So, .
This proves the inclusion and finishes the proof of the lemma. □
As the above lemma shows, a combination can be an ambiguous description of the operator in the sense of order. The following lemma shows that the descriptions of convergence operators can reduce.
Lemma 17. The following segments of a convergence operator
are equal:
- (a)
(resp. );
- (b)
(resp. );
- (c)
(resp. );
- (d)
(resp. ).
Proof. We will start by showing that for any convergence function
= ,
where s and q are even numbers, the segments of the following types one may regard as cluster operators in the sense of Definition 1:
- (i)
for some even number such that ;
- (ii)
for some even number and an odd number k such that
;
- (iii)
for some even number and an odd number p such that
.
This will allow us to use Lemma 7 and Theorem 1.
Of course, the appropriate 2(n + 1)-tuple of index sets of has the form
.
So, consider a segment of for some even number . Then,
.
Of course, and = is a function from X to . Hence,
and therefore we can regard the composition as a cluster operator in the sense of Definition 1.
Let us now consider a segment of for some even number and an odd number k such that .
It is clear that
,
where and is defined by
for all .
For this reason, one can write the function
as follows
since
.
So, we can regard the family as a value of the cluster function .
Finally, let us consider a segment of for some even number and an odd number p such that . Then,
, where and is defined by .
Therefore,
.
Thus, the family is a value of the cluster function .
We are now ready to prove that and
.
Applying Lemma 7 (iii)(b) and (a), and the equalities (d) stated in the proof of Theorem 1, we get
. And,
.
Analogously,
.
And,
.
Finally,
.
So, .
Analogously one can prove that and finish the proof of the lemma. □
Theorem 2 shows that the set of all six products of the form , i.e., , generates the monoid of all products of . It is easy to check that these products designate at most the following seven operators:
For simplicity purposes, we will use the following shorter denotes:
,
and .
Below, we will indicate all possible convergence operators and present them in the form of multiplications of members of the collection .
Theorem 11. For given (), , and , the set of all convergence operators contains at most the following non-neutral elements:
- (i)
Specified by ,n = 1, 2, …:
,
,
,
,
,
.
- (ii)
Specified by for an even natural number s:
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
.
- (iii)
Specified by , for an even natural number s:
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
.
- (iv)
Specified by , for an even natural number s:
,
,
,
,
,
,
,
,
,
,
- (v)
Specified by , for an even natural number s:
,
,
,
- (vi)
Specified by for an odd natural number q:
,
,
,
,
,
,
,
,
.
Proof. For a given function and , the composition is a function from X to . So, we can consider the cluster functions in the sense of Definition 1, of type . Thus, any cluster operator designates the function
defined by
for all .
In the first step, we will prove that for any convergence operator
, the following equality holds true:
=
.
Indeed, by definition, for any , we have
=.
According to Lemma 13 we have
{…:
:…}:::
: …}: ::
:…}:
{…:
:…}:::
:…}: ::
:…}:
:
:…}:::
:…}: ::
:…}:
::…}:
:
:…}:::
:…}: ::
:…}:
::…}:
:
:…}:
::
:…}:
::
:…}:
, where in the last two equations, we have used the property noted in Remark 11 and the fact that .
So, and consequently, the value described in is equal to
which proves the equality .
According to Theorem 1, one can use at most the following six non-neutral cluster operators in the formula :
, , , , and .
So, as a consequence of , for any convergence operator
, where ,
there exist at most the following six convergence operators of the type
, namely:
;
;
;
;
;
.
Now, let us observe that any convergence function
is a function from X to . So, any convergence function of the type
is a cluster function in the sense of Definition 1, and consequently, according to Theorem 1, for any convergence operator
, where , we can obtain at most the following convergence operators of the type
:
;
;
;
;
;
.
Now, considering the convergence operators of the type , for a given function and , we define the function by
, for all .
Then, for each point we have
.
But, because of Theorem 1, we know that must be equal to , , , , , or .
So, all possible non-neutral operators of the type are listed in part (i) of the theorem as , , , , and , respectively.
For this reason, we can obtain the following seven types of operators of the form
:
(C1) ;
(C2) ;
(C3) ,
(C4) ;
(C5) ;
(C6) ;
(C7) .
The alternating application of the operations and on the operator , allows for the determination of all convergence operators of the type (C7), i.e., specified by for an even natural number s, listed in part (ii) of the theorem.
Below, in the same way, using the operators listed in part (i) instead of , we will determine all operators of the type (C1), …,(C6), i.e., specified by , or , for an even natural number s. We will consider all possible cases. Next, by applying Lemma 7, and the equalities (d) stated in the proof of Theorem 1 without reference to them and using Lemma 17, we will show that some of the descriptions designate the same operator. As a result, we will indicate all possible operators of this type mentioned in parts (iii), (iv), and (v) of the theorem.
In the case (C1).
Type :
- -
, i.e., ;
- -
, i.e., ;
- -
= =
, i.e., ;
- -
=
, i.e., .
Type :
- -
= =
=, i.e., ;
- -
=
, i.e., ;
- -
= =
, i.e., ;
- -
=
, i.e., .
Type :
- -
=
=, i.e., ;
- -
, i.e., ;
- -
=
, i.e., ;
- -
, i.e., .
Type :
- -
= =
=, i.e., ;
- -
=
, i.e., ;
- -
=
, i.e., ;
- -
, i.e., .
In the case (C2).
Type :
- -
, i.e., ;
- -
, i.e., ;
- -
= =
, i.e., ;
- -
, i.e., ;
- -
=
, i.e., ;
- -
= =
, i.e., .
Type :
- -
, i.e., ;
- -
, i.e., ;
- -
, i.e., ;
- -
, i.e., ;
- -
, i.e., ;
- -
, i.e., .
Type
:
- -
, i.e., ;
- -
, i.e., ;
- -
, i.e., ;
- -
,
, i.e., ;
- -
, i.e., ;
- -
, i.e., .
Type
:
- -
, i.e., ;
- -
, i.e., ;
- -
, i.e., ;
- -
, i.e., ;
- -
, i.e., ;
- -
, i.e., .
Type
:
- -
, i.e., ;
- -
, i.e., ;
- -
, i.e., ;
- -
, i.e., ;
- -
, i.e., ;
- -
, i.e., .
In the case (C3).
Type :
- -
, i.e., ;
- -
, i.e., ;
- -
, i.e., ;
- -
, i.e., ;
- -
, i.e., ;
- -
, i.e., .
Type
:
- -
, i.e., ;
- -
, i.e., ;
- -
, i.e., ;
- -
, i.e., .
Type
:
- -
, i.e., ;
- -
, i.e., ;
- -
, i.e., ;
- -
, i.e., .
In the case (C4).
Type :
- -
, i.e., ;
- -
, i.e., ;
- -
, i.e., ;
- -
, i.e., .
Type :
- -
, i.e., ;
- -
, i.e., ;
- -
, i.e., ;
- -
, i.e., ;
- -
, i.e., ;
- -
, i.e., .
Type
:
- -
, i.e., ;
- -
, i.e., ;
- -
, i.e., ;
- -
, i.e., ;
- -
, i.e., ;
- -
, i.e., .
Type
:
- -
, i.e., ;
- -
, i.e., ;
- -
, i.e., ;
- -
, i.e., ;
- -
, i.e., ;
- -
, i.e., .
In the case (C5).
Type :
- -
, i.e., ;
- -
, i.e., ;
- -
, i.e., ;
- -
, i.e., ;
- -
, i.e., ;
- -
, i.e., .
Type
:
- -
, i.e., ;
- -
, i.e., ;
- -
, i.e., ;
- -
, i.e., ;
- -
, i.e., ;
- -
, i.e., .
In the case (C6).
Type
:
- -
, i.e., ;
- -
, i.e., ;
- -
, i.e., ;
- -
, i.e., ;
- -
, i.e., ;
- -
, i.e., .
Type
:
- -
, i.e., ;
- -
, i.e., ;
- -
, i.e., ;
- -
, i.e., ;
- -
, i.e., ;
- -
, i.e., .
Type
:
- -
, i.e., ;
- -
, i.e., ;
- -
, i.e., ;
- -
, i.e., ;
- -
, i.e., ;
- -
, i.e., .
Finally, we will prove that the alternating application of the operations and on the operator leads to the determination of all convergence operators specified by for an odd natural number s, listed in part (vi) of the theorem.
Type :
- -
, i.e., ;
- -
, i.e., ;
- -
, i.e., ;
- -
, i.e., ;
- -
, i.e., ;
- -
, i.e., .
Type :
- -
, i.e., ;
- -
, i.e., ;
- -
, i.e., ;
- -
, i.e., ;
- -
, i.e., ;
- -
, i.e., .
Type :
- -
, i.e., ;
- -
,
, i.e., ;
- -
, i.e., ;
- -
, i.e., ;
- -
, i.e., ;
- -
, i.e., .
Type
:
- -
, i.e., ;
- -
, i.e., ;
- -
, i.e., ;
- -
, i.e., ;
- -
, i.e., ;
- -
, i.e., .
The proof is finished. □
Finally, in the diagrams below, we present the relationships between the studied here operators, where we will use only the numbers used in the denotations of the operators listed in the last theorem.
Diagrams.