
Extremal Set Theory: Sperner's Theorem
MIT lecturer Yufei Zhao covers Sperner's theorem as part of 18.226, Probabilistic Methods in Combinatorics, taught at MIT in Fall 2024. The question driving the lecture is simple to state: how many subsets of an n-element set can you choose so that none contains another? Zhao works through the extremal set theory behind the answer, showing how probabilistic arguments, rather than pure counting, pin down the maximum size of such an antichain. The lecture builds the proof step by step on the board, connecting the result to binomial coefficients and chain decompositions of the subset lattice. It is a compact, focused segment within the course rather than a full class period, aimed at viewers already comfortable with basic combinatorics and probability notation.