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 series converges absolutely for every real argument
Statement
For every real , the series converges absolutely. Its power-series radius is therefore .
Facts & Assumptions
Given: A real .
Archimedes supplies a natural larger than any prescribed real (Every complete ordered field is Archimedean).
A tail bounded termwise by a convergent geometric series converges (If eventually, convergence of gives convergence of , and divergence of gives divergence of , For , , and for the series diverges), and absolute convergence implies convergence (If converges then converges).
Factorials satisfy and are nonzero naturals; every positive natural has a positive, hence nonzero, canonical real image (The factorial and the falling factorial , defined by recursion in , The canonical natural of a field, Canonical naturals are positive and strictly increasing).
Proof
If , the series is and converges absolutely. Hence assume . Choose with . For , the absolute terms are positive and satisfy .
Thus by induction, and the tail is dominated by a convergent geometric series.
The zero case from step 1.1 and, when , adding the finite initial segment to the convergent tail prove absolute convergence for arbitrary . Hence every nonnegative radius works and the radius is .
Depends on
- The real exponential function and the number $e$ by a power series
- If $0 \le a_k \le b_k$ eventually, convergence of $\sum b_k$ gives convergence of $\sum a_k$, and divergence of $\sum a_k$ gives divergence of $\sum b_k$
- For $|r| < 1$, $\sum_{k \ge 0} r^k = 1/(1-r)$, and for $|r| \ge 1$ the series diverges
- If $\sum |a_k|$ converges then $\sum a_k$ converges
- Every complete ordered field is Archimedean
- 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
- Canonical naturals are positive and strictly increasing
Used by
- The complex exponential series converges absolutely for every complex argument Lemma
- For every real x, (1+x/n)ⁿ→exp x Theorem
- Picard iteration from 1 produces the exponential partial sums Theorem
- The exponential addition formula exp(x+y)=exp(x)exp(y) Theorem
- The exponential function is smooth and (exp)'=exp Theorem
- The exponential function is strictly increasing Theorem
Cited to discharge well-definedness by The real exponential function and the number e by a power series.
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 102 results over 22 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)