clone (algebra)

In universal algebra, a clone is a set ''C'' of finitary operations on a set ''A'' such that
*''C'' contains all the projections , defined by ,
*''C'' is closed under (finitary multiple) composition (or "superposition"): if ''f'', ''g''₁, …, ''g_m'' are members of ''C'' such that ''f'' is ''m''-ary, and ''g_j'' is ''n''-ary for all ''j'', then the ''n''-ary operation is in ''C''.
The question whether clones should contain nullary operations or not is not treated uniformly in the literature. The classical approach as evidenced by the standard monographs on clone theory considers clones only containing at least unary operations. However, with only minor modifications (related to the empty invariant relation) most of the usual theory can be lifted to clones allowing nullary operations. The more general concept includes all clones without nullary operations as subclones of the clone of all at least unary operations and is in accordance with the custom to allow nullary terms and nullary term operations in universal algebra. Typically, publications studying clones as abstract clones, e.g. in the category theoretic setting of Lawvere's algebraic theories, will include nullary operations.

Given an algebra in a signature ''σ'', the set of operations on its carrier definable by a ''σ''- term (the ''term functions'') is a clone. Conversely, every clone can be realized as the clone of term functions in a suitable algebra by simply taking the clone itself as source for the signature ''σ'' so that the algebra has the whole clone as its fundamental operations.

If ''A'' and ''B'' are algebras with the same carrier such that every basic function of ''A'' is a term function in ''B'' and vice versa, then ''A'' and ''B'' have the same clone. For this reason, modern universal algebra often treats clones as a representation of algebras which abstracts from their signature.

There is only one clone on the one-element set (there are two if nullary operations are considered). The lattice of clones on a two-element set is countable, and has been completely described by Emil Post (see Post's lattice, which traditionally does not show clones with nullary operations). Clones on larger sets do not admit a simple classification; there are continuum-many clones on a finite set of size at least three, and 2^2''κ'' (even just maximal, i.e. precomplete) clones on an infinite set of cardinality ''κ''.

Abstract clones

Philip Hall introduced the concept of ''abstract clone''. An abstract clone is different from a concrete clone in that the set ''A'' is not given.
Formally, an abstract clone comprises
*a set ''C_n'' for each natural number ''n'',
*elements _''k'',''n'' in ''C_n'' for all ''k'' ≤ ''n'', and
*a family of functions ∗:''C''_''m'' × (''C''_''n'')^''m'' → ''C''_''n'' for all ''m'' and ''n''
such that
* ''c'' * (_1,''n'', …, _''n'',''n'') = ''c''
* _''k'',''m'' * (''c''₁, …, ''c''_''m'') = ''c''_''k''
* ''c'' * (''d''₁ * (''e''₁, …, ''e''_''n''), …, ''d''_''m'' * (''e''₁, …, ''e''_''n'')) = (''c'' * (''d''₁, …, ''d''_''m'')) * (''e''₁, …, ''e''_''n'').

Any concrete clone determines an abstract clone in the obvious manner.

Any algebraic theory determines an abstract clone where ''C_n'' is the set of terms in ''n'' variables, _''k'',''n'' are variables, and ∗ is substitution. Two theories determine isomorphic clones if and only if the corresponding categories of algebras are isomorphic. Conversely every abstract clone determines an algebraic theory with an ''n''-ary operation for each element of ''C_n''. This gives a bijective correspondence between abstract clones and algebraic theories.

Every abstract clone ''C'' induces a Lawvere theory in which the morphisms ''m'' → ''n'' are elements of (''C_m'')^''n''. This induces a bijective correspondence between Lawvere theories and abstract clones.

See also

* Term algebra

Notes

References

*
* Available online a
Reprints in Theory and Applications of Categories

{{Authority control

Universal algebra