1. Limited time only! Sign up for a free 30min personal tutor trial with Chegg Tutors
    Dismiss Notice
Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

Well ordered sets

  1. Jun 5, 2012 #1
    1. The problem statement, all variables and given/known data
    Show that for two well ordered sets, (A, R) and (B, S), the disjoint union of A and B will be well ordered by the relation [tex] R \cup S \cup A \times B [/tex].

    3. The attempt at a solution
    ....
    I honesly dont know how to start at this one..
     
  2. jcsd
  3. Jun 5, 2012 #2
    Well lets start by describing the ordering that they suggest.

    An ordering is a relation which is a set of ordered pairs. If (x,y) belongs to the relation then x<y. So we have the set of ordered pairs R union S union AxB. AxB is the set (a,b) where a is from A and b is from B. By this ordering all elements of A are less than all elements of B.

    So given any two elements of A union B, can you compare them? If so, then this is a total ordering.

    Given any subset of A union B, is there a least element? Think of it in terms of the number line. All the elements of A are to the left of all the elements of B. And A and B are themselves well ordered.

    Hope that helps.
     
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook




Similar Discussions: Well ordered sets
  1. Well Ordered sets (Replies: 8)

Loading...