# Category:Convex Sets (Order Theory)

Jump to navigation
Jump to search

This category contains results about **Convex Sets (Order Theory)** in the context of **Order Theory**.

Definitions specific to this category can be found in Definitions/Convex Sets (Order Theory).

A subset $A$ of an ordered set $\struct {S, \preceq}$ is **convex (in $S$)** if and only if:

- $\forall x, y \in A: \forall z \in S: x \preceq z \preceq y \implies z \in A$

## Pages in category "Convex Sets (Order Theory)"

The following 13 pages are in this category, out of 13 total.