Category theory; homological algebra Definition
Solution set condition
Definition
Let be a functor between categories. satisfies the solution set condition if the following holds for every object of . There are a set , objects of and morphisms for with this property. Let be any object of and any morphism. Then for some and some morphism .
Remarks
The family is called a solution set for . The factorization need not be unique, and must be a set, not a proper class.
Example: let be the forgetful functor from groups to sets, and let be a set. Every map lands in the subgroup generated by , which has at most elements. Each such is isomorphic to a group whose underlying set is a subset of . All such groups, with all maps from into them, form a solution set for .
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
- no evidence level
- Category concept
- Functor concept
- Morphism concept
- Solution set condition definition
Further reading
About this page
| Tag | H5QDJACKMS |
|---|---|
| URI | m2://H5QDJACKMS |
| Kind | definition |
| Writing | W0 stub |
| MSC | 18A40 |
| Defines | Solution set condition |
| Uses | Category, 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.