A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.

Composition of Functors and Functor Equations

Graduate Depth 76 in the knowledge graph ☐ I know this ☆ Set as goal
150topics build on this
384prerequisites beneath it
See this on the map →
Functors→→Commutative Diagrams and CompositionFunctor Categories+2 more
functors categorical-structure composition

Core Idea

Functors compose: given F: A → B and G: B → C, their composition GF: A → C is defined pointwise on objects and morphisms. Functor composition is associative with identity functors as units. This makes categories into a 2-category where objects are categories, 1-morphisms are functors, and 2-morphisms are natural transformations.

Explainer

You already know what a functor is: a structure-preserving map between categories that sends objects to objects, morphisms to morphisms, and respects identity and composition. Functor composition asks the natural follow-up question: if F maps category A to B and G maps B to C, can we compose them to get a functor from A to C? The answer is yes, and the construction is exactly what you'd expect.

The composite functor GF: A → C is defined pointwise: on any object a ∈ A, (GF)(a) = G(F(a)); on any morphism f: a → a' in A, (GF)(f) = G(F(f)). That GF is actually a functor — not just a pair of assignments — requires checking that it preserves identities and composition. Preservation of identities: (GF)(id_a) = G(F(id_a)) = G(id_{Fa}) = id_{G(Fa)} = id_{(GF)(a)}, using the functor laws for F then G in sequence. Preservation of composition: (GF)(g ∘ f) = G(F(g ∘ f)) = G(F(g) ∘ F(f)) = G(F(g)) ∘ G(F(f)) = (GF)(g) ∘ (GF)(f). Both proofs are just applications of the functor laws twice over.

Associativity of functor composition follows immediately because composition of functions is associative, and functors are just functions on objects and morphisms that satisfy extra laws. For three composable functors F, G, H, the equality (HG)F = H(GF) holds strictly — no natural isomorphism is needed, the composites are literally equal. The identity functor id_A: A → A sends every object and morphism to itself. It acts as an identity for composition: F ∘ id_A = F = id_B ∘ F for any F: A → B.

This is where the 2-category structure of Cat enters. In an ordinary category, you have objects and morphisms between objects. In a 2-category, you additionally have 2-morphisms between morphisms — maps between maps. For Cat (the category of small categories), objects are categories, 1-morphisms are functors, and 2-morphisms are natural transformations between functors. Natural transformations can be composed both horizontally (composing with another natural transformation between adjacent functor pairs) and vertically (composing two natural transformations between the same pair of functors). Functor composition is precisely horizontal composition at the level of 1-morphisms, and the coherence conditions for 2-categories ensure that horizontal and vertical compositions interact consistently. Understanding this structure is the foundation for the upcoming topics on natural transformations and functor categories, where the interplay between these two composition operations becomes central.

Practice Questions 5 questions

Prerequisite Chain

Understanding Zero → The Number Zero → Counting to Five → Counting to 10 → Counting to 20 → Counting a Set of Objects Up to 20 → Cardinality: The Last Number Counted → Matching Numerals to Quantities → Subitizing Small Quantities → Addition Within 10 → Number Bonds to 10 → Addition Within 20 → Doubles and Near Doubles → Doubles Facts Within 10 → Near Doubles Facts Within 20 → Mental Math Strategies for Addition → Mental Math: Adding and Subtracting Tens → Addition Within 100 → Repeated Addition as Multiplication → Multiplication as Equal Groups → Multiplication: Arrays → Basic Multiplication Facts (0s, 1s, 2s, 5s, 10s) → Multiplication Facts Within 100 → Division as Equal Sharing → Division as Grouping (Measurement Division) → Division: Grouping (Repeated Subtraction) Model → Division: Fair Sharing Model → Division as Equal Sharing → Division as Grouping → Basic Division Facts → Division Facts Within 100 → Multiplication and Division Fact Families → Relationship Between Multiplication and Division → Division Facts as Inverse of Multiplication → Remainders and Quotients in Division → Division Word Problems → Multi-Step Word Problems → Solving Multi-Step Word Problems → Multiplication Word Problems → Division Word Problems → Introduction to Long Division → Factors and Multiples → Prime and Composite Numbers → Equivalent Fractions → Relating Fractions and Decimals → Decimal Place Value → Integers and the Number Line → Comparing and Ordering Integers → Absolute Value → Adding Integers → Subtracting Integers → Multiplying Integers → Introduction to Exponents → Order of Operations → Integer Order of Operations → Variable Expressions → The Distributive Property → Variables and Expressions Review → Introduction to Polynomials → Adding and Subtracting Polynomials → Multiplying Polynomials → Factorial → Permutations → Combinations → Counting Principles: Addition and Multiplication Rules → Introduction to Graph Theory → Propositional Logic Foundations → Logical Equivalences → Set Operations: Union, Intersection, and Complement → Cartesian Products and Relations → Partial Orders → Binary Relations → Equivalence Relations → Injective, Surjective, and Bijective Functions → Categories and Morphisms → Functors → Composition of Functors and Functor Equations

Longest path: 77 steps · 384 total prerequisite topics

Prerequisites (1)

Leads To (4)