{
  "id": "chebyshevs-inequality",
  "title": "Chebyshev's Inequality",
  "lang": "en",
  "source_lang": "en",
  "summary": "Chebyshev’s inequality bounds the probability that a random variable deviates from its mean using only its variance.",
  "category": "mathematics",
  "subcategory": "probability-statistics",
  "type": "concept",
  "aliases": [
    "Bienaymé–Chebyshev inequality",
    "Chebyshev inequality",
    "Tchebychev's inequality"
  ],
  "generated_at": "2026-10-04",
  "model": "pro/gpt-6.1-sol",
  "url": "https://aiwiki.page/en/chebyshevs-inequality/",
  "translations": {
    "zh-Hans": {
      "url": "https://aiwiki.page/zh/chebyshevs-inequality/",
      "json": "https://aiwiki.page/zh/chebyshevs-inequality.json"
    }
  },
  "sections": [
    {
      "heading": "",
      "text": "Chebyshev’s inequality is a theorem in probability theory that bounds the probability of a random variable lying far from its mean. It requires only a finite variance, rather than knowledge of the full probability distribution. Consequently, it applies to discrete, continuous, and mixed distributions without assumptions of symmetry or normality. (ocw.mit.edu)"
    },
    {
      "heading": "Statement and interpretation",
      "text": "Let \\(X\\) be a real-valued random variable with expected value \\(\\mu=\\mathbb E[X]\\) and finite variance\n\n\\[\\sigma^2=\\mathbb E[(X-\\mu)^2].\\]\n\nFor every \\(t>0\\),\n\n\\[\\boxed{\\Pr(|X-\\mu|\\ge t)\\le \\frac{\\sigma^2}{t^2}.}\\]\n\nSince a probability cannot exceed one, the bound can also be written as\n\n\\[\\Pr(|X-\\mu|\\ge t)\\le \\min\\left\\{1,\\frac{\\sigma^2}{t^2}\\right\\}.\\]\n\nThus, small variance limits the probability of large deviations from the mean. (ocw.mit.edu)\n\nWhen \\(\\sigma>0\\), expressing the threshold in units of standard deviation gives, for every \\(k>0\\),\n\n\\[\\Pr(|X-\\mu|\\ge k\\sigma)\\le \\frac{1}{k^2}.\\]\n\nEquivalently,\n\n\\[\\Pr(|X-\\mu|<k\\sigma)\\ge 1-\\frac{1}{k^2}.\\]\n\nFor example, at least \\(75\\%\\) of the probability lies strictly within two standard deviations of the mean, and at least \\(8/9\\), approximately \\(88.9\\%\\), lies strictly within three. These are guaranteed lower bounds, not exact probabilities. For \\(k\\le1\\), the standardized bound supplies no information beyond the ordinary probability bounds. (stat.berkeley.edu)\n\nThe strict and non-strict inequalities distinguish the central interval from its complement: the event \\(|X-\\mu|\\ge t\\) includes its boundary, whereas \\(|X-\\mu|<t\\) excludes it. If \\(\\sigma^2=0\\), then \\(X=\\mu\\) almost surely, so the probability of any positive deviation is zero. Infinite variance makes the usual bound uninformative. (doi.org)"
    },
    {
      "heading": "Proof",
      "text": "The inequality follows from Markov’s inequality, which states that a nonnegative random variable \\(Y\\) satisfies\n\n\\[\\Pr(Y\\ge a)\\le \\frac{\\mathbb E[Y]}{a}, \\qquad a>0.\\]\n\nApply it to \\(Y=(X-\\mu)^2\\) with \\(a=t^2\\):\n\n\\[\\begin{aligned} \\Pr(|X-\\mu|\\ge t) &=\\Pr((X-\\mu)^2\\ge t^2)\\\\ &\\le \\frac{\\mathbb E[(X-\\mu)^2]}{t^2}\\\\ &=\\frac{\\sigma^2}{t^2}. \\end{aligned}\\]\n\nThe proof explains why no distributional shape assumption is needed: only nonnegativity of the squared deviation and its finite expectation enter the argument. (ocw.mit.edu)"
    },
    {
      "heading": "Sharpness and limitations",
      "text": "The bound is sharp: without additional assumptions, its constant cannot be reduced. For any \\(k\\ge1\\) and \\(\\sigma>0\\), consider the distribution\n\n\\[\\begin{aligned} \\Pr(X=\\mu-k\\sigma)&=\\frac{1}{2k^2},\\\\ \\Pr(X=\\mu+k\\sigma)&=\\frac{1}{2k^2},\\\\ \\Pr(X=\\mu)&=1-\\frac{1}{k^2}. \\end{aligned}\\]\n\nDirect calculation gives mean \\(\\mu\\), variance \\(\\sigma^2\\), and\n\n\\[\\Pr(|X-\\mu|\\ge k\\sigma)=\\frac{1}{k^2}.\\]\n\nThis distribution attains equality; at \\(k=1\\), the mass at the mean is zero. (doi.org)\n\nSharpness does not imply that the bound is close to the actual probability for every distribution. For a normal distribution, approximately \\(99.73\\%\\) of the probability lies within three standard deviations, much more than Chebyshev’s guaranteed \\(88.9\\%\\). Stronger tail bounds can be obtained when additional information is available, such as boundedness or suitable assumptions on sums of independent variables. (stat.berkeley.edu)"
    },
    {
      "heading": "Sample averages and the law of large numbers",
      "text": "Suppose \\(X_1,\\ldots,X_n\\) are independent and identically distributed, with mean \\(\\mu\\) and finite variance \\(\\sigma^2\\). Their sample mean\n\n\\[\\overline X_n=\\frac1n\\sum_{i=1}^n X_i\\]\n\nhas mean \\(\\mu\\) and variance \\(\\sigma^2/n\\). Chebyshev’s inequality therefore gives\n\n\\[\\Pr(|\\overline X_n-\\mu|\\ge\\varepsilon) \\le \\frac{\\sigma^2}{n\\varepsilon^2}, \\qquad \\varepsilon>0.\\]\n\nFor fixed \\(\\varepsilon\\), the right-hand side tends to zero as \\(n\\) increases. This proves convergence in probability of the sample mean to \\(\\mu\\), establishing the weak law of large numbers under the finite-variance assumption. (stat.berkeley.edu)\n\nThe same formula provides a finite-sample guarantee: a sufficient condition for the probability of an error of at least \\(\\varepsilon\\) to be at most \\(\\delta\\), where \\(0<\\delta<1\\), is\n\n\\[n\\ge \\frac{\\sigma^2}{\\delta\\varepsilon^2}.\\]\n\nThis is a sufficient, potentially conservative sample-size bound rather than an exact requirement. (stat.berkeley.edu)"
    }
  ],
  "links": [
    "probability",
    "random-variable",
    "variance",
    "probability-distribution",
    "expected-value",
    "standard-deviation",
    "almost-surely",
    "markovs-inequality",
    "normal-distribution",
    "statistical-independence",
    "sample-mean",
    "convergence-in-probability",
    "law-of-large-numbers"
  ],
  "sources": [
    {
      "title": "Theory of Probability, Lecture Slide 8",
      "url": "https://ocw.mit.edu/courses/18-175-theory-of-probability-spring-2014/887e96172e82a615dac16fb26702d88b_MIT18_175S14_Lecture8.pdf"
    },
    {
      "title": "The Normal Curve, the Central Limit Theorem, and Markov's and Chebychev's Inequalities for Random Variables",
      "url": "https://www.stat.berkeley.edu/~stark/SticiGui/Text/clt.htm"
    },
    {
      "title": "Chapter 8. Law of Large Numbers",
      "url": "https://www.stat.berkeley.edu/~aldous/134/grinstead.pdf"
    },
    {
      "title": "MITOCW: 18.226 Markov, Chebyshev, and Chernoff",
      "url": "https://ocw.mit.edu/courses/18-226-probabilistic-methods-in-combinatorics-fall-2022/18cFdf8-lGPA6Z2UwZ8bhP1OpM5QKCPaG_transcript.pdf"
    },
    {
      "title": "Sharp inequalities of Bienaymé–Chebyshev and Gauß type for possibly asymmetric intervals around the mean",
      "url": "https://doi.org/10.1007/s11749-022-00844-9"
    },
    {
      "title": "856 Lecture Notes",
      "url": "https://courses.csail.mit.edu/6.856/current/Notes/n05-deviations.html"
    }
  ],
  "license": "https://creativecommons.org/licenses/by/4.0/"
}