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
\[ \beta =\text{id}_{F}\mathbin {\star }\alpha . \]
Here's a breakdown of the differences between each PDF style:
Style | Class | Font | Theorem Environments |
---|---|---|---|
Style 1 | book |
Alegreya Sans | tcbthm |
Style 2 | book |
Alegreya Sans | amsthm |
Style 3 | book |
Arno* | amsthm |
Style 4 | book |
Computer Modern | amsthm |
*To be replaced with Linus Romer's Elemaints when it is released.
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