Equivalence of limit supremum of sequence of sets and sequence of functions
Let $X_1,X_2,dots$ be a sequence of real-valued random variables where $X_n:Omega to mathbb{R}$.
For any sequence of events $A_n subset Omega$ define $limsup_nA_n := bigcap_{n=1}^{infty}bigcup_{m=n}^{infty}A_m$.
Moreover, define the (extended-real) random variable $Y equiv (limsup_nX_n)$ by $Y(omega) := limsup_n{X_n(omega) mid n=1,2,dots}$.
How would you establish that
$$
limsup_{n}{omega mid X_n(omega) in B} = {omega mid (limsup_nX_n)(omega) in B }, qquad (*)
$$
for any Borel set $B$? Is the proposition $(*)$ even true?
probability probability-theory measure-theory limsup-and-liminf
add a comment |
Let $X_1,X_2,dots$ be a sequence of real-valued random variables where $X_n:Omega to mathbb{R}$.
For any sequence of events $A_n subset Omega$ define $limsup_nA_n := bigcap_{n=1}^{infty}bigcup_{m=n}^{infty}A_m$.
Moreover, define the (extended-real) random variable $Y equiv (limsup_nX_n)$ by $Y(omega) := limsup_n{X_n(omega) mid n=1,2,dots}$.
How would you establish that
$$
limsup_{n}{omega mid X_n(omega) in B} = {omega mid (limsup_nX_n)(omega) in B }, qquad (*)
$$
for any Borel set $B$? Is the proposition $(*)$ even true?
probability probability-theory measure-theory limsup-and-liminf
add a comment |
Let $X_1,X_2,dots$ be a sequence of real-valued random variables where $X_n:Omega to mathbb{R}$.
For any sequence of events $A_n subset Omega$ define $limsup_nA_n := bigcap_{n=1}^{infty}bigcup_{m=n}^{infty}A_m$.
Moreover, define the (extended-real) random variable $Y equiv (limsup_nX_n)$ by $Y(omega) := limsup_n{X_n(omega) mid n=1,2,dots}$.
How would you establish that
$$
limsup_{n}{omega mid X_n(omega) in B} = {omega mid (limsup_nX_n)(omega) in B }, qquad (*)
$$
for any Borel set $B$? Is the proposition $(*)$ even true?
probability probability-theory measure-theory limsup-and-liminf
Let $X_1,X_2,dots$ be a sequence of real-valued random variables where $X_n:Omega to mathbb{R}$.
For any sequence of events $A_n subset Omega$ define $limsup_nA_n := bigcap_{n=1}^{infty}bigcup_{m=n}^{infty}A_m$.
Moreover, define the (extended-real) random variable $Y equiv (limsup_nX_n)$ by $Y(omega) := limsup_n{X_n(omega) mid n=1,2,dots}$.
How would you establish that
$$
limsup_{n}{omega mid X_n(omega) in B} = {omega mid (limsup_nX_n)(omega) in B }, qquad (*)
$$
for any Borel set $B$? Is the proposition $(*)$ even true?
probability probability-theory measure-theory limsup-and-liminf
probability probability-theory measure-theory limsup-and-liminf
edited Nov 27 at 1:48
asked Nov 25 at 23:27
jesterII
1,19621226
1,19621226
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
After further thought I believe that $(*)$ is in general false.
Let $B = { b}$ be a singleton set. Observe that
$omega in { omega' mid (limsup_nX_n)(omega') = b }$ if and only if $limsup{X_1(omega), X_2(omega), dots } = b$.
$omega in limsup_n{ omega' mid X_n(omega') = b }$ if and only if for all $n$ there exists $m>n$ such that $X_m(omega)=b$, or in other words $X_n(omega) = b$ infinitely often.
Let $omega$ be such that the sequence $(X_n(omega))_{n=1}^{infty} = (0,1,0,1,0,1,0,1,dots)$ and put $b=0$. Then $(limsup_nX_n)(omega) = 1$, however $X_n(omega) = 0$ occurs infinitely often.
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
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%2f3013575%2fequivalence-of-limit-supremum-of-sequence-of-sets-and-sequence-of-functions%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
After further thought I believe that $(*)$ is in general false.
Let $B = { b}$ be a singleton set. Observe that
$omega in { omega' mid (limsup_nX_n)(omega') = b }$ if and only if $limsup{X_1(omega), X_2(omega), dots } = b$.
$omega in limsup_n{ omega' mid X_n(omega') = b }$ if and only if for all $n$ there exists $m>n$ such that $X_m(omega)=b$, or in other words $X_n(omega) = b$ infinitely often.
Let $omega$ be such that the sequence $(X_n(omega))_{n=1}^{infty} = (0,1,0,1,0,1,0,1,dots)$ and put $b=0$. Then $(limsup_nX_n)(omega) = 1$, however $X_n(omega) = 0$ occurs infinitely often.
add a comment |
After further thought I believe that $(*)$ is in general false.
Let $B = { b}$ be a singleton set. Observe that
$omega in { omega' mid (limsup_nX_n)(omega') = b }$ if and only if $limsup{X_1(omega), X_2(omega), dots } = b$.
$omega in limsup_n{ omega' mid X_n(omega') = b }$ if and only if for all $n$ there exists $m>n$ such that $X_m(omega)=b$, or in other words $X_n(omega) = b$ infinitely often.
Let $omega$ be such that the sequence $(X_n(omega))_{n=1}^{infty} = (0,1,0,1,0,1,0,1,dots)$ and put $b=0$. Then $(limsup_nX_n)(omega) = 1$, however $X_n(omega) = 0$ occurs infinitely often.
add a comment |
After further thought I believe that $(*)$ is in general false.
Let $B = { b}$ be a singleton set. Observe that
$omega in { omega' mid (limsup_nX_n)(omega') = b }$ if and only if $limsup{X_1(omega), X_2(omega), dots } = b$.
$omega in limsup_n{ omega' mid X_n(omega') = b }$ if and only if for all $n$ there exists $m>n$ such that $X_m(omega)=b$, or in other words $X_n(omega) = b$ infinitely often.
Let $omega$ be such that the sequence $(X_n(omega))_{n=1}^{infty} = (0,1,0,1,0,1,0,1,dots)$ and put $b=0$. Then $(limsup_nX_n)(omega) = 1$, however $X_n(omega) = 0$ occurs infinitely often.
After further thought I believe that $(*)$ is in general false.
Let $B = { b}$ be a singleton set. Observe that
$omega in { omega' mid (limsup_nX_n)(omega') = b }$ if and only if $limsup{X_1(omega), X_2(omega), dots } = b$.
$omega in limsup_n{ omega' mid X_n(omega') = b }$ if and only if for all $n$ there exists $m>n$ such that $X_m(omega)=b$, or in other words $X_n(omega) = b$ infinitely often.
Let $omega$ be such that the sequence $(X_n(omega))_{n=1}^{infty} = (0,1,0,1,0,1,0,1,dots)$ and put $b=0$. Then $(limsup_nX_n)(omega) = 1$, however $X_n(omega) = 0$ occurs infinitely often.
answered Nov 29 at 19:36
jesterII
1,19621226
1,19621226
add a comment |
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.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- 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.
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%2f3013575%2fequivalence-of-limit-supremum-of-sequence-of-sets-and-sequence-of-functions%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