composition of bounded uniformly convergence sequences
I'm hoping to make a generalization of the answer to this question.
Let's say that instead that we're composing two uniformly continuous function sequences, does this composition converge uniformly to $f circ g$.
Here's why I think it does.
Consider $left( f _ { k } right) _ { k = 1 } ^ { infty }$ and $( g_k ) stackrel { infty } { k } = 1$ to be sequences of continuous functions $[ 0,1 ] rightarrow [ 0,1 ]$ converging uniformly to $f$ and $g : [ 0,1 ] rightarrow mathbb { R }$ respectively.
By applying the Weierstrass M-Test, $ exists quad M > 0$ so that $|f_k(x)| leq M quad forall x in [0,1]$ and $k in mathbb{N}$
Now restrict the domain of $(g_k)$ to $[ - M , M ]$. Since the codomain of $(f_k)$ is $[0,1]$, this $[ - M , M ]$ will be within that domain. Therefore, there exists $N in mathbb{N}$ such that $(g_k)$ converges uniformly within this restricted domain.
Therefore
begin{equation}
left| g _ { k } ( f_k(x )) - g(f ( x )) right| < varepsilon text { for all } x in S text { and } k geq N
end{equation}
so $f _ { k } circ g _ { k }$ converge uniformly to $f circ g$.
Is it that simple, or am I missing something?
real-analysis uniform-convergence sequence-of-function
add a comment |
I'm hoping to make a generalization of the answer to this question.
Let's say that instead that we're composing two uniformly continuous function sequences, does this composition converge uniformly to $f circ g$.
Here's why I think it does.
Consider $left( f _ { k } right) _ { k = 1 } ^ { infty }$ and $( g_k ) stackrel { infty } { k } = 1$ to be sequences of continuous functions $[ 0,1 ] rightarrow [ 0,1 ]$ converging uniformly to $f$ and $g : [ 0,1 ] rightarrow mathbb { R }$ respectively.
By applying the Weierstrass M-Test, $ exists quad M > 0$ so that $|f_k(x)| leq M quad forall x in [0,1]$ and $k in mathbb{N}$
Now restrict the domain of $(g_k)$ to $[ - M , M ]$. Since the codomain of $(f_k)$ is $[0,1]$, this $[ - M , M ]$ will be within that domain. Therefore, there exists $N in mathbb{N}$ such that $(g_k)$ converges uniformly within this restricted domain.
Therefore
begin{equation}
left| g _ { k } ( f_k(x )) - g(f ( x )) right| < varepsilon text { for all } x in S text { and } k geq N
end{equation}
so $f _ { k } circ g _ { k }$ converge uniformly to $f circ g$.
Is it that simple, or am I missing something?
real-analysis uniform-convergence sequence-of-function
It is not that simple: math.stackexchange.com/questions/1680370/…
– Matt A Pelto
Dec 4 '18 at 0:35
How do I show Lipshitz then? Your link doesn't make sense...
– Andrew Hardy
Dec 4 '18 at 0:40
See zhw.'s response, since $f$ is continuous it is uniformly continuous on a compact subset. There are some errors in your post that make it confusing to read.
– Matt A Pelto
Dec 4 '18 at 0:51
add a comment |
I'm hoping to make a generalization of the answer to this question.
Let's say that instead that we're composing two uniformly continuous function sequences, does this composition converge uniformly to $f circ g$.
Here's why I think it does.
Consider $left( f _ { k } right) _ { k = 1 } ^ { infty }$ and $( g_k ) stackrel { infty } { k } = 1$ to be sequences of continuous functions $[ 0,1 ] rightarrow [ 0,1 ]$ converging uniformly to $f$ and $g : [ 0,1 ] rightarrow mathbb { R }$ respectively.
By applying the Weierstrass M-Test, $ exists quad M > 0$ so that $|f_k(x)| leq M quad forall x in [0,1]$ and $k in mathbb{N}$
Now restrict the domain of $(g_k)$ to $[ - M , M ]$. Since the codomain of $(f_k)$ is $[0,1]$, this $[ - M , M ]$ will be within that domain. Therefore, there exists $N in mathbb{N}$ such that $(g_k)$ converges uniformly within this restricted domain.
Therefore
begin{equation}
left| g _ { k } ( f_k(x )) - g(f ( x )) right| < varepsilon text { for all } x in S text { and } k geq N
end{equation}
so $f _ { k } circ g _ { k }$ converge uniformly to $f circ g$.
Is it that simple, or am I missing something?
real-analysis uniform-convergence sequence-of-function
I'm hoping to make a generalization of the answer to this question.
Let's say that instead that we're composing two uniformly continuous function sequences, does this composition converge uniformly to $f circ g$.
Here's why I think it does.
Consider $left( f _ { k } right) _ { k = 1 } ^ { infty }$ and $( g_k ) stackrel { infty } { k } = 1$ to be sequences of continuous functions $[ 0,1 ] rightarrow [ 0,1 ]$ converging uniformly to $f$ and $g : [ 0,1 ] rightarrow mathbb { R }$ respectively.
By applying the Weierstrass M-Test, $ exists quad M > 0$ so that $|f_k(x)| leq M quad forall x in [0,1]$ and $k in mathbb{N}$
Now restrict the domain of $(g_k)$ to $[ - M , M ]$. Since the codomain of $(f_k)$ is $[0,1]$, this $[ - M , M ]$ will be within that domain. Therefore, there exists $N in mathbb{N}$ such that $(g_k)$ converges uniformly within this restricted domain.
Therefore
begin{equation}
left| g _ { k } ( f_k(x )) - g(f ( x )) right| < varepsilon text { for all } x in S text { and } k geq N
end{equation}
so $f _ { k } circ g _ { k }$ converge uniformly to $f circ g$.
Is it that simple, or am I missing something?
real-analysis uniform-convergence sequence-of-function
real-analysis uniform-convergence sequence-of-function
asked Dec 4 '18 at 0:15
Andrew HardyAndrew Hardy
125
125
It is not that simple: math.stackexchange.com/questions/1680370/…
– Matt A Pelto
Dec 4 '18 at 0:35
How do I show Lipshitz then? Your link doesn't make sense...
– Andrew Hardy
Dec 4 '18 at 0:40
See zhw.'s response, since $f$ is continuous it is uniformly continuous on a compact subset. There are some errors in your post that make it confusing to read.
– Matt A Pelto
Dec 4 '18 at 0:51
add a comment |
It is not that simple: math.stackexchange.com/questions/1680370/…
– Matt A Pelto
Dec 4 '18 at 0:35
How do I show Lipshitz then? Your link doesn't make sense...
– Andrew Hardy
Dec 4 '18 at 0:40
See zhw.'s response, since $f$ is continuous it is uniformly continuous on a compact subset. There are some errors in your post that make it confusing to read.
– Matt A Pelto
Dec 4 '18 at 0:51
It is not that simple: math.stackexchange.com/questions/1680370/…
– Matt A Pelto
Dec 4 '18 at 0:35
It is not that simple: math.stackexchange.com/questions/1680370/…
– Matt A Pelto
Dec 4 '18 at 0:35
How do I show Lipshitz then? Your link doesn't make sense...
– Andrew Hardy
Dec 4 '18 at 0:40
How do I show Lipshitz then? Your link doesn't make sense...
– Andrew Hardy
Dec 4 '18 at 0:40
See zhw.'s response, since $f$ is continuous it is uniformly continuous on a compact subset. There are some errors in your post that make it confusing to read.
– Matt A Pelto
Dec 4 '18 at 0:51
See zhw.'s response, since $f$ is continuous it is uniformly continuous on a compact subset. There are some errors in your post that make it confusing to read.
– Matt A Pelto
Dec 4 '18 at 0:51
add a comment |
1 Answer
1
active
oldest
votes
Suppose $g_n: [0,1] longrightarrow [0,1]$, $,f_n:[0,1] longrightarrow mathbb R$ $(n=1,2,ldots)$ are two sequences of continuous functions that converge uniformly to $g$ and $f$, respectively.
Let $varepsilon>0$ be given.
By the uniform limit theorem and by the Heine-Cantor theorem, $f$ is uniformly continuous on $[0,1]$. Thus there is $delta>0$ so that $|,f(u)-f(v)|<frac12 varepsilon$ whenever $|u-v|<delta$ and $u,v in [0,1]$. Since $g_n to g$ uniformly, there is a positive integer $N_1$ so that for all $x in [0,1]$ we have
$$|g_n(x)-g(x)|<delta text{ whenever } n geq N_1.$$
Since $f_n to f$ uniformly, there is a positive integer $N_2$ so that for all $x in [0,1]$ we have
$$|,f_n(x)-f(x)|<frac{varepsilon}{2} text{ whenever} n geq N_2.$$
Set $N=max{N_1,N_2}$. So if $n geq N$ and $x in [0,1]$, then we have
begin{equation} begin{split} | ,f_n(g_n(x)) - f(g(x))| &= |,f_n(g_n(x)) - f(g_n(x))+f(g_n(x)) - f(g(x)) |\
& leq |,f_n(g_n(x)) - f(g_n(x))|+|,f(g_n(x)) - f(g(x))| \
& <frac{varepsilon}{2} +frac{varepsilon}{2}\
& = varepsilon.
end{split}end{equation}
Therefore, $f_n circ g_n to f circ g$ uniformly on $[0,1]$ (definition of uniform convergence).
1
OK let me paraphrase to see if I follow every step. Boundedness of the domain gives us uniform continuity of f, Then we use uniform converge to restrict g small enough so that it fits into the epsilon requirement of f. Then using an e/2 argument & triangle inequality, you show the condition for uniform converge?
– Andrew Hardy
Dec 4 '18 at 1:57
Precisely, the only thing I would correct from your comment is that we need the domain of $f$ to be closed and bounded. Here is a proof of the proposition that I referred to as the Heine-Cantor theorem: math.stackexchange.com/questions/2757071/…
– Matt A Pelto
Dec 4 '18 at 2:06
For the record, having every function in the sequence of functions ${g_n}_{n=1}^infty$ map into the same codomain $[0,1]$ is an important assumption unless we want to just initially assume that $f$ is uniformly continuous.
– Matt A Pelto
Dec 4 '18 at 3:06
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%2f3024919%2fcomposition-of-bounded-uniformly-convergence-sequences%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
Suppose $g_n: [0,1] longrightarrow [0,1]$, $,f_n:[0,1] longrightarrow mathbb R$ $(n=1,2,ldots)$ are two sequences of continuous functions that converge uniformly to $g$ and $f$, respectively.
Let $varepsilon>0$ be given.
By the uniform limit theorem and by the Heine-Cantor theorem, $f$ is uniformly continuous on $[0,1]$. Thus there is $delta>0$ so that $|,f(u)-f(v)|<frac12 varepsilon$ whenever $|u-v|<delta$ and $u,v in [0,1]$. Since $g_n to g$ uniformly, there is a positive integer $N_1$ so that for all $x in [0,1]$ we have
$$|g_n(x)-g(x)|<delta text{ whenever } n geq N_1.$$
Since $f_n to f$ uniformly, there is a positive integer $N_2$ so that for all $x in [0,1]$ we have
$$|,f_n(x)-f(x)|<frac{varepsilon}{2} text{ whenever} n geq N_2.$$
Set $N=max{N_1,N_2}$. So if $n geq N$ and $x in [0,1]$, then we have
begin{equation} begin{split} | ,f_n(g_n(x)) - f(g(x))| &= |,f_n(g_n(x)) - f(g_n(x))+f(g_n(x)) - f(g(x)) |\
& leq |,f_n(g_n(x)) - f(g_n(x))|+|,f(g_n(x)) - f(g(x))| \
& <frac{varepsilon}{2} +frac{varepsilon}{2}\
& = varepsilon.
end{split}end{equation}
Therefore, $f_n circ g_n to f circ g$ uniformly on $[0,1]$ (definition of uniform convergence).
1
OK let me paraphrase to see if I follow every step. Boundedness of the domain gives us uniform continuity of f, Then we use uniform converge to restrict g small enough so that it fits into the epsilon requirement of f. Then using an e/2 argument & triangle inequality, you show the condition for uniform converge?
– Andrew Hardy
Dec 4 '18 at 1:57
Precisely, the only thing I would correct from your comment is that we need the domain of $f$ to be closed and bounded. Here is a proof of the proposition that I referred to as the Heine-Cantor theorem: math.stackexchange.com/questions/2757071/…
– Matt A Pelto
Dec 4 '18 at 2:06
For the record, having every function in the sequence of functions ${g_n}_{n=1}^infty$ map into the same codomain $[0,1]$ is an important assumption unless we want to just initially assume that $f$ is uniformly continuous.
– Matt A Pelto
Dec 4 '18 at 3:06
add a comment |
Suppose $g_n: [0,1] longrightarrow [0,1]$, $,f_n:[0,1] longrightarrow mathbb R$ $(n=1,2,ldots)$ are two sequences of continuous functions that converge uniformly to $g$ and $f$, respectively.
Let $varepsilon>0$ be given.
By the uniform limit theorem and by the Heine-Cantor theorem, $f$ is uniformly continuous on $[0,1]$. Thus there is $delta>0$ so that $|,f(u)-f(v)|<frac12 varepsilon$ whenever $|u-v|<delta$ and $u,v in [0,1]$. Since $g_n to g$ uniformly, there is a positive integer $N_1$ so that for all $x in [0,1]$ we have
$$|g_n(x)-g(x)|<delta text{ whenever } n geq N_1.$$
Since $f_n to f$ uniformly, there is a positive integer $N_2$ so that for all $x in [0,1]$ we have
$$|,f_n(x)-f(x)|<frac{varepsilon}{2} text{ whenever} n geq N_2.$$
Set $N=max{N_1,N_2}$. So if $n geq N$ and $x in [0,1]$, then we have
begin{equation} begin{split} | ,f_n(g_n(x)) - f(g(x))| &= |,f_n(g_n(x)) - f(g_n(x))+f(g_n(x)) - f(g(x)) |\
& leq |,f_n(g_n(x)) - f(g_n(x))|+|,f(g_n(x)) - f(g(x))| \
& <frac{varepsilon}{2} +frac{varepsilon}{2}\
& = varepsilon.
end{split}end{equation}
Therefore, $f_n circ g_n to f circ g$ uniformly on $[0,1]$ (definition of uniform convergence).
1
OK let me paraphrase to see if I follow every step. Boundedness of the domain gives us uniform continuity of f, Then we use uniform converge to restrict g small enough so that it fits into the epsilon requirement of f. Then using an e/2 argument & triangle inequality, you show the condition for uniform converge?
– Andrew Hardy
Dec 4 '18 at 1:57
Precisely, the only thing I would correct from your comment is that we need the domain of $f$ to be closed and bounded. Here is a proof of the proposition that I referred to as the Heine-Cantor theorem: math.stackexchange.com/questions/2757071/…
– Matt A Pelto
Dec 4 '18 at 2:06
For the record, having every function in the sequence of functions ${g_n}_{n=1}^infty$ map into the same codomain $[0,1]$ is an important assumption unless we want to just initially assume that $f$ is uniformly continuous.
– Matt A Pelto
Dec 4 '18 at 3:06
add a comment |
Suppose $g_n: [0,1] longrightarrow [0,1]$, $,f_n:[0,1] longrightarrow mathbb R$ $(n=1,2,ldots)$ are two sequences of continuous functions that converge uniformly to $g$ and $f$, respectively.
Let $varepsilon>0$ be given.
By the uniform limit theorem and by the Heine-Cantor theorem, $f$ is uniformly continuous on $[0,1]$. Thus there is $delta>0$ so that $|,f(u)-f(v)|<frac12 varepsilon$ whenever $|u-v|<delta$ and $u,v in [0,1]$. Since $g_n to g$ uniformly, there is a positive integer $N_1$ so that for all $x in [0,1]$ we have
$$|g_n(x)-g(x)|<delta text{ whenever } n geq N_1.$$
Since $f_n to f$ uniformly, there is a positive integer $N_2$ so that for all $x in [0,1]$ we have
$$|,f_n(x)-f(x)|<frac{varepsilon}{2} text{ whenever} n geq N_2.$$
Set $N=max{N_1,N_2}$. So if $n geq N$ and $x in [0,1]$, then we have
begin{equation} begin{split} | ,f_n(g_n(x)) - f(g(x))| &= |,f_n(g_n(x)) - f(g_n(x))+f(g_n(x)) - f(g(x)) |\
& leq |,f_n(g_n(x)) - f(g_n(x))|+|,f(g_n(x)) - f(g(x))| \
& <frac{varepsilon}{2} +frac{varepsilon}{2}\
& = varepsilon.
end{split}end{equation}
Therefore, $f_n circ g_n to f circ g$ uniformly on $[0,1]$ (definition of uniform convergence).
Suppose $g_n: [0,1] longrightarrow [0,1]$, $,f_n:[0,1] longrightarrow mathbb R$ $(n=1,2,ldots)$ are two sequences of continuous functions that converge uniformly to $g$ and $f$, respectively.
Let $varepsilon>0$ be given.
By the uniform limit theorem and by the Heine-Cantor theorem, $f$ is uniformly continuous on $[0,1]$. Thus there is $delta>0$ so that $|,f(u)-f(v)|<frac12 varepsilon$ whenever $|u-v|<delta$ and $u,v in [0,1]$. Since $g_n to g$ uniformly, there is a positive integer $N_1$ so that for all $x in [0,1]$ we have
$$|g_n(x)-g(x)|<delta text{ whenever } n geq N_1.$$
Since $f_n to f$ uniformly, there is a positive integer $N_2$ so that for all $x in [0,1]$ we have
$$|,f_n(x)-f(x)|<frac{varepsilon}{2} text{ whenever} n geq N_2.$$
Set $N=max{N_1,N_2}$. So if $n geq N$ and $x in [0,1]$, then we have
begin{equation} begin{split} | ,f_n(g_n(x)) - f(g(x))| &= |,f_n(g_n(x)) - f(g_n(x))+f(g_n(x)) - f(g(x)) |\
& leq |,f_n(g_n(x)) - f(g_n(x))|+|,f(g_n(x)) - f(g(x))| \
& <frac{varepsilon}{2} +frac{varepsilon}{2}\
& = varepsilon.
end{split}end{equation}
Therefore, $f_n circ g_n to f circ g$ uniformly on $[0,1]$ (definition of uniform convergence).
edited Dec 4 '18 at 2:19
answered Dec 4 '18 at 1:19
Matt A PeltoMatt A Pelto
2,397620
2,397620
1
OK let me paraphrase to see if I follow every step. Boundedness of the domain gives us uniform continuity of f, Then we use uniform converge to restrict g small enough so that it fits into the epsilon requirement of f. Then using an e/2 argument & triangle inequality, you show the condition for uniform converge?
– Andrew Hardy
Dec 4 '18 at 1:57
Precisely, the only thing I would correct from your comment is that we need the domain of $f$ to be closed and bounded. Here is a proof of the proposition that I referred to as the Heine-Cantor theorem: math.stackexchange.com/questions/2757071/…
– Matt A Pelto
Dec 4 '18 at 2:06
For the record, having every function in the sequence of functions ${g_n}_{n=1}^infty$ map into the same codomain $[0,1]$ is an important assumption unless we want to just initially assume that $f$ is uniformly continuous.
– Matt A Pelto
Dec 4 '18 at 3:06
add a comment |
1
OK let me paraphrase to see if I follow every step. Boundedness of the domain gives us uniform continuity of f, Then we use uniform converge to restrict g small enough so that it fits into the epsilon requirement of f. Then using an e/2 argument & triangle inequality, you show the condition for uniform converge?
– Andrew Hardy
Dec 4 '18 at 1:57
Precisely, the only thing I would correct from your comment is that we need the domain of $f$ to be closed and bounded. Here is a proof of the proposition that I referred to as the Heine-Cantor theorem: math.stackexchange.com/questions/2757071/…
– Matt A Pelto
Dec 4 '18 at 2:06
For the record, having every function in the sequence of functions ${g_n}_{n=1}^infty$ map into the same codomain $[0,1]$ is an important assumption unless we want to just initially assume that $f$ is uniformly continuous.
– Matt A Pelto
Dec 4 '18 at 3:06
1
1
OK let me paraphrase to see if I follow every step. Boundedness of the domain gives us uniform continuity of f, Then we use uniform converge to restrict g small enough so that it fits into the epsilon requirement of f. Then using an e/2 argument & triangle inequality, you show the condition for uniform converge?
– Andrew Hardy
Dec 4 '18 at 1:57
OK let me paraphrase to see if I follow every step. Boundedness of the domain gives us uniform continuity of f, Then we use uniform converge to restrict g small enough so that it fits into the epsilon requirement of f. Then using an e/2 argument & triangle inequality, you show the condition for uniform converge?
– Andrew Hardy
Dec 4 '18 at 1:57
Precisely, the only thing I would correct from your comment is that we need the domain of $f$ to be closed and bounded. Here is a proof of the proposition that I referred to as the Heine-Cantor theorem: math.stackexchange.com/questions/2757071/…
– Matt A Pelto
Dec 4 '18 at 2:06
Precisely, the only thing I would correct from your comment is that we need the domain of $f$ to be closed and bounded. Here is a proof of the proposition that I referred to as the Heine-Cantor theorem: math.stackexchange.com/questions/2757071/…
– Matt A Pelto
Dec 4 '18 at 2:06
For the record, having every function in the sequence of functions ${g_n}_{n=1}^infty$ map into the same codomain $[0,1]$ is an important assumption unless we want to just initially assume that $f$ is uniformly continuous.
– Matt A Pelto
Dec 4 '18 at 3:06
For the record, having every function in the sequence of functions ${g_n}_{n=1}^infty$ map into the same codomain $[0,1]$ is an important assumption unless we want to just initially assume that $f$ is uniformly continuous.
– Matt A Pelto
Dec 4 '18 at 3:06
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.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- 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.
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%2f3024919%2fcomposition-of-bounded-uniformly-convergence-sequences%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
It is not that simple: math.stackexchange.com/questions/1680370/…
– Matt A Pelto
Dec 4 '18 at 0:35
How do I show Lipshitz then? Your link doesn't make sense...
– Andrew Hardy
Dec 4 '18 at 0:40
See zhw.'s response, since $f$ is continuous it is uniformly continuous on a compact subset. There are some errors in your post that make it confusing to read.
– Matt A Pelto
Dec 4 '18 at 0:51