Skip to content

Clone (Universal Algebra)

Collect finitary operations on one carrier so that every projection is present and arbitrary finitary substitution of member operations produces another member.

Version
v2 · 2026-09-06 · History
Domain-specific #
1486
Origin domain
mathematics
Subdomain
universal algebra
Aliases
Operation clone, Algebraic clone

Core Idea

A clone on a set A is a family C of finitary operations A^n→A that contains every coordinate projection and is closed under superposition: substituting n-ary member operations into the arguments of an m-ary member operation produces another n-ary member. Thus C contains the variable operations needed to form terms and every operation obtainable by composing its members.

Clones are exactly the term-operation families of algebras on a fixed carrier, so they abstract away from the choice of primitive signature while preserving expressive operations. Equivalent algebras can have the same clone even if their basic symbols differ. Literature varies on including nullary operations; that convention changes constants and the bottom of the theory and must be declared.

Scope of Application

Clones are literal in universal algebra, relational structures, logic, and finite-domain constraint theory.

  • Universal algebra. Comparing algebras by their term operations.
  • Post's lattice. Classifying clones on a two-element carrier.
  • Constraint satisfaction. Using polymorphism clones to characterize relation languages.
  • Relational Galois theory. Pairing operation clones with invariant relations.
  • Category theory. Relating abstract clones to Lawvere theories and algebraic theories.
  • Logic. Studying expressibility under substitution and variable manipulation.

Clarity

Specify the carrier, permitted arities, and nullary convention. Write the projection and superposition axioms with arities aligned. Distinguish concrete clones of functions from abstract clones and term clones from polymorphism clones. When comparing algebras, state whether equality is literal on one carrier or up to isomorphism.

Manages Complexity

A clone collapses every possible term expression over an algebra into its induced operation, making expressive power independent of syntactic presentation. Inclusion then compares expressivity cleanly. The compression discards which short term or primitive signature generated an operation; finite generation and complexity questions require that information to be restored separately.

Abstract Reasoning

  1. Fix the carrier and arity convention.
  2. Include every coordinate projection.
  3. Start from chosen basic or polymorphism operations.
  4. Close the family under all arity-compatible superpositions.
  5. Identify operations extensionally, not by term spelling.
  6. Test inclusion or equality through generating sets or invariants.
  7. Use relations preserved by all operations when the Pol–Inv connection applies.
  8. Track constants explicitly under the nullary convention.

Knowledge Transfer

The strict parent is Closure: applying the native operation of superposition to members cannot leave the family. Composition is related, but clones require arity-sorted substitution and projections. The term does not transfer to biological or version-control cloning.

Closure is the strict parent because membership is preserved under every allowed finitary substitution and the required projections seed the operation calculus. The transferable pattern is primitive operations + variable selectors + substitution closure → expressive envelope. It appears in programming-language combinators and circuit bases only when arities and extensional operation semantics are preserved.

Relationships to Other Abstractions

Local relationship map for Clone (Universal Algebra)Parents appear above the current abstraction, mutual partners to the right, and children below. Node labels state whether each abstraction is prime or domain-specific; colors identify relation types.Clone (UniversalAlgebra)DOMAINPrime abstraction: Closure — is a kind ofClosurePRIME

Current abstraction Clone (Universal Algebra) Domain-specific

Parents (1) — more general patterns this builds on

  • Clone (Universal Algebra) is a kind of Closure Prime

    Closure is the strict parent because the defining condition is preservation of membership under every admissible superposition.

Hierarchy path (1) — routes to 1 parentless root

  • Clone (Universal Algebra) → Closure

Neighborhood in Abstraction Space

Clone (Universal Algebra) sits in a sparse region of the domain-specific corpus (69th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Unclustered & Miscellaneous (1565 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-09-08