Skip to content

Minimum of a Set

Definition

Let E⊆RE\subseteq \mathbb{R} be a set. The minimum of E,E\text{,} denoted by min⁡E,\min E\text{,} is the smallest element in EE if it exists. That is, min⁡E=x\min E = x if x∈Ex\in E and x≤yx\leq y for all y∈E.y\in E\text{.}


Interpretation

The minimum of a set represents the smallest value that is actually attained within the set.

It formalizes the idea of a smallest element, distinguishing it from lower bounds that may not belong to the set.

The points 1, 1/2, 1/3 and so on crowding towards 0 on a number line; the set has maximum 1 but no minimum, since 0 is not in the set.

The set S={1,12,13,… }S=\{1,\tfrac{1}{2},\tfrac{1}{3},\dots\} has no minimum. Its elements approach 00, but 0∉S0\notin S, so inf⁡S=0\inf S=0 is not attained.

The defining inequality compares the proposed minimum with every element, and membership requires that the proposed value actually occur. A lower bound outside the set is therefore not a minimum.


Key Results

  • A set can have at most one minimum.
  • The minimum, if it exists, is always the greatest lower bound for the set.
  • A set may have lower bounds without having a minimum.

Examples

  • The set {1, 2, 3}\{1,\,2,\,3\} has minimum 1.1\text{.}
  • The interval (0,1)(0,1) has no minimum.

Prerequisites

Sources

Aliases: least element, smallest element, minimum element Symbols: element of, real numbers, subset

Last updated: 17 October 2026 21:53