Pairwise independence does not imply independence
ProofFoundation⏱ 15 minProbabilityindependencecounterexample
Problem
Let be independent uniform signs on and . Show that are pairwise independent but not independent. Then show that Chebyshev's bound on still applies, while the Chernoff argument does not.
Write a complete argument. Every inequality you use should be one you could state precisely.
Hints
Hints — 0 of 2 revealed
Solution
Opening this before you have a real attempt on paper is the fastest way to feel like you understand something you cannot reproduce.
Related problems
All problems| Solved | Problem | Field | Type | Difficulty | Time |
|---|---|---|---|---|---|
| When is the union bound tight? | Probability | Proof | 15 min | ||
| A variable with all moments finite that is not sub-Gaussian | High-Dim Probability | Proof | 30 min | ||
| All directional derivatives exist, yet the function is not differentiable | Foundations | Proof | 30 min | ||
| From an exponential tail bound to almost sure convergence | Probability | Proof | 30 min | ||
| Separating convexity, strong convexity, smoothness and Lipschitzness | Optimization | Proof | 30 min |