Discrete Entropy of Generalized Jacobi Polynomials
Abstract
Given a sequence of orthonormal polynomials on R,\pn\n≥ 0, with pn of degree n, we define the discrete probability distribution n(x) = (n,1(x), … n,n(x) ) , with n,j(x) = (Σj=0n-1 pj2(x))-1 pj-12(x), j=1, …, n. In this paper, we study the asymptotic behavior as n ∞ of the Shannon entropy S ((n(x))= -Σj=1n n,j(x) (n,j(x)), x∈ (-1,1), when the orthogonality weight is (1-x)α\, (1+x)β\, h(x) , α, β > -1, and where h is real, analytic, and positive on [-1,1]. We show that the limit n ∞ (S ((n(x))- n) exists for all x∈ (-1,1), but its value depends on the rationality of (x)/π. For the particular case of the Chebyshev polynomials of the first and second kinds, we compare our asymptotic result with the explicit formulas for S (n(ζj(n))), where \ζj(n)\ are the zeros of pn, obtained previously in [A.I. Aptekarev, J.S. Dehesa, A. Martinez-Finkelshtein, and R. Ya\~nez, Constr. Approx., 30 (2009), pp. 93-119].
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.