Processing math: 100%

The Stacks project

Definition 4.23.1. Let F : \mathcal{A} \to \mathcal{B} be a functor.

  1. Suppose all finite limits exist in \mathcal{A}. We say F is left exact if it commutes with all finite limits.

  2. Suppose all finite colimits exist in \mathcal{A}. We say F is right exact if it commutes with all finite colimits.

  3. We say F is exact if it is both left and right exact.


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.