integration theory
The Riemann–Stieltjes Integral
You should know: riemann integral
Overview
The Riemann–Stieltjes integral generalizes the Riemann integral by replacing the increment (xᵢ₊₁ - xᵢ) of the integration variable with the increment (α(xᵢ₊₁) - α(xᵢ)) of a second function, the integrator α. Written ∫ₐᵇ f dα, it reduces to the ordinary Riemann integral when α(x)=x, but allows integrating against functions with jumps, kinks, or other non-smooth behavior — in particular, when α is a step function, the Riemann–Stieltjes integral collapses to a weighted sum evaluated exactly at the jump points, unifying discrete sums and continuous integrals into a single framework. Developed by Thomas Joannes Stieltjes in 1894 while studying continued fractions, it became foundational for probability theory (integrating against a cumulative distribution function handles discrete, continuous, and mixed random variables uniformly) and for the later, more general Lebesgue–Stieltjes integral.
Intuition
In the ordinary Riemann integral, each rectangle's width is the plain length of a sub-interval, (xᵢ₊₁-xᵢ), treating every point of the x-axis as contributing equally. In the Riemann–Stieltjes integral, the 'width' of each rectangle is instead reweighted by how much the integrator α changes across that sub-interval, α(xᵢ₊₁)-α(xᵢ). If α increases steeply somewhere, that region of the x-axis is given outsized importance; if α is locally constant, that region contributes nothing at all, no matter how wide it is. When α has a sudden jump at some point c, all of the 'weight' near c concentrates onto that single point, and the integral simply picks out f(c) times the jump size — turning the integral, in the limit, into exactly the kind of discrete term you'd expect from a sum, not an area.
Formal Definition
Let f be bounded and α be monotonically increasing (or, more generally, of bounded variation) on [a,b]. For a tagged partition a=x₀<x₁<⋯<xₙ=b with tags tᵢ∈[xᵢ,xᵢ₊₁], the Riemann–Stieltjes sum is:
f is RS-integrable with respect to α, with integral s, if sufficiently fine partitions force every tagged sum within ε of s regardless of tag choice
Notation for the Riemann–Stieltjes integral of f with respect to α
When the integrator is the identity function, the RS integral is exactly the classical Riemann integral
Notation
| Notation | Meaning |
|---|---|
| The Riemann–Stieltjes integral of f with respect to the integrator α over [a,b] | |
| The integrator function; typically taken monotonically increasing, or more generally of bounded variation | |
| The increment of the integrator across the i-th sub-interval, replacing the plain width Δxᵢ used in the Riemann integral |
Derivation
Sketch of why, when α is a pure step function with a single jump of size c at x₀, the Riemann–Stieltjes integral of a continuous f reduces exactly to f(x₀)·c.
A single-jump step function integrator
α is constant away from x₀, so those terms of the Riemann–Stieltjes sum vanish entirely
Only the sub-interval that straddles the jump contributes a nonzero increment, equal to the full jump size c
As the partition is refined, the straddling sub-interval shrinks around x₀, and continuity of f forces f(t_i)\to f(x_0)
Properties
Reduces to Riemann integral
Linearity in f
Linearity in α
Integration by parts (Stieltjes)
Condition: Holds whenever one of the two integrals exists; a hallmark identity with no direct analogue for the plain Riemann integral.
Existence criterion
Condition: More generally, existence holds whenever f and α have no common points of discontinuity.
Jump reduction
Condition: This is the mechanism that lets Riemann–Stieltjes integration reproduce discrete sums exactly.
Applications
Worked Examples
Since f(x)=x² is continuous and α is a step function with isolated jumps of size 1 at x=1 and x=2, each jump contributes f(jump point) times jump size.
Evaluate f at each jump point: f(1)=1²=1, f(2)=2²=4.
Sum the contributions.
Answer: 5
Practice Problems
Let α(x) jump by 3 at x=2 only (and is otherwise constant) on [0,4]. Compute ∫₀⁴ (x+1) dα(x) for f(x)=x+1.
If α(x) = x for all x, then ∫ₐᵇ f dα equals:
A discrete random variable X takes value 2 with probability 0.3 and value 5 with probability 0.7. Using F (the CDF, a step function with jumps 0.3 at x=2 and 0.7 at x=5) and the Riemann-Stieltjes jump-reduction property, compute E[X] as the sum of x times each jump in F.
Common Mistakes
Assuming the Riemann–Stieltjes integral always requires α to be differentiable, so that dα = α'(x)dx converts it back to an ordinary integral.
The entire point of the RS integral is to handle integrators that are NOT differentiable — e.g. step functions with jumps. When α is differentiable with continuous α', it's true that ∫f dα = ∫f(x)α'(x)dx, but the RS integral is defined and useful far beyond that special case.
Believing ∫f dα only depends on f, ignoring that swapping the integrator α changes the answer entirely.
The integrator α determines how much 'weight' each region of [a,b] receives; the same f integrated against two different integrators (e.g. α(x)=x versus a step function) generally gives completely different results.
Thinking that if f and α are both discontinuous at some shared point, the integral can still be salvaged by choosing convenient tag points.
If f and α share a discontinuity point, the Riemann–Stieltjes sums can be made to converge to different values depending on tag choice near that point, so the integral genuinely fails to exist — no choice of tags fixes this.
Quiz
Flashcards
Summary
- The Riemann–Stieltjes integral ∫f dα generalizes the Riemann integral by replacing the sub-interval width (xᵢ₊₁-xᵢ) with the integrator's increment α(xᵢ₊₁)-α(xᵢ).
- When α(x)=x, it reduces exactly to the ordinary Riemann integral.
- When α is a step function, isolated jumps of size c at x₀ contribute f(x₀)·c to the integral — turning integrals into sums, and unifying discrete and continuous settings.
- Existence is guaranteed when f is continuous and α is of bounded variation (or more generally, f and α share no common discontinuity).
- The framework underlies E[g(X)] = ∫g dF in probability, letting one formula handle discrete, continuous, and mixed random variables via their CDF F.
References
- BookRudin, W. Principles of Mathematical Analysis, 3rd ed. Ch. 6.
Mathematics