Jump to content

discountbrains

Senior Members
  • Content Count

    180
  • Joined

  • Last visited

Everything posted by discountbrains

  1. I keep getting myself sidetracked. I'll go back to my very first original premise. That is, let (S,<*)={x: 0<*x<*1}. Such a set can be described and by its very nature has no minimum with respect to <*. I know this is extremely simple and unsophisticated. You admitted such a set existed. This is true for any ordering <* of course.
  2. Let the set (S, <*) = {x: 0<*x<*1} where S=(0,1). Then we have <* is a WO means if m is the min of S , S\{m} has no elements less than m and if n is min of S\{m} we can write S={m ,n, o, ...} where each of these successive elements is the minimum of the set left with the minimum of each previous set deleted. Like I showed before this is a countable set so its elements can all be listed in a table like Cantor did. Using his diagonal method we can produce a number which is clearly in (0,1), but is NOT in the list. Therefore <* is not an order relation on (0,1) because for all x,y in (0,1) we must have either x<*y or y<*x and the generated number can't be placed anywhere in the list. It remains to show S really contains no elements other than the above generated m, n, o,... numbers which is very similar to using the math induction theorem. Therefore, no WO for the reals exists.
  3. Someone said before all I was doing by using this Cantor diagonal method was proving what he did: that the reals are not countable. But, I am proving much more than this: That not all sets can be well ordered.
  4. Right, I should ask u how to write proofs. I actually majored in math. I have been planning to come back to this. I want to delete everything I might have said about finding numbers between the minimums of S, S\{a}, S\{a,b},... where a, b,... are the minimums of the respective sets. I will go back to my proof using Cantor's method way back in this thread. Before I showed that if (0,1) or [0,1] is well ordered then every element in it must be in some subset of it of the form {a, b, c,...}. Since we can construct a number using Cantor's diagonal method which clearly is in [0,1], but can't be found in any of these subsets and hence it fails the requirement that <* is an order relation. I ask again, as I did from the start, if anyone can tell me given any order relation <* I can't exhibit a set defined as {x: 0<*x<*1}. This set, (0,1), with respect to <* has no least element related to <*. Hence no <* well ordering can be found. This is so obvious I'll call it my axiom. For someone who understands how to write a proper proof as u suggest about yourself u sure jump to conclusions about me. It very well may be u, as with wtf, who doesn't quite grasp the true subtleness of this this subject.
  5. I used this so I could attempt a proof using a notion of '+' to show for any a, b in a subset S of the reals there exists an x in S between them contradicting a necessity for WO in my post way above that any WO must produce a set of exactly the same elements of any original subset S such that they have no other elements of S between them.....I was going to show a proof in (i), (ii), and (iii) ways. (the computer I was using was frustrating me with odd typing results). For my (iii) proof one can notice that for any element in a set it can be represented by a unique number 0.xxxx.... ,whatever, and the only way you can reorder them is make some digit of one greater than the same digit of the other. I once thought I could order the reals by writing: 0.1, 0.2,....0.01, .... 0.02,...etc A professor very quickly wrote 0.101010... and 0.010101... on his blackboard and asked which is greater? I knew I was stumped. In fact in any attempt to order any infinite string of numbers like this fails because there is no longer an order relation by definition, ie we must show either a<b or b<a which we can't do. My (i) statement in my post you reference is all that is really needed to be sufficient. Yes, AC says nothing about ordering at all, but once we are given any random order of objects we can assign numbers to order it. An example might be items on grocery store shelves or library books.
  6. Yes, I knew that when I wrote it. Just wanted to see if u could contradict me. I'm talking about an ordered field F which has 5 properties anti symmetric, transitive , etc AND for any x in F, 0<*x if a<*b a+*x<*b+*x and similarly for multiplication for all a and b in F. If we have a set S={x: a<*x} then a is the greatest lower bound for S a is not in S.A greatest lower bound is a min for S iff if is in S. Therefore S has no min with <*. Also by the definition of an ordered field above. for any S subset of F, S\{m} should contain a min, M, by your assumption there should be no elements in between them. But, by above there exists a z such that m+*z+*z=M and m+*z<*M which is a contradiction. For my 3rd proof I note that no matter what order for elements in F is possible every element can be assigned a a number such as 0.750004xxxx. or 0.xxx7xx....etc Lets suppose we the digits 1 thru 9 are ordered 17542...9 and we also take 0.xxx...7xxx...<*0.xxx2xxx... where the two digits are in the nth place. So, in order to compare all numbers with 7 and 2 in the same place any two unequal numbers in an mth place will cause the number to be between 0.xxx7xxx... and 0.xxx2xxx... depending on what the numbers are. This contradicts like above that a WO must separate the elements. The +* is a concoction of mine to model the'+' notion. Hopefully, I can fine tune what I said later. I hope you can tell what I'm saying from this presentation. BTW, where's WTF?
  7. First I see I need to add more detail. Suppose S is a subset of R S =(0,1) or S={x: 0 < x < 1} (usual ordering). <* is an order relation on S so x <*y <*z or y<*x, z<*y or any order holds for any x,y,z in S. 'a' above is strictly <* less than any element in S and all elements in S are greater than a. How are you going to find a min for <* in S? If you want to show me one I will be glad to look at it.
  8. I keep telling u over and over again I am exhibiting such a set: this set. Clearly this is not the natural numbers. Only one set needs to be exhibited that has no least element with <* for WO to fail.
  9. Just revisiting this thread now. I don't think I will go over everything above. I just recently concluded my argument of constructing new set S\{a} by continually deleting the min, a, from each previous set is flawed. I was trying to use an assumption to prove itself. I don't recall seeing u presenting anything showing my error-I have to grade my own work. All u did is claim I'm wrong and then said u showed proof I was wrong. I will state again that 'the reals cannot be Well Ordered' by the simple fact that for any order relation, ,<*, I choose, a set {x: a <*x<*b} can be constructed which clearly has no least element for <*. Can we not construct such a set? I believe I stated this at the very beginning.
  10. So, if I am getting it correctly u are separating out the rational numbers and placing them 1st. Then u have the irrationals. Where do u start with them? Maybe u could say 21/2, 31/2, ... Then what? I tried this stuff years ago and don't think it works. So, what u seem to be telling me is that by doing this u can identify a minimum for any set and u thus well ordered the reals without the AC. So, we don't need an axiom like this at all. If u could do this u ought to get the Clay Prize. Don't think it is offered for this because its considered unprovable. I wonder if some theorems that depend on the AC could work for just the sets you need and you need only talk about a finite number of sets. I need to try to find theorems that depend on the AC on the internet. I know I've seen one or two in my studies, but don't remember them.
  11. "1/2, 1/3, 1/pi, 1/e, 1/sqrt(2), and everything else stays exactly where it was. And in the reals at large, everything stays were it is. So it's the usual order on the reals; but within (0,1), the first few elements of the order are discrete, and the rest are in their usual dense order. And clearly you can do this trick with as many discrete elements at the beginning as you like. Finitely many discrete values. But also infinitely many. For example suppose we order (0,1) such that we start with an enumeration of the rationals: q1, q2, q3, q4, ... Then after all those, everything else stays the same. So we have an order that's not a well-order, and isn't dense, and starts with a countably long infinite sequence of discrete elements. So now with these examples in mind, we can see that even if the reals aren't well-ordered; your argument STILL does not work." Yes, your assumption is right, it would always be whatever the chosen order relation is. And, after all your nth number in the list we see we can generate an n+1th number (and of course we would have a 1st one) so this would be by math induction at least a countable number of sets. I'm wondering here where do you start with the first real number after you run out of your initial list? To add to what I said earlier if u claim <* happens to be in fact a well ordering then it therefore has the property of creating a discrete set of numbers which negates my claim this is analogous of saying the Bible says this is the way it is therefore other things can't be true.
  12. I made a mistake. You're right. When one considers the power set they're talking about distinct subsets. Here we are talking about the same subset. The only difference is the order of the elements is different. Yes, I know, I was a bit loose with my terminology about dense sets. I didn't consult my book. I really meant any two elements of the set has anther element between them. I'm left with needing to prove your ordering of my original set is impossible....If I can.
  13. OK, I see what's happening here. There is a subtle disagreement in our logic and my approach is unorthodox. At least I've never seen anything like it. My thought is: Given any nonempty, noncountable, subset of R that is dense in R ( (0,1) is an example) for any function or algorithem or whatever that produces an order relation, <*, that identifies a min for this subset another subset with this minimum deleted has no minimum for this <*. You say pf course it has a min because if the <* is a well ordering it will order all subsets like {a, b, c,...} and each min can easily be found. I believe the power set for R contains any kind of even unimaginable subsets of R and such a subset exist which implies there is at least one subset with no min no matter what the order. I defined this subset in a previous post. Maybe I need to go ahead and try to prove your discrete order can't exist. I'm still trying to modify one of my failed attempts to prove this. Or should it suffice to say clearly a set of the form I described exists?
  14. You are determined to find fault with my assertion. You say I'm starting off with one claim and then u accuse me of starting with the opposite claim. For answer to taeto, I believe I left going back to my original conclusion on physics forum. I'll have to go back and see what I said.
  15. wtf: I had a book called "Axiomatic Set Theory" I copied because it was out of print. I know where it is. I believe it contains a lot of the technical stuff u'r talking about such as ZFC set theory models etc. I used to study it. I take it it was the gold standard on set theory and meta mathematics. Why didn't u tell me this 50 posts ago? Any nonusual order <* might order the interval S = (0,1) like for example, <0.5, 0.0000002, 0.46, a, b,...> where a ∈ (0.2, 0.4), b ∈ (0.75, 0.54)-reverse order. If σ is the min for S then there is no min for the set I mentioned several times above for <*. This is true no matter how the new ordered set looks. That's just the way it is even though its not consistent with pretty well established set theory for years. I have to add u at one time claimed I declared the reals to be well ordered and another time u maintain I say the opposite. I just can't win.
  16. No, no, I didn't say that at all. I think u'r the one confusing things. Since u take everything can be WO'd as dogma u think any statement not consistent with that must be negating it. I'm only testing the theory. I'll look up the link. Yes, I see what goes on on these boards. They DO NOT like challenges to conventional wisdom. They like questions from people less well versed in the subject so they can appear smart in answering. That stack exchange I don't even visit anymore. Oddly, supposedly intelligent people act literally like 10 year olds- so frustrating..
  17. "YOU CLAIM there is no well-order on the reals". You say I begin by stating something as fact and then use the statement to prove itself; thus, making a circular argument. I don't know how I;m doing that. I just went through a simple illustration to show that there exists at least one set that doesn't have a min with any order relation. This is like its established that x is defined to have certain properties if its divisible by 3 and I show x is not divisible by 3. FWIW, I would like u to look at a post I put on Physics Forum on this scienceforum board. I submitted a flaw in Einstein's special relativity. I got no responses contradicting me; all I got were personal attacks. Haven't looked at the board for months though. I used very simple straightforward arithmetic. I don't say the whole theory is wrong. Fatal flaw?
  18. "My friend @discountbrains, every nonempty subset of a well-ordered set is well-ordered by that same order. When you understand this you will be enlightened." You are being a great help to me. You are helping me refine my thoughts and I'm gradually sneaking up on a proper statement of my theorem. I'll change my statement to: There exist some subsets of the reals that don't have a minimum for any order relation. This will keep you from saying I declared R is well ordered by some <* which keeps you from claiming what follows in your argument. Then I just proceed as I have stated many times above. I'll just say if S has a <*min the rest follows. Are u stating that if a set is WO the order produces a set like <1, 2, 3, 4,...>? If so this makes the set into a countable set and if the set is ((0,1), <) there are far more numbers that are not accounted for so we don't know whether they're less than the min or what. Don't know if I ever said what motivated me to make my claim. I used to go into little spurts from time to time over the years to try to come up with a WO for the reals and concluded that for any order relation definition there would always be a set satisfying exactly the opposite definition.
  19. I have long been aware the numbers could be scattered all over the place. That's why I wrote S\(a) = {x: x ∈ S and a <* x, a ≠ x} and not as an interval. EDIT to my above post: I should check with my analysis book, but 'a' being the minimum of S makes it the greatest lower bound of {x: x ∈ S and a <* x, a ≠ x} which means there is no l. b. for {x: x ∈ S and a <* x, a ≠ x} greater than a, thus {x: x ∈ S and a <* x, a ≠ x} has no minimum with respect to <*. This is what my argument hangs on. OK, I SEE WHAT U ARE SAYING. You're saying if we assume <* to be a WO of reals than it can order (0,1) as you said. I can accept this and this leads to not my result. But, I am saying it also leads to my result which leads to a contradiction.
  20. I should have stuck to my original argument at the very start. You people got me side tracked; its all your fault. I started with: consider the subset of the reals S = ((0,1), <), < the usual order. If R is well ordered there must be a number a in S such that a ≤* x where x is any number in S and <* is the well ordering. Now if we delete a from S we have {a}\S = {x: x ∈ S and a <* x, a ≠ x}. BUT, we can plainly tell {a}\S contains no <* minimum number! We claimed <* well orders R, but clearly {a}\S ⊂ R and it has no least element which contradicts our assumption <* WOs R. NOTE: if <* is an order relation on R it applies to all elements in R; therefore, if <* is the order chosen for S it also applies to {a}\S. You can't pick a different order relation to give you what you want for every set you're considering. We defined {a}\S using <* and its claimed here that WO guarantees {a}\S has a minimum and the AC guarantees it. But, we can't find it! I don't have to show S exists; its already the same numbers of the interval (0,1) with we started with; its just reordered by our supposed <* order relation. I'll get to your latest questions, but the above is the most straightforward proof. PLEASE NOTE: All I need to do is show there is one set that no matter which order you choose no least element (minimum) can be found. wtf seems to think I need to prove the opposite (apparently) that all subsets have no minimum; hence, he keeps bringing up natural and rational numbers.
  21. Yeah, I know. Yeah, I know. I just threw that in. It seems to me though that whatever some sort of addition + means x + (-x) = 0 and 2x should be x + x.
  22. I discovered my Cantor type proof has some problems. I'll repeat my (a + b)/2 proof: Let S =(0,1), R being well ordered means there's an a which is a min(S, <*). Consider {a}\S, There is a minimum, b, for {a}\S and there can't be any x in S with a <* x <* b. Now, (a + b)/2 ∈ (S, <) so a <*(a + b)/2 and it can't be less than b; therefore, it must be greater than b. We must have b <* (a + b)/2. Now for some arithmetic: Suppose b = 0.4 and 2b = -2 and suppose b = 6 + 7 +5 where + = +*. In my case this doesn't matter because b + b <* a + b is the same as b + (b - b) <* a. b - b = 0 and b + 0 = b. Therefore, b <* a which is a contradiction. Finally this says assuming all subsets of the reals can be ordered so they have a least element leads to a contradiction. I'll think about your rational number thing. I like my latest reordering proof. I need to clean it up and make sure its perfectly clear. The problem with the Cantor type proof is I can show there is a countable set of minimums for subsets of S = (0,1) and another number exist in S that's not in this set of minimums, but there may need not be any reason why it should be in the set of minimums.
  23. I'm going to prove the reals cannot be well ordered another way: Let S be any subset of R such that for any a,b ∈ S there is an x a < x < b. Let ai be the min of S since its claimed every subset has a minimum. Construct {ai }\S. There is also a min for {ai}\S. Call it ai+1. There are x, y, z, ... such that If these two ak s are minimums of S and {ai }\S, x, y, z,... can't be between them; there are no x such that ai <* x <* ai+1. Therefore, any such x, y, z, ... with ai < x < y <z,...< ai+1 must be greater than ai+1 . But, what this does is reverse every element of any subset S or R. That is, now for any x, y, z,... the order is now z <* y <* x or I'll write .... <* z <* y <* x. This says any time we try to WO R we can't avoid merely reversing the order and the numbers are dense in R as before, yet well ordering requires them to be separated. And, we get another contradiction here. Its left to the reader to show any required reordering of the numbers from the usual order < results in a totally reverse order. Try anytime you have a < x < b for any a and b moving x such that a <* b <* x and see what you get. Moderators 3253 19504 posts Location: 珈琲店 R I suspect you are mixing up two different idioms : "singing from the same hymn sheet /book" and "to be on the same page Oh, no, no, No! Think about it, everyone in church has their hymn books out and are singing and you got someone singing louder than everyone else and in conflict with everyone because they're on the wrong page. I think this is hilarious.
  24. I believe we are "not singing on the same page" (the original expression which people don't seem to get and is actually humorous to visualize). Maybe I should generalize my subset S from being (a,b) to any subset. Here is your example S = <1, 2, 3, 4, ....> in the usual order where 1 < 2 < 3 < 4 <... in this order I write (1 + 2)/2 = 3/2, (2 + 3)/2 = 5/2, ...None of these numbers are in S. You write S = < 1, 3, 2, 4, 5,...> which of course is well ordered. All my (a + b)/2 were calculated using the usual order and all come out as fractions and therefore not in S so we can't talk about their order in S. Early on I stipulated (a + b)/2 must be a member of the set S. I'm taking S to be the very same set (a,b) as it was with the usual order. Every x in S is the very same x as it was originally. Order doesn't change that. I'm just playing with your example here; I'm not trying to make any further point about what I previously stated. I keep believing I can come up with yet another way to prove my original claim. I welcome seeing more counterexamples.
×
×
  • Create New...

Important Information

We have placed cookies on your device to help make this website better. You can adjust your cookie settings, otherwise we'll assume you're okay to continue.