Infimum ($\inf$)

For a nonempty set $A\subseteq \mathbb{R}$, a real number $\ell$ is its infimum precisely when it is a lower bound and every other lower bound is at most $\ell$. It is the greatest lower bound, not necessarily the minimum.

For $C=\{1/n:n\in {\mathbb{N}}_{>0}\}$, zero is a lower bound. Every positive candidate $\epsilon$ fails: the Archimedean property gives an integer $n>1/\epsilon$, hence $1/n<\epsilon$. Thus $\inf C=0$, although zero is never a member of $C$. This is the lower-edge counterpart of approximating an unattained supremum.

Let $A\subseteq \mathbb{R}$ be nonempty and bounded below. A lower bound $\ell$ equals $\inf A$ exactly when every $\epsilon >0$ admits $a\in A$ with $\ell \le a<\ell +\epsilon$. Otherwise $\ell +\epsilon$ would be a larger lower bound. Taking tolerances $1/n$ gives a sequence of members converging to $\ell$. For a real-valued objective with finite infimum, this supplies a minimizing sequence without assuming that a global minimizer exists.