Namespaces
Variants
Actions

Difference between revisions of "Convex subset"

From Encyclopedia of Mathematics
Jump to: navigation, search
(Importing text file)
 
(Category:Order, lattices, ordered algebraic structures)
 
(One intermediate revision by one other user not shown)
Line 1: Line 1:
 +
{{TEX|done}}
 
''of a partially ordered set''
 
''of a partially ordered set''
  
A subset containing with any two elements <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/c/c026/c026380/c0263801.png" /> and <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/c/c026/c026380/c0263802.png" /> the entire interval <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/c/c026/c026380/c0263803.png" /> (cf. [[Interval and segment|Interval and segment]]).
+
A subset containing with any two elements $a$ and $b$ the entire interval $[a,b]$ (cf. [[Interval and segment|Interval and segment]]).
  
  
  
 
====Comments====
 
====Comments====
A definition not involving the notion of interval is: A subset <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/c/c026/c026380/c0263804.png" /> of a partially ordered set is convex if <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/c/c026/c026380/c0263805.png" /> and <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/c/c026/c026380/c0263806.png" /> imply <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/c/c026/c026380/c0263807.png" />.
+
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|Order topology]]), then its connected subsets are convex.
 
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|Order topology]]), then its connected subsets are convex.
 +
 +
[[Category:Order, lattices, ordered algebraic structures]]

Latest revision as of 18:15, 16 October 2014

of a partially ordered set

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


Comments

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: http://encyclopediaofmath.org/index.php?title=Convex_subset&oldid=12474
This article was adapted from an original article by L.A. Skornyakov (originator), which appeared in Encyclopedia of Mathematics - ISBN 1402006098. See original article