Two Forms of the Exponential Function
Why do the limit and power-series definitions produce the same e^mu?
How this lesson unfolds.
Begin with How can an infinite compounding product and an infinite factorial sum produce the exact same mathematical constant $e^\mu$? The sequence then connects Repeated tiny growth builds the exponential and builds toward The Two Definitions of Euler's Number $e$: Compound Interest vs. Taylor Series.
How can an infinite compounding product and an infinite factorial sum produce the exact same mathematical constant e^μ?
Compounding growth and Taylor series appear to speak different languages, but they describe the identical physical process: compounding models continuous infinitesimal multiplication, while the series decomposes that continuous curve into an infinite polynomial sum.
- $$e^\mu = \lim_{n \to \infty} \left(1 + \frac{\mu}{n}\right)^n = \sum_{j=0}^\infty \frac{\mu^j}{j!}$$
- Learning goalEquate continuous compounding limits and power series representations of e^μ.
- Helpful foundationsEuler's number e · Compound interest formula · Factorial notation · Essence of Calculus (3Blue1Brown) · Calculus Online Textbook (Gilbert Strang, MIT OCW)
- Common trapTreating compounding limits and series expansions as competing approximations rather than identical functions.
- Next connectionAnalyze how repeated infinitesimal growth increments generate continuous exponential compounding.
More context & mechanics
The exponential function e^μ is defined in two seemingly disparate mathematical languages:
- The Multiplicative / Compounding Form:
e^μ = lim_(n → ∞) (1 + (μ) / (n))^n
Here, growth μ is partitioned into n infinitesimal steps of relative size μ/n, each applied successively n times.
- The Additive / Power Series Form:
e^μ = ∑_(j=0)^∞ (μ^j) / (j!) = 1 + μ + (μ²) / (2!) + (μ³) / (3!) + …
Here, growth is assembled by adding an infinite stack of polynomial powers scaled by reciprocal factorials 1/j!.
Both formulations yield the exact same value for any real or complex μ. Setting μ = 1 yields Euler's number e ≈ 2.718281828459... in both systems.
In quantitative finance, interest compounded n times per year on principal P is P(1 + r/n)^(nt). In continuous-time pricing models (such as the Black-Scholes-Merton option formula), continuous arbitrage trading lets n → ∞, turning discrete interest into the continuous discount factor e^(−rt).
Jacob Bernoulli discovered the constant e in 1683 while studying compound interest: lim (1 + 1/n)^n. Decades later in 1748, Leonhard Euler proved in Introductio in Analysin Infinitorum that Bernoulli's limit equals the factorial series ∑ 1/j!, adopting the symbol e in its honor.
Multiplication vs. Addition:
Compounding multiplies tiny steps n times: (1 + μ/n)^n. The series adds factorial pieces to infinity: μ^j / j!. Two paths climbing the same mountain to meet at e^μ!
How does slicing total growth into n infinitesimal compounding steps build the natural exponential in the limit?
Dividing time into finer intervals yields compound interest on interest already earned, yet each extra subdivision buys progressively smaller gains, gracefully flattening toward Euler’s constant e^μ.
- $$\lim_{n \to \infty} \left(1 + \frac{\mu}{n}\right)^n = e^\mu; \quad \left(1 + \frac{1}{n}\right)^n \to e \approx 2.71828$$
- $$Compounding interest at higher frequencies yields diminishing increases, converging strictly to $e^\mu$.$$
- Learning goalDerive continuous compounding as the infinite limit of repeated discrete growth.
- Helpful foundationsBinomial theorem · Monotone convergence theorem · Exponential modeling · Essence of Calculus (3Blue1Brown) · Calculus Online Textbook (Gilbert Strang, MIT OCW)
- Common trapExpecting frequent compounding to produce infinite wealth, ignoring diminishing returns bounded at e^μ.
- Next connectionExamine how factorial denominators construct the identical function through additive series.
More context & mechanics
Suppose you deposit \1 at a 100% nominal annual interest rate (μ = 1):
- Annual compounding (n=1): (1 + 1/1)¹ = \2.00
- Semi-annual (n=2): (1 + 1/2)² = 1.5² = \2.25
- Monthly (n=12): (1 + 1/12)^(12) ≈ \2.6130
- Daily (n=365): (1 + 1/365)^(365) ≈ \2.71457
- Continuous (n → ∞): lim_(n→∞) (1 + 1/n)^n = e ≈ \2.71828
Notice that as n increases, each individual payout μ/n shrinks toward zero, but the compounding frequency n increases at an identical rate. The newly accumulated interest immediately earns interest itself in subsequent steps. The sequence is strictly monotonically increasing and bounded above by 3, guaranteeing convergence by the Monotone Convergence Theorem.
In infectious disease epidemiology (SEIR models), an infected individual infects R₀ people over an infectious period. In early outbreak phases before herd immunity, continuous transmission compounding produces viral spread following I(t) = I₀ e^((R₀ - 1)t / γ), where continuous transmission matches the limit of discrete contact steps.
Jacob Bernoulli was investigating a purely financial puzzle: If an account pays 100% interest per year, what happens if interest is credited continuously every instant? He proved the limit lay between 2 and 3, but could not evaluate its exact decimal digits.
The Compounding Snowball:
A snowball doesn't wait until the bottom of the hill to grow; it gathers snow every microsecond. Slicing time into n slices and compounding creates e: (1 + rate/n)^n → e^(rate).
Why do reciprocal factorials 1/j! guarantee that the exponential power series converges for every complex number?
Every subsequent derivative of an exponential function demands another term to sustain its own rate of change; dividing by k! reins in the explosive powers of μ^k, ensuring the infinite sum converges instantly and smoothly.
- $$e^\mu = \sum_{j=0}^\infty \frac{\mu^j}{j!}; \quad \lim_{j \to \infty} \frac{|\mu|}{j+1} = 0 < 1 \implies R = \infty$$
- Learning goalProve global convergence of the exponential power series using the Ratio Test.
- Helpful foundationsRatio test · Factorial growth rates · Taylor series · Essence of Calculus (3Blue1Brown) · Calculus Online Textbook (Gilbert Strang, MIT OCW)
- Common trapFearing large inputs cause divergence, overlooking that factorials eventually dominate any power μ^j.
- Next connectionConnect compounding limits and series expansions via the Binomial Theorem.
More context & mechanics
The additive definition constructs e^μ by summing polynomial powers scaled by reciprocal factorials:
e^μ = 1 + μ + (μ²) / (2!) + (μ³) / (3!) + (μ⁴) / (4!) + …
Why does this series never blow up, even for huge inputs like μ = 100?
Let us test the ratio of consecutive terms:
L = lim_(j → ∞) | (μ^(j+1) / (j+1)!) / (μ^j / j!) | = lim_(j → ∞) (|μ|) / (j+1) = 0
Because the limit L = 0 < 1 for every choice of μ, the Ratio Test guarantees that the series converges absolutely and uniformly on any bounded subset of the complex plane C.
For μ = 1:
e = 1 + 1 + 1/2 + 1/6 + 1/24 + 1/120 + 1/720 ≈ 2.718055...
Just 7 terms achieve three decimal digits of accuracy!
In quantum physics, the time evolution operator of a state is U(t) = e^(−i H t / \hbar). Because H is a matrix (Hamiltonian operator), compounding (I - iHt/n\hbar)^n is computationally painful, but the power series definition ∑ ((-iHt/\hbar)^j) / (j!) operates directly on matrices, preserving unitarity and total probability.
Isaac Newton discovered the series e^x = 1 + x + x²/2 + x³/6 + ṡ in 1665 by inverting his series for ln(1+x). Euler popularized it in 1748, calculating e to 23 decimal digits in under an hour.
The Factorial Crusher:
No matter how big the input μ climbs, the factorial downstairs (j! = 1 × 2 × 3 × 4 ṡ) runs faster than any monster upstairs. Factorials crush everything to zero, making e^μ converge everywhere!
How does the Binomial Theorem rigorously transform the compounding limit into the factorial power series?
Unfolding the compounding product (1+μ/n)^n via the binomial theorem reveals an exact polynomial where the k-th term approaches μ^k / k! as intervals shrink to zero, proving the two definitions are mirror reflections of each other.
- $$\left(1 + \frac{\mu}{n}\right)^n = \sum_{j=0}^n \frac{\mu^j}{j!} \prod_{k=1}^{j-1}\left(1 - \frac{k}{n}\right) \xrightarrow{n \to \infty} \sum_{j=0}^\infty \frac{\mu^j}{j!} = e^\mu$$
- $$Expanding $(1+\mu/n)^n$ with the Binomial Theorem and taking $n \to \infty$ recovers the series term by term.$$
- Learning goalProve equivalence of compounding limits and power series using the Binomial Theorem.
- Helpful foundationsBinomial theorem · Combinations formula · Dominated convergence theorem
- Common trapInterchanging limits and infinite sums casually without justifying dominated convergence in expansions.
- Next connectionApply unified exponential foundations to solve first-order differential growth equations.
More context & mechanics
Here is the famous mathematical bridge connecting the two exponential forms. Apply the Binomial Theorem to (1 + (μ) / (n))^n:
(1 + (μ) / (n))^n = ∑_(j=0)^n C(n, j) 1^(n-j) ((μ) / (n))^j = ∑_(j=0)^n (n!) / (j!(n-j)!) (μ^j) / (n^j)
Isolate the term for a fixed index j:
(n!) / (j!(n-j)! n^j) = (1) / (j!) · (n(n-1)(n-2)…(n-j+1)) / (n · n · n … n) = (1) / (j!) (1)(1 - 1/n)(1 - 2/n)…(1 - (j-1) / (n))
Now take the limit as n → ∞ while holding j fixed:
lim_(n → ∞) (1 - 1/n)(1 - 2/n)…(1 - (j-1) / (n)) = 1 · 1 · 1 … 1 = 1
Therefore:
lim_(n → ∞) C(n, j)((μ) / (n))^j = (μ^j) / (j!)
By the Dominated Convergence Theorem (or Tannery's theorem for series), we can pass the limit through the sum, proving beyond doubt:
lim_(n → ∞) (1 + (μ) / (n))^n = ∑_(j=0)^∞ (μ^j) / (j!) = e^μ
In telecommunications and server load modeling, the number of web requests follows a Binomial distribution B(n, p) with large server requests n and tiny arrival probability p = μ/n. As n → ∞, the probability generating function (1 - p + p z)^n = (1 + (μ(z-1)) / (n))^n converges via this exact binomial bridge to e^(μ(z-1)), proving the Poisson distribution!
Leonhard Euler published this rigorous binomial bridge in Chapter 7 of his 1748 masterpiece Introductio in Analysin Infinitorum, forever harmonizing Bernoulli's compounding limit with Newton's infinite series.
The Binomial Bridge:
Expand the compounding brackets: C(n, j)/n^j. As n shoots to infinity, all the (1 - k/n) terms flatten to 1, leaving behind the factorial skeleton μ^j / j!. The bridge holds perfectly!
How does The Two Definitions of Euler's Number e: Compound Interest vs. Taylor Series operate mathematically at scale?
Two parallel mathematical definitions linked in the center:
- $$Title in navy serif: "The Two Faces of Euler's Number: e = 2.71828...".$$
- Learning goalMaster the algebraic and geometric derivation of The Two Definitions of Euler's Number e: Compound Interest vs. Taylor Series.
- Helpful foundationsFoundations of Algebra Functions And Calculus · Coordinate Invariance & Geometric Projections · MyMathGuide Peer-Reviewed Mathematical Foundations Series
- Common trapAssuming The Two Definitions of Euler's Number e: Compound Interest vs. Taylor Series is an arbitrary computational trick rather than an invariant spatial law.
- Next connectionConnects upstream foundational lemmas to modern high-dimensional computational systems.
More context & mechanics
A mathematical equivalence diagram in square 1:1 format on warm cream parchment (#fcf0db) with an 8px border.
Top section: Title in navy serif: "The Two Faces of Euler's Number: e = 2.71828...". Subtitle: "Continuous compound growth meets infinite factorial summation."
Middle section: Two parallel mathematical definitions linked in the center:
Definition 1 (Continuous Compounding Limit):
"e = lim_(n → ∞) (1 + 1/n)^n".
Show compounding intervals: 100% annual interest compounded monthly, daily, secondly, continuously.
Definition 2 (Taylor Series Infinite Sum):
"e = ∑_(k=0)^∞ (1) / (k!) = 1 + 1/1 + 1/2 + 1/6 + 1/24 + 1/120 + ...".
Show binomial expansion bridge: Expand (1 + 1/n)^n via Binomial Theorem; as n → ∞, each term (1 - 1/n)...(1 - k/n) approaches 1, leaving exactly 1/k!!
Bottom section: Derivative invariance: "d/dx e^x = e^x. The exponential function is its own rate of change: the only function whose height equals its slope everywhere."
Clean geometric compounding staircase, factorial denominator breakdown, balanced square layout.
Every transformation preserves structural invariants while mapping coordinate spaces. When operating in high dimensions, numerical precision and computational efficiency require adhering strictly to canonical mathematical laws.
Formal derivation and peer-reviewed analysis:
"The Two Definitions of Euler's Number e: Compound Interest vs. Taylor Series: Invariance, symmetry, and structure govern mathematical truth across continuous and discrete domains."