User talk:DoronSahdmi: Difference between revisions
DoronSahdmi (talk | contribs) Some notions |
DoronSahdmi (talk | contribs) |
||
Line 65: | Line 65: | ||
1 <--> 2 |
1 <--> 2 |
||
2 <--> |
2 <--> |
||
… |
… |
||
1 <--> 2 |
1 <--> 2 |
||
2 <--> 4 |
2 <--> 4 |
||
⚫ | |||
3 <--> |
|||
⚫ | |||
… |
… |
||
1 <--> 2 |
1 <--> 2 |
||
2 <--> 4 |
2 <--> 4 |
||
3 <--> 6 |
3 <--> 6 |
||
⚫ | |||
4 <--> |
|||
⚫ | |||
⚫ | |||
⚫ | |||
… |
… |
||
1 <--> 2 |
1 <--> 2 |
||
2 <--> 4 |
2 <--> 4 |
||
3 <--> 6 |
3 <--> 6 |
||
4 <--> 8 |
4 <--> 8 |
||
5 <--> 10 |
5 <--> 10 |
||
6 <--> 12 |
6 <--> 12 |
||
7 <--> |
7 <--> |
||
8 <--> |
8 <--> |
||
9 <--> |
9 <--> |
||
10 <--> |
10 <--> |
||
11 <--> |
11 <--> |
||
12 <--> |
12 <--> |
||
... |
... |
||
Since each Natural number is not less than a cardinal and an ordinal that is clearly distinguished from the rest of the Natural numbers, and since each member of a proper subset is also a member of the set, there cannot be a bijection between a set and is proper sub-set (as shown above). |
Since each Natural number is not less than a cardinal and an ordinal that is clearly distinguished from the rest of the Natural numbers, and since each member of a proper subset is also a member of the set, there cannot be a bijection between a set and is proper sub-set (as shown above). |
Revision as of 16:52, 4 November 2006
Image tagging for Image:No 1.jpg
Thanks for uploading Image:No 1.jpg. The image has been identified as not specifying the source and creator of the image, which is required by Wikipedia's policy on images. If you don't indicate the source and creator of the image on the image's description page, it may be deleted some time in the next seven days. If you have uploaded other images, please verify that you have provided source information for them as well.
For more information on using images, see the following pages:
This is an automated notice by OrphanBot. For assistance on the image use policy, see Wikipedia:Media copyright questions. 21:09, 11 September 2006 (UTC)
Hello Moderator,
My name is Doron Shadmi and I am the source and creator of this image.
Thank you.
New mathematical framework
If you really want to discuss your "new framework" and its impact on 0.9999...=1, feel free to do so on my talk page. I would appreciate an explanation of some of your definitions, actually starting with definition 1:
"Definitinon 1: A is a common property of x xor y."
What is defined here? A? Being a common property of x xor y? What is "common property of x xor y" supposed to mean? I would believe "x xor y" to be a statement which is either true or false, but then what's a common property of a statement? On an even more basic level, what are x and y (and A, if that's not what is being defined)?
But I do believe that right now, your new framework is not yet ready for either publication in a journal or Wikipedia; thus, if I may offer a piece of advice, I wouldn't bother the experts at the arguments page. Yours, Huon 20:24, 14 September 2006 (UTC)
Some notions
A person cannot be considered as a professional mathematician if he cannot distinguish between a mathematical object and its representation.
According to the Axiomatic Set theory, a non-empty Set is a collection of objects, where each object is clearly distinguish from the rest of the objects.
This fundamental attitude of being clearly distinguished exists in the foundations of the axioms that define any member on the real-line, no matter if it is Natural, Rational or Irrational number.
In other words, there is an unbreakable connection between being clearly distinguished and the ability to define the quantity and location (order) that each member has along the real-line, no matter what representation method is used.
For example, by using the place value representation method we can represent the real-line's member PI in infinitely many ways that are different from each other by the their base value. No one of these representations is the mathematical object PI.
If we wish to prove something about the mathematical objects, we have to use an extra care not to mix up between them and any possible representation of them.
By using this insight, let us re-examine the famous Cantor's second diagonal argument.
As a fundamental approach, we have to use the minimal condition that exists in some collection of mathematical objects that is considered as a non-empty set. This minimal condition is exactly the property of each mathematical object, which enables to find its exact quantity and location (order) along the real-line.
In that case we actually can represent each real-line's member by a finite and unique string of symbols (as we did in the case of PI).
In that case (when using only the minimal condition as mentioned above) Cantor's second diagonal argument does not hold.
Furthermore, the necessity to use infinitely many symbols in order to represent a member like PI, actually tells us that we use an inaccurate representation method for some irrational number (the reason is very simple, because each base value in the place value method is a natural number > 1, and no irrational number can be represented by a finite string that is the result of a ratio that is based on natural numbers).
Cantor ignored these simple facts, and as a result its argument is based on a representation method and not on the mathematical objects themselves, in this case.
Some claims that the non-repeated pattern of infinitely-many symbols is an inherent property of any irrational number. In that case the exact value of an irrational number cannot be satisfied, which contradicts the basic notion of the Set concept (every set's member is A priori clearly distinguished from the rest of the members).
When defining the membership relations between non-empty sets, we have to understand each definition that is used in some argument, before we use it.
For example, if a proper sub-set is any non-empty set that fully included in some set, than each member of the sub-set is a member of the set.
If we examine the mapping between a set and its proper sub-set, then if some member is written in the column that represents the proper sub-set's members, it must be written also in the column that represents the set's members.
Furthermore, since any number is not less then a quantity and an order along the real-line, we have no choice but to write down in the side that represents the set's members, every set's member, which is less or equal to the number that was written in the proper sub-set column. For example let us re-examine the mapping that exists between the set of Natural numbers and its proper subset of even numbers.
If the set of even numbers is a proper subset of the set of Natural numbers, then each even number is also a member of the set of Natural numbers.
In that case, if some even number is in the proper sub-set of the even numbers, it is also in the set of the Natural numbers, and we have no choice but to write down in the column that represents the Natural numbers, any single Natural number that is less or equal to the even number that was written in the side that represents the even numbers:
1 <--> 2
2 <-->
…
1 <--> 2
2 <--> 4
3 <-->
4 <-->
…
1 <--> 2
2 <--> 4
3 <--> 6
4 <-->
5 <-->
6 <-->
…
1 <--> 2
2 <--> 4
3 <--> 6
4 <--> 8
5 <--> 10
6 <--> 12
7 <-->
8 <-->
9 <-->
10 <-->
11 <-->
12 <-->
...
Since each Natural number is not less than a cardinal and an ordinal that is clearly distinguished from the rest of the Natural numbers, and since each member of a proper subset is also a member of the set, there cannot be a bijection between a set and is proper sub-set (as shown above).
In the case of the proper sub-set of even numbers and the set of Natural numbers, there exists a permanent ratio of 1 to 2 that prevents the bijection.
There can be a bijection between to non-finite set, only if they are disjoined in any recursion level.
Some claims that the property of a set is the result of the membership between members, so a set's property defined by its membership. But as I showed, there is a property which is not the result of the membership but it is actually its reason, and this reason is based on the A prioristic uniqueness of each set's member, which defines A priori the property of any non-empty set.