Pairwise independent events 2026-10-14
Pairwise independent events describe a subtle kind of uncertainty: learning that one event occurred leaves each other event's probability unchanged, yet learning that two occurred can reveal a third completely. Checking every pair therefore answers a weaker question than checking the whole collection. The parity construction of pairwise independent bits makes this distinction visible with just four equally likely outcomes.
A family of events is pairwise independent whenIf , this is equivalent to the conditional probability identity . The product definition also handles events of probability zero. Independent events, meaning mutually independent events, require the same product rule for every finite subfamily, including triples. For three events, the three pair equations and the triple equation are four separate requirements. [ref]
https://www.randomservices.org/random/prob/Independence.html. Kyle Siegrist, Random Services: independence of two events and general independence of events
.For a worked example, take independent fair bits : the sample space is with probability per outcome. Set , , and , using exclusive or, which is one precisely when its inputs differ. The events , , and each contain two outcomes. Their pair intersections areThus each event has probability and each pair intersection has probability : these are pairwise independent events. But forces , soThe three are not independent events. This is the complementary-third-event version of the two-toss example in Tsitsiklis and Jaillet, MIT Introduction to Probability, Lecture 3, slides 7–8.
Another useful diagnostic preserves a special common-intersection case. Suppose three events have common probability and every pair and triple intersect in the same event, of probability . Pairwise independence requires , while mutual independence additionally requires . Both hold only for or . For a concrete nontrivial instance, assign probability to each of four outcomes, let all three events contain the first outcome, and give each event one different additional outcome. Then and : the pair equations hold, while the triple equation fails. Unlike the exclusive or example above, this triple intersection is nonempty.
The parity construction of pairwise independent bits turns two independent fair bits into three pairwise independent random variables. With , , and , their allowed triples are , each of probability . Every coordinate has the Bernoulli distribution with parameter . Every pair has the same joint probability mass function:All twelve pair cells equal the product of the corresponding probabilities in their marginal distributions. This establishes pairwise independent random variables, a requirement involving every pair of value-events, rather than merely one chosen event per coordinate. For general real-valued random variables , the requirement isfor every pair of Borel sets . For these binary random variables, checking all four cells of each pair suffices: any value-event is a union of the checked cells. In fact, for binary random variables, independence of their one-value events also gives the other cells by taking complements. Siegrist gives the all-set definition and its connection to indicator random variables in Random Services: independence of random variables.
The full joint probability mass function tells a different story:The integer parity of is always even. Any two bits determine the third: , , and . Each coordinate is independent of either other coordinate individually, but is dependent on the pair together. For example, the conditional probabilities satisfy and . See also pairwise independence does not imply joint independence for the general distinction.
The constraint changes the sum's probability distribution without changing its expected value or variance. Let . Only gives ; each other allowed triple gives . Direct calculation givesThe same variance follows from the variance of a sum: each Bernoulli distribution has variance , and pairwise independent random variables have zero cross covariances. Linearity of expectation gives the expected value even without independence.
For comparison, the sum of three mutually independent fair bits has the binomial distribution :Both sums have identical expected values and variances, but never takes the values one or three. Even their third moments differ: , whereas . Pairwise independence preserves these first two sum summaries while allowing a different joint probability distribution and a different sum law. The calculation is an exact finite example.

