Let $\mathcal R$ be a relation on $S$ and let $T \subseteq S$.
It seems there are two notions floating around of an $\mathcal R$-minimal element of $T$:
- $x$ is an $\mathcal R$-minimal element of $T$ iff $\forall y \in T: (y \mathrel{\mathcal R} x \implies y = x)$
- $x$ is an $\mathcal R$-minimal element of $T$ iff $\forall y \in T: y \not\mathrel{\mathcal R} x$
Which of these is more common? Does the other one go by some other name?
The first is compatible with the usual notion of minimality in ordered sets, but the few pages I've found that mention the topic mostly seem to prefer the second.