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: v3 · 2026-09-19 · History
Domain-specific #: 1899
Domain group: Formal Sciences
Origin domain: Mathematics
Subdomains: Category Theory, Categorical Constructions → Mathematics
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'\),

How would you explain it like I'm…

No faithful explanation at this level. At this level the idea shrinks to 'a box of copied pictures.' That drops the consistent arrows between whole diagrams, which are what make it a category and not merely a collection of functors.

Copies and Matching Moves

Mathematicians study 'categories': collections of things joined by arrows. A functor copies one category into another, sending things to things and arrows to arrows. A Functor Category collects all the copies from one fixed category into another fixed category. Its arrows are 'natural transformations', which are ways to move from one copy to another, one piece at a time, so that every arrow in the picture still matches up. Because these arrows can be chained together, the collection becomes a category of its own.

The Category of Functors

A category is a collection of objects with arrows (morphisms) between them that can be composed. A functor F from category C to category D sends objects and arrows of C to objects and arrows of D in a structure-preserving way. The Functor Category [C, D] takes all such functors as its objects. Its arrows are natural transformations: for each object c, a chosen arrow from F(c) to G(c), picked so that going around any square built from an arrow u in C gives the same result either way. You compose these one component at a time. The point is that a whole diagram becomes a single object, so ordinary category tools like isomorphisms and limits can be applied to diagrams themselves.

Fix categories C and D. The Functor Category [C, D], also written D^C or Fun(C, D), has functors F: C → D as objects and natural transformations η: F ⇒ G as morphisms. Both endpoints stay fixed: every object has source C and target D. A natural transformation gives, for each c in C, a component η_c: F(c) → G(c), subject to the naturality square G(u)∘η_c = η_{c'}∘F(u) for every u: c → c'. Identities are (1_F)_c = 1_{F(c)}, and vertical composition is (θ∘η)_c = θ_c∘η_c. Naturality guarantees the composite is again natural, and associativity and unit laws are inherited componentwise from D. Size conditions matter when C is large. The payoff is that diagrams become objects and coherent maps of diagrams become arrows, so limits, colimits, adjunctions and algebraic structures on diagrams are just ordinary categorical constructions inside [C, D].

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) — outgoing typed relations

Functor Category is a kind of Category Prime

prime:category is the broader abstraction this entry instantiates.

Children (1) — abstractions linked here by typed relations

Injective and Projective Model Structure Domain-specific presupposes Functor Category

Injective and Projective Model Structures presuppose a Functor Category because their objects are diagrams and their objectwise classes are defined component by component in Fun(I,C).

Hierarchy paths (3) — routes to 3 parentless roots

Functor Category → is a kind of Category → includes Associativity → is a kind of Invariance

Show alternative paths (2)

Neighborhood in Abstraction Space¶

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

Family — Unclustered & Miscellaneous (2769 abstractions)

Nearest neighbors

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