Statistics and Tchebysheff's theorum

  1. 1. The problem statement, all variables and given/known data

    Let k[itex]\geq[/itex]1. Show that, for any set of n measurements, the fraction included in the interval [itex]\overline{y}[/itex]-ks to [itex]\overline{y}[/itex]+ks is at least (1-1/k2).

    [Hint: s2 = 1/(n-1)[[itex]\sum[/itex](yi-[itex]\overline{y}[/itex])2]. In this expression, replace all deviations for which the absolute value of (yi-[itex]\overline{y}[/itex])[itex]\geq[/itex]ks with ks. Simplify.] This result is known as Tchebysheff's theorem.

    2. Relevant equations are the above.

    3. The attempt at a solution

    I've got no clue what the problem wants, much less how to start a solution.
  2. jcsd
  3. Stephen Tashi

    Stephen Tashi 4,311
    Science Advisor
    2014 Award

    Let there be [itex] M [/itex] measurements where [itex]| y_i - \overline{y}| \geq ks[/itex]
    If in the sum [itex] \sum(y_i -\overline{y})^2 [/itex] we replace those [itex]M[/itex] measurements by [itex] ks [/itex] and leave out the other [itex] N-M [/itex] measurements, we get a smaller sum. The smaller sum is [itex] M (ks)^2 [/itex]


    [tex] s^2 = \frac{1}{n-1} \sum(y_i - \overline{y})^2 \geq \frac{1}{n-1} M (ks)^2 [/tex]

    Since [itex] \frac{1}{n-1} > \frac{1}{n} [/itex]

    [tex] s^2 \geq \frac{1}{n-1}M(ks)^2 > \frac{1}{n}M(ks)^2 [/tex]
    [tex] s^2 \geq \frac{1}{n}M(ks)^2 [/tex]

    The "fraction of measurements" that [itex] M [/itex] constitutes is [itex] \frac{M}{n} [/itex] and the above inequality can be used to bound it.

    The original problem concerns the fraction of measurements other than those M measurements, so that fraction is [itex] 1.0 - \frac{M}{n} [/itex].
    That needs to be bounded by using the bound for [itex] \frac{M}{n} [/itex].
  4. Thank you Stephen. That was part of my homework I was struggling with. I wonder which school OP goes :-).

    To be really pedantic, should not the last equation have > sign instead of >=?
    Last edited: Sep 7, 2011
  5. When we take a look at the definition of theorem number two, we see that the theorem refers to the standard deviation of the possible sample means computed from all possible random samples. Theorem number one is similar in that it says for any population, the average value of all possible sample means computed from all possible random samples of a given size from the population equal the population mean. What does that mean? Does that mean that the mean of my sample will automatically be equal to the population mean?
Know someone interested in this topic? Share a link to this question via email, Google+, Twitter, or Facebook

Have something to add?