Probability is unforgiving in a helpful way: a statement is either true under stated assumptions or it is not. Many mistakes come from skipping the assumptions that make a familiar identity valid. The fastest way to become reliable is to learn the standard failure modes and the correct replacement moves.
This article collects frequent mistakes that appear in coursework, research reading, and applied work. Each item is paired with a way to diagnose and repair the reasoning.
Smart TV Pick55-inch 4K Fire TVINSIGNIA 55-inch Class F50 Series LED 4K UHD Smart Fire TV
INSIGNIA 55-inch Class F50 Series LED 4K UHD Smart Fire TV
A general-audience television pick for entertainment pages, living-room guides, streaming roundups, and practical smart-TV recommendations.
- 55-inch 4K UHD display
- HDR10 support
- Built-in Fire TV platform
- Alexa voice remote
- HDMI eARC and DTS Virtual:X support
Why it stands out
- General-audience television recommendation
- Easy fit for streaming and living-room pages
- Combines 4K TV and smart platform in one pick
Things to know
- TV pricing and stock can change often
- Platform preferences vary by buyer
Mistake: treating probability zero as impossibility
A classic confusion is to read “$\mathbb{P}(A)=0$” as “$A$ cannot happen.” In many continuous models, single outcomes have probability zero and still occur.
Example: if $X\sim \mathrm{Unif}[0,1]$, then $\mathbb{P}(X=1/2)=0$, yet $X$ takes a single value in $[0,1]$ every time you sample it.
How to avoid it
Use the correct distinction:
- $\mathbb{P}(A)=0$ means $A$ is negligible with respect to the measure, not logically impossible.
- In measure-theoretic probability, “almost surely” means “outside a null set,” not “always.”
When a proof uses “almost surely,” track whether the null set can depend on parameters. If you need a statement that holds for every parameter value, you often need a uniform argument, not a pointwise one.
Mistake: confusing uncorrelatedness with independence
Covariance zero is not independence. The counterexample $Y=X^2$ with symmetric $X$ shows that dependence can be nonlinear and still have zero covariance.
How to avoid it
Replace the vague idea “unrelated” with a target notion:
- If you need event factorization, you need independence.
- If you need only linear prediction, uncorrelatedness may be enough.
- If you need stability under conditioning, examine $\mathbb{E}[Y\mid X]$.
A good habit is to write the definition you are using, even if only in your scratch work.
Mistake: using Bayes’ rule without checking denominators
Bayes’ rule is
but it requires $\mathbb{P}(B)>0$. In continuous settings, conditioning on events of probability zero cannot be handled by this formula.
How to avoid it
When $\mathbb{P}(B)=0$ is lurking, switch viewpoints:
- Use conditional densities with respect \to a dominating measure.
- Use regular conditional probabilities $\mathbb{P}(A\mid \mathcal{G})$ for a $\sigma$-algebra $\mathcal{G}$.
- In Euclidean settings, use the Radon–Nikodym derivative viewpoint: conditional density is a derivative of measures, not a ratio of point masses.
If you are conditioning on a value $X=x$ for a continuous $X$, treat it as conditioning on the $\sigma$-algebra generated by $X$, not the singleton event.
Mistake: swapping limits and expectations without justification
A pervasive mistake is to assert
without conditions. Sometimes it is true, but the conditions matter.
How to avoid it
Know the three standard theorems and what they require:
- Monotone Convergence Theorem: if $0\le X_n\le X_{n+1}$ and $X_n\to X$ pointwise, then $\mathbb{E}[X_n]\to \mathbb{E}[X]$.
- Dominated Convergence Theorem: if $X_n\to X$ a.s. and $|X_n|\le Y$ with $\mathbb{E}[Y]<\infty$, then $\mathbb{E}[X_n]\to \mathbb{E}[X]$.
- Fatou’s Lemma: $\mathbb{E}[\liminf X_n]\le \liminf \mathbb{E}[X_n]$.
When you see a limit-inside-expectation step, identify which theorem is being used and where the domination or monotonicity comes from.
Mistake: confusing convergence modes
“Converges” can mean at least four different things:
- almost sure convergence
- convergence in probability
- convergence in $L^p$
- convergence in distribution
These implications are not symmetric. For example, convergence in probability implies convergence in distribution, but not conversely in general.
How to avoid it
Carry a small implication map in your head:
- $L^p\Rightarrow$ in probability $\Rightarrow$ in distribution.
- almost sure $\Rightarrow$ in probability.
- in distribution plus uniform integrability can upgrade to convergence of expectations.
When a result states “$X_n$ converges,” check which mode is meant. In many papers, “$X_n\Rightarrow X$” is distributional convergence, and expectations may not converge without extra hypotheses.
Mistake: assuming measurability instead of proving it
Many probabilistic statements are not well-formed until measurability is established.
Examples:
- $\sup_{t\in[0,1]} X_t$ is not automatically measurable unless $t\mapsto X_t(\omega)$ has suitable regularity.
- A stopping time $\tau$ must satisfy $\{\tau\le t\}\in \mathcal{F}_t$ for every $t$.
How to avoid it
Use standard measurable constructions:
- Replace a supremum over an uncountable set by a supremum over a countable dense set when paths are \right-continuous.
- In stochastic process arguments, explicitly state the path regularity you are using: càdlàg, continuous, or progressively measurable.
A practical rule: if the argument uses “take the first time,” you are probably proving a stopping-time property, and measurability is part of the work.
Mistake: treating “independent increments” as “independent values”
For a process $(X_t)$, independent increments means that $X_{t_1}-X_{s_1}$ is independent of $X_{t_2}-X_{s_2}$ when the intervals do not overlap. It does not imply that the random variables $X_{t_1}$ and $X_{t_2}$ are independent.
How to avoid it
Write the dependence explicitly:
so $X_{t_2}$ contains $X_{t_1}$. Independence can only apply to the increment, not to the cumulative value.
Mistake: forgetting conditioning changes distributions
People often compute with “the same distribution” after conditioning, as if conditioning were a harmless annotation. Conditioning is a transformation of measure.
How to avoid it
When you condition on $\mathcal{G}$, you are working with the random probability measure $\mathbb{P}(\cdot\mid\mathcal{G})$. Re-check independence assumptions under the conditioned measure. Many “nice” symmetries break when information is revealed.
A useful principle is to compute conditional expectations first and then average:
If you cannot compute a probability directly, compute it conditionally and then integrate.
Mistake: applying concentration bounds outside their scope
Tail inequalities like Hoeffding, Bernstein, or Azuma are powerful, but each has hypotheses: boundedness, sub-exponential tails, martingale differences, or conditional variance control. Using them blindly gives nonsense.
How to avoid it
Before quoting a bound, check:
- Are the variables bounded almost surely?
- Are they independent, or at least a martingale difference sequence?
- Is the variance finite, or is a conditional variance bound available?
If hypotheses fail, look for a theorem designed for heavy-tailed settings, truncation, or robust estimators.
Mistake: treating a heuristic density as a proof
In continuous probability, one often writes down a density and manipulates it as if it were a function, but not every distribution has a density, and not every operation is valid without integrability.
How to avoid it
When you use a density $f$, identify the dominating measure and the meaning:
- $f = d\mu/d\lambda$ is a Radon–Nikodym derivative.
- Identities about $f$ are identities about the measure $\mu$.
If you are unsure whether a density exists, either prove absolute continuity or reformulate in terms of distribution functions and measures.
A small checklist that saves real time
When you read or write a probabilistic argument, pause at the following steps:
- A limit is moved through an expectation, probability, or integral.
- A conditional probability is computed with a denominator that might be zero.
- A statement is claimed “almost surely” and then used uniformly in a parameter.
- Independence is inferred from a weak statistic like covariance.
- A supremum or hitting time is introduced without a measurability statement.
These are not pedantic concerns; they are exactly where otherwise-correct ideas fail.
What replaces the mistakes: a disciplined core
Probability becomes far easier when you treat it as measure theory with extra language:
- Events live in $\sigma$-algebras.
- Random variables are measurable maps.
- Expectation is integration.
- Conditioning is a projection in $L^1$ (and in $L^2$ it is literally an orthogonal projection).
- Convergence is not one concept; it is a family of concepts with named theorems relating them.
If you train yourself to ask “which theorem justifies this step,” you will start to see probability as a sequence of controlled reductions. That is the difference between intuition-driven manipulation and research-grade reliability.
Mistake: using Fubini and Tonelli without checking integrability
Interchanging integrals and expectations is often correct, but not automatic. A common error is to write
without verifying the conditions.
How to avoid it
Remember the division of labor:
- Tonelli’s theorem applies to nonnegative integrands. If $g\ge 0$, you may swap integrals and expectations freely, and both sides may be infinite.
- Fubini’s theorem applies to absolutely integrable integrands. If $\mathbb{E}[\int |g|]<\infty$, then the swap is justified and yields finite values.
In probability arguments, the hidden risk is a sign-changing integrand with an infinite positive and infinite negative part. When you see a swap, either reduce \to a nonnegative function or produce an absolute integrability bound.
Mistake: assuming a martingale has independent increments
Martingales generalize “fair game” behavior, but they do not typically have independent increments. The defining property is conditional mean zero:
Nothing here says increments are independent of the past, only that they have mean zero given the past.
How to avoid it
When you use a martingale inequality or an optional stopping theorem, check what is actually required:
- Do you need bounded increments, or bounded conditional variances?
- Do you need uniform integrability, or a bounded stopping time?
- Are you using the filtration $(\mathcal{F}_t)$ consistently, so that the stopping time is measurable with respect to the right information?
Treat “martingale” as “conditional expectation structure,” not as “independence structure.”
Books by Drew Higgins
Leave a Reply