Recall that we have defined the natural logarithm to be
and that this construction is well-defined since is injective. The same, however, cannot be said about
in general.
Recall that we have by Euler’s formula, so that
Lemma 1. For any ,
.
Proof. We observe that
Hence, writing ,
Therefore, , but
, so that
is not injective on
. This means that whatever our definition of
such that
, we cannot just define
; the right-hand side is not well-defined.
As such, we should approach this problem with caution, and take baby steps in establishing . Let’s first consider the subset
.
Lemma 2. is bijective.
Proof. Fix and suppose
. Write
and
, so that
Since the left-hand side is positive and real,
Hence, since ,
Therefore, , proving that
is injective.
To prove that is surjective, fix
. Since
has norm
,
for some unique
. Therefore,
. Since
is bijective and
, there exists
such that
. Hence,
, establishing surjectivity.
In fact, defining for any
,
is injective too.
Definition 1. We define the principal logarithm function by
More explicitly,
Furthermore, given , we define the principal argument function by
Observe that by construction, , since
In particular, we are justified to make the following claim:
Theorem 1. .
Proof. By construction,
In a cheeky way, therefore, if we stipulated that
. Unfortunately, however, this convention still means that
is undefined. But this compromise is rather small—we recover
defined on
.
Theorem 2. is holomorphic on
, and
.
Proof. It is clear that is an open set. To prove the derivative of
, recall that
. Writing
and
, since
is continuous at
,
implies
, so that
What about the general complex logarithm for nonzero ? While it is certainly the case that
can take multiple values, one unique value from our construction would be
, so that
. That being said, given any other
such that
, exponential properties dictate that
which means for some
. Therefore,
Therefore, we should think of , rather than
. In this case, we say that
is multi-valued or set-valued.
Theorem 3. Define by
Then and similarly,
as a set-valued function
.
Corollary 1. For any ,
Consequently, .
Proof. By Theorem 3,
Having extended the logarithm, can we extend the exponential? Namely, what would be a meaningful definition for expressions of the form ? Our starting point was expressions of the form
, which we can extend to expressions of the form
via the identity
if . By Theorem 3, expressions of the form
are well-defined set-valued functions whenever
. Fix
. Since
is well-defined too, we can boldly make the definition
To do this precisely doesn’t take terribly much work—just define the set-valued function by
, and subsequently denote
for brevity. Consequently,
In particular, we get a comical answer to evaluating .
Example 1. .
Proof. Using our generalised definition and Theorem 3,
Who knew taking the exponential of two purely imaginary numbers could land us in a set of purely real outcomes!
We conclude with a brief chat about -th roots. Having defined
in the sense that
, it should come to no surprise that
Thus, the equation has two roots, namely
. Which of these roots should
equal? It turns out that either option work just as well algebraically, and so like the logarithm, it is much more helpful to consider
as set-valued. Define
by
. Then define
We call the elements of the
-th roots of unity.
Example 2. . Denoting
,
.
Proof. Fix so that
. Then
and
so that
where varies over
and
Example 3. .
Proof. Suppose so that
. Then
and
Therefore,
Of course, in the setting that , then
can be viewed as a set-valued function with exactly one element.
Complex analysis lends itself immense power to prove theorems that we otherwise would lack the mathematical resource to establish. We will visit these powerful results in the future. For now, we turn our attention to integration—not as straightforward as in the real case.
Remark 1. We could, in fact, define from a group-theoretic perspective. For any
, define
. Since
, there exists
such that
Therefore,
Therefore, the map is surjective and
Now
By the first isomorphism theorem, there exists a bijection
such that
Furthermore,
In this sense, define . Since
,
and doing some book-keeping yields
In the special case ,
and
implies
Hence, define , so that
and , and
To recover our original definitions, use the Archimedean property to find a unique real number . Define
. Then
—Joel Kindiak, 14 Aug 25, 0033H
Leave a comment