doronshadmi
Penultimate Amazing
- Joined
- Mar 15, 2008
- Messages
- 13,320
Curiosity is clearly not one of your features , in this case.(Curious, though.
Curiosity is clearly not one of your features , in this case.(Curious, though.
If observed only from |N|.The valuation of 0.999... stands at 1.
I do not redefine anything. My argument is true if |n>1| < |N| < |P(N)| < |P(P(N))| < |P(P(P(N)))| < |P(P(P(P(N))))| < ... is true.Doron, you do not get to redefine the meanings
If observed only from |N|.
Dear jsfisher.Doesn't matter how it is "observed." Doron, you don't get to redefine mathematics to accommodate your personal confusion.
Dear jsfisher.
This is the beautiful thing here, I do not redefine anything.
Dear jsfisher.
This is the beautiful thing here, I do not redefine anything.
Sure I did not.Sure you did.
Not at all, it is based on the well defined mathematical fact that |n>1| < |N| < |P(N)| < |P(P(N))| < |P(P(P(N)))| < |P(P(P(P(N))))| < ...Your attempt to "observe" it differently is a redefinition.
Even in this simple case you fail. Observing 4 from 5 simply enables one to know that 5 > 4. There is nothing in this observation that can be interpreted as if 4 is 5.I can observe 4 differently as 5; that doesn't make it 5.
They have a function in establishing the value of 0.999..., but it clearly not in the scope of one that interpretes 4 as 5.Moreover, your appeal to cardinal numbers is unwarranted since they have no function in establishing the value of 0.999....
Not at all, it is based on the well defined mathematical fact that |n>1| < |N| < |P(N)| < |P(P(N))| < |P(P(P(N)))| < |P(P(P(P(N))))| < ...
All you have to do is to deduce a given mathematical framework in terms of cardinality, in order to provide a given solution.You keep repeating that, but you never actually show how it (whatever "it" actually is) is based on those inequalities.
How do you connect Cantor's Theorem to the definition for limits in such a way that 0.999... and 1 are not identical?
All you have to do is to deduce a given mathematical framework in terms of cardinality, in order to provide a given solution....You keep repeating that, but you never actually show how it (whatever "it" actually is) is based on those inequalities.
How do you connect Cantor's Theorem to the definition for limits in such a way that 0.999... and 1 are not identical?
A given solution that is satisfied by at least some cardinality > |N|, is not satisfied by some cardinality ≤ |N|.
A given solution that is satisfied by at least some cardinality > |N|, is not satisfied by some cardinality ≤ |N|.
I am not entirely sure why the at least is emphasized by an underscore...
The greater than symbol already signifies this.
And as for the logic... this is the same as stating: If it is not black, then it is a different color...
This "it" is simply cardinality, and it measures the minimal needed values that satisfy a given value, for example:So you are unable to make clear whatever "it" actually is.
Telling us all what it's based on and could be deduced from is just hand-waving without ever defining "it".
It is about the ability to satisfy a given value, as explained above.And this is relevant to the definition for limits just how?
This "it" is simply cardinality, and it measures the minimal needed values that satisfy a given value
for example:
0.9+0.09+0.009 that has |3| values
...can't satisfy value 1
...and in this case at least 0.9+0.09+0.009+... that has |N|+1 = |N| values, satisfies value 1.
In case that the minimal needed values that satisfy 1 is at least |P(N)|+1 = |P(N)|, 0.9+0.09+0.009+... that has |N|+1 = |N| values, can't satisfy value 1.
...
It is about the ability to satisfy a given value, as explained above.
The bizarre thing here is actually your mathematical framework that excludes the different values of cardinality as an essential factor of a given solution.(By the way, your assertion of |N| + 1 terms are involved is just bizarre.
that simply excludes the different values of cardinality (and in this case, transfinite cardinality) as an essential factor of a given solution.0.9 + 0.09 + 0.009 + ... is an infinite series. The only thing important in determining the value of the series is the limit of the related sequence of partial summations. No infinity is needed to establish that the limit is 1 and thus 0.999... is identical to 1.
And you aren't even going to ask what it means to satisfy a solution, now are you? Nor how a solution might be satisfied by a cardinal number, either, right?
![]()
More accurately, 0.9 + 0.09 + 0.009 + ... is an infinite series of countable |N| values and it is < 1 if it used among an infinite series of uncountable |P(N)| values.jsfisher said:0.9 + 0.09 + 0.009 + ... is an infinite series.
Just to be technically accurate, the limit of 0.999... stands at 1. No matter how many 9's you add to the string, the sum will never add up to 1.0.999... stands at 1.
You can enjoy your ∞ hand-waving as much as you like, which uses each cardinal number separately from the other cardinal numbers, but you will not find my framework under your hand-waving.
As your diagram in http://www.internationalskeptics.com/forums/showpost.php?p=10334974&postcount=158 showed, this is true only as long as N is some finite subset of the set of natural numbers. You haven't demonstrated this to be true for a countably infinite set of natural numbers.My terms are rigorously defined by the fact that |n>1| < |N| < |P(N)| < |P(P(N))| < |P(P(P(N)))| < |P(P(P(P(N))))| < ...