Verification of proof of nonconvergenceProof Verification: Cauchy Sequences are convergent.I don't understand...
The need of reserving one's ability in job interviews
How to roleplay my character's ethics according to the DM when I don't understand those ethics?
Are Wave equations equivalent to Maxwell equations in free space?
Is there a math equivalent to the conditional ternary operator?
Remove object from array based on array of some property of that object
Searching for a string that contains the file name
Learning to quickly identify valid fingering for piano?
Convert an array of objects to array of the objects' values
How does insurance birth control work in the United States?
Did Amazon pay $0 in taxes last year?
Is being socially reclusive okay for a graduate student?
What is better: yes / no radio, or simple checkbox?
Adding thousand separator to various number types
How can friction do no work in case of pure rolling?
Has a sovereign Communist government ever run, and conceded loss, on a fair election?
What's the best tool for cutting holes into duct work?
Dukha vs legitimate need
Why do phishing e-mails use faked e-mail addresses instead of the real one?
In the world of The Matrix, what is "popping"?
Number of folds to form a cube, using a square paper?
Meshing the cow
How do you make a gun that shoots melee weapons and/or swords?
What is the oldest European royal house?
How will Occam's Razor principle work in Machine learning
Verification of proof of nonconvergence
Proof Verification: Cauchy Sequences are convergent.I don't understand the proof that $Bbb{R}$ is complete with respect to Cauchy sequences.Proof verification regarding whether a certain property of a sequence implies that it is Cauchy.Proof verification: convergent series with a finite number of negative terms is Absolutely ConvergentProof Verification: Regarding equivalent sequences and Cauchy sequences, Tao Analysis I: Exercise 5.2.1.A convergent sequence is bounded: Proof VerificationProof verification - Cauchy completeness of $mathbb{R}$Cauchy sequence exercise question (Exercise 2.6.4 Abbott analysis)Let $(a_n)$ and $(b_n)$ be Cauchy sequences of rationals. Then $(a_nb_n)$ is Cauchy sequenceLet there be a sequence such that the distance between two consecutive terms converges to 0. Must this sequence converge?
$begingroup$
I'm not sure if my proof is sound or not, I was wondering if anyone could verify.
Prove that the sequence ${a_n}_n $ given by $a_n = frac{(-1)^n;n+1}{3n}$ does not converge.
Proof: Let $epsilon = frac 23$ and $N in Bbb R$. Let $k in Bbb N$ such that $k gt N$ and suppose $m = k +1$ and $n = k$ such that $n $ is even. Then, $m,n gt N$ and $|a_m-a_n| = |frac {(-1)^n;n+1}{3n}-frac{(-1)^{n+1};n+2}{3(n+1)}|.$ Since $n$ is even, $m$ must be odd and so $|a_m-a_n|=|frac{n+1}{3n}+frac{n+2}{3(n+1)}| = |frac{(n+1)^2+n(n+2)}{3n(n+1)}|=|frac{2n^2+4n+1}{3n(n+1)}|gtfrac{2n^2+4n}{3n(n+1)}=frac{2n(n+2)}{3n(n+1)}gtfrac{2n(n+1)}{3n(n+1)}=frac23 = epsilon.$ Hence, $|a_m-a_n| ge epsilon $ for all $m,n gt N$ and so ${a_n}_n$ is not Cauchy and does not converge. $Box$
Any help would be appreciated, thanks!
real-analysis proof-verification convergence cauchy-sequences
$endgroup$
add a comment |
$begingroup$
I'm not sure if my proof is sound or not, I was wondering if anyone could verify.
Prove that the sequence ${a_n}_n $ given by $a_n = frac{(-1)^n;n+1}{3n}$ does not converge.
Proof: Let $epsilon = frac 23$ and $N in Bbb R$. Let $k in Bbb N$ such that $k gt N$ and suppose $m = k +1$ and $n = k$ such that $n $ is even. Then, $m,n gt N$ and $|a_m-a_n| = |frac {(-1)^n;n+1}{3n}-frac{(-1)^{n+1};n+2}{3(n+1)}|.$ Since $n$ is even, $m$ must be odd and so $|a_m-a_n|=|frac{n+1}{3n}+frac{n+2}{3(n+1)}| = |frac{(n+1)^2+n(n+2)}{3n(n+1)}|=|frac{2n^2+4n+1}{3n(n+1)}|gtfrac{2n^2+4n}{3n(n+1)}=frac{2n(n+2)}{3n(n+1)}gtfrac{2n(n+1)}{3n(n+1)}=frac23 = epsilon.$ Hence, $|a_m-a_n| ge epsilon $ for all $m,n gt N$ and so ${a_n}_n$ is not Cauchy and does not converge. $Box$
Any help would be appreciated, thanks!
real-analysis proof-verification convergence cauchy-sequences
$endgroup$
add a comment |
$begingroup$
I'm not sure if my proof is sound or not, I was wondering if anyone could verify.
Prove that the sequence ${a_n}_n $ given by $a_n = frac{(-1)^n;n+1}{3n}$ does not converge.
Proof: Let $epsilon = frac 23$ and $N in Bbb R$. Let $k in Bbb N$ such that $k gt N$ and suppose $m = k +1$ and $n = k$ such that $n $ is even. Then, $m,n gt N$ and $|a_m-a_n| = |frac {(-1)^n;n+1}{3n}-frac{(-1)^{n+1};n+2}{3(n+1)}|.$ Since $n$ is even, $m$ must be odd and so $|a_m-a_n|=|frac{n+1}{3n}+frac{n+2}{3(n+1)}| = |frac{(n+1)^2+n(n+2)}{3n(n+1)}|=|frac{2n^2+4n+1}{3n(n+1)}|gtfrac{2n^2+4n}{3n(n+1)}=frac{2n(n+2)}{3n(n+1)}gtfrac{2n(n+1)}{3n(n+1)}=frac23 = epsilon.$ Hence, $|a_m-a_n| ge epsilon $ for all $m,n gt N$ and so ${a_n}_n$ is not Cauchy and does not converge. $Box$
Any help would be appreciated, thanks!
real-analysis proof-verification convergence cauchy-sequences
$endgroup$
I'm not sure if my proof is sound or not, I was wondering if anyone could verify.
Prove that the sequence ${a_n}_n $ given by $a_n = frac{(-1)^n;n+1}{3n}$ does not converge.
Proof: Let $epsilon = frac 23$ and $N in Bbb R$. Let $k in Bbb N$ such that $k gt N$ and suppose $m = k +1$ and $n = k$ such that $n $ is even. Then, $m,n gt N$ and $|a_m-a_n| = |frac {(-1)^n;n+1}{3n}-frac{(-1)^{n+1};n+2}{3(n+1)}|.$ Since $n$ is even, $m$ must be odd and so $|a_m-a_n|=|frac{n+1}{3n}+frac{n+2}{3(n+1)}| = |frac{(n+1)^2+n(n+2)}{3n(n+1)}|=|frac{2n^2+4n+1}{3n(n+1)}|gtfrac{2n^2+4n}{3n(n+1)}=frac{2n(n+2)}{3n(n+1)}gtfrac{2n(n+1)}{3n(n+1)}=frac23 = epsilon.$ Hence, $|a_m-a_n| ge epsilon $ for all $m,n gt N$ and so ${a_n}_n$ is not Cauchy and does not converge. $Box$
Any help would be appreciated, thanks!
real-analysis proof-verification convergence cauchy-sequences
real-analysis proof-verification convergence cauchy-sequences
edited 6 hours ago
José Carlos Santos
165k22132235
165k22132235
asked 6 hours ago
B RetnikB Retnik
534
534
add a comment |
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
That proof is correct. I think that there is no need to introduce the letter $k$; you could just say that $m=n+1$ (in fact, that's what you actually do).
You could also prove that that sequence has a subsequence which converges to $frac13$ and another one which converges to $-frac13$. That would also prove that the sequence is not convergent.
$endgroup$
add a comment |
$begingroup$
You have a much simpler way to write that. Indeed, suppose that $a_n rightarrow l$. Then
$$frac{3n}{n+1}a_n rightarrow 3l$$
But $frac{3n}{n+1}a_n = (-1)^n$, therefore it does not converge.
$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%2f3138718%2fverification-of-proof-of-nonconvergence%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
$begingroup$
That proof is correct. I think that there is no need to introduce the letter $k$; you could just say that $m=n+1$ (in fact, that's what you actually do).
You could also prove that that sequence has a subsequence which converges to $frac13$ and another one which converges to $-frac13$. That would also prove that the sequence is not convergent.
$endgroup$
add a comment |
$begingroup$
That proof is correct. I think that there is no need to introduce the letter $k$; you could just say that $m=n+1$ (in fact, that's what you actually do).
You could also prove that that sequence has a subsequence which converges to $frac13$ and another one which converges to $-frac13$. That would also prove that the sequence is not convergent.
$endgroup$
add a comment |
$begingroup$
That proof is correct. I think that there is no need to introduce the letter $k$; you could just say that $m=n+1$ (in fact, that's what you actually do).
You could also prove that that sequence has a subsequence which converges to $frac13$ and another one which converges to $-frac13$. That would also prove that the sequence is not convergent.
$endgroup$
That proof is correct. I think that there is no need to introduce the letter $k$; you could just say that $m=n+1$ (in fact, that's what you actually do).
You could also prove that that sequence has a subsequence which converges to $frac13$ and another one which converges to $-frac13$. That would also prove that the sequence is not convergent.
edited 4 hours ago
answered 6 hours ago
José Carlos SantosJosé Carlos Santos
165k22132235
165k22132235
add a comment |
add a comment |
$begingroup$
You have a much simpler way to write that. Indeed, suppose that $a_n rightarrow l$. Then
$$frac{3n}{n+1}a_n rightarrow 3l$$
But $frac{3n}{n+1}a_n = (-1)^n$, therefore it does not converge.
$endgroup$
add a comment |
$begingroup$
You have a much simpler way to write that. Indeed, suppose that $a_n rightarrow l$. Then
$$frac{3n}{n+1}a_n rightarrow 3l$$
But $frac{3n}{n+1}a_n = (-1)^n$, therefore it does not converge.
$endgroup$
add a comment |
$begingroup$
You have a much simpler way to write that. Indeed, suppose that $a_n rightarrow l$. Then
$$frac{3n}{n+1}a_n rightarrow 3l$$
But $frac{3n}{n+1}a_n = (-1)^n$, therefore it does not converge.
$endgroup$
You have a much simpler way to write that. Indeed, suppose that $a_n rightarrow l$. Then
$$frac{3n}{n+1}a_n rightarrow 3l$$
But $frac{3n}{n+1}a_n = (-1)^n$, therefore it does not converge.
answered 6 hours ago
TheSilverDoeTheSilverDoe
2,973112
2,973112
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%2f3138718%2fverification-of-proof-of-nonconvergence%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