Math 2.0

Category theory; homological algebra Definition

Solution set condition

Builds on CategoryFunctorMorphism

Definition

Let Gโ€‰โฃ:๐’Ÿโ†’๐’žG \colon \mathcal{D} \to \mathcal{C} be a functor between categories. GG satisfies the solution set condition if the following holds for every object cc of ๐’ž\mathcal{C}. There are a set II, objects did_i of ๐’Ÿ\mathcal{D} and morphisms fiโ€‰โฃ:cโ†’Gdif_i \colon c \to G d_i for iโˆˆIi \in I with this property. Let dd be any object of ๐’Ÿ\mathcal{D} and hโ€‰โฃ:cโ†’Gdh \colon c \to G d any morphism. Then h=G(t)โˆ˜fih = G(t) \circ f_i for some iโˆˆIi \in I and some morphism tโ€‰โฃ:diโ†’dt \colon d_i \to d.

Remarks

The family (fi)iโˆˆI(f_i)_{i \in I} is called a solution set for cc. The factorization need not be unique, and II must be a set, not a proper class.

Example: let GG be the forgetful functor from groups to sets, and let c=Xc = X be a set. Every map hโ€‰โฃ:Xโ†’GHh \colon X \to G H lands in the subgroup Hโ€ฒH' generated by h(X)h(X), which has at most maxโก(โˆฃXโˆฃ,โ„ต0)\max(\abs{X}, \aleph_0) elements. Each such Hโ€ฒH' is isomorphic to a group whose underlying set is a subset of XโŠ”โ„•X \sqcup \N. All such groups, with all maps from XX into them, form a solution set for XX.

Non-example: the forgetful functor from complete Boolean algebras to sets fails it, since it preserves limits but has no left adjoint. Indeed, there is no free complete Boolean algebra on a countably infinite set.

Reading path

To understand this page from the ground up, read these 4 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. Category concept
  2. Functor concept
  3. Morphism concept
  4. Solution set condition definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Adjoint_functors
About this page
TagH5QDJACKMS
URIm2://H5QDJACKMS
Kinddefinition
WritingW0 stub
MSC18A40
DefinesSolution set condition
UsesCategory, Functor, Morphism

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.