9.8.5 Functors Representably Full on Cores

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

Definition 9.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 \text{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 9.8.5.1.2 ▶ Unwinding Definition 9.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 \text{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 =\text{id}_{F}\mathbin {\star }\alpha . \]

Question 9.8.5.1.3 ▶ Characterisation of Functors Representably Full on Cores

Is there a characterisation of functors representably full on cores?

This question also appears as [MO 468125].

Previous
Next

View Subsection 9.8.5 as PDF

Statistics Cite

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

You can also use the contact form below: