Jump to content

Recommended Posts

Posted

My first of several proofs:

Consider any total linear ordering, <*, of the reals. To make it simpler consider <* for S={x: 0<x}. At this point we don't know if <* is a well ordering or not. I will show by math induction that a well ordering of S must produce a countable number of minimums for a particular collection of subsets of S. Then I'll show all numbers, z, must be in this collection or set of minimums. Thus, the conclusion must be that if R can be well ordered it must be a countable set and we know this is not true.

The above is a preliminary test before going further to make sure my topic does not get closed

Guest
This topic is now closed to further replies.
×
×
  • 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.