Zeros of Chebyshev polynomials in Markov systems (Q809282): Difference between revisions

Let \(M:=\{g_ 1=1,g_ 2,...,g_ n,...\}\) be an infinite Markov system of continuous functions on [a,b]. The paper studies the relation between the densedness of span M in C[a,b] and the densedness of the set of zeros of the suitably defined generalized Chebyshev polynomials associated with this system. Under the mild assumption that \(g_ i\in C^ 1(a,b)i=1,3,..\). and that \(\{g_ 2',...,g_ n'\}\) is a Haar system for every \(n\geq 2\) the author proves that the two densedness properties are equivalent. Also given are some estimates on the degree of approximation by linear combinations of elements of M, by means of the mesh size of the partition formed by the roots of the n-th generalized Chebyshev polynomial. Finally for nondense Müntz polynomials it is shown that the set of zeros is nowhere dense.