Proving Tchebychev's Inequalityexistence of Lebesgue integralMarkov inequality limitSuppose $mu$ is a finite...
Non-Borel set in arbitrary metric space
Should I warn a new PhD Student?
Is there a POSIX way to shutdown a UNIX machine?
Not hide and seek
Do native speakers use "ultima" and "proxima" frequently in spoken English?
Travelling in US for more than 90 days
Highest stage count that are used one right after the other?
How to preserve electronics (computers, ipads, phones) for hundreds of years?
Do I have to take mana from my deck or hand when tapping this card?
Hashing password to increase entropy
Trouble reading roman numeral notation with flats
C++ lambda syntax
Why doesn't Gödel's incompleteness theorem apply to false statements?
Why do Radio Buttons not fill the entire outer circle?
When is the exact date for EOL of Ubuntu 14.04 LTS?
Can you take a "free object interaction" while incapacitated?
Why is indicated airspeed rather than ground speed used during the takeoff roll?
Derivative of an interpolated function
Why didn’t Eve recognize the little cockroach as a living organism?
Would this string work as string?
What should be the ideal length of sentences in a blog post for ease of reading?
Offset in split text content
"Marked down as someone wanting to sell shares." What does that mean?
Checking @@ROWCOUNT failing
Proving Tchebychev's Inequality
existence of Lebesgue integralMarkov inequality limitSuppose $mu$ is a finite measure and $sup_n int |f_n|^{1+epsilon} dmu<infty$ for some $epsilon$. Prove that ${f_n}$ is uniformly integrableProve that $lim_{tto infty} tmu({x:f(x)geq t})=0$Strengthened Chebyshev InequalityLebesgue integral of f over R is bigger or equal to alpha times measure of $E_alpha?$Improper integral $int_0^infty cos(x^2)$ exists but $cos(x^2)$ is not Lebesgue integrableProving Fatou's lemma from the DCTProving the Borel-Cantelli LemmaProving $g_ain L^1(mathbb{R}^d) iff a<-d$
$begingroup$
Suppose $fgeq 0$, and $f$ is lebesgue integrable. If $alpha>0$ and $E_alpha={x:f(x)>alpha}$, prove that
$$ m(E_alpha)leq 1/alpha int f $$
My proof attempt
Proof. Let the assumptions be as above. Then
$$ alpha 1_{E_alpha}<f(x)1_{E_alpha} $$
Then by monotonicity of the integral
$$ alphaint 1_{E_alpha}<int f(x)1_{E_alpha}leq int f(x) $$
$implies m(E_alpha)<1/alphaint f$.
My main concern is that I end up with $<$ instead of $leq.$ Any feedback on the proof or style is much appreciated.
integration measure-theory proof-verification lebesgue-integral
$endgroup$
add a comment |
$begingroup$
Suppose $fgeq 0$, and $f$ is lebesgue integrable. If $alpha>0$ and $E_alpha={x:f(x)>alpha}$, prove that
$$ m(E_alpha)leq 1/alpha int f $$
My proof attempt
Proof. Let the assumptions be as above. Then
$$ alpha 1_{E_alpha}<f(x)1_{E_alpha} $$
Then by monotonicity of the integral
$$ alphaint 1_{E_alpha}<int f(x)1_{E_alpha}leq int f(x) $$
$implies m(E_alpha)<1/alphaint f$.
My main concern is that I end up with $<$ instead of $leq.$ Any feedback on the proof or style is much appreciated.
integration measure-theory proof-verification lebesgue-integral
$endgroup$
add a comment |
$begingroup$
Suppose $fgeq 0$, and $f$ is lebesgue integrable. If $alpha>0$ and $E_alpha={x:f(x)>alpha}$, prove that
$$ m(E_alpha)leq 1/alpha int f $$
My proof attempt
Proof. Let the assumptions be as above. Then
$$ alpha 1_{E_alpha}<f(x)1_{E_alpha} $$
Then by monotonicity of the integral
$$ alphaint 1_{E_alpha}<int f(x)1_{E_alpha}leq int f(x) $$
$implies m(E_alpha)<1/alphaint f$.
My main concern is that I end up with $<$ instead of $leq.$ Any feedback on the proof or style is much appreciated.
integration measure-theory proof-verification lebesgue-integral
$endgroup$
Suppose $fgeq 0$, and $f$ is lebesgue integrable. If $alpha>0$ and $E_alpha={x:f(x)>alpha}$, prove that
$$ m(E_alpha)leq 1/alpha int f $$
My proof attempt
Proof. Let the assumptions be as above. Then
$$ alpha 1_{E_alpha}<f(x)1_{E_alpha} $$
Then by monotonicity of the integral
$$ alphaint 1_{E_alpha}<int f(x)1_{E_alpha}leq int f(x) $$
$implies m(E_alpha)<1/alphaint f$.
My main concern is that I end up with $<$ instead of $leq.$ Any feedback on the proof or style is much appreciated.
integration measure-theory proof-verification lebesgue-integral
integration measure-theory proof-verification lebesgue-integral
asked Mar 12 at 14:57
Joe Man AnalysisJoe Man Analysis
56419
56419
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Firstly you have not specified what $x$ is, and note that $alpha mathbf1_{E_alpha}<f(x)mathbf1_{E_alpha}$ is not true for all $x$. What we have is that $alphamathbf1_{E_alpha}(x)<f(x)mathbf1_{E_alpha}(x)$ for all $xin E_alpha$. For all $xnotin E_alpha$ we have $alphamathbf1_{E_alpha}(x)=0=f(x)mathbf1_{E_alpha}(x)$. Thus what we have in general is that $amathbf1_{E_alpha}leq fmathbf1_{E_alpha}$. From this point on your proof seems fine.
$endgroup$
$begingroup$
Ah, thank you! That makes a lot of sense
$endgroup$
– Joe Man Analysis
Mar 12 at 17:31
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%2f3145181%2fproving-tchebychevs-inequality%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$
Firstly you have not specified what $x$ is, and note that $alpha mathbf1_{E_alpha}<f(x)mathbf1_{E_alpha}$ is not true for all $x$. What we have is that $alphamathbf1_{E_alpha}(x)<f(x)mathbf1_{E_alpha}(x)$ for all $xin E_alpha$. For all $xnotin E_alpha$ we have $alphamathbf1_{E_alpha}(x)=0=f(x)mathbf1_{E_alpha}(x)$. Thus what we have in general is that $amathbf1_{E_alpha}leq fmathbf1_{E_alpha}$. From this point on your proof seems fine.
$endgroup$
$begingroup$
Ah, thank you! That makes a lot of sense
$endgroup$
– Joe Man Analysis
Mar 12 at 17:31
add a comment |
$begingroup$
Firstly you have not specified what $x$ is, and note that $alpha mathbf1_{E_alpha}<f(x)mathbf1_{E_alpha}$ is not true for all $x$. What we have is that $alphamathbf1_{E_alpha}(x)<f(x)mathbf1_{E_alpha}(x)$ for all $xin E_alpha$. For all $xnotin E_alpha$ we have $alphamathbf1_{E_alpha}(x)=0=f(x)mathbf1_{E_alpha}(x)$. Thus what we have in general is that $amathbf1_{E_alpha}leq fmathbf1_{E_alpha}$. From this point on your proof seems fine.
$endgroup$
$begingroup$
Ah, thank you! That makes a lot of sense
$endgroup$
– Joe Man Analysis
Mar 12 at 17:31
add a comment |
$begingroup$
Firstly you have not specified what $x$ is, and note that $alpha mathbf1_{E_alpha}<f(x)mathbf1_{E_alpha}$ is not true for all $x$. What we have is that $alphamathbf1_{E_alpha}(x)<f(x)mathbf1_{E_alpha}(x)$ for all $xin E_alpha$. For all $xnotin E_alpha$ we have $alphamathbf1_{E_alpha}(x)=0=f(x)mathbf1_{E_alpha}(x)$. Thus what we have in general is that $amathbf1_{E_alpha}leq fmathbf1_{E_alpha}$. From this point on your proof seems fine.
$endgroup$
Firstly you have not specified what $x$ is, and note that $alpha mathbf1_{E_alpha}<f(x)mathbf1_{E_alpha}$ is not true for all $x$. What we have is that $alphamathbf1_{E_alpha}(x)<f(x)mathbf1_{E_alpha}(x)$ for all $xin E_alpha$. For all $xnotin E_alpha$ we have $alphamathbf1_{E_alpha}(x)=0=f(x)mathbf1_{E_alpha}(x)$. Thus what we have in general is that $amathbf1_{E_alpha}leq fmathbf1_{E_alpha}$. From this point on your proof seems fine.
answered Mar 12 at 17:26
K.PowerK.Power
3,490926
3,490926
$begingroup$
Ah, thank you! That makes a lot of sense
$endgroup$
– Joe Man Analysis
Mar 12 at 17:31
add a comment |
$begingroup$
Ah, thank you! That makes a lot of sense
$endgroup$
– Joe Man Analysis
Mar 12 at 17:31
$begingroup$
Ah, thank you! That makes a lot of sense
$endgroup$
– Joe Man Analysis
Mar 12 at 17:31
$begingroup$
Ah, thank you! That makes a lot of sense
$endgroup$
– Joe Man Analysis
Mar 12 at 17:31
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%2f3145181%2fproving-tchebychevs-inequality%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