Definition:Smallest/Ordered Set

From ProofWiki
Jump to: navigation, search

Definition

Let $\struct {S, \preceq}$ be an ordered set.

An element $x \in S$ is the smallest element if and only if:

$\forall y \in S: x \preceq y$


That is, $x$ strictly precedes, or is equal to, every element of $S$.

The Smallest Element is Unique, so calling it the smallest element is justified.


The smallest element of $S$ is denoted $\min S$.


For an element to be the smallest element, all $y \in S$ must be comparable to $x$.


Smallest Element of Subset

Let $\left({S, \preceq}\right)$ be an ordered set.

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


An element $x \in T$ is the smallest element of $T$ if and only if:

$\forall y \in T: x \preceq \restriction_T y$

where $\preceq \restriction_T$ denotes the restriction of $\preceq$ to $T$.


Comparison with Minimal Element

Compare the definition of minimal element with that of a smallest element.


An element $x \in T$ is the smallest element of $T$ if and only if:

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

That is, $x$ is comparable to, and precedes, or is equal to, every $y \in S$.


An element $x \in S$ is a minimal element of $T$ if and only if:

$y \preceq x \implies x = y$

That is, $x$ precedes, or is equal to, every $y \in S$ which is comparable to $x$.

If all elements are comparable to $x$, then such a minimal element is indeed the smallest element.


Note that when an ordered set is in fact a totally ordered set, the terms minimal element and smallest element are equivalent.


Also defined as

Some sources do not bother to define this concept on a general ordered set and instead apply it directly to a totally ordered set or even a well-ordered set.


Also known as

The smallest element of a set is also called:

  • The least element
  • The lowest element (particularly with numbers)
  • The first element
  • The minimum element (but beware confusing with minimal - see above)
  • The null element (in the context of boolean algebras and boolean rings)


Also see


Sources