Proof of Theorem 2.7.10 in Durrett (edited) Announcing the arrival of Valued Associate #679: Cesar Manara Planned maintenance scheduled April 23, 2019 at 00:00UTC (8:00pm US/Eastern)Le Cam's theorem and total variation distanceA sequence of random variables that does not converge in probability.An unfair “fair game.”Question about a Symmetric random walk, Problem 4.1.1 in DurrettFor a sequence of i.i.d. (Bernoulli ?) RV we have for the partial sums $S_n+m-S_n=m$ i.o. almost surelyLarge Deviations Counterexample in DurrettCentral limit theorem and convergence in probability from DurrettOn $Z = max left(X_1, X_2, dots, X_N right)$ where $X_i sim mathcalN(mu_i, sigma_i^2)$i.i.d. sequences satisfies the weak law but not strong lawCalculation problem with Central limit theorem
How do I find out the mythology and history of my Fortress?
Denied boarding although I have proper visa and documentation. To whom should I make a complaint?
How much damage would a cupful of neutron star matter do to the Earth?
Most bit efficient text communication method?
Is there hard evidence that the grant peer review system performs significantly better than random?
AppleTVs create a chatty alternate WiFi network
Why should I vote and accept answers?
How often does castling occur in grandmaster games?
Is it fair for a professor to grade us on the possession of past papers?
How fail-safe is nr as stop bytes?
A term for a woman complaining about things/begging in a cute/childish way
Can anything be seen from the center of the Boötes void? How dark would it be?
Generate an RGB colour grid
When a candle burns, why does the top of wick glow if bottom of flame is hottest?
Trademark violation for app?
How could we fake a moon landing now?
What is the difference between globalisation and imperialism?
If Windows 7 doesn't support WSL, then what does Linux subsystem option mean?
Why is Nikon 1.4g better when Nikon 1.8g is sharper?
Time to Settle Down!
Effects on objects due to a brief relocation of massive amounts of mass
What would you call this weird metallic apparatus that allows you to lift people?
Why does the remaining Rebel fleet at the end of Rogue One seem dramatically larger than the one in A New Hope?
Why does it sometimes sound good to play a grace note as a lead in to a note in a melody?
Proof of Theorem 2.7.10 in Durrett (edited)
Announcing the arrival of Valued Associate #679: Cesar Manara
Planned maintenance scheduled April 23, 2019 at 00:00UTC (8:00pm US/Eastern)Le Cam's theorem and total variation distanceA sequence of random variables that does not converge in probability.An unfair “fair game.”Question about a Symmetric random walk, Problem 4.1.1 in DurrettFor a sequence of i.i.d. (Bernoulli ?) RV we have for the partial sums $S_n+m-S_n=m$ i.o. almost surelyLarge Deviations Counterexample in DurrettCentral limit theorem and convergence in probability from DurrettOn $Z = max left(X_1, X_2, dots, X_N right)$ where $X_i sim mathcalN(mu_i, sigma_i^2)$i.i.d. sequences satisfies the weak law but not strong lawCalculation problem with Central limit theorem
$begingroup$
Letting $X_1^lambda,X_2^lambda,dots$ be i.i.d. with distribution $F_lambda$ and $S_n^lambda=X_1^lambda+dots+X_n^lambda$, we have
$$ P(S^lambda_n in (na,nnu]) ge
Pleft(S^lambda_n in ((a_0-epsilon)n,(a_0+epsilon)n] right) cdot P left(X_n^lambdain ((a-a_0+epsilon)n,(a-a_0+2epsilon)n]right) ge
frac12 Pleft(X^lambda_n in ((a-a_0+epsilon)n,(a-a_0+epsilon)(n+1)]right)$$
This is from the proof of Theorem 2.7.10 in Durrett PTE 5th.
The first term will tends to 1 (since $a_0$ is the mean of $X^lambda_1$ then by weak law of large number). But I can't understand the second inequality, how does $1/2$ come up?
Furthermore,
Here, to prove the limsup is 0 by contradiction. But why limsup<0 will implies $Eexp(eta X^lambda_1)<infty$ for some $eta>0$?
I try to calculate $Eexp(eta X^lambda_1)$ by applying $P(X^lambda_1in ((a-a_0+epsilon)n, (a-a_0+epsilon)(n+1)])$ behave like $e^na$ for some $a<0$. But it does not work.
probability-theory real-analysis
$endgroup$
migrated from mathoverflow.net Apr 1 at 14:59
This question came from our site for professional mathematicians.
add a comment |
$begingroup$
Letting $X_1^lambda,X_2^lambda,dots$ be i.i.d. with distribution $F_lambda$ and $S_n^lambda=X_1^lambda+dots+X_n^lambda$, we have
$$ P(S^lambda_n in (na,nnu]) ge
Pleft(S^lambda_n in ((a_0-epsilon)n,(a_0+epsilon)n] right) cdot P left(X_n^lambdain ((a-a_0+epsilon)n,(a-a_0+2epsilon)n]right) ge
frac12 Pleft(X^lambda_n in ((a-a_0+epsilon)n,(a-a_0+epsilon)(n+1)]right)$$
This is from the proof of Theorem 2.7.10 in Durrett PTE 5th.
The first term will tends to 1 (since $a_0$ is the mean of $X^lambda_1$ then by weak law of large number). But I can't understand the second inequality, how does $1/2$ come up?
Furthermore,
Here, to prove the limsup is 0 by contradiction. But why limsup<0 will implies $Eexp(eta X^lambda_1)<infty$ for some $eta>0$?
I try to calculate $Eexp(eta X^lambda_1)$ by applying $P(X^lambda_1in ((a-a_0+epsilon)n, (a-a_0+epsilon)(n+1)])$ behave like $e^na$ for some $a<0$. But it does not work.
probability-theory real-analysis
$endgroup$
migrated from mathoverflow.net Apr 1 at 14:59
This question came from our site for professional mathematicians.
add a comment |
$begingroup$
Letting $X_1^lambda,X_2^lambda,dots$ be i.i.d. with distribution $F_lambda$ and $S_n^lambda=X_1^lambda+dots+X_n^lambda$, we have
$$ P(S^lambda_n in (na,nnu]) ge
Pleft(S^lambda_n in ((a_0-epsilon)n,(a_0+epsilon)n] right) cdot P left(X_n^lambdain ((a-a_0+epsilon)n,(a-a_0+2epsilon)n]right) ge
frac12 Pleft(X^lambda_n in ((a-a_0+epsilon)n,(a-a_0+epsilon)(n+1)]right)$$
This is from the proof of Theorem 2.7.10 in Durrett PTE 5th.
The first term will tends to 1 (since $a_0$ is the mean of $X^lambda_1$ then by weak law of large number). But I can't understand the second inequality, how does $1/2$ come up?
Furthermore,
Here, to prove the limsup is 0 by contradiction. But why limsup<0 will implies $Eexp(eta X^lambda_1)<infty$ for some $eta>0$?
I try to calculate $Eexp(eta X^lambda_1)$ by applying $P(X^lambda_1in ((a-a_0+epsilon)n, (a-a_0+epsilon)(n+1)])$ behave like $e^na$ for some $a<0$. But it does not work.
probability-theory real-analysis
$endgroup$
Letting $X_1^lambda,X_2^lambda,dots$ be i.i.d. with distribution $F_lambda$ and $S_n^lambda=X_1^lambda+dots+X_n^lambda$, we have
$$ P(S^lambda_n in (na,nnu]) ge
Pleft(S^lambda_n in ((a_0-epsilon)n,(a_0+epsilon)n] right) cdot P left(X_n^lambdain ((a-a_0+epsilon)n,(a-a_0+2epsilon)n]right) ge
frac12 Pleft(X^lambda_n in ((a-a_0+epsilon)n,(a-a_0+epsilon)(n+1)]right)$$
This is from the proof of Theorem 2.7.10 in Durrett PTE 5th.
The first term will tends to 1 (since $a_0$ is the mean of $X^lambda_1$ then by weak law of large number). But I can't understand the second inequality, how does $1/2$ come up?
Furthermore,
Here, to prove the limsup is 0 by contradiction. But why limsup<0 will implies $Eexp(eta X^lambda_1)<infty$ for some $eta>0$?
I try to calculate $Eexp(eta X^lambda_1)$ by applying $P(X^lambda_1in ((a-a_0+epsilon)n, (a-a_0+epsilon)(n+1)])$ behave like $e^na$ for some $a<0$. But it does not work.
probability-theory real-analysis
probability-theory real-analysis
edited Apr 1 at 19:13
edwardngtakwa
asked Apr 1 at 10:30
edwardngtakwaedwardngtakwa
134
134
migrated from mathoverflow.net Apr 1 at 14:59
This question came from our site for professional mathematicians.
migrated from mathoverflow.net Apr 1 at 14:59
This question came from our site for professional mathematicians.
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
I have the 4th edition, where this appears to correspond to Theorem 2.6.5. You've omitted the last part of the sentence following the equation, which says
for large $n$ by the weak law of large numbers.
So it is exactly as you say: the weak law of large numbers implies that $Pleft(S^lambda_n in ((a_0-epsilon)n,(a_0+epsilon)n] right) to 1$ as $n to infty$, and thus for sufficiently large $n$ it is at least $frac12$. It seems like the choice of $frac12$ is arbitrary; we just need some convenient number in between 0 and 1.
For the second part, let $Z = X_1^lambda / (a-a_0+epsilon)$. Note that
$$e^eta Z le 1_Z le 0 + sum_n=0^infty e^eta (n+1) 1_n < Z le n+1$$
and so $$E[e^eta Z] le P(Z le 0) + sum_n=0^infty e^eta (n+1) P(n < Z le n+1).$$
Now if the limsup is negative, then there is some $r > 0$ such that $P(n < Z le n+1) le e^-rn$ for all sufficiently large $n$, which would imply that the sum on the right side converges when $eta < r$.
$endgroup$
$begingroup$
Thank you. I overlook some detail, the interval in second term of first inequality is "longer" for large n. And I have new problem, can you please help?
$endgroup$
– edwardngtakwa
Apr 1 at 19:16
$begingroup$
@edwardngtakwa: See edit
$endgroup$
– Nate Eldredge
Apr 1 at 20:17
add a comment |
Your Answer
StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "69"
;
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function()
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled)
StackExchange.using("snippets", function()
createEditor();
);
else
createEditor();
);
function createEditor()
StackExchange.prepareEditor(
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader:
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
,
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);
);
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3170715%2fproof-of-theorem-2-7-10-in-durrett-edited%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
I have the 4th edition, where this appears to correspond to Theorem 2.6.5. You've omitted the last part of the sentence following the equation, which says
for large $n$ by the weak law of large numbers.
So it is exactly as you say: the weak law of large numbers implies that $Pleft(S^lambda_n in ((a_0-epsilon)n,(a_0+epsilon)n] right) to 1$ as $n to infty$, and thus for sufficiently large $n$ it is at least $frac12$. It seems like the choice of $frac12$ is arbitrary; we just need some convenient number in between 0 and 1.
For the second part, let $Z = X_1^lambda / (a-a_0+epsilon)$. Note that
$$e^eta Z le 1_Z le 0 + sum_n=0^infty e^eta (n+1) 1_n < Z le n+1$$
and so $$E[e^eta Z] le P(Z le 0) + sum_n=0^infty e^eta (n+1) P(n < Z le n+1).$$
Now if the limsup is negative, then there is some $r > 0$ such that $P(n < Z le n+1) le e^-rn$ for all sufficiently large $n$, which would imply that the sum on the right side converges when $eta < r$.
$endgroup$
$begingroup$
Thank you. I overlook some detail, the interval in second term of first inequality is "longer" for large n. And I have new problem, can you please help?
$endgroup$
– edwardngtakwa
Apr 1 at 19:16
$begingroup$
@edwardngtakwa: See edit
$endgroup$
– Nate Eldredge
Apr 1 at 20:17
add a comment |
$begingroup$
I have the 4th edition, where this appears to correspond to Theorem 2.6.5. You've omitted the last part of the sentence following the equation, which says
for large $n$ by the weak law of large numbers.
So it is exactly as you say: the weak law of large numbers implies that $Pleft(S^lambda_n in ((a_0-epsilon)n,(a_0+epsilon)n] right) to 1$ as $n to infty$, and thus for sufficiently large $n$ it is at least $frac12$. It seems like the choice of $frac12$ is arbitrary; we just need some convenient number in between 0 and 1.
For the second part, let $Z = X_1^lambda / (a-a_0+epsilon)$. Note that
$$e^eta Z le 1_Z le 0 + sum_n=0^infty e^eta (n+1) 1_n < Z le n+1$$
and so $$E[e^eta Z] le P(Z le 0) + sum_n=0^infty e^eta (n+1) P(n < Z le n+1).$$
Now if the limsup is negative, then there is some $r > 0$ such that $P(n < Z le n+1) le e^-rn$ for all sufficiently large $n$, which would imply that the sum on the right side converges when $eta < r$.
$endgroup$
$begingroup$
Thank you. I overlook some detail, the interval in second term of first inequality is "longer" for large n. And I have new problem, can you please help?
$endgroup$
– edwardngtakwa
Apr 1 at 19:16
$begingroup$
@edwardngtakwa: See edit
$endgroup$
– Nate Eldredge
Apr 1 at 20:17
add a comment |
$begingroup$
I have the 4th edition, where this appears to correspond to Theorem 2.6.5. You've omitted the last part of the sentence following the equation, which says
for large $n$ by the weak law of large numbers.
So it is exactly as you say: the weak law of large numbers implies that $Pleft(S^lambda_n in ((a_0-epsilon)n,(a_0+epsilon)n] right) to 1$ as $n to infty$, and thus for sufficiently large $n$ it is at least $frac12$. It seems like the choice of $frac12$ is arbitrary; we just need some convenient number in between 0 and 1.
For the second part, let $Z = X_1^lambda / (a-a_0+epsilon)$. Note that
$$e^eta Z le 1_Z le 0 + sum_n=0^infty e^eta (n+1) 1_n < Z le n+1$$
and so $$E[e^eta Z] le P(Z le 0) + sum_n=0^infty e^eta (n+1) P(n < Z le n+1).$$
Now if the limsup is negative, then there is some $r > 0$ such that $P(n < Z le n+1) le e^-rn$ for all sufficiently large $n$, which would imply that the sum on the right side converges when $eta < r$.
$endgroup$
I have the 4th edition, where this appears to correspond to Theorem 2.6.5. You've omitted the last part of the sentence following the equation, which says
for large $n$ by the weak law of large numbers.
So it is exactly as you say: the weak law of large numbers implies that $Pleft(S^lambda_n in ((a_0-epsilon)n,(a_0+epsilon)n] right) to 1$ as $n to infty$, and thus for sufficiently large $n$ it is at least $frac12$. It seems like the choice of $frac12$ is arbitrary; we just need some convenient number in between 0 and 1.
For the second part, let $Z = X_1^lambda / (a-a_0+epsilon)$. Note that
$$e^eta Z le 1_Z le 0 + sum_n=0^infty e^eta (n+1) 1_n < Z le n+1$$
and so $$E[e^eta Z] le P(Z le 0) + sum_n=0^infty e^eta (n+1) P(n < Z le n+1).$$
Now if the limsup is negative, then there is some $r > 0$ such that $P(n < Z le n+1) le e^-rn$ for all sufficiently large $n$, which would imply that the sum on the right side converges when $eta < r$.
edited Apr 1 at 20:17
answered Apr 1 at 15:07
Nate EldredgeNate Eldredge
64.6k682174
64.6k682174
$begingroup$
Thank you. I overlook some detail, the interval in second term of first inequality is "longer" for large n. And I have new problem, can you please help?
$endgroup$
– edwardngtakwa
Apr 1 at 19:16
$begingroup$
@edwardngtakwa: See edit
$endgroup$
– Nate Eldredge
Apr 1 at 20:17
add a comment |
$begingroup$
Thank you. I overlook some detail, the interval in second term of first inequality is "longer" for large n. And I have new problem, can you please help?
$endgroup$
– edwardngtakwa
Apr 1 at 19:16
$begingroup$
@edwardngtakwa: See edit
$endgroup$
– Nate Eldredge
Apr 1 at 20:17
$begingroup$
Thank you. I overlook some detail, the interval in second term of first inequality is "longer" for large n. And I have new problem, can you please help?
$endgroup$
– edwardngtakwa
Apr 1 at 19:16
$begingroup$
Thank you. I overlook some detail, the interval in second term of first inequality is "longer" for large n. And I have new problem, can you please help?
$endgroup$
– edwardngtakwa
Apr 1 at 19:16
$begingroup$
@edwardngtakwa: See edit
$endgroup$
– Nate Eldredge
Apr 1 at 20:17
$begingroup$
@edwardngtakwa: See edit
$endgroup$
– Nate Eldredge
Apr 1 at 20:17
add a comment |
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3170715%2fproof-of-theorem-2-7-10-in-durrett-edited%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown