Skip to content
The Lumenary

Each worksheet prints cleanly on A4 or Letter. Answer keys are on a separate page.

The Lumenary · Advanced undergraduate

Natural transformations

Name: ______________________

Date: ______________________

You will learn to

  • Define natural transformations and natural isomorphisms, and verify naturality for the double-dual map V→V∗∗V \to V^{**} and the determinant GLn(R)→R×\mathrm{GL}_n(R) \to R^\times, natural in the commutative ring RR
  • Explain why V≅V∗∗V \cong V^{**} is natural while V≅V∗V \cong V^* cannot even be stated as a natural transformation between functors of the same variance, and prove that it fails even on the groupoid of isomorphisms over a field with more than three elements
  • Prove that functors C→D\mathcal{C} \to \mathcal{D} and natural transformations form a category [C,D][\mathcal{C}, \mathcal{D}], in which the isomorphisms are exactly the natural transformations with invertible components
  • Use naturality as a uniformity constraint, for example to show that the only natural maps X×X→XX \times X \to X on sets are the two projections
  • Define equivalence of categories and prove that a functor is an equivalence if and only if it is full, faithful and essentially surjective
  1. 1.

    Let F,G:C→DF, G : \mathcal{C} \to \mathcal{D} be functors and αA:F(A)→G(A)\alpha_A : F(A) \to G(A) a family of morphisms. Which equation must hold for every f:A→Bf : A \to B for α\alpha to be natural?

    • A.G(f)∘αA=αB∘F(f)G(f) \circ \alpha_A = \alpha_B \circ F(f)
    • B.F(f)∘αA=αB∘G(f)F(f) \circ \alpha_A = \alpha_B \circ G(f)
    • C.αB∘G(f)=G(f)∘αA\alpha_B \circ G(f) = G(f) \circ \alpha_A
    • D.αA=αB\alpha_A = \alpha_B whenever there is an arrow A→BA \to B
  2. 2.

    Let T:Set→SetT : \cat{Set} \to \cat{Set} be the functor T(X)=X×X×XT(X) = X \times X \times X, T(f)=f×f×fT(f) = f \times f \times f. How many natural transformations T⇒idSetT \Rightarrow \mathrm{id}_{\cat{Set}} are there?

  3. 3.

    Which of these families are natural transformations (between the functors indicated)? Select all that apply.

    • A.revX:L(X)→L(X)\mathrm{rev}_X : L(X) \to L(X), reversing a finite list (on Set\cat{Set}, with LL the list functor)
    • B.X→L(X)X \to L(X), x↦[x,x]x \mapsto [x, x] (from idSet\mathrm{id}_{\cat{Set}} to LL)
    • C.qG:G→G/[G,G]q_G : G \to G/[G, G] (from idGrp\mathrm{id}_{\cat{Grp}} to abelianisation)
    • D.sorting a list of integers into increasing order, as a map L(Z)→L(Z)L(\Z) \to L(\Z) “natural in the set of entries”
    • E.det⁡:GLn(R)→R×\det : \mathrm{GL}_n(R) \to R^\times (from GLn\mathrm{GL}_n to (−)×(-)^\times, functors CRing→Grp\cat{CRing} \to \cat{Grp})
  4. 4.

    Let α:idAb⇒idAb\alpha : \mathrm{id}_{\cat{Ab}} \Rightarrow \mathrm{id}_{\cat{Ab}} be a natural transformation with αZ(1)=7\alpha_{\Z}(1) = 7. What is αZ/12(5)\alpha_{\Z/12}(5)? Give the representative in {0,1,…,11}\{0, 1, \dots, 11\}.

  5. 5.

    In the proof that an equivalence FF (with η:id≅GF\eta : \mathrm{id} \cong GF, ε:FG≅id\varepsilon : FG \cong \mathrm{id}) is full, we set f=ηB−1∘G(h)∘ηAf = \eta_B^{-1} \circ G(h) \circ \eta_A for a given h:F(A)→F(B)h : F(A) \to F(B) and showed GF(f)=G(h)GF(f) = G(h). What is needed to conclude F(f)=hF(f) = h?

    • A.That GG is faithful, which follows from the same argument applied to GG (using ε−1\varepsilon^{-1})
    • B.That FF is faithful
    • C.The axiom of choice
    • D.Nothing: GF(f)=G(h)GF(f) = G(h) already means F(f)=hF(f) = h
  6. 6.

    Which statement about evV:V→V∗∗\mathrm{ev}_V : V \to V^{**} on the category of all vector spaces over a field kk is true?

    • A.ev\mathrm{ev} is natural, every component is injective, but for infinite-dimensional VV it is not surjective
    • B.ev\mathrm{ev} is a natural isomorphism on all vector spaces
    • C.ev\mathrm{ev} is natural only on finite-dimensional spaces
    • D.evV\mathrm{ev}_V fails to be injective for some infinite-dimensional VV
  7. 7.

    Mathlib writes composition in diagrammatic order: f ≫ g means “first f, then g”. For α : F ⟶ G between functors C ⥤ D and f : X ⟶ Y in C, which Lean statement is the naturality square?

    • A.F.map f ≫ α.app Y = α.app X ≫ G.map f
    • B.α.app Y ≫ F.map f = G.map f ≫ α.app X
    • C.F.map f ≫ G.map f = α.app X ≫ α.app Y
    • D.α.app X = α.app Y
  8. 8.

    Which pairs of categories are equivalent? Select all that apply.

    • A.FinVectR\cat{FinVect}_{\R} and MatR\cat{Mat}_{\R} (objects n∈Nn \in \N, morphisms matrices)
    • B.FinSet\cat{FinSet} and its full subcategory on the sets {1,…,n}\{1, \dots, n\}, n≥0n \ge 0
    • C.Set\cat{Set} and Setop\cat{Set}^{\mathrm{op}}
    • D.the category with two objects and exactly one arrow between any two objects, and the category 1\mathbf{1}
    • E.BZ/2\mathbf{B}\Z/2 and BZ/3\mathbf{B}\Z/3 (one-object categories of the groups)
  9. 9.

    A binary operation on X={0,…,n−1}X = \{0, \dots, n-1\} is stored as a tuple t with t[a * n + b] =α(a,b)= \alpha(a, b). Write natural_tables(n) returning the list of all such tables that commute with every function f:X→Xf : X \to X, i.e. t[f[a] * n + f[b]] == f[t[a * n + b]] for all a,ba, b (with f a tuple of values). Theorem 3 predicts the answer.

    Computational — Practice

Code: Apache-2.0 · Content: CC BY-SA 4.0