Real Valued Functions
Contents
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
Definition 2.46 (The set of real valued total functions)
The set
Definition 2.47 (The vector space of real valued functions)
The set
Let
Vector addition:
Additive identity:
Scalar multiplication:
pointwise multiplication:
Definition 2.48 (An algebra for partial functions)
An algebraic structure can be provided to partial functions too.
Let
Vector addition:
Additive identity:
Scalar multiplication:
pointwise multiplication:
However, there are certain limitations/odd behaviors with the structure.
If
and are such that . Then is an empty function.The function
is 0 over but not defined over . Thus, it is not equal to the function. Thus, an additive inverse doesn’t exist.Scalar multiplication with
leads to a function which is only over . It is not defined over .
Definition 2.49 (Partial order on real valued (total) functions)
Since
We say that
Partial order cannot be easily defined for partial functions as it is unclear
how to compare
One possible way is:
Definition 2.50 (Bounded function)
A real valued (total) function
A function which is not bounded is called unbounded.
Boundedness of partial real valued functions (with
Proposition 2.21
A real valued function is bounded if and only if it is bounded from above as well as below.
See also
The set of bounded (total) functions can be turned into a metric space. See Example 3.20.
2.5.2. Graph#
For a function
, its graph is a subset of .We say that a point
in the graph of is above (resp. below) of another point if (resp. ).A line segment connecting the two points
and 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
The epigraph lies above (and includes) the graph of a function.
Definition 2.52 (Strict epigraph)
The strict epigraph of a real valued function
The strict epigraph lies above the graph of a function.
Theorem 2.33 (Epigraph of pointwise maximum of two functions)
Let
Then
Proof. We first show that
Let
.Then
and .Hence
, , and .Hence
and .Hence
.
For the converse, we show that
Let
.Then
and .Thus
, , and .Thus
.Also,
.Hence
.
This result can be generalized for an arbitrary family of functions.
Theorem 2.34 (Epigraph of pointwise maximum of a family of functions)
Let
Then
Proof. We first show that
Let
.Then
and .Hence
and for every .Hence
for every .Hence
.
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
2.5.5. Contours or Level Sets#
Definition 2.54 (Contour)
For a real valued function
2.5.6. Hypograph#
Definition 2.55 (Hypograph)
The hypograph of a real valued function
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
2.5.8. Extended Real Valued Functions#
Definition 2.57 (Extended real-valued function)
A function over a set
The signature of such a function is
Definition 2.58 (Effective domain of an extended real valued function)
For an extended valued function
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.
For an extended valued function, it is not necessary
that
If
, then . However, . At the same time for every .If
then . However . But for every .
Definition 2.60 (Extended-value extension)
Let
We define its extended-value extension
The extension is pretty useful in analysis and optimization
as it extends the domain to the whole of
Definition 2.61 (Indicator functions)
Let
By definition:
We can create an extended value extension of