{
  "id": "exponentiation",
  "title": "Exponentiation",
  "lang": "en",
  "source_lang": "en",
  "summary": "Exponentiation generalizes repeated multiplication to powers with integer, real, complex, and other exponents.",
  "category": "mathematics",
  "subcategory": "algebra",
  "type": "concept",
  "aliases": [
    "Raising to a power",
    "Power operation"
  ],
  "generated_at": "2026-11-03",
  "model": "pro/gpt-6.1-sol",
  "url": "https://aiwiki.page/en/exponentiation/",
  "translations": {
    "zh-Hans": {
      "url": "https://aiwiki.page/zh/exponentiation/",
      "json": "https://aiwiki.page/zh/exponentiation.json"
    }
  },
  "sections": [
    {
      "heading": "",
      "text": "Exponentiation is a mathematical operation written \\(a^b\\), where \\(a\\) is the base and \\(b\\) is the exponent. For a positive integer exponent, it represents repeated multiplication: \\(a^n\\) is the product of \\(n\\) copies of \\(a\\). Extensions of this definition give meanings to negative, fractional, real, and complex exponents, although the permissible bases and the laws satisfied depend on the number system and the definitions being used.\n\nPowers occur throughout arithmetic, algebra, analysis, and applications involving growth, scaling, periodicity, and computation. An important distinction is between a power function, such as \\(x^3\\), in which the base varies, and an exponential function, such as \\(3^x\\), in which the exponent varies. Beyond ordinary numbers, exponentiation applies to matrices, elements of algebraic structures, and sizes or order types of sets. These extensions preserve different aspects of the elementary operation rather than constituting one unrestricted operation with universally valid rules."
    },
    {
      "heading": "Integer powers and the laws of exponents",
      "text": "For a positive integer \\(n\\), exponentiation is defined by\n\n\\[a^1=a,\\qquad a^{n+1}=a^n a.\\]\n\nThus \\(3^4=3\\cdot3\\cdot3\\cdot3=81\\). The expressions \\(a^2\\) and \\(a^3\\) are traditionally read as “\\(a\\) squared” and “\\(a\\) cubed,” reflecting their interpretation as the area of a square and the volume of a cube. The exponent counts factors, not multiplication signs: a product of \\(n\\) factors requires \\(n-1\\) ordinary multiplications if evaluated directly.\n\nFor a nonzero numerical base, the definition extends to zero and negative integers by\n\n\\[a^0=1,\\qquad a^{-n}=\\frac{1}{a^n}.\\]\n\nThese choices preserve the central multiplication law\n\n\\[a^{m+n}=a^ma^n.\\]\n\nFor example, \\(2^{-3}=1/8\\), and \\(2^3\\,2^{-3}=2^0=1\\). A negative exponent does not make the value negative; it calls for a reciprocal. By contrast, the sign of an integer power of a negative real number depends on parity: an even exponent gives a positive result, and an odd exponent gives a negative result.\n\nFor nonzero real or complex \\(a\\) and integers \\(m,n\\), the familiar identities include\n\n\\[\\frac{a^m}{a^n}=a^{m-n}, \\qquad (a^m)^n=a^{mn}, \\qquad (ab)^n=a^nb^n.\\]\n\nThey follow by regrouping factors and using multiplicative inverses. Mathematical induction supplies a systematic method of proving these statements from the recursive definition. Restrictions matter: division requires a nonzero denominator, and the product rule for bases need not hold when multiplication is noncommutative.\n\nExponentiation itself is neither commutative nor associative. For instance, \\(2^3=8\\), whereas \\(3^2=9\\), and\n\n\\[(2^3)^2=64,\\qquad 2^{(3^2)}=512.\\]\n\nAn unparenthesized tower \\(a^{b^c}\\) is conventionally interpreted from the top down, as \\(a^{(b^c)}\\). Standard mathematical notation also places exponentiation before an unparenthesized leading minus, so \\(-2^2=-(2^2)=-4\\), while \\((-2)^2=4\\). Calculators and programming languages do not all implement identical parsing conventions.\n\nInteger powers organize polynomials and positional numerals. A polynomial is a finite sum of coefficients times nonnegative integer powers of a variable. In positional notation, the numeral \\(507\\) means \\(5\\cdot10^2+0\\cdot10^1+7\\cdot10^0\\). These uses make exponentiation part of the structure of ordinary symbolic and numerical calculation, not merely a shorthand for very large products."
    },
    {
      "heading": "Rational and real exponents",
      "text": "For a positive real base \\(a\\) and positive integer \\(n\\), the power \\(a^{1/n}\\) is the unique positive real number whose \\(n\\)th power is \\(a\\). For a rational number \\(m/n\\), with \\(n>0\\), define\n\n\\[a^{m/n}=\\left(a^{1/n}\\right)^m.\\]\n\nFor example,\n\n\\[27^{2/3}=\\left(\\sqrt[3]{27}\\right)^2=9.\\]\n\nWhen the base is positive, this definition is independent of the fractional representation of the exponent. In particular, \\(a^{1/2}=a^{2/4}\\), because positive roots have been selected consistently.\n\nNegative bases require additional care. A negative real number has a real odd root but no real even root. Consequently, if \\(m/n\\) is in lowest terms, a negative base has a real rational power under this convention when \\(n\\) is odd. Thus \\((-8)^{1/3}=-2\\) and \\((-8)^{2/3}=4\\). The reduced-fraction condition prevents misleading computations: treating \\((-8)^{2/6}\\) by first taking a real sixth root would fail, although \\(2/6=1/3\\). There is no corresponding real-valued extension to arbitrary irrational exponents for a fixed negative base that retains the usual continuity and exponent laws.\n\nFor \\(a>0\\), powers extend from rational exponents to every real number by continuity. If rational numbers \\(q_k\\) approach \\(x\\), then\n\n\\[a^x=\\lim_{k\\to\\infty}a^{q_k}.\\]\n\nThe construction requires proof that this limit exists and does not depend on the approximating sequence. Equivalent constructions use the completeness of the real numbers, taking suitable suprema of rational powers. They give a positive-valued continuous function satisfying\n\n\\[a^{x+y}=a^xa^y,\\qquad (a^x)^y=a^{xy}\\]\n\nfor real \\(x,y\\) and positive \\(a\\).\n\nA standard analytic definition is\n\n\\[a^x=\\exp(x\\ln a),\\]\n\nwhere \\(\\ln\\) is the natural logarithm. This immediately explains why positivity is the natural domain for unrestricted real exponents. It also shows that \\(a^x\\) is strictly increasing in \\(x\\) when \\(a>1\\), strictly decreasing when \\(0<a<1\\), and identically \\(1\\) when \\(a=1\\).\n\nThe two variables have different roles. For a fixed exponent \\(r\\), the function \\(x\\mapsto x^r\\), on \\(x>0\\), describes power-law scaling. For a fixed positive base \\(a\\ne1\\), the function \\(x\\mapsto a^x\\) describes exponential change. Their inverse operations are correspondingly different: extracting an \\(n\\)th root solves \\(x^n=b\\), while taking a logarithm solves \\(a^x=b\\)."
    },
    {
      "heading": "Analytic structure, differentiation, and growth",
      "text": "The distinguished base \\(e\\), approximately \\(2.71828\\), is characterized by the fact that the derivative of \\(e^x\\) is itself. Euler’s number can be defined through a limit, an infinite series, or the natural logarithm. One important representation is\n\n\\[e^x=\\sum_{n=0}^{\\infty}\\frac{x^n}{n!}.\\]\n\nThis power series converges for every real or complex \\(x\\). Its coefficients make differentiation particularly simple and connect exponentiation with analytic methods beyond repeated multiplication.\n\nFor \\(a>0\\), differentiation gives\n\n\\[\\frac{d}{dx}a^x=(\\ln a)a^x.\\]\n\nFor a constant real exponent \\(r\\) and \\(x>0\\),\n\n\\[\\frac{d}{dx}x^r=rx^{r-1}.\\]\n\nThese formulas distinguish exponential and power functions sharply. The proportional growth rate of \\(a^x\\) is the constant \\(\\ln a\\), whereas the proportional growth rate of \\(x^r\\) is \\(r/x\\). The derivative therefore provides a precise mathematical expression of constant proportional growth as opposed to scale-dependent growth.\n\nWhen both the base and exponent vary, logarithmic differentiation gives a more general rule. If \\(f(x)>0\\) and the relevant functions are differentiable, then\n\n\\[\\frac{d}{dx}f(x)^{g(x)} = f(x)^{g(x)} \\left( g'(x)\\ln f(x)+g(x)\\frac{f'(x)}{f(x)} \\right).\\]\n\nFor example,\n\n\\[\\frac{d}{dx}x^x=x^x(\\ln x+1),\\qquad x>0.\\]\n\nThis follows by writing the function as \\(\\exp(g(x)\\ln f(x))\\) and applying the chain rule. It also illustrates why treating a variable exponent as though it were constant gives an incorrect result.\n\nExponential functions solve a fundamental class of differential equations:\n\n\\[y'(t)=ky(t),\\qquad y(0)=y_0,\\]\n\nwhose solution is \\(y(t)=y_0e^{kt}\\). A positive \\(k\\) produces growth and a negative \\(k\\) decay. For fixed \\(k>0\\) and fixed real \\(r\\),\n\n\\[\\lim_{x\\to\\infty}\\frac{x^r}{e^{kx}}=0.\\]\n\nThus positive exponential growth eventually exceeds every fixed power of \\(x\\), even though the location of the crossover can be large.\n\nExponents also govern local approximation. The Taylor series\n\n\\[(1+x)^r = 1+rx+\\frac{r(r-1)}{2!}x^2+\\cdots\\]\n\nconverges for \\(|x|<1\\), with endpoint behavior depending on \\(r\\). When \\(r\\) is a nonnegative integer, the series terminates and becomes the binomial theorem. This connects finite algebraic expansion with infinite analytic representation."
    },
    {
      "heading": "Complex powers and branches of the logarithm",
      "text": "For a nonzero complex number \\(z\\), polar form gives\n\n\\[z=re^{i\\theta},\\qquad r>0.\\]\n\nThe angle is not unique: \\(\\theta+2\\pi k\\) represents the same point for every integer \\(k\\). Consequently, the complex logarithm has the values\n\n\\[\\log z=\\ln r+i(\\theta+2\\pi k),\\qquad k\\in\\mathbb Z.\\]\n\nA general complex power is therefore described by\n\n\\[z^w=\\exp(w\\log z),\\]\n\nwhich is ordinarily multivalued unless a particular logarithm has been selected.\n\nFor an integer exponent \\(w=n\\), the different logarithms produce the same result, because \\(e^{2\\pi i kn}=1\\). For a rational exponent \\(m/n\\) in lowest terms, with \\(n>0\\), a nonzero base has exactly \\(n\\) distinct values. Thus the complex values of \\(1^{1/3}\\) are\n\n\\[1,\\qquad e^{2\\pi i/3},\\qquad e^{4\\pi i/3}.\\]\n\nThey are equally spaced around the unit circle. For an irrational real exponent or a nonreal exponent, the set of values is infinite.\n\nA single-valued power can be defined on a domain admitting a chosen logarithm. The principal logarithm commonly uses arguments in \\((-\\pi,\\pi)\\) and is analytic on the plane with the nonpositive real axis removed. On that domain,\n\n\\[z^w=\\exp(w\\operatorname{Log}z)\\]\n\ndefines a principal branch. A cut is necessary because continuing the argument once around the origin changes a logarithm by \\(2\\pi i\\). This obstruction is central to complex analysis and to the study of analytic continuation.\n\nRules inherited from real positive bases can fail for principal complex powers. For instance, using the principal square root,\n\n\\[\\sqrt{(-1)(-1)}=1, \\qquad \\sqrt{-1}\\sqrt{-1}=-1.\\]\n\nSimilarly, a power of a power need not equal the power obtained by multiplying exponents. Branch choices, rather than a failure of elementary multiplication, account for these discrepancies. Integer-exponent identities remain valid, and many other identities remain valid on suitably restricted domains with compatible logarithms.\n\nEuler’s identity\n\n\\[e^{i\\theta}=\\cos\\theta+i\\sin\\theta\\]\n\nconnects complex exponentiation with rotation and oscillation. It follows from the power-series definitions of the exponential, sine, and cosine. The same formula underlies the representation of waves by complex exponentials and the Fourier transform. In this setting, exponentiation encodes angular motion as well as real growth: if \\(w=u+iv\\), then \\(e^w=e^u(\\cos v+i\\sin v)\\)."
    },
    {
      "heading": "Powers in algebra and matrix analysis",
      "text": "Repeated multiplication makes sense in any structure with an associative multiplication. In a monoid—a set with associative multiplication and an identity element—one defines \\(a^0\\) as the identity and \\(a^{n+1}=a^na\\). The laws\n\n\\[a^{m+n}=a^ma^n,\\qquad (a^m)^n=a^{mn}\\]\n\nthen hold for nonnegative integers. In group theory, every element has an inverse, so the exponent may be any integer. Powers describe cyclic subgroups and the order of an element: the order is the least positive \\(n\\), if one exists, such that \\(a^n\\) is the identity.\n\nCommutativity is not required for powers of one element, but it matters when different bases are combined. In a noncommutative group or ring,\n\n\\[(ab)^2=abab\\]\n\nneed not equal \\(a^2b^2=aabb\\). The identity \\((ab)^n=a^nb^n\\) holds when \\(a\\) and \\(b\\) commute. A ring may also contain a nonzero element whose positive power is zero, called a nilpotent element. Thus properties familiar from powers of nonzero real numbers do not automatically transfer to more general algebra.\n\nFor a square matrix \\(A\\), nonnegative integer powers are defined using matrix multiplication, with \\(A^0=I\\), the identity matrix. Negative powers require \\(A\\) to be invertible. If\n\n\\[A=PDP^{-1}\\]\n\nwith \\(D\\) diagonal, then\n\n\\[A^n=PD^nP^{-1}.\\]\n\nThis reduces matrix powers to powers of the diagonal entries. Eigenvalues and eigenvectors consequently determine much of the long-term behavior of repeated linear transformations.\n\nThe matrix exponential is defined by the convergent series\n\n\\[e^A=\\sum_{n=0}^{\\infty}\\frac{A^n}{n!}.\\]\n\nIt solves constant-coefficient linear systems: the solution of \\(x'(t)=Ax(t)\\), \\(x(0)=x_0\\), is \\(x(t)=e^{tA}x_0\\). If \\(A\\) and \\(B\\) commute, then \\(e^{A+B}=e^Ae^B\\); without commutativity, this identity can fail. The notation \\(e^A\\) therefore extends the exponential function without making every scalar identity available.\n\nFractional matrix powers require additional structure or choices. A real symmetric positive-definite matrix has an orthogonal diagonalization \\(A=QDQ^{\\mathsf T}\\) with positive diagonal entries. For real \\(t\\), its distinguished power is\n\n\\[A^t=QD^tQ^{\\mathsf T}.\\]\n\nFor general matrices, logarithms may be nonunique or may fail to exist over the chosen number system. Over the complex numbers every invertible matrix has a matrix logarithm, but choosing one is part of defining a general power. These constructions belong to functional analysis and matrix function theory rather than to repeated multiplication alone."
    },
    {
      "heading": "Efficient computation and modular exponentiation",
      "text": "The definition of \\(a^n\\) as a product does not prescribe the most efficient way to compute it. Direct multiplication uses \\(n-1\\) multiplications. Exponentiation by squaring instead uses\n\n\\[a^{2k}=(a^k)^2,\\qquad a^{2k+1}=a(a^k)^2.\\]\n\nRepeatedly halving the exponent reduces the number of multiplications to a quantity proportional to \\(\\log n\\). This method works for integers, matrices, and other associative multiplication systems.\n\nA standard binary implementation reads the digits of the exponent. For example, \\(13=8+4+1\\), so\n\n\\[a^{13}=a^8a^4a.\\]\n\nThe intermediate powers \\(a^2,a^4,a^8\\) are obtained by successive squaring. A left-to-right implementation beginning with the leading binary digit uses \\(\\lfloor\\log_2n\\rfloor\\) squarings and one additional multiplication for each remaining digit equal to \\(1\\). The multiplication count is logarithmic, but total running time also depends on how expensive the multiplications are. Exact integer results can contain very many digits.\n\nIn modular arithmetic, reduction after each multiplication prevents intermediate integers from growing without bound. To compute \\(a^n\\bmod m\\), every squaring and multiplication may be followed by reduction modulo \\(m\\), because congruence respects multiplication. For example,\n\n\\[3^4\\equiv4\\pmod7,\\qquad 3^8\\equiv2\\pmod7,\\]\n\nso\n\n\\[3^{13}\\equiv3^8\\,3^4\\,3 \\equiv2\\cdot4\\cdot3 \\equiv3\\pmod7.\\]\n\nNegative modular exponents require the base to possess a multiplicative inverse modulo \\(m\\), equivalent to the base being relatively prime to \\(m\\).\n\nModular exponentiation is central to public-key cryptography. In the RSA cryptosystem, encryption and decryption involve powers modulo a large composite integer. Exponentiation is efficiently computable even when exponents and moduli contain thousands of binary digits. The inverse problems used in cryptography are different: recovering an exponent from a power leads to a discrete logarithm problem, while RSA relies on the difficulty of its associated inversion problem and the role of the secret factorization. These problems must not be conflated with the straightforward task of evaluating a power.\n\nFor noninteger numerical powers, implementations commonly reduce the task to evaluating \\(\\exp(x\\ln a)\\), with specialized methods improving accuracy and speed. Floating-point arithmetic introduces rounding, overflow, and underflow. Sensitivity is visible from\n\n\\[d(\\ln y)=x\\,d(\\ln a)+(\\ln a)\\,dx, \\qquad y=a^x.\\]\n\nErrors in the base or exponent can therefore be amplified. Near special values, such as a base very close to \\(1\\), carefully designed logarithm and exponential routines help preserve information that a naive computation could lose."
    },
    {
      "heading": "Zero, boundary cases, and indeterminate forms",
      "text": "For positive real \\(x\\), the value \\(0^x=0\\) provides the usual extension of real exponentiation to a zero base. Negative powers of zero are undefined in ordinary real or complex arithmetic because they require division by zero. The boundary case \\(0^0\\) depends on context: in many discrete and algebraic settings it is defined as \\(1\\), while in discussions of certain limits it is described as an indeterminate form. These usages concern different mathematical questions.\n\nThe algebraic reason for assigning \\(0^0=1\\) is the empty-product convention. A product with no factors is the multiplicative identity, independently of the element whose powers are being considered. This makes \\(a^0=1\\) uniform, including when \\(a=0\\). It is convenient in polynomial evaluation: the constant term \\(c_0x^0\\) remains \\(c_0\\) at \\(x=0\\). Similarly, the series\n\n\\[e^x=\\sum_{n=0}^{\\infty}\\frac{x^n}{n!}\\]\n\nhas constant term \\(1\\), and its evaluation at zero requires no special rewriting under this convention.\n\nThere is also a direct counting interpretation. For finite sets of sizes \\(a\\) and \\(b\\), the number of functions from the second set to the first is \\(a^b\\). There is exactly one function from the empty set to itself: the empty function. Thus this interpretation gives \\(0^0=1\\). Conversely, no function maps a nonempty set into the empty set, corresponding to \\(0^n=0\\) for positive integers \\(n\\).\n\nIn limit calculations, however, knowing only that a base approaches zero and an exponent approaches zero does not determine the limiting power. For \\(x>0\\),\n\n\\[x^x=\\exp(x\\ln x)\\longrightarrow1 \\quad\\text{as }x\\to0^+.\\]\n\nBut if \\(t\\to0^+\\),\n\n\\[\\left(e^{-1/t}\\right)^t=e^{-1},\\]\n\nwhile\n\n\\[\\left(e^{-1/t^2}\\right)^t=e^{-1/t}\\longrightarrow0.\\]\n\nEach base tends to zero and each exponent tends to zero, yet the powers have different limits. No single value assigned at the point \\((0,0)\\) can make the two-variable power function continuous there throughout its positive-base domain.\n\nThe forms \\(1^\\infty\\) and \\(\\infty^0\\) are likewise indeterminate descriptions of limits, not arithmetic equalities. For positive functions \\(f\\) and real functions \\(g\\), the useful transformation is\n\n\\[f(x)^{g(x)}=\\exp\\!\\bigl(g(x)\\ln f(x)\\bigr).\\]\n\nFor example, \\((1+1/n)^n\\to e\\), although the bases approach \\(1\\). The product \\(g(x)\\ln f(x)\\), rather than the limiting base and exponent considered separately, determines the behavior."
    },
    {
      "heading": "Growth, scaling, and applications",
      "text": "Exponentiation represents two major patterns of quantitative change. Exponential growth has a fixed proportional change over equal increments of the independent variable. Power-law scaling has a fixed proportional response to multiplicative changes of that variable. The equations\n\n\\[y=Ae^{kt} \\qquad\\text{and}\\qquad y=Cx^\\alpha\\]\n\ntherefore describe structurally different relationships. In the first, \\(y(t+h)/y(t)=e^{kh}\\); in the second, \\(y(cx)/y(x)=c^\\alpha\\).\n\nCompound interest supplies an elementary exponential model. If a principal \\(P\\) earns a nominal annual rate \\(r\\), compounded \\(m\\) times per year for \\(t\\) years, the amount is\n\n\\[P\\left(1+\\frac rm\\right)^{mt}.\\]\n\nAs \\(m\\to\\infty\\), this approaches \\(Pe^{rt}\\). For exponential decay \\(N(t)=N_0e^{-\\lambda t}\\), the half-life is\n\n\\[T_{1/2}=\\frac{\\ln2}{\\lambda}.\\]\n\nThe same mathematical relation appears whenever a constant fraction of a quantity is lost per unit time, although the physical assumptions establishing that model vary by application.\n\nGeometric scaling produces powers without exponential growth. Enlarging all lengths of a three-dimensional object by a factor \\(s\\) multiplies areas by \\(s^2\\) and volumes by \\(s^3\\). More generally, a power law \\(y=Cx^\\alpha\\) becomes linear after logarithmic transformation:\n\n\\[\\ln y=\\ln C+\\alpha\\ln x.\\]\n\nThe exponent is the slope on logarithmic coordinates and measures elasticity:\n\n\\[\\frac{d\\ln y}{d\\ln x}=\\alpha.\\]\n\nAn approximately straight empirical log–log plot, however, does not by itself establish a power law or its underlying mechanism.\n\nIn probability, powers often arise from repeated independent choices. If an event has probability \\(p\\) in each of \\(n\\) independent trials, its occurrence in every trial has probability \\(p^n\\). If each of \\(n\\) positions can contain one of \\(k\\) symbols, there are \\(k^n\\) possible strings. This links exponentiation to combinatorics, coding, and information theory: the number of binary strings of length \\(n\\) is \\(2^n\\), and selecting one from \\(N\\) equally likely possibilities carries \\(\\log_2N\\) bits of information.\n\nComputational complexity also distinguishes powers from exponentials. An algorithm requiring a number of operations proportional to \\(n^3\\) has polynomial growth, while one requiring \\(2^n\\) has exponential growth. The latter eventually becomes larger than every fixed polynomial, although actual feasibility also depends on constants, input sizes, and implementation. Exponentiation thus describes both the efficient arithmetic used inside algorithms and the growth rates used to classify their overall resource requirements."
    },
    {
      "heading": "Cardinal, ordinal, and iterated exponentiation",
      "text": "In set theory, exponentiation has definitions that extend counting rather than numerical analysis. If \\(A\\) and \\(B\\) are sets with cardinalities \\(\\kappa\\) and \\(\\lambda\\), then\n\n\\[\\kappa^\\lambda=|A^B|,\\]\n\nwhere \\(A^B\\) is the set of all functions from \\(B\\) to \\(A\\). For finite sets, this agrees with ordinary exponentiation because each element of \\(B\\) has \\(\\kappa\\) independent choices of image. The definition continues to make sense when one or both sets are infinite.\n\nTaking \\(A=\\{0,1\\}\\), each function \\(B\\to A\\) is the indicator of a subset of \\(B\\). Consequently,\n\n\\[2^{|B|}=|\\mathcal P(B)|,\\]\n\nwhere \\(\\mathcal P(B)\\) is the power set. Cantor’s theorem states that this is strictly greater than \\(|B|\\). In particular, \\(2^{\\aleph_0}\\) is the cardinality of the real numbers, where \\(\\aleph_0\\) is the size of the natural numbers. The continuum hypothesis asks whether this cardinal equals \\(\\aleph_1\\), the least uncountable cardinal. Cardinal exponentiation is therefore tied to foundational questions rather than merely to large numerical calculation.\n\nExponentiation of ordinal numbers is different because ordinal arithmetic describes order types. It is defined recursively:\n\n\\[\\alpha^0=1,\\qquad \\alpha^{\\beta+1}=\\alpha^\\beta\\cdot\\alpha,\\]\n\nand, for a nonzero limit ordinal \\(\\lambda\\),\n\n\\[\\alpha^\\lambda=\\sup_{\\beta<\\lambda}\\alpha^\\beta.\\]\n\nFor the first infinite ordinal \\(\\omega\\), ordinal exponentiation gives\n\n\\[2^\\omega=\\sup_{n<\\omega}2^n=\\omega.\\]\n\nThis is countable, unlike the uncountable cardinal \\(2^{\\aleph_0}\\). The distinction shows why the meaning of the operands and the chosen arithmetic must be specified.\n\nRepeated exponentiation leads to tetration, the operation forming towers such as\n\n\\[a,\\qquad a^a,\\qquad a^{a^a},\\qquad \\ldots.\\]\n\nThe tower is evaluated from the top down. For positive \\(a\\), define \\(x_1=a\\) and \\(x_{n+1}=a^{x_n}\\). If this sequence converges to a finite positive limit \\(L\\), continuity requires\n\n\\[L=a^L.\\]\n\nThe existence of a solution to this equation alone does not prove convergence of the iteration.\n\nThe standard positive-real tower converges for\n\n\\[e^{-e}\\le a\\le e^{1/e}.\\]\n\nOutside this interval, it does not converge to a finite limit; depending on the base, divergence can involve unbounded growth or oscillation. Extending tower height from positive integers to real or complex values is substantially less canonical than extending ordinary exponentiation. Additional regularity and normalization requirements become central because the basic iteration relation does not uniquely determine a general interpolation."
    },
    {
      "heading": "Historical development and notation",
      "text": "The earliest uses of powers were closely connected with measurement and numerical tables rather than with a general operation accepting arbitrary exponents. Old Babylonian mathematical tablets from the early second millennium BCE include tables of squares and cubes used in computation. Greek mathematics treated squares and cubes through geometry. Euclid’s Elements, composed around 300 BCE, contains geometric propositions corresponding to identities that later algebra expresses using second powers, but it does not employ modern symbolic exponent notation.\n\nThe transition from geometric quantities to general algebraic powers took place over many centuries. Medieval Arabic algebra and later European algebra developed terminology and procedures for successive powers of an unknown. Nicolas Chuquet’s manuscript Triparty en la science des nombres of 1484 used exponent-like numerical indices, including zero and negative indices. Its notation was not immediately adopted as a common standard. Michael Stifel’s Arithmetica integra of 1544 discussed systematic correspondences between arithmetic and geometric progressions, helping articulate relationships underlying exponent and logarithm laws.\n\nA major practical development was the invention of logarithms. John Napier published his logarithmic tables in 1614, and Henry Briggs subsequently developed common, or base-ten, logarithms and extensive tables. Their original definitions and computational procedures did not begin from the fully modern function \\(a^x\\), but logarithms made multiplication, division, and extraction of roots accessible through addition, subtraction, and table lookup. They also helped place fractional powers within a systematic computational framework.\n\nRené Descartes’s La Géométrie of 1637 helped establish the modern use of raised numerical exponents for powers. Superscript notation compactly separated an exponent from a coefficient and made expressions containing many powers easier to manipulate. In the seventeenth century, work on infinite series and calculus broadened the role of powers further. Isaac Newton’s generalized binomial expansion treated exponents beyond nonnegative integers, connecting fractional and negative powers with infinite series.\n\nDuring the eighteenth century, Euler’s work consolidated the notation and theory of exponential and logarithmic functions, including their complex extensions. His Introductio in analysin infinitorum of 1748 presented exponential and logarithmic relationships as central objects of analysis. Nineteenth-century developments in real analysis, complex function theory, and abstract algebra clarified continuity, convergence, branches, and the algebraic settings in which exponent laws hold.\n\nModern notation varies with the medium. Printed mathematics uses superscripts, while plain text often writes a^b. Some programming languages use **; others reserve ^ for a bitwise operation rather than exponentiation. Function names such as pow are also common. These differences concern representation, but they can affect interpretation when precedence, negative bases, fractional exponents, or finite-precision numerical types are involved."
    }
  ],
  "links": [
    "arithmetic",
    "exponential-function",
    "integer",
    "mathematical-induction",
    "polynomial",
    "positional-notation",
    "rational-number",
    "real-number",
    "continuous-function",
    "natural-logarithm",
    "logarithm",
    "e-mathematical-constant",
    "power-series",
    "derivative",
    "chain-rule",
    "differential-equation",
    "taylor-series",
    "binomial-theorem",
    "complex-number",
    "complex-analysis",
    "analytic-continuation",
    "leonhard-euler",
    "fourier-transform",
    "group-theory",
    "ring-mathematics",
    "matrix",
    "matrix-multiplication",
    "identity-matrix",
    "eigenvalues-and-eigenvectors",
    "positive-definite-matrix",
    "functional-analysis",
    "modular-arithmetic",
    "rsa-cryptosystem",
    "floating-point-arithmetic",
    "limit",
    "power-law",
    "probability",
    "combinatorics",
    "information-theory",
    "set-theory",
    "power-set",
    "cantors-theorem",
    "continuum-hypothesis",
    "ordinal-number",
    "euclids-elements"
  ],
  "sources": [],
  "license": "https://creativecommons.org/licenses/by/4.0/"
}