Papalocal
Loading…
Papalocal · Things
Work

Newman's lemma

Newman's lemma is a lemma.

All 2 facts, and where they come from

Facts

2 facts · 0 confirmed by two sources · 0 cited · 2 from one source

What it is
lemma One source
Named after
Max Newman One source

Where this comes from

Papalocal keeps its own record. It started from these sources; what each one said is kept here as it was copied, so a change on their side never changes this page by itself. Tap one to read its version.

What Wikidata says · copied November 19, 2026 · revision 2068996290
Described as
lemma
Other names
diamond lemma
What it is
lemma
Named after
Max Newman
Wikipedias with a page
5

Wikidata item Q1208706 (wikidata.org/wiki/Q1208706), public domain (CC0). Copied 2026-11-19.

What Wikipedia says · copied November 19, 2026 · revision 1352342600

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. A considerably simpler proof (given below) was proposed by Gérard Huet. A number of other proofs exist.

From the Wikipedia article “Newman's lemma” (en.wikipedia.org/wiki/Newman's_lemma), by its contributors, under CC BY-SA 4.0 (creativecommons.org/licenses/by-sa/4.0/). Copied 2026-11-19; not changed.

Confirmed Two sources agree. Cited One source, and it names where it got it. One source One source, without a reference of its own. Sources disagree The sources disagree. We show the best-supported value and keep theirs below.

People connected 1

Known for it