Probability Inequalities

Key Terms

How This Section Is Organized

What Probability Inequalities Do

Why Inequalities Matter in Probability

What Inequalities Depend On

Types of Probability Inequalities

Featured Inequalities

Relationship Between Common Inequalities

How Inequalities Are Used

Inequalities vs Exact Distributions

Featured Inequalities at a Glance

Probability Inequalities FAQ

Probability Inequalities

In many probability problems, the exact distribution of a random variable is unknown or too complicated to work with directly.

Probability inequalities address this situation by providing guaranteed bounds on probabilities using limited information, such as an expected value or a variance. Instead of describing outcomes precisely, they restrict how extreme those outcomes can be.

These results are deliberately general. They apply across wide classes of random variables and make minimal assumptions, trading sharpness for reliability. For this reason, probability inequalities play a central role in theoretical analysis, estimation, and convergence arguments.

Key Terms

Expected Value—

E[X]

, the quantity used in Markov's inequality

Variance—

\operatorname{Var}(X)

, the quantity used in Chebyshev's inequality

Standard Deviation—

\sigma

, the spread measure in Chebyshev's bound

Random Variable— the object both inequalities constrain

See All Probability Definitions →

How This Section Is Organized

This page provides an overview of probability inequalities and how they fit into probability theory.

Each inequality is treated on its own page, where its assumptions, statement, and implications are presented in detail. The parent page focuses on connections, scope, and conceptual differences rather than formulas or proofs.

As new inequalities are added, they are integrated into the same structure, allowing this section to expand without changing its overall organization.

Inequality Pages:

• Markov's Inequality
• Chebyshev's Inequality
• (Future additions will appear here)

What Probability Inequalities Do

Probability inequalities place limits on how likely certain events can be, without requiring full knowledge of the underlying distribution.

They do not attempt to compute exact probabilities. Instead, they provide bounds that are guaranteed to hold whenever the stated assumptions are satisfied.

In practice, this means they can:
• bound tail probabilities
• control the chance of large deviations
• give worst-case guarantees
• remain valid even when the distribution is unknown

Probability inequalities are therefore tools for reasoning under uncertainty when precise calculation is not possible or not necessary.

Why Inequalities Matter in Probability

Exact probability calculations are often unavailable or impractical.

In many situations, the full distribution of a random variable is unknown, difficult to compute, or unnecessary for the question being asked. Probability inequalities make it possible to reason in such cases by providing bounds that hold under broad conditions.

Because they rely on minimal assumptions, inequalities are used:
• to justify convergence results
• to control error and variability
• to obtain guarantees that remain valid across many models

For this reason, probability inequalities are foundational tools in both theoretical arguments and applied probability.

What Inequalities Depend On

Probability inequalities are built on a small set of basic quantities associated with random variables.

Most inequalities rely on:
• the expectation of a random variable
• measures of spread such as variance
• structural assumptions like non-negativity or boundedness

Different inequalities require different levels of information.
The fewer assumptions used, the more general the bound tends to be, but the less tight it becomes.

This shared dependence on simple characteristics explains why very different random variables can be constrained by the same inequality.

A dataset with its mean and squared deviations

The inputs to the inequalities are exactly what this picture shows: a mean and the spread of the values around it, measured by variance. A random variable with small spread cannot often land far from its mean, and that is the fact the bounds make precise. Move the points and watch the variance respond on the variance visualizer.

The inequalities are grouped by which of these inputs they use.

Types of Probability Inequalities

Probability inequalities can be grouped according to the kind of information they use and the type of bounds they provide.

Common high-level categories include:
• inequalities based only on expectation
• inequalities that incorporate variance or higher moments
• tail bounds that control extreme deviations
• concentration-type inequalities that sharpen bounds under stronger assumptions

These categories are not rigid.
They reflect increasing levels of available information, with stronger assumptions generally leading to tighter bounds.

The categories above can be lined up with the kind of information each one consumes and where each is typically most useful.

Category	Information used	Typical use
Expectation-based	E[X] only (sometimes plus non-negativity)	broadest applicability; coarsest bounds (e.g., Markov)
Variance / higher moments	E[X] together with Var(X) or higher moments	sharper deviation bounds around the mean (e.g., Chebyshev)
Tail bounds	moment information or partial distribution shape	controlling probability of extreme deviations
Concentration-type	independence plus boundedness or sub-Gaussianity	very tight bounds for sums and averages of many variables

Featured Inequalities

This section highlights core probability inequalities that are used throughout probability theory.
Each inequality has its own page with assumptions, statements, and typical uses.

Markov's Inequality
• Applies to non-negative random variables
• Uses expectation only
• Provides very general, often loose bounds

Chebyshev's Inequality
• Uses both expectation and variance
• Gives tighter bounds than Markov under stronger assumptions
• Central for reasoning about deviations from the mean

Chebyshev bound for a normal variable, mean 10, variance 4, deviation 3

The shaded tails are the actual probability of straying at least 3 from the mean and the bound is variance over 9, which sits well above them: the inequality is valid but loose because it uses only the variance. The Markov visualizer shows the even looser bound that uses only the mean. Change the deviation and compare bound and truth on the Chebyshev inequality visualizer.

How the featured inequalities relate is set out next.

Relationship Between Common Inequalities

Probability inequalities form a hierarchy based on the assumptions they require.

• Markov's inequality uses only non-negativity and expectation, making it broadly applicable but often loose.
• Chebyshev's inequality adds information about variance, which tightens the bound while reducing generality.

This illustrates a general trade-off:
• fewer assumptions → wider applicability
• more assumptions → sharper bounds

Many other inequalities fit into this pattern, refining earlier ones by incorporating additional structure or moments.

How Inequalities Are Used

Probability inequalities are used to control uncertainty when exact calculations are unavailable or unnecessary.

Typical uses include:
• bounding tail probabilities
• estimating how far a random variable can deviate from a reference value
• proving convergence results without specifying distributions
• comparing variability across different models

Because they provide guarantees that hold under broad conditions, inequalities are often used as intermediate tools. They establish limits first, and more precise results are built on top of them when additional information becomes available.

Inequalities vs Exact Distributions

Probability inequalities do not describe the full behavior of a random variable.

They provide bounds that must hold, but they do not capture how probability is distributed within those bounds. As a result, the estimates they give may be conservative or loose.

When the exact distribution of a random variable is known and manageable, working directly with that distribution is usually preferable. Inequalities become most valuable when such information is missing, incomplete, or too costly to compute.

In this sense, inequalities complement exact methods rather than replace them.

Featured Inequalities at a Glance

The table below collects the inequalities introduced above into a single reference, lining each one up with its structural requirement, the information it consumes, the formal statement, what it actually bounds, and how tight it tends to be. As new inequalities are added to this section, they will slot into the same comparison.

Inequality	Applies to	Information used	Statement	What it bounds	Tightness
Markov	non-negative random variables	E[X] only	P(X ≥ a) ≤ E[X] / a, for any a > 0	upper tail of a non-negative variable	very broad; usually loose
Chebyshev	any X with finite variance	E[X] and Var(X)	P(\|X − μ\| ≥ kσ) ≤ 1 / k², for any k > 0	two-sided deviation from the mean	sharper than Markov under the stronger assumption

Probability Inequalities FAQ

What's the difference between Markov's and Chebyshev's inequality?

Markov uses only non-negativity and the expectation, so it applies almost anywhere but gives loose bounds. Chebyshev adds the variance, which tightens the bound at the cost of needing more information. That is the general pattern: each additional assumption buys a sharper bound and narrows the range of variables it covers.Read more →

Do you need to know the distribution to use a probability inequality?

No — that is precisely why they exist. An inequality uses a few summary facts, typically the expectation and sometimes the variance, plus structural conditions like non-negativity. From those alone it guarantees a bound holding for every distribution that meets the conditions. You trade precision for the freedom of not needing the full distribution.Read more →

Why do probability inequalities often give such loose bounds?

Because they must hold for every distribution satisfying the assumptions, including the worst one. The bound is set by that worst case, so for any particular well-behaved distribution it will be conservative. A bound can even come out above 1 and say nothing at all — technically true, practically vacuous. That is the price of not needing the distribution.Read more →

Does a tighter bound always mean a better inequality?

No — tightness and applicability pull against each other. A sharper bound is bought with stronger assumptions, and if those assumptions fail the bound is not merely loose but invalid. The right choice depends on what you actually know: use the tightest inequality whose conditions you can genuinely verify, not the tightest one available.Read more →