All clones are centralizer clones (Q1040654)

From MaRDI portal
Revision as of 11:46, 8 April 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q61714510, #quickstatements; #temporary_batch_1712569514456)
scientific article
Language Label Description Also known as
English
All clones are centralizer clones
scientific article

    Statements

    All clones are centralizer clones (English)
    0 references
    0 references
    0 references
    25 November 2009
    0 references
    An \textit{abstract clone} is a small category whose object set consists of all finite powers of a base object \(a\), with \(a^0\) as terminal object, and in which for every \(n\in\omega\) an \(n\)-tuple of product projections \(\pi^n_0,\dots,\pi^n_{n-1}\) is specified. Similarly to representations of abstract groups as permutation groups acting on a set \(X\), abstract clones can always be represented as \textit{concrete clones} of finitary functions on a set \(X\), i.e., as sets of finitary functions on \(X\) closed under composition and containing all projections. In the present paper, it is shown that abstract clones can even be represented as a specific type of concrete clones, namely as \textit{centralizer clones} of certain algebraic systems; the centralizer clone of an algebraic system is the set of homomorphisms from finite powers of the system into the system. The main theorem states that every abstract clone can be represented as the centralizer clone of an algebraic system which has precisely one unary relation and \(\kappa\) unary operations, where \(\kappa\) is the number of morphisms of the abstract clone. Moreover, if the abstract clone does not contain any \textit{virtual constants}, i.e., morphisms that ``look'' constant without being explicitly forced to be constant by factoring through nullary morphisms, then the unary relation can be avoided and the clone can be represented as the centralizer clone of an algebra which has precisely \(\kappa\) unary operations. Finally, if the abstract clone is in addition countable, then two unary operations suffice.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    abstract clone
    0 references
    concrete clone
    0 references
    centralizer clone
    0 references
    unary algebra
    0 references
    algebraic system
    0 references
    full embedding
    0 references
    product-preserving functor
    0 references
    0 references
    0 references