Mathematical Dossier: Proved Theorems vs. Open Conjectures
Decades of breakthroughs in rigorous probability theory from 1957 to the 2022 Fields Medal.
ā Rigorously Proved Milestones
Proved analytically that for bond percolation on the square lattice, the critical threshold is exactly pc = 1/2, resolving Broadbent and Hammersley's foundational question.
Established correlation inequalities showing that increasing occupancy strictly increases the likelihood of positive flow events (non-negative association).
Proved that for any d ā„ 2 and any p > pc, there is almost surely exactly one unique infinite connected cluster.
Demonstrated universal sharp threshold behavior across generic dependent percolation models and random-cluster systems using randomized algorithms and Boolean analysis.
ā” Active Open Conjectures
While rigorously proved that 0.2488 < pc(ā¤Ā³) < 0.2489, no exact closed-form algebraic expression is known. 3D percolation remains notoriously resistant to 2D dualities.
In d=2, exponents are known via Schramm-Loewner Evolution (SLE); in d ā„ 6, mean-field theory holds. The intermediate spatial dimensions (d=3, 4, 5) remain unproven non-perturbative mysteries.
Stanislav Smirnov (2001) proved conformal invariance of critical site percolation on the 2D triangular grid. Proving or disproving analogous spatial symmetries in d=3 is completely open.