Problem in understanding solution to problem 4a, chapter 22 of Spivak Calculus
up vote
4
down vote
favorite
In chapter 22 of Spivak calculus, problem 4a is
Prove that if a subsequence of a Cauchy sequence converges to $l$, then the sequence itself converges to $l$.
This is the solution in Combined answer book
Since $a_{n_k}$ converges to $l$. There exits $Jinmathbb{N}$ such that
$$
k>JRightarrow |a_{n_k}-l|<frac{epsilon}{2}
$$
Since $a_n$ is Cauchy. There exists $N_1inmathbb{N}$ such that
$$
n,m>N_1Rightarrow|a_n-a_m|<frac{epsilon}{2}
$$
Let $N=max(N_1,n_J)$. If $n>N$, then
$$
|a_n-a_{n_{j+1}}|<frac{epsilon}{2}
$$
and
$$
|a_{n_{j+1}}-l|<frac{epsilon}{2}
$$
Consequently $|a_n-l|<epsilon$.
I do not understand, how when $n>N$, then
$$
|a_n-a_{n_{j+1}}|<frac{epsilon}{2}
$$
and
$$
|a_{n_{j+1}}-l|<frac{epsilon}{2}
$$
Could someone please explain it to me?
calculus real-analysis sequences-and-series
add a comment |
up vote
4
down vote
favorite
In chapter 22 of Spivak calculus, problem 4a is
Prove that if a subsequence of a Cauchy sequence converges to $l$, then the sequence itself converges to $l$.
This is the solution in Combined answer book
Since $a_{n_k}$ converges to $l$. There exits $Jinmathbb{N}$ such that
$$
k>JRightarrow |a_{n_k}-l|<frac{epsilon}{2}
$$
Since $a_n$ is Cauchy. There exists $N_1inmathbb{N}$ such that
$$
n,m>N_1Rightarrow|a_n-a_m|<frac{epsilon}{2}
$$
Let $N=max(N_1,n_J)$. If $n>N$, then
$$
|a_n-a_{n_{j+1}}|<frac{epsilon}{2}
$$
and
$$
|a_{n_{j+1}}-l|<frac{epsilon}{2}
$$
Consequently $|a_n-l|<epsilon$.
I do not understand, how when $n>N$, then
$$
|a_n-a_{n_{j+1}}|<frac{epsilon}{2}
$$
and
$$
|a_{n_{j+1}}-l|<frac{epsilon}{2}
$$
Could someone please explain it to me?
calculus real-analysis sequences-and-series
add a comment |
up vote
4
down vote
favorite
up vote
4
down vote
favorite
In chapter 22 of Spivak calculus, problem 4a is
Prove that if a subsequence of a Cauchy sequence converges to $l$, then the sequence itself converges to $l$.
This is the solution in Combined answer book
Since $a_{n_k}$ converges to $l$. There exits $Jinmathbb{N}$ such that
$$
k>JRightarrow |a_{n_k}-l|<frac{epsilon}{2}
$$
Since $a_n$ is Cauchy. There exists $N_1inmathbb{N}$ such that
$$
n,m>N_1Rightarrow|a_n-a_m|<frac{epsilon}{2}
$$
Let $N=max(N_1,n_J)$. If $n>N$, then
$$
|a_n-a_{n_{j+1}}|<frac{epsilon}{2}
$$
and
$$
|a_{n_{j+1}}-l|<frac{epsilon}{2}
$$
Consequently $|a_n-l|<epsilon$.
I do not understand, how when $n>N$, then
$$
|a_n-a_{n_{j+1}}|<frac{epsilon}{2}
$$
and
$$
|a_{n_{j+1}}-l|<frac{epsilon}{2}
$$
Could someone please explain it to me?
calculus real-analysis sequences-and-series
In chapter 22 of Spivak calculus, problem 4a is
Prove that if a subsequence of a Cauchy sequence converges to $l$, then the sequence itself converges to $l$.
This is the solution in Combined answer book
Since $a_{n_k}$ converges to $l$. There exits $Jinmathbb{N}$ such that
$$
k>JRightarrow |a_{n_k}-l|<frac{epsilon}{2}
$$
Since $a_n$ is Cauchy. There exists $N_1inmathbb{N}$ such that
$$
n,m>N_1Rightarrow|a_n-a_m|<frac{epsilon}{2}
$$
Let $N=max(N_1,n_J)$. If $n>N$, then
$$
|a_n-a_{n_{j+1}}|<frac{epsilon}{2}
$$
and
$$
|a_{n_{j+1}}-l|<frac{epsilon}{2}
$$
Consequently $|a_n-l|<epsilon$.
I do not understand, how when $n>N$, then
$$
|a_n-a_{n_{j+1}}|<frac{epsilon}{2}
$$
and
$$
|a_{n_{j+1}}-l|<frac{epsilon}{2}
$$
Could someone please explain it to me?
calculus real-analysis sequences-and-series
calculus real-analysis sequences-and-series
asked Apr 7 '17 at 10:09
user214302
add a comment |
add a comment |
2 Answers
2
active
oldest
votes
up vote
0
down vote
accepted
The proof seems to be incorrect.
In order to deduce
begin{align*}
|a_n-a_{n_{J+1}}|<frac{epsilon}{2}tag{1}
end{align*}
we have to assure that $n>N_1$ and $n_{J+1}>N_1$.
Since $n>N=max(N_1,n_J)geq N_1$ we have $n>N_1$. But we don't know if $n_{J+1}>N_1$.
We know $n_{J+1}>n_J$ which is sufficient to show
begin{align*}
|a_{n_{J+1}}-l|<frac{epsilon}{2}
end{align*}
but not sufficient to show (1).
add a comment |
up vote
0
down vote
Proof goes as follows:
Let $a_{n}$ be a Cauchy sequence.
Suppose that $a_{j_{n}}$ is a convergent subsequence of $a_{n}$.
First, note that the sequence $j_{n} geq n$ for all $n in mathbb{N}$ (You can prove this as an exercise). (*)
We want to proof that $forall epsilon > 0$ there exist a $N in mathbb{N}$ such that for all $n geq N$, $|a_{n}-L|<epsilon$ (for some $L$ where $L$ is the limit we want).
Let $epsilon > 0$.
Since $a_{n}$ is a Cauchy sequence, then exist an $N_{1} in mathbb{N}$ such that for all $m,n geq N_{1}$, $|a_{n}-a_{m}|<dfrac{epsilon}{2}$.
In the other hand, we have that $a_{j_{n}}$ is convergent (say, to $M$). Then, exist $N_{2}$ such that for all $n geq N_{2}$, $|a_{j_{n}}-M|<dfrac{epsilon}{2}$
If we choose $N_{0}=max(N_{1},N_{2})$, then let $n in mathbb{N}$ such that $n geq N_{0}$.
By (*) we have $j_{n} geq n geq N_{0}$. In particular, $j_{n}, n geq N_{1}$ then, since $a_{n}$ is a Cauchy sequence by hypotesis, $|a_{j_{n}}-a_{n}|< dfrac{epsilon}{2}$
But also $n geq N_{2}$, then $|a_{j_{n}}-M|< dfrac{epsilon}{2}$.
By triangle inequality, we have $$|a_{n}-M|=|(a_{n}-a_{j_{n}})+(a_{j_{n}}-M)|leq |a_{n}-a_{j_{n}}|+|a_{j_{n}}-M|=|a_{j_{n}}-a_{n}|+|a_{j_{n}}-M|<dfrac{epsilon}{2}+dfrac{epsilon}{2}=epsilon$$
In other words: $$|a_{n}-M|<epsilon$$
And $M$ is the $L$ we wanted at the begin of the proof.
New contributor
add a comment |
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
up vote
0
down vote
accepted
The proof seems to be incorrect.
In order to deduce
begin{align*}
|a_n-a_{n_{J+1}}|<frac{epsilon}{2}tag{1}
end{align*}
we have to assure that $n>N_1$ and $n_{J+1}>N_1$.
Since $n>N=max(N_1,n_J)geq N_1$ we have $n>N_1$. But we don't know if $n_{J+1}>N_1$.
We know $n_{J+1}>n_J$ which is sufficient to show
begin{align*}
|a_{n_{J+1}}-l|<frac{epsilon}{2}
end{align*}
but not sufficient to show (1).
add a comment |
up vote
0
down vote
accepted
The proof seems to be incorrect.
In order to deduce
begin{align*}
|a_n-a_{n_{J+1}}|<frac{epsilon}{2}tag{1}
end{align*}
we have to assure that $n>N_1$ and $n_{J+1}>N_1$.
Since $n>N=max(N_1,n_J)geq N_1$ we have $n>N_1$. But we don't know if $n_{J+1}>N_1$.
We know $n_{J+1}>n_J$ which is sufficient to show
begin{align*}
|a_{n_{J+1}}-l|<frac{epsilon}{2}
end{align*}
but not sufficient to show (1).
add a comment |
up vote
0
down vote
accepted
up vote
0
down vote
accepted
The proof seems to be incorrect.
In order to deduce
begin{align*}
|a_n-a_{n_{J+1}}|<frac{epsilon}{2}tag{1}
end{align*}
we have to assure that $n>N_1$ and $n_{J+1}>N_1$.
Since $n>N=max(N_1,n_J)geq N_1$ we have $n>N_1$. But we don't know if $n_{J+1}>N_1$.
We know $n_{J+1}>n_J$ which is sufficient to show
begin{align*}
|a_{n_{J+1}}-l|<frac{epsilon}{2}
end{align*}
but not sufficient to show (1).
The proof seems to be incorrect.
In order to deduce
begin{align*}
|a_n-a_{n_{J+1}}|<frac{epsilon}{2}tag{1}
end{align*}
we have to assure that $n>N_1$ and $n_{J+1}>N_1$.
Since $n>N=max(N_1,n_J)geq N_1$ we have $n>N_1$. But we don't know if $n_{J+1}>N_1$.
We know $n_{J+1}>n_J$ which is sufficient to show
begin{align*}
|a_{n_{J+1}}-l|<frac{epsilon}{2}
end{align*}
but not sufficient to show (1).
answered Apr 7 '17 at 20:07
Markus Scheuer
59.4k454141
59.4k454141
add a comment |
add a comment |
up vote
0
down vote
Proof goes as follows:
Let $a_{n}$ be a Cauchy sequence.
Suppose that $a_{j_{n}}$ is a convergent subsequence of $a_{n}$.
First, note that the sequence $j_{n} geq n$ for all $n in mathbb{N}$ (You can prove this as an exercise). (*)
We want to proof that $forall epsilon > 0$ there exist a $N in mathbb{N}$ such that for all $n geq N$, $|a_{n}-L|<epsilon$ (for some $L$ where $L$ is the limit we want).
Let $epsilon > 0$.
Since $a_{n}$ is a Cauchy sequence, then exist an $N_{1} in mathbb{N}$ such that for all $m,n geq N_{1}$, $|a_{n}-a_{m}|<dfrac{epsilon}{2}$.
In the other hand, we have that $a_{j_{n}}$ is convergent (say, to $M$). Then, exist $N_{2}$ such that for all $n geq N_{2}$, $|a_{j_{n}}-M|<dfrac{epsilon}{2}$
If we choose $N_{0}=max(N_{1},N_{2})$, then let $n in mathbb{N}$ such that $n geq N_{0}$.
By (*) we have $j_{n} geq n geq N_{0}$. In particular, $j_{n}, n geq N_{1}$ then, since $a_{n}$ is a Cauchy sequence by hypotesis, $|a_{j_{n}}-a_{n}|< dfrac{epsilon}{2}$
But also $n geq N_{2}$, then $|a_{j_{n}}-M|< dfrac{epsilon}{2}$.
By triangle inequality, we have $$|a_{n}-M|=|(a_{n}-a_{j_{n}})+(a_{j_{n}}-M)|leq |a_{n}-a_{j_{n}}|+|a_{j_{n}}-M|=|a_{j_{n}}-a_{n}|+|a_{j_{n}}-M|<dfrac{epsilon}{2}+dfrac{epsilon}{2}=epsilon$$
In other words: $$|a_{n}-M|<epsilon$$
And $M$ is the $L$ we wanted at the begin of the proof.
New contributor
add a comment |
up vote
0
down vote
Proof goes as follows:
Let $a_{n}$ be a Cauchy sequence.
Suppose that $a_{j_{n}}$ is a convergent subsequence of $a_{n}$.
First, note that the sequence $j_{n} geq n$ for all $n in mathbb{N}$ (You can prove this as an exercise). (*)
We want to proof that $forall epsilon > 0$ there exist a $N in mathbb{N}$ such that for all $n geq N$, $|a_{n}-L|<epsilon$ (for some $L$ where $L$ is the limit we want).
Let $epsilon > 0$.
Since $a_{n}$ is a Cauchy sequence, then exist an $N_{1} in mathbb{N}$ such that for all $m,n geq N_{1}$, $|a_{n}-a_{m}|<dfrac{epsilon}{2}$.
In the other hand, we have that $a_{j_{n}}$ is convergent (say, to $M$). Then, exist $N_{2}$ such that for all $n geq N_{2}$, $|a_{j_{n}}-M|<dfrac{epsilon}{2}$
If we choose $N_{0}=max(N_{1},N_{2})$, then let $n in mathbb{N}$ such that $n geq N_{0}$.
By (*) we have $j_{n} geq n geq N_{0}$. In particular, $j_{n}, n geq N_{1}$ then, since $a_{n}$ is a Cauchy sequence by hypotesis, $|a_{j_{n}}-a_{n}|< dfrac{epsilon}{2}$
But also $n geq N_{2}$, then $|a_{j_{n}}-M|< dfrac{epsilon}{2}$.
By triangle inequality, we have $$|a_{n}-M|=|(a_{n}-a_{j_{n}})+(a_{j_{n}}-M)|leq |a_{n}-a_{j_{n}}|+|a_{j_{n}}-M|=|a_{j_{n}}-a_{n}|+|a_{j_{n}}-M|<dfrac{epsilon}{2}+dfrac{epsilon}{2}=epsilon$$
In other words: $$|a_{n}-M|<epsilon$$
And $M$ is the $L$ we wanted at the begin of the proof.
New contributor
add a comment |
up vote
0
down vote
up vote
0
down vote
Proof goes as follows:
Let $a_{n}$ be a Cauchy sequence.
Suppose that $a_{j_{n}}$ is a convergent subsequence of $a_{n}$.
First, note that the sequence $j_{n} geq n$ for all $n in mathbb{N}$ (You can prove this as an exercise). (*)
We want to proof that $forall epsilon > 0$ there exist a $N in mathbb{N}$ such that for all $n geq N$, $|a_{n}-L|<epsilon$ (for some $L$ where $L$ is the limit we want).
Let $epsilon > 0$.
Since $a_{n}$ is a Cauchy sequence, then exist an $N_{1} in mathbb{N}$ such that for all $m,n geq N_{1}$, $|a_{n}-a_{m}|<dfrac{epsilon}{2}$.
In the other hand, we have that $a_{j_{n}}$ is convergent (say, to $M$). Then, exist $N_{2}$ such that for all $n geq N_{2}$, $|a_{j_{n}}-M|<dfrac{epsilon}{2}$
If we choose $N_{0}=max(N_{1},N_{2})$, then let $n in mathbb{N}$ such that $n geq N_{0}$.
By (*) we have $j_{n} geq n geq N_{0}$. In particular, $j_{n}, n geq N_{1}$ then, since $a_{n}$ is a Cauchy sequence by hypotesis, $|a_{j_{n}}-a_{n}|< dfrac{epsilon}{2}$
But also $n geq N_{2}$, then $|a_{j_{n}}-M|< dfrac{epsilon}{2}$.
By triangle inequality, we have $$|a_{n}-M|=|(a_{n}-a_{j_{n}})+(a_{j_{n}}-M)|leq |a_{n}-a_{j_{n}}|+|a_{j_{n}}-M|=|a_{j_{n}}-a_{n}|+|a_{j_{n}}-M|<dfrac{epsilon}{2}+dfrac{epsilon}{2}=epsilon$$
In other words: $$|a_{n}-M|<epsilon$$
And $M$ is the $L$ we wanted at the begin of the proof.
New contributor
Proof goes as follows:
Let $a_{n}$ be a Cauchy sequence.
Suppose that $a_{j_{n}}$ is a convergent subsequence of $a_{n}$.
First, note that the sequence $j_{n} geq n$ for all $n in mathbb{N}$ (You can prove this as an exercise). (*)
We want to proof that $forall epsilon > 0$ there exist a $N in mathbb{N}$ such that for all $n geq N$, $|a_{n}-L|<epsilon$ (for some $L$ where $L$ is the limit we want).
Let $epsilon > 0$.
Since $a_{n}$ is a Cauchy sequence, then exist an $N_{1} in mathbb{N}$ such that for all $m,n geq N_{1}$, $|a_{n}-a_{m}|<dfrac{epsilon}{2}$.
In the other hand, we have that $a_{j_{n}}$ is convergent (say, to $M$). Then, exist $N_{2}$ such that for all $n geq N_{2}$, $|a_{j_{n}}-M|<dfrac{epsilon}{2}$
If we choose $N_{0}=max(N_{1},N_{2})$, then let $n in mathbb{N}$ such that $n geq N_{0}$.
By (*) we have $j_{n} geq n geq N_{0}$. In particular, $j_{n}, n geq N_{1}$ then, since $a_{n}$ is a Cauchy sequence by hypotesis, $|a_{j_{n}}-a_{n}|< dfrac{epsilon}{2}$
But also $n geq N_{2}$, then $|a_{j_{n}}-M|< dfrac{epsilon}{2}$.
By triangle inequality, we have $$|a_{n}-M|=|(a_{n}-a_{j_{n}})+(a_{j_{n}}-M)|leq |a_{n}-a_{j_{n}}|+|a_{j_{n}}-M|=|a_{j_{n}}-a_{n}|+|a_{j_{n}}-M|<dfrac{epsilon}{2}+dfrac{epsilon}{2}=epsilon$$
In other words: $$|a_{n}-M|<epsilon$$
And $M$ is the $L$ we wanted at the begin of the proof.
New contributor
New contributor
answered Dec 1 at 2:48
rowcol
612
612
New contributor
New contributor
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.
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%2f2222164%2fproblem-in-understanding-solution-to-problem-4a-chapter-22-of-spivak-calculus%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