epsilontic analysis

Epsilontic analysis

Epsilontic analysis


Epsilontic analysis is the now standard rigorous approach to analysis, developed by Bernard Bolzano, Augustin Cauchy, Karl Weierstraß, Richard Dedekind, and others in the mid-to-late 19th century. It contrasts with infinitesimal analysis, both the less-than-rigorous analysis that preceded it and the rigorous nonstandard analysis (and other approaches to infinitesimals, such as synthetic differential geometry) that followed it.

Ironically, classical epsilontic analysis is not rigorous enough for constructive mathematics, which requires it to be applied using intuitionistic logic. This was developed thoroughly by Errett Bishop; see constructive analysis.


Epsilontic analysis developed out of the practical problems of finding errors of approximation. Taking the basic principles of calculus for granted, 18th-century mathematicians discovered various methods to approximate the values of limits, derivatives, integrals, and series with an error guaranteed to be bounded above by whatever positive number ϵ\epsilon (for ‘error’) one wished.

Epsilontic analysis turns these results around into definitions: the value of a limit, derivative, integral, or series is defined to be the (necessarily unique) real number LL such that, given any positive number ϵ\epsilon, one can produce an approximation within ϵ\epsilon of LL.

Augustin Cauchy is often credited with promoting this approach, in his 1821 Cours d'Analyse. However, Cauchy also used infinitesimals, and he did not actually define concepts with epsilontics. Cauchy did, however, use epsilontic arguments in many proofs.

Other mathematicians used epsilontics to clarify Cauchy's work. Bernard Bolzano gave epsilontic definitions and proofs even earlier than Cauchy, but his work was largely ignored at the time. This later came to the attention of Karl Weierstraß, who set out a systematic treatment of epsilontic analysis, the basis of the standard analysis of today.

Topological vs uniform properties

The precise post-Cauchy development of epsilontics was necessary to clarify the difference between (as we now see them) topological and uniform properties, which show up in the order of quantifiers in the definitions.

Typically, topological properties apply at a point, although one can then require them at all points. Doing so, one has a definition of the form

x,ϵ,M,ϕ(M,x,ϵ), \forall x,\; \forall \epsilon,\; \exists M,\; \phi(M,x,\epsilon) ,

where MM is some parameter for a method of approximation and ϕ(M,x,ϵ)\phi(M,x,\epsilon) states that the method, applied with the parameter MM, approximates a value of interest at xx to within an error ϵ\epsilon. Equivalently, one may write

ϵ,x,M,ϕ(M,x,ϵ), \forall \epsilon,\; \forall x,\; \exists M,\; \phi(M,x,\epsilon) ,

but we cannot shift the quantifiers further.

In contrast, a uniform property necessarily refers to a range of points and typically takes the form

ϵ,M,x,ϕ(M,x,ϵ), \forall \epsilon,\; \exists M,\; \forall x,\; \phi(M,x,\epsilon) ,

which is stronger.

It is difficult to make this distinction without the ϵ\epsilon. It is not impossible to do this otherwise, as Abraham Robinson showed with infinitesimals, but it's telling that nobody did so before epsilontics. Even Cauchy's definitions are difficult to understand in this respect, since he used epsilontics only for proofs (and not always even then) and not for definitions. (In this regard, see the Cauchy sum theorem.)



The extent to which Cauchy anticipated modern epsilontics is debated. For arguments pro and contra (respectively), see:

  • Judith Grabiner (1983). Who Gave You the Epsilon? Cauchy and the Origins of Rigorous Calculus. The American Mathematical Monthly 90:3 (1983). pdf.

  • Piotr Błaszczyk, Mikhail G. Katz, David Sherry (2012). Ten Misconceptions from the History of Analysis and Their Debunking. arXiv. Foundations of Science 18:1 (2013), 43–74. doi.

On Bolzano, this looks promising, but I have not read it:

  • Paul Rusnock (2000). Bolzano's Philosophy and the Emergence of Modern Mathematics. Rodopi (2000).

Examples of epsilontic proofs include

  • Kyle Miller, Polynomials are continuous functions, 2014 (pdf)

Last revised on April 18, 2017 at 04:52:58. See the history of this page for a list of all contributions to it.