Next Article in Journal
An Alternative Approach to Measure Co-Movement between Two Time Series
Previous Article in Journal
Responsive Economic Model Predictive Control for Next-Generation Manufacturing
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Clones of Terms of a Fixed Variable

by
Khwancheewa Wattanatripop
1 and
Thawhat Changphas
1,2,*
1
Department of Mathematics, Faculty of Science, Khon Kaen University, Khon Kaen 40002, Thailand
2
Centre of Excellence in Mathematics CHE, Si Ayuttaya Rd., Bangkok 10400, Thailand
*
Author to whom correspondence should be addressed.
Mathematics 2020, 8(2), 260; https://doi.org/10.3390/math8020260
Submission received: 10 January 2020 / Revised: 6 February 2020 / Accepted: 13 February 2020 / Published: 17 February 2020
(This article belongs to the Section Mathematics and Computer Science)

Abstract

:
Let τ be a type of algebras. This paper introduces special terms of type τ called terms of a fixed variable. It turns out that the set of all terms of a fixed variable of type τ forms the many-sorted clone satisfying the superassociative law as identity, under the many-sorted superposition operations. Moreover, based on terms of a fixed variable of type τ , hypersubstitutions of a fixed variable and the related closed identities of a fixed variable and closed variety of a fixed variable are introduced and studied.

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 τ = ( n i ) i I be a type of algebras with n i -ary operation symbols f i indexed by some non-empty set I (Here, let us consider n i N + for all i I ; let N + = { 1 , 2 , } ). Let X n = { x 1 , , x n } be an n-elements alphabet of variables, disjoint from the set of all operation symbols { f i i I } . An n-ary term of type τ is inductively defined by:
(i)
x i X n is an n-ary term of type τ ; and
(ii)
if t 1 , , t n i are n-ary terms of type τ , and if f i is an n i -ary operation symbol, then f i ( t 1 , , t n i ) is an n-ary term of type τ .
The set of all n-ary terms of type τ will be denoted by W τ ( X n ) . Indeed, W τ ( X n ) contains the variables x 1 , , x n and is closed under finite application of (ii). We then have the many-sorted set of all terms of type τ :
W τ ( X ) = ( W τ ( X n ) ) n N + .
For m , n N + , define many-sorted superposition operation
S m n : W τ ( X n ) × ( W τ ( X m ) ) n W τ ( X m )
by:
(i)
S m n ( x i , t 1 , , t n ) = t i if x i X n ; and
(ii)
S m n ( f i ( t 1 , , t n i ) , t 1 , , t n ) = f i ( S m n ( t 1 , t 1 , , t n ) , , S m n ( t n i , t 1 , , t n ) ) .
This leads to form the many-sorted algebra or the clone of all terms of type τ :
c l o n e ( τ ) = ( ( W τ ( X n ) ) n N + , ( S m n ) m , n N + , ( x i ) i n N + ) .
The c l o n e ( τ ) satisfies the following identities:
(C1)
S ˜ m n ( S ˜ n p ( Z ˜ , Y ˜ 1 , , Y ˜ p ) , X ˜ 1 , , X ˜ n ) S ˜ m p ( Z ˜ , S ˜ m n ( Y ˜ 1 , X ˜ 1 , , X ˜ n ) , , S ˜ m n ( Y ˜ p , X ˜ 1 , , X ˜ n ) ) , m , n , p N + ;
(C2)
S ˜ m n ( λ i , X ˜ 1 , , X ˜ n ) X ˜ i , n , m N + , 1 i n ;
(C3)
S ˜ n n ( Y ˜ , λ 1 , , λ n ) Y ˜ , n N + .
Here, Z ˜ , Y ˜ 1 , , Y ˜ p , X ˜ 1 , , X ˜ n are variables, S ˜ m n are operation symbols, and λ i are nullary operation symbols. It is observed that, for m = n = 1 , (C1) is the associative law where S ˜ m n acts as the associative binary operation.
Many sorted algebras of the same kind as the c l o n e ( τ ) 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 I d n ( V ) denote the set of all n-ary identities s t satisfied in V (i.e., s , t W τ ( X n ) ). We then have the many-sorted quotient algebra:
c l o n e ( V ) = c l o n e ( τ ) / I d ( V )
where I d ( V ) is a congruence generated by ( I d n ( V ) ) n N + ; this, c l o n e ( V ) , is an abstract clone.
A hypersubstitution of type τ is defined as a mapping σ : { f i i I } W τ ( X ) such that, for each i I , σ ( f i ) W τ ( X n i ) . A hypersubstitution σ : { f i i I } W τ ( X ) can be uniquely extended to the mapping σ ^ : W τ ( X ) W τ ( X ) by:
(i)
σ ^ [ x i ] = x i if x i X ; and
(ii)
σ ^ [ f i ( t 1 , , t n i ) ] = S m n i ( σ ( f i ) , σ ^ [ t 1 ] , , σ ^ [ t n i ] ) if f i ( t 1 , , t n i ) W τ ( X m ) .
The set of all hypersubstitutions of type τ , denoted by H y p ( τ ) , forms a monoid under the associative binary operation defined by:
σ h σ = σ ^ σ
for all σ , σ H y p ( τ ) ; a hypersubstitution σ i d : { f i i I } W τ ( X ) defined by σ i d ( f i ) = f i ( x 1 , , x n i ) for all i I acts as an identity; the operation ∘ is composition of functions. The monoid H y p ( τ ) can be regarded as many-sorted mappings: For n N + , let I n I be the set of all indexes such that f j with j I n is an n-ary. Let F τ n = { f j j I n } . Then, for σ H y p ( τ ) , σ = ( σ n ) n N + , where σ n ( F τ n ) W τ ( X n ) . In addition, let
H y p ( τ ) = ( H y p n ( τ ) ) n N +
such that, for each n N + , H y p n ( τ ) denotes the set of all σ n . Finally, it would be remarked here that, for σ H y p ( τ ) ,
σ ^ = ( σ ^ n ) n N + .
In order to introduce the main concept of this paper, we need the following. For t W τ ( X n ) , the set of all variables of the term t will be denoted by v a r ( t ) . 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) 
x i X n are n-ary terms of a fixed variable; and
(ii) 
if t 1 , , t n i are n-ary terms of a fixed variable, and if v a r ( t j ) = v a r ( t k ) for all 1 j k n i , then f i ( t 1 , , t n i ) is an n-ary term of a fixed variable.
Let W τ f v ( X n ) be the set of all n-ary terms of a fixed variable of type τ ; i.e., W τ f v ( X n ) contains x 1 , , x n 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 τ :
W τ f v ( X ) = ( W τ f v ( X n ) ) n N + .
For example, let us consider the type τ = ( 2 ) with a binary operation symbol f. Then,
x 1 , x 2 , f ( x 1 , x 1 ) , f ( x 2 , x 2 ) , f ( x 1 , f ( x 1 , x 1 ) ) , f ( f ( x 2 , x 2 ) , x 2 ) W τ f v ( X 2 ) ;
x 1 , x 2 , x 3 , f ( x 1 , x 1 ) , f ( x 2 , x 2 ) , f ( x 3 , x 3 ) , f ( x 1 , f ( x 1 , x 1 ) ) , f ( f ( x 1 , x 1 ) , x 1 ) ,
f ( x 2 , f ( x 2 , x 2 ) ) , f ( x 3 , f ( x 3 , x 3 ) ) , f ( f ( x 3 , x 3 ) , f ( x 3 , x 3 ) ) W τ f v ( X 3 ) .
If we consider the type τ = ( 3 ) with 3-ary operation symbol f, then, for W τ f v ( X 2 ) ,
x 1 , x 2 , f ( x 1 , x 1 , x 1 ) , f ( x 2 , x 2 , x 2 ) , f ( x 1 , x 1 , f ( x 1 , x 1 , x 1 ) ) ,
f ( f ( x 2 , x 2 , x 2 ) , x 2 , x 2 ) W τ f v ( X 2 ) .
For W τ f v ( X 3 ) , we have
x 1 , x 2 , x 3 , f ( x 1 , x 1 , x 1 ) , f ( x 2 , x 2 , x 2 ) , f ( x 3 , x 3 , x 3 ) ,
f ( x 1 , x 1 , f ( x 1 , x 1 , x 1 ) ) , f ( x 2 , x 2 , f ( x 2 , x 2 , x 2 ) ) , f ( x 3 , x 3 , f ( x 3 , x 3 , x 3 ) ) ,
f ( f ( x 3 , x 3 , x 3 ) , f ( x 3 , x 3 , x 3 ) , f ( x 3 , x 3 , x 3 ) ) W τ f v ( X 3 ) .
Remark 1.
Observe that, for t W τ f v ( X n ) , v a r ( t ) = { x j } for some x j X n .
The following lemma shows that ( W τ f v ( X n ) ) n N + is closed under the superposition operations.
Lemma 1.
For n , m N + , if f i ( t 1 , , t n i ) W τ f v ( X n ) , and if t 1 , , t n W τ f v ( X m ) , then
S m n ( f i ( t 1 , , t n i ) , t 1 , , t n ) W τ f v ( X m ) .
Proof. 
We have, by definition of operation S m n , that
S m n ( f i ( t 1 , , t n i ) , t 1 , , t n ) = f i ( S m n ( t 1 , t 1 , , t n ) , , S m n ( t n i , t 1 , , t n ) ) .
Then, we must show that Equations (1) and (2) hold:
(1)
S m n ( t 1 , t 1 , , t n ) W τ f v ( X m ) , , S m n ( t n i , t 1 , , t n ) W τ f v ( X m ) ; and
(2)
v a r ( S m n ( t 1 , t 1 , , t n ) ) = = v a r ( S m n ( t n i , t 1 , , t n ) ) .
To show Equation (1), we will only show that S m n ( t 1 , t 1 , , t n ) W τ f v ( X m ) ; for S m n ( t 2 , t 1 , , t n ) W τ f v ( X m ) , , S m n ( t n i , t 1 , , t n ) W τ f v ( X m ) can be proved similarly. If t 1 X n , put t 1 = x 1 (without loss of generality), then
S m n ( t 1 , t 1 , , t n ) = t 1 W τ f v ( X m ) .
Assume that t 1 = f i ( t 1 , , t n i ) such that
S m n ( t 1 , t 1 , , t n ) W τ f v ( X m ) , , S m n ( t n i , t 1 , , t n ) W τ f v ( X m ) .
Since S m n ( t 1 , t 1 , , t n ) = f i ( S m n ( t 1 , t 1 , , t n ) , , S m n ( t n i , t 1 , , t n ) ) and
v a r ( t 1 ) = = v a r ( t n i ) ,
then
v a r ( S m n ( t 1 , t 1 , , t n ) ) = = v a r ( S m n ( t n i , t 1 , , t n ) ) .
Thus,
S m n ( f i ( t 1 , , t n i ) , t 1 , , t n ) W τ f v ( X m ) .
From
v a r ( t 1 ) = = v a r ( t n i ) ,
it follows that
v a r ( S m n ( t 1 , t 1 , , t n ) ) = = v a r ( S m n ( t n i , t 1 , , t n ) ) .
Using Lemma 1, we then have many-sorted mappings
S m n : W τ f v ( X n ) × ( W τ f v ( X m ) ) n W τ f v ( X m )
for m , n N + . Hence, we obtain another many-sorted algebra:
c l o n e f v ( τ ) = ( ( W τ f v ( X n ) ) n N + , ( S m n ) m , n N + , ( x i ) i n N + ) .
Moreover, sine ( W τ f v ( X n ) ) n N + ( W τ ( X n ) ) n N + , the following theorem follows.
Theorem 1.
c l o n e f v ( τ ) satisfies (C1)–(C3).

2. Variable Fixed Hypersubstitutions

Based on the set of terms of a fixed variable, we introduce f v -hypersubstitutions as follows:
Definition 2.
A hypersubstitution σ H y p ( τ ) is called an f v -hypersubstitutionof type τ if, for all i I , σ ( f i ) W τ f v ( X n i ) .
For example, let consider the type τ = ( 2 ) with a binary operation symbol f. A hypersubstitution σ : { f } W τ ( X 2 ) of type τ such that σ ( f ) = f ( x 1 , f ( x 1 , x 1 ) ) is an f v -hypersubstitution. However, σ : { f } W τ ( X 2 ) of type τ such that σ ( f ) = f ( x 1 , x 2 ) is not an f v -hypersubstitution.
Let H y p f v ( τ ) denote the set of all f v -hypersubstitutions of type τ .
In order to prove the next results, the following lemma is needed.
Lemma 2.
If σ H y p f v ( τ ) , then σ ^ : W τ f v ( X ) W τ f v ( X ) .
Proof. 
Let σ H y p f v ( τ ) , and let t W τ f v ( X ) . We must show that σ ^ [ t ] W τ f v ( X ) . It is clear, for t X , that σ ^ [ t ] W τ f v ( X ) . Assume that t = f i ( t 1 , , t n i ) W τ f v ( X ) such that σ ^ [ t 1 ] , , σ ^ [ t n i ] W τ f v ( X ) . Since v a r ( t 1 ) = = v a r ( t n i ) ,
v a r ( σ ^ [ t 1 ] ) = = v a r ( σ ^ [ t n i ] ) .
Hence, since σ ( f i ) W τ f v ( X ) ,
σ ^ [ t ] = S m n i ( σ ( f i ) , σ ^ [ t 1 ] , , σ ^ [ t n i ] )
is a term of a fixed variable.□
For n N + , let σ n : F τ n W τ f v ( X n ) . Define
(i)
σ ^ n [ x i ] = x i if x i X n ; and
(ii)
σ ^ n [ f i ( t 1 , , t n i ) ] = S n n i ( σ n ( f i ) , σ ^ n [ t 1 ] , , σ ^ n [ t n i ] ) .
Thus, an f v -hypersubstitution σ of type τ can be regarded as ( σ n ) n N + . As H y p ( τ ) , we consider
H y p f v ( τ ) = ( H y p n f v ( τ ) ) n N + .
By Lemma 2, we have that ( H y p n f v ( τ ) ) n N + is a subsemigroup of ( H y p n ( τ ) ) n N + .
The section will be closed with the following useful result.
Theorem 2.
The extension of σ ( H y p n f v ( τ ) ) n N + is an endomorphism on c l o n e f v ( τ ) .
Proof. 
Let σ ( H y p n f v ( τ ) ) n N + . By Lemma 2,
σ ^ : ( W τ f v ( X n ) ) n N + ( W τ f v ( X n ) ) n N + .
Let t 0 W τ f v ( X n ) , and let t 1 , , t n W τ f v ( X m ) . We have to show, by induction on the complexity of t 0 that σ ^ m [ S m n ( t 0 , t 1 , , t n ) ] = S m n ( σ ^ n [ t 0 ] , σ ^ m [ t 1 ] , , σ ^ m [ t n ] ) .
Let t 0 X n ; put t 0 = x 1 ; then,
σ ^ m [ S m n ( t 0 , t 1 , , t n ) ] = σ ^ m [ S m n ( x 1 , t 1 , , t n ) ] = σ ^ m [ t 1 ] ; S m n ( σ ^ n [ t 0 ] , σ ^ m [ t 1 ] , , σ ^ m [ t n ] ) = S m n ( σ ^ n [ x 1 ] , σ ^ m [ t 1 ] , , σ ^ m [ t n ] ) = S m n ( x 1 , σ ^ m [ t 1 ] , , σ ^ m [ t n ] ) = σ ^ m [ t 1 ] .
Let t 0 = f i ( t 1 , , t n i ) such that
σ ^ m [ S m n ( t k , t 1 , , t n ) ] = S m n ( σ ^ n [ t k ] , σ ^ m [ t 1 ] , , σ ^ m [ t n ] ) for all 1 k n i . Consider
σ ^ m [ S m n ( t 0 , t 1 , , t n ) ] = σ ^ m [ S m n ( f i ( t 1 , , t n i ) , t 1 , , t n ) ] = σ ^ m [ f i ( S m n ( t 1 , t 1 , , t n ) , , S m n ( t n i , t 1 , , t n ) ] = S m n i ( σ m ( f i ) , σ ^ m [ S m n ( t 1 , t 1 , , t n ) ] , , σ ^ m [ S m n ( t n i , t 1 , , t n ) ] ) = S m n i ( σ m ( f i ) , S m n ( σ ^ n [ t 1 ] , σ ^ m [ t 1 ] , , σ ^ m [ t n ] ) , , S m n ( σ ^ n [ t n i ] , σ ^ m [ t 1 ] , , σ ^ m [ t n ] ) ) = S m n ( S m n i ( σ m ( f i ) , σ ^ n [ t 1 ] , , σ ^ n [ t n i ] ) , σ ^ m [ t 1 ] , , σ ^ m [ t n ] ) = S m n ( σ ^ m [ t 0 ] , σ ^ m [ t 1 ] , , σ ^ m [ t n ] ) .
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 s t in I d ( V ) is said to be an f v -identity of V if s , t W τ f v ( X n ) for some n N + .
For example, the identity
f ( x , x ) x
in the variety of bands (semigroups with the elements are idempotent).
Let I d f v ( V ) denote the set of all f v -identities of the variety V. Consider
I d n f v ( V ) = { s t s t I d ( V ) , s , t W τ f v ( X n ) } .
Then,
I d f v ( V ) = ( I d n f v ( V ) ) n N +
is a many-sorted equivalence on ( W τ f v ( X n ) ) n N + . However, this is not an equational theory of type τ because it is not closed under substitution.
Now, the definition of f v -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, ( I d n f v ( V ) ) n N + is a congruence on c l o n e f v ( τ ) .
Proof. 
That ( I d n f v ( V ) ) n N + is preserved by the constant fundamental operations of c l o n e f v ( τ ) is clear.
Let s t I d n f v ( V ) , and let s 1 t 1 , , s n t n I d m f v ( V ) . We must show that
S m n ( s , s 1 , , s n ) S m n ( t , t 1 , , t n ) I d m f v ( V ) .
This follows from
S m n ( s , s 1 , , s n ) , S m n ( t , t 1 , , t n ) W τ f v ( X m )
and
S m n ( s , s 1 , , s n ) S m n ( t , t 1 , , t n ) I d m ( V ) .
Using Theorem 3, for a variety V of type τ , we have the many-sorted algebra:
c l o n e f v ( V ) = c l o n e f v ( τ ) / I d f v ( V ) .
Definition 4.
Let V be a variety of one-sorted total algebras of type τ. Let ( H y p n f v ( τ ) ) n N + be a many-sorted semigroup of f v -hypersubstitutions of type τ. An f v -identity s t of the variety V is said to be an f v -closed identity of V if
σ ^ n [ s ] σ ^ n [ t ] I d n ( V )
for s , t W τ f v ( X n ) , σ n H y p n f v ( τ ) , and n N + .
In addition, we call V variable fixed closed if
σ ^ n [ s ] σ ^ n [ t ] I d n ( V )
for all s , t W τ f v ( X n ) , σ n H y p n f v ( τ ) , and n N + .
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 ( I d n v f ( V ) ) n N + is fully invariant, then V is variable fixed closed.
Proof. 
Assume that ( I d n v f ( V ) ) n N + is fully invariant; then, ( I d n v f ( V ) ) n N + is a fully invariant congruence on c l o n e v f ( τ ) . Let ( σ n ) n N + ( H y p n v f ( τ ) ) n N + . By Theorem 2, ( σ n ) n N + is an endomorphism on c l o n e v f ( τ ) . Then, by assumption,
σ ^ n [ s ] σ ^ n [ t ] I d n ( V )
for all n N + . Thus, s t 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 τ , I d v f ( V ) is a congruence on c l o n e v f ( τ ) by Theorem 3. We then form the quotient algebra
c l o n e v f ( V ) = c l o n e v f ( τ ) / I d v f ( V ) .
Note that we have a many-sorted natural homomorphism
n a t n , I d v f ( V ) : c l o n e v f ( τ ) c l o n e v f ( τ ) ( V )
such that
n a t n , I d v f ( V ) ( t ) = [ t ] I d n v f ( V ) .
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 s t I d v f ( V ) is an identity in c l o n e v f ( V ) , then s t is variable fixed closed identity of V.
Proof. 
Assume that s t I d v f ( V ) is an identity in c l o n e v f ( V ) . Let σ H y p v f ( τ ) ; then, σ ^ : c l o n e v f ( τ ) c l o n e v f ( τ ) is an endomorphism by Theorem 2. Thus,
n a t n , I d v f ( V ) σ ^ n : c l o n e v f ( τ ) c l o n e v f ( V )
is a homomorphism. By assumption,
n a t n , I d v f ( V ) σ ^ n ( s ) = n a t n , I d v f ( V ) σ ^ n ( t ) .
That is,
n a t n , I d v f ( V ) ( σ ^ n [ s ] ) = n a t n , I d v f ( V ) ( σ ^ n [ t ] ) .
Thus,
[ σ ^ n [ s ] ] I d v f ( V ) = [ σ ^ n [ t ] ] I d v f ( V ) .
That is,
σ ^ n [ s ] σ ^ n [ t ] I d v f ( V ) .
Hence, s t is a variable fixed closed identity of V.□
Let V be a variety of one-sorted total algebras of type τ . Define
H I d n v f ( V ) = { s t s , t W τ v f ( X n ) , σ ^ n [ s ] σ ^ n [ t ] I d n ( V ) for all σ n H y p n v f ( τ ) } .
Thus,
( H I d n v f ( V ) ) n N +
is an equivalence on ( W τ v f ( X n ) ) n N + .
Theorem 6.
Let V be a variety of one-sorted total algebras of type τ. Then, ( H I d n v f ( V ) ) n N + is a congruence on c l o n e v f ( τ ) .
Proof. 
Let s t H I d n v f ( V ) ; and let s 1 t 1 , , s n t n H I d m v f ( V ) . Then, σ ^ n [ s ] σ ^ n [ t ] I d n v f ( V ) ; and σ ^ m [ s 1 ] σ ^ m [ t 1 ] , , σ ^ m [ s n ] σ ^ m [ t n ] I d m v f ( V ) for all σ ( H y p n v f ( τ ) ) n N + .
We have to show that
σ ^ m [ S m n ( s , s 1 , , s n ) ] σ ^ m [ S m n ( t , t 1 , , t n ) ] I d m v f ( V )
for all σ ( H y p n v f ( τ ) ) n N + . In addition, hence ( H I d n v f ( V ) ) n N + is a congruence on c l o n e v f ( τ ) . Let σ ( H y p n v f ( τ ) ) n N + . Since σ ^ n [ s ] σ ^ n [ t ] I d n v f ( V ) ,
σ ^ n [ s ] σ ^ n [ t ] I d n ( V ) and σ ^ n [ s ] , σ ^ n [ t ] W τ v f ( X n ) .
Similarly, since σ ^ m [ s 1 ] σ ^ m [ t 1 ] , , σ ^ m [ s n ] σ ^ m [ t n ] I d m v f ( V ) ,
σ ^ m [ s 1 ] σ ^ m [ t 1 ] , , σ ^ m [ s n ] σ ^ m [ t n ] I d n ( V )
and
σ ^ m [ s 1 ] , , σ ^ m [ s n ] , σ ^ m [ t 1 ] , , σ ^ m [ t n ] W τ v f ( X m )
.
By σ ^ n [ s ] σ ^ n [ t ] I d n ( V ) and σ ^ m [ s 1 ] σ ^ m [ t 1 ] , , σ ^ m [ s n ] σ ^ m [ t n ] I d n ( V ) ,
S m n ( σ ^ n [ s ] , σ ^ m [ s 1 ] , , σ ^ m [ s n ] ) S m n ( σ ^ n [ t ] , σ ^ m [ t 1 ] , , σ ^ m [ t n ] ) I d m ( V ) .
From σ ^ n [ s ] , σ ^ n [ t ] W τ v f ( X n ) and σ ^ m [ s 1 ] , , σ ^ m [ s n ] , σ ^ m [ t 1 ] , , σ ^ m [ t n ] W τ v f ( X m ) , it follows that
S m n ( σ ^ n [ s ] , σ ^ m [ s 1 ] , , σ ^ m [ s n ] ) , S m n ( σ ^ n [ t ] , σ ^ m [ t 1 ] , , σ ^ m [ t n ] ) W τ v f ( X m ) .
Thus,
S m n ( σ ^ n [ s ] , σ ^ m [ s 1 ] , , σ ^ m [ s n ] ) S m n ( σ ^ n [ t ] , σ ^ m [ t 1 ] , , σ ^ m [ t n ] ) I d m v f ( V ) .
Since σ ^ m is an endomorphism (Theorem 2),
σ ^ m [ S m n ( s , s 1 , , s n ) ] σ ^ m [ S m n ( t , t 1 , , t n ) ] I d m v f ( V ) .
This completes the proof.□

4. Conclusions

In this paper, the concept of terms of a fixed variable is introduced. The set of such terms together with the superposition operation forms the clone since it satisfied the superassociative law. Furthermore, the notion of hypersubstitution which maps operation symbols to the term of a fixed variable is investigated. Finally, the relationship between closed identities of a fixed variable and closed variety of a fixed variable is considered.

Author Contributions

Conceptualization, K.W. and T.C.; methodology, K.W. and T.C.; validation, T.C.; formal analysis, K.W. and T.C.; writing—original draft preparation, K.W.; writing—review and editing, K.W. and T.C.; project administration, K.W. and T.C. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Acknowledgments

The authors would like to express their thanks to the referee for valuable comments. The second author is supported by the Centre of Excellence in Mathematics, the Commission on Higher Education, Thailand.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Denecke, K. Menger Algebras and Clones of Terms. East-West J. Math. 2013, 5, 179–193. [Google Scholar]
  2. Denecke, K. The Partial Clone of Linear Terms. Sib. Math. J. 2016, 57, 589–598. [Google Scholar] [CrossRef]
  3. Denecke, K.; Freiberg, L. The Algebra of Strongly Full Terms. Novi. Sad. J. Math. 2014, 34, 87–98. [Google Scholar]
  4. Denecke, K.; Jampaclon, P. Clones of Full Terms. Algebra Discrete Math. 2004, 4, 1–11. [Google Scholar]
  5. Puapong, S.; Leeratanawalee, S. The Algebra of Generalized Full Terms. Int. J. Open Problems Compt. Math. 2011, 4, 54–65. [Google Scholar]
  6. Sarawut, P. Some Algebraic Properties of Generalized Clone Automorphisms. Acta Univ. Apulensis 2015, 41, 165–175. [Google Scholar]
  7. Denecke, K.; Wismath, S.L. Hyperidentities and Clones; Gordon and Breach Science Publisher: London, UK, 2000. [Google Scholar]
  8. Denecke, K.; Wismath, S.L. Universal Algebra and Applications in Theoretical Computer Science; Chapman & Hall/RCR: Boca Raton, FL, USA; London, UK; New York, NY, USA, 2002. [Google Scholar]

Share and Cite

MDPI and ACS Style

Wattanatripop, K.; Changphas, T. Clones of Terms of a Fixed Variable. Mathematics 2020, 8, 260. https://doi.org/10.3390/math8020260

AMA Style

Wattanatripop K, Changphas T. Clones of Terms of a Fixed Variable. Mathematics. 2020; 8(2):260. https://doi.org/10.3390/math8020260

Chicago/Turabian Style

Wattanatripop, Khwancheewa, and Thawhat Changphas. 2020. "Clones of Terms of a Fixed Variable" Mathematics 8, no. 2: 260. https://doi.org/10.3390/math8020260

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop