11.8.5 Functors Representably Full on Cores

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

Definition 11.8.5.1.1 ▶ Functors Representably Full on Cores

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

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

is full.

Remark 11.8.5.1.2 ▶ Unwinding Definition 11.8.5.1.1

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}}\webleft (\mathsf{Cats}\webright )$ 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 . \]

Question 11.8.5.1.3 ▶ Characterisation of Functors Representably Full on Cores
Up
Next

View Definition 11.8.5.1.1 as PDF
Statistics Cite

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

You can also use the contact form below: