Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated


Statement

Setting (pp. 3--4). pn(x)=ξ0+ξ1x+⋯+ξnxnp_n(x)=\xi_0+\xi_1x+\cdots+\xi_nx^n, with one coefficient sequence for all degrees (the distribution of ξj\xi_j does not depend on nn), and Nn(I)N_n(I) counts the real roots of pnp_n in II.

Lemma 2.3 (p. 4). Let the coefficients ξj\xi_j be independent with zero mean, unit variance and uniformly bounded (2+ϵ)th(2+\epsilon)^{th} moments, and let 1≤n1<n2<⋯1\le n_1<n_2<\cdots be integers with inf⁡knk+1/nk>1\inf_k n_{k+1}/n_k>1. Then almost surely

lim⁡k→∞Nnk[0,1]log⁡(nk)=12π.\lim_{k\to\infty}\frac{N_{n_k}[0,1]}{\log(n_k)}=\frac{1}{2\pi}.

The lemma closes (quoted): "The same conclusion also holds for [−1,0][-1,0], [1,∞)[1,\infty), (−∞,1](-\infty,1] [sic], and R\mathbb{R}."

Notes on that sentence. The interval (−∞,1](-\infty,1] is as printed; the list of intervals in the proof (p. 6) has (−∞,−1](-\infty,-1] in its place. What the proof (p. 6) establishes for each interval II of that list, which includes R\mathbb R, is the almost sure limit Nnk(I)/ENnk(I)→1N_{n_k}(I)/\mathbb EN_{n_k}(I)\to1; the constant in the limit of Nnk(I)/log⁡nkN_{n_k}(I)/\log n_k is then the one in the expectation, and for R\mathbb R the paper recalls on p. 2 that ENn=2πlog⁡n+O(1)\mathbb EN_n=\frac2\pi\log n+O(1) under zero mean, unit variance and a finite (2+ϵ)th(2+\epsilon)^{th} moment (its reference [61]), not 12πlog⁡n\frac1{2\pi}\log n.

Proof pointer

Section 2.1, pp. 5--6. Can and Nguyen's concentration estimate (the paper's reference [12], Theorems 1.4 and 1.5) bounds P(∣Nn(I)−ENn(I)∣≥ϵlog⁡n)\mathbf P(|N_n(I)-\mathbb EN_n(I)|\ge\epsilon\log n) by ≪ϵe−cϵlog⁡n\ll_\epsilon e^{-c_\epsilon\sqrt{\log n}}, hence by ≪ϵ(log⁡n)−2\ll_\epsilon(\log n)^{-2}, for II one of R\mathbb R, [0,1][0,1], [1,∞)[1,\infty), [−1,0][-1,0], (−∞,−1](-\infty,-1]. Along a lacunary sequence log⁡nk\log n_k grows at least linearly in kk, so these bounds are summable; Borel--Cantelli and ϵ→0\epsilon\to0 along a countable sequence give the limit.

Read depth

Claims checked: the statement and the proof in Section 2.1 were read clause by clause on the page images of the print. The Can--Nguyen estimate is cited, not proved, in the paper and was not read. Nothing here is independently reviewed.

Dependencies

The concentration estimate of Can and Nguyen, external to the corpus. Used by Theorem 1.1.

Source. Yen Q. Do, A strong law of large numbers for real roots of random polynomials, arXiv:2403.06353 (2024); the edition read is named on the source card.

Bears on

  • Problem 521: the lemma's closing sentence includes R\mathbb R, and its proof, written out for [0,1][0,1] and said to be the same for the other intervals, gives, for independent uniform signs ±1\pm1, the almost sure limit Nnk(R)/ENnk(R)→1N_{n_k}(\mathbb R)/\mathbb EN_{n_k}(\mathbb R)\to1 along every sequence of degrees with inf⁡knk+1/nk>1\inf_k n_{k+1}/n_k>1. This concerns lacunary degree sequences only; the paper does not extend it to all nn.