Order

Overview

An order refers to a binary relation that defines how elements of a set relate to one another in terms of "less than", "equal to", or "greater than". Orders are typically categorized as strict and non-strict variants. If unspecified, I assume non-strict.

Induced Orderings

Let R be an ordering on set A. Let C be a subset of A. Then the following is an ordering on C:

R°=R(C×C).
Powered by Forestry.md