Skip to content
The Lumenary

Practice · Advanced undergraduate

Representable functors

Representable functors

Warm-upHuman

Which pair (A,u)(A, u) is a universal element of the forgetful functor U:Ab→SetU : \cat{Ab} \to \cat{Set} from abelian groups to sets?

Choose one

Representable functors

CoreHuman

The group Z2=⟨a,b∣ab=ba⟩\Z^2 = \langle a, b \mid ab = ba \rangle represents the functor sending a group GG to the set of commuting pairs {(x,y)∈G2∣xy=yx}\{(x, y) \in G^2 \mid xy = yx\}. How many group homomorphisms Z2→S3\Z^2 \to S_3 are there?

Representable functors

CoreHuman

How many different natural isomorphisms Hom(Z,−)⇒U\Hom(\Z, -) \Rightarrow U are there, where U:Grp→SetU : \cat{Grp} \to \cat{Set} is the forgetful functor?

Representable functors

CoreHuman

Which pairs (A,u)(A, u) with u⊆Au \subseteq A are universal elements of the contravariant power-set functor P:Setop→Set\mathcal{P} : \cat{Set}^{\mathrm{op}} \to \cat{Set} (acting by preimage)? Choose all that apply.

Choose all that apply

Representable functors

CoreHuman

In the proof of Theorem 2 we have φ:A→A′\varphi : A \to A' with F(φ)(u)=u′F(\varphi)(u) = u' and ψ:A′→A\psi : A' \to A with F(ψ)(u′)=uF(\psi)(u') = u. Why is ψ∘φ=idA\psi \circ \varphi = \id_A?

Choose one

Representable functors

CoreHuman

Which of these functors Set→Set\cat{Set} \to \cat{Set} is not representable?

Choose one

Representable functors

StretchHuman

Let F:Topop→Set\mathcal{F} : \cat{Top}^{\mathrm{op}} \to \cat{Set} send a space to its set of closed subsets (a continuous map acts by preimage). Which pair represents F\mathcal{F}? Here S={0,1}\mathbb{S} = \{0, 1\} is the Sierpiński space with open sets ∅,{1},{0,1}\varnothing, \{1\}, \{0, 1\}.

Choose one

Representable functors

CoreFormal

In the lesson's Lean file, imagePowerset : Type ⥤ Type is the covariant power-set functor (direct images). Which Lean statement says that it is not representable, i.e. that no type AA represents it?

Choose one

Representable functors

CoreComputational

Since Z/n=⟨a∣an⟩\Z/n = \langle a \mid a^n \rangle represents G↦{g∈G∣gn=1}G \mapsto \{g \in G \mid g^n = 1\}, the number of homomorphisms Z/n→Z/m\Z/n \to \Z/m equals the number of k∈Z/mk \in \Z/m with nk≡0(modm)nk \equiv 0 \pmod m. Write hom_count(n, m) computing this number (for n,m≥1n, m \ge 1). Then compare your answers with gcd⁡(n,m)\gcd(n, m).

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