Chapter 4 — Exponential and Logarithmic Functions
4.2 - The Natural Exponential Function
Among all possible bases, is there one that arithmetic itself singles out as distinguished, not by computational convenience, but because a concrete construction forces it to exist?
§4.1 closed with a question that, formulated precisely, still made no sense in this book: whether there exists a base for which the speed of growth of coincides, at each point, with the value of the function itself. That question requires, in order to be answered, the concept of derivative, and this book does not yet have it. But there is a second question, more modest and entirely verifiable with what has already been constructed, that points to the same number without needing that machinery: what happens to a quantity that grows by interest, when the interest is compounded ever more frequently?
§1. From the open question to a verifiable construction
Section titled “§1. From the open question to a verifiable construction”Suppose a capital of one unit, invested for one year at an annual rate of one hundred percent, figures deliberately simple, chosen to isolate the mathematical phenomenon from any accessory financial detail. If the interest is compounded only once, at the end of the year we have units. If it is compounded twice, half the rate, twice in the year, we have . If it is compounded times, each compounding applies a fraction of the annual rate on the capital already accumulated, and the result at the end of the year is
The financial question, which is better, compounding little or much?, is, strictly, a question about this sequence of rational numbers indexed by : whether grows without bound as grows, so that compounding more frequently would always be strictly better, without limit, or whether, instead, approaches a fixed value, however many times the year is subdivided.
This is, incidentally, a question of the same type as those that the catalog of §2.4 already resolved: a sequence of values, and the matter of whether it grows without bound or stabilizes. The difference with that catalog is that there the variable ran over a continuum ( over the reals) and here it runs only over the naturals, a sequence, not a function of a real variable; but the conceptual apparatus, as that same section made precise in its definitive form, is the same: in both cases it is a limit, and in the catalog of §2.4 it was already made explicit that the name changes nothing of the technique. Here, the technique that corresponds is not - applied to a function already defined on , but something closer to completeness itself: to show that is bounded and monotone, and to appeal to the supremum axiom of §1.1 §9, the same tool that constructed, from scratch, the whole extension of in §4.1.
Before deciding whether is bounded, it is advisable to show that it at least grows, or, more precisely, that it does not decrease, and to find a second sequence that bounds it from above without needing to guess the limit value in advance. That is the content of §2.
§2. Two sequences that squeeze
Section titled “§2. Two sequences that squeeze”Bernoulli’s inequality of §6 was proved for , with non-strict inequality. What follows needs a slightly stronger version, strict, and valid also for negative exponents between and , which is obtained with the same inductive argument, without a new tool.
Sublemma (Bernoulli, strict version). For , , and , , we have .
Proof. Base case : , since because . Inductive step: suppose for some . Since , , and multiplying the inductive hypothesis by preserves the direction of the inequality:
using once again .
Proposition ( is strictly increasing). satisfies for all .
Proof. Apply the Sublemma with and exponent :
The base factors without remainder: . Substituting,
Dividing both sides by ,
The left side is exactly , and the right, . Hence .
Proposition ( is strictly decreasing). satisfies for all .
Proof. Apply the Sublemma with and exponent , valid for , since then :
The base also factors without remainder: . Substituting,
Multiplying both sides by and solving,
Dividing both sides by ,
This is, precisely, the inequality rewritten: indeed, , and the inequality just obtained says exactly that this quotient is greater than . Hence .
It remains to show that both sequences not only move in opposite directions, but squeeze against each other: that no term of ever exceeds any term of , whatever the indices. That crossed bound is what makes it possible, in §4, to appeal to the completeness axiom. It is the content of §3.
§3. The crossed bound: aₙ < bₘ for every pair of indices
Section titled “§3. The crossed bound: aₙ < bₘ for every pair of indices”Proposition. For all , .
Proof. The equal-index case is proved first, and then extended with the monotonicity already established.
Same index. , since and .
Different indices. Let . Since is strictly increasing (§2), gives , with equality only if . By the equal-index case, . Since is strictly decreasing (§2), gives , with equality only if . Chaining,
whence .
With bounded above by any , the completeness axiom guarantees that its supremum exists. It remains to check that this supremum coincides, moreover, with the infimum of , without which the construction would leave a margin of ambiguity. That is the content of §4, and with it, the definition of the number .
§4. Definition of e
Section titled “§4. Definition of e”By the Proposition of §3, the set is nonempty and bounded above, for example by . By the supremum axiom (§1.1 §9), there exists
By the same Proposition, is bounded below by any , so that, by the Lemma on the existence of the infimum (section 4.1, §7), there exists . Since each is a lower bound of , and is the least upper bound of while each is an upper bound of , by §3, we have for all , whence . The reverse inequality remains.
Proposition. .
Proof. The distance between and is bounded:
Since for all , a particular case of §3, it follows that . Given , by the Archimedean Lemma (section 4.1, §4) there exists with , so that for all ,
Since , by definition of supremum, and , already proved, plus the definition of infimum, we have, for that same ,
Since was arbitrary, , that is, .
Definition. The number is defined as the common value
With defined without ambiguity, what remains is what gives this construction its first contact with numerical intuition: to bound it between two concrete numbers, to confirm that the abstract construction corresponds to the familiar value. That is the content of §5.
§5. Numerical bounds: 2 < e < 3
Section titled “§5. Numerical bounds: 2 < e < 3”Proposition. .
Proof. For the lower bound: , and since , by the definition of supremum, any element of the set is less than or equal to it, it follows that .
For the upper bound: since , by the definition of infimum, it suffices to bound . By definition, . Computing exactly, and , so that
Since , it follows that . Hence .
With defined and bounded, and knowing that , all the machinery of §4.1, homomorphism, strict monotonicity, injectivity, domain, range, asymptote, applies without need of a single new proof. That is the content of §6.
§6. The natural exponential function f(x) = eˣ
Section titled “§6. The natural exponential function f(x) = eˣ”Since , §5, satisfies exactly the hypothesis under which all the Propositions of section 4.1 were proved. It is not necessary, then, to repeat or adapt a single proof: it suffices to instantiate in each of them.
Definition. The natural exponential function is , defined as the continuous extension of () constructed in §6 of section 4.1, specialized to the base .
By that construction and the Propositions that follow it, all applied directly, without modification:
- and (§10, section 4.1).
- is strictly increasing and injective on (§9, section 4.1), since .
- for all (§8, section 4.1).
- and, for , (§12, section 4.1, Exercises 2 and 3).
- is a horizontal asymptote as , and is not bounded above as (§11, section 4.1).
With the natural exponential function completely characterized by direct inheritance, what remains is to exercise its concrete handling before the philosophical close of the section. That is the content of §7.
§7. Worked exercises
Section titled “§7. Worked exercises”Exercise 1. Prove that .
Solution. By §6, , and by §12 of section 4.1 (Exercise 2, with ), coincides with the usual power. Since (§5), and squaring preserves order among positives, .
Exercise 2. Solve .
Solution. By the injectivity of (§6, inherited from §9 of section 4.1), the equality of the powers is equivalent to the equality of the exponents: , whence .
Exercise 3. Solve the inequality .
Solution. Since , is strictly increasing (§6). For a strictly increasing function, , a direct consequence of the strict monotonicity Proposition of §9, section 4.1. Applied here, , whence , that is, .
Exercise 4. Using the bounds of §5, bound between two rational numbers.
Solution. By §12 of section 4.1 (Exercise 2), , the positive square root of . Since (§5), and cubing preserves order among positives, . Since the square root also preserves order among positives, §1.2 §3, , that is, .
What remains, to close the section, is to situate philosophically what is and what cannot yet be within this book. That is the content of §8.
§8. Philosophical close
Section titled “§8. Philosophical close”was not chosen. Unlike the base , convenient by affinity with the decimal system, or any other base that a text might prefer by custom, was determined by a construction that left no margin of decision at any step: two sequences, a monotonicity condition proved with Bernoulli, a crossed bound, and the completeness axiom doing the rest. If some mathematics book had decided never to study compound interest, would have appeared anyway, under another disguise, in another problem, because it is not an artifact of the financial question that motivated it, but of the structure of itself, in the same way that does not depend on someone asking about the diagonal of a square.
And yet, this chapter left pending exactly the question that gives its central place in analysis: whether there exists a base for which the speed of change of the function coincides, at each point, with the value of the function. §4.1 posed it; this paragraph resolved it, but only halfway: it constructed the candidate number, not the property that would distinguish it among all positive reals. Answering it requires the derivative, and this book, deliberately, does not yet have it. It is not an omission: it is a frontier drawn on purpose, of the same kind as the one that separated, in the close of §2.4, what this book can name from what it can only construct in a Calculus I course.
It is worth noting, before closing, that this frontier has an almost exact historical precedent, although for reasons inverse to ours. Newton, in the Principia Mathematica of 1687, needed to reason about quantities that approached one another, arcs and chords, areas and their polygonal approximations, and he did so by means of what he called first and last ratios: the relation between two geometric quantities at the very instant when their difference became smaller than any given magnitude. He had neither the word “limit” nor an algebraic definition like the - that this book already named in §2.4, and yet he arrived, by a geometric and intuitive route, at results that the analysis of the nineteenth century, Cauchy, Weierstrass, would take more than a hundred and fifty years to ground with the rigor demanded today. The difference between that delay and this book’s is one of nature, not of degree: Newton avoided “limit” because the concept did not yet exist; this book avoids it, in the terrain of the derivative, because it decided to construct real analysis from its foundations, one floor at a time, and that floor has not yet arrived. The question that opened §4.1 remains, then, formulated with full precision, with its candidate already constructed and bounded between and , and with the complete answer waiting, unhurried, for the chapter that corresponds to it.
With this, section 4.2 is closed. §4.3 takes up the injectivity of , and of in general, already proved in section 4.1, to construct its inverse function: the logarithm.
Copyright © 2026 Carlos Dagorret — Licensed under Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)