A strong law of large numbers for real roots of random polynomials
Abstract
We consider random polynomials pn(x)=0+1+…+n xn whose coefficients are independent and identically distributed with zero mean, unit variance, and bounded (2+ε)th moment (for some ε>0), also known as the Kac polynomials. Let Nn denote the number of real roots of pn. In this paper, motivated by a question from Igor Pritsker, we prove that almost surely the following convergence holds: eqnarray* n∞ Nn([-1,1]) n &=& 1 π. eqnarray* This convergence could be viewed as a local strong law for the real roots. The main ingredient in the proof is a set of maximal inequalities that reduces the proof to proving convergence along lacunary subsequences, which in turn follows from a recent concentration estimate of Can--Nguyen.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.