Knuth on Huang's Sensitivity Proof: “I've got the proof down to one page” [pdf] (scottaaronson.com)

Article summary

Hao Huang, a mathematician at Emory University, has posted a 6-page preprint that proves the Sensitivity Conjecture, a problem that has stood as one of the most frustrating and embarrassing open problems in combinatorics and theoretical computer science since it was posed in 1989. The proof is considered surprisingly simple and elegant. Donald Knuth has also commented on the proof, saying he has simplified it to one page. The conjecture has implications for various complexity measures of Boolean functions.

Main themes

• Sensitivity Conjecture
• mathematical proofs
• complexity theory
• Boolean functions
• elegance in mathematics

What commenters say

• The proof of the Sensitivity Conjecture is surprisingly simple and elegant, considering the problem's difficulty and the time it took to solve it. Some people find it humbling to see such a complex problem solved with relatively little mathematical machinery. The ability to simplify complex problems is a hallmark of great mathematicians, and this proof is a testament to the power of human intuition and creativity. The resolution of the Sensitivity Conjecture has significant implications for the field of complexity theory and Boolean functions. The proof's simplicity has sparked discussions about the nature of mathematical elegance and the importance of presenting complex ideas in a clear and concise manner. Some commentators have noted that the proof's brevity and simplicity make it accessible to a wide range of readers, despite the complexity of the underlying mathematics. The story of the proof's discovery has also led to reflections on the role of perseverance and percolation in mathematical discovery.