Skip to content
The Lumenary

Practice · Advanced undergraduate

Adjunctions

Adjunctions

Warm-upHuman

For the free group functor F:Set→GrpF : \cat{Set} \to \cat{Grp} and the forgetful functor U:Grp→SetU : \cat{Grp} \to \cat{Set}, which statement is correct?

Choose one

Adjunctions

Warm-upHuman

Let ∣A∣=2|A| = 2, ∣B∣=3|B| = 3 and ∣C∣=2|C| = 2. How many functions A→CBA \to C^B are there (where CBC^B is the set of functions B→CB \to C)? Check your answer against ∣Hom(A×B,C)∣|\Hom(A \times B, C)|.

Adjunctions

CoreHuman

On (Z,≤)(\Z, \le) let l(n)=2nl(n) = 2n. Its right adjoint uu satisfies 2n≤m  ⟺  n≤u(m)2n \le m \iff n \le u(m) for all integers n,mn, m. What is u(7)u(7)? (And what is u(−7)u(-7), for yourself?)

Adjunctions

CoreHuman

Given an adjunction φ:Hom(FA,B)≅Hom(A,GB)\varphi : \Hom(FA, B) \cong \Hom(A, GB), the unit is ηA=φ(idFA)\eta_A = \varphi(\mathrm{id}_{FA}). Which formula gives the counit εB:FGB→B\varepsilon_B : FGB \to B?

Choose one

Adjunctions

CoreHuman

Why does the forgetful functor U:Field→SetU : \cat{Field} \to \cat{Set} have no left adjoint?

Choose one

Adjunctions

StretchHuman

Abelianisation G↦GabG \mapsto G^{\mathrm{ab}} is left adjoint to the inclusion ι:Ab↪Grp\iota : \cat{Ab} \hookrightarrow \cat{Grp}. Which statements follow from “right adjoints preserve limits, left adjoints preserve colimits”? Select all that apply.

Choose all that apply

Adjunctions

StretchHuman

In proving that unit and counit with the triangle identities give an adjunction, we show εB∘F(Gk∘ηA)=k\varepsilon_B \circ F(Gk \circ \eta_A) = k for k:FA→Bk : FA \to B. The computation is εB∘FGk∘FηA=k∘εFA∘FηA=k\varepsilon_B \circ FGk \circ F\eta_A = k \circ \varepsilon_{FA} \circ F\eta_A = k. Which facts justify the two equalities, in order?

Choose one

Adjunctions

CoreFormal

Mathlib defines GaloisConnection l u for maps l : α → β and u : β → α between preorders. Which proposition is it?

Choose one

Adjunctions

CoreComputational

Write right_adjoint(l, P, Q, le_p, le_q) for a monotone map l (a dict) from a finite poset P to a finite poset Q. Return the dict u with l[a] ≤ b ⟺ a ≤ u[b] if it exists, using u[b] = max{a : l[a] ≤ b}, and None otherwise (including when that maximum does not exist).

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