1. The Many-Sorted Clone of Terms of a Fixed Variable
Term is one of an important concepts in universal algebras. In particular, the structures called clones and partial clones of terms of a given type have been widely studied ([
1,
2,
3,
4,
5,
6]). For clones of terms, we refer to [
7], and, for universal algebras, we refer to [
8].
Let be a type of algebra. In this paper, we introduce special terms of type called terms of a fixed variable. We first prove that the set of all terms of a fixed variable of type forms the many-sorted clone. Moreover, under the many-sorted superposition operations, the many-sorted clone obtained satisfies the superassociative law as identity. Using the notion of terms of a fixed variable of type , we introduce hypersubstitutions mapping operation symbols to terms of a fixed variable and study the related closed identities of a fixed variable and closed variety of a fixed variable.
Let be a type of algebras with -ary operation symbols indexed by some non-empty set I (Here, let us consider for all ; let ). Let be an n-elements alphabet of variables, disjoint from the set of all operation symbols . An n-ary term of type is inductively defined by:
- (i)
is an n-ary term of type ; and
- (ii)
if are n-ary terms of type , and if is an -ary operation symbol, then is an n-ary term of type .
The set of all
n-ary terms of type
will be denoted by
. Indeed,
contains the variables
and is closed under finite application of (ii). We then have the many-sorted set of all terms of type
:
For
, define
many-sorted superposition operation
by:
- (i)
if ; and
- (ii)
.
This leads to form the many-sorted algebra or the clone of all terms of type
:
The satisfies the following identities:
- (C1)
;
- (C2)
;
- (C3)
.
Here, are variables, are operation symbols, and are nullary operation symbols. It is observed that, for , (C1) is the associative law where acts as the associative binary operation.
Many sorted algebras of the same kind as the
are said to be abstract clones if they satisfy the identities (C1)–(C3). The following is an example of an abstract clone. Let
V be a variety of one-sorted total algebras of type
, and let
denote the set of all
n-ary identities
satisfied in
V (i.e.,
). We then have the many-sorted quotient algebra:
where
is a congruence generated by
; this,
, is an abstract clone.
A hypersubstitution of type is defined as a mapping such that, for each , . A hypersubstitution can be uniquely extended to the mapping by:
- (i)
if ; and
- (ii)
if .
The set of all hypersubstitutions of type
, denoted by
, forms a monoid under the associative binary operation defined by:
for all
; a hypersubstitution
defined by
for all
acts as an identity; the operation ∘ is composition of functions. The monoid
can be regarded as many-sorted mappings: For
, let
be the set of all indexes such that
with
is an
n-ary. Let
. Then, for
,
, where
. In addition, let
such that, for each
,
denotes the set of all
. Finally, it would be remarked here that, for
,
In order to introduce the main concept of this paper, we need the following. For , the set of all variables of the term t will be denoted by . Hence, we introduce terms of a fixed variable of type as follows:
Definition 1. An n-ary terms of a fixed variable of type τ is inductively defined by:
- (i)
are n-ary terms of a fixed variable; and
- (ii)
if are n-ary terms of a fixed variable, and if for all , then is an n-ary term of a fixed variable.
Let
be the set of all
n-ary terms of a fixed variable of type
; i.e.,
contains
and is closed under finite applications of (ii). Analogous to the case of terms, we have the many-sorted set of terms of a fixed variable of type
:
For example, let us consider the type
with a binary operation symbol
f. Then,
If we consider the type
with 3-ary operation symbol
f, then, for
,
For
, we have
Remark 1. Observe that, for , for some .
The following lemma shows that is closed under the superposition operations.
Lemma 1. For , if , and if , then Proof. We have, by definition of operation
, that
Then, we must show that Equations (1) and (2) hold:
- (1)
; and
- (2)
.
To show Equation (1), we will only show that
; for
,
…,
can be proved similarly. If
, put
(without loss of generality), then
Assume that
such that
Since
and
then
Using Lemma 1, we then have many-sorted mappings
for
. Hence, we obtain another many-sorted algebra:
Moreover, sine , the following theorem follows.
Theorem 1. satisfies (C1)–(C3).
2. Variable Fixed Hypersubstitutions
Based on the set of terms of a fixed variable, we introduce -hypersubstitutions as follows:
Definition 2. A hypersubstitution is called an-hypersubstitutionof type τ if, for all , .
For example, let consider the type with a binary operation symbol f. A hypersubstitution of type such that is an -hypersubstitution. However, of type such that is not an -hypersubstitution.
Let denote the set of all -hypersubstitutions of type .
In order to prove the next results, the following lemma is needed.
Lemma 2. If , then .
Proof. Let
, and let
. We must show that
. It is clear, for
, that
. Assume that
such that
. Since
,
Hence, since
,
is a term of a fixed variable.□
For , let . Define
- (i)
if ; and
- (ii)
.
Thus, an
-hypersubstitution
of type
can be regarded as
. As
, we consider
By Lemma 2, we have that is a subsemigroup of .
The section will be closed with the following useful result.
Theorem 2. The extension of is an endomorphism on .
Proof. Let
. By Lemma 2,
Let , and let . We have to show, by induction on the complexity of that
Let
; put
; then,
Let such that
for all
. Consider
This completes the proof.□
3. Variable Fixed Closure
We begin this section with the following definition.
Definition 3. Let V be a variety of algebras of type τ. An identity in is said to be an-identity of V if for some .
For example, the identity
in the variety of bands (semigroups with the elements are idempotent).
Let
denote the set of all
-identities of the variety
V. Consider
Then,
is a many-sorted equivalence on
. However, this is not an equational theory of type
because it is not closed under substitution.
Now, the definition of -identities was already defined. The purpose of next theorem is to show that the set of such identity is a congruence on the clone of terms of a fixed variable.
Theorem 3. Let V be a variety of (one-sorted algebras) of type τ. Then, is a congruence on .
Proof. That is preserved by the constant fundamental operations of is clear.
Let
, and let
. We must show that
Using Theorem 3, for a variety
V of type
, we have the many-sorted algebra:
Definition 4. Let V be a variety of one-sorted total algebras of type τ. Let be a many-sorted semigroup of -hypersubstitutions of type τ. An -identity of the variety V is said to be an-closed identity of V iffor , , and . In addition, we call V variable fixed closed iffor all , , and . The necessary condition implies that the variety V is variable fixed closed will be given in the theorem as follows:
Theorem 4. Let V be a variety of one-sorted total algebras of type τ. If the congruence is fully invariant, then V is variable fixed closed.
Proof. Assume that
is fully invariant; then,
is a fully invariant congruence on
. Let
. By Theorem 2,
is an endomorphism on
. Then, by assumption,
for all
. Thus,
is a variable fixed closed identity in
V. Hence,
V is variable fixed closed.□
Recall that, for a variety
V of one-sorted total algebras of type
,
is a congruence on
by Theorem 3. We then form the quotient algebra
Note that we have a many-sorted natural homomorphism
such that
Applying the result of Theorem 2, then we obtain the following theorems.
Theorem 5. Let V be a variety of one-sorted total algebras of type τ. If is an identity in , then is variable fixed closed identity of V.
Proof. Assume that
is an identity in
. Let
; then,
is an endomorphism by Theorem 2. Thus,
is a homomorphism. By assumption,
Hence, is a variable fixed closed identity of V.□
Let V be a variety of one-sorted total algebras of type . Define
Thus,
is an equivalence on
.
Theorem 6. Let V be a variety of one-sorted total algebras of type τ. Then, is a congruence on .
Proof. Let ; and let . Then, ; and for all .
We have to show that
for all
. In addition, hence
is a congruence on
. Let
. Since
,
Similarly, since
,
and
.
By
and
,
From
and
, it follows that
Since
is an endomorphism (Theorem 2),
This completes the proof.□