The extended real number system adjoins two formal endpoints to the :

R‾=R∪{−∞,+∞},\overline{\mathbb R}=\mathbb R\cup\{-\infty,+\infty\},

ordered by −∞<x<+∞-\infty<x<+\infty for every x∈Rx\in\mathbb R. Convex analysis often uses the one-sided extension

R∪{+∞}=(−∞,+∞]\mathbb R\cup\{+\infty\}=(-\infty,+\infty]

for functions that encode infeasible points by the value +∞+\infty.

Infimum and supremum conventions

Every nonempty A⊆R‾A\subseteq\overline{\mathbb R} has a greatest lower bound and a least upper bound in the extended order, extending the real and . If AA has no real lower bound then inf⁡A=−∞\inf A=-\infty; if it has no real upper bound then sup⁡A=+∞\sup A=+\infty. The distinction between real and extended bounds matters: −∞-\infty is an extended lower bound for every subset. For the empty set, the conventions are

inf⁡∅=+∞,sup⁡∅=−∞.\inf\varnothing=+\infty, \qquad \sup\varnothing=-\infty.
Remarks

Allowing the value +∞+\infty lets an encode a constraint without repeatedly restricting the domain.