nLab fork

Contents

Contents

Idea

A fork is a diagram of the form

AeBgfC A\underset{\quad e \quad}{\to}B\underoverset{\quad g \quad}{f}{\rightrightarrows}C

such that fe=gef e=g e. An example of a special type of a fork is an equalizer. Another example is a reflexive fork, where C=AC = A and fe=1 Af e = 1_A.

Note that, technically speaking, the diagram above may not commute, since ff and gg themselves are not necessarily equal. (But some authors, especially when talking about equalizers, loosely use the term “commutative diagram” even in this case.)

A dual notion is also called a cofork, although some references do not distinguish forks and coforks.

Last revised on January 23, 2026 at 13:50:38. See the history of this page for a list of all contributions to it.