Results 1 to 4 of 4

Math Help - Partial ordering

  1. #1
    Newbie
    Joined
    Jun 2011
    Posts
    18

    Partial ordering

    Let X be the set of all real-valued functions x on the interval [0,1], and let  x\leqslant y mean x(t) \leqslant y(t) for all t\in [0,1] . show that this defines partial odering. Is it a total odering? does X have a maximal elements?
    Follow Math Help Forum on Facebook and Google+

  2. #2
    Super Member girdav's Avatar
    Joined
    Jul 2009
    From
    Rouen, France
    Posts
    678
    Thanks
    32
    What did you try? What do you have to show?
    Follow Math Help Forum on Facebook and Google+

  3. #3
    Newbie
    Joined
    Jun 2011
    Posts
    18
    yes i tried...but i could get started...please help me my friend
    Follow Math Help Forum on Facebook and Google+

  4. #4
    Super Member girdav's Avatar
    Joined
    Jul 2009
    From
    Rouen, France
    Posts
    678
    Thanks
    32
    Let x,y,z:\left[0,1\right]\rightarrow \mathbb R. You have to show that
    a) x\leqslant x;
    b) If x\leqslant y and y\leqslant x then x(t)=y(t)\, \forall t\in:\left[0,1\right];
    c) If x\leqslant y and y \leqslant z then x\leqslant z.
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. partial ordering, linearization
    Posted in the Discrete Math Forum
    Replies: 1
    Last Post: March 25th 2010, 07:13 AM
  2. Partial Ordering: Strings
    Posted in the Discrete Math Forum
    Replies: 0
    Last Post: February 25th 2010, 09:33 PM
  3. well-ordering
    Posted in the Number Theory Forum
    Replies: 1
    Last Post: June 10th 2009, 11:24 AM
  4. partial ordering
    Posted in the Discrete Math Forum
    Replies: 0
    Last Post: December 7th 2008, 08:55 AM
  5. well ordering
    Posted in the Discrete Math Forum
    Replies: 1
    Last Post: July 17th 2008, 11:16 AM

Search Tags


/mathhelpforum @mathhelpforum