Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2411.05511 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910800767090688 |
|---|---|
| author | Forest, Simon |
| author_facet | Forest, Simon |
| contents | In this work, we investigate an effective method for showing that functors between categories are left adjoints. The method applies to a large class of categories, namely locally finitely presentable categories, which are ubiquitous in practice and include standard examples like Set, Grp, etc. Our method relies on a known description of these categories as orthogonal sub-classes of presheaf categories. The functors on which our method applies are the ones that can be presented as particular profunctors, called Kan models in this context. The method for left-adjointness then relies on computing that a particular criterion is satisfied. From this method, we also derive another method for showing that a category is cartesian closed. As proofs of concept and effectivity, we give a concrete implementation of the structures and of the left-adjointness criterion in OCaml and apply it on several examples. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2411_05511 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | A computational method for left-adjointness Forest, Simon Category Theory Logic in Computer Science 18C35 F.4.m In this work, we investigate an effective method for showing that functors between categories are left adjoints. The method applies to a large class of categories, namely locally finitely presentable categories, which are ubiquitous in practice and include standard examples like Set, Grp, etc. Our method relies on a known description of these categories as orthogonal sub-classes of presheaf categories. The functors on which our method applies are the ones that can be presented as particular profunctors, called Kan models in this context. The method for left-adjointness then relies on computing that a particular criterion is satisfied. From this method, we also derive another method for showing that a category is cartesian closed. As proofs of concept and effectivity, we give a concrete implementation of the structures and of the left-adjointness criterion in OCaml and apply it on several examples. |
| title | A computational method for left-adjointness |
| topic | Category Theory Logic in Computer Science 18C35 F.4.m |
| url | https://arxiv.org/abs/2411.05511 |