The Stacks project

Lemma 4.18.3. Let $\mathcal{C}$ be a category. The following are equivalent:

  1. Nonempty finite limits exist in $\mathcal{C}$.

  2. Products of pairs and equalizers exist in $\mathcal{C}$.

  3. Products of pairs and fibre products exist in $\mathcal{C}$.

Proof. Since products of pairs, fibre products, and equalizers are limits with nonempty index categories we see that (1) implies both (2) and (3). Assume (2). Then finite nonempty products and equalizers exist. Hence by Lemma 4.14.11 we see that finite nonempty limits exist, i.e., (1) holds. Assume (3). If $a, b : A \to B$ are morphisms of $\mathcal{C}$, then the equalizer of $a, b$ is

\[ (A \times _{a, B, b} A)\times _{(\text{pr}_1, \text{pr}_2), A \times A, \Delta } A. \]

Thus (3) implies (2), and the lemma is proved. $\square$

Comments (2)

Comment #7476 by R.K on

Another description of equalizers as built from fiber products and products (which seems easier to me for it only involves one product and one fiber product) is .

Comment #7624 by on

Indeed! Hmm... not worth changing to me but if others chime in... also this occurs in more places than just here.

There are also:

  • 3 comment(s) on Section 4.18: Finite limits and colimits

Post a comment

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.

In order to prevent bots from posting comments, we would like you to prove that you are human. You can do this by filling in the name of the current tag in the following input field. As a reminder, this is tag 04AU. Beware of the difference between the letter 'O' and the digit '0'.