The Yoneda lemma
Warm-upHumanIn the Yoneda lemma , which element of corresponds to a natural transformation ?
In the Yoneda lemma , which element of corresponds to a natural transformation ?
A directed graph (allowing loops and parallel edges) has vertices and edges. View it as a functor on the category with arrows . How many graph homomorphisms are there from the walking edge — one edge from a vertex to a vertex — to ?
On the category of abelian groups, sends to its elements of order dividing , and sends to all of its elements. How many natural transformations are there?
Which of these rules define natural transformations , where is the forgetful functor (a rule must be defined for every group and commute with every homomorphism)? Choose all that apply.
In the proof that we write . Which fact justifies the second equality?
Which of these conclusions are justified for objects of a locally small category? Choose all that apply.
Let be a group. Which permutations of the set satisfy for all ?
Mathlib's coyoneda.obj (op A) is the functor . Which Lean statement formalises "if naturally, then "?
The cyclic group acts on when its generator acts by a permutation p (a list with p[x] the image of x) satisfying . An equivariant map from the regular action is a function a : Z/n → X (a list of length n) with a[(k + 1) % n] == p[a[k]] for all k. Write count_equivariant(n, p) that counts such maps by brute force over all functions (use itertools.product). The Yoneda lemma predicts the answer len(p).