Skip to content
The Lumenary

Practice · Advanced undergraduate

The Yoneda lemma

The Yoneda lemma

Warm-upHuman

In the Yoneda lemma Nat(Hom(A,−),F)≅F(A)\mathrm{Nat}(\Hom(A, -), F) \cong F(A), which element of F(A)F(A) corresponds to a natural transformation α:Hom(A,−)⇒F\alpha : \Hom(A, -) \Rightarrow F?

Choose one

The Yoneda lemma

Warm-upHuman

A directed graph GG (allowing loops and parallel edges) has 77 vertices and 1212 edges. View it as a functor on the category E\mathbb{E} with arrows s,t:E→Vs, t : E \to V. How many graph homomorphisms are there from the walking edge Hom(E,−)\Hom(E, -) — one edge from a vertex ss to a vertex tt — to GG?

The Yoneda lemma

CoreHuman

On the category Ab\cat{Ab} of abelian groups, Hom(Z/3,−)\Hom(\Z/3, -) sends GG to its elements of order dividing 33, and Hom(Z,−)\Hom(\Z, -) sends GG to all of its elements. How many natural transformations Hom(Z/3,−)⇒Hom(Z,−)\Hom(\Z/3, -) \Rightarrow \Hom(\Z, -) are there?

The Yoneda lemma

CoreHuman

Which of these rules define natural transformations U⇒UU \Rightarrow U, where U:Grp→SetU : \cat{Grp} \to \cat{Set} is the forgetful functor (a rule must be defined for every group and commute with every homomorphism)? Choose all that apply.

Choose all that apply

The Yoneda lemma

CoreHuman

In the proof that Ψ(Φ(α))=α\Psi(\Phi(\alpha)) = \alpha we write αX(f)=αX(f∘idA)=F(f)(αA(idA))\alpha_X(f) = \alpha_X(f \circ \id_A) = F(f)(\alpha_A(\id_A)). Which fact justifies the second equality?

Choose one

The Yoneda lemma

CoreHuman

Which of these conclusions are justified for objects A,BA, B of a locally small category? Choose all that apply.

Choose all that apply

The Yoneda lemma

StretchHuman

Let GG be a group. Which permutations σ\sigma of the set GG satisfy σ(xh)=σ(x)h\sigma(xh) = \sigma(x)h for all x,h∈Gx, h \in G?

Choose one

The Yoneda lemma

CoreFormal

Mathlib's coyoneda.obj (op A) is the functor Hom(A,−)\Hom(A, -). Which Lean statement formalises "if Hom(A,−)≅Hom(B,−)\Hom(A, -) \cong \Hom(B, -) naturally, then A≅BA \cong B"?

Choose one

The Yoneda lemma

CoreComputational

The cyclic group Z/n\Z/n acts on X={0,…,m−1}X = \{0, \dots, m-1\} when its generator acts by a permutation p (a list with p[x] the image of x) satisfying pn=idp^n = \mathrm{id}. 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).

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