Prove that the sequence of functions $g_{n}in C[0,4]$












1












$begingroup$


I want to show that the function defined by $g_n:[0,4]to Bbb{R}$, defined bybegin{align} g_n(t)=begin{cases}0,& text{if};0leq tleq 2,\dfrac{n}{2}(t-2),& text{if};2leq tleq 2+frac{2}{n},\1 &text{if};2+frac{2}{n}leq tleq 4.end{cases} end{align}
is continuous and Cauchy.



MY TRIAL
The sequence of functions is clearly continuous by Pasting Lemma. Next, we show that the sequence of functions is Cauchy.



So, let $m,ninBbb{N},$ be given such that $mgeq n.$ Then,



$$|g_m(t)-g_n(t)|=|0-0|+left|dfrac{m}{2}(t-2)-dfrac{n}{2}(t-2)right|left|1-1right|=0<epsilon$$



I don't know if this is right. If not, kindly help please!






real-analysis functional-analysis analysis normed-spaces







share|cite|improve this question











$endgroup$












  • $begingroup$
    functions are continuous. sequences are Cauchy
    $endgroup$
    – mathworker21
    Dec 11 '18 at 20:59










  • $begingroup$
    to prove Cauchy, just calculate the max difference between $g_n$ and $g_m$. what exactly is your difficulty?
    $endgroup$
    – mathworker21
    Dec 11 '18 at 21:00










  • $begingroup$
    @mathworker21: Edited some things. Max difference?
    $endgroup$
    – Omojola Micheal
    Dec 11 '18 at 21:06










  • $begingroup$
    wait, you're saying $|g_m(t)-g_n(t)| = 0$ for each $t$?
    $endgroup$
    – mathworker21
    Dec 11 '18 at 21:08










  • $begingroup$
    by max difference, what I mean is $max_t |g_m(t)-g_n(t)|$. you want to show this is less than $epsilon$ for $m,n$ large enough
    $endgroup$
    – mathworker21
    Dec 11 '18 at 21:08
















1












$begingroup$


I want to show that the function defined by $g_n:[0,4]to Bbb{R}$, defined bybegin{align} g_n(t)=begin{cases}0,& text{if};0leq tleq 2,\dfrac{n}{2}(t-2),& text{if};2leq tleq 2+frac{2}{n},\1 &text{if};2+frac{2}{n}leq tleq 4.end{cases} end{align}
is continuous and Cauchy.



MY TRIAL
The sequence of functions is clearly continuous by Pasting Lemma. Next, we show that the sequence of functions is Cauchy.



So, let $m,ninBbb{N},$ be given such that $mgeq n.$ Then,



$$|g_m(t)-g_n(t)|=|0-0|+left|dfrac{m}{2}(t-2)-dfrac{n}{2}(t-2)right|left|1-1right|=0<epsilon$$



I don't know if this is right. If not, kindly help please!






real-analysis functional-analysis analysis normed-spaces







share|cite|improve this question











$endgroup$












  • $begingroup$
    functions are continuous. sequences are Cauchy
    $endgroup$
    – mathworker21
    Dec 11 '18 at 20:59










  • $begingroup$
    to prove Cauchy, just calculate the max difference between $g_n$ and $g_m$. what exactly is your difficulty?
    $endgroup$
    – mathworker21
    Dec 11 '18 at 21:00










  • $begingroup$
    @mathworker21: Edited some things. Max difference?
    $endgroup$
    – Omojola Micheal
    Dec 11 '18 at 21:06










  • $begingroup$
    wait, you're saying $|g_m(t)-g_n(t)| = 0$ for each $t$?
    $endgroup$
    – mathworker21
    Dec 11 '18 at 21:08










  • $begingroup$
    by max difference, what I mean is $max_t |g_m(t)-g_n(t)|$. you want to show this is less than $epsilon$ for $m,n$ large enough
    $endgroup$
    – mathworker21
    Dec 11 '18 at 21:08














1












1








1


1



$begingroup$


I want to show that the function defined by $g_n:[0,4]to Bbb{R}$, defined bybegin{align} g_n(t)=begin{cases}0,& text{if};0leq tleq 2,\dfrac{n}{2}(t-2),& text{if};2leq tleq 2+frac{2}{n},\1 &text{if};2+frac{2}{n}leq tleq 4.end{cases} end{align}
is continuous and Cauchy.



MY TRIAL
The sequence of functions is clearly continuous by Pasting Lemma. Next, we show that the sequence of functions is Cauchy.



So, let $m,ninBbb{N},$ be given such that $mgeq n.$ Then,



$$|g_m(t)-g_n(t)|=|0-0|+left|dfrac{m}{2}(t-2)-dfrac{n}{2}(t-2)right|left|1-1right|=0<epsilon$$



I don't know if this is right. If not, kindly help please!






real-analysis functional-analysis analysis normed-spaces







share|cite|improve this question











$endgroup$




I want to show that the function defined by $g_n:[0,4]to Bbb{R}$, defined bybegin{align} g_n(t)=begin{cases}0,& text{if};0leq tleq 2,\dfrac{n}{2}(t-2),& text{if};2leq tleq 2+frac{2}{n},\1 &text{if};2+frac{2}{n}leq tleq 4.end{cases} end{align}
is continuous and Cauchy.



MY TRIAL
The sequence of functions is clearly continuous by Pasting Lemma. Next, we show that the sequence of functions is Cauchy.



So, let $m,ninBbb{N},$ be given such that $mgeq n.$ Then,



$$|g_m(t)-g_n(t)|=|0-0|+left|dfrac{m}{2}(t-2)-dfrac{n}{2}(t-2)right|left|1-1right|=0<epsilon$$



I don't know if this is right. If not, kindly help please!






real-analysis functional-analysis analysis normed-spaces




real-analysis functional-analysis analysis normed-spaces






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Dec 11 '18 at 22:54









user289143

913313




913313










asked Dec 11 '18 at 20:57









Omojola MichealOmojola Micheal

1,853324




1,853324












  • $begingroup$
    functions are continuous. sequences are Cauchy
    $endgroup$
    – mathworker21
    Dec 11 '18 at 20:59










  • $begingroup$
    to prove Cauchy, just calculate the max difference between $g_n$ and $g_m$. what exactly is your difficulty?
    $endgroup$
    – mathworker21
    Dec 11 '18 at 21:00










  • $begingroup$
    @mathworker21: Edited some things. Max difference?
    $endgroup$
    – Omojola Micheal
    Dec 11 '18 at 21:06










  • $begingroup$
    wait, you're saying $|g_m(t)-g_n(t)| = 0$ for each $t$?
    $endgroup$
    – mathworker21
    Dec 11 '18 at 21:08










  • $begingroup$
    by max difference, what I mean is $max_t |g_m(t)-g_n(t)|$. you want to show this is less than $epsilon$ for $m,n$ large enough
    $endgroup$
    – mathworker21
    Dec 11 '18 at 21:08


















  • $begingroup$
    functions are continuous. sequences are Cauchy
    $endgroup$
    – mathworker21
    Dec 11 '18 at 20:59










  • $begingroup$
    to prove Cauchy, just calculate the max difference between $g_n$ and $g_m$. what exactly is your difficulty?
    $endgroup$
    – mathworker21
    Dec 11 '18 at 21:00










  • $begingroup$
    @mathworker21: Edited some things. Max difference?
    $endgroup$
    – Omojola Micheal
    Dec 11 '18 at 21:06










  • $begingroup$
    wait, you're saying $|g_m(t)-g_n(t)| = 0$ for each $t$?
    $endgroup$
    – mathworker21
    Dec 11 '18 at 21:08










  • $begingroup$
    by max difference, what I mean is $max_t |g_m(t)-g_n(t)|$. you want to show this is less than $epsilon$ for $m,n$ large enough
    $endgroup$
    – mathworker21
    Dec 11 '18 at 21:08
















$begingroup$
functions are continuous. sequences are Cauchy
$endgroup$
– mathworker21
Dec 11 '18 at 20:59




$begingroup$
functions are continuous. sequences are Cauchy
$endgroup$
– mathworker21
Dec 11 '18 at 20:59












$begingroup$
to prove Cauchy, just calculate the max difference between $g_n$ and $g_m$. what exactly is your difficulty?
$endgroup$
– mathworker21
Dec 11 '18 at 21:00




$begingroup$
to prove Cauchy, just calculate the max difference between $g_n$ and $g_m$. what exactly is your difficulty?
$endgroup$
– mathworker21
Dec 11 '18 at 21:00












$begingroup$
@mathworker21: Edited some things. Max difference?
$endgroup$
– Omojola Micheal
Dec 11 '18 at 21:06




$begingroup$
@mathworker21: Edited some things. Max difference?
$endgroup$
– Omojola Micheal
Dec 11 '18 at 21:06












$begingroup$
wait, you're saying $|g_m(t)-g_n(t)| = 0$ for each $t$?
$endgroup$
– mathworker21
Dec 11 '18 at 21:08




$begingroup$
wait, you're saying $|g_m(t)-g_n(t)| = 0$ for each $t$?
$endgroup$
– mathworker21
Dec 11 '18 at 21:08












$begingroup$
by max difference, what I mean is $max_t |g_m(t)-g_n(t)|$. you want to show this is less than $epsilon$ for $m,n$ large enough
$endgroup$
– mathworker21
Dec 11 '18 at 21:08




$begingroup$
by max difference, what I mean is $max_t |g_m(t)-g_n(t)|$. you want to show this is less than $epsilon$ for $m,n$ large enough
$endgroup$
– mathworker21
Dec 11 '18 at 21:08










2 Answers
2






active

oldest

votes


















1












$begingroup$

What meaning exactly do you assign to the sentence “the sequence $g_n$ is Cauchy”?



This sequence of functions converges pointwise to the function $h$ such that $h(x)=0$ if $0 leq x leq 2$ and $h(x)=1$ otherwise.



Now $h$ is not continuous whereas every $g_n$ is. So there cannot be max-norm convergence.



Edit: Just to provide some even more explicit argument because it does not seem to be accepted that the space of continuous functions from $[0,4]$ to $mathbb{R}$ is complete for the max-norm.



$g_nleft(2+frac{2}{2n}right)=frac{n}{2}frac{2}{2n}=frac{1}{2}$, while $g_{2n}left(2+frac{2}{2n}right)=1$.
Thus the max-norm of $g_n-g_{2n}$ is not lower than $frac{1}{2}$, hence the sequence is not Cauchy.






share|cite|improve this answer











$endgroup$









  • 1




    $begingroup$
    C([0,4]) is complete for the max-norm.
    $endgroup$
    – Mindlack
    Dec 11 '18 at 22:40






  • 1




    $begingroup$
    Besides, I do not have neough reputation to comment your post, but I fail to see how you can have $(N-n)/N < 1/N$.
    $endgroup$
    – Mindlack
    Dec 11 '18 at 22:49












  • $begingroup$
    If I am not mistaken, you are thus proving that the max-norm of $|g_n-g_m|$ is lower than $(N-n)/n$, which would be negative?
    $endgroup$
    – Mindlack
    Dec 11 '18 at 23:25










  • $begingroup$
    John B: I do not have another question. I am not convinced by user289143’s proof and I cannot comment it.
    $endgroup$
    – Mindlack
    Dec 11 '18 at 23:30






  • 1




    $begingroup$
    User289143: then you cannot have $|N-n|<1$.
    $endgroup$
    – Mindlack
    Dec 11 '18 at 23:31



















0












$begingroup$

A sequence is Cauchy if for every $epsilon$ there exists $N in mathbb{N}$ such that $forall n, m > N$ we have $|g_n-g_m|< epsilon$.
Now let $m > n$. How does the function $(g_m-g_n)(t)$ look like?
begin{align}
(g_m-g_n)(t)= begin{cases}
0 & if 0 leq t leq 2
\(frac{m}{2}-frac{n}{2})(t-2) & if 2 < t leq 2+frac{2}{m}
\1-frac{n}{2}(t-2) & if 2+frac{2}{m} < t leq 2+frac{2}{n}
\ 0 & if 2+frac{2}{n} < t leq 4
end{cases}
end{align}
Now $||g_m-g_n||_1=int_2^{2+frac{2}{m}}|(frac{m}{2}-frac{n}{2})(t-2)|dt+int_{2+frac{2}{m}}^{2+frac{2}{n}}|1-frac{n}{2}(t-2)|dt$

If we compute explicitly the integrals we get $||g_m-g_n||_1=frac{m-n}{m^2}+frac{(m-n)^2}{nm^2}=frac{m-n}{mn}<frac{m}{mn}=frac{1}{n}$

Let $N in mathbb{N}$ such that $N > frac{1}{epsilon}$ and we have $||g_m-g_m||_1<frac{1}{n}<frac{1}{N}<epsilon$ and this proves the sequence is Cauchy






share|cite|improve this answer











$endgroup$









  • 2




    $begingroup$
    Could you please explain why |N-n| < 1?
    $endgroup$
    – Mindlack
    Dec 12 '18 at 0:01










  • $begingroup$
    Edited the answer with the $||cdot||_1$ norm, to prove the space is not complete
    $endgroup$
    – user289143
    Dec 12 '18 at 13:22











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
});


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3035807%2fprove-that-the-sequence-of-functions-g-n-in-c0-4%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown

























2 Answers
2






active

oldest

votes








2 Answers
2






active

oldest

votes









active

oldest

votes






active

oldest

votes









1












$begingroup$

What meaning exactly do you assign to the sentence “the sequence $g_n$ is Cauchy”?



This sequence of functions converges pointwise to the function $h$ such that $h(x)=0$ if $0 leq x leq 2$ and $h(x)=1$ otherwise.



Now $h$ is not continuous whereas every $g_n$ is. So there cannot be max-norm convergence.



Edit: Just to provide some even more explicit argument because it does not seem to be accepted that the space of continuous functions from $[0,4]$ to $mathbb{R}$ is complete for the max-norm.



$g_nleft(2+frac{2}{2n}right)=frac{n}{2}frac{2}{2n}=frac{1}{2}$, while $g_{2n}left(2+frac{2}{2n}right)=1$.
Thus the max-norm of $g_n-g_{2n}$ is not lower than $frac{1}{2}$, hence the sequence is not Cauchy.






share|cite|improve this answer











$endgroup$









  • 1




    $begingroup$
    C([0,4]) is complete for the max-norm.
    $endgroup$
    – Mindlack
    Dec 11 '18 at 22:40






  • 1




    $begingroup$
    Besides, I do not have neough reputation to comment your post, but I fail to see how you can have $(N-n)/N < 1/N$.
    $endgroup$
    – Mindlack
    Dec 11 '18 at 22:49












  • $begingroup$
    If I am not mistaken, you are thus proving that the max-norm of $|g_n-g_m|$ is lower than $(N-n)/n$, which would be negative?
    $endgroup$
    – Mindlack
    Dec 11 '18 at 23:25










  • $begingroup$
    John B: I do not have another question. I am not convinced by user289143’s proof and I cannot comment it.
    $endgroup$
    – Mindlack
    Dec 11 '18 at 23:30






  • 1




    $begingroup$
    User289143: then you cannot have $|N-n|<1$.
    $endgroup$
    – Mindlack
    Dec 11 '18 at 23:31
















1












$begingroup$

What meaning exactly do you assign to the sentence “the sequence $g_n$ is Cauchy”?



This sequence of functions converges pointwise to the function $h$ such that $h(x)=0$ if $0 leq x leq 2$ and $h(x)=1$ otherwise.



Now $h$ is not continuous whereas every $g_n$ is. So there cannot be max-norm convergence.



Edit: Just to provide some even more explicit argument because it does not seem to be accepted that the space of continuous functions from $[0,4]$ to $mathbb{R}$ is complete for the max-norm.



$g_nleft(2+frac{2}{2n}right)=frac{n}{2}frac{2}{2n}=frac{1}{2}$, while $g_{2n}left(2+frac{2}{2n}right)=1$.
Thus the max-norm of $g_n-g_{2n}$ is not lower than $frac{1}{2}$, hence the sequence is not Cauchy.






share|cite|improve this answer











$endgroup$









  • 1




    $begingroup$
    C([0,4]) is complete for the max-norm.
    $endgroup$
    – Mindlack
    Dec 11 '18 at 22:40






  • 1




    $begingroup$
    Besides, I do not have neough reputation to comment your post, but I fail to see how you can have $(N-n)/N < 1/N$.
    $endgroup$
    – Mindlack
    Dec 11 '18 at 22:49












  • $begingroup$
    If I am not mistaken, you are thus proving that the max-norm of $|g_n-g_m|$ is lower than $(N-n)/n$, which would be negative?
    $endgroup$
    – Mindlack
    Dec 11 '18 at 23:25










  • $begingroup$
    John B: I do not have another question. I am not convinced by user289143’s proof and I cannot comment it.
    $endgroup$
    – Mindlack
    Dec 11 '18 at 23:30






  • 1




    $begingroup$
    User289143: then you cannot have $|N-n|<1$.
    $endgroup$
    – Mindlack
    Dec 11 '18 at 23:31














1












1








1





$begingroup$

What meaning exactly do you assign to the sentence “the sequence $g_n$ is Cauchy”?



This sequence of functions converges pointwise to the function $h$ such that $h(x)=0$ if $0 leq x leq 2$ and $h(x)=1$ otherwise.



Now $h$ is not continuous whereas every $g_n$ is. So there cannot be max-norm convergence.



Edit: Just to provide some even more explicit argument because it does not seem to be accepted that the space of continuous functions from $[0,4]$ to $mathbb{R}$ is complete for the max-norm.



$g_nleft(2+frac{2}{2n}right)=frac{n}{2}frac{2}{2n}=frac{1}{2}$, while $g_{2n}left(2+frac{2}{2n}right)=1$.
Thus the max-norm of $g_n-g_{2n}$ is not lower than $frac{1}{2}$, hence the sequence is not Cauchy.






share|cite|improve this answer











$endgroup$



What meaning exactly do you assign to the sentence “the sequence $g_n$ is Cauchy”?



This sequence of functions converges pointwise to the function $h$ such that $h(x)=0$ if $0 leq x leq 2$ and $h(x)=1$ otherwise.



Now $h$ is not continuous whereas every $g_n$ is. So there cannot be max-norm convergence.



Edit: Just to provide some even more explicit argument because it does not seem to be accepted that the space of continuous functions from $[0,4]$ to $mathbb{R}$ is complete for the max-norm.



$g_nleft(2+frac{2}{2n}right)=frac{n}{2}frac{2}{2n}=frac{1}{2}$, while $g_{2n}left(2+frac{2}{2n}right)=1$.
Thus the max-norm of $g_n-g_{2n}$ is not lower than $frac{1}{2}$, hence the sequence is not Cauchy.







share|cite|improve this answer














share|cite|improve this answer



share|cite|improve this answer








edited Dec 12 '18 at 11:57

























answered Dec 11 '18 at 22:06









MindlackMindlack

3,87018




3,87018








  • 1




    $begingroup$
    C([0,4]) is complete for the max-norm.
    $endgroup$
    – Mindlack
    Dec 11 '18 at 22:40






  • 1




    $begingroup$
    Besides, I do not have neough reputation to comment your post, but I fail to see how you can have $(N-n)/N < 1/N$.
    $endgroup$
    – Mindlack
    Dec 11 '18 at 22:49












  • $begingroup$
    If I am not mistaken, you are thus proving that the max-norm of $|g_n-g_m|$ is lower than $(N-n)/n$, which would be negative?
    $endgroup$
    – Mindlack
    Dec 11 '18 at 23:25










  • $begingroup$
    John B: I do not have another question. I am not convinced by user289143’s proof and I cannot comment it.
    $endgroup$
    – Mindlack
    Dec 11 '18 at 23:30






  • 1




    $begingroup$
    User289143: then you cannot have $|N-n|<1$.
    $endgroup$
    – Mindlack
    Dec 11 '18 at 23:31














  • 1




    $begingroup$
    C([0,4]) is complete for the max-norm.
    $endgroup$
    – Mindlack
    Dec 11 '18 at 22:40






  • 1




    $begingroup$
    Besides, I do not have neough reputation to comment your post, but I fail to see how you can have $(N-n)/N < 1/N$.
    $endgroup$
    – Mindlack
    Dec 11 '18 at 22:49












  • $begingroup$
    If I am not mistaken, you are thus proving that the max-norm of $|g_n-g_m|$ is lower than $(N-n)/n$, which would be negative?
    $endgroup$
    – Mindlack
    Dec 11 '18 at 23:25










  • $begingroup$
    John B: I do not have another question. I am not convinced by user289143’s proof and I cannot comment it.
    $endgroup$
    – Mindlack
    Dec 11 '18 at 23:30






  • 1




    $begingroup$
    User289143: then you cannot have $|N-n|<1$.
    $endgroup$
    – Mindlack
    Dec 11 '18 at 23:31








1




1




$begingroup$
C([0,4]) is complete for the max-norm.
$endgroup$
– Mindlack
Dec 11 '18 at 22:40




$begingroup$
C([0,4]) is complete for the max-norm.
$endgroup$
– Mindlack
Dec 11 '18 at 22:40




1




1




$begingroup$
Besides, I do not have neough reputation to comment your post, but I fail to see how you can have $(N-n)/N < 1/N$.
$endgroup$
– Mindlack
Dec 11 '18 at 22:49






$begingroup$
Besides, I do not have neough reputation to comment your post, but I fail to see how you can have $(N-n)/N < 1/N$.
$endgroup$
– Mindlack
Dec 11 '18 at 22:49














$begingroup$
If I am not mistaken, you are thus proving that the max-norm of $|g_n-g_m|$ is lower than $(N-n)/n$, which would be negative?
$endgroup$
– Mindlack
Dec 11 '18 at 23:25




$begingroup$
If I am not mistaken, you are thus proving that the max-norm of $|g_n-g_m|$ is lower than $(N-n)/n$, which would be negative?
$endgroup$
– Mindlack
Dec 11 '18 at 23:25












$begingroup$
John B: I do not have another question. I am not convinced by user289143’s proof and I cannot comment it.
$endgroup$
– Mindlack
Dec 11 '18 at 23:30




$begingroup$
John B: I do not have another question. I am not convinced by user289143’s proof and I cannot comment it.
$endgroup$
– Mindlack
Dec 11 '18 at 23:30




1




1




$begingroup$
User289143: then you cannot have $|N-n|<1$.
$endgroup$
– Mindlack
Dec 11 '18 at 23:31




$begingroup$
User289143: then you cannot have $|N-n|<1$.
$endgroup$
– Mindlack
Dec 11 '18 at 23:31











0












$begingroup$

A sequence is Cauchy if for every $epsilon$ there exists $N in mathbb{N}$ such that $forall n, m > N$ we have $|g_n-g_m|< epsilon$.
Now let $m > n$. How does the function $(g_m-g_n)(t)$ look like?
begin{align}
(g_m-g_n)(t)= begin{cases}
0 & if 0 leq t leq 2
\(frac{m}{2}-frac{n}{2})(t-2) & if 2 < t leq 2+frac{2}{m}
\1-frac{n}{2}(t-2) & if 2+frac{2}{m} < t leq 2+frac{2}{n}
\ 0 & if 2+frac{2}{n} < t leq 4
end{cases}
end{align}
Now $||g_m-g_n||_1=int_2^{2+frac{2}{m}}|(frac{m}{2}-frac{n}{2})(t-2)|dt+int_{2+frac{2}{m}}^{2+frac{2}{n}}|1-frac{n}{2}(t-2)|dt$

If we compute explicitly the integrals we get $||g_m-g_n||_1=frac{m-n}{m^2}+frac{(m-n)^2}{nm^2}=frac{m-n}{mn}<frac{m}{mn}=frac{1}{n}$

Let $N in mathbb{N}$ such that $N > frac{1}{epsilon}$ and we have $||g_m-g_m||_1<frac{1}{n}<frac{1}{N}<epsilon$ and this proves the sequence is Cauchy






share|cite|improve this answer











$endgroup$









  • 2




    $begingroup$
    Could you please explain why |N-n| < 1?
    $endgroup$
    – Mindlack
    Dec 12 '18 at 0:01










  • $begingroup$
    Edited the answer with the $||cdot||_1$ norm, to prove the space is not complete
    $endgroup$
    – user289143
    Dec 12 '18 at 13:22
















0












$begingroup$

A sequence is Cauchy if for every $epsilon$ there exists $N in mathbb{N}$ such that $forall n, m > N$ we have $|g_n-g_m|< epsilon$.
Now let $m > n$. How does the function $(g_m-g_n)(t)$ look like?
begin{align}
(g_m-g_n)(t)= begin{cases}
0 & if 0 leq t leq 2
\(frac{m}{2}-frac{n}{2})(t-2) & if 2 < t leq 2+frac{2}{m}
\1-frac{n}{2}(t-2) & if 2+frac{2}{m} < t leq 2+frac{2}{n}
\ 0 & if 2+frac{2}{n} < t leq 4
end{cases}
end{align}
Now $||g_m-g_n||_1=int_2^{2+frac{2}{m}}|(frac{m}{2}-frac{n}{2})(t-2)|dt+int_{2+frac{2}{m}}^{2+frac{2}{n}}|1-frac{n}{2}(t-2)|dt$

If we compute explicitly the integrals we get $||g_m-g_n||_1=frac{m-n}{m^2}+frac{(m-n)^2}{nm^2}=frac{m-n}{mn}<frac{m}{mn}=frac{1}{n}$

Let $N in mathbb{N}$ such that $N > frac{1}{epsilon}$ and we have $||g_m-g_m||_1<frac{1}{n}<frac{1}{N}<epsilon$ and this proves the sequence is Cauchy






share|cite|improve this answer











$endgroup$









  • 2




    $begingroup$
    Could you please explain why |N-n| < 1?
    $endgroup$
    – Mindlack
    Dec 12 '18 at 0:01










  • $begingroup$
    Edited the answer with the $||cdot||_1$ norm, to prove the space is not complete
    $endgroup$
    – user289143
    Dec 12 '18 at 13:22














0












0








0





$begingroup$

A sequence is Cauchy if for every $epsilon$ there exists $N in mathbb{N}$ such that $forall n, m > N$ we have $|g_n-g_m|< epsilon$.
Now let $m > n$. How does the function $(g_m-g_n)(t)$ look like?
begin{align}
(g_m-g_n)(t)= begin{cases}
0 & if 0 leq t leq 2
\(frac{m}{2}-frac{n}{2})(t-2) & if 2 < t leq 2+frac{2}{m}
\1-frac{n}{2}(t-2) & if 2+frac{2}{m} < t leq 2+frac{2}{n}
\ 0 & if 2+frac{2}{n} < t leq 4
end{cases}
end{align}
Now $||g_m-g_n||_1=int_2^{2+frac{2}{m}}|(frac{m}{2}-frac{n}{2})(t-2)|dt+int_{2+frac{2}{m}}^{2+frac{2}{n}}|1-frac{n}{2}(t-2)|dt$

If we compute explicitly the integrals we get $||g_m-g_n||_1=frac{m-n}{m^2}+frac{(m-n)^2}{nm^2}=frac{m-n}{mn}<frac{m}{mn}=frac{1}{n}$

Let $N in mathbb{N}$ such that $N > frac{1}{epsilon}$ and we have $||g_m-g_m||_1<frac{1}{n}<frac{1}{N}<epsilon$ and this proves the sequence is Cauchy






share|cite|improve this answer











$endgroup$



A sequence is Cauchy if for every $epsilon$ there exists $N in mathbb{N}$ such that $forall n, m > N$ we have $|g_n-g_m|< epsilon$.
Now let $m > n$. How does the function $(g_m-g_n)(t)$ look like?
begin{align}
(g_m-g_n)(t)= begin{cases}
0 & if 0 leq t leq 2
\(frac{m}{2}-frac{n}{2})(t-2) & if 2 < t leq 2+frac{2}{m}
\1-frac{n}{2}(t-2) & if 2+frac{2}{m} < t leq 2+frac{2}{n}
\ 0 & if 2+frac{2}{n} < t leq 4
end{cases}
end{align}
Now $||g_m-g_n||_1=int_2^{2+frac{2}{m}}|(frac{m}{2}-frac{n}{2})(t-2)|dt+int_{2+frac{2}{m}}^{2+frac{2}{n}}|1-frac{n}{2}(t-2)|dt$

If we compute explicitly the integrals we get $||g_m-g_n||_1=frac{m-n}{m^2}+frac{(m-n)^2}{nm^2}=frac{m-n}{mn}<frac{m}{mn}=frac{1}{n}$

Let $N in mathbb{N}$ such that $N > frac{1}{epsilon}$ and we have $||g_m-g_m||_1<frac{1}{n}<frac{1}{N}<epsilon$ and this proves the sequence is Cauchy







share|cite|improve this answer














share|cite|improve this answer



share|cite|improve this answer








edited Dec 12 '18 at 13:21

























answered Dec 11 '18 at 21:48









user289143user289143

913313




913313








  • 2




    $begingroup$
    Could you please explain why |N-n| < 1?
    $endgroup$
    – Mindlack
    Dec 12 '18 at 0:01










  • $begingroup$
    Edited the answer with the $||cdot||_1$ norm, to prove the space is not complete
    $endgroup$
    – user289143
    Dec 12 '18 at 13:22














  • 2




    $begingroup$
    Could you please explain why |N-n| < 1?
    $endgroup$
    – Mindlack
    Dec 12 '18 at 0:01










  • $begingroup$
    Edited the answer with the $||cdot||_1$ norm, to prove the space is not complete
    $endgroup$
    – user289143
    Dec 12 '18 at 13:22








2




2




$begingroup$
Could you please explain why |N-n| < 1?
$endgroup$
– Mindlack
Dec 12 '18 at 0:01




$begingroup$
Could you please explain why |N-n| < 1?
$endgroup$
– Mindlack
Dec 12 '18 at 0:01












$begingroup$
Edited the answer with the $||cdot||_1$ norm, to prove the space is not complete
$endgroup$
– user289143
Dec 12 '18 at 13:22




$begingroup$
Edited the answer with the $||cdot||_1$ norm, to prove the space is not complete
$endgroup$
– user289143
Dec 12 '18 at 13:22


















draft saved

draft discarded




















































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.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3035807%2fprove-that-the-sequence-of-functions-g-n-in-c0-4%23new-answer', 'question_page');
}
);

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







-

Popular posts from this blog

How do I know what Microsoft account the skydrive app is syncing to?

Image
up vote 4 down vote favorite 1 Some time ago, I set up skydrive for my wife on her mac. But now she wants to access the files online, I cannot remember what Microsoft account I setup and linked her skydive app to and nor can I see anything in the skydrive app settings to tell me either? How can I see the name of the Microsoft account the skydive app is currently linked to? I would like to know this for skydrive app for Mac and PC onedrive share | improve this question asked Feb 25 '13 at 4:52 Gary Barrett 260 2 5 12
Read more

When does type information flow backwards in C++?

Image
up vote 62 down vote favorite 19 I just watched Stephan T. Lavavej talk at CppCon 2018 on "Class Template Argument Deduction", where at some point he incidentally says: In C++ type information almost never flows backwards ... I had to say "almost" because there's one or two cases, possibly more but very few . Despite trying to figure out which cases he might be referring to, I couldn't come up with anything. Hence the question: In which cases the C++17 standard mandates that type information propagate backwards? c++ language-lawyer c++17 share | improve this question edited 7 hours ago scohe0
Read more

Grease: Live!

Image
A tradução deste artigo está abaixo da qualidade média aceitável. É possível que tenha sido feita por um tradutor automático ou por alguém que não conhece bem o português ou a língua original do texto. Caso queira colaborar com a Wikipédia, tente encontrar a página original e melhore este verbete conforme o guia de tradução. Grease: Live! Grease: Live!  (PRT/BRA)  Estados Unidos 2016 •   cor •   130 min. min   Direção Thomas Kail Alex Rudzinski Produção Marc Platt Adam Siegel Roteiro Allan Carr Robert Cary Warren Casey Jim Jacobs Jonathan Tolins Bronte Woodard Baseado em Grease (musical) Grease (filme) Elenco Julianne Hough Aaron Tveit Vanessa Hudgens Carlos Pena Jr. Keke Palmer Carly Rae Jepsen Kether Donohue Jordan Fisher David Del Rio Andrew Call Gênero Musical Música Tom Kitt Figurino William Ivey Long Companhia(s) produtora(s) Warner Bros. Studios Distribuição Fox Lançamento 31 de Janei
Read more