Continuity of a function

-

 A function \(f(x)\) is said to be continuous at \(x = a\) if \(f(x)\) converges to \(f(a)\) as \(x \to a\). Continuous functions are, in a sense, well-behaved and hence, easy to handle. 



Definition (Continuous function)

Let \(f(x)\) be a function defined on an interval \(I\) such that \(a \in I\). The function \(f(x)\) is said to be continuous at \(a\) if \[\lim_{x\to a}f(x) = f(a).\] \(f(x)\) is said to be a continuous function if it is continuous at every \(x\in I\).

Remark. According to the definition of limits, \(f(x)\) is continuous at \(x=a\) if the following condition is satisfied:

  • For any \(\varepsilon > 0\), there exists \(\delta > 0\) such that, for all \(x \in \mathrm{dom}f\), \(0 < |x - a| < \delta\) implies \(|f(x) - f(a)| < \varepsilon\).
□

Example. For the function \(f(x)\) defined by
\[f(x) = \left\{ \begin{array}{cc} 0 & (x < 0),\\ 1 & (x \geq 0), \end{array}\right.\]
\(\lim_{x \to 0}f(x)\) does not exist. Therefore it is not continuous at \(x=0\). □

Example. For the function \(f(x)\) defined by
\[ f(x) = \left\{ \begin{array}{cc} |x| & (x \neq 0),\\ -1 & (x = 0), \end{array}\right. \]
we have \(\lim_{x\to 0}f(x) = 0\). However, \(f(0) = -1 \neq \lim_{x\to 0}f(x)\). Therefore it is not continuous at \(x = 0\). □

Remark. If the function \(f(x)\) is defined on a closed interval \([a, b]\), we say it is continuous at \(x=a\) if
\[\lim_{x \to a + 0}f(x) = f(a),\]
[Note the right limit], and continuous at \(x = b\) if
\[\lim_{x \to b-0}f(x) = f(b)\]
[Note the left limit]. □

Theorem (Properties of continuous functions)

Let \(f(x)\) and \(g(x)\) be functions that are continuous at \(x = a\). Then the following functions are also continuous at \(x = a\).
  1. \(kf(x) + lg(x)\) where \(k, l\) are constants,
  2. \(f(x)g(x)\),
  3. \(\frac{f(x)}{g(x)}\) provided that \(g(a) \neq 0\).
Proof. Trivial from the definition of continuous functions and the properties of limits. ■

Example. Any polynomial functions are continuous at all \(a\in\mathbb{R}\). □

Theorem (Continuity of a composite function)

Let \(f(x)\) be a function defined on an interval including \(x=a\) such that \(b = f(a)\). Let \(g(x)\) be a function defined on an interval including \(x=b\). If \(f(x)\) is continuous at \(x=a\) and \(g(x)\) is continuous at \(x=b\), then \((g\circ f)(x)\) is continuous at \(x=a\).  
Proof. Trivial from the definition of continuity and limit of a composite function. ■

We give the following theorems without proof, but they show some of the important properties of continuous functions. Note that both theorems require the function to be defined on a closed interval.

Theorem (Intermediate Value Theorem)

Let \(f(x)\) be a continuous function defined on a closed interval \([a,b]\) such that \(f(a) \neq f(b)\). Then, for any \(l\) between \(f(a)\) and \(f(b)\), there exists a \(c\in[a,b]\) such that \(f(c) = l\).
See also: Intermediate Value Theorem (Wikipedia)

Theorem (Extreme Value Theorem)

A continuous function \(f(x)\) defined on a closed interval \([a, b]\) has a maximum value and a minimum value, each at least once.
See also: Extreme Value Theorem (Wikipedia)

Example. Consider the function
\[f(x) = \frac{1}{1 - x^2}\]
defined on \((-1, 1)\). This is a continuous function. However since \(\lim_{x\to 1-0}f(x) = +\infty\) and \(\lim_{x\to -1+0}f(x) = +\infty\) so it has neither a maximum nor a minimum. □


Comments

Post a Comment

Popular posts from this blog

Open sets and closed sets in \(\mathbb{R}^n\)

-
Image
Open sets In \(\mathbb{R}\), we have the notion of an open interval such as \((a, b) = \{x \in \mathbb{R} | a < x < b\}\). We want to extend this idea to apply to \(\mathbb{R}^n\). We also introduce the notions of bounded sets and closed sets in \(\mathbb{R}^n\). Recall that the \(\varepsilon\)-neighbor of a point \(x\in\mathbb{R}^n\) is defined as \(N_{\varepsilon}(x) = \{y \in \mathbb{R}^n | d(x, y) < \varepsilon \}\) where \(d(x,y)\) is the distance between \(x\) and \(y\). Definition (Open set) A subset \(U\) of \(\mathbb{R}^n\) is said to be an  open set  if the following holds: \[\forall x \in U ~ \exists \delta > 0 ~ (N_{\delta}(x) \subset U).\tag{Eq:OpenSet}\] That is, for every point in an open set \(U\), we can always find an open ball centered at that point, that is included in \(U\). See the following figure. Perhaps, it is instructive to see what is  not  an open set. Negating (Eq:OpenSet), we have \[\exists x \in U ~ \forall \delta > 0 ~ (N_{\delta}(x) \not
Read more

Euclidean spaces

-
Image
We would like to study multivariate functions (i.e., functions of many variables), continuous multivariate functions in particular. To define continuity, we need a measure of "closeness" between points. One measure of closeness is the Euclidean distance. The set \(\mathbb{R}^n\) (with \(n \in \mathbb{N}\)) with the Euclidean distance function is called a Euclidean space. This is the space where our functions of interest live. The real line is a geometric representation of \(\mathbb{R}\), the set of all real numbers. That is, each \(a \in \mathbb{R}\) is represented as the point \(a\) on the real line. The coordinate plane , or the \(x\)-\(y\) plane , is a geometric representation of \(\mathbb{R}^2\), the set of all pairs of real numbers. Each pair of real numbers \((a, b)\) is visualized as the point \((a, b)\) in the plane. Remark . Recall that \(\mathbb{R}^2 = \mathbb{R}\times\mathbb{R} = \{(x, y) | x, y \in \mathbb{R}\}\) is the Cartesian product of \(\mathbb{R}\) with i
Read more

Newton's method

-
Image
Newton's method (the Newton-Raphson method) is a very powerful numerical method for solving nonlinear equations.  Suppose we'd like to solve a non-linear equation \(f(x) = 0\), where \(f(x)\) is a (twice) differentiable non-linear function. Newton's method generates a sequence of numbers \(c_1, c_2, c_3, \cdots\) that converges to a solution of the equation. That is, if \(\alpha\) is a solution (i.e., \(f(\alpha) = 0\)) then,  \[\lim_{n\to\infty}c_n = \alpha,\] and this sequence \(\{c_n\}\) is generated by a series of linear approximations of the function \(f(x)\). Theorem (Newton's method) Let \(f(x)\) be a function that is twice differentiable on an open interval \(I\) that contains the closed interval \([a, b]\) (i.e., \([a,b]\subset I\)) and satisfy the following conditions: \(f(a) < 0\) and \(f(b) > 0\); For all \(x\in [a, b]\), \(f'(x) > 0\) and \(f''(x) > 0\). Let us define the sequence \(\{c_n\}\) by \[ \begin{eqnarray} c_1 &
Read more