Newman's lemma

In mathematics, in the theory of rewriting systems, Newman's lemma, also commonly called the diamond lemma, states that a terminating (or strongly normalizing) abstract rewriting system (ARS), that is, one in which there are no infinite reduction sequences, is confluent if it is locally confluent. In fact a terminating ARS is confluent precisely when it is locally confluent.

Equivalently, for every binary relation with no decreasing infinite chains and satisfying a weak version of the diamond property, there is a unique minimal element in every connected component of the relation considered as a graph.

Today, this is seen as a purely combinatorial result based on well-foundedness due to a proof of Gérard Huet in 1980. Newman's original proof was considerably more complicated.

In general, Newman's lemma can be seen as a combinatorial result about binary relations → on a set A (written backwards, so that a → b means that b is below a) with the following two properties:

If the above two conditions hold, then the lemma states that → is confluent: whenever $a * \to b$ and $a * \to c$ , there is an element d such that $b * \to d$ and $c * \to d$ . In view of the termination of →, this implies that every connected component of → as a graph contains a unique minimal element a, moreover $b * \to a$ for every element b of the component.

...
Wikipedia