From asymptotic distribution and vague convergence to uniform convergence, with numerical applications
Abstract
Let \n=\λ1,n,…,λdn,n\\n be a sequence of finite multisets of real numbers such that dn∞ as n∞, and let f:⊂ Rd R be a Lebesgue measurable function defined on a domain with 0<μd()<∞, where μd is the Lebesgue measure in Rd. We say that \n\n has an asymptotic distribution described by f, and we write \n\n f, if \[ n∞1dnΣi=1dnF(λi,n)=1μd()∫ F(f( x)) d x(*) \] for every continuous function F with bounded support. If n is the spectrum of a matrix An, we say that \An\n has an asymptotic spectral distribution described by f and we write \An\nλ f. In the case where d=1, ~is a bounded interval, n⊂eq f() for all n, and f satisfies suitable conditions, Bogoya, B\"ottcher, Grudsky, and Maximenko proved that the asymptotic distribution (*) implies the uniform convergence to 0 of the difference between the properly sorted vector [λ1,n,…,λdn,n] and the vector of samples [f(x1,n),…,f(xdn,n)], i.e., \[ n∞\,i=1,…,dn|f(xi,n)-λτn(i),n|=0, (**) \] where x1,n,…,xdn,n is a uniform grid in and τn is the sorting permutation. We extend this result to the case where d1 and is a Peano--Jordan measurable set (i.e., a bounded set with μd(∂)=0). See the rest of the abstract in the manuscript.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.