Regarding Peano arithmetic, my point is that S(a)+b := S(a+b) (for example) is not the same thing as S(a)+b = S(a+b). The former is a definition, whereas the latter is an statement (which can be used as an axiom). In order to make sense of the definition you need to understand the concept of recursion, whereas you can make sense of the statement just by thinking of addition as “some binary operation that we don’t know what it is, but this is a fact we know about it”. (Let me reiterate that this is a rather technical distinction, I don’t think it makes too much difference either way but I thought it was worth pointing out.)
Especially in math, it’s great to have concepts or diction which I think “clearly have the same shade of connotation” (but actually don’t) brought to my attention. I understand the difference you’re pointing to here, and I’ll be more cognizant of it in the future. Precision of thought and speech is important, so thanks!
So, your proof is actually kind of confusingly worded...
That’s a good point, and one I realized soon after leaving my computer - Ldoesn’t stay fixed in my argument. I think that one should still be able to show that all these different L‘s have to be the same, right? That is (this is just an outline), take any distinct ϵ1,ϵ2>0; then suppose for distinct L1,L2∈R, the sequence is eventually ϵ1-close to L1 and ϵ2-close to L2. Then we have that |L1−L2|<min(ϵ1,ϵ2). Since ϵ1,ϵ2 are arbitrary, we can expand this argument to an arbitrary number of arbitrarily small ϵ‘s to show that all the L’s must be equal.
My intuition is just so strong on this one, and I want to see whether I can extend my proof to cover it, or whether I actually need to just change approaches.
So, the way that I understand your argument, L ranges over the values L,L+ϵ,L+2ϵ,…,L+Nϵ. (Of course there is a circular dependency here but as far as I can tell this was what you were thinking.) Of course, all of these possible values of L are clearly distinct. I’m not really sure what your point is about what happens if you assume that a sequence is eventually close to two different numbers. I think part of the issue is that your proof is a proof by contradiction, but in a proof by contradiction you are only allowed to introduce the contradiction hypothesis once, not an arbitrary number of times.
The fundamental question that any proof of this theorem should answer is: given a bounded monotonic sequence, how do we find the L that it converges to? Your proof doesn’t appear to address this question at all, which makes me think you need a completely different idea.
Note: to address your “strong intuition” perhaps I should say that of course if you have two real numbers L1 and L2 such that for all ϵ1,ϵ2>0, there is a number that is ϵ1-close to L1 and ϵ2-close to L2, then L1=L2. But I don’t think this fact has the significance you want it to have in the broader argument.
Especially in math, it’s great to have concepts or diction which I think “clearly have the same shade of connotation” (but actually don’t) brought to my attention. I understand the difference you’re pointing to here, and I’ll be more cognizant of it in the future. Precision of thought and speech is important, so thanks!
That’s a good point, and one I realized soon after leaving my computer - L doesn’t stay fixed in my argument. I think that one should still be able to show that all these different L‘s have to be the same, right? That is (this is just an outline), take any distinct ϵ1,ϵ2>0; then suppose for distinct L1,L2∈R, the sequence is eventually ϵ1-close to L1 and ϵ2-close to L2. Then we have that |L1−L2|<min(ϵ1,ϵ2). Since ϵ1,ϵ2 are arbitrary, we can expand this argument to an arbitrary number of arbitrarily small ϵ‘s to show that all the L’s must be equal.
My intuition is just so strong on this one, and I want to see whether I can extend my proof to cover it, or whether I actually need to just change approaches.
So, the way that I understand your argument, L ranges over the values L,L+ϵ,L+2ϵ,…,L+Nϵ. (Of course there is a circular dependency here but as far as I can tell this was what you were thinking.) Of course, all of these possible values of L are clearly distinct. I’m not really sure what your point is about what happens if you assume that a sequence is eventually close to two different numbers. I think part of the issue is that your proof is a proof by contradiction, but in a proof by contradiction you are only allowed to introduce the contradiction hypothesis once, not an arbitrary number of times.
The fundamental question that any proof of this theorem should answer is: given a bounded monotonic sequence, how do we find the L that it converges to? Your proof doesn’t appear to address this question at all, which makes me think you need a completely different idea.
Note: to address your “strong intuition” perhaps I should say that of course if you have two real numbers L1 and L2 such that for all ϵ1,ϵ2>0, there is a number that is ϵ1-close to L1 and ϵ2-close to L2, then L1=L2. But I don’t think this fact has the significance you want it to have in the broader argument.