In universal algebra, a clone is a set C of finitary operations on a set A such that

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[2][3][4] 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.[5]: 4–5  The more general concept[6] includes all clones without nullary operations as subclones of the clone of all at least unary operations[5]: 5  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.[7][8]

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,[9][10][3]: 39  and has been completely described by Emil Post[11][10] (see Post's lattice,[3]: 37  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,[12][3]: 39  and 22κ (even just maximal,[10][3]: 39  i.e. precomplete) clones on an infinite set of cardinality κ.[9][3]: 39 

Abstract clones

Philip Hall introduced the concept of abstract clone.[13] An abstract clone is different from a concrete clone in that the set A is not given. Formally, an abstract clone comprises

such that

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

Any algebraic theory determines an abstract clone where Cn 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 Cn. 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 (Cm)n. This induces a bijective correspondence between Lawvere theories and abstract clones.

See also

Notes

  1. ^ Denecke, Klaus (2003). "Menger algebras and clones of terms". East–West Journal of Mathematics. 5 (2): 179. ISSN 1513-489X.
  2. ^ Pöschel, Reinhard; Kalužnin, Lev A. (1979). Funktionen- und Relationenalgebren. Ein Kapitel der diskreten Mathematik. Mathematische Monographien (in German). Vol. 15. Berlin: VEB Deutscher Verlag der Wissenschaften.
  3. ^ a b c d e f Szendrei, Ágnes (1986). Clones in Universal Algebra. Séminaire de Mathématiques Supérieures. Vol. 99. Montréal, QC: Presses de l'Université de Montréal. ISBN 978-2-7606-0770-5.
  4. ^ Lau, Dietlinde (2006). Function Algebras on Finite Sets. A basic course on many-valued logic and clone theory. Springer Monographs in Mathematics. Berlin: Springer. doi:10.1007/3-540-36023-9. ISBN 978-3-540-36022-3.
  5. ^ a b Behrisch, Mike (2014). Power, John; Wingfield, Cai (eds.). "Clones with Nullary Operations". Electronic Notes in Theoretical Computer Science. 303: 3–35. doi:10.1016/j.entcs.2014.02.002. ISSN 1571-0661.
  6. ^ McKenzie, Ralph N.; McNulty, George F.; Taylor, Walter F. (1987). Algebras, Lattices, Varieties. Vol. I. Monterey, CA: Wadsworth & Brooks/Cole Advanced Books & Software. p. 143. ISBN 978-0-534-07651-1.
  7. ^ Trnková, Věra; Sichler, Jiří (2009). "All clones are centralizer clones". Algebra Universalis. 61 (1): 77–95. CiteSeerX 10.1.1.525.167. doi:10.1007/s00012-009-0004-4. ISSN 0002-5240.
  8. ^ Trnková, Věra; Sichler, Jiří (2008). "On clones determined by their initial segments". Cahiers de Topologie et Géométrie Différentielle Catégoriques. 49 (3). ISSN 1245-530X.
  9. ^ a b Rosenberg, Ivo G. (1974). "Some maximal closed classes of operations on infinite sets". Mathematische Annalen. 212 (2). Berlin/Heidelberg: Springer: 158. doi:10.1007/BF01350783. ISSN 0025-5831. MR 0351964. Zbl 0281.08001.
  10. ^ a b c Rosenberg, Ivo G. (1976). "The set of maximal closed classes of operations on an infinite set A has cardinality 22|A|". Archiv der Mathematik. 27 (6). Basel: Springer (Birkhäuser): 562. doi:10.1007/BF01224718. ISSN 0003-889X. MR 0429700. Zbl 0345.02010.
  11. ^ Post, Emil Leon (1941). The two-valued iterative systems of mathematical logic. Annals of Mathematics Studies. Vol. 5. Princeton, N. J.: Princeton University Press. pp. viii+122. MR 0004195.
  12. ^ Юрий Иванович Янов (Jurij Ivanovič Janov); Альберт Абрамович Мучник (Aľbert Abramovič Mučnik) (1959). "O suščestvovanii k-značnyx zamknutyx klassov, ne imejuščix konečnogo bazisa" О существовании k-значных замкнутых классов, не имеющих конечного базиса [On the existence of k-valued closed classes having no finite basis]. Doklady Akademii Nauk SSSR (in Russian). 127 (1): 44–46. ISSN 0002-3264. MR 0108458. Zbl 0100.01001.
  13. ^ Cohn, Paul Moritz (1981). Universal Algebra. Mathematics and its Applications. Vol. 6 (2nd ed.). Dordrecht-Boston, Mass.: D. Reidel Publishing Co. p. 127. ISBN 978-90-277-1254-7.

References

Category