Convex subset

From Encyclopedia of Mathematics
Revision as of 18:15, 16 October 2014 by Richard Pinch (talk | contribs) (Category:Order, lattices, ordered algebraic structures)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

of a partially ordered set

A subset containing with any two elements $a$ and $b$ the entire interval $[a,b]$ (cf. Interval and segment).


A definition not involving the notion of interval is: A subset $A$ of a partially ordered set is convex if $a\leq b\leq c$ and $a,c\in A$ imply $b\in A$.

In the real line (with its usual ordering) the convex subsets are exactly the connected subsets (for the usual topology). This need not hold for more general ordered topological spaces. However, if a partially ordered set is equipped with the interval topology (cf. Order topology), then its connected subsets are convex.

How to Cite This Entry:
Convex subset. Encyclopedia of Mathematics. URL:
This article was adapted from an original article by L.A. Skornyakov (originator), which appeared in Encyclopedia of Mathematics - ISBN 1402006098. See original article