Almost sure equality Created 2026-09-24 Updated 2026-11-05
random variables and are almost surely equal when . Probability theory conventionally identifies random variables that differ only on a null event.
Almost-sure limit of independent random variables is constant Created 2026-10-31 Updated 2026-11-05
If independent random variables converge almost surely to a finite , then is measurable for the tail sigma-algebra. The Kolmogorov zero-one law forces every rational threshold event for that limit to have Probability zero or one. A real-valued probability distribution with this property is a point mass, so is almost surely constant. Consequently the Second Borel-Cantelli lemma upgrades Almost sure convergence of independent sequences to complete convergence.
A shared coin prevents a zero-one conclusion 2026-10-14
More independent trials increase the chance of a head; repeated copies of one coin do not
. Exact constructed probabilities for at least one head in a window of coordinates. The independent curve is and tends to one; the shared-coin curve stays at . These are calculations from the two specified probability measures, not measurements or simulated frequencies. Details. Bayes' theorem Created 2026-09-24 Updated 2026-10-14
For a finite measurable partition with positive probabilities, and an event of positive probability,Its beauty is that a model predicting observations from a hidden state can also describe uncertainty about the state after an observation. Each numerator is a joint probability; the denominator, supplied by the law of total probability, makes the answers sum to one. This is a direct consequence of conditional probability, rather than an extra axiom.
Select the coin from law of total probability once, then toss that same coin repeatedly, with conditionally independent tosses given its identity. Let denote the -head coin, initially of prior probability . After one head , its posterior probability isThe likelihood of a head is larger under , but remains less likely than the other coin because its prior probability was smaller. A large likelihood for an observation does not itself imply a large posterior probability for the hypothesis.
After an ordered sequence containing heads and tails, its likelihood ratio between the two coins is . Bayes' theorem therefore gives posterior oddsEach head multiplies the odds by and each tail by . Three heads give posterior probability , still below one half; four give , above one half. The finite-model update and the distinction between prior probability, likelihood and posterior probability are set out in MIT 18.05, Reading 11: Bayesian Updating with Discrete Priors.
Updating uncertainty about one selected coin after repeated observations
. Details. The hidden selection also creates dependence. Each toss has marginal head probability , but two heads have joint probability , greater than . Their indicator covariance is . Seeing a head makes the head-favoring coin more likely, so it also raises the chance of a future head. This is covariance induced by a shared latent variable, despite conditional independence of the tosses given the coin.
Historically, Thomas Bayes's essay on an unknown success probability appeared in 1763 after his death, communicated by Richard Price. Its opening problem asks how observed successes and failures constrain that unknown probability; Price's introductory letter explains the connection to reasoning from experience. That is a more substantial inference problem than simply rearranging today's elementary identity. [ref]
https://www.gtfp.cs.rhul.ac.uk/pulskamp/Bayes/bayesessay-rjp.pdf. Bayes, An Essay towards solving a Problem in the Doctrine of Chances, 1763; original text transcribed, introductory letter and statement of the problem
Before-after control-impact design Created 2026-10-20 Updated 2026-11-05
A before-after control-impact design compares temporal change at an affected site with change at one or more control sites. In a simple two-period description, its treatment contrast isThis is a difference-in-differences comparison, or a site-type-by-period interaction term. For example, responses falling from to at the affected site and from to at the control site give : the affected site fell three units more than the comparison site.
The design addresses both a pre-existing site difference and a common temporal change. Its causal interpretation still requires a defensible comparison for how the affected site would have changed without the disturbance. Another site-specific event coinciding with the intervention can confound the contrast. Multiple control sites and repeated sampling before and after the disturbance help characterize natural variation, while the analysis must account for dependence through time.[ref]
Study design type in the Australian and New Zealand Guidelines for Fresh and Marine Water Quality. Before–after, control–impact designs; Improvements to BACI designs
Several observations within one affected site do not become several independent impact-site replicates. Distinguishing the experimental unit from its observational units prevents pseudoreplication; a large within-site sample does not repair missing independent site replication.
Bernoulli-Laplace diffusion model Created 2026-10-25 Updated 2026-11-05
In the Bernoulli-Laplace diffusion model, two urns each contain balls, with red and blue balls in total. Independently choose one ball uniformly from each urn and exchange them. The red count in the first urn is a Markov chain on , withThe upward event exchanges a blue ball from the first urn with a red ball from the second; the downward event reverses the colors. HenceStarting from , the mean is , with the initial value understood separately if the geometric factor is zero. For , this mean tends to . For , however, the only two configurations alternate and the expected imbalance does not decay.
The Stationary distribution is the hypergeometric distributionIt counts uniformly allocated red/blue configurations. The ratio verifies Detailed balance with the displayed transitions. The chain is irreducible; for an interior holding Probability also makes it aperiodic, while the chain has period two. This model separates convergence of an average imbalance from the full probability law and its periodicity.
Bernoulli thinning Created 2026-10-03 Updated 2026-11-05
If an event occurs with probability and is independently retained with conditional probability , its retained indicator is Bernoulli with probability . Applying this independently to a binomial count turns into .
Bond percolation Created 2026-09-24 Updated 2026-10-14
In independent bond percolation with parameter , every edge of a graph is open with probability and closed with probability . The choices are independent random variables with a Bernoulli distribution. All vertices remain present; only the usable connections change. The percolation clusters are the connected components of a graph formed by the open edges, including isolated vertices.
A specified simple graph path with edges is an open path with probability , by independence. Connecting its endpoints is a different event: other graph paths may also connect them. The four-edge example in percolation theory makes that distinction explicit. Interpreting open edges as usable channels makes the model useful for connectivity questions; it does not by itself assign a travel time, flow rate, or capacity to a channel.
Boolean operations on events 2026-10-14
Events turn Boolean operations into operations on sets. For a die with sample space , let be the event “even outcome” and the event “outcome at least four”. At outcome , use the indicator functions and . ThenThus logical conjunction becomes set intersection, logical disjunction becomes set union, exclusive or becomes symmetric difference, and logical negation becomes the complement of a set within . Outcome four satisfies both events, so inclusive logical disjunction includes it and exclusive or excludes it. If the die is fair, these four events have probabilities , , , and , respectively. No assumption of independent events is needed for the set identities; indeed and here are not independent, since .
Boole's inequality 2026-10-14
Boole's inequality, also called the union bound, bounds the probability that at least one of several events occurs by adding their individual probabilities. For a finite or countable family of events in the same probability space,The union includes outcomes where several events occur together. There is no independence assumption: adding the individual probabilities counts such outcomes repeatedly, which can only make the sum larger. The cap at one uses the total mass of a probability measure. For infinitely many events, the sum is a nonnegative series, possibly infinite; an infinite sum gives only the bound one. This is countable subadditivity of a measure specialized to a probability measure. See Probability: Theory and Examples (fifth edition) by Rick Durrett (Section 1.1, Theorem 1.1.1(ii), printed p. 2).
For example, choose uniformly from the twelve outcomes , using the discrete uniform distribution. Put . If , these are disjoint events and their union has probability , exactly the union bound. If , the union has only six outcomes, so its exact probability is , although both individual probabilities are still and the bound is still . If , the exact probability falls to with the same bound. These examples isolate overlap in the union bound by keeping the individual probabilities fixed.
The same individual event probabilities give different exact union probabilities as overlap increases
. Each panel is a fully specified discrete uniform distribution on twelve numbered outcomes. Blue means only, orange means only, purple means their intersection, and white means neither. The bottom bars compare the exact union probability with the sum of the individual probabilities. The three unions contain eight, six, and four outcomes; the sum counts eight in every panel. Details.The union bound is useful when each event is easy to control but their joint behavior is difficult to determine. A short proof uses indicator functions: at every outcome,Taking expected values and using linearity of expectation proves the finite bound.[ref] For a countable family, the finite unions increase to the full union; continuity of probability passes the finite inequalities to the limit. The closure of a sigma-algebra under countable unions ensures that this limiting union is an event. For the continuity of probability step, see Probability: Theory and Examples (fifth edition) by Rick Durrett (Section 1.1, Theorem 1.1.1(iii), printed p. 2).
Borel-Cantelli first lemma Created 2026-10-06 Updated 2026-10-14
For arbitrary events in one probability space,Equivalently, only finitely many events occur almost surely; no independence is needed.[ref]
Proof outline: put . The union bound givesThe tail of a convergent nonnegative series tends to zero.
Borel-Cantelli lemmas Created 2026-09-24 Updated 2026-10-14
The Borel-Cantelli lemmas turn a series of event probabilities into a statement about an entire infinite sequence of observations. A summable sequence of probabilities forces only finitely many occurrences almost surely, regardless of independence. A divergent series forces infinitely many occurrences when the events are mutually independent events. The precise event being measured is the limsup of events.
Imagine alarms with probabilities or , starting at . Both individual probabilities tend to zero. Nevertheless, the first alarm sequence eventually stops almost surely, whereas the second keeps returning almost surely if its events are mutually independent events. Reusing one uniform random variable for every alarm instead produces the shared-uniform counterexample to the second Borel-Cantelli lemma. Thus the individual probabilities alone do not determine long-run recurrence.
Borel-Cantelli second lemma Created 2026-10-14 Updated 2026-11-05
If the events are mutually independent events and , then . For an infinite family, mutual independence means every finite subfamily satisfies the factorization defining independent events.[ref]
Proof outline: for , independent events and giveContinuity of probability makes each infinite tail union have probability one; their countable intersection has probability one as well.
Bounded-increment martingale convergence-or-oscillation dichotomy Created 2026-10-06 Updated 2026-11-05
A discrete-time martingale with a common deterministic bound on all increments either converges finitely or has and , almost surely. Stopping on first crossing below gives a lower bound on the overshoot. Adding produces a nonnegative martingale, so the martingale convergence theorem forces finite convergence on the event of never crossing. Apply the same argument to .
Bufferless queue output Created 2026-10-14 Updated 2026-11-05
The work served in one slot is capped at the service rate of a queue. The remainder is lost, so output is input minus its positive part above capacity. Every downstream threshold below the cap has exactly the same overflow event for input and output; thresholds at or above the cap cannot be exceeded by the output.
Càdlàg modification Created 2026-10-06 Updated 2026-11-05
A càdlàg modification of a stochastic process is a modification of a stochastic process whose paths are càdlàg on one event of probability one. Equality almost surely at every separately fixed time does not imply indistinguishability of stochastic processes when the original process lacks path regularity. A stochastic process starting at zero, with independent increments, stationary increments, and stochastic continuity, has a càdlàg modification and is a Lévy process under the intrinsic definition.
Càdlàg versions are indistinguishable Created 2026-10-07 Updated 2026-11-05
If two versions of a stochastic process both have càdlàg paths on an event of probability one, equality at every rational time holds simultaneously outside one null event. Approaching an arbitrary time by rationals from the right then gives equality at every time on the same event. Thus the stochastic processes are indistinguishable. Right continuity suffices; left limits are unnecessary for this conclusion.
Cantelli inequality Created 2026-10-06 Updated 2026-10-14
Cantelli's inequality uses a mean and variance to control deviations in one specified direction. For a real random variable with expected value , finite variance , and ,Applying the same statement to gives the lower tail probability bound . No independence or particular probability distribution is required. If , the random variable equals almost surely and both positive-threshold tail probabilities are zero.
For variance one and a threshold two above the mean, the upper-tail probability is at most . Applying the two-sided Chebyshev's inequality to contain that upper event would give the weaker bound . For the standard normal distribution, the actual upper tail probability at two is about , much smaller than either bound. Yet the two-point probability distribution in equality in Cantelli's inequality attains , showing why the smaller Gaussian value cannot be promised from these two moments alone.
Cantelli's inequality sharpens a variance-only upper-tail bound and is exact for a two-point probability distribution
. Left: actual upper tail probabilities for the standard normal distribution are compared with Cantelli's inequality and the capped two-sided Chebyshev's inequality used as an upper-tail bound. Right: masses at and at two have mean zero and variance one. The upper mass is included by the non-strict threshold . These are specified mathematical models, not observations. Details.A short explanation is to centre and choose a nonnegative shift . On , the square is at least , so Markov's inequality givesThe best shift is , giving the displayed bound. Choosing the shift before squaring exploits the direction of the deviation; squaring the unshifted random variable treats both directions together. This shifted-square proof is also the strategy requested in the University of Utah's 2005 qualifying problem on Cantelli's inequality. [ref]
https://quals.math.utah.edu/topics/borel-cantelli-lemmas/. University of Utah Mathematics, 2005 question 4: shifted-square Cantelli bound
.The one-sided improvement should be used for a one-sided question. Adding upper and lower bounds by the union bound gives for . When , that is at least the Chebyshev's inequality bound ; when , both two-sided expressions exceed one and must be capped. The separate one-sided bounds generally cannot be attained simultaneously by the same probability distribution.
Chain rule for probabilities Created 2026-10-07 Updated 2026-11-05
When all conditioning events have positive probability, repeatedly apply the definition of conditional probability to factor a joint event into successive conditional factors. For a sequence of discrete responses, this yields the product of conditional masses along the actual outcome path. It requires no unconditional independence assumption.
Collision probability of two independent categorical draws Created 2026-10-14 Updated 2026-11-05
Suppose two independent random variables have the same categorical distribution, with label probabilities . The disjoint equal-label events giveFor the original chosen probabilities , this is , rather than the uniform four-label value . The Cauchy-Schwarz inequality gives , so uniform probabilities minimize this two-draw collision probability. This pair formula alone does not supply the entire group collision probability for a nonuniform model.



