Exercises
ex-fsp-ch10-01
EasyLet be a non-negative random variable with . Use Markov's inequality to bound .
Apply Markov directly with .
Direct application
ex-fsp-ch10-02
EasyLet have mean and variance . Use Chebyshev to bound .
Set in Chebyshev's inequality.
Apply Chebyshev
ex-fsp-ch10-03
EasyProve that if is a non-negative, non-decreasing function and , then .
Note that implies by monotonicity.
Apply Markov to .
Monotonicity
Since is non-decreasing, , so .
Apply Markov
Since , Markov gives .
ex-fsp-ch10-04
MediumLet . Compute the Chernoff bound on for and compare with the exact tail .
The MGF of is for .
Minimize over .
MGF
for .
Chernoff function
. Taking the log: .
Optimize
gives . This is positive iff .
Substitute
. So .
Compare
The exact tail is . The Chernoff bound is a factor loose, but captures the correct exponential rate .
ex-fsp-ch10-05
MediumProve Cantelli's inequality: for with mean and variance , for .
Apply Markov to for .
Optimize over .
Setup
For any : .
Apply Markov
.
Optimize
Differentiate and set to zero: , giving .
Substitute
.
ex-fsp-ch10-06
MediumLet be i.i.d. with . Use Hoeffding's inequality to find such that .
Each , so .
Apply Hoeffding
. We need .
Solve
, so .
ex-fsp-ch10-07
MediumUse Jensen's inequality to prove that for any positive random variable :
is convex on .
Identify convexity
has for , so is convex.
Apply Jensen
, i.e., .
ex-fsp-ch10-08
MediumProve that for a random variable with :
Write and use is NOT tight enough. Use and optimize.
Alternatively, note that for any . Set .
Bound the second moment
For , we can write where . Then .
Bound variance of $U$
(since for ). More precisely: ... A cleaner approach: .
Conclude
.
ex-fsp-ch10-09
HardProve Hoeffding's Lemma: if is a zero-mean random variable with , then .
Use convexity of : .
Take expectations, use to simplify.
Define where and , then show .
Convexity bound
Since is convex in , for :
Take expectations
With : . Let , . Then: where .
Bound $L(u) \leq u^2/8$
, . We show for all : . Setting : . By Taylor with remainder: .
ex-fsp-ch10-10
HardLet be i.i.d. . Use the Chernoff bound to show: for .
The MGF of is where .
Set and optimize .
MGF of $\bar{X}_n$
.
Chernoff bound
. Let : .
Optimize
gives .
Substitute
Exponent . So .
ex-fsp-ch10-11
HardUse Jensen's inequality to prove that the entropy of a discrete random variable with outcomes satisfies , with equality iff is uniform.
Write .
is convex; apply Jensen.
Rewrite entropy
.
Apply Jensen to concave $\log$
.
Equality condition
Equality in Jensen for strictly concave requires to be constant, i.e., for all .
ex-fsp-ch10-12
EasyIf is a non-negative RV with , bound using Markov applied to .
Use the generalized Markov with .
Apply Markov to $X^2$
.
ex-fsp-ch10-13
MediumA wireless system measures channel gain which follows an exponential distribution with mean (Rayleigh fading). Use the Chernoff bound to bound the outage probability , i.e., the probability that the SNR falls below a threshold.
Use the lower-tail Chernoff: .
For , for .
MGF
for .
Lower-tail Chernoff
. Let .
Optimize
gives , so .
Evaluate
. So . The exact value is .
ex-fsp-ch10-14
HardProve the Bernstein inequality: if are independent zero-mean RVs with a.s. and , then for :
Use for bounded .
Bound using the Taylor bound and .
MGF bound for bounded RV
For and : using the bound : .
Product over $i$
.
Chernoff
. For , use (for ). A cleaner route: use and optimize to get the stated bound.
ex-fsp-ch10-15
Challenge(McDiarmid's inequality.) Let satisfy the bounded differences condition: changing one coordinate changes by at most . If are independent, show that .
Use a martingale decomposition: .
Show each is bounded with range .
Apply Hoeffding's inequality to the martingale differences.
Doob martingale
Define . Then , , and where .
Bound the differences
Since changing changes by at most , the conditional range of given is at most .
Apply Azuma-Hoeffding
The Azuma-Hoeffding inequality for martingale differences with bounded range gives: .
ex-fsp-ch10-16
MediumShow that for , the Chernoff bound gives:
Use .
MGF
.
Chernoff
. Set .
Optimize
gives Actually, ... Simplification via standard substitution yields the stated bound.
Standard form
After algebraic simplification (substituting when treating each Bernoulli trial): .
ex-fsp-ch10-17
EasyUse Jensen's inequality to show that .
is convex.
Apply Jensen
is convex (). By Jensen: .
Note
This is equivalent to .
ex-fsp-ch10-18
Hard(Cramér's theorem preview.) Let be i.i.d. with finite in a neighborhood of 0. Define the rate function . Show that for :
Use the Chernoff bound on .
.
Chernoff on $\bar{X}_n$
. Let : .
Interpretation
The probability of the sample mean exceeding decays exponentially in at rate . Cramér's theorem shows this rate is exact: .
ex-fsp-ch10-19
MediumProve the vector Chebyshev inequality: for a zero-mean random vector ,
and .
Apply Markov to .
Compute expected squared norm
.
Apply Markov
.
ex-fsp-ch10-20
Challenge(Holder's inequality.) For with , prove .
Use Young's inequality: for .
Normalize: let and .
Normalize
Let and . Define and , so and .
Apply Young's inequality
pointwise.
Take expectations
. So , giving .