Probability Inequalities

This lecture covers the concept of inequalities in probability theory, focusing on Markov's and Chebyshev's inequalities as useful tools for theoretical purposes. The instructor explains the basic inequality theorem and its applications, demonstrating how to bound probabilities and prove results using convex functions. The lecture also delves into different types of convergence, such as mean square convergence, convergence in probability, and convergence in distribution, showcasing their relationships and practical implications through examples involving random permutations and averages. Additionally, the use of moment generating functions is discussed to show how variables converge in distribution. The lecture concludes with an application of generating functions to approximate binomial distributions with Poisson distributions.