(Max|Min)im(al|um) elements
Take a set A equipped with a binary operation ≤, usually an ordering relation.
An element of A is minimal if no element of A is strictly lesser than it (according to ≤), and likewise maximal if no element is strictly greater than it. In notation,
m is minimalm is maximal⟺¬(∃a∈A)(a≤m∧m≰a)⟺¬(∃a∈A)(a≥m∧m≱a)
By distributing the negation, we arrive at an equivalent formulation which is often more useful (and subjectively more beautiful!):
m is minimalm is maximal⟺(∀a∈A)(a≤m→m≤a)⟺(∀a∈A)(a≥m→m≥a)
Take a set A equipped with a binary operation ≤, usually an ordering relation.
An element of A is called a maximum if it is greater than every element, and likewise called a minimum if it is lesser than every element. In notation,
m is a maximumm is a minimum⟺(∀a∈A)(m≥a)⟺(∀a∈A)(m≤a)