Here is a 3-paragraph summary of the blog post for mathopen.com:
One of the most famous open problems in probability theory has finally been resolved. The conjecture that θ(p꜀) = 0, meaning that percolation does not occur at the critical probability, has now been proven in all dimensions. This result closes a long-standing question that has captivated mathematicians working in the field of percolation theory for decades.
The breakthrough came in 2024 when mathematicians Gady Kozma and Shahaf Nitzan discovered a powerful new approach. They showed that the dying percolation conjecture could be derived from a broader conjecture about percolation behavior on general graphs. This strategic reduction opened a new pathway to the proof that previous methods had failed to provide.
Perhaps most remarkably, the final solution was achieved with the assistance of AI, marking a significant moment in the history of mathematical discovery. The result confirms that at the precise critical threshold of connectivity, infinite clusters simply do not form, no matter how many dimensions are considered. This achievement represents a major milestone for both probability theory and the growing role of artificial intelligence as a tool for tackling deep mathematical problems.