The Diamond Lemma

·LessWrong··

I found this result useful for a few different problems I was thinking about recently. It cleared up a lot of confusion I had around simplification rules. First I give a semiformal statement of the lemma and some applications. At the end I give a formal statement and proof.SetupSuppose you have a set S and some possible transitions where one element of S “simplifies” into another. The diamond lemma has two requirements:There is no infinite chain of simplifications. If you start somewhere and kee...

Read full article →

Related Articles

Anthropic S-1
SiNTEx · Hacker News · 18h ago
Solar power is becoming bigger than nuclear
geox · Hacker News · 16h ago
The Exponential Time Hypothesis Is False [pdf]
vok · Hacker News · 9h ago
Oldest GUI application that still runs on Windows 11
enlyth · Hacker News · 13h ago
Type Server Protocol
adamnemecek · Hacker News · 13h ago