Calculus of complex-valued functions

-

We briefly summarize the calculus of complex-valued functions with a real variable, which is needed to deal with differential equations and Fourier series. In the following, let \(g = g(x)\) be a complex-valued function with a real variable \(x\in \mathbb{R}.\) That is, \(g: \mathbb{R} \to \mathbb{C}\). In short, we can apply all the calculus of real-valued functions to complex-valued functions by treating the imaginary unit \(i=\sqrt{-1}\) as just another constant that happens to satisfy \(i^2 = -1\).



Continuity

\(g(x)\) is said to be continuous at \(x = x_0\) if

\[\lim_{x\to x_0}g(x) = g(x_0)\]

which is equivalent to

\[\lim_{x\to x_0}|g(x) - g(x_0)| = 0,\]

or, to

\[\lim_{x\to x_0}\Re{g(x)} = \Re{g(x_0)}, ~~~\lim_{x\to x_0}\Im{g(x)} = \Im{g(x_0)}\tag{eq:Ccont}\]

where \(\Re{g(x)}\) and \(\Im{g(x)}\) are the real and imaginary parts of \(g(x)\), respectively. According to (eq:Ccont), \(g(x)\) is continuous at \(x=x_0\) if and only if the real part \(\Re{g(x)}\) and the imaginary part \(\Im{g(x)}\) (which are real-valued functions) are continuous at \(x = x_0\). Let \(\bar{z}\) be the complex conjugate of \(z\in\mathbb{C}\). Then \(g\) is continuous if and only if \(\bar{g}\) (the complex conjugate of \(g(x)\)) is continuous.

Differentiation

\(g = g(x)\) is differentiable if and only if both \(\Re{g}\) and \(\Im{g}\) are differentiable. In this case, we have

\[\frac{d}{dx}g = \frac{d}{dx}\Re{g} + i\frac{d}{dx}\Im{g}.\]

Example. Let \(\lambda \in \mathbb{R}\) be a constant. We have

\[e^{i\lambda x} = \cos(\lambda x) + i\sin(\lambda x)\]

and

\[\frac{d}{dx}e^{i\lambda x} = i\lambda e^{i\lambda x} = -\lambda\sin(\lambda x) + i\lambda \cos(\lambda x).\]

□

Note that the Mean Value Theorem does not hold for complex-valued functions!

Example. Consider \(g(x) = e^{ix}\) on \(I = [0, 2\pi]\). This is a continuous function. We have \(g(0) = g(2\pi) = 1\). We have \(g'(x) = ie^{ix}\), and hence \(|g'(x)| = 1\). Thus, there exists no \(\xi\in I\) such that \(g'(\xi) = 0\). Thus, Rolle's Theorem (a special case of the Mean Value Theorem) does not hold for this function. □

Integration

Consider the definite integral \(\int_a^bg(x)\,dx\) of \(g = g(x)\) on \(a \leq x \leq b\). It can be defined by

\[\int_a^bg(x)\,dx = \int_a^b\Re{g(x)}\,dx + i \int_a^b\Im{g(x)}\,dx.\]

Or, equivalently, we can define by the limit of the Riemann sum over the partition \(\Delta: a = x_0 < x_1 < \cdots < x_m = b\),

\[\sigma_{\Delta} = \sum_{k=0}^{m-1}g(\xi_k)(x_{k+1} - x_{k})\]

as the mesh of \(\Delta\) approaches 0. Here \(\xi_k\) is an arbitrary point such that \(x_k \leq \xi_k \leq x_{k+1}\).

Many of the properties of the definite integral of real-valued functions also hold as long as they make sense for complex-valued functions.

  1. If \(g(x)\) is continuous on \([a,b]\), then \(\int_a^bg(x)\,dx\) exists, and \[\left|\int_a^bg(x)dx\right| \leq \int_a^b|g(x)|dx.\]
  2. If \(g(x)\) is continuous on \([a,b]\), then the function \(G(x)\) defined by \[G(x) = \int_a^xg(t)\,dt\] is a primitive function (anti-derivative) of \(g(x)\). That is, \[\frac{d}{dx}G(x) = g(x).\] Conversely, if \(G_1(x)\) is a primitive function of \(g(x)\), then \[\int_a^bg(x)dx = \left[G_1(x)\right]_a^b = G_1(b) - G_1(a).\]

Example. Let \(\gamma\) be a non-zero complex number.
\[\int_a^be^{\gamma x}dx = \left[\frac{e^{\gamma x}}{\gamma}\right]_a^b = \frac{e^{\gamma b} - e^{\gamma a}}{\gamma}.\]
□
Integration by parts, by substitution, Arzelà's theorem, etc., also hold for complex-valued functions. Improper integrals are also defined.

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