Poset

From Maths
Revision as of 14:09, 19 February 2016 by Alec (Talk | contribs) (Created page with "{{Stub page}} ==Definition== A ''poset'' or ''partially ordered set'' is a tuple consisting of a set, {{M|X}} and a partial ordering, {{M|\preceq}}, on {{M|X}}, t...")

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search
(Unknown grade)
This page is a stub
This page is a stub, so it contains little or minimal information and is on a to-do list for being expanded.

Definition

A poset or partially ordered set is a tuple consisting of a set, [ilmath]X[/ilmath] and a partial ordering, [ilmath]\preceq[/ilmath], on [ilmath]X[/ilmath], then:

  • [ilmath](X,\preceq)[/ilmath] is a poset

References

(Unknown grade)
This page requires references, it is on a to-do list for being expanded with them.
Please note that this does not mean the content is unreliable, it just means that the author of the page doesn't have a book to hand, or remember the book to find it, which would have been a suitable reference.
The message provided is:
I know Introduction to Category Theory has the definition, Analysis (Maurin) might too!