Talk:Chebyshev–Markov–Stieltjes inequalities

From Wikipedia, the free encyclopedia
Jump to: navigation, search
WikiProject Russia / Science & education (Rated Start-class, Low-importance)
WikiProject icon This article is within the scope of WikiProject Russia, a WikiProject dedicated to coverage of Russia on Wikipedia.
To participate: Feel free to edit the article attached to this page, join up at the project page, or contribute to the project discussion.
Start-Class article Start  This article has been rated as Start-Class on the project's quality scale.
 Low  This article has been rated as Low-importance on the project's importance scale.
Taskforce icon
This article is supported by the science and education in Russia task force.

as zeros?[edit]

are the zeros of the polynomials ?

Clarify role of [edit]

The 's are only given for , but the moments of are supposed to match all the way up to index . Am I correct that is an arbitrary parameter which can be varied to give different 's, and hence different 's and so give tight bounds on all or almost all half-lines? Initial reading of the theorem, I had the impression that you only get information on the half-lines that come from the roots of ; but since is not uniquely determined by it seems the theorem is more powerful than was immediately apparent. Am I mistaken, or is the statement that are determined by false, and that we in fact need to determine the 's? Perhaps the role of ,etc... could be clarified in the article. I don't have any book that covers this theorem so I don't feel qualified to edit the article. (talk) 05:08, 10 February 2010 (UTC)

I am sorry, I only saw this now. Is the problem fixed in the current version? Sasha (talk) 20:44, 12 December 2011 (UTC)

Polynomial normalization[edit]

The article doesn't mention how the orthogonal polynomials are to be normalized - should the polynomials be orthonormal? Please include this information in the article. Obsolesced (talk) 10:05, 2 February 2017 (UTC)