Order (relation): Difference between revisions

From Citizendium
Jump to navigation Jump to search
imported>Richard Pinch
(added associated concepts intervals, cover)
imported>Richard Pinch
(→‎Associated concepts: Upper and lower bound, maximum and minimum)
Line 27: Line 27:


We say that ''b'' ''covers'' ''a'' if the interval <math>[a,b] = \{a,b\}</math>: that is, there is no ''x'' strictly between ''a'' and ''b''.
We say that ''b'' ''covers'' ''a'' if the interval <math>[a,b] = \{a,b\}</math>: that is, there is no ''x'' strictly between ''a'' and ''b''.
Let ''S'' be a subset of a ordered set (''X'',&lt;).  An ''upper bound'' for ''S'' is an element ''u'' of ''X'' such that <math>u \ge s</math> for all elements <math>s \in S</math>.  A ''lower bound'' for ''S'' is an element ''l'' of ''X'' such that <math>\ell \ge s</math> for all elements <math>s \in S</math>.  In general a set need not have either an upper or a lower bound. 
A ''maximum'' for ''S'' is an upper bound which is in ''S''; a ''minimum'' for ''S'' is a lower bound which is in ''S''.

Revision as of 15:07, 29 November 2008

This article is a stub and thus not approved.
Main Article
Discussion
Related Articles  [?]
Bibliography  [?]
External Links  [?]
Citable Version  [?]
 
This editable Main Article is under development and subject to a disclaimer.

In mathematics, an order relation is a relation on a set which generalises the notion of comparison between numbers and magnitudes, or inclusion between sets or algebraic structures.

Throughout the discussion of various forms of order, it is necessary to distinguish between a strict or strong form and a weak form of an order: the difference being that the weak form includes the possibility that the objects being compared are equal. We shall usually denote a general order by the traditional symbols < or > for the strict form and ≤ or ≥ for the weak form, but notations such as ,; ,; , are also common. We also use the traditional notational convention that .


Partial order

The most general form of order is the (strict) partial order, a relation < on a set satisfying:

  • Irreflexive:
  • Antisymmetric:
  • Transitive:

The weak form ≤ of an order satisfies the variant conditions:

  • Reflexive:
  • Antisymmetric:
  • Transitive:

Total order

A total or linear order is one which has the trichotomy property: for any x, y exactly one of the three statements , , holds.

Associated concepts

If ab in an ordered set (X,<) then the interval

We say that b covers a if the interval : that is, there is no x strictly between a and b.

Let S be a subset of a ordered set (X,<). An upper bound for S is an element u of X such that for all elements . A lower bound for S is an element l of X such that for all elements . In general a set need not have either an upper or a lower bound.

A maximum for S is an upper bound which is in S; a minimum for S is a lower bound which is in S.