A Bayesian Proof of the Spread Lemma
Author(s)
Mossel, Elchanan; Niles‐Weed, Jonathan; Sun, Nike; Zadik, Ilias
DownloadPublished version (188.5Kb)
Publisher with Creative Commons License
Publisher with Creative Commons License
Creative Commons Attribution
Terms of use
Metadata
Show full item recordAbstract
A key set-theoretic “spread” lemma has been central to two recent celebrated results in combinatorics: the recentimprovements on the sunflower conjecture by Alweiss, Lovett, Wu, and Zhang; and the proof of the fractionalKahn–Kalai conjecture by Frankston, Kahn, Narayanan, and Park. In this work, we present a new proof of the spreadlemma, that—perhaps surprisingly—takes advantage of an explicit recasting of the proof in the language of Bayesianinference. We show that from this viewpoint the reasoning proceeds in a straightforward and principled probabilisticmanner, leading to a truncated second moment calculation which concludes the proof.
Date issued
2025-06-06Department
Massachusetts Institute of Technology. Department of MathematicsJournal
Random Structures & Algorithms
Publisher
Wiley
Citation
Mossel, E., Niles-Weed, J., Sun, N. and Zadik, I. (2025), A Bayesian Proof of the Spread Lemma. Random Struct Alg, 66: e70008.
Version: Final published version