Showing a sequence of functions $f_n$ does not converge uniformly to $f$ on an interval.
$begingroup$
Suppose for each $n in mathbb{N}$ we have a function $f_n:[0,1] to [0,1]$ by $f_n(x)=nx$ on the interval $x in [0,frac{1}{n}]$ and $1$ if $x in (frac{1}{n},1]$, and define $f=lim_{n to infty} f_n$.
I want to show that for any Lebesgue measurable $B subseteq [0,1]$ with Lebesgue measure $lambda(B)=0$ that the functions $f_n$ do not converge to $f$ uniformly on $[0,1] backslash B$.
Now clearly we have the the limit $f$ is equal to $0$ at $x=0$ and is equal to $1$ elsewhere, but I am struggling to figure out how to implement the fact that we remove the zero measure interval $B$.
Firstly my thought was to use the uniform convergence theorem, which would work with showing that the functions $f_n$ do not converge uniformly to $f$ as each of the functions $f_n$ is continuous we can use the uniform limit theorem to show that $f_n$ does not converge to $f$.
I am wondering whether there is a simple result that I am missing that ensures this transfers to the same sort of result when we take away a set of measure $0$, for example does continuity of each $f_n$ still hold in this case in which I can still apply the theorem?
Any insight would be much appreciated thanks :)
measure-theory lebesgue-measure
$endgroup$
add a comment |
$begingroup$
Suppose for each $n in mathbb{N}$ we have a function $f_n:[0,1] to [0,1]$ by $f_n(x)=nx$ on the interval $x in [0,frac{1}{n}]$ and $1$ if $x in (frac{1}{n},1]$, and define $f=lim_{n to infty} f_n$.
I want to show that for any Lebesgue measurable $B subseteq [0,1]$ with Lebesgue measure $lambda(B)=0$ that the functions $f_n$ do not converge to $f$ uniformly on $[0,1] backslash B$.
Now clearly we have the the limit $f$ is equal to $0$ at $x=0$ and is equal to $1$ elsewhere, but I am struggling to figure out how to implement the fact that we remove the zero measure interval $B$.
Firstly my thought was to use the uniform convergence theorem, which would work with showing that the functions $f_n$ do not converge uniformly to $f$ as each of the functions $f_n$ is continuous we can use the uniform limit theorem to show that $f_n$ does not converge to $f$.
I am wondering whether there is a simple result that I am missing that ensures this transfers to the same sort of result when we take away a set of measure $0$, for example does continuity of each $f_n$ still hold in this case in which I can still apply the theorem?
Any insight would be much appreciated thanks :)
measure-theory lebesgue-measure
$endgroup$
add a comment |
$begingroup$
Suppose for each $n in mathbb{N}$ we have a function $f_n:[0,1] to [0,1]$ by $f_n(x)=nx$ on the interval $x in [0,frac{1}{n}]$ and $1$ if $x in (frac{1}{n},1]$, and define $f=lim_{n to infty} f_n$.
I want to show that for any Lebesgue measurable $B subseteq [0,1]$ with Lebesgue measure $lambda(B)=0$ that the functions $f_n$ do not converge to $f$ uniformly on $[0,1] backslash B$.
Now clearly we have the the limit $f$ is equal to $0$ at $x=0$ and is equal to $1$ elsewhere, but I am struggling to figure out how to implement the fact that we remove the zero measure interval $B$.
Firstly my thought was to use the uniform convergence theorem, which would work with showing that the functions $f_n$ do not converge uniformly to $f$ as each of the functions $f_n$ is continuous we can use the uniform limit theorem to show that $f_n$ does not converge to $f$.
I am wondering whether there is a simple result that I am missing that ensures this transfers to the same sort of result when we take away a set of measure $0$, for example does continuity of each $f_n$ still hold in this case in which I can still apply the theorem?
Any insight would be much appreciated thanks :)
measure-theory lebesgue-measure
$endgroup$
Suppose for each $n in mathbb{N}$ we have a function $f_n:[0,1] to [0,1]$ by $f_n(x)=nx$ on the interval $x in [0,frac{1}{n}]$ and $1$ if $x in (frac{1}{n},1]$, and define $f=lim_{n to infty} f_n$.
I want to show that for any Lebesgue measurable $B subseteq [0,1]$ with Lebesgue measure $lambda(B)=0$ that the functions $f_n$ do not converge to $f$ uniformly on $[0,1] backslash B$.
Now clearly we have the the limit $f$ is equal to $0$ at $x=0$ and is equal to $1$ elsewhere, but I am struggling to figure out how to implement the fact that we remove the zero measure interval $B$.
Firstly my thought was to use the uniform convergence theorem, which would work with showing that the functions $f_n$ do not converge uniformly to $f$ as each of the functions $f_n$ is continuous we can use the uniform limit theorem to show that $f_n$ does not converge to $f$.
I am wondering whether there is a simple result that I am missing that ensures this transfers to the same sort of result when we take away a set of measure $0$, for example does continuity of each $f_n$ still hold in this case in which I can still apply the theorem?
Any insight would be much appreciated thanks :)
measure-theory lebesgue-measure
measure-theory lebesgue-measure
asked Dec 6 '18 at 0:21
MattMatt
16810
16810
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Take $B subset [0,1]$ of measure zero and set $l = inf (0,1]setminus B$. If it were $l > 0$, then $B$ would contain some neighbourhood of $0$ (maybe without $0$ itself) which contradicts that $|B| = 0$. Hence $l = 0$ and thus we have a sequence $x_n to 0$ contained in $(0,1] setminus B$. Without loss of generality we can assume that $0 < x_n leq frac{1}{2n}$. Thus, $f_n(x_n) leq frac{1}{2}$ and in particular,
$$
d_{[0,1] setminus B}(f,f_n) geq |f(x_n) - f_n(x_n)| = f(x_n) - f_n(x_n) geq f(x_n) - frac{1}{2} stackrel{(x_n neq 0)}{=} frac{1}{2}.
$$
Taking limits, we get that $lim_n d_{[0,1] setminus B}(f,f_n) geq frac{1}{2} > 0$ as desired.
Edit: note that we only used that $B$ can't contain a neighbourhood of zero, which is weaker than being of measure zero. Thus uniform convergence fails for a (in some sense) larger family of sets.
$endgroup$
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%2f3027865%2fshowing-a-sequence-of-functions-f-n-does-not-converge-uniformly-to-f-on-an-i%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$
Take $B subset [0,1]$ of measure zero and set $l = inf (0,1]setminus B$. If it were $l > 0$, then $B$ would contain some neighbourhood of $0$ (maybe without $0$ itself) which contradicts that $|B| = 0$. Hence $l = 0$ and thus we have a sequence $x_n to 0$ contained in $(0,1] setminus B$. Without loss of generality we can assume that $0 < x_n leq frac{1}{2n}$. Thus, $f_n(x_n) leq frac{1}{2}$ and in particular,
$$
d_{[0,1] setminus B}(f,f_n) geq |f(x_n) - f_n(x_n)| = f(x_n) - f_n(x_n) geq f(x_n) - frac{1}{2} stackrel{(x_n neq 0)}{=} frac{1}{2}.
$$
Taking limits, we get that $lim_n d_{[0,1] setminus B}(f,f_n) geq frac{1}{2} > 0$ as desired.
Edit: note that we only used that $B$ can't contain a neighbourhood of zero, which is weaker than being of measure zero. Thus uniform convergence fails for a (in some sense) larger family of sets.
$endgroup$
add a comment |
$begingroup$
Take $B subset [0,1]$ of measure zero and set $l = inf (0,1]setminus B$. If it were $l > 0$, then $B$ would contain some neighbourhood of $0$ (maybe without $0$ itself) which contradicts that $|B| = 0$. Hence $l = 0$ and thus we have a sequence $x_n to 0$ contained in $(0,1] setminus B$. Without loss of generality we can assume that $0 < x_n leq frac{1}{2n}$. Thus, $f_n(x_n) leq frac{1}{2}$ and in particular,
$$
d_{[0,1] setminus B}(f,f_n) geq |f(x_n) - f_n(x_n)| = f(x_n) - f_n(x_n) geq f(x_n) - frac{1}{2} stackrel{(x_n neq 0)}{=} frac{1}{2}.
$$
Taking limits, we get that $lim_n d_{[0,1] setminus B}(f,f_n) geq frac{1}{2} > 0$ as desired.
Edit: note that we only used that $B$ can't contain a neighbourhood of zero, which is weaker than being of measure zero. Thus uniform convergence fails for a (in some sense) larger family of sets.
$endgroup$
add a comment |
$begingroup$
Take $B subset [0,1]$ of measure zero and set $l = inf (0,1]setminus B$. If it were $l > 0$, then $B$ would contain some neighbourhood of $0$ (maybe without $0$ itself) which contradicts that $|B| = 0$. Hence $l = 0$ and thus we have a sequence $x_n to 0$ contained in $(0,1] setminus B$. Without loss of generality we can assume that $0 < x_n leq frac{1}{2n}$. Thus, $f_n(x_n) leq frac{1}{2}$ and in particular,
$$
d_{[0,1] setminus B}(f,f_n) geq |f(x_n) - f_n(x_n)| = f(x_n) - f_n(x_n) geq f(x_n) - frac{1}{2} stackrel{(x_n neq 0)}{=} frac{1}{2}.
$$
Taking limits, we get that $lim_n d_{[0,1] setminus B}(f,f_n) geq frac{1}{2} > 0$ as desired.
Edit: note that we only used that $B$ can't contain a neighbourhood of zero, which is weaker than being of measure zero. Thus uniform convergence fails for a (in some sense) larger family of sets.
$endgroup$
Take $B subset [0,1]$ of measure zero and set $l = inf (0,1]setminus B$. If it were $l > 0$, then $B$ would contain some neighbourhood of $0$ (maybe without $0$ itself) which contradicts that $|B| = 0$. Hence $l = 0$ and thus we have a sequence $x_n to 0$ contained in $(0,1] setminus B$. Without loss of generality we can assume that $0 < x_n leq frac{1}{2n}$. Thus, $f_n(x_n) leq frac{1}{2}$ and in particular,
$$
d_{[0,1] setminus B}(f,f_n) geq |f(x_n) - f_n(x_n)| = f(x_n) - f_n(x_n) geq f(x_n) - frac{1}{2} stackrel{(x_n neq 0)}{=} frac{1}{2}.
$$
Taking limits, we get that $lim_n d_{[0,1] setminus B}(f,f_n) geq frac{1}{2} > 0$ as desired.
Edit: note that we only used that $B$ can't contain a neighbourhood of zero, which is weaker than being of measure zero. Thus uniform convergence fails for a (in some sense) larger family of sets.
edited Dec 6 '18 at 1:03
answered Dec 6 '18 at 0:46
Guido A.Guido A.
7,2861730
7,2861730
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%2f3027865%2fshowing-a-sequence-of-functions-f-n-does-not-converge-uniformly-to-f-on-an-i%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