Abstract: The pinning lemma, discovered by Montanari, and independently by Raghavendra and Tan, is a useful tool that allows one to write a general distribution over a product space as a "low entropy" mixture of distributions with small covariances on average. I will motivate the statement of this lemma, discuss its proof, and provide a few different applications in combinatorics and probability.
