The Math Forum

Search All of the Math Forum:

Views expressed in these public forums are not endorsed by NCTM or The Math Forum.

Math Forum » Discussions » sci.math.* » sci.math

Notice: We are no longer accepting new posts, but the forums will continue to be readable.

Topic: Mueckenheim's Theorema Egregium
Replies: 5   Last Post: Aug 19, 2014 12:35 PM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]

Posts: 10,821
Registered: 6/8/11
Re: Mueckenheim's Theorema Egregium
Posted: Aug 19, 2014 12:25 PM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

In article <>, wrote:

> But if actual infinity is assumed, then infinite sets can be exhausted. Then
> |N is exhausted before Q+.

Name one member of Q+ that does not get matched to a member of N when
Q+ is well-ordered by:

Here is a straightforward way to construct a well-ordering of all
positive rationals. Write each one as p/q where naturals p and q have no
common factor (other than 1). Order them by ascending value of (p+q),
then within each set of p+q values, order by ascending p.

So you get: 1/1, 1/2, 2/1, 1/3, 3/1, 1/4, 2/3, 3/2, 4/1...
A first member, and for each a unique successor, just like N.

You can then do the whole set of rationals by putting zero at the start
and interleaving each negative after its corresponding positive.
"Mit der Dummheit kampfen Gotter selbst vergebens." (Schiller)

Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© The Math Forum at NCTM 1994-2018. All Rights Reserved.