Prove that $inf left int_E f dmu : mu (E) geq alpharight > 0$ Announcing the arrival of Valued Associate #679: Cesar Manara Planned maintenance scheduled April 23, 2019 at 23:30 UTC (7:30pm US/Eastern)Homework measureIf $int_E f=int_E g$ then $f=g$ a.e.?Show that there exists a measurable function $g$ with $|g| leq 1$ so that $int_E g dnu = |nu|(E)$ for all measurable sets $E$.Use the definition of the integral to prove that if $A subset E$, where $E$ is measurable, then $int_A f = int_E f chi_A$Let $f$ be positive and Lebesgue measurable on $[0,1]$. Show that $inf_lambda(E)geq epsilon int_E fdlambda >0$ for any $epsilonin(0,1]$.Prove $lim_ntoinftyint_E_nf(x)dmu=int_E f(x)dmu,,,,,,text where E=cup_n=1^infty E_n$Prove that $int_A f = int_E fchi_A$ using definition of Lebesgue integralProof verification that $mu_f$($E$) $=$ $int_E f,dlambda$ is a measure on $mathcal M$.Prove that $infleftint_E f dmu : E in mathcalM, mu(E)geq 0 right>0$Problems proving that if $f_nrightarrow f$ pointwise and $int_R f=lim_nint_R f_n$ then $int_E f=lim_nint_E f_n$ for meas $E subseteq R$.
Was the pager message from Nick Fury to Captain Marvel unnecessary?
Is there a verb for listening stealthily?
Any stored/leased 737s that could substitute for grounded MAXs?
What was the last profitable war?
How do Java 8 default methods hеlp with lambdas?
Keep at all times, the minus sign above aligned with minus sign below
Centre cell vertically in tabularx
Is there a spell that can create a permanent fire?
Find general formula for the terms
Flight departed from the gate 5 min before scheduled departure time. Refund options
French equivalents of おしゃれは足元から (Every good outfit starts with the shoes)
Determine whether an integer is a palindrome
Twin's vs. Twins'
Why weren't discrete x86 CPUs ever used in game hardware?
Random body shuffle every night—can we still function?
My mentor says to set image to Fine instead of RAW — how is this different from JPG?
Can two people see the same photon?
NIntegrate on a solution of a matrix ODE
Weaponising the Grasp-at-a-Distance spell
What does 丫 mean? 丫是什么意思?
Found this skink in my tomato plant bucket. Is he trapped? Or could he leave if he wanted?
Why can't fire hurt Daenerys but it did to Jon Snow in season 1?
Besides transaction validation, are there any other uses of the Script language in Bitcoin
Why did Bronn offer to be Tyrion Lannister's champion in trial by combat?
Prove that $inf left int_E f dmu : mu (E) geq alpharight > 0$
Announcing the arrival of Valued Associate #679: Cesar Manara
Planned maintenance scheduled April 23, 2019 at 23:30 UTC (7:30pm US/Eastern)Homework measureIf $int_E f=int_E g$ then $f=g$ a.e.?Show that there exists a measurable function $g$ with $|g| leq 1$ so that $int_E g dnu = |nu|(E)$ for all measurable sets $E$.Use the definition of the integral to prove that if $A subset E$, where $E$ is measurable, then $int_A f = int_E f chi_A$Let $f$ be positive and Lebesgue measurable on $[0,1]$. Show that $inf_lambda(E)geq epsilon int_E fdlambda >0$ for any $epsilonin(0,1]$.Prove $lim_ntoinftyint_E_nf(x)dmu=int_E f(x)dmu,,,,,,text where E=cup_n=1^infty E_n$Prove that $int_A f = int_E fchi_A$ using definition of Lebesgue integralProof verification that $mu_f$($E$) $=$ $int_E f,dlambda$ is a measure on $mathcal M$.Prove that $infleftint_E f dmu : E in mathcalM, mu(E)geq 0 right>0$Problems proving that if $f_nrightarrow f$ pointwise and $int_R f=lim_nint_R f_n$ then $int_E f=lim_nint_E f_n$ for meas $E subseteq R$.
$begingroup$
The next problem appears in the book "Real analysis" by Thomson/Bruckner in the chapter of Integrable functions. My proof seems good to me but I'm not confident enough with my proofs in this subject.
Here, $(X, sigma, mu)$ is a measurable space. I use the following:
Definition
Given a succession $(E_n)$ of measurable sets, $limsup E_n = x in X : x$ belongs to $E_j$ for infinitely many $j $
Theorem: if $(E_n)$ is a succession of measurable sets and $mu (cup E_n) < infty$ then $limsup mu(E_n) leq mu(limsup E_n)$
Problem: Suppose that $f in L_1(X)$, that $f(x)>0$ for all $x in X$, and that $0 < alpha < mu(X) < infty $. Prove that
$$ inf left int_E f dmu : mu (E) geq alpharight > 0. $$
My attempt:
Suppose that $inf left int_E f dmu : mu (E) geq alpharight = 0$. Then, we can choose a succession $(E_n)_n geq 1$ such that $mu(E_n) geq alpha$ and
$$ int_En f < fracalpha2^n.$$
Then, $f|_E_n < frac12^n $. For if $f|_E_n geq frac12^n $ then we have
$$ fracalpha2^n > int_E_n f d mu geq int_E_n fracd mu2^n = fracmu(E_n)2^n geq fracalpha2^n,$$
a contradiction.
Now, if there exist $ x in X$ such that $x in limsup E_n$ then $f(x)<fracalpha2^j$, for infinitely many $j's$. So we must have $f(x) = 0$, contradicting that $f > 0$. Therefore $limsup E_n = emptyset$ and $mu (limsup E_n)=0$.
However
$limsup mu(E_n) geq alpha$ because $mu(E_n) geq alpha$ for every $n$. And because we are in a space of finite measure, we can aply the above theorem and obtain
$$ 0 < alpha leq limsup mu(E_n) leq mu (limsup E_n) = 0. $$
So $alpha = 0$ is our final contradiction.
measure-theory proof-verification lebesgue-integral
$endgroup$
add a comment |
$begingroup$
The next problem appears in the book "Real analysis" by Thomson/Bruckner in the chapter of Integrable functions. My proof seems good to me but I'm not confident enough with my proofs in this subject.
Here, $(X, sigma, mu)$ is a measurable space. I use the following:
Definition
Given a succession $(E_n)$ of measurable sets, $limsup E_n = x in X : x$ belongs to $E_j$ for infinitely many $j $
Theorem: if $(E_n)$ is a succession of measurable sets and $mu (cup E_n) < infty$ then $limsup mu(E_n) leq mu(limsup E_n)$
Problem: Suppose that $f in L_1(X)$, that $f(x)>0$ for all $x in X$, and that $0 < alpha < mu(X) < infty $. Prove that
$$ inf left int_E f dmu : mu (E) geq alpharight > 0. $$
My attempt:
Suppose that $inf left int_E f dmu : mu (E) geq alpharight = 0$. Then, we can choose a succession $(E_n)_n geq 1$ such that $mu(E_n) geq alpha$ and
$$ int_En f < fracalpha2^n.$$
Then, $f|_E_n < frac12^n $. For if $f|_E_n geq frac12^n $ then we have
$$ fracalpha2^n > int_E_n f d mu geq int_E_n fracd mu2^n = fracmu(E_n)2^n geq fracalpha2^n,$$
a contradiction.
Now, if there exist $ x in X$ such that $x in limsup E_n$ then $f(x)<fracalpha2^j$, for infinitely many $j's$. So we must have $f(x) = 0$, contradicting that $f > 0$. Therefore $limsup E_n = emptyset$ and $mu (limsup E_n)=0$.
However
$limsup mu(E_n) geq alpha$ because $mu(E_n) geq alpha$ for every $n$. And because we are in a space of finite measure, we can aply the above theorem and obtain
$$ 0 < alpha leq limsup mu(E_n) leq mu (limsup E_n) = 0. $$
So $alpha = 0$ is our final contradiction.
measure-theory proof-verification lebesgue-integral
$endgroup$
$begingroup$
Your proof is not valid. You are assuming that either $f|E_n < frac 1 2^n$ at every point or $f|E_n geq frac 1 2^n$ at every point. There may be some points $x$ of $E_n$ where $f(x)< frac 1 2^n$ and some others where $f(x)> frac 1 2^n$.
$endgroup$
– Kavi Rama Murthy
Mar 8 at 0:11
add a comment |
$begingroup$
The next problem appears in the book "Real analysis" by Thomson/Bruckner in the chapter of Integrable functions. My proof seems good to me but I'm not confident enough with my proofs in this subject.
Here, $(X, sigma, mu)$ is a measurable space. I use the following:
Definition
Given a succession $(E_n)$ of measurable sets, $limsup E_n = x in X : x$ belongs to $E_j$ for infinitely many $j $
Theorem: if $(E_n)$ is a succession of measurable sets and $mu (cup E_n) < infty$ then $limsup mu(E_n) leq mu(limsup E_n)$
Problem: Suppose that $f in L_1(X)$, that $f(x)>0$ for all $x in X$, and that $0 < alpha < mu(X) < infty $. Prove that
$$ inf left int_E f dmu : mu (E) geq alpharight > 0. $$
My attempt:
Suppose that $inf left int_E f dmu : mu (E) geq alpharight = 0$. Then, we can choose a succession $(E_n)_n geq 1$ such that $mu(E_n) geq alpha$ and
$$ int_En f < fracalpha2^n.$$
Then, $f|_E_n < frac12^n $. For if $f|_E_n geq frac12^n $ then we have
$$ fracalpha2^n > int_E_n f d mu geq int_E_n fracd mu2^n = fracmu(E_n)2^n geq fracalpha2^n,$$
a contradiction.
Now, if there exist $ x in X$ such that $x in limsup E_n$ then $f(x)<fracalpha2^j$, for infinitely many $j's$. So we must have $f(x) = 0$, contradicting that $f > 0$. Therefore $limsup E_n = emptyset$ and $mu (limsup E_n)=0$.
However
$limsup mu(E_n) geq alpha$ because $mu(E_n) geq alpha$ for every $n$. And because we are in a space of finite measure, we can aply the above theorem and obtain
$$ 0 < alpha leq limsup mu(E_n) leq mu (limsup E_n) = 0. $$
So $alpha = 0$ is our final contradiction.
measure-theory proof-verification lebesgue-integral
$endgroup$
The next problem appears in the book "Real analysis" by Thomson/Bruckner in the chapter of Integrable functions. My proof seems good to me but I'm not confident enough with my proofs in this subject.
Here, $(X, sigma, mu)$ is a measurable space. I use the following:
Definition
Given a succession $(E_n)$ of measurable sets, $limsup E_n = x in X : x$ belongs to $E_j$ for infinitely many $j $
Theorem: if $(E_n)$ is a succession of measurable sets and $mu (cup E_n) < infty$ then $limsup mu(E_n) leq mu(limsup E_n)$
Problem: Suppose that $f in L_1(X)$, that $f(x)>0$ for all $x in X$, and that $0 < alpha < mu(X) < infty $. Prove that
$$ inf left int_E f dmu : mu (E) geq alpharight > 0. $$
My attempt:
Suppose that $inf left int_E f dmu : mu (E) geq alpharight = 0$. Then, we can choose a succession $(E_n)_n geq 1$ such that $mu(E_n) geq alpha$ and
$$ int_En f < fracalpha2^n.$$
Then, $f|_E_n < frac12^n $. For if $f|_E_n geq frac12^n $ then we have
$$ fracalpha2^n > int_E_n f d mu geq int_E_n fracd mu2^n = fracmu(E_n)2^n geq fracalpha2^n,$$
a contradiction.
Now, if there exist $ x in X$ such that $x in limsup E_n$ then $f(x)<fracalpha2^j$, for infinitely many $j's$. So we must have $f(x) = 0$, contradicting that $f > 0$. Therefore $limsup E_n = emptyset$ and $mu (limsup E_n)=0$.
However
$limsup mu(E_n) geq alpha$ because $mu(E_n) geq alpha$ for every $n$. And because we are in a space of finite measure, we can aply the above theorem and obtain
$$ 0 < alpha leq limsup mu(E_n) leq mu (limsup E_n) = 0. $$
So $alpha = 0$ is our final contradiction.
measure-theory proof-verification lebesgue-integral
measure-theory proof-verification lebesgue-integral
asked Mar 7 at 23:30
seferpdseferpd
85
85
$begingroup$
Your proof is not valid. You are assuming that either $f|E_n < frac 1 2^n$ at every point or $f|E_n geq frac 1 2^n$ at every point. There may be some points $x$ of $E_n$ where $f(x)< frac 1 2^n$ and some others where $f(x)> frac 1 2^n$.
$endgroup$
– Kavi Rama Murthy
Mar 8 at 0:11
add a comment |
$begingroup$
Your proof is not valid. You are assuming that either $f|E_n < frac 1 2^n$ at every point or $f|E_n geq frac 1 2^n$ at every point. There may be some points $x$ of $E_n$ where $f(x)< frac 1 2^n$ and some others where $f(x)> frac 1 2^n$.
$endgroup$
– Kavi Rama Murthy
Mar 8 at 0:11
$begingroup$
Your proof is not valid. You are assuming that either $f|E_n < frac 1 2^n$ at every point or $f|E_n geq frac 1 2^n$ at every point. There may be some points $x$ of $E_n$ where $f(x)< frac 1 2^n$ and some others where $f(x)> frac 1 2^n$.
$endgroup$
– Kavi Rama Murthy
Mar 8 at 0:11
$begingroup$
Your proof is not valid. You are assuming that either $f|E_n < frac 1 2^n$ at every point or $f|E_n geq frac 1 2^n$ at every point. There may be some points $x$ of $E_n$ where $f(x)< frac 1 2^n$ and some others where $f(x)> frac 1 2^n$.
$endgroup$
– Kavi Rama Murthy
Mar 8 at 0:11
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
For $ninmathbbN$, define $A_n=x:f(x)>frac1n$ note that $A_nuparrow X$ (because $f(x)>0$), so $mu(A_n)uparrowmu(X)$. Hence, there is some $m$ big enough such that $mu(X)-mu(A_m)=mu(X-A_m)<alpha/2$.
Therefore, for any set $E$ with $mu(E)>alpha$, you will have that $mu(Ecap A_m)geq mu(E)-mu(X-A_m)>fracalpha2$.
Hence, $int_Ef dmugeq int_Ecap A_mf dmugeqint_Ecap A_mfrac1mdmu=frac1mmu(Ecap A_m)>fracalpha2m$.
So the infimum is at least $fracalpha2m>0$.
$endgroup$
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%2f3139500%2fprove-that-inf-left-int-e-f-d-mu-mu-e-geq-alpha-right-0%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$
For $ninmathbbN$, define $A_n=x:f(x)>frac1n$ note that $A_nuparrow X$ (because $f(x)>0$), so $mu(A_n)uparrowmu(X)$. Hence, there is some $m$ big enough such that $mu(X)-mu(A_m)=mu(X-A_m)<alpha/2$.
Therefore, for any set $E$ with $mu(E)>alpha$, you will have that $mu(Ecap A_m)geq mu(E)-mu(X-A_m)>fracalpha2$.
Hence, $int_Ef dmugeq int_Ecap A_mf dmugeqint_Ecap A_mfrac1mdmu=frac1mmu(Ecap A_m)>fracalpha2m$.
So the infimum is at least $fracalpha2m>0$.
$endgroup$
add a comment |
$begingroup$
For $ninmathbbN$, define $A_n=x:f(x)>frac1n$ note that $A_nuparrow X$ (because $f(x)>0$), so $mu(A_n)uparrowmu(X)$. Hence, there is some $m$ big enough such that $mu(X)-mu(A_m)=mu(X-A_m)<alpha/2$.
Therefore, for any set $E$ with $mu(E)>alpha$, you will have that $mu(Ecap A_m)geq mu(E)-mu(X-A_m)>fracalpha2$.
Hence, $int_Ef dmugeq int_Ecap A_mf dmugeqint_Ecap A_mfrac1mdmu=frac1mmu(Ecap A_m)>fracalpha2m$.
So the infimum is at least $fracalpha2m>0$.
$endgroup$
add a comment |
$begingroup$
For $ninmathbbN$, define $A_n=x:f(x)>frac1n$ note that $A_nuparrow X$ (because $f(x)>0$), so $mu(A_n)uparrowmu(X)$. Hence, there is some $m$ big enough such that $mu(X)-mu(A_m)=mu(X-A_m)<alpha/2$.
Therefore, for any set $E$ with $mu(E)>alpha$, you will have that $mu(Ecap A_m)geq mu(E)-mu(X-A_m)>fracalpha2$.
Hence, $int_Ef dmugeq int_Ecap A_mf dmugeqint_Ecap A_mfrac1mdmu=frac1mmu(Ecap A_m)>fracalpha2m$.
So the infimum is at least $fracalpha2m>0$.
$endgroup$
For $ninmathbbN$, define $A_n=x:f(x)>frac1n$ note that $A_nuparrow X$ (because $f(x)>0$), so $mu(A_n)uparrowmu(X)$. Hence, there is some $m$ big enough such that $mu(X)-mu(A_m)=mu(X-A_m)<alpha/2$.
Therefore, for any set $E$ with $mu(E)>alpha$, you will have that $mu(Ecap A_m)geq mu(E)-mu(X-A_m)>fracalpha2$.
Hence, $int_Ef dmugeq int_Ecap A_mf dmugeqint_Ecap A_mfrac1mdmu=frac1mmu(Ecap A_m)>fracalpha2m$.
So the infimum is at least $fracalpha2m>0$.
edited Apr 2 at 14:47
answered Mar 8 at 1:26
Julian MejiaJulian Mejia
76729
76729
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.
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%2f3139500%2fprove-that-inf-left-int-e-f-d-mu-mu-e-geq-alpha-right-0%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
$begingroup$
Your proof is not valid. You are assuming that either $f|E_n < frac 1 2^n$ at every point or $f|E_n geq frac 1 2^n$ at every point. There may be some points $x$ of $E_n$ where $f(x)< frac 1 2^n$ and some others where $f(x)> frac 1 2^n$.
$endgroup$
– Kavi Rama Murthy
Mar 8 at 0:11