Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
For the product law and corrected range of moments, let
E=1{Z≤x}. Then
H(Y1,…,Yn∣E=1)≥Hn(x)−Ox0,δ(n/c).
This is the source's route to the lower bound in Lemma 1.
The separate finite-window argument is not substituted
for it.
Source: published PDF,
pp. 4–7. The cutoff is a fixed sufficiently large Dcn in place
of the printed 10. The factor
(1+t)/(1+et) below retains a term dropped in the printed summation.
Constants may depend on the fixed positive lower bound x0.
Write q=cn, a=Pr(E=1), and b=1−a.
The moment estimates and Berry–Esseen give
a=1/2+O(q−1/2), so a,b≥1/3 for sufficiently large n.
For a coordinate m, conditional on Ym=1 the variable Z has the law
of Zm′=Z−Ym/m+1/m. Its mean is
x+(1−pm)/m and its variance is Θ(q−1) uniformly by
moments. The third-moment estimate holds after the same removal.
Since the normal distribution function is Lipschitz, Berry–Esseen gives
Pr(E=0∣Ym=1)=21+O(q−1/2+mq).
Bayes' formula, divided by b, now yields for
rm=Pr(Ym=1∣E=0),
∣rm−pm∣≤Cpm(q−1/2+mq).(1)
Choose a fixed D sufficiently large in terms of these constants.
For m≤Dq use the elementary entropy upper bound 1.
For larger m, concavity gives
h(rm)≤h(pm)+h′(pm)(rm−pm).
Since 0<pm<1/2, 0<h′(pm)≤log2(1/pm); therefore (1) implies
h(rm)≤h(pm)+C(q−1/2+mq)pmlog(1/pm).(2)
This tangent inequality also handles a conditional parameter above 1/2.
For t=q/m the needed bound is
pmlog(1/pm)=1+etlog(1+et)≤C1+et1+t.
The terms with coefficient q−1/2 sum to O(n/q),
because plog(1/p) is bounded. For the other terms,
m=1∑nm(1+q/m)e−q/m=O(1+log+(1/c))
by (1) in moments, using r=1 and q times the r=2 estimate.
Subadditivity of conditional entropy and (2) thus give