Category:Min Operation

From ProofWiki
Jump to navigation Jump to search

This category contains results about Min Operation.
Definitions specific to this category can be found in Definitions/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}$