MathOverflow is a question and answer site for professional mathematicians. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

If I have a sequence of random variables $X_1, X_2, \ldots, X_n$ (possibly infinite) such that all pairwise cdf's are factorized:

$$F(X_i, X_j) = F_i(X_i) F_j(X_j)$$

for all pairs $(X_i, X_j)$, does it mean that the joint cdf is also factorized? That is:

$$F(X_1, \ldots, X_n) = \prod_{i=1}^{n} F_i(X_i)$$

In other words, if I prove that each pair in the sequence is statistically independent of each other, can longer sequences still be non-independent?

It seems to me that they can, but I can't come up with a counter example.

share|cite|improve this question
up vote 4 down vote accepted

The simplest of the many standard counterexamples is when $(X_1,X_2,X_3)$ takes the values $(1,1,1)$, $(1,0,0)$, $(0,1,0)$ and $(0,0,1)$ all equiprobably.

share|cite|improve this answer
hummmm! I see. Pairwise they are all independent, but knowing any two of them completely determines the third. Neat! Thanks. – Rorsa Feb 8 '13 at 13:38
See also… – Terry Tao Feb 8 '13 at 16:58

Steven's example is indeed the simplest. See chapter 3 of this book for counterexamples to lots of similar possibilities.

share|cite|improve this answer
The link is for: J. M. Stoyanov, Counterexamples in Probability. (With the copyright page ommitted.) I don't know whether this is an authorized on-ine version, or a pirated copy. – Gerald Edgar Feb 8 '13 at 15:21
It's only the table of contents. – Brendan McKay Feb 9 '13 at 0:15

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.