6.2: More about Functions
 Page ID
 7068
\( \newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \)
\( \newcommand{\vecd}[1]{\overset{\!\!\rightharpoonup}{\vphantom{a}\smash {#1}}} \)
In Section 6.1, we have seen many examples of functions. We have also seen various ways to represent functions and to convey information about them. For example, we have seen that the rule for determining outputs of a function can be given by a formula, a graph, or a table of values. We have also seen that sometimes it is more convenient to give a verbal description of the rule for a function. In cases where the domain and codomain are small, finite sets, we used an arrow diagram to convey information about how inputs and outputs are associated without explicitly stating a rule. In this section, we will study some types of functions, some of which we may not have encountered in previous mathematics courses.
Preview Activity \(\PageIndex{1}\): The Number of Diagonals of a Polygon
A polygon is a closed plane figure formed by the joining of three or more straight lines. For example, a triangle is a polygon that has three sides; a quadrilateral is a polygon that has four sides and includes squares, rectangles, and parallelograms; a pentagon is a polygon that has five sides; and an octagon is a polygon that has eight sides. A regular polygon is one that has equallength sides and congruent interior angles.
A diagonal of a polygon is a line segment that connects two nonadjacent vertices of the polygon. In this activity, we will assume that all polygons are convex polygons so that, except for the vertices, each diagonal lies inside the polygon. For example, a triangle (3sided polygon) has no diagonals and a rectangle has two diagonals.
 How many diagonals does any quadrilateral (4sided polygon) have?
 Let \(D = \mathbb{N}  \{1, 2\}\). Define \(d: D \to \mathbb{N} \cup \{0\}\) so that \(d(n)\) is the number of diagonals of a convex polygon with \(n\) sides. Determine the values of \(d(3)\), \(d(4)\), \(d(5)\), \(d(6)\), \(d(7)\), and \(d8)\). Arrange the results in the form of a table of values for the function \(d\).
 Let \(f: \mathbb{R} \to \mathbb{R}\) be defined by \[f(x) = \dfrac{x(x  3)}{2}.\]Determine the values of \(f(0)\), \(f(1)\), \(f(2)\), \(f(3)\), \(f(4)\), \(f(5)\), \(f(6)\), \(f(7)\), \(f(8)\), and \(f9)\). Arrange the results in the form of a table of values for the function \(f\).
 Compare the functions in Parts (2) and (3). What are the similarities between the two functions and what are the differences? Should these two functions be considered equal functions? Explain.
Preview Activity \(\PageIndex{1}\): Derivatives
In calculus, we learned how to find the derivatives of certain functions. For example, if \(f(x) = x^2(sinx)\), then we can use the product rule to obtain
\[f\prime (x) = 2x(\sin x) + x^2 (\cos x).\]

If possible, find the derivative of each of the following functions:
(a) \(f(x) = x^4  5x^3 + 3x  7\)
(b) \(g(x) = \cos(5x)\)
(c) \(h(x) = \dfrac{\sin x}{x}\)
(d) \(k(x) = e^{x^2}\)
(e) \(r(x) = x\) 
Is it possible to think of differentiation as a function? Explain. If so, what would be the domain of the function, what could be the codomain of the function, and what is the rule for computing the element of the codomain (output) that is associated with a given element of the domain (input)?
Functions Involving Congruences
Theorem 3.31 and Corollary 3.32 state that an integer is congruent (mod \(n\)) to its remainder when it is divided by \(n\). (Recall that we always mean the remainder guaranteed by the Division Algorithm, which is the least nonnegative remainder.) Since this remainder is unique and since the only possible remainders for division by \(n\) are 0, 1, 2, ..., \(n  1\), we then know that each integer is congruent, modulo \(n\), to precisely one of the integers 0, 1, 2, ..., \(n  1\). So for each natural number \(n\), we will define a new set \(\mathbb{Z}_n\) as follows:
\(\mathbb{Z}_n = \{0, 1, 2, ..., n  1\}.\)
For example, \(\mathbb{Z}_4 = \{0, 1, 2, 3\}\) and \(\mathbb{Z}_6 = \{0, 1, 2, 3, 4, 5\}\). We will now explore a method to define a function from \(\mathbb{Z}_6\) to \(\mathbb{Z}_6\).
For each \(x \in \mathbb{Z}_6\), we can compute \(x^2 + 3\) and then determine the value of \(r\) in \(\mathbb{Z}_6\) so that
\((x^2 + 3) \equiv r\) (mod 6).
Since \(r\) must be in \(\mathbb{Z}_6\), we must have \(0 \le r < 6\). The results are shown in the following table.
x  \(r\), where \(x^2+3) \equiv r \text{(mod 6)}\)  x  \(r\), where \(x^2+3) \equiv r \text{(mod 6)}\) 

0  3  3  0 
1  4  4  1 
2  1  5  4 
The value of \(x\) in the first column can be thought of as the input for a function with the value of \(r\) in the second column as the corresponding output. Each input produces exactly one output. So we could write
\(f: \mathbb{Z}_6 \to \mathbb{Z}_6\) by \(f(x) = r\) where \((x^2 + 3) \equiv r\) (mod 6).
This description and the notation for the outputs of this function are quite cumbersome. So we will use a more concise notation. We will, instead, write
Let \(f: \mathbb{Z}_6 \to \mathbb{Z}_6\) by \(f(x) = (x^2 + 3)\) (mod 6).
Progress Check 6.5 (Functions Defined by Congruences)
Let \(\mathbb{Z}_6 = \{0, 1, 2, 3, 4\}\). Define
\(f: \mathbb{Z}_5 \to \mathbb{Z}_5\) by \(f(x) = x^4\) (mod 5), for each \(x \in \mathbb{Z}_5\);
\(g: \mathbb{Z}_5 \to \mathbb{Z}_5\) by \(g(x) = x^5\) (mod 5), for each \(x \in \mathbb{Z}_5\);
 Determine \(f(0)\), \(f(1)\), \(f(2)\), \(f(3)\), and \(f(4)\) and represent the function \(f\) with an arrow diagram.
 Determine \(g(0)\), \(g(1)\), \(g(2)\), \(g(3)\), and \(g(4)\) and represent the function \(g\) with an arrow diagram.
 Answer

Add texts here. Do not delete this text first.
Equality of Functions
The idea of equality of functions has been in the background of our discussion of functions, and it is now time to discuss it explicitly. The preliminary work for this discussion was Preview Activity \(\PageIndex{1}\), in which \(D = \mathbb{N}  \{1, 2\}\) and there were two functions:
 \(d: D \to \mathbb{N} \cup \{0\}\), where \(d(n)\) is the number of diagonals of a convex polygon with \(n\) sides
 \(f: \mathbb{R} \to \mathbb{R}\), where \(f(x) = \dfrac{x(x  3)}{2}\), for each real number \(x\).
In Preview Activity \(\PageIndex{1}\), we saw that these two functions produced the same outputs for certain values of the input (independent variable). For example, we can verify that
\(d(3) = f(3) = 0\), \(d(4) = f(4) = 2\),
\(d(5) = f(5) = 5\), and \(d(6) = f(6) = 9\).
Although the functions produce the same outputs for some inputs, these are two different functions.For example, the outputs of the function \(f\) are determined by a formula, and the outputs of the function \(d\) are determined by a verbal description. This is not enough, however, to say that these are two different functions. Based on the evidence from Preview Activity \(\PageIndex{1}\), we might make the following conjecture:
For \(n \ge 3\), \(d(n) = \dfrac{n(n  3)}{2}\).
Although we have not proved this statement, it is a true statement. (See Exercise 6.) However, we know the function \(d\) and the function \(f\) are not the same function. For example,
 \(f(0) = 0\), but 0 is not in the domain of \(d\);
 \(f(\pi) = \dfrac{\pi (\pi  3)}{2}\), but \(\pi\) is not in the domain of \(d\).
We thus see the importance of considering the domain and codomain of each of the two functions in determining whether the two functions are equal or not. This motivates the following definition.
Definition: equal Functions
Two functions \(f\) and \(g\) are equal provided that
 The domain of \(f\) equals the domain of \(g\). That is dom(\(f\)) = dom(\(g\))
 The codomain of \(f\) equals the codomain of \(g\). That is codom(\(f\)) = codom(\(g\))
 For each \(x\) in the domain of \(f\) (which equals the domain of \(g\)), \(f(x) = g(x)\).
Progress Check 6.6: Equality of Functions
Let \(A\) be a nonempty set. The identity function on the set \(A\), denoted by \(I_{A}\) , is the function \(I_{A}: A \to A\) defined by \(I_{A}(x) = x\) for every \(x\) in \(A\). That is, for the identity map, the output is always equal to the input.
For this progress check, we will use the functions \(f\) and \(g\) from Progress Check 6.5. The identity function on the set \(\mathbb{Z}_5\) is
\(I_{\mathbb{Z}_5}: \mathbb{Z}_5 \to \mathbb{Z}_5\) by \(I_{\mathbb{Z}_5} (x) = x\) (mod 5), for each \(x \in \mathbb{Z}_5\).
Is the identity function on \(\mathbb{Z}_5\) equal to either of the functions \(f\) or \(g\) from Progress Check 6.5? Explain.
 Answer

Add texts here. Do not delete this text first.
Mathematical Processes as Functions
Certain mathematical processes can be thought of as functions. In Preview Activity \(\PageIndex{2}\), we reviewed how to find the derivatives of certain functions, and we considered whether or not we could think of this differentiation process as a function. If we use a differentiable function as the input and consider the derivative of that function to be the output, then we have the makings of a function. Computer algebra systems such as Maple and Mathematica have this derivative function as one of their predefined operators.
Following is some Maple code (using the Classic Worksheet version of Maple) that can be used to find the derivative function of the function given by \(f(x) = x^2(sin x)\). The lines that start with the Maple prompt, [>, are the lines typed by the user. The centered lines following these show the resulting Maple output. The first line defines the function \(f\), and the second line uses the derivative function \(D\) to produce the derivative of the function \(f\).
[> f := x \(\to\) x^2 \(\ast\) sin (x);
\(f := x \to x^2 \sin(x)\)
[> f1 := D(f);
\(f1 := x \to 2x \sin(x) + x^2 \cos(x)\)
We must be careful when determining the domain for the derivative function since there are functions that are not differentiable. To make things reasonably easy, we will let \(F\) be the set of all real functions that are differentiable and call this the domain of the derivative function \(D\). We will use the set \(T\) of all real functions as the codomain. So our function \(D\) is
\(D: F \to T\) by \(D(f) = f\prime\).
Progress Check 6.7: Average of a Finite Set of Numbers
Let \(A = \{a_1, a_2, ... a_n\}\) be a finite set whose elements are the real numbers \(a_1, a_2, ... a_n\). We define the average of the set \(A\) to be the real number \(\bar{A}\), where
\(\bar{A} = \dfrac{a_1, a_2, ... a_n}{n}.\)
 Find the average of \(A = \{3, 7, 1, 5\}\).
 Find the average of \(B = \{7, 2, 3.8, 4.2, 7.1\}\).
 Find the average of \(C = \{\sqrt{2}, \sqrt{3}, \pi  \sqrt{3}\}\).
 Now let \(\mathcal{F}(\mathbb{R})\) be the set of all finite subsets of \(\mathbb{R}\). That is, a subset \(A\) of \(\mathbb{R}\) is in \(\mathcal{F}(\mathbb{R})\) if and only if \(A\) contains only a finite number of elements. Carefully explain how the process of finding the average of a finite subset of \(\mathbb{R}\) can be thought of as a function. In doing this, be sure to specify the domain of the function and the codomain of the function.
 Answer

Add texts here. Do not delete this text first.
Sequences as Functions
A sequence can be considered to be an infinite list of objects that are indexed (subscripted) by the natural numbers (or some infinite subset of \(\mathbb{N} \cup \{0\}\)). Using this idea, we often write a sequence in the following form:
\(a_1, a_2, ..., a_n, ....\)
In order to shorten our notation, we will often use the notation \(\langle a_n \rangle\) to represent this sequence. Sometimes a formula can be used to represent the terms of a sequence, and we might include this formula as the \(n\)th term in the list for a sequence such as in the following example:
\(1, \dfrac{1}{2}, \dfrac{1}{3}, ..., \dfrac{1}{n}, ....\)
In this case, the \(n\)th term of the sequence is \(\dfrac{1}{n}\). If we know a formula for the \(n\)th term, we often use this formula to represent the sequence. For example, we might say
Define the sequence \(\langle a_n \rangle\) by \(a_n = \dfrac{1}{n}\) for each \(n \in \mathbb{N}\).
This shows that this sequence is a function with domain \(\mathbb{N}\). If it is understood that the domain is \(\mathbb{N}\), we could refer to this as the sequence \(\langle \dfrac{1}{n} \rangle\). Given an element of the domain, we can consider \(a_n\) to be the output. In this case, we have used subscript notation to indicate the output rather than the usual function notation. We could just as easily write
\(a(n) = \dfrac{1}{n}\) instead of \(a_n = \dfrac{1}{n}\).
We make the following formal definition.
Definition: sequence
An (infinite) sequence is a function whose domain is \(\mathbb{N}\) or some infinite subset of \(\mathbb{N} \cup \{0\}\).
Progress Check 6.8 (Sequences)
Find the sixth and tenth terms of each of the following sequences:
 \(\dfrac{1}{3}\), \(\dfrac{1}{6}\), \(\dfrac{1}{9}\), \(\dfrac{1}{12}\), ...
 \(\langle a_n \rangle\), where \(a_n = \dfrac{1}{n^2}\) for each \(n \in \mathbb{N}\)
 \(\langle (1)^n \rangle\)
 Answer

Add texts here. Do not delete this text first.
Functions of Two Variables
In Section 5.4, we learned how to form the Cartesian product of two sets. Recall that a Cartesian product of two sets is a set of ordered pairs. For example, the set \(\mathbb{Z} \times \mathbb{Z}\) is the set of all ordered pairs, where each coordinate of an ordered pair is an integer. Since a Cartesian product is a set, it could be used as the domain or codomain of a function. For example, we could use \(\mathbb{Z} \times \mathbb{Z}\) as the domain of a function as follows:
Let \(f: \mathbb{Z} \times \mathbb{Z} \to \mathbb{Z}\) be defined by \(f(m,n) = 2m + n\).

Technically, an element of \(\mathbb{Z} \times \mathbb{Z}\) is an ordered pair, and so we should write \(f((m,n))\) for the out put of the function \(f\) when the input is the ordered pair \((m, n)\). However, the double parentheses seem unnecessary in this context and there should be no confusion if we write \(f(m,n)\) for the output of the function \(f\) when the input is \((m, n)\). So, for example, we simply write
\[\begin{array} {rcl} {f(3,2)} &= & {2 \cdot 3 + 2 = 8,\text{ and}} \\ {f(4, 5)} &= & {2 \cdot (4) + 5 = 3.} \end{array}\] 
Since the domain of this function is \(\mathbb{Z} \times \mathbb{Z}\) and each element of \(\mathbb{Z} \times \mathbb{Z}\) is an ordered pair of integers, we frequently call this type of function a function of two variables.
Finding the preimages of an element of the codomain for the function \(f\), \(\mathbb{Z}\), usually involves solving an equation with two variables. For example, to find the preimages of 0 2 Z, we need to find all ordered pairs \((m,n) \in \mathbb{Z} \times \mathbb{Z}\) such that \(f(m,n) = 0\). This means that we must find all ordered pairs \((m,n) \in \mathbb{Z} \times \mathbb{Z}\) such that
\(2m + n = 0\)
Three such ordered pairs are (0,0), (1, 2), and (1, 2). In fact, whenever we choose an integer value for \(m\), we can find a corresponding integer \(n\) such that \(2m + n = 0\). This means that 0 has infinitely many preimages, and it may be difficult to specify the set of all of the preimages of 0 using the roster method. One way that can be used to specify this set is to use set builder notation and say that the following set consists of all of the preimages of 0:
\(\{(m,n) \in \mathbb{Z} \times \mathbb{Z}\ \ 2m + n = 0\} = \{(m,n) \in \mathbb{Z} \times \mathbb{Z}\ \ n = 2m\}.\)
The second formulation for this set was obtained by solving the equation \(2m + n = 0\) for \(n\).
Progress Check 6.9 (Working with a Function of Two Variables)
Let \(g: \mathbb{Z} \times \mathbb{Z} \to \mathbb{Z}\) be defined by \(g(m,n) = m^2  n\) for all \((m,n) \in \mathbb{Z} \times \mathbb{Z}\).
 Determine \(g(0, 3)\), \(g(3, 2)\), \(g(3, 2)\), and \(g(7, 1)\).
 Determine the set of all preimages of the integer 0 for the function \(g\). Write your answer using set builder notation.
 Determine the set of all preimages of the integer 5 for the function \(g\). Write your answer using set builder notation.
 Answer

Add texts here. Do not delete this text first.
Exercise 6.2
 Let \(\mathbb{Z}_5 = \{0, 1, 2, 3, 4\}\). Define \(f: \mathbb{Z}_5 \to \mathbb{Z}_5\) by \(f(x) = x^2 + 4\) (mod 5) and define \(g: \mathbb{Z}_5 \to \mathbb{Z}_5\) by \(g(x) = (x + 1)(x + 4)\) (mod 5).
(a) Calculate \(f(0)\), \(f(1)\), \(f(2)\), \(f(3)\), and \(f(4)\).
(b) Calculate \(g(0)\), \(g(1)\), \(g(2)\), \(g(3)\), and \(g(4)\).
(c) Is the function \(f\) equal to the function \(g\)? Explain.  Let \(\mathbb{Z}_6 = \{0, 1, 2, 3, 4, 5\}\). Define \(f: \mathbb{Z}_5 \to \mathbb{Z}_5\) by \(f(x) = x^2 + 4\) (mod 5) and define \(g: \mathbb{Z}_5 \to \mathbb{Z}_5\) by \(g(x) = (x + 1)(x + 4)\) (mod 5).
(a) Calculate \(f(0)\), \(f(1)\), \(f(2)\), \(f(3)\), and \(f(4)\).
(b) Calculate \(g(0)\), \(g(1)\), \(g(2)\), \(g(3)\), and \(g(4)\).
(c) Is the function \(f\) equal to the function \(g\)? Explain.  Let \(f : (\mathbb{R}  \{0\}) \to \mathbb{R}\) by \(f(x) = \dfrac{x^3 + 5x}{x}\) and let \(g : \mathbb{R} \to \mathbb{R}\) by \(g(x) = x^2 + 5\).
(a) Calculate \(f(2)\), \(f(2)\), \(f(3)\), and \(f(\sqrt{2})\).
(b) Calculate \(g(0)\), \(g(2)\), \(g(2)\), \(g(3)\), and \(g(\sqrt{2})\).
(c) Is the function \(f\) equal to the function \(g\)? Explain.
(d) Now let \(h: (\mathbb{R}  \{0\}) \to \mathbb{R}\) by \(h(x) = x^2 + 5\). Is the function \(f\) equal to the function \(h\)? Explain. 
Represent each of the following sequences as functions. In each case, state the domain, codomain, and rule for determining the outputs of the function. Also, determine if any of the sequences are equal.
(a) \(1, \dfrac{1}{4}, \dfrac{1}{9}, \dfrac{1}{16}, ...\)
(b) \(\dfrac{1}{3}, \dfrac{1}{9}, \dfrac{1}{27}, \dfrac{1}{81}, ...\)
(c) 1, 1, 1, 1, 1, 1, ...
(d) cos(0), cos(\(\pi\)), cos(\(2\pi\)), cos(\(3\pi\)), cos(\(4\pi\)), ... 
Let \(A\) and \(B\) be two nonempty sets. There are two projection functions with domain \(A \times B\), the Cartesian product of \(A\) and \(B\). One projection function will map an ordered pair to its first coordinate, and the other projection function will map the ordered pair to its second coordinate. So we define
\(p_1: A \times B \to A\) by \(p_1(a, b) = a\) for every \((a, b) \in A \times B\); and
\(p_2: A \times B \to B\) by \(p_2(a, b) = a\) for every \((a, b) \in A \times B\).
Let \(A = \{1, 2\}\) and let \(B = \{x, y, z\}\).
(a) Determine the outputs for all possible inputs for the projection function\(p_1: A \times B \to A\).
(b) Determine the outputs for all possible inputs for the projection function\(p_2: A \times B \to B\).
(c) What is the range of these projection functions?
(d) Is the following statement true or false? Explain.
For all \((m, n), (u, v) \in A \times B\), if \((m, n) \ne (u, v)\), then
\(p_1(m,n) \ne p_1(u,v)\). 
Let \(D = \mathbb{N}  \{1, 2\}\) and define \(d: D \to \mathbb{N} \cup \{0\}\) by \(d(n) =\) the number of diagonals of a convex polygon with \(n\) sides. In Preview Activity \(\PageIndex{1}\), we showed that for values of \(n\) from 3 through 8,
\[d(n) = \dfrac{n(n  3)}{2}.\]
Use mathematical induction to prove that for all \(n \in D\),
\[d(n) = \dfrac{n(n  3)}{2}.\]
Hint: To get an idea of how to handle the inductive step, use a pentagon. First, form all the diagonals that can be made from four of the vertices. Then consider how to make new diagonals when the fifth vertex is used. This may generate an idea of how to proceed from a polygon with \(k\) sides to a polygon with \(k + 1\) sides. 
Let \(f : \mathbb{Z} \times \mathbb{Z} \to \mathbb{Z}\) be defined by \(f(m,n) = m + 3n\).
(a) Calculate \(f(3,4)\) and \(f(2, 7)\).
(b) Determine the set of all the preimages of 4 by using set builder notation to describe the set of all \((m, n) \in \mathbb{Z} \times \mathbb{Z}\) such that \(f(m,n) = 4\). 
Let \(g : \mathbb{Z} \times \mathbb{Z} \to \mathbb{Z} \times \mathbb{Z}\) be defined by \(g(m,n) = (2m, m  n)\).
(a) Calculate \(g(3, 5)\) and \(g(1, 4)\).
(b) Determine all the preimages of .0; 0/. That is, find all \((m, n) \in \mathbb{Z} \times \mathbb{Z}\) such that \(g(m, n) = (0, 0)\).
(c) Determine the set of all the preimages of (8, 3).
(d) Determine the set of all the preimages of (1, 1).
(e) Is the following proposition true or false? Justify your conclusion.
For each \((s, t) \in \mathbb{Z} \times \mathbb{Z}\), there exists an \((m, n) \in \mathbb{Z} \times \mathbb{Z}\) such that \(g(m, n) = (s, t)\). 
A 2 by 2 matrix over \(\mathbb{R}\) is a rectangular array of four real numbers arranged in two rows and two columns. We usually write this array inside brackets (or parentheses) as follows:
\[A=
\left [{\begin{array} {cc}
a & b\\
c & d\\
\end{array}} \right]
\]
where \(a\), \(b\), \(c\) and \(d\) are real numbers. The determinant of the 2 by 2 matrix \(A\), denoted by det(\(A\)), is defined as
det(\(A\)) = \(ad  bc\).
(a) Calculate the determinant of each of the following matrices:
\(\left [{\begin{array} {cc} 3 & 5 \\ 4 & 1\\ \end{array}} \right]\), \(\left [{\begin{array} {cc} 1 & 0 \\ 0 & 7\\ \end{array}} \right]\), and \(\left [{\begin{array} {cc} 3 & 2 \\ 5 & 0\\ \end{array}} \right]\).
(b) Let \(\mathcal{M}_2(\mathbb{R})\) be the set of all 2 by 2 matrices over \(\mathbb{R}\). The mathematical process of finding the determinant of a 2 by 2 matrix over \(\mathbb{R}\) can be thought of as a function. Explain carefully how to do so, including a clear statement of the domain and codomain of this function. 
Using the notation from Exercise (9), let
\[A=
\left [{\begin{array} {cc}
a & b\\
c & d\\
\end{array}} \right]
\]
be a 2 by 2 matrix over \(\mathbb{R}\). The transpose of the matrix \(A\), denoted by \(A^T\), is the 2 by 2 matrix over \(\mathbb{R}\) defined by
\[A^T=
\left [{\begin{array} {cc}
a & c\\
b & d\\
\end{array}} \right]
\]
(a) Calculate the transpose of each of the following matrices:
\(\left [{\begin{array} {cc} 3 & 5 \\ 4 & 1\\ \end{array}} \right]\), \(\left [{\begin{array} {cc} 1 & 0 \\ 0 & 7\\ \end{array}} \right]\), and \(\left [{\begin{array} {cc} 3 & 2 \\ 5 & 0\\ \end{array}} \right]\).
(b) Let \(\mathcal{M}_2(\mathbb{R})\) be the set of all 2 by 2 matrices over \(\mathbb{R}\). The mathematical process of finding the determinant of a 2 by 2 matrix over \(\mathbb{R}\) can be thought of as a function. Explain carefully how to do so, including a clear statement of the domain and codomain of this function.
Explorations and Activities 
Integration as a Function. In calculus, we learned that if f is real function that is continuous on the closed interval [\(a\), \(b\)], then the definite integral \(\int_a^b f(x) dx\) is a real number. In fact, one form of the Fundamental Theorem of Calculus states that
\[\int_a^b f(x)dx = F(b)  F(a),\]
where \(F\) is any antiderivative of \(f\), that is, where \(F\prime = f\).
(a) Let [\(a\), \(b\)] be a closed interval of real numbers and let \(C[a, b]\) be the set of all real functions that are continuous on [\(a\), \(b\)]. That is,
\[C[a, b] = \{f: [a, b] \to \mathbb{R}\ \ f \text{ is continuous on } [a, b]\}.\]
i. Explain how the definite integral \(\int_a^b f(x) dx\) can be used to define a function \(I\) from \(C[a, b]\) to \(\mathbb{R}\).
ii. Let \([a, b] = [0, 2]\). Calculate \(I(f)\), where \(f(x) = x^2 + 1\).
iii. Let \([a, b] = [0, 2]\). Calculate \(I(g)\), where \(g(x) = sin(\pi x)\).
In calculus, we also learned how to determine the indefinite integral \(\int f(x) dx\) of a continuous funtion \(f\).
(b) Let \(f(x) = x^2 + 1\) and \(g(x) = cos(2x)\). Determine \(\int f(x) dx\) and \(\int g(x) dx\).
(c) Let \(f\) be a continuous function on the closed interval [0, 1] and let \(T\) be the set of all real functions. Can the process of determining the indefinite integral of a continuous function be used to define a function from \(C[0, 1]\) to \(T\)? Explain.
(d) Another form of the Fundamental Theorem of Calculus states that if \(f\) is continuous on the interval [\(a\), \(b\)] and if
\[g(x) = \int_a^x f(t) dt\]
For each \(x\) in [\(a\), \(b\)], then \(g\prime (x) = f(x)\). That is, \(g\) is an antiderivative of \(f\). Explain how this t heorem can be used to define a function from \(C[a, b]\) to \(T\), where the output of the function i s an antiderivative of the input. (Recall that \(T\) is the set of all real functions.)
 Answer

Add texts here. Do not delete this text first.