Skip to content
The Lumenary

Practice · Advanced undergraduate

Natural transformations

Natural transformations

Warm-upHuman

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?

Choose one

Natural transformations

CoreHuman

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?

Natural transformations

CoreHuman

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

Choose all that apply

Natural transformations

CoreHuman

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\}.

Natural transformations

CoreHuman

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?

Choose one

Natural transformations

StretchHuman

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?

Choose one

Natural transformations

CoreFormal

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?

Choose one

Natural transformations

StretchHuman

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

Choose all that apply

Natural transformations

StretchComputational

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.

Runs entirely in your browser, in an isolated worker. Nothing is sent to a server.