Math 2.0

Category theory; homological algebra Adjunctions Theorem

Special adjoint functor theorem

Builds on Complete categoryWell-powered categoryGeneratorPreservation of limitsAdjoint functors

Statement

Let π’Ÿ\mathcal{D} be a complete category whose hom-sets are sets. Assume that π’Ÿ\mathcal{D} is well-powered and has a cogenerating set. Let π’ž\mathcal{C} be a category whose hom-sets are sets, and let G ⁣:π’Ÿβ†’π’žG \colon \mathcal{D} \to \mathcal{C} be a functor. Then GG has a left adjoint if and only if GG preserves limits of small diagrams.

Remarks

Here a set QQ of objects is cogenerating when, for any two different morphisms f,g ⁣:aβ†’bf, g \colon a \to b, some q ⁣:bβ†’xq \colon b \to x with x∈Qx \in Q has qfβ‰ qgq f \neq q g. This is the dual of a generator. The proof constructs an initial object of each comma category c↓Gc \downarrow G. Let PP be the product of copies of xx, one for each x∈Qx \in Q and each morphism cβ†’Gxc \to G x. Then one intersects all subobjects SS of PP such that the induced map cβ†’GPc \to G P factors through GSG S. Well-poweredness makes this intersection a small limit.

Example: the category of compact Hausdorff spaces is complete and well-powered, and the unit interval [0,1][0, 1] is a cogenerator. The inclusion into topological spaces preserves limits. So it has a left adjoint, the Stoneβ€“ΔŒech compactification.

Going deeper

For a student

Compared with Freyd's general theorem, the solution set condition is replaced by well-poweredness and a cogenerating set in π’Ÿ\mathcal{D}. These conditions concern only π’Ÿ\mathcal{D}, so they are checked once for all functors out of π’Ÿ\mathcal{D}. The dual theorem gives right adjoints of colimit-preserving functors out of a cocomplete, co-well-powered category with a generating set. For instance, every colimit-preserving functor from a category of presheaves on a small category has a right adjoint.

Reading path

To understand this page from the ground up, read these 6 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Adjoint functors concept
  2. Complete category concept
  3. Generator concept
  4. Preservation of limits concept
  5. Well-powered category concept
  6. Special adjoint functor theorem statement

Further reading

  1. Web https://en.wikipedia.org/wiki/Adjoint_functors
About this page
TagE33H1J8S53
URIm2://E33H1J8S53
Kindstatement, theorem
WritingW0 stub
MSC18A40, 18A35
StatusThis copy of the site has no build data. Run m2 status E33H1J8S53.
AboutAdjoint functors
UsesComplete category, Well-powered category, Generator, Preservation of limits, Adjoint functors

Markdown Β· JSON Β· Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.