Minimality under a key and along a map #
Among elements none of which lies below another, minimality under a key depends only on the key's
strict order between incomparable elements: when that order is an irreflexive relation r, the
minimal elements are those that nothing is r-related to. A strictly monotone map along which
lower elements lift carries the minimal elements of a preimage to the minimal elements of the
set, whether or not the map is injective.
Main statements #
Among elements of P none of which lies below another, an element is minimal under a key
whose strict order between incomparable elements is the irreflexive relation r exactly when no
element of P is r-related to it.
A strictly monotone map g such that every element below g a is the image of one below
a reflects and preserves minimality: a is minimal among the elements whose image satisfies
Q exactly when g a is minimal in Q.