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: v3 · 2026-09-19 · History
Domain-specific #: 1486
Domain group: Formal Sciences
Origin domain: Mathematics
Subdomain: Universal Algebra → Mathematics
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.

How would you explain it like I'm…

The Recipe Box Rule

Imagine a box of machines. Each machine takes in some things and gives back one thing. The box always has the simple machines that just hand back one of the things you put in. And if you plug machines from the box into another machine from the box, the new combined machine is in the box too. That kind of box is a clone.

Closed Toolkit of Operations

In math, an operation takes some inputs from a set and gives one output from the same set, like addition takes two numbers and gives one. A clone is a collection of operations on one set that follows two rules. First, it contains the 'pick one input' operations, which just return, say, the first or second input. Second, if you feed outputs of operations in the collection into another operation in the collection, the combined operation is also in the collection. So a clone is everything you can build by combining its operations.

Composition-Closed Operation Family

A clone on a set A is a family of finitary operations on A (functions from A^n to A) that contains every coordinate projection, such as (x, y, z) ↦ y, and is closed under superposition: plugging n-ary members into the arguments of an m-ary member gives another n-ary member. The projections act like variables, so the clone contains every operation that can be written as a term built from its members. In fact, clones are exactly the families of term operations of algebras with carrier A. This lets you ignore which basic operations were chosen to generate an algebra: two algebras with different primitive symbols can have the same clone and so the same expressive power. Authors differ on whether nullary operations (constants) are allowed, and that choice must be stated.

A clone on a set A is a set C of finitary operations A^n → A that contains all projections π_i^n and is closed under superposition (composition): if f ∈ C is m-ary and g_1, ..., g_m ∈ C are n-ary, then f(g_1, ..., g_m) ∈ C is n-ary. Projections supply the variables needed to form terms, so C contains every operation obtainable by composing its members. Clones on A are precisely the term-operation families (clones of term operations) of algebras on A, abstracting away from the choice of primitive signature while preserving expressive content; term-equivalent algebras with different basic operations share a clone. Conventions vary on whether nullary operations are included, which affects constants and the least element of the clone lattice, so it 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¶

Fix the carrier and arity convention.
Include every coordinate projection.
Start from chosen basic or polymorphism operations.
Close the family under all arity-compatible superpositions.
Identify operations extensionally, not by term spelling.
Test inclusion or equality through generating sets or invariants.
Use relations preserved by all operations when the Pol–Inv connection applies.
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¶

Current abstraction Clone (Universal Algebra) Domain-specific

Parents (1) — outgoing typed relations

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) → is a kind of Closure

Neighborhood in Abstraction Space¶

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

Family — Algebraic Operations & Quasigroup Structures (13 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-25