Category:Definitions/Min Operation
Jump to navigation
Jump to search
This category contains definitions related to Min Operation.
Related results can be found in Category:Min Operation.
Let $\struct {S, \preceq}$ be a totally ordered set.
The min operation is the binary operation on $\struct {S, \preceq}$ defined as:
- $\forall x, y \in S: \map \min {x, y} = \begin {cases} x & : x \preceq y \\ y & : y \preceq x \end {cases}$
Pages in category "Definitions/Min Operation"
The following 2 pages are in this category, out of 2 total.