Monotone convergence theorem of random variables and its example Announcing the arrival of...
Why is it faster to reheat something than it is to cook it?
Sum letters are not two different
How to install press fit bottom bracket into new frame
Time to Settle Down!
How fail-safe is nr as stop bytes?
If Windows 7 doesn't support WSL, then what does Linux subsystem option mean?
Crossing US/Canada Border for less than 24 hours
How to play a character with a disability or mental disorder without being offensive?
How to compare two different files line by line in unix?
Can a new player join a group only when a new campaign starts?
What initially awakened the Balrog?
Using audio cues to encourage good posture
Disembodied hand growing fangs
How to react to hostile behavior from a senior developer?
Is it a good idea to use CNN to classify 1D signal?
How can I reduce the gap between left and right of cdot with a macro?
Is there any word for a place full of confusion?
Maximum summed subsequences with non-adjacent items
What do you call the main part of a joke?
Selecting user stories during sprint planning
What is the difference between globalisation and imperialism?
What would you call this weird metallic apparatus that allows you to lift people?
How to tell that you are a giant?
A term for a woman complaining about things/begging in a cute/childish way
Monotone convergence theorem of random variables and its example
Announcing the arrival of Valued Associate #679: Cesar Manara
Planned maintenance scheduled April 23, 2019 at 00:00UTC (8:00pm US/Eastern)Convergence of random variables (Durrett: Probability Theory and Examples)Supremum of Expectation of a Sequence of Random VariablesAn inequality in a step in the proof of monotone convergence for random variablesAlmost sure convergence of random variablesconvergence of expectation sum of infinite random variablesProperty derived form Monotone Convergence TheoremMoment generating function and convergent random variablesExample of sequence of random variables, that almost surely converge but,but doesn't converge in quadratic mean.Convergence results for conditional random random variablesLebesgue convergence theorem extension (random variables)
$begingroup$
Monotone Convergence Theorem of random variables is stated as below:
Assume that there is a sequence of random variables (r.v.) satisfing $0leq X_1leq X_2 leq cdots$ and $X_nto X$ a.s.(almost surely), then
$$E[X_n]to E[X]$$
where E is expectation.
I read about a example using the Monotone Convergence Theorem on the text book and found some problems. The example is stated as follows:
Assume r.v. X is non-negative, and denote $mu=EX$, define sequence of r.v.:
$$X_n=min{X,n},nin mathbb{N}$$
Then as $ntoinfty$, $EX_n=mu$ because $X_n$ is monotone.
My question is, why they say $X_n$ is monotone when there are posotive probability of $X_{k-1}>X_{k}$? For example, as $X_n$ are independent,
$$P(X_{k-1}= k-1, X_k<k-1)=P(X_{k-1}= k-1)P(X_k<k-1)$$
$$=P(Xgeq k-1)P( X<k-1)>0.$$
real-analysis probability-theory
$endgroup$
add a comment |
$begingroup$
Monotone Convergence Theorem of random variables is stated as below:
Assume that there is a sequence of random variables (r.v.) satisfing $0leq X_1leq X_2 leq cdots$ and $X_nto X$ a.s.(almost surely), then
$$E[X_n]to E[X]$$
where E is expectation.
I read about a example using the Monotone Convergence Theorem on the text book and found some problems. The example is stated as follows:
Assume r.v. X is non-negative, and denote $mu=EX$, define sequence of r.v.:
$$X_n=min{X,n},nin mathbb{N}$$
Then as $ntoinfty$, $EX_n=mu$ because $X_n$ is monotone.
My question is, why they say $X_n$ is monotone when there are posotive probability of $X_{k-1}>X_{k}$? For example, as $X_n$ are independent,
$$P(X_{k-1}= k-1, X_k<k-1)=P(X_{k-1}= k-1)P(X_k<k-1)$$
$$=P(Xgeq k-1)P( X<k-1)>0.$$
real-analysis probability-theory
$endgroup$
add a comment |
$begingroup$
Monotone Convergence Theorem of random variables is stated as below:
Assume that there is a sequence of random variables (r.v.) satisfing $0leq X_1leq X_2 leq cdots$ and $X_nto X$ a.s.(almost surely), then
$$E[X_n]to E[X]$$
where E is expectation.
I read about a example using the Monotone Convergence Theorem on the text book and found some problems. The example is stated as follows:
Assume r.v. X is non-negative, and denote $mu=EX$, define sequence of r.v.:
$$X_n=min{X,n},nin mathbb{N}$$
Then as $ntoinfty$, $EX_n=mu$ because $X_n$ is monotone.
My question is, why they say $X_n$ is monotone when there are posotive probability of $X_{k-1}>X_{k}$? For example, as $X_n$ are independent,
$$P(X_{k-1}= k-1, X_k<k-1)=P(X_{k-1}= k-1)P(X_k<k-1)$$
$$=P(Xgeq k-1)P( X<k-1)>0.$$
real-analysis probability-theory
$endgroup$
Monotone Convergence Theorem of random variables is stated as below:
Assume that there is a sequence of random variables (r.v.) satisfing $0leq X_1leq X_2 leq cdots$ and $X_nto X$ a.s.(almost surely), then
$$E[X_n]to E[X]$$
where E is expectation.
I read about a example using the Monotone Convergence Theorem on the text book and found some problems. The example is stated as follows:
Assume r.v. X is non-negative, and denote $mu=EX$, define sequence of r.v.:
$$X_n=min{X,n},nin mathbb{N}$$
Then as $ntoinfty$, $EX_n=mu$ because $X_n$ is monotone.
My question is, why they say $X_n$ is monotone when there are posotive probability of $X_{k-1}>X_{k}$? For example, as $X_n$ are independent,
$$P(X_{k-1}= k-1, X_k<k-1)=P(X_{k-1}= k-1)P(X_k<k-1)$$
$$=P(Xgeq k-1)P( X<k-1)>0.$$
real-analysis probability-theory
real-analysis probability-theory
asked Mar 25 at 9:48
ZishuoZishuo
163
163
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
The problem is at the understanding of the example
The example means "for the same r.v. $X$" rather than "for a sequence of i.i.d. r.v. X", which means the $X_n$ are not indepenent. For example, when $X(omega)=x$.
Those $X_n$ are $X_n=n, n< x$ and $X_n=x, ngeq x$. Obvious those $X_n$ are monotone non-decreasing and the results is correct.
$endgroup$
$begingroup$
In this case, $P(X_{k-1}=k-1,X_k<k-1)=P(Xgeq k-1,X<K-1)=0$.
$endgroup$
– Zishuo
Mar 25 at 9:50
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%2f3161577%2fmonotone-convergence-theorem-of-random-variables-and-its-example%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$
The problem is at the understanding of the example
The example means "for the same r.v. $X$" rather than "for a sequence of i.i.d. r.v. X", which means the $X_n$ are not indepenent. For example, when $X(omega)=x$.
Those $X_n$ are $X_n=n, n< x$ and $X_n=x, ngeq x$. Obvious those $X_n$ are monotone non-decreasing and the results is correct.
$endgroup$
$begingroup$
In this case, $P(X_{k-1}=k-1,X_k<k-1)=P(Xgeq k-1,X<K-1)=0$.
$endgroup$
– Zishuo
Mar 25 at 9:50
add a comment |
$begingroup$
The problem is at the understanding of the example
The example means "for the same r.v. $X$" rather than "for a sequence of i.i.d. r.v. X", which means the $X_n$ are not indepenent. For example, when $X(omega)=x$.
Those $X_n$ are $X_n=n, n< x$ and $X_n=x, ngeq x$. Obvious those $X_n$ are monotone non-decreasing and the results is correct.
$endgroup$
$begingroup$
In this case, $P(X_{k-1}=k-1,X_k<k-1)=P(Xgeq k-1,X<K-1)=0$.
$endgroup$
– Zishuo
Mar 25 at 9:50
add a comment |
$begingroup$
The problem is at the understanding of the example
The example means "for the same r.v. $X$" rather than "for a sequence of i.i.d. r.v. X", which means the $X_n$ are not indepenent. For example, when $X(omega)=x$.
Those $X_n$ are $X_n=n, n< x$ and $X_n=x, ngeq x$. Obvious those $X_n$ are monotone non-decreasing and the results is correct.
$endgroup$
The problem is at the understanding of the example
The example means "for the same r.v. $X$" rather than "for a sequence of i.i.d. r.v. X", which means the $X_n$ are not indepenent. For example, when $X(omega)=x$.
Those $X_n$ are $X_n=n, n< x$ and $X_n=x, ngeq x$. Obvious those $X_n$ are monotone non-decreasing and the results is correct.
answered Mar 25 at 9:48
ZishuoZishuo
163
163
$begingroup$
In this case, $P(X_{k-1}=k-1,X_k<k-1)=P(Xgeq k-1,X<K-1)=0$.
$endgroup$
– Zishuo
Mar 25 at 9:50
add a comment |
$begingroup$
In this case, $P(X_{k-1}=k-1,X_k<k-1)=P(Xgeq k-1,X<K-1)=0$.
$endgroup$
– Zishuo
Mar 25 at 9:50
$begingroup$
In this case, $P(X_{k-1}=k-1,X_k<k-1)=P(Xgeq k-1,X<K-1)=0$.
$endgroup$
– Zishuo
Mar 25 at 9:50
$begingroup$
In this case, $P(X_{k-1}=k-1,X_k<k-1)=P(Xgeq k-1,X<K-1)=0$.
$endgroup$
– Zishuo
Mar 25 at 9:50
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%2f3161577%2fmonotone-convergence-theorem-of-random-variables-and-its-example%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