Newman's lemma

In theoretical computer science, specifically in term rewriting, Newman's lemma, also commonly called the diamond lemma, is a criterion to prove that an abstract rewriting system is confluent. It states that local confluence is a sufficient condition for confluence, provided that the system is also terminating. This is useful since local confluence is usually easier to verify than confluence.

The lemma was originally proved by Max Newman in 1942.^[1][2] A considerably simpler proof (given below) was proposed by Gérard Huet.^[3] A number of other proofs exist.^[4]

The lemma is purely combinatorial and applies to any relation. Owing to the context where it is commonly applied, it is stated below in the terminology of abstract rewriting systems (this is simply a set whose elements are called terms, equipped with a relation ${\displaystyle \to }$ called reduction, and see the corresponding article for definitions of termination, confluence, local confluence and normal forms).

Newman's lemma:^[5][6][7][8] If an abstract rewriting system is terminating and locally confluent, then it is confluent. As a corollary, every term has a unique normal form.

Proof: We prove by well-founded induction on ${\displaystyle u}$ along ${\displaystyle \to }$ that every diagram

can be extended to a diagram

where the dotted arrows represent sequences of arbitrarily many reductions by ${\displaystyle \to }$.

If ${\displaystyle u=v}$ or ${\displaystyle u=w}$, this is trivial. Otherwise, we have at least one reduction on each side:

By local confluence, this diagram can be extended to:

then by induction hypothesis on ${\displaystyle v_{0}}$:

and finally, by induction hypothesis on ${\displaystyle w_{0}}$:

A related result was shown by Kimmo Eriksson in 1993.^[9][10] Recall that an abstract rewriting system is locally confluent if for any two reductions ${\displaystyle a\to b}$ and ${\displaystyle a\to c}$, there exists ${\displaystyle d}$ such that ${\displaystyle b\to ^{*}d}$ and ${\displaystyle c\to ^{*}d}$. If additionally it is required that the reduction chains ${\displaystyle b\to ^{*}d}$ and ${\displaystyle c\to ^{*}d}$ have the same length, then the system is said to have the polygon property. Examples of rewriting systems with the polygon property include bubble sort and the chip-firing game.

Eriksson's polygon property lemma shows that if an abstract rewriting system is terminating and has the polygon property, then not only is it confluent (according to Newman's lemma), but additionally every terminating chain of reductions from a given state has the same length.

• Diamond lemma at PlanetMath.