Chapter 4 — Exponential and Logarithmic Functions
4.1 - Exponential Functions
Having rational exponents was, until now, arithmetic disguised as algebra. What follows is the step in which that arithmetic becomes, without losing one iota of precision, analysis.
Chapter 1 left constructed, with all the rigor this book demands, the power with rational exponent: for and , the symbol was defined via radicals, and it was proved, not assumed, that this value does not depend on which representation of the fraction is used. This section does not repeat that construction: it uses it as a starting point and asks, precisely, about what cannot yet do, namely accept any real exponent, and not only the rational ones, in order then to resolve it.
§1. What has already been constructed, and the question it leaves open
Section titled “§1. What has already been constructed, and the question it leaves open”Recall, without proving it again, for economy and because it is already proved, that for , and , the symbol was defined in §4 of section 1.2 as , and that this definition requires, when is even, the restriction , since otherwise does not exist in . It was also proved, in that same section, that the value of does not depend on which fraction equivalent to is chosen to compute it.
That second property, independence of the representation, is more delicate than it seems when viewed with this chapter’s goal in mind. The proof of §1.2 assumes that both representations, and , give rise to well-defined powers; it does not say what happens if one of them does not exist in . And here the problem appears: one and the same rational number admits representations with even denominator and also with odd denominator ( and also, for example, ), so that if the base is negative, some representations of the same rational will produce a well-defined real number (those with odd index) and others none (those with even index). The symbol , for , is not badly defined: it is defined halfway, on a subset of that depends, in an unnatural way, on how the exponent has been written.
For a function that aspires to have domain , or even , as a first step, that situation is inadmissible. We therefore need a condition on guaranteeing that exist for every , without exception and without depending on the way the exponent is written.
§2. The condition a > 0 as a necessary and sufficient restriction
Section titled “§2. The condition a > 0 as a necessary and sufficient restriction”Proposition. Let . The value is defined in for all if and only if ; in that case, moreover, for all .
Proof. Sufficiency and necessity are proved separately.
(Sufficiency: defined and positive for all .) Let , with , in any representation. Since , in particular , so the restriction of §1.2 §3, necessary only when is even, is satisfied without further ado, whether is even or odd. Hence exists in , and with it, . Since this holds for any representation of , and §1.2 §4 already guaranteed that the result does not depend on which one is used, is well defined, without ambiguity, for all . As for the sign: is, by the definition of principal root, nonnegative, and since it cannot be , for if it were, , a contradiction, so that . A positive base raised to any integer exponent , positive, negative or zero, remains positive, by the laws of exponents already established; hence .
(Necessity: if , there exists with undefined.) If , already fails: is not defined in . If , take , with the only possible reduced representation even. The restriction of §1.2 §3 requires, for even, that ; since , there is no real with , so is not defined in . In either case, produces at least one rational for which does not exist.
§3. The convention of the exponential function: a > 0, a ≠ 1
Section titled “§3. The convention of the exponential function: a > 0, a ≠ 1”The previous Proposition fixes the first hypothesis on the base: . A second one remains, of a different nature, not algebraic but of purpose. If , then for all , and, as will be seen, for every real once the extension is completed, so that is simply the constant function , already studied in the catalog of prototypes of §2.4. There is nothing wrong with that function, but there is also nothing exponential in it: it lacks the strict monotonicity and the injectivity that are, as will be seen in §9, the central content of this chapter. It is excluded, then, not because it is badly defined but because its inclusion would make the following theorems vacuous.
With this, the base of every exponential function, whose formal definition will be completed only in §6–§7, once it is extended to , is restricted to
that is, and . This is the standard hypothesis that will be maintained, without repeating it in each statement, for the rest of the chapter.
With the base now restricted to , and well defined and positive for every rational , the central problem of this section is posed: to extend to an arbitrary real exponent , in a unique way and without losing any of its algebraic properties. The tool that makes this possible is the supremum axiom, fixed in §9 of section 1.1; but before invoking it an auxiliary fact is needed that this axiom has as an immediate consequence and that, until now, the book never needed to make explicit.
§4. Density of ℚ in ℝ
Section titled “§4. Density of ℚ in ℝ”Lemma (Archimedean property). The set is not bounded above in .
Proof. We proceed by contradiction. If were bounded above, the supremum axiom would guarantee the existence of . Since , the number cannot be an upper bound of , for if it were, would not be the least of the upper bounds, so there exists some with , that is, . But as well, so does not bound : a contradiction, since was supposed to be an upper bound of all of . Hence is not bounded above.
In particular, for every there exists some natural number with ; if there were none, would be an upper bound of , contradicting the Lemma. With this we prove what really matters here: that between two distinct reals, however close they are, there is always a rational.
Proposition (density of in ). For every pair with , there exists such that .
Proof. Since , the Archimedean Lemma gives a natural number with , whence , that is, . Consider the set of integers strictly greater than ; it is nonempty, again by the Lemma, applied this time to , and it is bounded below by , so it has a least element , by the well-ordering property of . The minimality of forces , that is, ; and by construction, . Combining both inequalities with the one above,
and dividing by throughout the chain, . The rational is the one sought.
§5. Rational monotonicity of the base
Section titled “§5. Rational monotonicity of the base”Before defining the extension we need to know that, over , the power already behaves as expected of an increasing function when ; otherwise, the supremum to be used in §6 would have no increasing sense to extend.
Lemma. Let . If and , then .
Proof. Write , with , in reduced form; since , . By the laws of exponents already established in §1.2 §2, valid also for rational exponents, according to §4 of that same section,
We claim that . Indeed, if , raising both sides to the integer power , an operation that preserves order among nonnegatives, we would obtain , contradicting the hypothesis . Hence , and a base greater than raised to a positive integer remains greater than : . Thus , and since by the Proposition of §2, we conclude .
§6. Existence and uniqueness of the continuous extension for a > 1
Section titled “§6. Existence and uniqueness of the continuous extension for a > 1”With the density of in and rational monotonicity now available, the central result of this section can be formulated and proved.
Proposition (continuous extension, case ). Let . There exists a unique function that coincides with on and that is strictly increasing on . It is given, for each , by
Proof. It is organized in three parts: that the supremum exists (good definition), that coincides with the already known rational power when (consistency), and that no other function with the required properties can differ from (uniqueness).
Good definition. Fix , and let . The set is not empty: by the Archimedean Lemma there exists a natural number greater than , and from it an integer , take for example the negative of that natural number, which in particular is rational, so that . Nor is unbounded: by the density Proposition there exists a rational , and by the Lemma of §5, every rational satisfies ; hence is an upper bound of . Nonempty and bounded above, the supremum axiom guarantees that exists in , and being the supremum of a set of positive numbers, . This defines for each , without ambiguity.
Consistency with the rational case. Let . Since , taking in the definition of the set, we have . On the other hand, every satisfies , and by the Lemma of §5, or equality if , ; hence is an upper bound of , and since is the least of the upper bounds, . Both inequalities together give : the extension contradicts, at no rational point, what was already constructed in Chapter 1.
Uniqueness. Let be another strictly increasing function that coincides with on . Define, alongside , the set . By the same density and monotonicity argument of §5, is nonempty and bounded below, by any with , so that exists. Since every element of is smaller than every element of (if , the Lemma of §5 gives ), it follows immediately that
Sublemma (approximation of unity). For and every rational , there exists with .
Proof of the sublemma. We first use Bernoulli’s inequality: for and real , , a fact proved by induction on , without difficulty, from . By the Archimedean Lemma of §4, there exists with , that is, . Combining with Bernoulli, . Both sides of are positive, and the th root, of which it was already proved, in §1.2 §3, that it is a well-defined operation and that it preserves order among nonnegative reals, gives .
With this sublemma the missing equality is closed. Suppose, for contradiction, . Let be an integer with , which exists by the Archimedean Lemma of §4, applied to , and let , a fixed bound that does not depend on what follows. Apply the sublemma with : there exists with . By the density Proposition, there exists a rational ; take , also rational. Then and . Since , the Lemma of §5 gives , so that
We have thus obtained a pair with , whence , contradicting the definition of . Hence , that is,
With this equality, uniqueness is immediate: for every rational , by monotonicity of , so that is an upper bound of and ; symmetrically, for every rational , , so that is a lower bound of and . Both inequalities give for all , and therefore .
The extension for is thus resolved. The case does not follow from this one by simple algebraic symmetry (the base changes monotonicity regime, not only the sign of an exponent) and requires its own proof, dual by means of infima instead of suprema: it is the content of §7.
§7. Existence and uniqueness of the continuous extension for 0 < a < 1
Section titled “§7. Existence and uniqueness of the continuous extension for 0 < a < 1”The case is not a mere notational mirror: the power now decreases as increases, so that the relevant set is bounded not above but below, and it is the infimum, not the supremum, that produces the extension. Each step is proved autonomously, without appealing to the relation with .
Lemma (rational monotonicity, case ). Let . If and , then .
Proof. As in §5, write with . We first claim that : if it were , raising to the power would give , contrary to the hypothesis . Since also , being the principal root of a positive real, we have . A base in that range raised to a positive integer remains in that range: indeed, if then , so that, by induction on starting from , it follows that for all . Applied to : , that is, . Since , multiplying by preserves the inequality: .
Lemma (existence of the infimum). Every nonempty subset of bounded below has an infimum in .
Proof. Let be nonempty and bounded below by . The set is nonempty and bounded above by , since for all is equivalent to . By the supremum axiom, exists. It is verified directly that satisfies the two conditions that define the infimum of : it is a lower bound of , because is an upper bound of , and no greater lower bound exceeds it, because is the least upper bound of . Hence exists.
With both lemmas available, let , for fixed and . It is nonempty by the same Archimedean argument of §6, and it is bounded below: by density there exists a rational , and since for every in the set, the dual monotonicity Lemma gives , so that is a lower bound. By the Lemma on the existence of the infimum, exists and is positive, being the infimum of a set of positive reals, bounded below by one of them.
Sublemma (approximation of unity, case ). For every rational , there exists such that .
Proof. Let , and write with , which exists because implies . By Bernoulli’s inequality, already proved in §6, for all . By the Archimedean Lemma of §4, there exists with , that is, . Combining, , whence . Taking the th root, order being preserved among positives, according to §1.2 §3, we obtain , that is, .
Proposition 2 (continuous extension, case ). Let . There exists a unique function that coincides with on and that is strictly decreasing on . It is given, for each , by .
Proof. The good definition was already established above. For consistency, let : since , ; and since every satisfies , the dual monotonicity Lemma gives , a lower bound, so that . Both inequalities give .
For uniqueness, let , nonempty and bounded above by any with , via the same dual monotonicity Lemma, so that exists. Every element of is smaller than every element of (if , ), hence . For the reverse inequality, let and suppose . Let be the unique integer with , which exists by the same well-ordering argument used in the density Proposition of §4, and let , a fixed bound. Apply the sublemma with : there exists with . By density, there exists a rational ; let . Since , we have , so that the dual monotonicity Lemma gives . Hence
Thus, , contradicting the definition of . Hence and .
From this equality uniqueness follows exactly as in §6: if is decreasing and coincides with on , then for it is , an upper bound of over inverted, so that ; and for , , so that . Both give .
With both Propositions, §6 for and §7 for , the function is defined and uniquely determined on all of , for any admissible base. What remains is what gives this construction its true operational value: to prove that keeps the homomorphism property, , beyond . That is the content of §8.
§8. The fundamental homomorphism: f(x+y) = f(x)f(y) on ℝ
Section titled “§8. The fundamental homomorphism: f(x+y) = f(x)f(y) on ℝ”Over , the identity is, essentially, the product law for powers of §1.2 §2, extended to rational exponents in §1.2 §4. Extending it to is not automatic: and are, a priori, two numbers constructed by different procedures, a supremum (or infimum) taken over rationals close to , against a product of two suprema (or infima) taken separately, and an argument is needed to know that they coincide. The tool that makes this possible is a general fact about how the supremum and the infimum interact with the product.
Lemma (supremum of a product). Let be nonempty and bounded above, with , . Then is bounded above and .
Proof. For any , and , and multiplying two inequalities between positives preserves the direction: . Hence is an upper bound of , and .
For the reverse inequality, fix and take . By the characterization of the supremum of §1.1 §9, for every there exists an element of the set exceeding , there exist with and with . Then
so that . Since this holds for all , it follows that . Both inequalities give .
Lemma (infimum of a product). Let be nonempty and bounded below by positive bounds, with , . Then .
Proof. The inequality is immediate: , give for all , so is a lower bound of . For the reverse, fix and take . By the dual characterization of the infimum, for every there exists an element of the set smaller than , there exist with and with . Since , , and
so that . Since this holds for all , it follows that . Both inequalities give .
With these two lemmas, the proof of the homomorphism reduces to a question of set inclusion.
Proposition (fundamental homomorphism). Let , , and the extension constructed in §6 (if ) or in §7 (if ). Then, for all ,
Proof. We treat the case ; the case is analogous, exchanging the roles of and , as detailed at the end.
Case . Recall, from §6, the sets and , with .
If and , that is, , , both rational, then is rational, so that . This shows , and therefore . By the Lemma of the supremum of a product, . Hence
Symmetrically, if and , that is, , , then is rational, so that . This shows , and therefore . By the Lemma of the infimum of a product, . Hence
Both inequalities together give .
Case . With and of §7, now . The same inclusion , via , gives, by the Lemma of the infimum of a product, , that is, . And the inclusion , via , gives, by the Lemma of the supremum of a product, , that is, . Both inequalities together give, again, .
As an immediate corollary, and without need of a new proof, being a direct algebraic consequence of the homomorphism already proved, we obtain the general laws of exponents in : (taking and using ), , and for . The verification of each is left as an exercise in §12.
With the homomorphism established, it remains to characterize how behaves as a function: its strict monotonicity on all of , not only on as until now, its injectivity, and the exact sets it occupies as domain and range. That is the content of §9.
§9. Strict monotonicity and injectivity on ℝ
Section titled “§9. Strict monotonicity and injectivity on ℝ”The Lemmas of §5 and §7 proved the monotonicity of only for rational . It remains to extend it to every pair of reals, which is not automatic: that a function increase on every pair of rationals is not enough, by itself, to guarantee that it increase on every pair of reals, unless it is proved.
Proposition (strict monotonicity). Let be the extension constructed in §6 or in §7. If , then is strictly increasing on : . If , then is strictly decreasing: .
Proof. Let with . By the density Proposition of §4, there exists a rational ; applied again to the pair , there exists a rational . In particular, , with .
Case . Since , and therefore . Since , and therefore . Since , the rational monotonicity Lemma of §5 gives . Chaining the three relations,
whence .
Case . Since , and therefore . Since , and therefore . Since , the dual monotonicity Lemma of §7 gives . Chaining,
whence , that is, .
Corollary (injectivity). is injective on : if , then .
Proof. Without loss of generality, . By the previous Proposition, or according as or ; in either case, .
With strict monotonicity and injectivity proved, what remains is to determine the exact domain and range of , the latter, in particular, requiring a genuinely new argument, and the behavior of at the ends of the domain. That is the content of §10.
§10. Domain and range
Section titled “§10. Domain and range”Proposition (domain). .
Proof. Immediate: the good-definition part of the Propositions of §6 and §7 showed that exists, as a supremum or as an infimum, according to the case, for each , without exception.
The range is the nontrivial part. Before tackling it, a lemma is needed on the growth of integer powers, which supports both surjectivity and, in §11, the asymptote.
Lemma (unboundedness of integer powers). Let . The set is not bounded above in .
Proof. Let . By Bernoulli’s inequality, already proved in §6, for all . Given any , the Archimedean Lemma of §4 gives a natural number , whence , and therefore . Since was arbitrary, the set has no upper bound.
This lemma, applied to when , and to when , a case in which , covers both regimes of the base without need of a second proof: it is a purely arithmetic fact about numbers greater than , independent of which exponential function is being constructed with it.
Proposition (range). .
Proof. The inclusion was already proved: both the supremum and the infimum of a set of positive reals are positive, as established in the good definition of §6 and §7. The reverse inclusion remains: given any , exhibit with .
Case . Let . It is nonempty: by the previous Lemma there exists with , whence , using the rational consistency of §6, that is, . It is bounded above: there exists with , and by the strict monotonicity of §9, every satisfies , so that no such belongs to ; hence is an upper bound. By the supremum axiom, exists in .
We claim . Suppose first . By the homomorphism of §8 and rational consistency, for any ,
Since , because and , the approximation of unity sublemma of §6 gives an with , whence . Thus, and , contradicting that is an upper bound of .
Suppose, instead, . By the same homomorphism,
Since , the approximation of unity sublemma gives an with , whence . If there existed with , the strict monotonicity of §9 would give , contradicting (which requires ). Hence no element of exceeds : it is an upper bound of , and , contradicting that is the least upper bound.
Both strict inequalities having been ruled out, .
Case . Let . By an argument symmetric to the previous one, using the Lemma applied to to obtain arbitrarily large and arbitrarily small, is nonempty and bounded above, so that exists.
If : by the homomorphism, . By the approximation of unity sublemma of §7, there exists with for , whence . Thus , exceeding : a contradiction.
If : by the homomorphism, . Applying the approximation of unity sublemma of §6, this time to , which gives arbitrarily close to from above, there exists with for , whence . By the strict decreasing monotonicity of §9, every satisfies , so that no such is in : is an upper bound of , smaller than : a contradiction.
In both cases, .
With domain and range established, and being bijective by §9 and this Proposition, the piece that §4.3 will need in order to define the logarithm as an inverse function is fixed.
§11. Asymptotic behavior
Section titled “§11. Asymptotic behavior”It remains to describe how behaves at the ends of its domain, behavior that, unlike the range, requires no new tool: the unboundedness Lemma of §10 suffices.
Proposition (horizontal asymptote). Let . For every there exists such that . Moreover, is not bounded above: for every there exists such that .
Proof. Given , the Lemma of §10 gives with . If , the strict monotonicity of §9 gives ; and since always, . Given , the same Lemma gives with ; if , strict monotonicity gives .
The case is exactly the mirror: decreases, so that the unbounded behavior occurs on the left and the approach to zero on the right.
Proposition (horizontal asymptote, case ). Let . For every there exists such that . Moreover, for every there exists such that .
Proof. Apply the Lemma of §10 to : given , there exists with , that is, . If , the strict decreasing monotonicity of §9 gives . Given , there exists with , that is, ; if , strict monotonicity gives .
With this the analytic characterization of the exponential function is complete: existence and uniqueness of its extension to (§6–§7), its homomorphism (§8), its strict monotonicity and injectivity (§9), its domain and range (§10), and its asymptotic behavior (§11). What remains is the block of worked exercises and proofs, and the closing reflection on the passage from discrete algebra to continuous analysis, the content of §12.
§12. Worked exercises, proofs and close
Section titled “§12. Worked exercises, proofs and close”Part A — Worked exercises and complete proofs
Section titled “Part A — Worked exercises and complete proofs”Exercise 1. Prove that for all .
Solution. By the homomorphism of §8, applied to and ,
Since , the range of , §10, both sides can be divided by without altering the equality: .
The other two deferred corollaries, and , do not follow from a single algebraic step: they ask us to compare two functions constructed by different procedures (one a composition of extensions, the other a product of extensions), and a general criterion is needed to know when two such constructions coincide. That criterion is developed before using it.
Lemma (continuity at of every exponential extension). Let . For every there exists such that, for every with , .
Proof. If , the claim is trivial: for all . Suppose ; without loss of generality, ; if , the argument is the mirror, using the sublemma of §7 instead of that of §6. By the approximation of unity sublemma of §6, given , there exists with ; for the same reason, applied to , or directly by rational monotonicity of §5, which gives and, together with the approximation, for sufficiently large, by an identical argument, also by choosing larger if necessary. Let . For , , and by the strict monotonicity of §9, . Combining, , that is, .
Lemma (uniqueness of homomorphisms continuous at ). Let be such that and for all , that coincide on , and that are both continuous at in the sense of the previous Lemma. Then on .
Proof. Every homomorphism satisfies , since , and as , the only solution of with is , and , so that never vanishes, consistent with the hypothesis. Define , well defined since . It is a homomorphism: . It equals on : if , by hypothesis, hence . And it is continuous at with value : given , take ; by the continuity at of and , there exists such that gives , whence , an interval contained in for , a direct algebraic verification.
Now fix arbitrary and . By the continuity at of , there exists with . By the density of §4, there exists with . Then
using that . Since , it follows that . Since was arbitrary, , that is, . Since was arbitrary, .
Exercise 2. Prove that for all , understanding as the real extension (§6–§7) applied to the base .
Solution. Fix . Define and , both functions of . The three hypotheses of the Uniqueness Lemma are verified.
Homomorphism. , by §8 applied to the base . , by §8 applied to the base .
Coincidence on . Let . By iterated homomorphism, applying §8 times, . Thus, is a positive real whose th power is ; by the uniqueness of the principal th root (§1.2 §3), . Hence, using again iterated homomorphism and Exercise 1 for negative exponents,
Continuity at . is continuous at by the previous Lemma, applied to . For : given , if the claim is trivial for all ; if , by the continuity at of there exists with , and taking , .
By the Uniqueness Lemma, , that is, for all , and since was arbitrary, for all .
Exercise 3. Prove that for and all .
Solution. Define and . Homomorphism: is one by construction (§8, base , or trivially if ); , using §8 for and for separately. Coincidence on : for is the law of rational exponents already extended in §1.2 §4. Continuity at : , by the Lemma, applied to ; , a product of two functions each continuous at with value , whence by a bounding argument analogous to the one used inside the Uniqueness Lemma. By the Uniqueness Lemma, : .
Exercise 4 (exponential equation, same base). Solve .
Solution. By the injectivity of §9, a corollary of strict monotonicity, if and only if the exponents coincide: . Hence , that is, . Injectivity is what justifies the step, not an informal manipulation: without it, two distinct exponents could, in principle, produce the same value.
Exercise 5 (exponential equation, different reducible bases). Solve .
Solution. Rewrite both bases as powers of : , . By Exercise 2, and . The equation reduces to , and by injectivity (§9), , whence .
Exercise 6 (exponential inequality, base between and ). Solve .
Solution. Since , is strictly decreasing (§9). For a strictly decreasing function, forces : if it were , the values would coincide by direct substitution; if it were , decreasing monotonicity would give , contradicting the hypothesis. Hence the solution is .
Part B — Philosophical close and transition
Section titled “Part B — Philosophical close and transition”Before closing this section, it is worth taking stock of what really made possible the passage from to in exponentiation. It was not a new set of numbers, unlike what was required, in Chapter 3, by the passage from to , nor a new operation: it was a single property of , completeness, already fixed as an axiom in §1.1, long before this chapter needed it. All the machinery constructed throughout these twelve sections (supremum, infimum, density, Bernoulli’s inequality, the approximation of unity) is, seen as a whole, a single idea applied over and over from different angles: that a pattern defined on a discrete and perforated set such as can be forced, without ambiguity or exception, to occupy every hole of the continuum, provided one has a bound that sustains it from both sides. The discrete algebra of Chapter 1 asked “what is raised to this exact fraction worth?”; the analysis of this chapter asks, instead, “what value is obliged, not chosen but obliged, to occupy the place of raised to a number that is not a fraction of anything?” The answer, as the uniqueness Propositions of §6 and §7 proved, depends on no arbitrary decision: it is completely determined the moment the base is fixed and continuity with what was already constructed on is demanded.
It is worth noting that this rigor was late in arriving, and that its absence did not prevent, for more than a century, the exponential function from being used with complete confidence. Euler, in his Introductio in analysin infinitorum of 1748, wrote expressions such as for irrational without stopping to ask what it meant exactly to raise a number to a power that admits no representation as a quotient of integers; he relied, implicitly, on the same intuition of “approximating by rationals” that this chapter formalized step by step, but without the completeness axiom, which would not be stated precisely until Dedekind and Cantor, more than a century later, to sustain that intuition with a proof. Euler’s practical result was correct; what was missing was not the calculation, but the guarantee that that calculation had, indeed, a single possible result. Closing that gap, between the fruitful use of an object and the certainty that this object exists and is unique, was, to a great extent, the program of real analysis in the nineteenth century, and this chapter, in miniature, repeated that program: it started from a function that was already being used with ease on and demanded of it, before moving on, that it give an account of its own existence on .
That demand, to give an account before operating, is not exclusive to exponentiation, and it will not be the last time this book applies it. Whenever an operation defined on a discrete set must be extended to a continuum, the general strategy is the same: bound from both sides with elements of the discrete set, invoke completeness to guarantee a meeting point, and verify that this meeting point does not depend on how it was approximated. The logarithm of §4.3, being defined as the inverse of a function already continuous on its entire domain, will inherit for free a good part of this work; but the methodological lesson, that the continuum is not reached by decree, but by a specific proof in each case, is worth carrying, explicitly, to the rest of the chapter.
One question remains, however, that this chapter deliberately left open, because it was not its place to close it. Among all possible bases, , each gives rise to a genuinely different exponential function, with its own rate of growth or decay; §12 already showed how to compare two of them by means of , but it said nothing about whether some base occupies a privileged place among all. The question worth formulating, and leaving resonating until §4.2, is this: does there exist, among that infinity of bases, one that is distinguished not by typographic convention or computational convenience, as choosing might seem, by affinity with the decimal system, but by a genuine structural property, internal to the function itself? Concretely: is there a base for which the speed with which the function grows at each point coincides, exactly, with the value the function has at that point? Formulated thus, the question does not yet have rigorous meaning, since it must first be made precise what “speed of growth at a point” means for a function that is neither linear nor polynomial, a notion that this book has not yet constructed, but its mere formulation already suggests that, if such a base exists, it will not be chosen: it will be discovered, in the same way that was not chosen to solve , but was proved, in §1.1, to have to exist.
With §12 section 4.1 is closed. §4.2 takes up the question just posed in order to construct, from it, the natural exponential function and the number .
Copyright © 2026 Carlos Dagorret — Licensed under Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)