2.5. Real Valued Functions#

2.5.1. Real Valued Functions#

Definition 2.45 (Real valued function)

A (partial) real valued function is a function whose values are real numbers. Let X be a set. Then f:XR is a real valued function from X to R.

Definition 2.46 (The set of real valued total functions)

The set F(X,R) denotes the set of all real valued (total) functions from X to R.

Definition 2.47 (The vector space of real valued functions)

The set F(X,R) can be turned into a vector space over the field R with the following operations.

Let f,gF(X,R).

Vector addition:

f+g:xf(x)+g(x)xX.

Additive identity:

0:x0 with xX.

Scalar multiplication:

cf:xcf(x)xX.

pointwise multiplication:

fg:xf(x)g(x)xX.

Definition 2.48 (An algebra for partial functions)

An algebraic structure can be provided to partial functions too.

Let f,g be (partial) real valued functions from X to R.

Vector addition:

f+g:xf(x)+g(x) with domf+g=domfdomg.

Additive identity:

0:x0 with dom0=X.

Scalar multiplication:

cf:xcf(x) with domcf=domf.

pointwise multiplication:

fg:xf(x)g(x) with domfg=domfdomg.

However, there are certain limitations/odd behaviors with the structure.

  • If f and g are such that domfdomg=. Then f+g is an empty function.

  • The function f+(f) is 0 over domf but not defined over Xdomf. Thus, it is not equal to the 0 function. Thus, an additive inverse doesn’t exist.

  • Scalar multiplication with 0 leads to a function which is 0 only over domf. It is not defined over Xdomf.

Definition 2.49 (Partial order on real valued (total) functions)

Since R is ordered, hence a partial order can be defined on F(X,R).

We say that

fgf(x)g(x)xX.

Partial order cannot be easily defined for partial functions as it is unclear how to compare f(x) and g(x) at xdomfdomg.

One possible way is:

fgdomf=domg and f(x)g(x)xdomf.

Definition 2.50 (Bounded function)

A real valued (total) function f:XR is called bounded if there exists a number M0 (depending on f) such that

|f(x)|MxX.

A function which is not bounded is called unbounded.

f is called bounded from above by aR if:

f(x)axX.

f is called bounded from below by bR if:

bf(x)xX.

Boundedness of partial real valued functions (with domfX) is not useful as partial functions are typically extended (see below) with f(x) assigned to at xdomf. In other words, partial functions are treated as unbounded outside their domain.

Proposition 2.21

A real valued function is bounded if and only if it is bounded from above as well as below.

See also

  1. The set of bounded (total) functions can be turned into a metric space. See Example 3.20.

2.5.2. Graph#

  • For a function f:RnR, its graph is a subset of Rn+1.

  • We say that a point (x,f(x)) in the graph of f is above (resp. below) of another point (y,f(y)) if f(x)f(y) (resp. f(x)f(y)).

  • A line segment connecting the two points (x1,f(x1)) and (x2,f(x2)) is called a chord of the graph of the function.

2.5.3. Epigraph#

Definition 2.51 (Epigraph)

The epigraph of a real valued function f:XR is defined as:

epif{(x,t)X×R|xdomf,f(x)t}.

The epigraph lies above (and includes) the graph of a function.

Definition 2.52 (Strict epigraph)

The strict epigraph of a real valued function f:XR is defined as:

episf{(x,t)X×R|xdomf,f(x)<t}.

The strict epigraph lies above the graph of a function.

Theorem 2.33 (Epigraph of pointwise maximum of two functions)

Let f,g:XR be two different real valued functions. Let h:XR with domh=domfdomg be defined as

h(x)=max(f(x),g(x))xdomh

Then

epih=epifepig.

Proof. We first show that epihepifepig.

  1. Let (x,t)epih.

  2. Then xdomh and h(x)t.

  3. Hence xdomf, xdomg, f(x)t and g(x)t.

  4. Hence (x,t)epif and (x,t)epig.

  5. Hence (x,t)epifepig.

For the converse, we show that epifepigepih.

  1. Let (x,t)epifepig.

  2. Then (x,t)epif and (x,t)epig.

  3. Thus xdomf, f(x)t, xdomg and g(x)t.

  4. Thus xdomfdomg=domh.

  5. Also, h(x)=max(f(x),g(x))t.

  6. Hence (x,t)epih.

This result can be generalized for an arbitrary family of functions.

Theorem 2.34 (Epigraph of pointwise maximum of a family of functions)

Let {fi:XR}iI be a family of real valued functions indexed by I. Let h:XR with domh=iIdomfi be defined as

h(x)=max{fi(x)|iI}xdomh

Then

epih=iIepifi.

Proof. We first show that epihiIepifi.

  1. Let (x,t)epih.

  2. Then xdomh and h(x)t.

  3. Hence xdomfi and fi(x)t for every iI.

  4. Hence (x,t)epifi for every iI.

  5. Hence (x,t)iIepifi.

The argument for the converse is similar and left as an exercise.

2.5.4. Sub-level Sets#

Definition 2.53 (Sub-level set)

For a real valued function f:XR, the sublevel set for some αR, denoted by sublevel(f,α), is defined as

sublevel(f,α){xdomf|f(x)α}.

2.5.5. Contours or Level Sets#

Definition 2.54 (Contour)

For a real valued function f:XR, the contour for some αR, denoted by contour(f,α), is defined as

contour(f,α){xdomf|f(x)=α}.

2.5.6. Hypograph#

Definition 2.55 (Hypograph)

The hypograph of a real valued function f:XR is defined as:

hypof{(x,t)X×R|xdomf,tf(x)}.

The epigraph lies above (and includes) the graph of a function.

2.5.7. Super-level Sets#

Definition 2.56 (Super-level set)

For a real valued function f:XR, the super-level set for some αR, denoted by superlevel(f,α), is defined as

superlevel(f,α){xdomf|f(x)α}.

2.5.8. Extended Real Valued Functions#

Definition 2.57 (Extended real-valued function)

A function over a set X is called an extended real-valued function if it can take any real value as well as the infinity values and .

The signature of such a function is f:XR where R=R{,}. We also write the codomain as R=[,].

Definition 2.58 (Effective domain of an extended real valued function)

For an extended valued function f~:XR, its effective domain is defined as:

domf~{xX|f~(x)<}.

Definition 2.59 (Graphs and level sets)

The epigraph, hypograph, sublevel, superlevel and contour sets of an extended valued function are defined in an identical manner. However, the graph is defined slightly differently.

graf{(x,t)X×R|xdomf,f(x)=t};epif{(x,t)X×R|xdomf,f(x)t};episf{(x,t)X×R|xdomf,f(x)<t};sublevel(f,α){xdomf|f(x)α};contour(f,α){xdomf|f(x)=α};hypof{(x,t)X×R|xdomf,tf(x)};superlevel(f,α){xdomf|f(x)α}.

For an extended valued function, it is not necessary that grafepif.

  1. If f(x)=, then (x,)graf. However, (x,)epif. At the same time (x,t)epif for every R.

  2. If f(x)= then (x,)graf. However (x,)epif. But (x,t)epif for every R.

Definition 2.60 (Extended-value extension)

Let f:XR be a real valued (partial) function.

We define its extended-value extension f~:XR as

f~(x){f(x)forxdomfforxdomf

The extension is pretty useful in analysis and optimization as it extends the domain to the whole of X.

Definition 2.61 (Indicator functions)

Let C be a subset of X. We define the indicator function for C as:

IC(x)=0xC.

By definition: domIC=C.

We can create an extended value extension of IC as:

I~C(x){0xCxC.