PlanetMath: partial order

(more info)

Math for the people, by the people.

Main Menu

sections Encyclopædia
Papers
Books
Expositions

meta Requests (210)
Orphanage
Unclass'd (1)
Unproven (473)
Corrections (37)
Classification

talkback Polls
Forums
Feedback
Bug Reports

downloads Snapshots
PM Book

information News
Docs
Wiki
ChangeLog
TODO List
Legalese
About

Entry average rating: No information on entry rating

partial order

(Definition)

A partial order (often simply referred to as an order or ordering) is a relation $\leq\:\subset A\times A$ that satisfies the following three properties:

Reflexivity: $a \leq a$ for all $a\in A$
Antisymmetry: If $a \leq b$ and $b \leq a$ for any $a, b\in A$ , then
Transitivity: If $a \leq b$ and $b \leq c$ for any $a, b, c\in A$ , then $a \leq c$

A total order is a partial order that satisfies a fourth property known as comparability:

Comparability: For any $a,b\in A$ , either $a\leq b$ or $b\leq a$ .

A set and a partial order on that set define a poset.

"partial order" is owned by mathcam. [ full author list (2) | owner history (1) ]

(view preamble)

Other names:

order, partial ordering, ordering

Keywords:

relation, total order, transitivity, reflexivity, antisymmetry

Attachments:: inductively ordered (Definition) by rspuzio

Log in to rate this entry.
(view current ratings)

Cross-references: poset, comparability, total order, transitivity, antisymmetry, reflexivity, properties, relation
There are 181 references to this entry.

This is version 14 of partial order, born on 2001-10-06, modified 2007-11-04.
Object id is 123, canonical name is PartialOrder.
Accessed 25874 times total.

Classification:

AMS MSC:

06A06 (Order, lattices, ordered algebraic structures :: Ordered sets :: Partial order, general)

Pending Errata and Addenda

None.[ View all 5 ]

Discussion

forum policy

Interact