Exponentiation

Exponentiation is a mathematical operation, written as , involving two numbers, the ''base'' and the ''exponent'' or ''power'' , and pronounced as " raised to the power of ". When is a positive integer, exponentiation corresponds to repeated

multiplication

of the base: that is, is the product of multiplying bases:

:$b^n = \underbrace_.$

The exponent is usually shown as a

superscript

to the right of the base. In that case, is called "''b'' raised to the ''n''th power", "''b'' raised to the power of ''n''", "the ''n''th power of ''b''", "''b'' to the ''n''th power", or most briefly as "''b'' to the ''n''th".

One has , and, for any positive integers and , one has . To extend this property to non-positive integer exponents, is defined to be , and (with a positive integer and not zero) is defined as . In particular, is equal to , the ''

reciprocal

'' of .

The definition of exponentiation can be extended to allow any real or complex exponent. Exponentiation by integer exponents can also be defined for a wide variety of algebraic structures, including matrices.

Exponentiation is used extensively in many fields, including

economics

,

biology

,

chemistry

,

physics

, and computer science, with applications such as

compound interest

, population growth, chemical reaction kinetics,

wave

behavior, and public-key cryptography.

History of the notation

The term ''power'' ( la, potentia, potestas, dignitas) is a mistranslation of the ancient Greek δύναμις (''dúnamis'', here: "amplification") used by the Greek mathematician

Euclid

for the square of a line, following Hippocrates of Chios. In ''The Sand Reckoner'',

Archimedes

discovered and proved the law of exponents, , necessary to manipulate powers of . In the 9th century, the Persian mathematician Muhammad ibn Mūsā al-Khwārizmī used the terms مَال (''māl'', "possessions", "property") for a square—the Muslims, "like most mathematicians of those and earlier times, thought of a squared number as a depiction of an area, especially of land, hence property"—and كَعْبَة (''

kaʿbah

'', "cube") for a cube, which later Islamic mathematicians represented in mathematical notation as the letters '' mīm'' (m) and ''kāf'' (k), respectively, by the 15th century, as seen in the work of Abū al-Hasan ibn Alī al-Qalasādī.

In the late 16th century, Jost Bürgi used Roman numerals for exponents.

Nicolas Chuquet used a form of exponential notation in the 15th century, which was later used by Henricus Grammateus and Michael Stifel in the 16th century. The word ''exponent'' was coined in 1544 by Michael Stifel. Samuel Jeake introduced the term ''indices'' in 1696. In the 16th century, Robert Recorde used the terms square, cube, zenzizenzic (fourth power), sursolid (fifth), zenzicube (sixth), second sursolid (seventh), and zenzizenzizenzic (eighth). ''Biquadrate'' has been used to refer to the fourth power as well.

Early in the 17th century, the first form of our modern exponential notation was introduced by

René Descartes

in his text titled ''La Géométrie''; there, the notation is introduced in Book I.

Some mathematicians (such as

Isaac Newton

) used exponents only for powers greater than two, preferring to represent squares as repeated multiplication. Thus they would write

polynomial

s, for example, as .

Another historical synonym, involution, is now rare and should not be confused with its more common meaning.

In 1748,

Leonhard Euler

introduced variable exponents, and, implicitly, non-integer exponents by writing:

"consider exponentials or powers in which the exponent itself is a variable. It is clear that quantities of this kind are not algebraic functions, since in those the exponents must be constant."

Terminology

The expression is called "the square of ''b''" or "''b'' squared", because the area of a square with side-length is .

Similarly, the expression is called "the cube of ''b''" or "''b'' cubed", because the volume of a cube with side-length is .

When it is a positive integer, the exponent indicates how many copies of the base are multiplied together. For example, . The base appears times in the multiplication, because the exponent is . Here, is the ''5th power of 3'', or ''3 raised to the 5th power''.

The word "raised" is usually omitted, and sometimes "power" as well, so can be simply read "3 to the 5th", or "3 to the 5". Therefore, the exponentiation can be expressed as "''b'' to the power of ''n''", "''b'' to the ''n''th power", "''b'' to the ''n''th", or most briefly as "''b'' to the ''n''".

A formula with nested exponentiation, such as (which means and not ), is called a tower of powers, or simply a tower.

Integer exponents

The exponentiation operation with integer exponents may be defined directly from elementary arithmetic operations.

Positive exponents

The definition of the exponentiation as an iterated multiplication can be formalized by using induction, and this definition can be used as soon one has an associative multiplication:

The base case is
:$b^1 = b$
and the recurrence is
:$b^ = b^n \cdot b.$

The associativity of multiplication implies that for any positive integers and ,
:$b^ = b^m \cdot b^n,$
and
:$(b^m)^n=b^.$

Zero exponent

By definition, any nonzero number raised to the power is :
:$b^0=1.$

This definition is the only possible that allows extending the formula
:$b^=b^m\cdot b^n$
to zero exponents. It may be used in every algebraic structure with a multiplication that has an identity.

Intuitionally, $b^0$ may be interpreted as the empty product of copies of . So, the equality $b^0=1$ is a special case of the general convention for the empty product.

The case of is more complicated. In contexts where only integer powers are considered, the value is generally assigned to $0^0,$ but, otherwise, the choice of whether to assign it a value and what value to assign may depend on context.

Negative exponents

Exponentiation with negative exponents is defined by the following identity, which holds for any integer and nonzero :
:$b^ = \frac.$
Raising 0 to a negative exponent is undefined, but in some circumstances, it may be interpreted as infinity ($\infty$).

This definition of exponentiation with negative exponents is the only one that allows extending the identity $b^=b^m\cdot b^n$ to negative exponents (consider the case $m=-n$).

The same definition applies to invertible elements in a multiplicative monoid, that is, an algebraic structure, with an associative multiplication and a multiplicative identity denoted (for example, the square matrices of a given dimension). In particular, in such a structure, the inverse of an invertible element is standardly denoted $x^.$

Identities and properties

The following identities, often called , hold for all integer exponents, provided that the base is non-zero:
:$\begin b^ &= b^m \cdot b^n \\ \left(b^m\right)^n &= b^ \\ (b \cdot c)^n &= b^n \cdot c^n \end$

Unlike addition and multiplication, exponentiation is not commutative. For example, . Also unlike addition and multiplication, exponentiation is not associative. For example, , whereas . Without parentheses, the conventional

order of operations

for serial exponentiation in superscript notation is top-down (or ''right''-associative), not bottom-up (or ''left''-associative). That is,
:$b^ = b^,$
which, in general, is different from
:$\left(b^p\right)^q = b^ .$

Powers of a sum

The powers of a sum can normally be computed from the powers of the summands by the binomial formula
:$(a+b)^n=\sum_^n \binoma^ib^=\sum_^n \fraca^ib^.$

However, this formula is true only if the summands commute (i.e. that ), which is implied if they belong to a structure that is commutative. Otherwise, if and are, say, square matrices of the same size, this formula cannot be used. It follows that in computer algebra, many

algorithm

s involving integer exponents must be changed when the exponentiation bases do not commute. Some general purpose

computer algebra system

s use a different notation (sometimes instead of ) for exponentiation with non-commuting bases, which is then called non-commutative exponentiation.

Combinatorial interpretation

For nonnegative integers and , the value of is the number of functions from a set of elements to a set of elements (see cardinal exponentiation). Such functions can be represented as -tuples from an -element set (or as -letter words from an -letter alphabet). Some examples for particular values of and are given in the following table:

:

Particular bases

Powers of ten

In the base ten (decimal) number system, integer powers of are written as the digit followed or preceded by a number of zeroes determined by the sign and magnitude of the exponent. For example, and .

Exponentiation with base is used in scientific notation to denote large or small numbers. For instance, (the speed of light in vacuum, in metres per second) can be written as and then approximated as .

SI prefixes based on powers of are also used to describe small or large quantities. For example, the prefix kilo means , so a kilometre is .

Powers of two

The first negative powers of are commonly used, and have special names, e.g.: ''half'' and ''

quarter

''.

Powers of appear in set theory, since a set with members has a power set, the set of all of its

subset

s, which has members.

Integer powers of are important in computer science. The positive integer powers give the number of possible values for an -bit integer binary number; for example, a byte may take different values. The binary number system expresses any number as a sum of powers of , and denotes it as a sequence of and , separated by a binary point, where indicates a power of that appears in the sum; the exponent is determined by the place of this : the nonnegative exponents are the rank of the on the left of the point (starting from ), and the negative exponents are determined by the rank on the right of the point.

Powers of one

The powers of one are all one: .

The first power of a number is the number itself: $n^1=n.$

Powers of zero

If the exponent is positive (), the th power of zero is zero: .

If the exponent is negative (), the th power of zero is undefined, because it must equal $1/0^$ with , and this would be $1/0$ according to above.

The expression is either defined as 1, or it is left undefined.

Powers of negative one

If is an even integer, then .

If is an odd integer, then .

Because of this, powers of are useful for expressing alternating

sequence

s. For a similar discussion of powers of the complex number , see .

Large exponents

The limit of a sequence of powers of a number greater than one diverges; in other words, the sequence grows without bound:
: as when

This can be read as "''b'' to the power of ''n'' tends to +∞ as ''n'' tends to infinity when ''b'' is greater than one".

Powers of a number with

absolute value

less than one tend to zero:
: as when

Any power of one is always one:
: for all if

Powers of alternate between and as alternates between even and odd, and thus do not tend to any limit as grows.

If , , alternates between larger and larger positive and negative numbers as alternates between even and odd, and thus does not tend to any limit as grows.

If the exponentiated number varies while tending to as the exponent tends to infinity, then the limit is not necessarily one of those above. A particularly important case is
: as

See ' below.

Other limits, in particular those of expressions that take on an indeterminate form, are described in below.

Power functions

Real functions of the form $f(x) = cx^n$, where $c \ne 0$, are sometimes called power functions. When $n$ is an integer and $n \ge 1$, two primary families exist: for $n$ even, and for $n$ odd. In general for $c > 0$, when $n$ is even $f(x) = cx^n$ will tend towards positive infinity with increasing $x$, and also towards positive infinity with decreasing $x$. All graphs from the family of even power functions have the general shape of $y=cx^2$, flattening more in the middle as $n$ increases. Functions with this kind of

symmetry

are called even functions.

When $n$ is odd, $f(x)$'s asymptotic behavior reverses from positive $x$ to negative $x$. For $c > 0$, $f(x) = cx^n$ will also tend towards positive infinity with increasing $x$, but towards negative infinity with decreasing $x$. All graphs from the family of odd power functions have the general shape of $y=cx^3$, flattening more in the middle as $n$ increases and losing all flatness there in the straight line for $n=1$. Functions with this kind of symmetry are called odd functions.

For $c < 0$, the opposite asymptotic behavior is true in each case.

Table of powers of decimal digits

Rational exponents

If is a nonnegative real number, and is a positive integer, $x^\frac 1n$ or \sqrt denotes the unique positive real th root of , that is, the unique positive real number such that $y^n=x.$

If is a positive real number, and $\frac pq$ is a rational number, with and integers, then $x^\frac pq$ is defined as
:$x^\frac pq= \left(x^p\right)^\frac 1q=(x^\frac 1q)^p.$
The equality on the right may be derived by setting $y=x^\frac 1q,$ and writing $(x^\frac 1q)^p=y^p=\left((y^p)^q\right)^\frac 1q=\left((y^q)^p\right)^\frac 1q=(x^p)^\frac 1q.$

If is a positive rational number, $0^r=0,$ by definition.

All these definitions are required for extending the identity $(x^r)^s = x^$ to rational exponents.

On the other hand, there are problems with the extension of these definitions to bases that are not positive real numbers. For example, a negative real number has a real th root, which is negative if is odd, and no real root if is even. In the latter case, whichever complex th root one chooses for $x^\frac 1n,$ the identity $(x^a)^b=x^$ cannot be satisfied. For example,
:$\left((-1)^2\right)^\frac 12 = 1^\frac 12= 1\neq (-1)^ =(-1)^1=-1.$

See and for details on the way these problems may be handled.

Real exponents

For positive real numbers, exponentiation to real powers can be defined in two equivalent ways, either by extending the rational powers to reals by continuity (, below), or in terms of the

logarithm

of the base and the

exponential function

(, below). The result is always a positive real number, and the identities and properties shown above for integer exponents remain true with these definitions for real exponents. The second definition is more commonly used, since it generalizes straightforwardly to

complex

exponents.

On the other hand, exponentiation to a real power of a negative real number is much more difficult to define consistently, as it may be non-real and have several values (see ). One may choose one of these values, called the principal value, but there is no choice of the principal value for which the identity
:$\left(b^r\right)^s = b^$
is true; see . Therefore, exponentiation with a basis that is not a positive real number is generally viewed as a

multivalued function

.

Limits of rational exponents

Since any irrational number can be expressed as the limit of a sequence of rational numbers, exponentiation of a positive real number with an arbitrary real exponent can be defined by continuity with the rule
:$b^x = \lim_ b^r \quad (b \in \mathbb^+,\, x \in \mathbb),$
where the limit is taken over rational values of only. This limit exists for every positive and every real .

For example, if , the non-terminating decimal representation and the monotonicity of the rational powers can be used to obtain intervals bounded by rational powers that are as small as desired, and must contain $b^\pi:$
:\left ^3, b^4\right \left ^, b^\right \left ^, b^\right \left ^, b^\right \left ^, b^\right \left ^, b^\right \ldots
So, the upper bounds and the lower bounds of the intervals form two sequences that have the same limit, denoted $b^\pi.$

This defines $b^x$ for every positive and real as a continuous function of and . See also Well-defined expression.

The exponential function

The ''exponential function'' is often defined as $x\mapsto e^x,$ where $e\approx 2.718$ is Euler's number. For avoiding

circular reasoning

, this definition cannot be used here. So, a definition of the exponential function, denoted $\exp(x),$ and of Euler's number are given, which rely only on exponentiation with positive integer exponents. Then a proof is sketched that, if one uses the definition of exponentiation given in preceding sections, one has
:$\exp(x)=e^x.$

There are many equivalent ways to define the exponential function, one of them being

:$\exp(x) = \lim_ \left(1 + \frac\right)^n.$

One has $\exp(0)=1,$ and the ''exponential identity'' $\exp(x+y)=\exp(x)\exp(y)$ holds as well, since

:$\exp(x)\exp(y) = \lim_ \left(1 + \frac\right)^n\left(1 + \frac\right)^n = \lim_ \left(1 + \frac + \frac\right)^n,$

and the second-order term $\frac$ does not affect the limit, yielding $\exp(x)\exp(y) = \exp(x+y)$.

Euler's number can be defined as $e=\exp(1)$. It follows from the preceding equations that $\exp(x)=e^x$ when is an integer (this results from the repeated-multiplication definition of the exponentiation). If is real, $\exp(x)=e^x$ results from the definitions given in preceding sections, by using the exponential identity if is rational, and the continuity of the exponential function otherwise.

The limit that defines the exponential function converges for every

complex

value of , and therefore it can be used to extend the definition of $\exp(z)$, and thus $e^z,$ from the real numbers to any complex argument . This extended exponential function still satifies the exponential identity, and is commonly used for defining exponentiation for complex base and exponent.

Powers via logarithms

The definition of as the exponential function allows defining for every positive real numbers , in terms of exponential and

logarithm

function. Specifically, the fact that the natural logarithm is the inverse of the exponential function means that one has
: $b = \exp(\ln b)=e^$
for every . For preserving the identity $(e^x)^y=e^,$ one must have
:$b^x=\left(e^ \right)^x = e^$

So, $e^$ can be used as an alternative definition of for any positive real . This agrees with the definition given above using rational exponents and continuity, with the advantage to extend straightforwardly to any complex exponent.

Complex exponents with a positive real base

If is a positive real number, exponentiation with base and

complex

exponent is defined by means of the exponential function with complex argument (see the end of , above) as
:$b^z = e^,$
where $\ln b$ denotes the natural logarithm of .

This satisfies the identity
:$b^ = b^z b^t,$
In general,
$\left(b^z\right)^t$ is not defined, since is not a real number. If a meaning is given to the exponentiation of a complex number (see , below), one has, in general,
:$\left(b^z\right)^t \ne b^,$
unless is real or is integer.

Euler's formula

,
:$e^ = \cos y + i \sin y,$
allows expressing the polar form of $b^z$ in terms of the real and imaginary parts of , namely
:$b^= b^x(\cos(y\ln b)+i\sin(y\ln b)),$
where the

absolute value

of the

trigonometric

factor is one. This results from
:$b^=b^x b^=b^x e^ =b^x(\cos(y\ln b)+i\sin(y\ln b)).$

Non-integer powers of complex numbers

In the preceding sections, exponentiation with non-integer exponents has been defined for positive real bases only. For other bases, difficulties appear already with the apparently simple case of th roots, that is, of exponents $1/n,$ where is a positive integer. Although the general theory of exponentiation with non-integer exponents applies to th roots, this case deserves to be considered first, since it does not need to use complex logarithms, and is therefore easier to understand.

th roots of a complex number

Every nonzero complex number may be written in polar form as
:$z=\rho e^=r(cos \theta +i \sin \theta),$
where $\rho$ is the

absolute value

of , and $\theta$ is its argument. The argument is defined up to an integer multiple of ; this means that, if $\theta$ is the argument of a complex number, then $\theta +2k\pi$ is also an argument of the same complex number.

The polar form of the product of two complex numbers is obtained by multiplying the absolute values and adding the arguments. It follows that the polar form of an th root of a complex number can be obtained by taking the th root of the absolute value and dividing its argument by :
:\left(\rho e^\right)^\frac 1n=\sqrt rho \,e^\fracn.

If $2i\pi$ is added to $\theta,$ the complex number in not changed, but this adds $2i\pi/n$ to the argument of the th root, and provides a new th root. This can be done times, and provides the th roots of the complex number.

It is usual to choose one of the th root as the principal root. The common choice is to choose the th root for which $-\pi<\theta\le \pi,$ that is, the th root that has the largest real part, and, if they are two, the one with positive imaginary part. This makes the principal th root a continuous function in the whole complex plane, except for negative real values of the radicand. This function equals the usual th root for positive real radicands. For negative real radicands, and odd exponents, the principal th root is not real, although the usual th root is real.

Analytic continuation

shows that the principal th root is the unique complex differentiable function that extends the usual th root to the complex plane without the nonpositive real numbers.

If the complex number is moved around zero by increasing its argument, after an increment of $2\pi,$ the complex number comes back to its initial position, and its th roots are

permuted circularly

(they are multiplied by $e^$). This shows that it is not possible to define a th root function that is not continuous in the whole complex plane.

Roots of unity

The th roots of unity are the complex numbers such that , where is a positive integer. They arise in various areas of mathematics, such as in discrete Fourier transform or algebraic solutions of algebraic equations (Lagrange resolvent).

The th roots of unity are the first powers of $\omega =e^\frac$, that is $1=\omega^0=\omega^n, \omega=\omega^1, \omega^2, \omega^.$ The th roots of unity that have this generating property are called ''primitive th roots of unity''; they have the form $\omega^k=e^\frac,$ with coprime with . The unique primitive square root of unity is $-1;$ the primitive fourth roots of unity are $i$ and $-i.$

The th roots of unity allow expressing all th roots of a complex number as the products of a given th roots of with a th root of unity.

Geometrically, the th roots of unity lie on the

unit circle

of the complex plane at the vertices of a regular -gon with one vertex on the real number 1.

As the number $e^\frac$ is the primitive th root of unity with the smallest positive argument, it is called the ''principal primitive th root of unity'', sometimes shortened as ''principal th root of unity'', although this terminology can be confused with the principal value of $1^$ which is 1.

Complex exponentiation

Defining exponentiation with complex bases leads to difficulties that are similar to those described in the preceding section, except that there are, in general, infinitely many possible values for $z^w$. So, either a principal value is defined, which is not continuous for the values of that are real and nonpositive, or $z^w$ is defined as a

multivalued function

.

In all cases, the complex logarithm is used to define complex exponentiation as
:$z^w=e^,$
where $\log z$ is the variant of the complex logarithm that is used, which is, a function or a

multivalued function

such that
:$e^=z$
for every in its domain of definition.

Principal value

The principal value of the complex logarithm is the unique function, commonly denoted $\log,$ such that, for every nonzero complex number ,
:$e^=z,$
and the imaginary part of satisfies
:$-\pi <\mathrm \le \pi.$
The principal value of the complex logarithm is not defined for $z=0,$ it is discontinuous at negative real values of , and it is holomorphic (that is, complex differentiable) elsewhere. If is real and positive, the principal value of the complex logarithm is the natural logarithm: $\log z=\ln z.$

The principal value of $z^w$ is defined as
$z^w=e^,$
where $\log z$ is the principal value of the logarithm.

The function $(z,w)\to z^w$ is holomorphic except in the neighbourhood of the points where is real and nonpositive.

If is real and positive, the principal value of $z^w$ equals its usual value defined above. If $w=1/n,$ where is an integer, this principal value is the same as the one defined above.

Multivalued function

In some contexts, there is a problem with the discontinuity of the principal values of $\log z$ and $z^w$ at the negative real values of . In this case, it is useful to consider these functions as

multivalued function

s.

If $\log z$ denotes one of the values of the multivalued logarithm (typically its principal value), the other values are $2ik\pi +\log z,$ where is any integer. Similarly, if $z^w$ is one value of the exponentiation, then the other values are given by
:$e^ = z^we^,$
where is any integer.

Different values of give different values of $z^w$ unless is a rational number, that is, there is an integer such that is an integer. This results from the

periodicity

of the exponential function, more specifically, that $e^a=e^b$ if and only if $a-b$ is an integer multiple of $2\pi i.$

If $w=\frac mn$ is a rational number with and coprime integers with $n>0,$ then $z^w$ has exactly values. In the case $m=1,$ these values are the same as those described in § th roots of a complex number. If is an integer, there is only one value that agrees with that of .

The multivalued exponentiation is holomorphic for $z\ne 0,$ in the sense that its

graph

consists of several sheets that define each a holomorphic function in the neighborhood of every point. If varies continuously along a circle around , then, after a turn, the value of $z^w$ has changed of sheet.

Computation

The ''canonical form'' $x+iy$ of $z^w$ can be computed from the canonical form of and . Although this can be described by a single formula, it is clearer to split the computation in several steps.

*''Polar form of ''. If $z=a+ib$ is the canonical form of ( and being real), then its polar form is $z=\rho e^= \rho (\cos\theta + i \sin\theta),$ where $\rho=\sqrt$ and $\theta=\operatorname(a,b)$ (see

atan2

for the definition of this function).
*''Logarithm of ''. The principal value of this logarithm is $\log z=\ln \rho+i\theta,$ where $\ln$ denotes the natural logarithm. The other values of the logarithm are obtained by adding $2ik\pi$ for any integer .
*''Canonical form of $w\log z.$'' If $w=c+di$ with and real, the values of $w\log z$ are $w\log z = (c\ln \rho - d\theta-2dk\pi) +i (d\ln \rho + c\theta+2ck\pi),$ the principal value corresponding to $k=0.$
*''Final result.'' Using the identities $e^=e^xe^y$ and $e^ =x^y,$ one gets $z^w=\rho^c e^ \left(\cos (d\ln \rho + c\theta+2ck\pi) +i\sin(d\ln \rho + c\theta+2ck\pi)\right),$ with $k=0$ for the principal value.

=Examples

=

* $i^i$
The polar form of is $i=e^,$ and the values of $\log i$ are thus $\log i=i\left(\frac \pi 2 +2k\pi\right).$ It follows that $i^i=e^=e^ e^.$So, all values of $i^i$ are real, the principal one being $e^ \approx 0.2079.$

*$(-2)^$
Similarly, the polar form of is $-2 = 2e^.$ So, the above described method gives the values $\begin (-2)^ &= 2^3 e^ (\cos(4\ln 2 + 3(\pi +2k\pi)) +i\sin(4\ln 2 + 3(\pi+2k\pi)))\\ &=-2^3 e^(\cos(4\ln 2) +i\sin(4\ln 2)). \end$In this case, all the values have the same argument $4\ln 2,$ and different absolute values.

In both examples, all values of $z^w$ have the same argument. More generally, this is true if and only if the real part of is an integer.

Failure of power and logarithm identities

Some identities for powers and logarithms for positive real numbers will fail for complex numbers, no matter how complex powers and complex logarithms are defined ''as single-valued functions''. For example:

Irrationality and transcendence

If is a positive real algebraic number, and is a rational number, then is an algebraic number. This results from the theory of algebraic extensions. This remains true if is any algebraic number, in which case, all values of (as a

multivalued function

) are algebraic. If is irrational (that is, ''not rational''), and both and are algebraic, Gelfond–Schneider theorem asserts that all values of are transcendental (that is, not algebraic), except if equals or .

In other words, if is irrational and $b\not\in \,$ then at least one of , and is transcendental.

Integer powers in algebra

The definition of exponentiation with positive integer exponents as repeated multiplication may apply to any associative operation denoted as a multiplication.More generally, power associativity is sufficient for the definition. The definition of $x^0$ requires further the existence of a multiplicative identity.

An algebraic structure consisting of a set together with an associative operation denoted multiplicatively, and a multiplicative identity denoted by 1 is a monoid. In such a monoid, exponentiation of an element is defined inductively by
* $x^0 = 1,$
* $x^ =x x^n$ for every nonnegative integer .

If is a negative integer, $x^n$ is defined only if has a

multiplicative inverse

. In this case, the inverse of is denoted $x^,$ and $x^n$ is defined as $\left(x^\right)^.$

Exponentiation with integer exponents obeys the following laws, for and in the algebraic structure, and and integers:
:$\begin x^0&=1\\ x^&=x^m x^n\\ (x^m)^n&=x^\\ (xy)^n&=x^n y^n \quad \text xy=yx, \text \end$

These definitions are widely used in many areas of mathematics, notably for groups, rings, fields, square matrices (which form a ring). They apply also to functions from a set to itself, which form a monoid under function composition. This includes, as specific instances, geometric transformations, and endomorphisms of any mathematical structure.

When there are several operations that may be repeated, it is common to indicate the repeated operation by placing its symbol in the superscript, before the exponent. For example, if is a real function whose valued can be multiplied, $f^n$ denotes the exponentiation with respect of multiplication, and $f^$ may denote exponentiation with respect of function composition. That is,
:$(f^n)(x)=(f(x))^n=f(x) \,f(x) \cdots f(x),$
and
:$(f^)(x)=f(f(\cdots f(f(x))\cdots)).$
Commonly, $(f^n)(x)$ is denoted $f(x)^n,$ while $(f^)(x)$ is denoted $f^n(x).$

In a group

A multiplicative group is a set with as associative operation denoted as multiplication, that has an identity element, and such that every element has an inverse.

So, if is a group, $x^n$ is defined for every $x\in G$ and every integer .

The set of all powers of an element of a group form a subgroup. A group (or subgroup) that consists of all powers of a specific element is the

cyclic group

generated by . If all the powers of are distinct, the group is

isomorphic

to the additive group $\Z$ of the integers. Otherwise, the cyclic group is finite (it has a finite number of elements), and its number of elements is the order of . If the order of is , then $x^n=x^0=1,$ and the cyclic group generated by consists of the first powers of (starting indifferently from the exponent or ).

Order of elements play a fundamental role in group theory. For example, the order of an element in a finite group is always a divisor of the number of elements of the group (the ''order'' of the group). The possible orders of group elements are important in the study of the structure of a group (see Sylow theorems), and in the classification of finite simple groups.

Superscript notation is also used for conjugation; that is, , where ''g'' and ''h'' are elements of a group. This notation cannot be confused with exponentiation, since the superscript is not an integer. The motivation of this notation is that conjugation obeys some of the laws of exponentiation, namely $(g^h)^k=g^$ and $(gh)^k=g^kh^k.$

In a ring

In a ring, it may occur that some nonzero elements satisfy $x^n=0$ for some integer . Such an element is said to be nilpotent. In a commutative ring, the nilpotent elements form an ideal, called the nilradical of the ring.

If the nilradical is reduced to the zero ideal (that is, if $x\neq 0$ implies $x^n\neq 0$ for every positive integer ), the commutative ring is said reduced. Reduced rings important in

algebraic geometry

, since the coordinate ring of an affine algebraic set is always a reduced ring.

More generally, given an ideal in a commutative ring , the set of the elements of that have a power in is an ideal, called the radical of . The nilradical is the radical of the zero ideal. A radical ideal is an ideal that equals its own radical. In a polynomial ring k _1, \ldots, x_n/math> over a field , an ideal is radical if and only if it is the set of all polynomials that are zero on an affine algebraic set (this is a consequence of

Hilbert's Nullstellensatz

).

Matrices and linear operators

If ''A'' is a square matrix, then the product of ''A'' with itself ''n'' times is called the matrix power. Also $A^0$ is defined to be the identity matrix, and if ''A'' is invertible, then $A^ = \left(A^\right)^n$.

Matrix powers appear often in the context of discrete dynamical systems, where the matrix ''A'' expresses a transition from a state vector ''x'' of some system to the next state ''Ax'' of the system. This is the standard interpretation of a

Markov chain

, for example. Then $A^2x$ is the state of the system after two time steps, and so forth: $A^nx$ is the state of the system after ''n'' time steps. The matrix power $A^n$ is the transition matrix between the state now and the state at a time ''n'' steps in the future. So computing matrix powers is equivalent to solving the evolution of the dynamical system. In many cases, matrix powers can be expediently computed by using eigenvalues and eigenvectors.

Apart from matrices, more general linear operators can also be exponentiated. An example is the

derivative

operator of calculus, $d/dx$, which is a linear operator acting on functions $f(x)$ to give a new function $(d/dx)f(x) = f'(x)$. The ''n''-th power of the differentiation operator is the ''n''-th derivative:
:$\left(\frac\right)^nf(x) = \fracf(x) = f^(x).$

These examples are for discrete exponents of linear operators, but in many circumstances it is also desirable to define powers of such operators with continuous exponents. This is the starting point of the mathematical theory of semigroups. Just as computing matrix powers with discrete exponents solves discrete dynamical systems, so does computing matrix powers with continuous exponents solve systems with continuous dynamics. Examples include approaches to solving the heat equation, Schrödinger equation, wave equation, and other partial differential equations including a time evolution. The special case of exponentiating the derivative operator to a non-integer power is called the fractional derivative which, together with the fractional integral, is one of the basic operations of the fractional calculus.

Finite fields

A field is an algebraic structure in which multiplication, addition, subtraction, and division are defined and satisfy the properties that multiplication is associative and every nonzero element has a

multiplicative inverse

. This implies that exponentiation with integer exponents is well-defined, except for nonpositive powers of . Common examples are the

complex number

s and their subfields, the rational numbers and the real numbers, which have been considered earlier in this article, and are all infinite.

A ''finite field'' is a field with a finite number of elements. This number of elements is either a prime number or a prime power; that is, it has the form $q=p^k,$ where is a prime number, and is a positive integer. For every such , there are fields with elements. The fields with elements are all

isomorphic

, which allows, in general, working as if there were only one field with elements, denoted $\mathbb F_q.$

One has
:$x^q=x$
for every $x\in \mathbb F_q.$

A primitive element in $\mathbb F_q$ is an element such the set of the first powers of (that is, $\$) equals the set of the nonzero elements of $\mathbb F_q.$ There are $\varphi (p-1)$ primitive elements in $\mathbb F_q,$ where $\varphi$ is Euler's totient function.

In $\mathbb F_q,$ the Freshman's dream identity
:$(x+y)^p = x^p+y^p$
is true for the exponent . As $x^p=x$ in $\mathbb F_q,$ It follows that the map
:$\begin F\colon & \mathbb F_q \to \mathbb F_q\\ & x\mapsto x^p \end$
is

linear

over $\mathbb F_q,$ and is a field automorphism, called the Frobenius automorphism. If $q=p^k,$ the field $\mathbb F_q$ has automorphisms, which are the first powers (under composition) of . In other words, the Galois group of $\mathbb F_q$ is

cyclic

of order , generated by the Frobenius automorphism.

The Diffie–Hellman key exchange is an application of exponentiation in finite fields that is widely used for secure communications. It uses the fact that exponentiation is computationally inexpensive, whereas the inverse operation, the discrete logarithm, is computationally expensive. More precisely, if is a primitive element in $\mathbb F_q,$ then $g^e$ can be efficiently computed with exponentiation by squaring for any , even if is large, while there is no known algorithm allowing retrieving from $g^e$ if is sufficiently large.

Powers of sets

The Cartesian product of two sets and is the set of the

ordered pair

s $(x,y)$ such that $x\in S$ and $y\in T.$ This operation is not properly commutative nor associative, but has these properties up to canonical

isomorphism

s, that allow identifying, for example, $(x,(y,z)),$ $((x,y),z),$ and $(x,y,z).$

This allows defining the th power $S^n$ of a set as the set of all -tuples $(x_1, \ldots, x_n)$ of elements of .

When is endowed with some structure, it is frequent that $S^n$ is naturally endowed with a similar structure. In this case, the term "direct product" is generally used instead of "Cartesian product", and exponentiation denotes product structure. For example $\R^n$ (where $\R$ denotes the real numbers) denotes the Cartesian product of copies of $\R,$ as well as their direct product as vector space, topological spaces, rings, etc.

Sets as exponents

A -tuple $(x_1, \ldots, x_n)$ of elements of can be considered as a function from $\.$ This generalizes to the following notation.

Given two sets and , the set of all functions from to is denoted $S^T$ This exponential notation is justified by the following canonical isomorphisms (for the first one, see Currying):
:$(S^T)^U\cong S^,$
:$S^\cong S^T\times S^U,$
where $\times$ denotes the Cartesian product, and $\sqcup$ the

disjoint union

.

One can use sets as exponents for other operations on sets, typically for direct sums of abelian groups, vector spaces, or modules. For distinguishing direct sums from direct products, the exponent of a direct sum is placed between parentheses. For example, $\R^\N$ denotes the vector space of the infinite sequences of real numbers, and $\R^$ the vector space of those sequences that have a finite number of nonzero elements. The latter has a basis consisting of the sequences with exactly one nonzero element that equals , while the Hamel bases of the former cannot be explicitly described (because there existence involves Zorn's lemma).

In this context, can represents the set $\.$ So, $2^S$ denotes the power set of , that is the set of the functions from to $\,$ which can be identified with the set of the

subset

s of , by mapping each function to the

inverse image

of .

This fits in with the exponentiation of cardinal numbers, in the sense that , where is the cardinality of .

In category theory

In the category of sets, the

morphism

s between sets and are the functions from to . It results that the set of the functions from to that is denoted $Y^X$ in the preceding section can also be denoted $\hom(X,Y).$ The isomorphism $(S^T)^U\cong S^$ can be rewritten
:$\hom(U,S^T)\cong \hom(T\times U,S).$
This means the functor "exponentiation to the power " is a right adjoint to the functor "direct product with ".

This generalizes to the definition of exponentiation in a category in which finite direct products exist: in such a category, the functor $X\to X^T$ is, if it exists, a right adjoint to the functor $Y\to T\times Y.$ A category is called a ''Cartesian closed category'', if direct products exist, and the functor $Y\to X\times Y$ has a right adjoint for every .

Repeated exponentiation

Just as exponentiation of natural numbers is motivated by repeated multiplication, it is possible to define an operation based on repeated exponentiation; this operation is sometimes called hyper-4 or tetration. Iterating tetration leads to another operation, and so on, a concept named hyperoperation. This sequence of operations is expressed by the Ackermann function and Knuth's up-arrow notation. Just as exponentiation grows faster than multiplication, which is faster-growing than addition, tetration is faster-growing than exponentiation. Evaluated at , the functions addition, multiplication, exponentiation, and tetration yield 6, 9, 27, and () respectively.

Limits of powers

Zero to the power of zero gives a number of examples of limits that are of the indeterminate form 0⁰. The limits in these examples exist, but have different values, showing that the two-variable function has no limit at the point . One may consider at what points this function does have a limit.

More precisely, consider the function defined on Then can be viewed as a subset of (that is, the set of all pairs with , belonging to the extended real number line , endowed with the product topology), which will contain the points at which the function has a limit.

In fact, has a limit at all accumulation points of , except for , , and . Accordingly, this allows one to define the powers by continuity whenever , , except for 0⁰, (+∞)⁰, 1^+∞ and 1^−∞, which remain indeterminate forms.

Under this definition by continuity, we obtain:
* and , when .
* and , when .
* and , when .
* and , when .

These powers are obtained by taking limits of for ''positive'' values of . This method does not permit a definition of when , since pairs with are not accumulation points of .

On the other hand, when is an integer, the power is already meaningful for all values of , including negative ones. This may make the definition obtained above for negative problematic when is odd, since in this case as tends to through positive values, but not negative ones.

Efficient computation with integer exponents

Computing ''b''^''n'' using iterated multiplication requires multiplication operations, but it can be computed more efficiently than that, as illustrated by the following example. To compute 2¹⁰⁰, apply Horner's rule to the exponent 100 written in binary:
:$100 = 2^2 +2^5 + 2^6 = 2^2(1+2^3(1+2))$.
Then compute the following terms in order, reading Horner's rule from right to left.

This series of steps only requires 8 multiplications instead of 99.

In general, the number of multiplication operations required to compute can be reduced to $\sharp n +\lfloor \log_ n\rfloor -1,$ by using exponentiation by squaring, where $\sharp n$ denotes the number of in the binary representation of . For some exponents (100 is not among them), the number of multiplications can be further reduced by computing and using the minimal addition-chain exponentiation. Finding the ''minimal'' sequence of multiplications (the minimal-length addition chain for the exponent) for is a difficult problem, for which no efficient algorithms are currently known (see Subset sum problem), but many reasonably efficient heuristic algorithms are available. However, in practical computations, exponentiation by squaring is efficient enough, and much more easy to implement.

Iterated functions

Function composition is a binary operation that is defined on functions such that the

codomain

of the function written on the right is included in the domain of the function written on the left. It is denoted $g\circ f,$ and defined as
:$(g\circ f)(x)=g(f(x))$
for every in the domain of .

If the domain of a function equals its codomain, one may compose the function with itself an arbitrary number of time, and this defines the th power of the function under composition, commonly called the ''th iterate'' of the function. Thus $f^n$ denotes generally the th iterate of ; for example, $f^3(x)$ means $f(f(f(x))).$

When a multiplication is defined on the codomain of the function, this defines a multiplication on functions, the pointwise multiplication, which induces another exponentiation. When using functional notation, the two kinds of exponentiation are generaly distinguished by placing the exponent of the functional iteration ''before'' the parentheses enclosing the arguments of the function, and placing the exponent of pointwise multiplication ''after'' the parentheses. Thus $f^2(x)= f(f(x)),$ and $f(x)^2= f(x)\cdot f(x).$ When functional notation is not used, disambiguation is often done by placing the composition symbol before the exponent; for example $f^=f\circ f \circ f,$ and $f^3=f\cdot f\cdot f.$ For historical reasons, the exponent of a repeated multiplication is placed before the argument for some specific functions, typically the

trigonometric functions

. So, $\sin^2 x$ and $\sin^2(x)$ mean both $\sin(x)\cdot\sin(x)$ and not $\sin(\sin(x)),$ which, in any case, is rarely considered. Historically, several variants of these notations were used by different authors.

In this context, the exponent $-1$ denotes always the inverse function, if it exists. So $\sin^x=\sin^(x) = \arcsin x.$ For the

multiplicative inverse

fractions are generally used as in $1/\sin(x)=\frac 1.$

In programming languages

Programming language

s generally express exponentiation either as an infix operator or as a function application, as they do not support superscripts. The most common operator symbol for exponentiation is the

caret

(^). The original version of ASCII included an uparrow symbol (↑), intended for exponentiation, but this was replaced by the caret in 1967, so the caret became usual in programming languages.
The notations include:
* x ^ y: AWK,

BASIC

, J, MATLAB, Wolfram Language (Mathematica), R, Microsoft Excel, Analytica, TeX (and its derivatives), TI-BASIC, bc (for integer exponents), Haskell (for nonnegative integer exponents), Lua and most

computer algebra system

s.
* x ** y. The

Fortran

character set did not include lowercase characters or punctuation symbols other than +-*/()&=.,' and so used ** for exponentiation. Many other languages followed suit: Ada, Z shell, KornShell, Bash,

COBOL

, CoffeeScript,

Fortran

, FoxPro,

Gnuplot

, Groovy,

JavaScript

, OCaml, F#, Perl,

PHP

, PL/I, Python, Rexx, Ruby, SAS, Seed7,

Tcl

, ABAP, Mercury, Haskell (for floating-point exponents), Turing, VHDL.
* x ↑ y: Algol Reference language, Commodore BASIC, TRS-80 Level II/III BASIC.
* x ^^ y: Haskell (for fractional base, integer exponents), D.
* x⋆y: APL.

In most programming languages with an infix exponentiation operator, it is right-associative, that is, a^b^c is interpreted as a^(b^c).Robert W. Sebesta, ''Concepts of Programming Languages'', 2010, , p. 130, 324 This is because (a^b)^c is equal to a^(b*c) and thus not as useful. In some languages, it is left-associative, notably in Algol, Matlab and the

Microsoft Excel

formula language.

Other programming languages use functional notation:
* (expt x y): Common Lisp.
* pown x y: F# (for integer base, integer exponent).

Still others only provide exponentiation as part of standard libraries:
* pow(x, y): C,

C++

(in math library).
* Math.Pow(x, y): C#.
* math:pow(X, Y): Erlang.
* Math.pow(x, y): Java.
* ath:Pow(x, y):

PowerShell

.

See also

* Double exponential function
*

Exponential decay

* Exponential field
*

Exponential growth

* List of exponential topics
* Modular exponentiation
* Scientific notation
* Unicode subscripts and superscripts
* ''x''^''y'' = ''y''^''x''
* Zero to the power of zero

Notes

References

{{Authority control

Exponentials
Unary operations