Definition:Poset
Contents |
Definition
A poset (convenient abbreviation for partially ordered set) is a relational structure $\left({S, \preceq}\right)$ such that $\preceq$ is a partial ordering.
The poset $\left({S, \preceq}\right)$ is said to be partially ordered by $\preceq$.
In general, a poset can also be a relational structure $\left({S, \preceq}\right)$ such that $\preceq$ is an ordering which may or may not be partial.
Alternative Name
Some sources call this an ordered set, and prefer not to use the term partial.
However, according to ProofWiki house style, the advantage of being able to specify a difference between the various types of ordering outweighs any possible perceived inaccuracy in terminology.
Thus, on ProofWiki, poset and partially ordered set are the names to be used.
Also see
References
- ↑ T.S. Blyth: Set Theory and Abstract Algebra (1975):
"What we have defined as an order on a set many authors call a partial order and what we have called an ordered set is often called a partially ordered set or poset. As there is nothing which can even remotely be called 'partial' in the definition of an order relation, we shall not use this terminology."
Sources
- Paul R. Halmos: Naive Set Theory (1960)... (previous)... (next): $\S 14$: Order
- A.N. Kolmogorov and S.V. Fomin: Introductory Real Analysis (1968): $\S 3.1$
- T.S. Blyth: Set Theory and Abstract Algebra (1975): $\S 7$
- Keith Devlin: The Joy of Sets: Fundamentals of Contemporary Set Theory (1993): $\S 1.5$
- Stanford handout on Lattice theory