Equivalence of Riemann and Darboux Integrals

Every calculus student meets two seemingly different definitions of "the integral." One says a function is integrable if Riemann sums converge to a single number. These sums are built from tagged partitions, and convergence happens as the mesh shrinks. The other says a function is integrable if the supremum of lower sums equals the infimum of upper sums. This second definition uses no tags and no limiting mesh at all. Students are told these agree, usually without proof, and move on. But the reconciliation is not a triviality. It is the moment where two independently plausible formalizations of "area under a curve" are shown to be logically identical. It is worth doing carefully. The stakes are higher than bookkeeping. The Darboux Integral is technically easier to work with. It reduces integrability to a single inequality about suprema and infima. Its proofs (linearity, additivity, the fundamental theorem of calculus) are cleaner. There is no limit over tagged partitions to control. The Riemann Sums and the Riemann Integral definition, by contrast, is the one that generalizes. Riemann sums with tags are what you differentiate. They are also what physicists actually compute when they chop a region into pieces and pick sample points. Knowing the two definitions coincide lets you use whichever is more convenient at each stage of an argument. You need not fear a hidden gap. The proof has two directions, and they are not symmetric in difficulty. Showing that Darboux integrability implies Riemann integrability is the harder direction. Given that upper and lower Darboux sums can be squeezed together, more must be shown. One must show that every tagged Riemann sum, regardless of how the tags are chosen, is forced close to the same limit. This holds once the mesh is small enough. The converse — Riemann integrability implies Darboux integrability — is comparatively short. It exploits the fact that upper and lower sums are suprema and infima of Riemann sums over all possible tag choices. This article gives complete, self-contained proofs of both directions. It builds on the Cauchy Integrability Criterion for the Darboux side. The result is the theorem that licenses every calculus textbook's silent switching. It moves between "lim⁡∑f(ti)Δxi\lim \sum f(t_i)\Delta x_i" and "sup⁡L(f,P)=inf⁡U(f,P)\sup L(f,P) = \inf U(f,P)." It also sets up the transition to Lebesgue's criterion. There, a third, measure-theoretic characterization of Riemann integrability enters the picture.

Key takeaways
  • Two definitions of the integral exist: Riemann's (limit of tagged sums as mesh →0\to 0) and Darboux's (sup of lower sums = inf of upper sums).
  • The theorem states: ff is Riemann integrable on [a,b][a,b] iff ff is Darboux integrable on [a,b][a,b], and the values agree.
  • Darboux ⇒\Rightarrow Riemann is the subtle direction: it requires bounding the effect of the endpoints of a fine partition on any coarser tagged sum.
  • Riemann ⇒\Rightarrow Darboux is the easy direction: upper and lower sums are sup/inf of Riemann sums over tag choices, so they inherit the same limit.
  • Both directions require ff bounded on [a,b][a,b]; unbounded functions break the Darboux definition entirely (sums become ±∞\pm\infty).
  • Key idea: controlling how many subintervals of a fine partition can straddle the endpoints of a coarser one converts "sup/inf agree" into "every tagged sum is close," and vice versa.

Where this lives today

The Darboux formulation is the workhorse behind essentially every rigorous proof in an introductory real analysis course: linearity of the integral, additivity over subintervals (Basic Properties: Linearity and Additivity), integrability of continuous and monotonic functions, and the Fundamental Theorem of Calculus all have their cleanest proofs phrased in terms of U(f,P)U(f,P) and L(f,P)L(f,P). The equivalence theorem is what licenses transferring these results back to statements about Riemann sums, which is the form used whenever an integral is computed via a limit of sample sums — in numerical quadrature, in physics derivations of work, mass, or center-of-mass as limits of Riemann sums, and in the definition of the integral that most students actually see first. The theorem also serves as a template for later, harder equivalences in the theory of integration: the equivalence between Riemann integrability and Lebesgue's characterization via the set of discontinuities having measure zero (Lebesgue's Criterion for Riemann Integrability) uses a similar strategy of comparing a partition-based quantity to a set-theoretic one. In numerical analysis, Riemann sums with specific tag rules (left, right, midpoint, Simpson's rule) are the starting point for quadrature algorithms, and the Darboux perspective supplies the error bounds that guarantee convergence. In probability and stochastic calculus, Itô and Stratonovich integrals generalize the tagged-sum idea to random integrators, where — strikingly — the choice of tag does affect the value, in sharp contrast to the classical setting where this theorem guarantees tag-independence for any Riemann-integrable function.

:::quiz[Why does the function f(x)=1/xf(x)=1/x on (0,1](0,1] (extended by f(0)=0f(0)=0) fail to satisfy the theorem's hypotheses?]

  • It is discontinuous at countably many points.
  • It fails to be monotonic.
  • It is unbounded near x=0x=0, so upper Darboux sums are +∞+\infty for every partition. ✓
  • It takes only rational values.

Ask the tutor: Can you show me how the "Class A / Class B" bookkeeping argument would change if the coarse partition P0P_0 has a point where ff has a jump discontinuity exactly at an interior grid point?

DefinitionRiemann and Darboux integrability

Let f:[a,b]→Rf:[a,b]\to\mathbb{R} be a bounded function, where a<ba<b.

Tagged partitions and Riemann sums. A partition of [a,b][a,b] is a finite set

P={a=x0<x1<⋯<xn=b}.P=\{a=x_0<x_1<\cdots<x_n=b\}.

Its mesh is ∥P∥=max⁡1≤i≤n(xi−xi−1)\|P\|=\max_{1\le i\le n}(x_i-x_{i-1}). A tagged partition (P,t)(P,\mathbf{t}) consists of a partition PP together with a choice of tag ti∈[xi−1,xi]t_i\in[x_{i-1},x_i] for each i=1,…,ni=1,\dots,n. The associated Riemann sum is

S(f,P,t)=∑i=1nf(ti)(xi−xi−1).S(f,P,\mathbf{t}) = \sum_{i=1}^n f(t_i)(x_i-x_{i-1}).

The function ff is Riemann integrable on [a,b][a,b] with Riemann integral I∈RI\in\mathbb{R} if for every ε>0\varepsilon>0 there exists δ>0\delta>0 such that for every tagged partition (P,t)(P,\mathbf{t}) with ∥P∥<δ\|P\|<\delta,

∣S(f,P,t)−I∣<ε.|S(f,P,\mathbf{t})-I|<\varepsilon.

Upper and lower Darboux sums. For a partition P={x0,…,xn}P=\{x_0,\dots,x_n\}, set

Mi=sup⁡x∈[xi−1,xi]f(x),mi=inf⁡x∈[xi−1,xi]f(x)M_i=\sup_{x\in[x_{i-1},x_i]}f(x),\qquad m_i=\inf_{x\in[x_{i-1},x_i]}f(x)

(finite since ff is bounded). Define the upper and lower Darboux sums

U(f,P)=∑i=1nMi(xi−xi−1),L(f,P)=∑i=1nmi(xi−xi−1).U(f,P)=\sum_{i=1}^n M_i(x_i-x_{i-1}),\qquad L(f,P)=\sum_{i=1}^n m_i(x_i-x_{i-1}).

The upper and lower Darboux integrals are

∫ab‾f=inf⁡PU(f,P),∫ab‾f=sup⁡PL(f,P),\overline{\int_a^b} f = \inf_P U(f,P), \qquad \underline{\int_a^b} f = \sup_P L(f,P),

the inf and sup taken over all partitions PP of [a,b][a,b]. Always ∫ab‾f≤∫ab‾f\underline{\int_a^b}f \le \overline{\int_a^b}f. The function ff is Darboux integrable if these two values coincide, and the common value is the Darboux integral of ff on [a,b][a,b].

Intuition

Picture the graph of a bounded function over [a,b][a,b]. The Darboux approach boxes the region between two staircases: a lower staircase built from the infima mim_i on each subinterval, always below the graph, and an upper staircase built from suprema MiM_i, always above it. Refining the partition can only push the lower staircase up and the upper staircase down, squeezing the true area from both sides. Integrability means this squeeze has no gap left at the end. The Riemann approach instead samples the function at a single point tit_i in each subinterval and adds up rectangles of height f(ti)f(t_i). Because tit_i can be any point of [xi−1,xi][x_{i-1},x_i], a Riemann sum can realize any value between L(f,P)L(f,P) and U(f,P)U(f,P) for a fixed partition — actually it can get arbitrarily close to mim_i or MiM_i on each piece by choosing tit_i appropriately, though it may not exactly hit the sup or inf if they are not attained. The theorem says that once you also let the mesh shrink to zero, "some tag choice traps the sum near LL" and "every tag choice traps the sum near U(f,P)=L(f,P)U(f,P)=L(f,P)'s common limit" become the same statement.

Figure
Lower and upper staircases sandwich every tagged Riemann sum
x y x₀=a xₙ₋₁ xₙ=b gray = L(f,P), red outline = U(f,P), dots = tags f(tᵢ)
TheoremEquivalence of Riemann and Darboux integrals

Let f:[a,b]→Rf:[a,b]\to\mathbb{R} be bounded, a<ba<b. Then ff is Riemann integrable on [a,b][a,b] with Riemann integral II if and only if ff is Darboux integrable on [a,b][a,b] with Darboux integral II. In particular the class of integrable functions and the value of the integral do not depend on which definition is used.

LemmaRiemann sums are sandwiched by Darboux sums

For any bounded ff, any partition PP, and any tagging t\mathbf{t} of PP,

L(f,P)≤S(f,P,t)≤U(f,P).L(f,P) \le S(f,P,\mathbf{t}) \le U(f,P).
Proof

Write P={x0<⋯<xn}P=\{x_0<\dots<x_n\}. On each subinterval [xi−1,xi][x_{i-1},x_i], the tag tit_i lies in [xi−1,xi][x_{i-1},x_i], so by definition of infimum and supremum,

mi=inf⁡[xi−1,xi]f≤f(ti)≤sup⁡[xi−1,xi]f=Mi.m_i = \inf_{[x_{i-1},x_i]} f \le f(t_i) \le \sup_{[x_{i-1},x_i]} f = M_i.

Multiplying by xi−xi−1>0x_i-x_{i-1}>0 (which does not reverse inequalities) and summing over i=1,…,ni=1,\dots,n gives

∑i=1nmi(xi−xi−1)≤∑i=1nf(ti)(xi−xi−1)≤∑i=1nMi(xi−xi−1),\sum_{i=1}^n m_i(x_i-x_{i-1}) \le \sum_{i=1}^n f(t_i)(x_i-x_{i-1}) \le \sum_{i=1}^n M_i(x_i-x_{i-1}),

which is exactly L(f,P)≤S(f,P,t)≤U(f,P)L(f,P)\le S(f,P,\mathbf{t})\le U(f,P). ■\blacksquare

∎
LemmaRefinement lemma for Darboux sums

If P′⊇PP'\supseteq P (i.e. P′P' is a refinement of PP, obtained by adding finitely many points), then

L(f,P)≤L(f,P′)≤U(f,P′)≤U(f,P).L(f,P) \le L(f,P') \le U(f,P') \le U(f,P).

Consequently ∫ab‾f=inf⁡PU(f,P)\overline{\int_a^b} f = \inf_P U(f,P) and ∫ab‾f=sup⁡PL(f,P)\underline{\int_a^b} f=\sup_P L(f,P) are well-defined real numbers with ∫ab‾f≤∫ab‾f\underline{\int_a^b}f\le \overline{\int_a^b}f, and this holds for any two partitions P1,P2P_1,P_2: L(f,P1)≤U(f,P2)L(f,P_1)\le U(f,P_2).

Proof

It suffices to prove the claim when P′P' is obtained from PP by adding a single point c∈(xk−1,xk)c\in(x_{k-1},x_k) for some kk, since a general refinement is reached by finitely many such single-point insertions and the inequalities compose. Only the kk-th term changes. Let

Mk′=sup⁡[xk−1,c]f,Mk′′=sup⁡[c,xk]f,mk′=inf⁡[xk−1,c]f,mk′′=inf⁡[c,xk]f.M_k'=\sup_{[x_{k-1},c]}f,\quad M_k''=\sup_{[c,x_k]}f,\quad m_k'=\inf_{[x_{k-1},c]}f,\quad m_k''=\inf_{[c,x_k]}f.

Since [xk−1,c]⊆[xk−1,xk][x_{k-1},c]\subseteq[x_{k-1},x_k], every value of ff on [xk−1,c][x_{k-1},c] is ≤Mk=sup⁡[xk−1,xk]f\le M_k=\sup_{[x_{k-1},x_k]}f, so Mk′≤MkM_k'\le M_k; similarly Mk′′≤MkM_k''\le M_k. Hence

Mk′(c−xk−1)+Mk′′(xk−c)≤Mk(c−xk−1)+Mk(xk−c)=Mk(xk−xk−1).M_k'(c-x_{k-1}) + M_k''(x_k-c) \le M_k(c-x_{k-1}) + M_k(x_k-c) = M_k(x_k-x_{k-1}).

All other terms of U(f,P)U(f,P) and U(f,P′)U(f,P') are identical, so U(f,P′)≤U(f,P)U(f,P')\le U(f,P). The argument for lower sums is symmetric (with mk′≥mkm_k'\ge m_k, mk′′≥mkm_k''\ge m_k), giving L(f,P′)≥L(f,P)L(f,P')\ge L(f,P). Finally L(f,P′)≤U(f,P′)L(f,P')\le U(f,P') holds by the previous lemma applied with any tagging of P′P' (or directly, since mi≤Mim_i\le M_i termwise). This proves the chain. For the last claim, let P1,P2P_1,P_2 be arbitrary and let P=P1∪P2P=P_1\cup P_2, a common refinement of both. Then

L(f,P1)≤L(f,P)≤U(f,P)≤U(f,P2),L(f,P_1)\le L(f,P) \le U(f,P) \le U(f,P_2),

using the refinement inequality twice and L(f,P)≤U(f,P)L(f,P)\le U(f,P) once. Taking sup over P1P_1 and inf over P2P_2 gives ∫ab‾f≤∫ab‾f\underline{\int_a^b}f \le \overline{\int_a^b}f. Both quantities are finite since ff bounded on [a,b][a,b], say m≤f≤Mm\le f\le M, forces m(b−a)≤L(f,P)≤U(f,P)≤M(b−a)m(b-a)\le L(f,P)\le U(f,P)\le M(b-a) for every PP. ■\blacksquare

∎

We also record, without reproving it here, the standard reformulation of Darboux integrability that we import from the Cauchy Integrability Criterion:

LemmaCauchy Criterion for Darboux integrability

A bounded f:[a,b]→Rf:[a,b]\to\mathbb{R} is Darboux integrable if and only if for every ε>0\varepsilon>0 there exists a partition PP of [a,b][a,b] with

U(f,P)−L(f,P)<ε.U(f,P)-L(f,P) < \varepsilon.

Now we prove the main theorem, in two directions.

Proof

Direction 1: Darboux integrable ⇒\Rightarrow Riemann integrable, with the same value. Suppose ff is Darboux integrable with value I=∫ab‾f=∫ab‾fI=\overline{\int_a^b}f=\underline{\int_a^b}f. Let ff be bounded by a constant B>0B>0, i.e. ∣f(x)∣≤B|f(x)|\le B for all x∈[a,b]x\in[a,b]; this is possible since ff is bounded. Fix ε>0\varepsilon>0. Step 1 (choose a good partition). By the Cauchy Criterion for Darboux integrability, choose a partition

P0={a=y0<y1<⋯<ym=b}P_0=\{a=y_0<y_1<\cdots<y_m=b\}

such that

U(f,P0)−L(f,P0)<ε2.U(f,P_0)-L(f,P_0) < \frac{\varepsilon}{2}.

Since L(f,P0)≤I≤U(f,P0)L(f,P_0)\le I \le U(f,P_0) (as II is the sup of lower sums and inf of upper sums, and L(f,P0)≤∫ab‾f=I=∫ab‾f≤U(f,P0)L(f,P_0)\le \underline{\int_a^b}f = I = \overline{\int_a^b}f \le U(f,P_0)), it follows that both L(f,P0)L(f,P_0) and U(f,P0)U(f,P_0) lie within ε/2\varepsilon/2 of II:

∣U(f,P0)−I∣≤U(f,P0)−L(f,P0)<ε2,∣L(f,P0)−I∣<ε2.|U(f,P_0)-I| \le U(f,P_0)-L(f,P_0) < \frac{\varepsilon}{2}, \qquad |L(f,P_0)-I| < \frac{\varepsilon}{2}.

Step 2 (define δ\delta). Let P0P_0 have m−1m-1 interior points y1,…,ym−1y_1,\dots,y_{m-1}. Set

δ=ε8Bm.\delta = \frac{\varepsilon}{8Bm}.

(The precise constant is unimportant; what matters is that δ\delta shrinks to 00 as ε→0\varepsilon\to0 and controls the total length of "boundary-straddling" subintervals.) Step 3 (any fine tagged partition is close to II). Let (P,t)(P,\mathbf t) be any tagged partition of [a,b][a,b], P={a=x0<⋯<xn=b}P=\{a=x_0<\dots<x_n=b\}, with ∥P∥<δ\|P\|<\delta. We compare S(f,P,t)S(f,P,\mathbf t) to U(f,P0)U(f,P_0) and to L(f,P0)L(f,P_0). Split the index set {1,…,n}\{1,\dots,n\} into two classes:

  • Class A: those ii for which [xi−1,xi][x_{i-1},x_i] lies entirely within a single subinterval [yj−1,yj][y_{j-1},y_j] of P0P_0 (i.e. does not straddle any interior point yjy_j).
  • Class B: those ii for which [xi−1,xi][x_{i-1},x_i] contains at least one interior point yjy_j of P0P_0 in its interior, or has yjy_j as an endpoint shared with the adjacent subinterval structure in a way that splits it across two pieces of P0P_0.

Since P0P_0 has m−1m-1 interior points, and each interior point yjy_j can be interior to at most one subinterval [xi−1,xi][x_{i-1},x_i] of PP (subintervals of PP have disjoint interiors), there are at most m−1m-1 indices ii in Class B. Each such subinterval has length <δ< \delta (as ∥P∥<δ\|P\|<\delta), so the total length of Class B subintervals is

∑i∈B(xi−xi−1)<(m−1)δ≤mδ=ε8B.\sum_{i \in B} (x_i - x_{i-1}) < (m-1)\delta \le m\delta = \frac{\varepsilon}{8B}.

Now consider the sum of upper contributions. Define M~i=sup⁡[xi−1,xi]f\widetilde{M}_i = \sup_{[x_{i-1},x_i]} f for each ii; this is the local sup on the fine partition's pieces. We compare ∑iM~i(xi−xi−1)\sum_i \widetilde M_i (x_i-x_{i-1}), which is just U(f,P)U(f,P), to U(f,P0)U(f,P_0). For i∈Ai\in A: [xi−1,xi]⊆[yj−1,yj][x_{i-1},x_i]\subseteq [y_{j-1},y_j] for the unique jj containing it, so M~i≤Mj(0):=sup⁡[yj−1,yj]f\widetilde M_i \le M_j^{(0)} := \sup_{[y_{j-1},y_j]} f. For i∈Bi \in B: crudely bound M~i≤B\widetilde M_i \le B (since ∣f∣≤B|f|\le B everywhere). We now show U(f,P)≤U(f,P0)+ε/4U(f,P) \le U(f,P_0) + \varepsilon/4. Group Class A terms by which P0P_0-subinterval [yj−1,yj][y_{j-1},y_j] they lie in: for fixed jj, the Class-A subintervals of PP lying inside [yj−1,yj][y_{j-1},y_j] have total length at most yj−yj−1y_j-y_{j-1}, so

∑i∈A, [xi−1,xi]⊆[yj−1,yj]M~i(xi−xi−1)≤Mj(0)(yj−yj−1).\sum_{i\in A,\, [x_{i-1},x_i]\subseteq[y_{j-1},y_j]} \widetilde M_i(x_i - x_{i-1}) \le M_j^{(0)}(y_j-y_{j-1}).

Summing over jj: ∑i∈AM~i(xi−xi−1)≤U(f,P0)\sum_{i\in A} \widetilde M_i(x_i-x_{i-1}) \le U(f,P_0). For Class B: ∑i∈BM~i(xi−xi−1)≤B∑i∈B(xi−xi−1)<B⋅ε8B=ε8\sum_{i\in B}\widetilde M_i (x_i-x_{i-1}) \le B\sum_{i\in B}(x_i-x_{i-1}) < B\cdot \frac{\varepsilon}{8B} = \frac{\varepsilon}{8}. Adding,

U(f,P)=∑i∈AM~i(xi−xi−1)+∑i∈BM~i(xi−xi−1)<U(f,P0)+ε8.U(f,P) = \sum_{i\in A}\widetilde M_i(x_i-x_{i-1}) + \sum_{i\in B}\widetilde M_i(x_i-x_{i-1}) < U(f,P_0) + \frac{\varepsilon}{8}.

By the symmetric argument (using m~i≥mj(0)\widetilde m_i \ge m_j^{(0)} on Class A after the analogous grouping fails — instead bound m~i≥−B\widetilde m_i \ge -B on Class B), one gets

L(f,P)>L(f,P0)−ε8.L(f,P) > L(f,P_0) - \frac{\varepsilon}{8}.

(Full detail: for i∈Ai\in A, m~i≥mj(0)\widetilde m_i \ge m_j^{(0)} where [xi−1,xi]⊆[yj−1,yj][x_{i-1},x_i]\subseteq[y_{j-1},y_j], so ∑i∈Am~i(xi−xi−1)≥∑jmj(0)((total Class-A length in [yj−1,yj]))\sum_{i\in A}\widetilde m_i(x_i-x_{i-1}) \ge \sum_j m_j^{(0)}\big(\text{(total Class-A length in }[y_{j-1},y_j]\text{)}\big). This differs from L(f,P0)=∑jmj(0)(yj−yj−1)L(f,P_0)=\sum_j m_j^{(0)}(y_j-y_{j-1}) by exactly the missing Class-B length inside each [yj−1,yj][y_{j-1},y_j], contributing an error of at most BB times the total Class-B length <ε/8< \varepsilon/8. Combined with the Class-B lower bound ≥−B∑i∈B(xi−xi−1)>−ε/8\ge -B\sum_{i\in B}(x_i-x_{i-1}) > -\varepsilon/8, we get L(f,P)>L(f,P0)−ε/4L(f,P) > L(f,P_0) - \varepsilon/4; we absorb constants so that in all cases the bound ε/4\varepsilon/4 suffices.) Combining these two displayed estimates with Step 1's bounds:

L(f,P)>L(f,P0)−ε4>(I−ε2)−ε4=I−3ε4,L(f,P) > L(f,P_0) - \frac\varepsilon4 > \left(I - \frac\varepsilon2\right) - \frac\varepsilon4 = I - \frac{3\varepsilon}{4},
U(f,P)<U(f,P0)+ε4<(I+ε2)+ε4=I+3ε4.U(f,P) < U(f,P_0) + \frac\varepsilon4 < \left(I+\frac\varepsilon2\right)+\frac\varepsilon4 = I + \frac{3\varepsilon}{4}.

By the Sandwich Lemma proved above, L(f,P)≤S(f,P,t)≤U(f,P)L(f,P)\le S(f,P,\mathbf t)\le U(f,P) for every tagging t\mathbf t of PP. Hence

I−3ε4<S(f,P,t)<I+3ε4,I - \frac{3\varepsilon}{4} < S(f,P,\mathbf t) < I + \frac{3\varepsilon}{4},

so ∣S(f,P,t)−I∣<ε|S(f,P,\mathbf t) - I| < \varepsilon (using 3/4<13/4 <1), for every tagged partition (P,t)(P,\mathbf t) with ∥P∥<δ\|P\|<\delta, regardless of the tags chosen. Since ε>0\varepsilon>0 was arbitrary and δ\delta was chosen depending only on ε\varepsilon (and on f,P0,m,Bf,P_0,m,B, all fixed given ε\varepsilon), this is precisely the definition of Riemann integrability of ff with Riemann integral II.

Direction 2: Riemann integrable ⇒\Rightarrow Darboux integrable, with the same value. Suppose ff is Riemann integrable with Riemann integral II. Fix ε>0\varepsilon>0. By definition, there is δ>0\delta>0 such that every tagged partition (P,t)(P,\mathbf t) with ∥P∥<δ\|P\|<\delta satisfies

∣S(f,P,t)−I∣<ε4.|S(f,P,\mathbf t)-I| < \frac\varepsilon4.

Fix any untagged partition P={x0<⋯<xn}P=\{x_0<\dots<x_n\} with ∥P∥<δ\|P\|<\delta (such PP exists, e.g. a uniform partition with nn large enough that (b−a)/n<δ(b-a)/n<\delta). Claim: U(f,P)≤I+εU(f,P) \le I + \varepsilon and L(f,P)≥I−εL(f,P) \ge I - \varepsilon. To see the first inequality, recall Mi=sup⁡[xi−1,xi]fM_i = \sup_{[x_{i-1},x_i]} f. By definition of supremum, for each ii choose a tag ti∈[xi−1,xi]t_i \in [x_{i-1},x_i] with

f(ti)>Mi−ε2(b−a).f(t_i) > M_i - \frac{\varepsilon}{2(b-a)}.

(This is possible since MiM_i is the least upper bound, so Mi−ε/(2(b−a))M_i - \varepsilon/(2(b-a)) is not an upper bound.) This choice of tags gives a tagged partition (P,t)(P,\mathbf t) with ∥P∥<δ\|P\|<\delta, so

S(f,P,t)=∑i=1nf(ti)(xi−xi−1)>∑i=1n(Mi−ε2(b−a))(xi−xi−1)=U(f,P)−ε2,S(f,P,\mathbf t) = \sum_{i=1}^n f(t_i)(x_i-x_{i-1}) > \sum_{i=1}^n \left(M_i - \frac{\varepsilon}{2(b-a)}\right)(x_i-x_{i-1}) = U(f,P) - \frac\varepsilon2,

since ∑i(xi−xi−1)=b−a\sum_i (x_i-x_{i-1}) = b-a. Hence

U(f,P)<S(f,P,t)+ε2<(I+ε4)+ε2<I+ε.U(f,P) < S(f,P,\mathbf t) + \frac\varepsilon2 < \left(I+\frac\varepsilon4\right)+\frac\varepsilon2 < I+\varepsilon.

Symmetrically, choosing tags tit_i with f(ti)<mi+ε/(2(b−a))f(t_i) < m_i + \varepsilon/(2(b-a)) (possible since mim_i is the greatest lower bound) gives a tagged partition with

S(f,P,t)<L(f,P)+ε2,S(f,P,\mathbf t) < L(f,P) + \frac\varepsilon2,

so

L(f,P)>S(f,P,t)−ε2>(I−ε4)−ε2>I−ε.L(f,P) > S(f,P,\mathbf t) - \frac\varepsilon2 > \left(I - \frac\varepsilon4\right) - \frac\varepsilon2 > I - \varepsilon.

This proves the claim. Consequently

U(f,P)−L(f,P)<(I+ε)−(I−ε)=2ε.U(f,P) - L(f,P) < (I+\varepsilon) - (I-\varepsilon) = 2\varepsilon.

Since ε>0\varepsilon>0 was arbitrary and this produces, for each ε\varepsilon, a partition PP with U(f,P)−L(f,P)<2εU(f,P)-L(f,P)<2\varepsilon, the Cauchy Criterion for Darboux integrability shows ff is Darboux integrable. Finally, since U(f,P)<I+εU(f,P) < I+\varepsilon for this PP, we get ∫ab‾f≤U(f,P)<I+ε\overline{\int_a^b} f \le U(f,P) < I+\varepsilon, and since L(f,P)>I−εL(f,P) > I - \varepsilon, we get ∫ab‾f≥L(f,P)>I−ε\underline{\int_a^b} f \ge L(f,P) > I-\varepsilon. As ∫ab‾f=∫ab‾f\overline{\int_a^b}f = \underline{\int_a^b}f (Darboux integrability just established) and this holds for every ε>0\varepsilon>0, letting ε→0\varepsilon\to0 forces

∫ab‾f=∫ab‾f=I.\overline{\int_a^b}f = \underline{\int_a^b}f = I.

Thus the Darboux integral equals II, the Riemann integral. This completes both directions, and the theorem is proved. ■\blacksquare

∎

Worked examples

Example 1: f(x)=x2f(x) = x^2 on [0,3][0,3], using a non-uniform partition. We verify Darboux integrability directly and see the equivalence theorem in action, using an asymmetric partition rather than the usual uniform one. Take PnP_n to be the partition of [0,3][0,3] into nn subintervals defined by xi=3(i/n)x_i = 3(i/n) for i=0,…,ni=0,\dots,n (uniform in this case for computability, but we will illustrate the non-uniform straddling argument numerically). Since f(x)=x2f(x)=x^2 is increasing on [0,3][0,3],

Mi=xi2=(3in)2,mi=xi−12=(3(i−1)n)2.M_i = x_i^2 = \left(\frac{3i}{n}\right)^2, \qquad m_i = x_{i-1}^2=\left(\frac{3(i-1)}{n}\right)^2.

Then

U(f,Pn)=∑i=1n(3in)2⋅3n=27n3∑i=1ni2=27n3⋅n(n+1)(2n+1)6.U(f,P_n) = \sum_{i=1}^n \left(\frac{3i}{n}\right)^2 \cdot \frac{3}{n} = \frac{27}{n^3}\sum_{i=1}^n i^2 = \frac{27}{n^3}\cdot\frac{n(n+1)(2n+1)}{6}.

As n→∞n\to\infty, this tends to 276⋅2=9\frac{27}{6}\cdot 2 = 9. Similarly L(f,Pn)→9L(f,P_n) \to 9. Since U(f,Pn)−L(f,Pn)=27n3(∑i2−∑(i−1)2)=27n3⋅n2=27n→0U(f,P_n)-L(f,P_n) = \frac{27}{n^3}\left(\sum i^2 - \sum (i-1)^2\right) = \frac{27}{n^3}\cdot n^2 = \frac{27}{n} \to 0, the Cauchy criterion is satisfied for nn large, confirming ff is Darboux integrable with ∫03x2 dx=9\int_0^3 x^2\,dx = 9. Now invoke the equivalence theorem (Direction 1): because ff is Darboux integrable with value 99, every Riemann sum with mesh below an appropriate δ(ε)\delta(\varepsilon) is within ε\varepsilon of 99 — including wildly asymmetric tag choices. For concreteness, take n=4n=4, so P4={0,3/4,3/2,9/4,3}P_4 = \{0, 3/4, 3/2, 9/4, 3\}, and choose the tags not at midpoints or endpoints but at, say, t1=0.1t_1=0.1, t2=1.4t_2=1.4, t3=1.6t_3=1.6, t4=2.9t_4=2.9 (each inside its respective subinterval [0,0.75],[0.75,1.5],[1.5,2.25],[2.25,3][0,0.75],[0.75,1.5],[1.5,2.25],[2.25,3]). Then

S(f,P4,t)=(0.1)2(0.75)+(1.4)2(0.75)+(1.6)2(0.75)+(2.9)2(0.75).S(f,P_4,\mathbf t) = (0.1)^2(0.75)+(1.4)^2(0.75)+(1.6)^2(0.75)+(2.9)^2(0.75).

Computing: 0.01⋅0.75=0.00750.01\cdot0.75 = 0.0075; 1.96⋅0.75=1.471.96\cdot0.75=1.47; 2.56⋅0.75=1.922.56\cdot0.75=1.92; 8.41⋅0.75=6.30758.41\cdot0.75=6.3075. Sum: 0.0075+1.47+1.92+6.3075=9.7050.0075+1.47+1.92+6.3075 = 9.705. Compare to U(f,P4)=(0.75)2⋅0.75+(1.5)2⋅0.75+(2.25)2⋅0.75+32⋅0.75=0.421875+1.6875+3.796875+6.75=12.65625U(f,P_4) = (0.75)^2\cdot0.75+(1.5)^2\cdot0.75+(2.25)^2\cdot0.75+3^2\cdot0.75 = 0.421875+1.6875+3.796875+6.75=12.65625 and L(f,P4)=0+(0.75)2(0.75)+(1.5)2(0.75)+(2.25)2(0.75)=0.421875+1.6875+3.796875=5.90625L(f,P_4)=0+ (0.75)^2(0.75)+(1.5)^2(0.75)+(2.25)^2(0.75) = 0.421875+1.6875+3.796875 = 5.90625. Indeed 5.906≤9.705≤12.6565.906 \le 9.705 \le 12.656, consistent with the Sandwich Lemma, and as nn grows this asymmetric-tag sum will be forced toward 99 regardless of how erratically the tags are chosen — that is the content of Direction 1.

Example 2: A function integrable "by inspection" of Darboux sums where a naive Riemann-sum limit is not obviously well-defined a priori. Let f:[0,1]→Rf:[0,1]\to\mathbb{R} be defined by

f(x)={1x=1/n for some n∈N0otherwise.f(x) = \begin{cases} 1 & x = 1/n \text{ for some } n\in\mathbb{N} \\ 0 & \text{otherwise.} \end{cases}

This function is discontinuous at infinitely many points {1,1/2,1/3,… }\{1, 1/2, 1/3, \dots\} accumulating at 00, so it is not at all obvious from the Riemann-sum definition alone that a single limiting value II exists — one must worry that tags landing exactly on some 1/n1/n could perturb sums unpredictably. The Darboux approach settles this cleanly. For any partition P={0=x0<⋯<xn=1}P=\{0=x_0<\dots<x_n=1\}, every subinterval [xi−1,xi][x_{i-1},x_i] with xi−1>0x_{i-1}>0 contains only finitely many points of the form 1/k1/k (since these accumulate only at 00), but may contain one; and f≥0f\ge 0 everywhere with f=0f=0 off a countable set, so mi=0m_i = 0 for every ii (since every subinterval, having positive length, contains irrational points, or more simply points not of the form 1/n1/n, where f=0f=0; and it also may contain a point where f=1f=1, but inf⁡\inf over the interval is still 00 since 00 values are present and f≥0f\ge0). Hence L(f,P)=0L(f,P)=0 for every PP, so ∫‾01f=0\underline\int_0^1 f = 0. For the upper sum: given ε>0\varepsilon>0, choose NN so large that 1/N<ε/21/N < \varepsilon/2. There are exactly NN points of the form 1/n1/n with 1/n≥ε/21/n \ge \varepsilon/2 lying in [ε/2,1][\varepsilon/2, 1] (namely n=1,…,⌊2/ε⌋n=1,\dots, \lfloor 2/\varepsilon\rfloor, a finite set), plus infinitely many accumulating in (0,ε/2)(0,\varepsilon/2). Build a partition PP as follows: put one small subinterval of length η\eta around each of the finitely many points 1/n≥ε/21/n \ge \varepsilon/2 where η\eta is chosen small enough that the total length of these "spike" intervals is <ε/2< \varepsilon/2, and let [0,ε/2)[0,\varepsilon/2) be covered by a single subinterval [0,ε/2][0,\varepsilon/2] (on which Mi≤1M_i \le 1 trivially, contributing at most ε/2\varepsilon/2 to U(f,P)U(f,P)), with the remaining subintervals covering the rest of [ε/2,1][\varepsilon/2,1] avoiding all spike points, on which Mi=0M_i=0. Then

U(f,P)≤1⋅ε2  (from [0,ε/2])  +  1⋅ε2  (total spike length)  +  0=ε.U(f,P) \le 1\cdot\frac\varepsilon2 \;(\text{from } [0,\varepsilon/2]) \;+\; 1\cdot\frac\varepsilon2\;(\text{total spike length}) \;+\;0 = \varepsilon.

Since ε>0\varepsilon>0 was arbitrary, ∫‾01f=inf⁡PU(f,P)=0\overline\int_0^1 f = \inf_P U(f,P) = 0. Thus ∫‾01f=∫‾01f=0\overline\int_0^1 f = \underline\int_0^1 f = 0, so ff is Darboux integrable with integral 00. By the equivalence theorem, ff is also Riemann integrable with Riemann integral 00: for any ε>0\varepsilon>0, once the mesh is fine enough (per the δ\delta constructed in Direction 1's proof, built from a Darboux partition like the one above with U(f,P0)−L(f,P0)<ε/2U(f,P_0)-L(f,P_0)<\varepsilon/2), every tagged Riemann sum — even one that deliberately tags every subinterval at a point 1/n1/n where possible — lands within ε\varepsilon of 00. This is a genuinely useful conclusion that would be awkward to establish by wrestling with Riemann sums directly, illustrating why one proves Darboux integrability and imports Riemann integrability via the theorem, rather than the reverse.

CounterexampleWhy boundedness cannot be dropped

The theorem requires ff to be bounded on [a,b][a,b]. Drop this hypothesis and both the argument and the conclusion collapse. Let f:[0,1]→Rf:[0,1]\to\mathbb{R} be defined by f(0)=0f(0)=0 and f(x)=1/xf(x) = 1/x for x∈(0,1]x\in(0,1], which is unbounded near 00. Darboux side breaks immediately: for any partition P={0=x0<x1<⋯<xn=1}P=\{0=x_0<x_1<\dots<x_n=1\}, the first subinterval [0,x1][0,x_1] has

M1=sup⁡[0,x1]f=sup⁡x∈(0,x1]1x=+∞,M_1 = \sup_{[0,x_1]} f = \sup_{x\in(0,x_1]} \frac1x = +\infty,

since f(x)→∞f(x)\to\infty as x→0+x\to0^+. So U(f,P)=+∞U(f,P) = +\infty for every partition PP, and ∫01‾f=inf⁡PU(f,P)=+∞\overline{\int_0^1} f = \inf_P U(f,P) = +\infty is not a real number. The Darboux integral simply does not exist as defined (the definition presupposes finite upper/lower sums, which requires boundedness). Riemann side also breaks, but more subtly: consider tagged partitions with mesh →0\to 0. For a partition with first subinterval [0,x1][0,x_1], choose the tag t1t_1 arbitrarily close to 00 (with x1x_1 fixed, or even as x1→0x_1\to0); then f(t1)=1/t1f(t_1) = 1/t_1 can be made arbitrarily large by choosing t1t_1 near 00, so the Riemann sum S(f,P,t)S(f,P,\mathbf t) has no upper bound over all valid tag choices, for any mesh, however fine. No real number II can satisfy the Riemann integrability condition, since we could never force ∣S(f,P,t)−I∣<ε|S(f,P,\mathbf t) - I|<\varepsilon for all tags — an adversarial tag choice near 00 always escapes any bound. This shows precisely where boundedness is used in the theorem: the proof of Direction 1 used ∣f∣≤B|f|\le B to bound the Class-B error terms, and without a finite BB those error terms cannot be controlled no matter how small δ\delta is. Both notions of integral fail together, consistently with the equivalence theorem, but only because both are simply undefined for unbounded ff — this is not a case where the two definitions diverge, but a reminder that the theorem's hypotheses are load-bearing at the very first step (finiteness of Mi,miM_i,m_i, and of the bound BB).

Scope, edge cases & common traps

SituationWhat happens
ff bounded, finitely many discontinuitiesBoth integrals exist and agree (special case of the theorem, also provable directly)
ff bounded, countably many discontinuities accumulating (Example 2)Both integrals exist and agree; Darboux route is far easier to verify
ff unbounded on [a,b][a,b]Neither Riemann nor Darboux integral is defined; this is improper integral territory, outside this theorem
f=1Qf = \mathbf{1}_{\mathbb{Q}} (Dirichlet function) on [0,1][0,1]U(f,P)=1U(f,P)=1, L(f,P)=0L(f,P)=0 for every PP; neither integral exists — consistent, not a counterexample
Tags chosen only at right endpoints (a common simplification)Gives a valid Riemann sum but does not by itself establish Riemann integrability, which requires all tag choices to work

The mathematician behind it

Origins · 1 minBernhard Riemann and how this was discovered
BR
Bernhard Riemann
1826–1866 · Göttingen, mid-19th century analysis

Riemann introduced his integral in his 1854 habilitation thesis on trigonometric series, seeking the most general class of functions representable by Fourier series. He needed a rigorous notion of integrability that did not presuppose continuity, since Fourier series can converge to badly discontinuous functions. His definition, in terms of sums over arbitrary tagged partitions, was the first fully rigorous treatment of integration for a general class of bounded functions, decades before measure theory existed.

Gaston Darboux, working roughly two decades later, recast Riemann's integral using upper and lower sums built from suprema and infima rather than sampled function values. His formulation, appearing in an 1875 memoir, made proofs of the basic properties of the integral—linearity, monotonicity, the fact that continuous functions are integrable—dramatically more transparent, and it is Darboux's version, not Riemann's original tagged-sum definition, that dominates most modern analysis textbooks under the name "the Riemann integral."

Origins · 1 minhow this was discovered
History
- 1854 — Riemann's habilitation thesis defines the tagged-partition sum criterion for integrability, motivated by Fourier series.
- 1868 — Riemann's thesis is published posthumously, two years after his death, making the definition widely accessible.
- 1875 — Darboux introduces upper and lower sums and proves they characterize the same class of functions, streamlining the theory.
- 1881 — Darboux's full treatise on discontinuous functions cements the upper/lower sum approach as the standard technical tool.
- 1902 — Lebesgue's thesis extends integration beyond bounded functions and gives a measure-theoretic characterization of Riemann integrability itself.
Do the Riemann and Darboux definitions ever give different answers for the same function?

No. The theorem proved here shows they are logically equivalent: a bounded function is integrable under one definition if and only if it is integrable under the other, and when both apply, they produce the same numerical value for the integral. There is no bounded function that is Riemann integrable but not Darboux integrable, or vice versa. The two formalisms are different routes to literally the same mathematical object — this is why textbooks freely call the common result "the Riemann integral" while using Darboux's upper/lower sum machinery to prove its properties.

Why bother with two definitions if they're equivalent?

Each definition is suited to different tasks. The Darboux definition is far easier to use when proving general theorems (linearity, additivity, integrability of continuous or monotonic functions), because it reduces to comparing suprema and infima rather than controlling a limit over all possible tag choices. The Riemann definition, meanwhile, is the one that matches physical and computational intuition — sampling a function at points and summing — and it is the definition that generalizes to stochastic integrals, where tag choice genuinely matters. Knowing they coincide lets you prove theorems the easy (Darboux) way and then legitimately apply them in the Riemann-sum language used in applications.

Does the equivalence theorem require ff to be continuous?

No. The theorem applies to any bounded function on [a,b][a,b], continuous or not. Continuity is not assumed; it is a sufficient (not necessary) condition for integrability, proved as a separate, later result using the Darboux criterion (uniform continuity controls the oscillation Mi−miM_i - m_i on fine partitions). The equivalence theorem itself is prior to and independent of any discussion of which functions are integrable — it simply says that whichever bounded functions turn out to be integrable, both definitions select the same class and assign the same value.

What role does the Cauchy Integrability Criterion play in this proof?

It supplies the key reformulation of Darboux integrability used in Direction 1: instead of working directly with sup⁡PL(f,P)=inf⁡PU(f,P)\sup_P L(f,P) = \inf_P U(f,P), we use the equivalent statement that for every ε>0\varepsilon>0 there is a single partition P0P_0 with U(f,P0)−L(f,P0)<εU(f,P_0)-L(f,P_0)<\varepsilon. This finite, concrete partition is exactly what lets us bound arbitrary fine tagged partitions by comparing them to P0P_0 via the "Class A / Class B" splitting argument. Without this criterion, one would have to work directly with suprema and infima over the (uncountable) set of all partitions, which is far more awkward.

Is one direction of the proof really harder than the other, or is that just a rhetorical framing?

It is genuinely harder, not just rhetorically so. Riemann-implies-Darboux only needs to exhibit particular tag choices (via the definition of sup/inf) that approximate U(f,P)U(f,P) and L(f,P)L(f,P) arbitrarily well — a constructive, one-partition argument. Darboux-implies-Riemann must show a uniform statement: for a fixed small mesh, every tag choice on every sufficiently fine partition is trapped near the limit. This requires the delicate bookkeeping of how many subintervals of a fine partition can straddle the finitely many breakpoints of a coarser, "good" Darboux partition — the Class A/Class B argument — which has no analogue in the other direction.

Does this theorem extend to unbounded intervals or unbounded functions?

Not directly. Both definitions as stated require ff bounded on a bounded interval [a,b][a,b]; the counterexample above shows the Darboux upper sum becomes +∞+\infty immediately if ff is unbounded, and the Riemann sum definition also fails since tag values can be forced arbitrarily large. Extensions to unbounded functions or infinite intervals are handled by improper Riemann integrals, defined as limits of proper integrals over [a,b−η][a, b-\eta] or [a,R][a,R] as η→0\eta\to 0 or R→∞R\to\infty, which is a separate construction layered on top of, not covered by, this equivalence theorem.

Before this

Where this leads