Definition:Minimal

From ProofWiki

Jump to: navigation, search

Definition

Let $\left({S, \preceq}\right)$ be a poset.

Let $T \subseteq S$ be a subset of $S$.

An element $x \in T$ is a minimal element of $T$ iff:

$\forall y \in T: y \preceq x \implies x = y$

That is, the only element of $T$ that $x$ succeeds or is equal to is itself.

Alternatively, this can be put as:

$x \in T$ is a minimal element of $T$ iff:

$\neg \exists y \in T: y \prec x$

where $y \prec x$ denotes that $y \preceq x \land y \ne x$.

Let $S$ be a set.

Let $\mathcal P \left({S}\right)$ be the power set of $S$.

Let $\mathcal T \subseteq \mathcal P \left({S}\right)$ be a subset of $\mathcal P \left({S}\right)$.

Let $\left({\mathcal T, \subseteq}\right)$ be the poset formed on $\mathcal T$ by $\subseteq$ considered as an ordering.

Then $T \in \mathcal T$ is a minimal set of $\mathcal T$ iff $T$ is a minimal element of $\left({\mathcal T, \subseteq}\right)$.

That is:

$\forall X \in \mathcal T: X \subseteq T \implies X = T$

Let $f$ be a mapping defined on a subset of the real numbers $S \subseteq \R$.

Let $f$ be bounded below by an infimum $B$.

It may or may not be the case that $\exists x \in S: f \left({x}\right) = B$.

If such a value exists, it is called the minimal value or minimum of $f$ on $S$, and that this minimum is attained at $x$.