Convergence and Measure
$begingroup$
Prove that if $(f_n)$ is a sequence of nonnegative, measurable functions on $[a,b]$ such that $lim_{ntoinfty}int_a^b f_n(x)dx=0$, then $(f_n)$ converges to $0$ in measure. Show by example that we cannot replace the conclusion with the assertion that $(f_n)$ converges to $0$ almost everywhere.
I don't really know how to go about proving this. I know that convergence almost everywhere implies convergence in measure and that if a sequence converges in measure then there exists a subsequence that converges almost everywhere but I haven't done a lot with convergence in measure.
real-analysis measure-theory convergence lebesgue-measure
$endgroup$
add a comment |
$begingroup$
Prove that if $(f_n)$ is a sequence of nonnegative, measurable functions on $[a,b]$ such that $lim_{ntoinfty}int_a^b f_n(x)dx=0$, then $(f_n)$ converges to $0$ in measure. Show by example that we cannot replace the conclusion with the assertion that $(f_n)$ converges to $0$ almost everywhere.
I don't really know how to go about proving this. I know that convergence almost everywhere implies convergence in measure and that if a sequence converges in measure then there exists a subsequence that converges almost everywhere but I haven't done a lot with convergence in measure.
real-analysis measure-theory convergence lebesgue-measure
$endgroup$
$begingroup$
For an counterexample take an example with a 'running maximum', that is $f_{n,k}(x) = 1_{[k/,(k+1)/n]}(x)$.
$endgroup$
– p4sch
Dec 4 '18 at 22:03
$begingroup$
So I understand the example that shows this but without using Markovs inequality where should I start in proving the theorem?
$endgroup$
– ICanMakeYouHateME
Dec 5 '18 at 3:28
add a comment |
$begingroup$
Prove that if $(f_n)$ is a sequence of nonnegative, measurable functions on $[a,b]$ such that $lim_{ntoinfty}int_a^b f_n(x)dx=0$, then $(f_n)$ converges to $0$ in measure. Show by example that we cannot replace the conclusion with the assertion that $(f_n)$ converges to $0$ almost everywhere.
I don't really know how to go about proving this. I know that convergence almost everywhere implies convergence in measure and that if a sequence converges in measure then there exists a subsequence that converges almost everywhere but I haven't done a lot with convergence in measure.
real-analysis measure-theory convergence lebesgue-measure
$endgroup$
Prove that if $(f_n)$ is a sequence of nonnegative, measurable functions on $[a,b]$ such that $lim_{ntoinfty}int_a^b f_n(x)dx=0$, then $(f_n)$ converges to $0$ in measure. Show by example that we cannot replace the conclusion with the assertion that $(f_n)$ converges to $0$ almost everywhere.
I don't really know how to go about proving this. I know that convergence almost everywhere implies convergence in measure and that if a sequence converges in measure then there exists a subsequence that converges almost everywhere but I haven't done a lot with convergence in measure.
real-analysis measure-theory convergence lebesgue-measure
real-analysis measure-theory convergence lebesgue-measure
edited Dec 4 '18 at 22:01
Foobaz John
21.6k41351
21.6k41351
asked Dec 4 '18 at 21:56
ICanMakeYouHateMEICanMakeYouHateME
154
154
$begingroup$
For an counterexample take an example with a 'running maximum', that is $f_{n,k}(x) = 1_{[k/,(k+1)/n]}(x)$.
$endgroup$
– p4sch
Dec 4 '18 at 22:03
$begingroup$
So I understand the example that shows this but without using Markovs inequality where should I start in proving the theorem?
$endgroup$
– ICanMakeYouHateME
Dec 5 '18 at 3:28
add a comment |
$begingroup$
For an counterexample take an example with a 'running maximum', that is $f_{n,k}(x) = 1_{[k/,(k+1)/n]}(x)$.
$endgroup$
– p4sch
Dec 4 '18 at 22:03
$begingroup$
So I understand the example that shows this but without using Markovs inequality where should I start in proving the theorem?
$endgroup$
– ICanMakeYouHateME
Dec 5 '18 at 3:28
$begingroup$
For an counterexample take an example with a 'running maximum', that is $f_{n,k}(x) = 1_{[k/,(k+1)/n]}(x)$.
$endgroup$
– p4sch
Dec 4 '18 at 22:03
$begingroup$
For an counterexample take an example with a 'running maximum', that is $f_{n,k}(x) = 1_{[k/,(k+1)/n]}(x)$.
$endgroup$
– p4sch
Dec 4 '18 at 22:03
$begingroup$
So I understand the example that shows this but without using Markovs inequality where should I start in proving the theorem?
$endgroup$
– ICanMakeYouHateME
Dec 5 '18 at 3:28
$begingroup$
So I understand the example that shows this but without using Markovs inequality where should I start in proving the theorem?
$endgroup$
– ICanMakeYouHateME
Dec 5 '18 at 3:28
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Use Markov's inequality namely,
$$
mu(|f_n|>varepsilon)leq frac{1}{varepsilon}int_a^b f_n(x), dx.
$$
$endgroup$
$begingroup$
So I don't have Markov's inequality at my disposal. Some theorems I have are The Dominated Convergence Theorem, Egorov's Theorem, Almost everywhere implies in measure, and Riesz's theorem which I stated above.
$endgroup$
– ICanMakeYouHateME
Dec 4 '18 at 22:04
$begingroup$
And you have outed yourself as a statistician :). +1
$endgroup$
– qbert
Dec 4 '18 at 22:04
$begingroup$
@ICanMakeYouHateME It is not too hard to prove the inequality from scratch in your particular case.
$endgroup$
– Foobaz John
Dec 4 '18 at 22:13
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%2f3026237%2fconvergence-and-measure%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$
Use Markov's inequality namely,
$$
mu(|f_n|>varepsilon)leq frac{1}{varepsilon}int_a^b f_n(x), dx.
$$
$endgroup$
$begingroup$
So I don't have Markov's inequality at my disposal. Some theorems I have are The Dominated Convergence Theorem, Egorov's Theorem, Almost everywhere implies in measure, and Riesz's theorem which I stated above.
$endgroup$
– ICanMakeYouHateME
Dec 4 '18 at 22:04
$begingroup$
And you have outed yourself as a statistician :). +1
$endgroup$
– qbert
Dec 4 '18 at 22:04
$begingroup$
@ICanMakeYouHateME It is not too hard to prove the inequality from scratch in your particular case.
$endgroup$
– Foobaz John
Dec 4 '18 at 22:13
add a comment |
$begingroup$
Use Markov's inequality namely,
$$
mu(|f_n|>varepsilon)leq frac{1}{varepsilon}int_a^b f_n(x), dx.
$$
$endgroup$
$begingroup$
So I don't have Markov's inequality at my disposal. Some theorems I have are The Dominated Convergence Theorem, Egorov's Theorem, Almost everywhere implies in measure, and Riesz's theorem which I stated above.
$endgroup$
– ICanMakeYouHateME
Dec 4 '18 at 22:04
$begingroup$
And you have outed yourself as a statistician :). +1
$endgroup$
– qbert
Dec 4 '18 at 22:04
$begingroup$
@ICanMakeYouHateME It is not too hard to prove the inequality from scratch in your particular case.
$endgroup$
– Foobaz John
Dec 4 '18 at 22:13
add a comment |
$begingroup$
Use Markov's inequality namely,
$$
mu(|f_n|>varepsilon)leq frac{1}{varepsilon}int_a^b f_n(x), dx.
$$
$endgroup$
Use Markov's inequality namely,
$$
mu(|f_n|>varepsilon)leq frac{1}{varepsilon}int_a^b f_n(x), dx.
$$
answered Dec 4 '18 at 22:01
Foobaz JohnFoobaz John
21.6k41351
21.6k41351
$begingroup$
So I don't have Markov's inequality at my disposal. Some theorems I have are The Dominated Convergence Theorem, Egorov's Theorem, Almost everywhere implies in measure, and Riesz's theorem which I stated above.
$endgroup$
– ICanMakeYouHateME
Dec 4 '18 at 22:04
$begingroup$
And you have outed yourself as a statistician :). +1
$endgroup$
– qbert
Dec 4 '18 at 22:04
$begingroup$
@ICanMakeYouHateME It is not too hard to prove the inequality from scratch in your particular case.
$endgroup$
– Foobaz John
Dec 4 '18 at 22:13
add a comment |
$begingroup$
So I don't have Markov's inequality at my disposal. Some theorems I have are The Dominated Convergence Theorem, Egorov's Theorem, Almost everywhere implies in measure, and Riesz's theorem which I stated above.
$endgroup$
– ICanMakeYouHateME
Dec 4 '18 at 22:04
$begingroup$
And you have outed yourself as a statistician :). +1
$endgroup$
– qbert
Dec 4 '18 at 22:04
$begingroup$
@ICanMakeYouHateME It is not too hard to prove the inequality from scratch in your particular case.
$endgroup$
– Foobaz John
Dec 4 '18 at 22:13
$begingroup$
So I don't have Markov's inequality at my disposal. Some theorems I have are The Dominated Convergence Theorem, Egorov's Theorem, Almost everywhere implies in measure, and Riesz's theorem which I stated above.
$endgroup$
– ICanMakeYouHateME
Dec 4 '18 at 22:04
$begingroup$
So I don't have Markov's inequality at my disposal. Some theorems I have are The Dominated Convergence Theorem, Egorov's Theorem, Almost everywhere implies in measure, and Riesz's theorem which I stated above.
$endgroup$
– ICanMakeYouHateME
Dec 4 '18 at 22:04
$begingroup$
And you have outed yourself as a statistician :). +1
$endgroup$
– qbert
Dec 4 '18 at 22:04
$begingroup$
And you have outed yourself as a statistician :). +1
$endgroup$
– qbert
Dec 4 '18 at 22:04
$begingroup$
@ICanMakeYouHateME It is not too hard to prove the inequality from scratch in your particular case.
$endgroup$
– Foobaz John
Dec 4 '18 at 22:13
$begingroup$
@ICanMakeYouHateME It is not too hard to prove the inequality from scratch in your particular case.
$endgroup$
– Foobaz John
Dec 4 '18 at 22:13
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%2f3026237%2fconvergence-and-measure%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$
For an counterexample take an example with a 'running maximum', that is $f_{n,k}(x) = 1_{[k/,(k+1)/n]}(x)$.
$endgroup$
– p4sch
Dec 4 '18 at 22:03
$begingroup$
So I understand the example that shows this but without using Markovs inequality where should I start in proving the theorem?
$endgroup$
– ICanMakeYouHateME
Dec 5 '18 at 3:28