1 Basic definition

A functor is a rule that assigns data from one category to another while respecting the internal organization of each category. In practice, it acts as a translation device: objects are carried to objects, and arrows, or morphisms, are carried to morphisms in a way that preserves the basic pattern of composition. Functors provide one of the main ways category theory expresses similarity between different mathematical settings.

1.1 Categories and morphisms

A category consists of objects and morphisms between those objects. Morphisms may be thought of as structure-preserving maps, processes, or relations, depending on the context. Every object has an identity morphism, and morphisms can be composed whenever their source and target match. These features give a category its basic algebraic shape.

1.2 Object mapping

On the level of objects, a functor assigns to each object of a source category an object of a target category. This assignment need not preserve any visible geometric or algebraic appearance, but it must fit coherently with how morphisms behave. The object map is therefore only one part of a larger structured correspondence.

1.3 Morphism mapping

A functor also assigns to each morphism in the source category a morphism in the target category. This assignment must be compatible with the source and target objects of the morphism. In other words, if a morphism goes from one object to another, its image must go between the corresponding objects under the functor.

1.3.1 Preservation of identities

Identity morphisms are sent to identity morphisms. If an object acts as a neutral element for composition in the source category, its image must play the same role in the target category. This condition ensures that the functor does not disturb the simplest structural feature of a category.

1.3.2 Preservation of composition

Functoriality requires that the image of a composite morphism is the composite of the image morphisms. If two arrows can be composed in the source category, applying the functor before or after composition gives the same result. This compatibility is the core rule that makes a functor structure-preserving rather than merely a pair of unrelated assignments.

1.4 Covariant and contravariant functors

A covariant functor preserves the direction of morphisms. A contravariant functor reverses morphism direction while still respecting identities and composition in the appropriate reversed order. Both types are central in category theory, and many constructions arise naturally in one form or the other.

2 Examples

Examples of functors show how abstract definitions arise in familiar mathematical contexts. Some functors preserve much of the original structure, while others deliberately simplify it to highlight particular features. The same object may have many different functorial descriptions depending on the target category.

2.1 Identity functor

The identity functor sends every object to itself and every morphism to itself. It is the simplest functor and serves as the neutral element for functor composition. Its existence reflects the fact that every category can be viewed as mapping to itself without change.

2.2 Constant functor

A constant functor sends every object to a fixed object of the target category and every morphism to the corresponding identity morphism. It discards most of the source structure while remaining formally valid. Such functors are useful as simple test cases and in categorical constructions.

2.3 Forgetful functor

A forgetful functor sends a category with extra structure to a category with less structure by omitting part of the data. For example, it may send groups to their underlying sets or rings to their underlying abelian groups. Although it “forgets” information, it still records the morphisms that remain meaningful after the simplification.

2.4 Free functor

A free functor is typically left adjoint to a forgetful functor and adds the least amount of structure needed to satisfy a desired algebraic condition. For instance, a free group functor assigns to a set the free group generated by that set. Such functors are important because they construct universal objects from simple data.

2.5 Power set functor

The power set functor assigns to each set its set of subsets. On functions, it acts by sending a map to the image or inverse-image operation, depending on whether it is treated covariantly or contravariantly. This example illustrates how a functor can build a new set-theoretic level from an old one.

2.6 Fundamental group functor

The fundamental group functor assigns to a pointed topological space its fundamental group. It turns geometric information about loops into algebraic information about group structure. This is one of the classic examples of how functors convert topological problems into algebraic ones.

3 Properties and constructions

Functoriality is not only a definition but also a source of further structure. Functors can be combined, compared, and organized into higher-level categorical objects. These operations make them central tools for relating mathematical theories.

3.1 Functor composition

Functors can be composed just like ordinary maps. If one functor sends category A to category B and another sends B to category C, then their composition sends A to C. The result is again a functor because identity and composition preservation are inherited through the chain.

3.2 Isomorphism of functors

Two functors may be regarded as isomorphic when there is a coherent equivalence between their values on every object and morphism. This notion is usually expressed more precisely through natural isomorphism rather than a pointwise comparison alone. It captures the idea that two functors may differ in presentation while being essentially the same structurally.

3.3 Natural transformations

Natural transformations provide the standard way to compare functors with the same source and target categories. They assign morphisms between the outputs of one functor and the corresponding outputs of another, subject to a compatibility condition. This makes them the morphisms in functor categories and a key ingredient in higher category theory.

3.3.1 Components of a natural transformation

A natural transformation consists of a family of morphisms, one for each object in the source category. Each component connects the value of one functor at that object to the value of the other functor. The family must fit together so that every morphism in the source category produces a commutative square in the target category.

3.3.2 Natural isomorphisms

A natural transformation is a natural isomorphism if each of its components is an isomorphism. Such transformations show that two functors are equivalent in a strong and coherent sense. They are often treated as the categorical analogue of equality up to structure-preserving change.

3.4 Full and faithful functors

A functor is faithful if it injects morphism sets into morphism sets, so distinct morphisms remain distinct after applying the functor. It is full if every morphism between images in the target category comes from some morphism in the source. Together, these properties measure how accurately a functor reflects and captures morphism-level information.

3.5 Essentially surjective functors

A functor is essentially surjective if every object in the target category is isomorphic to one in the image of the functor. This condition allows the target to be covered up to categorical equivalence rather than strict equality. In combination with full and faithful behavior, it often signals that two categories carry the same structure up to equivalence.

4 Functor categories

Functor categories organize functors themselves into categories. This is one of the main examples of “categories of categories” and illustrates the self-referential breadth of categorical thinking. The structure is particularly useful because it allows higher-order mappings to be studied with the same tools used for ordinary mathematical objects.

4.1 Category of functors

Given two categories, one can form a category whose objects are functors between them. The morphisms in this new category are natural transformations. This construction packages entire families of structure-preserving maps into a single categorical framework.

4.2 Morphisms between functors

Morphisms in a functor category are not ordinary arrows between objects of the original categories. Instead, they are coherent comparisons between functors, expressed as natural transformations. Their role is to encode how one translation between categories differs from another in a way that respects all objects simultaneously.

4.3 Functor categories as examples of categories

Functor categories themselves satisfy the axioms of a category. They have identity natural transformations and composition given by vertical composition of transformations. This confirms that the categorical viewpoint is stable under its own constructions.

4.4 Limits and colimits in functor categories

Many limits and colimits in a functor category are computed pointwise. This means that one can evaluate the relevant diagram at each object of the source category and then take the corresponding limit or colimit in the target category. Pointwise behavior makes functor categories especially tractable in practice.

Several ideas extend the basic notion of a functor or refine it for special uses. Some of these variants change variance, others add multiple inputs, and still others connect functors to universal properties and equivalence notions. Together they show the flexibility of functorial language.

5.1 Endofunctors

An endofunctor is a functor from a category to itself. Endofunctors appear naturally in algebra, computer science, and logic because they describe self-maps at the categorical level. They are often used to express iterative or recursive structures.

5.2 Bifunctors

A bifunctor takes two input categories and is functorial in both variables. Common examples include tensor products and Hom-sets viewed in suitable contexts. Bifunctors are useful when a construction depends on two pieces of data at once.

5.3 Contravariant functors

Contravariant functors reverse the direction of morphisms while preserving identities and reversed composition. They arise frequently in duality theory and in constructions such as Hom functors. Their behavior reflects the idea that some assignments are naturally best understood by turning arrows around.

5.4 Representable functors

A representable functor is one naturally isomorphic to a Hom-functor from a fixed object. Such functors encode an object’s relationships to all other objects in a category. They are important because they often identify abstract functors with concrete objects that “represent” them.

5.5 Adjunctions

Adjunctions relate pairs of functors in a way that expresses a universal balancing between construction and forgetting, or between free and constrained forms. They are among the most important patterns in category theory. Many familiar mathematical processes can be interpreted as adjoint pairs.

5.5.1 Left adjoints

Left adjoints commonly preserve colimits and often correspond to freely generated constructions. They create the most economical object satisfying a condition. In algebraic settings, left adjoints frequently build structured objects from simpler ones.

5.5.2 Right adjoints

Right adjoints commonly preserve limits and often correspond to forgetful or solution-type constructions. They tend to extract compatible data from a structured setting. Many classical “underlying set” or “space of maps” constructions are right adjoint in nature.

6 Functors in different areas of mathematics

Functors are used across many branches of mathematics because they provide a uniform language for translating structure. Their applications range from algebraic classification to geometric invariants and logical interpretation. The same formal idea adapts to different mathematical environments with minimal change.

6.1 Functors in algebra

In algebra, functors relate categories such as groups, rings, modules, and vector spaces. They encode constructions like free objects, quotient processes, tensor products, and Hom-objects. Functorial language helps organize the relationships among algebraic systems and their homomorphisms.

6.2 Functors in topology

In topology, functors turn spaces into algebraic objects that can be easier to analyze. Homology, cohomology, and the fundamental group are classic examples. These functors preserve enough topological information to distinguish many spaces while simplifying the overall structure.

6.3 Functors in logic and model theory

In logic and model theory, functors can describe translations between syntactic and semantic categories. They help formalize interpretations, substitutions, and transformations between models. Categorical formulations often clarify the relationship between theories and their realizations.

6.4 Functors in computer science

In computer science, especially in type theory and functional programming, functors model type constructors that can be mapped over. They provide a disciplined way to express data transformation while preserving shape. This idea has influenced both theoretical semantics and practical programming abstractions.

7 Applications

The value of functors lies in their ability to make correspondence precise. They let mathematicians move problems between categories without losing essential relationships. This makes them useful both for abstract theory and for concrete computation.

7.1 Translating structure between categories

Functors translate one mathematical structure into another in a controlled way. This allows a problem posed in one setting to be studied in a different setting where tools may be more effective. The translation can reveal hidden similarities among seemingly unrelated theories.

7.2 Invariants of mathematical objects

Many functors assign invariants to objects, such as groups, sets, or algebraic structures. An invariant remains unchanged under the relevant morphisms, making it a powerful tool for classification. Functorial invariants are especially valuable because they behave consistently under maps, not just on isolated objects.

7.3 Categorical formulations of constructions

Functors allow familiar constructions to be stated as universal properties. This includes free objects, products, limits, and many algebraic and topological processes. Once recast functorially, these constructions become easier to compare and generalize.

7.4 Functorial semantics

Functorial semantics studies mathematical theories through categories of models and structure-preserving maps between them. It interprets theories by assigning categorical meaning to their symbols and axioms. This perspective emphasizes that meaning can arise from the behavior of models under functorial translation.