Definition:Minimal/Set

From ProofWiki
Jump to: navigation, search

Definition

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$
Personal tools
Namespaces
Variants
Actions
Navigation
ProofWiki.org
ToDo
Toolbox
Google AdSense