How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced — the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted — a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated — a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
The exponential addition formula
Statement
For all real ,
Facts & Assumptions
Given: .
For fixed , the auxiliary power series and have infinite radius by The exponential series converges absolutely for every real argument. Inside their common radius, their product is the Cauchy product of their coefficients (Inside the common radius the product of two power-series sums is represented by the Cauchy product of their coefficients).
The binomial theorem says (The binomial theorem in : , The set of -element subsets and the binomial coefficient ).
For , ( for ; hence , the quotient is a natural number, and ). Therefore , with all naturals read in through The canonical natural of a field.
Proof
Apply [L1] at the auxiliary value . The coefficient of degree in the resulting Cauchy product for is .
Apply [L3] and [L2] to identify this finite sum with .
Summing over gives the exponential series at , hence the formula.
Depends on
- The exponential series converges absolutely for every real argument
- Inside the common radius the product of two power-series sums is represented by the Cauchy product of their coefficients
- The binomial theorem in $\mathbb{R}$: $(x+y)^{n} = \sum_{k<n+1} \iota\!\binom{n}{k}\, x^{k} y^{\,n-k}$
- $\binom{n}{k}\,k!\,(n-k)! = n!$ for $k \le n$; hence $\binom{n}{k}\,k! = n^{\underline{k}}$, the quotient $n!/(k!(n-k)!)$ is a natural number, and $\binom{n}{k} = \binom{n}{n-k}$
- The set $[A]^{k}$ of $k$-element subsets and the binomial coefficient $\binom{n}{k} := \lvert [n]^{k}\rvert$
- The factorial $n!$ and the falling factorial $n^{\underline{k}}$, defined by recursion in $\mathbb{N}$
- The canonical natural $\iota(n) = n \cdot 1_F$ of a field
- Finite sums and finite products, by recursion
- Laws of finite sums and finite products
Used by
- The exponential is positive and satisfies exp(-x)=1/exp(x) Corollary
- A discontinuous positive solution of F(x+y)=F(x)F(y) Counterexample
- The convergence (1+x/n)ⁿ→exp x is not uniform on ℝ Counterexample
- The log-free product limit (1-2/n)ⁿ→exp(-2) Example
- Addition formulas, identities, parity, and derivatives of the hyperbolic functions Theorem
- Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm Theorem
- Regular normalized multiplicative Cauchy equations characterize the exponential Theorem
- The exponent, product, quotient, and iterated-power laws for positive real bases and real exponents Theorem
- Under square summability, the signed product of (1+pₙ) converges iff the series of pₙ converges Theorem
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 111 results over 27 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.
Sources
- MIT OpenCourseWare 18.100B Real Analysis, Spring 2025 full lecture notes (standard reference, not scraped)
- J. Lebl, Basic Analysis, Logarithm and Exponential (standard reference, not scraped)
- J. K. Hunter, An Introduction to Real Analysis, Chapter 10 (standard reference, not scraped)