The exponentiation operation with integer exponents only requires basic algebra.
Formally, powers with positive integer exponents can be defined by the initial condition a0 = 1 and the recurrence relation an+1 = a·an .
Raising 0 to a negative power would imply division by 0, and so is undefined.
The negative powers of 2 are commonly used, and the first two have special names: half and quarter.
The powers of minus one are useful for expressing alternating sequences.
The powers of i are useful for expressing sequencies of period 4.
Raising a positive real number to a power that is not an integer can also be explained in other ways:
For a given exponent, the inverse of exponentiation is extracting a root.
If
is a positive real number, and n is a positive integer, then the positive real solution to the equation

is called the nth root of 

For example: 81/3 = 2.
Exponentiation with a rational exponent m / n can now be defined as

For example: 82/3 = 4.
Since any real number can be approximated by rational numbers, exponentiation to an arbitrary real exponent can be defined by continuity. For example, if

we can assume

Logarithm method
For a given base, the inverse of exponentiation is taking a logarithm.
If a and b are positive real numbers, then the real solution x to the equation
- bx = a
is called the logarithm of a, base b.
- x = logb(a)
So, exponentiation is sometimes called the antilogarithm.
Define the natural logarithm, ln, of a positive real number, a, as the area under the curve 1/x between from x = 1 to x = a. (The area is negative if a < 1). In terms of integral calculus:

The exponential function ex is the inverse function to the natural logarithm.
- a = eln(a)
Exponentiation in any positive real base, b, can be expressed as:
- bx = ex ln(b)
Complex powers of complex numbers
Summary
Integer powers of complex numbers was defined recursively above:
- z0 = 1
- zn+1 = z·zn
- z−n = 1/zn (for z ≠ 0).
Complex powers of e was defined above.

Complex powers of a complex number:
- az = ebz
if
- a = eb
Trigonometry
From Euler's formula, the purely imaginary powers of e define the real trigonometric functions cosine and sine:


such that


Primitive and principal logarithms of unity
There exists a positive real number, π, such that any solution to the equation: ez = 1 is of the form z = 2πi·n where n is some integer. (These logarithms of unity constitute an additive group because unity constitutes a multiplicative group.) The number 2πi = 2πi·1 is a primitive logarithm of unity, (a generator of the group), while the number 0 = 2πi·0 is the principal logarithm of unity.
- e2πi = e0 = 1.
Root of unity
e2πi(1/n) is a primitive n-th root of unity, while e2πi(0/n) is the principal n-th root of unity.
Multivalued logarithm
The equation, ex=a, where a is a nonzero complex number, has an infinity of solutions. Let x be any of them, then any of them has the form x+2πi·n where n is some integer.
- ex+2πi·n = ex·e2πi·n = ex·(e2πi)n = ex·1n = ex·1 = ex
So the logarithm is a Multivalued function.
Singlevalued logarithm
If a is a positive real number, then one of the solutions to the equation, ex=a, is a real number. It is natural to select this solution as the principal value of the logarithm. In the general case the principal value of the logarithm is more arbitrarily defined as the value having imaginary part in the interval (−π,+π]. The principal value has the advantage of being singlevalued, but the price to be payed is that it ceases to be a continuous function.
Multivalued power
If eb = a, then e(b+2πi·n)x are the values of ax. For example, 41/2 = {+2,−2}. (see square root).
Singlevalued power
If eb = a, and b is the principal value, then ebx is the principal value of ax. For example, the principal value of 41/2 is +2.
Polar form
The typical approach is to write the complex number in polar form: any complex number a + ib can be written as:
![a+ib = r e^{i\varphi} = r \left[ \cos\varphi + i \sin\varphi \right]](http://upload.wikimedia.org/math/4/e/3/4e32b5f4be0f78fd8de4422d30878543.png)
for a positive real magnitude r and a real angle
, where for the right-most equation we have used Euler's formula for
. Then, exponentiation can be written as:

For real x, rx is handled as above. For complex x, we use Euler's formula a second time as explained below.
As for real numbers, above, any non-integer exponent x implies that the answer is not uniquely determined. In particular, we could change
to
(see Pi) for any integer n without changing the formula for a + ib, since ei2πn = 1 by Euler's formula. Different values of n may change the exponential, however, since
in general. For a rational real x, the number of possible values is given by the lowest common denominator of x (see Root of unity), while for other real or complex x there are infinitely many possible values.
By convention, this multi-valuedness is resolved by defining (a + ib)x as the principal value, as for real exponentials above, unless otherwise noted. This means that the angle
is conventionally chosen to lie in the interval ( − π,π].
In the above, we didn't explain how to handle one important case: how do we compute the exponential when x = c + id is complex? In particular, we now have to take the complex exponential
of a positive real number r.
is purely real and is the same as above, so we only need to understand
.
Here, we can once again exploit Euler's formula, since it tells us how to take imaginary powers of one real number e: eid = cosd + isind. Therefore, we just need to rewrite rid in terms of a power of e:
![r^{id} = \left[ (r)^d \right]^i = \left [ \left( e^{\ln r} \right)^d \right]^i = e^{i d \ln r} = \cos(d \ln r) + i\sin(d \ln r).](http://upload.wikimedia.org/math/e/1/8/e188ebf309ea5c58bda5b32e5559b688.png)
Here, as we did above for real exponents, we used the natural logarithm function ln to write
.
So, we can finally write:
![(a+ib)^{c+id} = \left( r e^{i\varphi} \right)^{c+id} = \left[ r^c e^{-\varphi d} \right] e^{i(\varphi c + d \ln r)}](http://upload.wikimedia.org/math/8/6/f/86f847e9229fe004b985140182662605.png)
where we have written the final expression in polar form as a real magnitude multiplied by a complex phase, and have used the fact that
.
Examples

This is the principal value of ii. One could also write
for any integer n, resulting in an infinite set of possible definitions

However, according to standard conventions the expression ii denotes the principal value (n = 0) unless otherwise specified.
In the same way, one can define exponentiation of negative real numbers, since any negative real number − r can be written:

and thus the principal value of the exponent is
(with the exponential rx of a positive number r defined above).
Solving polynomial equations
It was once conjectured that the roots of any polynomial could be expressed in terms of exponentiation with fractional exponents. (See Quadratic equation).
That this is not true in general is the assertion of the Abel-Ruffini theorem.
For example, the solutions of the equation x5 = x+1 cannot be expressed in terms of fractional exponents.
For solving any equation of the nth degree, see the Durand-Kerner method.
Advanced topics
Efficiently computing exponents
It may seem that computing an requires n−1 multiplications, but this can be reduced using exponentiation by squaring or addition-chain exponentiation, both of which are types of dynamic programming.
Exponents on function names
When the name or symbol of a function is given an integer superscript, as if being raised to a power, this commonly refers to repeated function composition rather than repeated multiplication. Thus f3(x) may mean f(f(f(x))); in particular, f -1(x) usually denotes f's inverse function.
A special syntax applies to the trigonometric functions: a positive exponent applied to the function's abbreviation means that the result is raised to that power, while an exponent of -1 indicates the inverse function. That is, sin2x is just a shorthand way to write (sin x)2 without using parentheses, whereas sin-1x refers to the inverse function of the sine, also called arcsin x. There is no need for a shorthand for the reciprocals of trigonometric functions since each has its own name and abbreviation, for example (sin x)-1 is normally just written as csc x.
Exponentiation in abstract algebra
Exponentiation can also be understood purely in terms of abstract algebra, if we limit the exponents to integers.
Specifically, suppose that X is a set with a power-associative binary operation, which we will write multiplicatively. In this very general situation, we can define xn for any element x of X and any nonzero natural number n, by simply multiplying x by itself n times; by definition, power associativity means that it doesn't matter in which order we perform the multiplications.
Now additionally suppose that the operation has an identity element 1. Then we can define x0 to be equal to 1 for any x. Now xn is defined for any natural number n, including 0.
Finally, suppose that the operation has inverses, and that the multiplication is associative (so that the magma is a group). Then we can define x−n to be the inverse of xn when n is a natural number. Now xn is defined for any integer n.
Exponentiation in this purely algebraic sense satisfies the following laws (whenever both sides are defined):
Here, we use a division slash ("/") to indicate multiplying by an inverse, in order to reserve the symbol x−1 for raising x to the power −1, rather than the inverse of x. However, as one of the laws above states, x−1 is always equal to the inverse of x, so the notation doesn't matter in the end.
If in addition the multiplication operation is commutative (so that the magma is an abelian group), then we have some additional laws:
- (xy)n = xnyn
- (x/y)n = xn/yn
It is necessary to let 00 be 1, just like every other case of x0. For example, expanding (0 + x)n by the binomial theorem, it is necessary to take 00 = 1.
If we take this whole theory of exponentiation in an algebraic context but write the binary operation additively, then "exponentiation is repeated multiplication" can be reinterpreted as "multiplication is repeated addition". Thus, each of the laws of exponentiation above has an analogue among laws of multiplication.
When one has several operations around, any of which might be repeated using exponentiation, it is common to indicate which operation is being repeated by placing its symbol in the superscript. Thus, x*n is x * ··· * x, while x#n is x # ··· # x, whatever the operations * and # might be.
Exponential notation is also used, especially in group theory, to indicate conjugation. That is, gh = h-1gh, where g and h are elements of some group. Although conjugation obeys some of the same laws as exponentiation, it is not an example of repeated multiplication in any sense. A quandle is an algebraic structure in which these laws of conjugation play a central role.
Exponentiation over sets
The above algebraic treatment of exponentiation builds a finitary operation out of a binary operation. In more general contexts, one may be able to define an infinitary operation directly on an indexed set.
For example, in the arithmetic of cardinal numbers, it makes sense to consider the product

for any indexed family of cardinal numbers, (ki)i in N. By taking ki = k for every i, this can be interpreted as a repeated product, and the result is kN. In fact, this result depends only on the cardinality of N, so we can define exponentiation of cardinal numbers so that kn is kN for any set N whose cardinality is n.
This can be done even for operations on sets or sets with extra structure. For example, in linear algebra, it makes sense to index direct sums of vector spaces over arbitrary index sets. That is, we can speak of

where each Vi is a vector space. Then if Vi = V for each i, the resulting direct sum can be written in exponential notation as V(+)N, or simply VN with the understanding that the direct sum is the default. We can again replace the set N with a cardinal number n to get Vn, although without choosing a specific standard set with cardinality n, this is defined only up to isomorphism. Taking V to be the field R of real numbers (thought of as a vector space over itself) and n to be some natural number, we get the vector space that is most commonly studied in linear algebra, the Euclidean space Rn.
If the base of the exponentiation operation is a set, then by default we assume the operation to be the Cartesian product. In that case, SN becomes simply the set of all functions from N to S. This fits in with the exponentiation of cardinal numbers once gain, in the sense that |SN| = |S||N|, where |X| is the cardinality of X. When N=2={0,1}, we have |2X| = 2|X|, where 2X, usually denoted by PX, is the power set of X. (This is where the term "power set" comes from.)
Note that exponentiation of cardinal numbers doesn't match up with exponentiation of ordinal numbers, which is defined by a limit process. In the ordinal numbers, ab is the smallest ordinal number greater than ac for c < b when b is a limit ordinal, and of course ab+1 := aba.
In category theory, we learn to raise any object in a wide variety of categories to the power of a set, or even to raise an object to the power of an object, using the exponential.
Exponentiation in programming languages
The mathematical notation xy is neat for handwriting but awkward on typewriters and computers. So the programming languages have other ways of expressing exponentiation:
- x ↑ y: Algol programming language
- x ^ y: BASIC, Matlab, J programming language, Microsoft Excel and many others
- x ** y: Fortran, Perl, Python programming language, Ruby programming language, ADA programming language, FoxPro
- x * y: APL programming language
- Power(x, y): Excel, Pascal programming language
- pow(x, y): C programming language, C++, PHP
- Math.pow(x, y): Java programming language, JavaScript, Modula-3
- Math.Pow(x, y): C#
- (expt x y): Common Lisp
In C, C++, C#, Java and JavaScript, the symbol ^ represents bitwise XOR. In Pascal, it represents indirection.
Table of powers
Table of kn, with k on the left and n at the top.
|
|
n |
|
|
1 |
2 |
3 |
4 |
5 |
6 |
7 |
8 |
9 |
10 |
| k^ |
1 |
1 |
1 |
1 |
1 |
1 |
1 |
1 |
1 |
1 |
1 |
1 |
| 2 |
2 |
4 |
8 |
16 |
32 |
64 |
128 |
256 |
512 |
1,024 |
2 |
| 3 |
3 |
9 |
27 |
81 |
243 |
729 |
2,187 |
6,561 |
19,683 |
59,049 |
3 |
| 4 |
4 |
16 |
64 |
256 |
1,024 |
4,096 |
16,384 |
65,536 |
262,144 |
1,048,576 |
4 |
| 5 |
5 |
25 |
125 |
625 |
3,125 |
15,625 |
78,125 |
390,625 |
1,953,125 |
9,765,625 |
5 |
| 6 |
6 |
36 |
216 |
1,296 |
7,776 |
46,656 |
279,936 |
1,679,616 |
10,077,696 |
60,466,176 |
6 |
| 7 |
7 |
49 |
343 |
2,401 |
16,807 |
117,649 |
823,543 |
5,764,801 |
40,353,607 |
282,475,249 |
7 |
| 8 |
8 |
64 |
512 |
4,096 |
32,768 |
262,144 |
2,097,152 |
16,777,216 |
134,217,728 |
1,073,741,824 |
8 |
| 9 |
9 |
81 |
729 |
6,561 |
59,049 |
531,441 |
4,782,969 |
43,046,721 |
387,420,489 |
3,486,784,401 |
9 |
| 10 |
10 |
100 |
1,000 |
10,000 |
100,000 |
1,000,000 |
10,000,000 |
100,000,000 |
1,000,000,000 |
10,000,000,000 |
10 |
|
|
1 |
2 |
3 |
4 |
5 |
6 |
7 |
8 |
9 |
10 |
|
|
n |
Generalization
The next generalized operation after multiplication and exponentiation is sometimes called tetration; repeating this process leads to the Ackermann function.
See also
External links