2.4. The Extended Real Line#

Definition 2.40 (Extended real line)

The extended real number system or extended real line is obtained from the real number system R by adding two infinity elements + and , where the infinities are treated as actual numbers.

It is denoted as R or R{,+}.

The symbol + is often written simply as .

In order to make R a useful number system, we need to define the comparison and arithmetic rules of the new infinity symbols w.r.t. existing elements in R and between themselves.

2.4.1. Order#

Definition 2.41 (Extended valued comparison rules)

We define the following rules of comparison between real numbers and infinities:

  • a<aR

  • a>aR

  • <

In other words <a<aR.

Following notations are useful:

  • R=(,)

  • R{}=(,]

  • R{}=[,)

  • R{,}=[,]

Definition 2.42 (Infimum and supremum in extended real line)

Let A be a subset of R.

  • If A is bounded from below, then infA denotes its greatest lower bound.

  • If A is bounded from above, then supA denotes its least upper bound.

  • If A is not bounded from below, we write: infA=.

  • If A is not bounded from above, we write: supA=.

  • For an empty set, we follow the convention as: inf= and sup=.

2.4.2. Arithmetic#

Definition 2.43 (Extended valued arithmetic)

The arithmetic between real numbers and the infinite values is defined as below:

a+=+a=(<a<)a=+a=(<a<)a×=×a=(0<a<)a×()=()×a=(0<a<)a×=×a=(<a<0)a×()=()×a=(<a<0)a±=0(<a<)

The arithmetic between infinities is defined as follows:

+=()+()=×=()×()=()×=×()=

Usually, multiplication of infinities with zero is left undefined. But for the purposes of mathematical analysis and optimization, it is useful to define as follows:

0×=×0=0×()=()×0=0.

2.4.3. Sequences, Series and Convergence#

Definition 2.44 (Convergence to infinities)

A sequence {xn} of R converges to if for every M>0, there exists n0 (depending on M) such that xn>M for all n>n0.

We denote this by:

limxn=.

A sequence {xn} of R converges to if for every M<0, there exists n0 (depending on M) such that xn<M for all n>n0.

We denote this by:

limxn=.

We can reformulate Theorem 2.6 as:

Theorem 2.32 (Convergence of monotone sequences)

Every monotone sequence of real numbers converges to a number in R.

Proof. Let {xn} be an increasing sequence. If it is bounded then by Theorem 2.6, it converges to a real number.

Assume it to be unbounded (from above). Then, for every M>0, there exists n0 (depending on M) such that xn>M for all n>n0. Then, by Definition 2.44, it converges to .

Let {xn} be a decreasing sequence. If it is bounded then by Theorem 2.6, it converges to a real number.

Assume it to be unbounded (from below). Then, for every M<0, there exists n0 (depending on M) such that xn<M for all n>n0. Then, by Definition 2.44, it converges to .

Thus, every monotone sequence either converges to a real number or it converges to one of the infinities.

Remark 2.13 (Infinite sums)

Consider a series xn. If the sequence of partial sums converges to , we say that xn= i.e. the sum of the series is infinite. Similarly, if the sequence of partial sums converges to , we say that xn=.

Remark 2.14

Every series of non-negative real numbers converges in R.

Proof. The sequence of partial sums is an increasing sequence. By Theorem 2.32, it converges either to a real number or to .