11.8.5 Functors Representably Full on Cores

Let $\mathcal{C}$ and $\mathcal{D}$ be categories.

A functor $F\colon \mathcal{C}\to \mathcal{D}$ is representably full on cores if, for each $X\in \operatorname {\mathrm{Obj}}(\mathsf{Cats})$, the postcomposition by $F$ functor

\[ F_{*}\colon \mathsf{Core}(\mathsf{Fun}(\mathcal{X},\mathcal{C}))\to \mathsf{Core}(\mathsf{Fun}(\mathcal{X},\mathcal{D})) \]

is full.

In detail, a functor $F\colon \mathcal{C}\to \mathcal{D}$ is representably full on cores if, for each $\mathcal{X}\in \operatorname {\mathrm{Obj}}(\mathsf{Cats})$ and each natural isomorphism

there exists a natural isomorphism
such that we have an equality
of pasting diagrams in $\mathsf{Cats}_{\mathsf{2}}$, i.e. such that we have

\[ \beta =\operatorname {\mathrm{id}}_{F}\mathbin {\star }\alpha . \]


Noticed something off, or have any comments? Feel free to reach out!


You can also use the contact form below: