Functor Category

For fixed categories C and D, the category whose objects are functors C→D and whose morphisms are natural transformations, with identities and composition defined componentwise.

Version

v2 · 2026-09-06 · History

Domain-specific #

1899

Origin domain

category theory

Subdomain

categorical constructions

Aliases

Category of functors

Core Idea

Fix categories \(\mathcal C\) and \(\mathcal D\). The functor category \([\mathcal C,\mathcal D]\), also written \(\mathcal D^{\mathcal C}\) or \(\operatorname{Fun}(\mathcal C,\mathcal D)\), has functors \(F:\mathcal C\to\mathcal D\) as its objects and natural transformations \(\eta:F\Rightarrow G\) as its morphisms. The endpoints are fixed: every object has the same source \(\mathcal C\) and target \(\mathcal D\).

A natural transformation assigns to each object \(c\in\mathcal C\) a morphism \(\eta_c:F(c)\to G(c)\) satisfying, for every \(u:c\to c'\),

Scope of Application

Functor categories organize diagram categories, presheaves, representations, actions, graded objects, chain-complex ingredients, and categorical models. A presheaf category is \([\mathcal C^{op},\mathbf{Set}]\). If a group \(G\) is treated as a one-object category, \([G,\mathbf{Set}]\) is the category of left \(G\)-sets and equivariant maps. Representations similarly arise as functors from a group or algebra-shaped category into vector spaces.

The arrow category \(\mathcal D^{[1]}\), where \([1]\) has one nonidentity arrow, has morphisms of \(\mathcal D\) as objects and commutative squares as arrows. A discrete indexing category with two objects gives \(\mathcal D\times\mathcal D\).

Clarity

Notation varies. \(\mathcal D^{\mathcal C}\) mirrors exponential notation, while \([\mathcal C,\mathcal D]\) and \(\operatorname{Fun}(\mathcal C,\mathcal D)\) emphasize the endpoint order. The source appears first in bracket and Fun notation but as exponent in exponential notation. Both must be read before interpreting examples.

Manages Complexity

A diagram can contain many objects and arrows. Functor Category packages the entire coherent diagram as one object. A natural transformation then packages a compatible family of comparisons as one morphism. This permits ordinary categorical reasoning at the diagram level.

Pointwise limits and colimits reduce a global diagram-of-diagrams calculation to calculations in \(\mathcal D\) at each index. Naturality then assembles those componentwise results into a functor.

Abstract Reasoning

For natural transformations \(F\xRightarrow{\eta}G\xRightarrow{\theta}H\), consider \(u:c\to c'\). Naturality gives

\[ H(u)\theta_c=\theta_{c'}G(u),\qquad G(u)\eta_c=\eta_{c'}F(u). \]

Multiplying yields

\[ H(u)(\theta_c\eta_c)=\theta_{c'}\eta_{c'}F(u), \]

so \((\theta\eta)_c=\theta_c\eta_c\) is natural. Associativity is inherited from each hom-set of \(\mathcal D\). This verifies the category axioms without inventing a new composition law.

Knowledge Transfer

The construction transfers literally across index categories and codomains. Replacing \(\mathcal C\) changes the diagram shape; replacing \(\mathcal D\) changes the mathematical objects used as values. The object/morphism roles remain functors and natural transformations.

Transfer can carry extra structure pointwise. If \(\mathcal D\) is additive, abelian, complete, or cocomplete and size hypotheses hold, the functor category often inherits corresponding structure. The exact theorem must be checked; the name alone does not guarantee enriched, monoidal, or model-category structure.

Relationships to Other Abstractions

Current abstraction Functor Category Domain-specific

Parents (1) — more general patterns this builds on

• Functor Category is a kind of Category Prime

  prime:category is the proposed minimal parent by strict specialization.

Hierarchy paths (3) — routes to 3 parentless roots

• Functor Category → Category → Associativity → Invariance

Show alternative paths (2)

Neighborhood in Abstraction Space

Functor Category sits in a sparse region of the domain-specific corpus (83^rd percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Unclustered & Miscellaneous (1565 abstractions)

Nearest neighbors

• Associativity Isomorphism — 0.82
• Stack (Mathematics) — 0.82
• Regular Category — 0.81
• Fusion Category — 0.81
• Fibred Category — 0.81

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