Though Riemann sums had been considered earlier, at least in particular cases (for example, by Cauchy), the general version we consider today was introduced by Riemann, when studying problems related to trigonometric series, in his paper Ueber die Darstellbarkeit einer Function durch eine trigonometrische Reihe. This was his Habilitationsschrift, from 1854, published posthumously in 1868.
Riemann’s papers (in German) have been made available by the Electronic Library of Mathematics, see here. The text in question appears in section 4, Ueber den Begriff eines bestimmten Integrals und den Umfang seiner Gültigkeit. The translation below is as in
- A source book in classical analysis. Edited by Garrett Birkhoff. With the assistance of Uta Merzbach. Harvard University Press, Cambridge, Mass., 1973. MR0469612 (57 #9395).
Also zuerst: Was hat man unter
zu verstehen?
Um dieses festzusetzen, nehmen wir zwischen
und
der Grösse nach auf einander folgend, eine Reihe von Werthen
an und bezeichnen der Kürze wegen
durch
,
durch
![]()
durch
und durch
einen positiven ächten Bruch. Es wird alsdann der Werth der Summe
![]()
von der Wahl der Intervalle
und der Grössen
abhängen. Hat sie nun die Eigenschaft, wie auch
und
gewählt werden mögen, sich einer festen Grenze
unendlich zu nähern, sobald sämmtliche
unendlich klein werden, so heisst dieser Werth
.
In Birkhoff’s book:
First of all: What is to be understood by
?
In order to establish this, we take the sequence of values
lying between
and
and ordered by size, and, for brevity, denote
by
,
by
![]()
by
, and proper positive fractions by
. Then the value of the sum
![]()
will depend on the choice of the intervals
and the quantities
. If it has the property that, however the
and the
may be chosen, it tends to a fixed limit
as soon as all the
become infinitely small, then this value is called
.
(Of course, in modern presentations, we use instead of
, and say that the
approach
rather than become infinitely small. In fact, we tend to call the collection of data
,
a tagged partition of
, and call the maximum of the
the mesh or norm of the partition.)
[…] 11. Section 7.1. Riemann sums. Homework: 7.1: 2, 4, 6, […]