Processing math: 100%

The Stacks project

Lemma 4.23.3. Let F : \mathcal{A} \to \mathcal{B} be a functor. Suppose all finite colimits exist in \mathcal{A}, see Lemma 4.18.7. The following are equivalent:

  1. F is right exact,

  2. F commutes with finite coproducts and coequalizers, and

  3. F transforms an initial object of \mathcal{A} into an initial object of \mathcal{B}, and commutes with pushouts.

Proof. Dual to Lemma 4.23.2. \square


Comments (0)


Your email address will not be published. Required fields are marked.

In your comment you can use Markdown and LaTeX style mathematics (enclose it like $\pi$). A preview option is available if you wish to see how it works out (just click on the eye in the toolbar).

Unfortunately JavaScript is disabled in your browser, so the comment preview function will not work.

All contributions are licensed under the GNU Free Documentation License.