Category:Definitions/Convex Sets (Order Theory)
Jump to navigation
Jump to search
This category contains definitions related to Convex Sets (Order Theory) in the context of Order Theory.
Related results can be found in Category: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 "Definitions/Convex Sets (Order Theory)"
The following 5 pages are in this category, out of 5 total.