Natural transformations
Warm-upHumanLet be functors and a family of morphisms. Which equation must hold for every for to be natural?
Let be functors and a family of morphisms. Which equation must hold for every for to be natural?
Let be the functor , . How many natural transformations are there?
Which of these families are natural transformations (between the functors indicated)? Select all that apply.
Let be a natural transformation with . What is ? Give the representative in .
In the proof that an equivalence (with , ) is full, we set for a given and showed . What is needed to conclude ?
Which statement about on the category of all vector spaces over a field is true?
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?
Which pairs of categories are equivalent? Select all that apply.
A binary operation on is stored as a tuple t with t[a * n + b] . Write natural_tables(n) returning the list of all such tables that commute with every function , i.e. t[f[a] * n + f[b]] == f[t[a * n + b]] for all (with f a tuple of values). Theorem 3 predicts the answer.