What does mean? If
, then
no matter what
we choose (except perhaps
, but that’s a debate for another day). Suppose
. Let’s work with the easiest case:
being a positive natural number.
Definition 1. For any natural number , we define
inductively as follows:
Here, .
This definition captures the idea of exponentiation as repeated multiplication. Not too shabby. This immediately gives us three fundamental formulas that will motivate our various definitions later on.
Theorem 1. Let be any real number. For natural numbers
,
Proof. Either use repeated multiplication, or more rigorously, mathematical induction.
We want to define reasonably so that these rules are satisfied. We will abbreviate our exploration as follows.
Definition 2. Let be a real number and
be a set. Define the predicates
on
by
We are now going to extend our definition of , so that
on
.
The most natural extension is to consider . Whatever our definition of
is, it should be consistent with
Theorem 2. Let be a real number. If
on
, then
.
Proof. By assumption, since ,
Definition 3. For any real number ,
. Consequently,
for any
.
One can verify that on
.
Now, recall the the predicate
If on
, then
implies
This gives us the following observation.
Theorem 3. Defining ,
on
.
These definitions allow us to define for rational
. What about
? If
on
, then by considering
,
Theorem 4. Defining ,
on
.
Surprisingly, that is the straightforward part of the discussion. The real challenge begins now: what is for real
, so that
on
? We need more tools using limits to establish this result.
—Joel Kindiak, 15 Dec 24, 0146H
Leave a comment