The measurability of $f(x)$ given that $lim f_n(x) = f(x)$.
Clash Royale CLAN TAG#URR8PPP
up vote
1
down vote
favorite
I have difficulty in interpreting the equality "$x in X : sup_nin N f_n(x) > alpha = cup_n=1^infty x in X : f_n(x) > alpha $". Is this right to say that $sup_nin Nf_n(x)$ is the largest $f_n(x)$, so it contains $x in X$ the most on the condition given, so it is equal to the union of sets?
Furthermore, it is quite difficult for me to understand the proof for $f^*, F^*$. Could you elaborate on either of one?
Thank you in advance.
measure-theory
add a comment |Â
up vote
1
down vote
favorite
I have difficulty in interpreting the equality "$x in X : sup_nin N f_n(x) > alpha = cup_n=1^infty x in X : f_n(x) > alpha $". Is this right to say that $sup_nin Nf_n(x)$ is the largest $f_n(x)$, so it contains $x in X$ the most on the condition given, so it is equal to the union of sets?
Furthermore, it is quite difficult for me to understand the proof for $f^*, F^*$. Could you elaborate on either of one?
Thank you in advance.
measure-theory
add a comment |Â
up vote
1
down vote
favorite
up vote
1
down vote
favorite
I have difficulty in interpreting the equality "$x in X : sup_nin N f_n(x) > alpha = cup_n=1^infty x in X : f_n(x) > alpha $". Is this right to say that $sup_nin Nf_n(x)$ is the largest $f_n(x)$, so it contains $x in X$ the most on the condition given, so it is equal to the union of sets?
Furthermore, it is quite difficult for me to understand the proof for $f^*, F^*$. Could you elaborate on either of one?
Thank you in advance.
measure-theory
I have difficulty in interpreting the equality "$x in X : sup_nin N f_n(x) > alpha = cup_n=1^infty x in X : f_n(x) > alpha $". Is this right to say that $sup_nin Nf_n(x)$ is the largest $f_n(x)$, so it contains $x in X$ the most on the condition given, so it is equal to the union of sets?
Furthermore, it is quite difficult for me to understand the proof for $f^*, F^*$. Could you elaborate on either of one?
Thank you in advance.
measure-theory
asked Jul 31 at 10:50
Sihyun Kim
701210
701210
add a comment |Â
add a comment |Â
1 Answer
1
active
oldest
votes
up vote
1
down vote
Let $z in cup_n=1^infty x in X : f_n(x) > alpha $. This means that for some $m in mathbb N$, $f_m(z) > alpha$, which implies that $sup_n f_n(z) > alpha$. In other words, $$ bigcup_n=1^infty x in X : f_n(x) > alpha subseteq x in X : sup_n f_n(x) > alpha .$$
To see the reverse inclusion, let $z in x in X : sup_n f_n(x) > alpha $. This implies that there is a sequence $ m_i _i=1^infty subseteq mathbb N$ such that
$$ lim_i to infty f_m_i (z) > alpha. $$
In particular, this means that $f_m_i(z) > alpha$ for all large enough $i$. Thus, there exists an $n in mathbb N$ such that $f_n(z) > alpha$. This proves the reverse inclusion.
Now let $g_n(x) = inf_m ge n f_m (x)$. The previous argument shows that $g_n(x)$ is measurable. The same reasoning shows that $f^*(x) = sup_n g_n(x)$ is measurable. The exact same argument applies to $F^*$.
Note that the displayed equalities for $f^*$ and $F^*$ are equivalent definitions for $limsup$ and $liminf$.
add a comment |Â
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
up vote
1
down vote
Let $z in cup_n=1^infty x in X : f_n(x) > alpha $. This means that for some $m in mathbb N$, $f_m(z) > alpha$, which implies that $sup_n f_n(z) > alpha$. In other words, $$ bigcup_n=1^infty x in X : f_n(x) > alpha subseteq x in X : sup_n f_n(x) > alpha .$$
To see the reverse inclusion, let $z in x in X : sup_n f_n(x) > alpha $. This implies that there is a sequence $ m_i _i=1^infty subseteq mathbb N$ such that
$$ lim_i to infty f_m_i (z) > alpha. $$
In particular, this means that $f_m_i(z) > alpha$ for all large enough $i$. Thus, there exists an $n in mathbb N$ such that $f_n(z) > alpha$. This proves the reverse inclusion.
Now let $g_n(x) = inf_m ge n f_m (x)$. The previous argument shows that $g_n(x)$ is measurable. The same reasoning shows that $f^*(x) = sup_n g_n(x)$ is measurable. The exact same argument applies to $F^*$.
Note that the displayed equalities for $f^*$ and $F^*$ are equivalent definitions for $limsup$ and $liminf$.
add a comment |Â
up vote
1
down vote
Let $z in cup_n=1^infty x in X : f_n(x) > alpha $. This means that for some $m in mathbb N$, $f_m(z) > alpha$, which implies that $sup_n f_n(z) > alpha$. In other words, $$ bigcup_n=1^infty x in X : f_n(x) > alpha subseteq x in X : sup_n f_n(x) > alpha .$$
To see the reverse inclusion, let $z in x in X : sup_n f_n(x) > alpha $. This implies that there is a sequence $ m_i _i=1^infty subseteq mathbb N$ such that
$$ lim_i to infty f_m_i (z) > alpha. $$
In particular, this means that $f_m_i(z) > alpha$ for all large enough $i$. Thus, there exists an $n in mathbb N$ such that $f_n(z) > alpha$. This proves the reverse inclusion.
Now let $g_n(x) = inf_m ge n f_m (x)$. The previous argument shows that $g_n(x)$ is measurable. The same reasoning shows that $f^*(x) = sup_n g_n(x)$ is measurable. The exact same argument applies to $F^*$.
Note that the displayed equalities for $f^*$ and $F^*$ are equivalent definitions for $limsup$ and $liminf$.
add a comment |Â
up vote
1
down vote
up vote
1
down vote
Let $z in cup_n=1^infty x in X : f_n(x) > alpha $. This means that for some $m in mathbb N$, $f_m(z) > alpha$, which implies that $sup_n f_n(z) > alpha$. In other words, $$ bigcup_n=1^infty x in X : f_n(x) > alpha subseteq x in X : sup_n f_n(x) > alpha .$$
To see the reverse inclusion, let $z in x in X : sup_n f_n(x) > alpha $. This implies that there is a sequence $ m_i _i=1^infty subseteq mathbb N$ such that
$$ lim_i to infty f_m_i (z) > alpha. $$
In particular, this means that $f_m_i(z) > alpha$ for all large enough $i$. Thus, there exists an $n in mathbb N$ such that $f_n(z) > alpha$. This proves the reverse inclusion.
Now let $g_n(x) = inf_m ge n f_m (x)$. The previous argument shows that $g_n(x)$ is measurable. The same reasoning shows that $f^*(x) = sup_n g_n(x)$ is measurable. The exact same argument applies to $F^*$.
Note that the displayed equalities for $f^*$ and $F^*$ are equivalent definitions for $limsup$ and $liminf$.
Let $z in cup_n=1^infty x in X : f_n(x) > alpha $. This means that for some $m in mathbb N$, $f_m(z) > alpha$, which implies that $sup_n f_n(z) > alpha$. In other words, $$ bigcup_n=1^infty x in X : f_n(x) > alpha subseteq x in X : sup_n f_n(x) > alpha .$$
To see the reverse inclusion, let $z in x in X : sup_n f_n(x) > alpha $. This implies that there is a sequence $ m_i _i=1^infty subseteq mathbb N$ such that
$$ lim_i to infty f_m_i (z) > alpha. $$
In particular, this means that $f_m_i(z) > alpha$ for all large enough $i$. Thus, there exists an $n in mathbb N$ such that $f_n(z) > alpha$. This proves the reverse inclusion.
Now let $g_n(x) = inf_m ge n f_m (x)$. The previous argument shows that $g_n(x)$ is measurable. The same reasoning shows that $f^*(x) = sup_n g_n(x)$ is measurable. The exact same argument applies to $F^*$.
Note that the displayed equalities for $f^*$ and $F^*$ are equivalent definitions for $limsup$ and $liminf$.
answered Jul 31 at 11:07
Theoretical Economist
3,1352626
3,1352626
add a comment |Â
add a comment |Â
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
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2867924%2fthe-measurability-of-fx-given-that-lim-f-nx-fx%23new-answer', 'question_page');
);
Post as a guest
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
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
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