Functor

A structure-preserving map between categories that carries objects and morphisms while respecting identities and composition — the two axioms that make it a licence to transport theorems from one category to another along its rails.

Core Idea

A functor is a structure-preserving mapping between categories — a translation carrying not just objects but the relational fabric connecting them. A functor F : C to D assigns to each object X an object F(X), and to each morphism f : X to Y a morphism F(f) : F(X) to F(Y), subject to two axioms: F(id) = id (identity preservation) and F(g o f) = F(g) o F(f) (composition preservation). Those axioms are the entire content: they ensure the translation respects how morphisms chain, so structural properties of C provably map to structural properties of D.

Scope of Application

Because a functor is a mathematical construct, not a causal mechanism, it applies literally wherever its precondition holds: both source and target modelled as categories.

• Algebraic topology — the fundamental-group functor and homology functors, converting topological questions into group-theoretic ones.
• Algebraic geometry, representation theory, sheaf theory — structure-preserving translations organizing whole theories.
• Functional programming — the Functor type class, giving List, Maybe, Tree, Future a uniform fmap.
• Mathematical physics — a TQFT is a functor from cobordisms to vector spaces.
• Programming-language and database theory — denotational semantics and schema mappings/ologs.

Clarity

Naming the functor sharpens the difference between a translation that preserves the relational fabric and one that merely pairs objects. It turns trustworthiness into a checkable property — does the translation respect identities and composition? — so a correspondence that silently breaks composition is exposed as matching surface features. This makes available a finer question than "are these domains analogous?": which categorical features does this functor preserve? — with "preserves limits but not colimits," "faithful but not full" a precise vocabulary controlling which results port.

Manages Complexity

Mathematics is dense with translations between systems, each otherwise a bespoke object argued case by case. The functor compresses that sprawl into a uniform two-axiom checklist: a translation either preserves identities and composition or it does not, and the moment it does, the whole apparatus of category theory applies at once. The analyst tracks two facts about the action on morphisms, plus a preservation profile of feature flags off which which-theorems-travel reads directly — collapsing a menagerie of constructions to one pattern proved once.

Abstract Reasoning

The functor licenses a diagnostic move (distinguishing a structure-preserving translation from a bare object-pairing by interrogating the action on morphisms), a boundary-drawing move (verifying the two axioms to license theorem transfer), an interventionist move (transporting a hard problem across the functor's rails into a tractable category), a predictive move (reading which results travel off the preservation profile), and a unifying move (collapsing a menagerie of constructions to one pattern and proving a guarantee once).

Knowledge Transfer

Within mathematics and mathematized theoretical computer science the functor transfers as mechanism, its full content — the two axioms, the theorem-transport licence, the preservation profile, and the apparatus of natural transformations and adjunctions — carrying across the subfields, often under the same name, because every target is itself modelled as a category. Beyond that orbit the functor does not travel: the portable kernel it delivers — a translation respecting relational fabric, not merely objects — is owned by existing primes isomorphism, homomorphism, and transformation, with compositionality the neighbour it is often confused with. Outside the categorical orbit "functor" degrades to "any map between domains," dropping the composition axiom that is its whole content.

Relationships to Other Abstractions

Current abstraction Functor Domain-specific

Parents (2) — more general patterns this builds on

• Functor presupposes Category Prime

  A Functor requires source and target Categories because its entire content is preserving their objects, arrows, identities, and composition.

• Functor is part of Function (Mapping) Prime

  A Functor contains deterministic object and arrow functions whose coordinated images are constrained by the identity and composition laws.

Hierarchy paths (4) — routes to 4 parentless roots

• Functor → Category → Associativity → Invariance

Show alternative paths (3)

Neighborhood in Abstraction Space

Functor sits in a moderately populated region (56^th percentile for distinctiveness): it has near-neighbors but no dense thicket of look-alikes.

Family — Unclustered & Miscellaneous (309 abstractions)

Nearest neighbors

• Kernel — 0.86
• Universal property — 0.84
• Cross-reference Relation — 0.84
• Functional Fixedness — 0.83
• Relational Model — 0.83

Computed from structural-signature embeddings · 2026-07-12