Generating Sets of the Complete Semigroup of Binary Relations Defined by Semilattices of the Class Σ8(X, 5) ()
1. Introduction
Let
, D is an X-semilattice of unions which is closed with respect to the set-theoretic union of elements from D, f be an arbitrary mapping of the set X in the set D. To each mapping f we put into correspondence a binary relation
on the set X that satisfies the condition
. The set of all such
is denoted by
. It is easy to prove that
is a semigroup with respect to the operation of multiplication of binary relations, which is called a complete semigroup of binary relations defined by an X-semilattice of unions D.
We denote by
an empty subset of the set X or an empty binary relation. The condition
will be written in the form
.
Let
,
,
,
and
. We denote by the symbols
,
,
,
and
the following sets:
Theorem 1.1. Let
be some finite X-semilattice of unions and
be the family of sets of pairwise nonintersecting subsets of the set X (the set
can be repeated several times). If
is a mapping of the semilattice D on the family of sets
which satisfies the conditions
and
, then the following equalities are valid:
In the sequel these equalities will be called formal. The parameters
there exist such parameters that cannot be empty sets for D. Such sets
are called bases sources, where sets
, which can be empty sets too are called completeness sources.
It is proved that under the mapping
the number of covering elements of the pre-image of a bases source is always equal to one, while under the mapping
the number of covering elements of the pre-image of a completeness source either does not exist or is always greater than one (see [1] Theorem 1.1, [2] [3] chapter 11).
Definition 1.1. The representation
of binary relation
is called quasinormal, if
and
for any
,
(see [1] Definition 1.2, [2] , [3] chapter 1.1).
Definition 1.2. Let
. Their product
is defined as follows:
if there exists an element
such that
(see [1] Definition 1.3, [1] , chapter 1.3).
Definition 1.3. We say that an element
of the semigroup
is external if
for all
(see [1] Definition 1.1, [2] [3] Definition 1.15.1).
It is well known, that if B is all external elements of the semigroup
and
is any generated set for the
, then
(see [2] [3] Lemma 1.15.1).
2. Result
Let
be a class of all X-semilattices of unions, whose every element is isomorphic to an X-semilattice of unions
, which satisfies the condition:
(see Figure 1). It is easy to see that
is irreducible generating set of the semilattice D.
Let
is a family of sets, where
is a mapping of the semilattice D onto the family of sets
and
are pairwise disjoint subsets of the set X. Then the formal equalities of the semilattice D have a form:
(2.1)
Here the element
is source of completeness and the elements
are basis sources of the semilattice D. Therefore
since
,
,
,
(see Theorem 1.1).
From the formal Equalities (2.1) immediately follows
(2.2)
2.1. Generating Sets of the Complete Semigroup of Binary Relations Defined by Semilattices of the Class
, When
In the sequel, we denoted all semilattices
of the class
by symbol
, for which
. Of the last inequality from the formal Equalities (2.1) of a semilattise D follows that
, i.e.
.
We denoted by symbols
the following sets:
Lemma 2.1.1. Let
. Then the following statements are true:
a) Let
, then
is external element of the semigroup
;
b) Let
,
. If
and
, then
is external element of the semigroup
;
c) Let
and
. If
, then
is external element of the semigroup
.
Proof. Let
for some
. If quasinormal representation of binary relation
has a form
then
.(2.1.1)
From the formal Equalities (1) of the semilattice D we obtain that:
(2.1.2)
where
for any
and
. Indeed, by preposition
for any
and
since
. Let
for some
. Then
,
for some
and
, i.e. there exists an element
for which
and
. Of this and by definition of a set
we obtain that
since
,
. Thus, we have that
, i.e.
for any
.
Now, let
and
for some
and
,
, then from the Equalities (2.2) follows that
since Z and
are minimal elements of the semilattice D. The equality
contradicts the inequality
.
The statement a) of the Lemma 2.1.1 is proved.
Let
, where
and
, where
for some
. If
, then from the formal equalities of a semilattice D we obtain that
since
is minimal element of the semilattice D. Now, let
.
1) If
and
, then we have
,
which contradicts the inequality
.
2) If
and
, then we have
Last equalities are impossible, since
for any
and
by definition of a semilattice D.
3) If
and
, then we have
Last equalities are impossible since
for any
and
by definition of a semilattice D.
4) If
and
, then we have
Last equalities are impossible since
and
for any
, by definition of a semilattice D.
5) If
and
, then we have
Last equalities are impossible since
and
for any
, by definition of a semilattice D.
The statement b) of the Lemma 2.1.1 is proved.
Let
,
,
and
. If
where
, we consider the following cases:
6)
. Then from the Equality (2.1.2) follows that
, which contradicts the definition of a semilattice D;
7)
.
If
. Then from the Equality (2.1.2) follows that
, or
which contradicts the definition of a semilattice D;
If
. Then from the Equality (1.4) follows that
where
, i.e. there exists such elements
, for which
and
. But such element
don’t exist by definition of a semilattice D.
8)
.
If
. Then from the Equality (2.1.2) follows that
, or
which contradicts the definition of a semilattice D;
If
. In this case analogously for the case 7) we may prove that
and
. But such element
don’t exist by definition of a semilattice D.
9)
.
If
. Then from the Equality (2.1.2) follows that
, which contradicts the definition of a semilattice D;
If
. Then from the Equality (2.1.2) follows that
where
, i.e. there exist such elements
, for which
and
. But such element
don’t exist by definition of a semilattice D.
10)
.
If
. Then from the Equality (2.1.2) follows that
which contradicts the definition of a semilattice D;
If
. Then from the Equality (2.1.2) follows that
where
, i.e. there exist such elements
, for which
and
. But such element
do not exist by definition of a semilattice D.
The statement c) of the Lemma 2.1.1 is proved.
Lemma 2.1.1 is proved.
Let
. By symbols
,
and
we denoted the following sets:
Remark, that the sets
and
are external elements for the semigroup
.
Lemma 2.1.2. Let
. Then the following statements are true:
a) If quasinormal representation of a binary relation
has a form
where
, then
is generating by elements of the elements of set
;
b) If quasinormal representation of a binary relation
has a form
where
, then
is generating by elements of the elements of set
;
Proof. 1). Let quasinormal representation of binary relations
and
have a form
where
,
(see Equalities (2.1) and (2.2)), then
and
if
,
and
. Last equalities are possible since
(
by preposition).
The statement a) of the lemma 2.1.2 is proved.
2) Let quasinormal representation of binary relations
and
have a form
where
,
(see Equalities (2.1) and (2.2)), then
and
if
,
and
. Last equalities are possible since
(
by preposition).
The statement b) of the lemma 2.1.2 is proved.
Lemma 2.1.2 is proved.
Lemma 2.1.3. Let
. Then the following statements are true:
a) If quasinormal representation of a binary relation
has a form
where
, then
is generating by elements of the elements of set
;
b) If quasinormal representation of a binary relation
has a form
where
, then
is generating by elements of the elements of set
;
c) If quasinormal representation of a binary relation
has a form
where
, then
is generating by elements of the elements of set
;
d) If quasinormal representation of a binary relation
has a form
where
, then
is generating by elements of the elements of set
;
e) If quasinormal representation of a binary relation
has a form
where
, then
is generating by elements of the elements of set
;
f) If quasinormal representation of a binary relation
has a form
where
, then
is generating by elements of the elements of set
;
g) If quasinormal representation of a binary relation
has a form
, then
is generating by elements of the elements of set
;
h) If quasinormal representation of a binary relation
has a form
, then
is generating by elements of the elements of set
;
i) If quasinormal representation of a binary relation
has a form
, then
is generating by elements of the elements of set
.
Proof. 1) Let quasinormal representation of a binary relations
,
have a form
where
.
Then from the statement a) of the Lemma 2.1.2 follows that
is generating by elements of the set
,
and
if
,
. Last equalities are possible since
(
by preposition).
The statement a) of the lemma 2.1.3 is proved.
2) Let quasinormal representation of a binary relations
,
have a form
where
.
Then from
and
if
,
. Last equalities are possible since
(
by preposition).
The statement b) of the lemma 2.1.3 is proved.
3) Let quasinormal representation of a binary relations
,
have a form
where
.
Then from the statement b) of the Lemma 2.1.2 follows that
is generating by elements of the set
,
and
if
,
. Last equalities are possible since
(
by preposition).
The statement c) of the lemma 2.1.3 is proved.
4) Let quasinormal representation of a binary relations
,
have a form
where
. Then
and
if
,
. Last equalities are possible since
(
by preposition).
The statement d) of the lemma 2.1.3 is proved.
5) Let quasinormal representation of a binary relations
,
have a form
where
,
(See Equalities (2.1) and (2.2)). Then from the statement b) of the Lemma 2.1.3 follows that
is generating by elements of the set
and from the statement a) of the Lemma 2.1.2 element
is generating by elements of the set
and
if
,
. Last equalities are possible since
.
The statement e) of the lemma 2.1.3 is proved.
6) Let quasinormal representation of a binary relations
,
have a form
where
,
(See Equalities (2.1) and (2.2)). Then from the statement d) of the Lemma 2.1.3 follows that
is generating by elements of the set
and from the statement b) of the Lemma 2.1.2 element
is generating by elements of the set
and
if
,
. Last equalities are possible since
.
The statement e) of the lemma 2.1.3 is proved.
7) Let quasinormal representation of a binary relations
,
have a form
where
,
(see Equalities (2.1) and (2.2)). Then from the statement e) of the Lemma 2.1.3 follows that
is generating by elements of the set
and from the statement a) of the Lemma 2.1.2 element
is generating by elements of the set
and
since representation of a binary relation
is quasinormal.
The statement g) of the lemma 2.1.3 is proved.
8) Let quasinormal representation of a binary relations
,
have a form
where
,
(see Equalities (2.1) and (2.2)). Then from the statement f) of the Lemma 2.1.3 follows that
is generating by elements of the set
and from the statement b) of the Lemma 2.1.2 element
is generating by elements of the set
and
since representation of a binary relation
is quasinormal.
The statement h) of the lemma 2.1.3 is proved.
9) Let quasinormal representation of a binary relation
has a form
then
since representation of a binary relation
is quasinormal.
The statement i) of the lemma 2.1.3 is proved.
Lemma 2.1.3 is proved.
Lemma 2..4. Let
. Then the following statements are true:
a) If
and
, then binary relation
is generating by elements of the elements of set
;
b) If
and
, then binary relation
is external element for the semigroup
.
Proof. 1) Let quasinormal representation of a binary relation
has a form
,
where
, then
. If quasinormal representation of a binary relation
has a form
, where f is any mapping of the set
in the set
. It is easy to see, that
and two elements of the set
belong to the semilattice
, i.e.
. In this case we have
since the representation of a binary relation
is quasinormal. Thus, element
is generating by elements of the set
.
The statement a) of the lemma 2.1.4 is proved.
2) Let
,
, for some
and
for some
. Then from the equality (2.1.1) and (2.1.2) we obtain that
,
since Z is minimal element of the semilattice D.
Now, let subquasinormal representations
of a binary relation
has a form
,
where
is normal mapping. But complement mapping
is empty, since
, i.e. in the given case, subquasinormal representation
of a binary relation
is defined uniquely. So, we have that
, which contradicts the condition
.
Therefore, if
and
, for some
, then
is external element of the semigroup
.
The statement b) of the lemma 2.1.4 is proved.
Lemma 2.1.4 is proved.
Theorem 2.1.1. Let
and
Then the following statements are true:
a) If
, then
is irreducible generating set for the semigroup
;
b) If
, then
is irreducible generating set for the semigroup
.
Proof. Let
and
. First, we proved that every element of the semigroup
is generating by elements of the set
. Indeed, let
be arbitrary element of the semigroup
. Then quasinormal representation of a binary relation
has a form
,
where
and
. For the
we consider the following cases:
1)
. Then
and
by definition of a set
.
2)
. Then
i.e.
and
by definition of a set
.
3)
. Then we have
By definition of a set
we have
, i.e. in this case
and
by definition of a set
.
If
, then from the statement a) and b) of the Lemma 2.1.2 element
is generating by elements
and
by definition of a set
.
4)
. Then we have
.
Then from the statement a)-f) of the Lemma 2.1.3 element
is generating by elements
and
by definition of a set
.
5)
. Then we have
.
If
, then from the statements g), h) and i) of the Lemma 2.1.3 element
is generating by elements
and
by definition of a set
.
If
, then from the statement a) of the Lemma 2.1.4 element
is generating by elements
and
by definition of a set
.
Thus, we have that
is generating set for the semigroup
.
If
, then the set
is irreducible generating set for the semigroup
since
is a set external elements of the semigroup
.
The statement a) of the Theorem 2.1.1 is proved.
Now, let
and
. First, we proved that every element of the semigroup
is generating by elements of the set
. The cases 1), 2), 3) and 4) are proved analogously of the cases 1), 2), 3) and 4) given above and consider case, when
.
If
, then from the statements g), h) and i) of the Lemma 2.1.3 element
is generating by elements
and
by definition of a set
.
If
, then
by definition of a set
.
Thus, we have that
is generating set for the semigroup
.
If
, then the set
is irreducible generating set for the semigroup
since
is a set external elements of the semigroup
.
The statement b) of the Theorem 2.1.1 is proved.
Theorem 2.1.1 is proved.
Theorem 2.1.2. Let
,
and
Then the following statements are true:
a) If
, then the number
elements of the set
is equal to
.
b) If
, then the number
elements of the set
is equal to
.
Proof. Let number of a set X is equal to
, i.e.
. Let
is a group all one to one mapping of a set
on the set M and
are arbitrary elements of the group
,
are arbitrary partitioning of a set X. By symbol
we denote the number elements of a set
. It is well known, that
.
If
, then we have
If
are any two elements partitioning of a set X and
, where
and
. Then number of different binary relations
of a semigroup
is equal to
. (2.1.3)
If
are any tree elements partitioning of a set X and
,
where
are pairwise different elements of a given semilattice D. Then number of different binary relations
of a semigroup
is equal to
. (2.1.4)
If
are any four elements partitioning of a set X and
,
where
are pairwise different elements of a given semilattice D. Then number of different binary relations
of a semigroup
is equal to
. (2.1.5)
If
are any four elements partitioning of a set X and
,
where
are pairwise different elements of a given semilattice D. Then number of different binary relations
of a semigroup
is equal to
(2.1.6)
If
, then quasinormal representation of a binary relation
has a form
,
where
, or a system
are partitioning of the set X.
If the system
, or a system
are partitioning of the set X. Of this and from the equalities (2.1.4), (2.1.5) and (2.1.6) follows that
If
, then by definition of a set
the quasinormal representation of a binary relation
has a form:
,
where
, or
are partitioning of the set X respectively;
,
where
, or
are partitioning of the set X respectively;
,
where
, or
are partitioning of the set X respectively;
,
where
, or
are partitioning of the set X respectively;
,
where
, or
are partitioning of the set X respectively;
,
where
, or
are partitioning of the set X respectively;
,
where
, or
are partitioning of the set X respectively;
,
where
, or
are partitioning of the set X respectively.
Of this and from the equality (2.1.3), (2.1.4) and (2.1.5) follows that
So, we have
Since
.
Theorem 2.1.2 is proved.
2.2. Generating Sets of the Complete Semigroup of Binary Relations Defined by Semilattices of the Class
, When
In the sequel, we denoted all semilattices
of the class
by symbol
for which
. Of the last equality from the formal equalities of a semilattise D follows that
, i.e.
since
,
,
,
.
In this case, the formal equalities of the semilattice D have a form:
(2.2.1)
From the formal equalities of the semilattise D immediately follows, that:
. (2.2.2)
In this case we suppose that
.
By symbols
and
we denoted the following sets:
Lemma 2.2.1. Let
. Then the following statements are true:
a) Let
,
. If
, then
is external element of the semigroup
;
b) Let
,
. If
and
, then
is external element of the semigroup
.
Proof. Let
for some
. If quasinormal representation of binary relation
has a form
then
.(2.2.3)
From the formal equalities (2.2.1) of the semilattice D we obtain that:
(2.2.4)
where
for any
and
. Indeed, by preposition
for any
and
since
. Let
for some
, then
,
for some
and
, i.e. there exists an element
for which
and
. Of this and by definition of a set
we obtain that
since
,
. Thus, we have
, i.e.
for any
.
Now, let
and
for some
and
,
, then from the Equalities (2.2.4) follows that
since Z and
are minimal elements of the semilattice D. The equality
contradicts the inequality
.
The statement a) of the Lemma 2.2.1 is proved.
Let
, where
and
,
for some
. If
, then from the formal equalities of a semilattice D we obtain that
since
is minimal element of the semilattice D.
Now, let
.
1) If
and
, then we have
,
which contradicts the inequality
.
2) If
and
, then we have
Last equalities are impossible since
for any
and
by definition of a semilattice D.
3) If
and
, then we have
Last equalities are impossible since for any
and
by definition of a semilattice D.
4) If
and
, then we have
Last equalities are impossible since
and
for any
, by definition of a semilattice D.
5) If
and
, then we have
Last equalities are impossible since
and
for any
, by definition of a semilattice D.
The statement b) of the Lemma 2.2.1 is proved.
Lemma 2.2.1 is proved.
Let
. We denoted the following sets by symbols
,
and
:
Remark, that the sets
and
are external elements for the semigroup
.
Lemma 2.2.2. Let
. Then the following statements are true:
a) If quasinormal representation of a binary relation
has a form
where
, then
is generating by elements of the elements of set
;
b) If quasinormal representation of a binary relation
has a form
where
, then
is generating by elements of the elements of set
;
c) If quasinormal representation of a binary relation
has a form
where
, then
is generating by elements of the elements of set
.
Proof. 1). Let quasinormal representation of binary relations
and
have a form
where
,
(see Equalities (2.2.1) and (2.2.2)), then
and
if
,
and
. Last equalities are possible since
(
by preposition).
The statement a) of the lemma 2.2.2 is proved.
2) Let quasinormal representation of binary relations
and
have a form
where
,
(see Equalities (2.2.1) and (2.2.2)), then
and
if
,
and
. Last equalities are possible since
(
by preposition).
The statement b) of the lemma 2.2.2 is proved.
3) Let quasinormal representation of binary relations
and
have a form
where
,
(see Equalities (2.2.1) and (2.2.2)), then
,
and
if
,
and
. Last equalities are possible since
,
and
.
The statement c) of the lemma 2.2.2 is proved.
Lemma 2.2.2 is proved.
Lemma 2.2.3. Let
. Then the following statements are true:
a) If quasinormal representation of a binary relation
has a form
where
, then
is generating by elements of the elements of set
;
b) If quasinormal representation of a binary relation
has a form
where
, then
is generating by elements of the elements of set
;
c) If quasinormal representation of a binary relation
has a form
where
, then
is generating by elements of the elements of set
;
d) If quasinormal representation of a binary relation
has a form
where
, then
is generating by elements of the elements of set
;
e) If quasinormal representation of a binary relation
has a form
,
where
, then
is generating by elements of the elements of set
;
f) If quasinormal representation of a binary relation
has a form
,
where
, then
is generating by elements of the elements of set
;
g) If quasinormal representation of a binary relation
has a form
, then
is generating by elements of the elements of set
;
h) If quasinormal representation of a binary relation
has a form
, then
is generating by elements of the elements of set
;
i) If quasinormal representation of a binary relation
has a form
, then
is generating by elements of the elements of set
.
Proof. 1) Let quasinormal representation of a binary relations
,
have a form
where
.
Then from the statement a) of the Lemma 2.2.2 follows that
is generating by elements of the set
,
and
If
,
. Last equalities are possible since
(
by preposition).
The statement a) of the lemma 2.2.3 is proved.
2) Let quasinormal representation of a binary relations
,
have a form
where
.
Then from
and
if
,
. Last equalities are possible since
(
by preposition).
The statement b) of the lemma 2.2.3 is proved.
3) Let quasinormal representation of a binary relations
,
have a form
where
.
Then from the statement b) of the Lemma 2.2.2 follows that
is generating by elements of the set
,
and
if
,
. Last equalities are possible since
(
by preposition).
The statement c) of the lemma 2.2.3 is proved.
4) Let quasinormal representation of a binary relations
,
have a form
where
. Then
and
if
,
. Last equalities are possible since
(
by preposition).
The statement d) of the lemma 2.2.3 is proved.
5) Let quasinormal representation of a binary relations
,
have a form
where
,
(See Equalities (2.2.1) and (2.2.2)). Then from the statement b) of the Lemma 2.2.3 follows that
is generating by elements of the set
and from the statement a) of the Lemma 2.2.2 element
is generating by elements of the set
and
if
,
. Last equalities are possible since
.
The statement e) of the lemma 2.2.3 is proved.
6) Let quasinormal representation of a binary relations
,
have a form
where
,
(see Equalities (2.2.1) and (2.2.2)). Then from the statement d) of the Lemma 2.2.3 follows that
is generating by elements of the set
and from the statement b) of the Lemma 2.2.2 element
is generating by elements of the set
and
if
,
. Last equalities are possible since
.
The statement e) of the lemma 2.2.3 is proved.
7) Let quasinormal representation of a binary relations
,
have a form
where
,
(see Equalities (2.2.1) and (2.2.2)). Then from the statement e) of the Lemma 2.2.3 follows that
is generating by elements of the set
and from the statement a) of the Lemma 2.2.2 element
is generating by elements of the set
and
since representation of a binary relation
is quasinormal.
The statement g) of the lemma 2.2.3 is proved.
8) Let quasinormal representation of a binary relations
,
have a form
where
,
(see Equalities (2.2.1) and (2.2.2)). Then from the statement f) of the Lemma 2.2.3 follows that
is generating by elements of the set
and from the statement b) of the Lemma 2.2.2 element
is generating by elements of the set
and
since representation of a binary relation
is quasinormal.
The statement h) of the lemma 2.2.3 is proved.
9) Let quasinormal representation of a binary relation
has a form
then
since representation of a binary relation
is quasinormal.
The statement i) of the lemma 2.2.3 is proved.
Lemma 2.2.3 is proved.
Lemma 2.2.4. Let
. Then the following statements are true:
a) If
and
, then binary relation
is generating by elements of the elements of set
;
b) If
and
, then binary relation
is external element for the semigroup
.
Proof. 1) Let quasinormal representation of a binary relation
has a form
,
where
, then
. If quasinormal representation of a binary relation
has a form
, where f is any mapping of the set
in the set
. It is easy to see, that
and two elements of the set
belong to the semilattice
, i.e.
. In this case we have
since the representation of a binary relation
is quasinormal. Thus, element
is generating by elements of the set
.
The statement a) of the lemma 2.2.4 is proved.
2) Let
,
, for some
and
for some
. Then from the Equalities (2.2.3) and (2.2.4) we obtain that
,
since Z is minimal element of the semilattice D.
Now, let subquasinormal representations
of a binary relation
has a form
,
where
is normal mapping. But complement mapping
is empty, since
, i.e. in the given case, subquasinormal representation
of a binary relation
is defined uniquely. So, we have that
, which contradicts the condition
.
Therefore, if
and
, for some
, then
is external element of the semigroup
.
The statement b) of the lemma 2.2.4 is proved.
lemma 2.2.4 is proved.
Theorem 2.2.1. Let
and
Then the following statements are true:
a) If
, then
is irreducible generating set for the semigroup.
b) If
, then
is irreducible generating set for the semigroup
.
Proof. The theorem 2.2.1 we may prove analogously of the theorems 2.1.1.
Theorem 2.2.2. Let
,
and
Then the following statements are true:
a) If
, then the number
elements of the set
is equal to
.
b) If
, then the number
elements of the set
is equal to
.
Proof. Let number of a set X is equal to
, i.e.
. Let
is a group all one to one mapping of a set
on the set M and
are arbitrary elements of the group
,
are arbitrary partitioning of a set X. By symbol
we denote the number elements of a set
. It is well known, that
.
If
, then we have
If
are any two elements partitioning of a set X and
, where
and
. Then number of different binary relations
of a semigroup
is equal to
. (2.2.5)
If
are any tree elements partitioning of a set X and
,
where
are pairwise different elements of a given semilattice D. Then number of different binary relations
of a semigroup
is equal to
. (2.2.6)
If
are any four elements partitioning of a set X and
,
where
are pairwise different elements of a given semilattice D. Then number of different binary relations
of a semigroup
is equal to
. (2.2.7)
If
are any four elements partitioning of a set X and
,
where
are pairwise different elements of a given semilattice D. Then number of different binary relations
of a semigroup
is equal to
(2.2.8)
If
, then quasinormal representation of a binary relation
has a form
,
where
, or a system
are partitioning of the set X.
If the system
, or a system
are partitioning of the set X. Of this from the Equalities (2.2.7) and (2.2.8) follows that
If
, then by definition of a set
the quasinormal representation of a binary relation
has a form:
,
where
, or
are partitioning of the set X respectively;
,
where
, or
are partitioning of the set X respectively;
,
where
, or
are partitioning of the set X respectively;
,
where
, or
are partitioning of the set X respectively;
,
where
, or
are partitioning of the set X respectively;
,
where
, or
are partitioning of the set X respectively;
,
where
, or
are partitioning of the set X respectively.
Of this and from the Equality (2.2.5), (2.2.6) and (2.2.7) follows that
So, we have that:
Since
.
Theorem 2.2.2 is proved.