Results 1 to 2 of 2

Math Help - Relation

  1. #1
    Newbie
    Joined
    Apr 2010
    Posts
    9

    Relation

    Let A be a set with a partial order R. For each a E A, let Sa={xEa:xRA} the section of a. Let F={Sa:aEA}. Then F is a subset of P(a) and thus may be partially ordered by (subset symbol).

    Prove: if Sx is the least upper bound for {Sb:bEB} then B is subset of A and x is the least upper bound for B.

    So this is how i started: Suppose Sx is the least upper bound. Then Sx is an upper bound for B and xRb for every upper bound b for B. Hence xEb Thus B is subset of A since xEa. This is where i got stuck

    Describe explicitly the sets Sa, aEA, when A = R (the set of real numbers) and the partial order R is (less or equal symbol) " In this case show that set inclusion on F is a linear order. Do the same when A = N (the set of natural numbers), and the partial order R is "divides"." In this case show that set inclusion on F is not a linear order.
    i have no clue how to this

    Any help would be great
    thanks
    Follow Math Help Forum on Facebook and Google+

  2. #2
    Newbie
    Joined
    Apr 2010
    Posts
    9
    please help
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Relation
    Posted in the Differential Geometry Forum
    Replies: 14
    Last Post: October 18th 2011, 07:55 AM
  2. Replies: 1
    Last Post: April 7th 2011, 12:46 AM
  3. Replies: 1
    Last Post: March 1st 2010, 08:24 AM
  4. Relation ( Equivalence Relation)
    Posted in the Discrete Math Forum
    Replies: 8
    Last Post: December 5th 2008, 09:55 AM
  5. relation ~
    Posted in the Advanced Math Topics Forum
    Replies: 0
    Last Post: May 21st 2005, 01:58 AM

Search Tags


/mathhelpforum @mathhelpforum