nLab
congruence

Congruences

Definitions

In a finitely complete category C, a congruence on an object X is an internal equivalence relation on X.

To be precise, this consists of a subobject R(p 1,p 2)X×X equipped with the following maps:

  • internal reflexivity: r:XR which is a section both of p 1 and of p 2;

  • internal symmetry: s:RR which interchanges p 1 and p 2, namely p 1s=p 2 and p 2s=p 1;

  • internal transitivity: t:R× XRR; where with the notation for the projections in the cartesian square

    R× XR q 2 R q 1 p 1 R p 2 X\array{R \times_X R & \stackrel{q_2}\rightarrow & R\\ \downarrow^{q_1} && \downarrow^{p_1}\\ R & \stackrel{p_2}\rightarrow & X }

    the following holds: p 1q 1=p 1t and p 2q 2=p 2t.

Note that since (p 1,p 2) is a monomorphism, the maps r, s, and t are necessarily unique if they exist.

Any kernel pair is a congruence; a congruence which is the kernel pair of some morphism is called effective. The coequalizer of a congruence is called a quotient object. An effective congruence is always the kernel pair of its quotient if that quotient exists; the quotient of an effective congruence is an effective quotient. A regular category is called an exact category if every congruence is effective.

Examples

An equivalence relation is precisely a congruence in Set.

The eponymous example is congruence modulo n (for a fixed natural number n), which is a congruence on N in the category of rigs.

Remarks

A Mal'cev category is a finitely complete category in which every internal relation satisfying reflexivity is thereby actually a congruence.