Alphabeta Math
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

✓ 29 results · all verified · 0 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 29 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Bounded Variation and the Riemann–Stieltjes Integral

1 · Prerequisites

2 · Summary

The declared prerequisites supply partitions, Darboux and tagged Riemann sums, algebra and order estimates for proper integrals, the working fundamental theorem, integration by parts, substitution, and the integral test. They also supply monotone functions and their one-sided limits, compactness and uniform continuity, rational powers, and complete-real convergence. This machinery passes from finite variation sums to suprema, decomposes BV functions into monotone parts, and compares Stieltjes sums without importing measure theory.

Total variation, its canonical positive and negative parts, and absolute continuity lead to the Jordan decomposition and the C1–Lipschitz–AC–BV hierarchy. Riemann–Stieltjes integration then develops through a jump-compatible Darboux criterion, refinement estimates, algebra, integration by parts, and successively broader existence theorems using regulated approximation and the no-common-jump condition. Ordinary integration, differentiable integrators, and monotone reparametrization arise as reductions. A point-removal partition estimate finally yields Young integration for rational Hölder exponents whose sum exceeds one.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicableaudited 2026-08-11Open item page →

Bounded variation and total variation on an interval

Definition

Let a≤b and let f:[a,b]→R (Intervals of R: the nine order-convex forms, nondegeneracy, and length). If a<b and P=(n,t) is a partition of [a,b] (Partition of [a,b] as a finite strictly increasing list a=t0<t1<⋯<tn=b, its subintervals and their lengths, its mesh, refinement, and the common refinement of two partitions), the variation of f over P is

V(f,P):=∑i<n∣f(ti+1)−f(ti)∣.

The sum is finite (Finite sums and finite products, by recursion, Laws of finite sums and finite products) and nonnegative (Absolute value in an ordered field). The set of all such sums is nonempty, since [a,b] has the partition with point set {a,b}. The function f has bounded variation on [a,b] when this set of sums is bounded above (Lower bound, bounded below, bounded set). In that case its total variation is

Var⁡[a,b](f):=sup⁡PV(f,P).

Completeness of R gives this supremum and Suprema and infima are unique makes it unique (Complete ordered field (least-upper-bound property)). On a singleton interval, by convention, Var⁡[a,a](f):=0; no partition from Partition of [a,b] as a finite strictly increasing list a=t0<t1<⋯<tn=b, its subintervals and their lengths, its mesh, refinement, and the common refinement of two partitions, whose standing hypothesis is a<b, is invoked.

LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-11Open item page →

Total variation bounds increments; bounded-variation functions are bounded; zero variation means constant

Statement

Let f:[a,b]→R have bounded variation. Then

  1. ∣f(y)−f(x)∣≤Var⁡[a,b](f) for all x,y∈[a,b];
  2. f is bounded on [a,b];
  3. Var⁡[a,b](f)=0 if and only if f is constant.

These claims include the singleton interval a=b.

Facts & Assumptions

Given: Reals a≤b and a bounded-variation function f:[a,b]→R.

[L1]

Total variation is the supremum of the partition sums V(f,P), with value 0 on a singleton interval (Bounded variation and total variation on an interval).

[L3]

Finite sums of nonnegative terms dominate every term (Laws of finite sums and finite products).

[L4]

∣u+v∣≤∣u∣+∣v∣ in an ordered field (The triangle inequality).

[L5]

A subset of R is bounded when the absolute values of its members have a common real bound (Lower bound, bounded below, bounded set).

Proof

technique · direct
1.1

If a<b and x<y lie in [a,b], insert x and y into the endpoint partition. The resulting partition sum contains ∣f(y)−f(x)∣ as a nonnegative term, so ∣f(y)−f(x)∣≤V(f,P)≤Var⁡[a,b](f). The same inequality is 0≤Var⁡[a,b](f) when x=y, and when a=b only that case occurs.

L1L2L3
2.1

Put M:=∣f(a)∣+Var⁡[a,b](f). For x∈[a,b], ∣f(x)∣≤∣f(x)−f(a)∣+∣f(a)∣≤M, so f([a,b]) is bounded.

step 1.1L4L5
3.1

If the total variation is 0, step 1.1 gives ∣f(y)−f(x)∣=0 for every x,y, hence f is constant. Conversely, if f is constant then every increment in every partition sum is 0, so every sum and its supremum are 0; the singleton convention gives the same conclusion when a=b.

step 1.1L1L3∎
LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-11Open item page →

Total variation is additive over adjacent subintervals and decreases under restriction

Statement

If a≤c≤b and f:[a,b]→R, then f has bounded variation on [a,b] if and only if its restrictions have bounded variation on [a,c] and [c,b]. In that case

Var⁡[a,b](f)=Var⁡[a,c](f)+Var⁡[c,b](f).

Consequently restriction to any subinterval cannot increase total variation.

Facts & Assumptions

Given: Reals a≤c≤b and a function f:[a,b]→R.

[L1]

Total variation is the supremum of finite variation sums, and singleton variation is 0 (Bounded variation and total variation on an interval).

[L4]

A supremum is the least upper bound of a nonempty set bounded above, and is unique (Complete ordered field (least-upper-bound property), Suprema and infima are unique).

[L5]

Closed subintervals are the sets [u,v]={x:u≤x≤v} (Intervals of R: the nine order-convex forms, nondegeneracy, and length).

Proof

technique · direct
1.1

Given partitions P1 of [a,c] and P2 of [c,b], splice their point lists at c. The resulting partition P of [a,b] satisfies V(f,P)=V(f,P1)+V(f,P2). Thus, whenever f is BV on [a,b], each restriction is BV and Var⁡[a,c](f)+Var⁡[c,b](f)≤Var⁡[a,b](f). The assertion is unchanged when c=a or c=b, because the singleton term is 0.

L1L2L3L5
1.2

Conversely, insert c into an arbitrary partition P of [a,b]. The refined sum splits into a sum on [a,c] and one on [c,b], while inserting a point does not decrease the sum, because the corresponding increment is replaced by two increments whose absolute values dominate it by the triangle inequality. Hence V(f,P)≤Var⁡[a,c](f)+Var⁡[c,b](f).

L1L2L3
2.1

Taking the supremum over P in step 1.2 and combining it with step 1.1 proves the equality and the equivalence of boundedness. Applying the equality twice to [u,v]⊆[a,b] shows Var⁡[u,v](f)≤Var⁡[a,b](f).

step 1.1step 1.2L1L4L5∎
DefinitionDefinition: Literature-sourcedProof: Not applicableaudited 2026-08-11Open item page →

Variation function and positive and negative variations

Definition

Let f:[a,b]→R have bounded variation (Bounded variation and total variation on an interval). Its variation function is

Vf(x):=Var⁡[a,x](f)(x∈[a,b]),

so Vf(a)=0. This is defined on every subinterval by Total variation is additive over adjacent subintervals and decreases under restriction and the singleton convention. The positive variation and negative variation of f are

Pf(x):=Vf(x)+f(x)−f(a)2,Nf(x):=Vf(x)−f(x)+f(a)2.

The names refer to upward and downward accumulated variation; their monotonicity and the resulting decomposition are proved separately.

LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-11Open item page →

The positive and negative variations are nondecreasing and give the Jordan identities

Statement

For a bounded-variation function f:[a,b]→R, the functions Pf and Nf are nondecreasing and

f(x)=f(a)+Pf(x)−Nf(x),Vf(x)=Pf(x)+Nf(x).

Both Pf(a) and Nf(a) are 0.

Facts & Assumptions

Given: A bounded-variation function f:[a,b]→R and its functions Vf,Pf,Nf.

[L1]

Vf,Pf,Nf are defined by the displayed formulas in Variation function and positive and negative variations.

[L2]

For x≤y, Vf(y)−Vf(x)=Var⁡[x,y](f) (Total variation is additive over adjacent subintervals and decreases under restriction).

[L3]

∣f(y)−f(x)∣≤Var⁡[x,y](f) (Total variation bounds increments; bounded-variation functions are bounded; zero variation means constant).

[L5]

∣u∣≥u and ∣u∣≥−u (Absolute value in an ordered field).

Proof

technique · direct
1.1

For x≤y, [L2] and [L3] give Vf(y)−Vf(x)≥∣f(y)−f(x)∣, hence this difference is at least both f(y)−f(x) and f(x)−f(y). Therefore Pf(y)−Pf(x)≥0 and Nf(y)−Nf(x)≥0, so both functions are nondecreasing.

L1L2L3L4L5
1.2

Adding and subtracting the defining formulas gives Pf(x)+Nf(x)=Vf(x) and Pf(x)−Nf(x)=f(x)−f(a). At x=a, Vf(a)=0, so Pf(a)=Nf(a)=0.

L1algebra
2.1

Rearranging the second identity in step 1.2 gives f=f(a)+Pf−Nf, while the first is the asserted variation identity.

step 1.2algebra∎
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-11Open item page →

Jordan decomposition for functions of bounded variation

Statement

A real function f on [a,b] has bounded variation if and only if it is a difference of two nondecreasing functions. If f(a)=0, the canonical normalized decomposition is f=Pf−Nf. More generally f=f(a)+Pf−Nf.

It is minimal: if f=f(a)+g−h with nondecreasing g,h and g(a)=h(a)=0, then Pf(x)≤g(x) and Nf(x)≤h(x) for every x.

Facts & Assumptions

Given: A function f:[a,b]→R.

[L1]

For BV f, Pf,Nf are nondecreasing, normalized at a, and f=f(a)+Pf−Nf (The positive and negative variations are nondecreasing and give the Jordan identities).

[L2]

Total variation is the supremum of sums of absolute increments (Bounded variation and total variation on an interval).

[L5]

Finite sums telescope and distribute over addition (Finite sums and finite products, by recursion, Laws of finite sums and finite products).

[L6]

∣u−v∣≤∣u∣+∣v∣ (The triangle inequality).

Proof

technique · direct
1.1

If f is BV, [L1] immediately supplies the stated difference of nondecreasing functions, with the asserted normalization.

L1
1.2

Conversely suppose f=f(a)+g−h with g,h nondecreasing. For a partition P=(n,t), every forward increment of g and h is nonnegative, so ∣f(ti+1)−f(ti)∣≤(g(ti+1)−g(ti))+(h(ti+1)−h(ti)). Summing and telescoping gives V(f,P)≤g(b)−g(a)+h(b)−h(a), independent of P; hence f is BV.

L2L3L4L5L6
2.1

Now assume the decomposition is normalized. On [a,x], step 1.2 gives Vf(x)≤g(x)+h(x), while f(x)−f(a)=g(x)−h(x). Adding these inequalities and dividing by 2 yields Pf(x)≤g(x); subtracting the increment identity from the variation inequality yields Nf(x)≤h(x).

step 1.2L1L2algebra∎
CorollaryStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-11Open item page →

A bounded-variation function has at most countably many discontinuities, all of the first kind

Statement

If f:[a,b]→R has bounded variation, every well-posed one-sided limit of f exists. Consequently every discontinuity is of the first kind, and the set of discontinuities is at most countable.

Facts & Assumptions

Proof

technique · direct
1.1

Apply [L2] to Pf and Nf. At every endpoint or interior point where a one-sided limit is defined, both component limits exist, and [L4] gives the corresponding one-sided limit of f=f(a)+Pf−Nf. Thus f has no discontinuity of the second kind.

L1L2L4
1.2

If both Pf and Nf are continuous at a point, [L4] makes f continuous there. Hence the discontinuity set of f is contained in the union of the two component discontinuity sets.

L1L4
2.1

Each component discontinuity set is at most countable by [L3]. Given injections of them into N, map the first set to the even naturals and the points belonging only to the second to the odd naturals; this injects their union into N. Step 1.2 therefore makes the discontinuity set of f at most countable, and step 1.1 makes every one of its discontinuities first-kind.

step 1.1step 1.2L3algebra∎
LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-11Open item page →

The jumps of a variation function equal the absolute jumps of the original function

Statement

Let f:[a,b]→R have bounded variation and let Vf(x)=Var⁡[a,x](f). At an interior point c,

Vf(c+)−Vf(c)=∣f(c+)−f(c)∣,Vf(c)−Vf(c−)=∣f(c)−f(c−)∣.

The corresponding one-sided formula holds at either endpoint. In particular, Vf is continuous at every point where f is continuous.

Facts & Assumptions

Given: A bounded-variation function f:[a,b]→R, its variation function Vf, and a point c∈[a,b].

[L1]

Vf(y)−Vf(x)=Var⁡[x,y](f) whenever x≤y (Total variation is additive over adjacent subintervals and decreases under restriction).

[L2]

∣f(y)−f(x)∣≤Var⁡[x,y](f) (Total variation bounds increments; bounded-variation functions are bounded; zero variation means constant).

Proof

technique · direct
1.1

Since Vf is nondecreasing and bounded above by Vf(b), its one-sided limits exist. By [L1] and [L2], Vf(x)−Vf(c)≥∣f(x)−f(c)∣ for x>c; passage to the right limit gives Vf(c+)−Vf(c)≥∣f(c+)−f(c)∣.

L1L2L3L4
1.2

For the reverse inequality, fix x0>c and put xn=c+(x0−c)2−n. Let an=Var⁡[xn+1,xn](f). By repeated additivity, every partial sum of the nonnegative series ∑nan is Var⁡[xN,x0](f) for a suitable N, hence is bounded by Var⁡[c,x0](f). Its tails therefore tend to zero by [L6], while xn↓c by [L7].

L1L6L7
2.1

Given ε>0, take N so large that the series tail from N is below ε and ∣f(y)−f(c+)∣<ε whenever c<y≤xN. For any partition c=t0<t1<⋯<tk=xN, choose m≥N with xm+1<t1≤xm. The part after its first increment is at most [step 1.2, L1, L2, L3, L6] Var⁡[t1,xN](f)≤Var⁡[xm+1,xN](f)=∑n=Nman<ε, while ∣f(t1)−f(c)∣≤∣f(c+)−f(c)∣+ε. Taking the supremum over partitions gives Var⁡[c,xN](f)≤∣f(c+)−f(c)∣+2ε. Restriction gives the same bound for c<x≤xN, and [L2] gives the reverse bound in the limit.

3.1

Thus lim⁡x↓cVar⁡[c,x](f)=∣f(c+)−f(c)∣, and [L1] proves the right-hand formula. Applying steps 1.2–2.1 to the reversed interval proves the left-hand formula. If f is continuous at c, both absolute jumps vanish by [L5], so Vf is continuous there. Endpoint cases use only the available side.

step 1.1step 2.1L1L3L5∎
LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-11Open item page →

Homogeneity and subadditivity of total variation

Statement

For bounded-variation functions f,g:[a,b]→R and c∈R,

Var⁡(cf)=∣c∣Var⁡(f),Var⁡(f+g)≤Var⁡(f)+Var⁡(g).

Thus −f, f+g, and every finite linear combination of BV functions are BV; in particular Var⁡(−f)=Var⁡(f).

Facts & Assumptions

Given: BV functions f,g:[a,b]→R and a scalar c.

[L1]

Total variation is the supremum of partition variation sums (Bounded variation and total variation on an interval).

[L3]

Finite sums distribute over scalar multiplication and addition (Finite sums and finite products, by recursion, Laws of finite sums and finite products).

[L4]

∣cu∣=∣c∣∣u∣ (Basic properties of the absolute value).

[L5]

∣u+v∣≤∣u∣+∣v∣ (The triangle inequality).

Proof

technique · direct
1.1

For every partition P, [L4] and [L3] give V(cf,P)=∣c∣V(f,P). Taking suprema gives Var⁡(cf)=∣c∣Var⁡(f), including c=0 and the singleton interval.

L1L2L3L4
1.2

For every partition, [L5] applied to each increment and then [L3] give V(f+g,P)≤V(f,P)+V(g,P)≤Var⁡(f)+Var⁡(g). Taking the supremum proves subadditivity.

L1L2L3L5
2.1

Step 1.1 with c=−1 gives Var⁡(−f)=Var⁡(f). Repeated use of steps 1.1 and 1.2 proves closure under every finite linear combination.

step 1.1step 1.2L3∎
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-11Open item page →

Functions of bounded variation form an algebra

Statement

If f and g have bounded variation on [a,b], so do f+g, cf, and fg. If ∣f∣≤Mf and ∣g∣≤Mg, then

Var⁡(fg)≤MfVar⁡(g)+MgVar⁡(f).

Facts & Assumptions

Proof

technique · direct
1.1

By [L2] choose Mf,Mg≥0 with ∣f(x)∣≤Mf and ∣g(x)∣≤Mg on [a,b]. For a partition point pair x<y, the identity f(y)g(y)−f(x)g(x)=f(y)(g(y)−g(x))+g(x)(f(y)−f(x)) gives ∣(fg)(y)−(fg)(x)∣≤Mf∣g(y)−g(x)∣+Mg∣f(y)−f(x)∣.

L2L5algebra
2.1

Summing step 1.1 over any partition yields V(fg,P)≤MfV(g,P)+MgV(f,P)≤MfVar⁡(g)+MgVar⁡(f). Taking the supremum proves the displayed bound and that fg is BV.

step 1.1L3L4
3.1

Closure under sums and scalar multiples is [L1], and step 2.1 supplies closure under products, so the BV functions form an algebra under pointwise operations.

step 2.1L1∎
CorollaryStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-11Open item page →

Every bounded-variation function on a compact interval is Riemann integrable

Statement

Every real-valued function of bounded variation on a compact interval [a,b] is Darboux, equivalently Riemann, integrable.

Facts & Assumptions

Proof

technique · direct
1.1

By [L1], Pf and Nf are nondecreasing; by [L2] both are integrable, and the constant function f(a) is integrable.

L1L2L4
2.1

Linearity applied to f=f(a)+Pf−Nf makes f integrable. The singleton interval follows from the zero-integral convention.

step 1.1L1L3L4∎
DefinitionDefinition: AI-adaptedProof: Not applicableaudited 2026-08-11Open item page →

Absolute continuity on a compact interval

Definition

Let a≤b and f:[a,b]→R (Intervals of R: the nine order-convex forms, nondegeneracy, and length). The function f is absolutely continuous on [a,b] if for every ε>0 there is δ>0 such that every finite family of subintervals [uj,vj]⊆[a,b], indexed by j<m, whose open interiors are pairwise disjoint and which satisfies

∑j<m(vj−uj)<δ

also satisfies

∑j<m∣f(vj)−f(uj)∣<ε.

Finite sums and the empty sum are those of Finite sums and finite products, by recursion and Laws of finite sums and finite products. For m=0 both sums are 0, so the condition is automatic. On [a,a] every permitted interval is a singleton and every endpoint increment is 0 (Absolute value in an ordered field), so every function on that singleton is absolutely continuous. Absolute continuity implies ordinary continuity (Continuity of f:A→R at a point of A and on A: the ε-δ condition, its agreement with lim⁡x→cf(x)=f(c) at a limit point, and continuity at an isolated point); that implication is proved next rather than built into the definition.

TheoremStatement: AI-adaptedProof: AI-generatedprecheck passaudited 2026-08-11Open item page →

C1 implies Lipschitz, Lipschitz implies absolutely continuous, and absolutely continuous implies continuous and bounded variation

Statement

Let f:[a,b]→R.

  1. If f is continuous on [a,b], differentiable on (a,b), and f′ extends continuously to [a,b], then f is Lipschitz.
  2. Every Lipschitz f is absolutely continuous.
  3. Every absolutely continuous f is continuous and has bounded variation.

Thus, with C1 understood in the endpoint-extension sense of claim 1, C1⊆Lipschitz⊆AC⊆C∩BV on a compact interval.

Facts & Assumptions

Given: A compact interval [a,b] and a function f:[a,b]→R.

[L1]

Absolute continuity is the finite disjoint-interval condition of Absolute continuity on a compact interval.

[L3]

A continuous real function on [a,b] is bounded (A continuous real function on a compact subset of R is bounded).

[L7]

Finite sums split and telescope (Laws of finite sums and finite products).

[L8]

The canonical naturals are cofinal in R (Every complete ordered field is Archimedean).

Proof

technique · direct
1.1

Under claim 1, the continuous extension of f′ is bounded by some M≥0 on [a,b] by [L3]. The bounded-derivative theorem [L4] then makes f Lipschitz with constant M.

L2L3L4
1.2

If f is Lipschitz with constant L, then for every finite disjoint family, ∑j<m∣f(vj)−f(uj)∣≤L∑j<m(vj−uj). For L=0 any positive δ works; for L>0 choose δ=ε/L. This proves absolute continuity, including the empty family.

L1L5L7
1.3

If f is absolutely continuous, apply [L1] to the single interval with endpoints x,y to obtain the usual ε-δ continuity condition, so f is continuous.

L1L2
1.4

For bounded variation, take δ>0 from absolute continuity with ε=1. By [L8] choose a natural N≥1 with (b−a)/N<δ. Insert the points of the uniform N-partition into an arbitrary partition P. Inside each uniform block, the refined subintervals have disjoint interiors and total length at most (b−a)/N<δ, so their endpoint oscillations sum to less than 1. Summing over the N blocks gives V(f,P)≤N, independent of P. Thus f is BV. If a=b, its variation is 0.

L1L6L7L8
2.1

Steps 1.1 through 1.4 prove all three inclusions and the asserted hierarchy.

step 1.1step 1.2step 1.3step 1.4∎
DefinitionDefinition: AI-adaptedProof: Not applicableaudited 2026-08-11Open item page →

Riemann–Stieltjes sums, upper and lower sums, and the Riemann–Stieltjes integral

Definition

Let a<b, let f,α:[a,b]→R, and let P=(n,t) be a partition (Partition of [a,b] as a finite strictly increasing list a=t0<t1<⋯<tn=b, its subintervals and their lengths, its mesh, refinement, and the common refinement of two partitions). A choice of tags ξi∈[ti,ti+1] for i<n makes (P,ξ) a tagged partition as in Tagged partitions of [a,b], with a tag ξi in each subinterval, and the Riemann sum S(f,P,ξ)=∑if(ξi) Δi. Its Riemann-Stieltjes sum is

S(f,α;P,ξ):=∑i<nf(ξi)(α(ti+1)−α(ti)).

The function f is Riemann-Stieltjes integrable with respect to α on [a,b] if there is I∈R such that for every ε>0 there is δ>0 for which every tagged partition with ∥P∥<δ satisfies ∣S(f,α;P,ξ)−I∣<ε. Then I=∫abf dα.

If f is bounded (Lower bound, bounded below, bounded set) and α is nondecreasing (Nondecreasing, increasing (strictly increasing), nonincreasing, decreasing, monotone and strictly monotone real functions on a subset of R, with the dictionary to monotone sequences), put

mi:=inf⁡x∈[ti,ti+1]f(x),Mi:=sup⁡x∈[ti,ti+1]f(x), Lα(f,P):=∑i<nmiΔiα,Uα(f,P):=∑i<nMiΔiα,

where Δiα=α(ti+1)−α(ti)≥0. These are the lower and upper Stieltjes sums. Each subinterval is nonempty and its image under bounded f is bounded above and below, so the suprema exist by Complete ordered field (least-upper-bound property) and the infima by Greatest lower bound (infimum) and Every nonempty set bounded below has an infimum. Finite sums use Finite sums and finite products, by recursion and Laws of finite sums and finite products. On [a,a] the integral is 0; for b<a set ∫abf dα=−∫baf dα, matching The integral with oriented limits: ∫aaf:=0 and ∫baf:=−∫abf.

TheoremStatement: AI-adaptedProof: AI-generatedprecheck passaudited 2026-08-11Open item page →

Darboux criterion for Riemann–Stieltjes integrability with a nondecreasing integrator

Statement

Let a<b, let f:[a,b]→R be bounded and let α:[a,b]→R be nondecreasing. Then f is Riemann-Stieltjes integrable in the mesh sense of Riemann–Stieltjes sums, upper and lower sums, and the Riemann–Stieltjes integral if and only if both of the following conditions hold:

  1. f is continuous at every discontinuity of α; and
  2. for every ε>0 there is a partition P with

Uα(f,P)−Lα(f,P)<ε.

In condition 2, writing ωi(f) for the oscillation of f on [ti,ti+1], the condition is ∑i<nωi(f)Δiα<ε.

The hypothesis a<b is required and not cosmetic. On [a,a] the integral is 0 by Riemann–Stieltjes sums, upper and lower sums, and the Riemann–Stieltjes integral, so every bounded f is integrable, while Partition of [a,b] as a finite strictly increasing list a=t0<t1<⋯<tn=b, its subintervals and their lengths, its mesh, refinement, and the common refinement of two partitions admits no partition of a singleton interval, so condition 2 asserts the existence of something that does not exist and fails. The equivalence therefore holds only on a nondegenerate interval; a consumer needing a=b reads the value straight off the definition.

In particular, when α is continuous, the weighted Darboux condition alone is equivalent to mesh Riemann-Stieltjes integrability.

Facts & Assumptions

Given: A bounded f:[a,b]→R and a nondecreasing α:[a,b]→R.

[L1]
[L3]

Finite sums split, telescope, and preserve inequalities termwise (Finite sums and finite products, by recursion, Laws of finite sums and finite products).

[L4]

Every nonempty set of reals bounded above has a supremum, and every nonempty set bounded below has an infimum (Complete ordered field (least-upper-bound property), Every nonempty set bounded below has an infimum, Greatest lower bound (infimum), Lower bound, bounded below, bounded set).

Proof

technique · direct
1.1

For every partition P, Uα(f,P)−Lα(f,P)=∑i<n(Mi−mi)Δiα=∑i<nωi(f)Δiα. Refinement can only decrease the upper sum and increase the lower sum, because each refined supremum is no larger and each refined infimum no smaller than its coarse counterpart.

L1L2L3L4
1.2

Suppose first that the mesh-limit integral is I. Given ε>0, choose a partition P fine enough that every tagged sum over P is within ε/4 of I. In each subinterval choose tags whose values approach its supremum and infimum within a common error small enough, using [L5] and the finite number of intervals. The two resulting tagged sums differ by more than Uα(f,P)−Lα(f,P)−ε/2, but by less than ε/2 through I; hence Uα(f,P)−Lα(f,P)<ε.

L1L3L4L5
1.3

Mesh integrability also forces continuity of f at every discontinuity c of α. By [L6], the total increment of α across every sufficiently small interval straddling c is bounded below by a fixed positive number. Complete such an interval to an arbitrarily fine partition and keep every other tag fixed. Tagging the straddling interval first at c and then at an arbitrary point x in that interval changes the sum by (f(x)−f(c))Δα. Both sums must approach the same mesh limit, so f(x)→f(c) as x→c. The same one-sided argument applies at an endpoint.

L1L2L6L7
2.1

Conversely assume both stated conditions. The lower sums have a supremum I− and the upper sums an infimum I+, with I−≤I+. Step 1.1 and condition 2 force I−=I+=:I. Given ε>0, choose P0 with Darboux gap below ε/3. Around each of its finitely many interior points c, choose a small neighborhood as follows: if α is continuous at c, make the variation of α there so small that twice the bound on ∣f∣ times that variation is below the allotted error; if α is discontinuous at c, condition 1 and [L7] make the oscillation of f there so small that its product with α(b)−α(a) is below the allotted error. Choose the neighborhoods disjoint and divide the error among their finite number.

step 1.1L4L6L7
3.1

Let Q now have mesh smaller than all those neighborhood radii and let R=P0∨Q. A tagged sum on R lies between Lα(f,P0) and Uα(f,P0). Comparing a sum on Q with one on R, the intervals of Q that do not cross a point of P0 contribute at most the Darboux gap. Each crossing interval lies in one chosen neighborhood: its refinement error is bounded either by 2sup⁡∣f∣ times the local variation of α, or by the local oscillation of f times the total variation α(b)−α(a). The choices in step 2.1 make the sum of all crossing errors below 2ε/3. Hence every sufficiently fine tagged sum lies within ε of I.

step 2.1L1L2L3L4L7
4.1

Steps 1.2–1.3 prove necessity, steps 2.1–3.1 prove sufficiency, and step 1.1 proves the weighted-oscillation formulation. When α is continuous, condition 1 is vacuous.

step 1.1step 1.2step 1.3step 2.1step 3.1∎
LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-11Open item page →

The Riemann–Stieltjes integral is unique

Statement

For fixed f,α:[a,b]→R, at most one real number satisfies the mesh-limit condition defining ∫abf dα.

Facts & Assumptions

Given: Two reals I,J satisfying the defining mesh condition for the same functions f,α.

[L1]

The mesh-limit condition quantifies over every sufficiently fine tagged partition (Riemann–Stieltjes sums, upper and lower sums, and the Riemann–Stieltjes integral).

[L4]

∣u+v∣≤∣u∣+∣v∣ and ∣u∣=0 exactly when u=0 (The triangle inequality, Basic properties of the absolute value).

Proof

technique · direct
1.1

Given ε>0, choose positive thresholds δI,δJ for error ε/2 in the two mesh conditions. By [L3] choose a natural N≥1 whose uniform partition has mesh smaller than both thresholds, and give it arbitrary tags.

L1L2L3choose
2.1

For its sum S, ∣I−J∣≤∣I−S∣+∣S−J∣<ε. Since this holds for every ε>0, ∣I−J∣=0 and I=J. The singleton interval has only the prescribed value 0.

step 1.1L1L4∎
LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-11Open item page →

Refinement and tag-change estimates for Stieltjes sums

Statement

Let α have bounded variation on [a,b], let P=(n,t) be a partition, and let Q refine P. If the oscillation of f on [ti,ti+1] is at most ωi, then any tagged sum on P and any tagged sum on Q satisfy

∣SQ−SP∣≤∑i<nωiVar⁡[ti,ti+1](α).

In particular, if every ωi≤ω, the bound is ωVar⁡[a,b](α). Two tagged sums on arbitrary partitions whose intervals all have oscillation at most ω differ by at most 2ωVar⁡[a,b](α).

Facts & Assumptions

Given: Functions f,α:[a,b]→R, a partition P, a refinement Q, and tags on both.

[L1]

Stieltjes sums are weighted finite sums of integrator increments (Riemann–Stieltjes sums, upper and lower sums, and the Riemann–Stieltjes integral).

[L2]

Total variation bounds every sum of absolute increments and is additive on adjacent subintervals (Bounded variation and total variation on an interval, Total variation is additive over adjacent subintervals and decreases under restriction).

[L5]

The absolute value of a finite sum is at most the sum of absolute values (The triangle inequality).

Proof

technique · direct
1.1

Inside one coarse interval [ti,ti+1], the refined integrator increments telescope to α(ti+1)−α(ti). Subtract the coarse term by assigning its tag value to every refined increment. Each coefficient difference has absolute value at most ωi, so the absolute difference contributed by that block is at most ωi times the sum of the absolute refined increments, hence at most ωiVar⁡[ti,ti+1](α).

L1L2L3L4L5
2.1

Summing step 1.1 over the coarse blocks proves the first estimate. If ωi≤ω, additivity of variation gives the uniform bound. The conclusions remain 0 when the variation or the interval is 0.

step 1.1L2L4L5
3.1

For two arbitrary partitions, pass to their common refinement and apply the uniform estimate once from each original sum to the refined sum. The triangle inequality gives the factor 2.

step 2.1L3L5∎
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-11Open item page →

A continuous integrand is Riemann–Stieltjes integrable against every bounded-variation integrator

Statement

If f:[a,b]→R is continuous and α:[a,b]→R has bounded variation, then ∫abf dα exists.

Facts & Assumptions

Given: A continuous f:[a,b]→R and a BV function α:[a,b]→R.

[L1]

The refinement estimate bounds differences of tagged sums by oscillation times total variation (Refinement and tag-change estimates for Stieltjes sums).

[L3]

Total variation is finite for a BV function (Bounded variation and total variation on an interval).

Proof

technique · direct
1.1

Put V=Var⁡[a,b](α). If V=0, every integrator increment is 0, so every Stieltjes sum is 0 and the integral exists. Assume V>0. Given ε>0, uniform continuity gives δ>0 such that ∣x−y∣<δ implies ∣f(x)−f(y)∣<ε/(4V). Any two tagged partitions of mesh below δ have all local oscillations below ε/(4V); comparing both with their common refinement through [L1] makes their sums differ by less than ε.

L1L3L4L6
2.1

Choose one tagged uniform partition with mesh tending to 0 for each natural index and call its sum sn. Step 1.1 makes (sn) Cauchy, so [L5] gives a real limit I.

step 1.1L5L6choose
3.1

Given ε>0, choose the threshold in step 1.1 for error ε/2 and then a uniform sum sn beyond that threshold with ∣sn−I∣<ε/2. Every arbitrary tagged sum with sufficiently small mesh differs from sn by less than ε/2, hence is within ε of I. This is the mesh-limit definition, and [L2] identifies the unique value.

step 1.1step 2.1L1L2L5L6∎
CorollaryStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-11Open item page →

The total-variation bound for a Riemann–Stieltjes integral

Statement

Suppose ∫abf dα exists, α has bounded variation, and ∣f(x)∣≤M on [a,b]. Then

∣∫abf dα∣≤MVar⁡[a,b](α).

Facts & Assumptions

Given: An existing Stieltjes integral, a BV integrator α, and a bound ∣f∣≤M.

[L2]

Every sum of absolute integrator increments is bounded by total variation (Bounded variation and total variation on an interval).

[L3]

Finite sums and the triangle inequality give ∣∑ui∣≤∑∣ui∣ (Finite sums and finite products, by recursion, Laws of finite sums and finite products, The triangle inequality, Basic properties of the absolute value).

[L4]

Non-strict inequalities pass to limits (Limits preserve non-strict inequalities).

Proof

technique · direct
1.1

Every tagged sum satisfies ∣S(f,α;P,ξ)∣≤∑i<n∣f(ξi)∣∣Δiα∣≤M∑i<n∣Δiα∣≤MVar⁡[a,b](α).

L2L3
2.1

Take a sequence of tagged partitions with mesh tending to 0. Their sums converge to the integral by [L1], and [L4] passes the bound in step 1.1 to the limit. Orientation and the singleton case preserve the same absolute-value inequality.

step 1.1L1L4∎
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-11Open item page →

Linearity and interval additivity of the Riemann–Stieltjes integral

Statement

Whenever the integrals on the right exist,

∫ab(uf+vg) dα=u∫abf dα+v∫abg dα, ∫abf d(uα+vβ)=u∫abf dα+v∫abf dβ.

Let a≤c≤b, suppose α has bounded variation, and suppose f is continuous at c. Then integrability on [a,b] is equivalent to integrability on both [a,c] and [c,b], and

∫abf dα=∫acf dα+∫cbf dα.

Facts & Assumptions

Given: Functions for which the displayed integrals are defined, scalars u,v, and for additivity a BV integrator α and a cut c where f is continuous.

[L1]

Stieltjes integrability is convergence of all sufficiently fine tagged sums (Riemann–Stieltjes sums, upper and lower sums, and the Riemann–Stieltjes integral).

[L2]
[L6]

Reversal and singleton conventions are those of the oriented integral (The integral with oriented limits: ∫aaf:=0 and ∫baf:=−∫abf).

[L7]

The sum of the absolute integrator increments over any partition is at most Var⁡[a,b](α) (Bounded variation and total variation on an interval).

Proof

technique · direct
1.1

Each tagged sum is exactly linear in f and in α, by distribution in the finite sum. Passing to mesh limits and using uniqueness proves both linearity formulas.

L1L2L4
1.2

For a partition containing c, its Stieltjes sum splits exactly into the sums on the two subintervals. Inserting c into a fine partition changes only the interval containing c. Direct subtraction bounds the difference, for any choices of the old and new tags, by the oscillation of f near c times the sum of the relevant absolute increments of α, hence by that oscillation times Var⁡[a,b](α). Continuity of f at c makes this error tend to zero with the mesh.

L1L3L4L5L7
2.1

If the whole-interval integral exists, take any two sufficiently fine sums on [a,c] and splice each with the same sufficiently fine sum on [c,b]. The two whole-interval sums are close, so their common right part cancels and the left sums are Cauchy. Choose uniform left-hand sums with mesh tending to zero; they form a Cauchy sequence and have a limit by [L8]. Every arbitrary sufficiently fine left-hand sum is close to a sufficiently late uniform one, so the entire left-hand mesh family has that limit. The symmetric argument gives the right integral. Conversely, if both restricted integrals exist, splice their fine sums and use step 1.2 to compare with arbitrary whole-interval sums. The exact split gives the displayed value by [L2]. Endpoint cuts and reversed limits follow from [L6].

step 1.2L1L2L3L6L8∎
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-11Open item page →

Riemann–Stieltjes integration by parts

Statement

The integral ∫abf dα exists if and only if ∫abα df exists. When either exists,

∫abf dα+∫abα df=f(b)α(b)−f(a)α(a).

Facts & Assumptions

Proof

technique · direct
1.1

For a partition P=(n,t), finite summation by parts gives the exact identity ∑i<nf(ti)(α(ti+1)−α(ti))+∑i<nα(ti+1)(f(ti+1)−f(ti))=f(b)α(b)−f(a)α(a).

L3L4
2.1

Suppose ∫f dα exists and consider an arbitrary tagged sum Sf(α;P,η). Refine each [ti,ti+1] by inserting its tag ηi. On [ti,ηi] tag the complementary f dα sum at ti, and on [ηi,ti+1] tag it at ti+1. Direct expansion on the ith interval gives [step 1.1, L1, L2, L3, L4] α(ηi)(f(ti+1)−f(ti))+f(ti)(α(ηi)−α(ti))+f(ti+1)(α(ti+1)−α(ηi))=f(ti+1)α(ti+1)−f(ti)α(ti). The refined mesh does not exceed ∥P∥, so the complementary sums converge to ∫f dα. Telescoping the displayed identities forces every fine tagged sum for ∫α df to converge to the endpoint product minus that integral.

3.1

Exchanging f and α proves the converse. Adding the two values yields the displayed formula, including the singleton and reversed-orientation cases.

step 1.1step 2.1L1L2∎
CorollaryStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-11Open item page →

A bounded-variation integrand is Riemann–Stieltjes integrable against every continuous integrator

Statement

If f:[a,b]→R has bounded variation and α:[a,b]→R is continuous, then ∫abf dα exists.

Facts & Assumptions

Given: A BV function f and a continuous function α on [a,b].

[L1]

A continuous integrand is Stieltjes integrable against a BV integrator (A continuous integrand is Riemann–Stieltjes integrable against every bounded-variation integrator).

[L2]

Existence of ∫α df is equivalent to existence of ∫f dα (Riemann–Stieltjes integration by parts).

Proof

technique · direct
1.1

Since α is continuous and f is BV, [L1] gives the integral ∫abα df.

L1L3
2.1

Integration by parts [L2] then gives existence of ∫abf dα and its value f(b)α(b)−f(a)α(a)−∫abα df.

step 1.1L2∎
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-11Open item page →

A bounded function with finitely many discontinuities is Stieltjes integrable against a continuous bounded-variation integrator

Statement

Let f:[a,b]→R be bounded and have only finitely many discontinuities. If α:[a,b]→R is continuous and has bounded variation, then ∫abf dα exists.

Facts & Assumptions

Given: A bounded f with finite discontinuity set D, and a continuous BV integrator α on [a,b].

[L1]

A BV function is the difference of two nondecreasing functions (Jordan decomposition for functions of bounded variation).

[L2]

The canonical monotone summands of a continuous BV function are continuous (The jumps of a variation function equal the absolute jumps of the original function).

[L3]

For a<b, a bounded integrand and a nondecreasing integrator, mesh integrability is equivalent to continuity of the integrand at every discontinuity of the integrator together with the weighted oscillation criterion (Darboux criterion for Riemann–Stieltjes integrability with a nondecreasing integrator).

[L5]

Stieltjes integration is linear in the integrator (Linearity and interval additivity of the Riemann–Stieltjes integral).

Proof

technique · direct
1.1

If a=b the integral is 0 by the definition of the Riemann-Stieltjes integral on a singleton interval and there is nothing to prove, so assume a<b, which is the standing hypothesis of [L3].

givenL3
1.2

First suppose that α is continuous and nondecreasing. Write ∣f∣≤M. Given ε>0, [L6] and finiteness of D allow pairwise disjoint closed intervals Ix about the points x∈D whose total α-increment is less than ε/(4M+1).

L6
2.1

On the compact complement of the interiors of the Ix, the function f is continuous and hence uniformly continuous by [L4]. Choose a partition containing all endpoints of the Ix and fine enough that every remaining partition interval has oscillation below ε/(1+α(b)−α(a)). The intervals meeting D contribute at most 2M times their total α-increment, and all other intervals contribute less than ε. After rescaling the two preliminary bounds, the weighted oscillation sum is arbitrarily small, so [L3] gives f∈R(α).

step 1.2L3L4
3.1

For a general continuous BV α, [L1] writes α=α(a)+Pα−Nα. Both Pα and Nα are continuous by [L2]. Step 2.1 gives integrability against each, and linearity in the integrator [L5] gives integrability against α.

step 2.1L1L2L5∎
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-11Open item page →

A continuous function of a Stieltjes-integrable function is Stieltjes integrable for a nondecreasing integrator

Statement

Suppose α:[a,b]→R is nondecreasing, f is bounded and Riemann–Stieltjes integrable with respect to α, and ϕ is continuous on a compact interval containing f([a,b]). Then ϕ∘f is Riemann–Stieltjes integrable with respect to α.

Facts & Assumptions

Given: A nondecreasing α, a bounded f∈R(α), and a continuous ϕ on a compact interval containing the range of f.

[L1]

For a<b, bounded f and nondecreasing α, integrability in the mesh sense is equivalent to the conjunction of two conditions: f is continuous at every discontinuity of α, and for every ε>0 some partition has ∑i<nωi(f)Δiα<ε (Darboux criterion for Riemann–Stieltjes integrability with a nondecreasing integrator).

[L3]

Finite sums may be split and estimated termwise (Laws of finite sums and finite products).

Proof

technique · direct
1.1

Choose K with ∣ϕ∣≤K. Given ε>0, uniform continuity supplies η>0 such that ∣u−v∣<η implies ∣ϕ(u)−ϕ(v)∣<ε/(2(1+α(b)−α(a))).

L2
2.1

By [L1], choose a partition P for which ∑Iosc⁡I(f) ΔIα<ηε/(4K+1). Split its intervals into those with osc⁡I(f)<η and the rest. The first class contributes less than ε/2 to the weighted oscillation sum of ϕ∘f. In the second class, osc⁡I(ϕ∘f)≤2K, while η∑ΔIα≤∑Iosc⁡I(f)ΔIα; hence it too contributes less than ε/2.

step 1.1L1L2L3
3.1

Thus the weighted oscillation condition in [L1] holds for ϕ∘f. The same theorem says that f is continuous at every discontinuity of α; continuity of ϕ makes ϕ∘f continuous there as well. Both clauses of [L1] now give ϕ∘f∈R(α).

step 2.1L1L2∎
LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-11Open item page →

Every bounded-variation function is uniformly approximable by step functions

Statement

If f:[a,b]→R has bounded variation, then for every ε>0 there is a finite step function s with ∥f−s∥∞<ε. Endpoint values of s may be prescribed to equal those of f.

More precisely, if E⊆[a,b] is at most countable and f is continuous at every point of E, the interior breakpoints of s may all be chosen outside E.

Facts & Assumptions

Given: A BV function f, a tolerance ε>0, and, for the strengthened assertion, an at most countable set E of continuity points of f.

[L2]

Every nonempty subset of the reals that is bounded above has a supremum (Complete ordered field (least-upper-bound property)).

[L3]

Every nonempty open interval is uncountable (Every nondegenerate interval of R is uncountable).

Proof

technique · direct
1.1

Fix η>0. Let A be the set of x∈[a,b] for which there is a finite chain a=x0<⋯<xm=x such that the oscillation of f on every open interval (xj−1,xj) is below η. The set contains a and is bounded above by b, so c:=sup⁡A exists by [L2].

L2construct
2.1

Suppose c<b. The left limit at c and the right limit at c supplied by [L1] give one-sided intervals on which the oscillation is below η. Choose x∈A in the left interval (use x=a if c=a), append c to its chain if necessary, and then append a point y>c in the right interval. This puts y in A, contradicting that c is an upper bound. Hence c=b. The left limit at b now lets a chain ending sufficiently near b be extended to b. Thus there is a finite partition of [a,b] on each of whose open components the oscillation of f is below η. The singleton case is immediate.

step 1.1L1L2
3.1

On each open component choose one value of f, and at every partition point assign the actual value of f. The resulting finite step function differs from f by less than η everywhere. Taking η=ε/4 leaves room for the strengthened construction.

step 2.1choose
4.1

Only finitely many interior breakpoints lie in E. Around each such breakpoint c, continuity of f gives a small two-sided interval, disjoint from the corresponding intervals for the other breakpoints, on which the oscillation is below ε/4. By [L3] choose a replacement point outside E in that interval and between the neighboring breakpoints. Moving the breakpoint adds only a subinterval from this continuity neighborhood to either adjacent component; the original component oscillation is below ε/4, and a component can be enlarged at both ends, so its new oscillation is at most ε/4+ε/4+ε/4<ε, the three pieces overlapping at the old breakpoints. Sampling again and retaining the actual values at all breakpoints and endpoints gives the required approximation with every interior breakpoint outside E.

step 3.1L3∎
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-11Open item page →

Two bounded-variation functions with no common discontinuity are Riemann–Stieltjes integrable

Statement

Let f,α:[a,b]→R have bounded variation. If no point is a discontinuity of both functions, then ∫abf dα exists.

Facts & Assumptions

Given: BV functions f and α with disjoint discontinuity sets.

[L2]

A BV function can be approximated uniformly by step functions whose breakpoints avoid a prescribed countable set of its continuity points (Every bounded-variation function is uniformly approximable by step functions).

[L3]

Direct subtraction of two Stieltjes sums and the finite-sum triangle inequality give ∣Sα(f)−Sα(g)∣≤∥f−g∥∞Var⁡(α) (Riemann–Stieltjes sums, upper and lower sums, and the Riemann–Stieltjes integral, Bounded variation and total variation on an interval, Finite sums and finite products, by recursion, Laws of finite sums and finite products, The triangle inequality).

[L5]

If α is continuous at a point, its variation function is continuous there; refinement errors are bounded by local variation times local oscillation (The jumps of a variation function equal the absolute jumps of the original function, Refinement and tag-change estimates for Stieltjes sums).

Proof

technique · direct
1.1

By the no-common-discontinuity hypothesis, f is continuous at every point of Dα. For each n≥1, [L1] and [L2] provide a finite step function sn with ∥f−sn∥∞<1/n and all interior breakpoints outside Dα. If an endpoint belongs to Dα, continuity of f there permits the value on the adjacent open component to be changed to f at that endpoint while retaining the same bound after beginning with tolerance 1/(2n). Thus sn is continuous at every point of Dα.

L1L2
2.1

Each sn is integrable with respect to α. Its finitely many discontinuities are points where α is continuous by step 1.1. By [L5], choose disjoint neighborhoods of those points whose total local variation is small. Outside them sn is locally constant, while inside them [L5] bounds differences between fine sums by the small local variation times the finite oscillation of sn. Hence the fine sums are Cauchy. Choose a sequence of uniform tagged sums with mesh tending to zero; [L4] gives its limit, and comparison with a sufficiently late member of this sequence shows that every sufficiently fine tagged sum has the same limit.

step 1.1L4L5
3.1

Given ε>0, choose n so that 2Var⁡[a,b](α)/n<ε/2 (the zero-variation case is immediate), and then choose a mesh bound making any two sums of sn differ by less than ε/2. By [L3], replacing sn by f in either sum changes it by at most Var⁡(α)/n. Hence all sufficiently fine sums of f are Cauchy. Choose uniform tagged sums with mesh tending to zero; their sums form a Cauchy sequence and converge by [L4]. Comparing an arbitrary sufficiently fine sum with a late uniform sum proves convergence of the whole mesh family to that sequential limit, which is exactly the defining Stieltjes integral.

step 2.1L3L4∎
CorollaryStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-11Open item page →

The identity integrator recovers the Riemann integral

Statement

Let a≤b. For the identity function id⁡(x)=x, a bounded f:[a,b]→R is Riemann–Stieltjes integrable with respect to id⁡ exactly when it is Riemann integrable, and then

∫abf did⁡=∫abf(x) dx.

For a=b both sides are 0 by the singleton conventions. For reversed endpoints the statement is about a function defined on the sorted interval: if a>b and f is bounded on [b,a], then both oriented conventions negate the corresponding sorted integral, so the equality is inherited from the case just proved. The hypothesis a≤b is needed for the displayed clause itself, because [a,b] is empty when a>b and a function typed on it supplies no values to integrate.

Facts & Assumptions

Proof

technique · direct
1.1

When a<b and α=id⁡, every increment α(ti+1)−α(ti) equals ti+1−ti. Thus [L1] and [L2] are termwise identical for every tagged partition.

L1L2
2.1

Consequently the two mesh limits exist simultaneously and have the same value; [L3] identifies that tagged limit with the Darboux integral. For a=b both conventions give zero, and [L4] handles a>b.

step 1.1L3L4∎
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-11Open item page →

A continuously differentiable integrator reduces Stieltjes integration to ordinary integration

Statement

Let f:[a,b]→R be Riemann integrable. Suppose α is continuous on [a,b], differentiable on (a,b), and α′ extends continuously to [a,b]. Then f is Riemann–Stieltjes integrable with respect to α and

∫abf dα=∫abf(x)α′(x) dx.

Facts & Assumptions

Proof

technique · direct
1.1

A Riemann-integrable function is bounded; choose M with ∣f∣≤M. For each partition interval, [L1] gives ηi∈(ti,ti+1) such that Δiα=α′(ηi)Δit. Hence [L1] Sα(f;P,ξ)−∑if(ξi)α′(ξi)Δit=∑if(ξi)(α′(ηi)−α′(ξi))Δit.

2.1

By [L2], the absolute value of the right side is at most M(b−a)ωα′(∥P∥), which tends to zero with the mesh. By [L3] and [L4], the second sum in step 1.1 tends to ∫abfα′. Thus all Stieltjes sums have the same limit, proving both existence and the formula.

step 1.1L2L3L4∎
TheoremStatement: AI-adaptedProof: AI-generatedprecheck passaudited 2026-08-11Open item page →

A countable pure-step integrator evaluates a continuous integrand as the absolutely convergent weighted sum of its values at the jumps

Statement

Let a<b. Write I:R→R for the unit step I(t)=0 for t≤0 and I(t)=1 for t>0. Let (sn)n∈N be points of the open interval (a,b), and let (cn)n∈N be reals with cn≥0 and ∑cn convergent.

Then for every x∈[a,b] the series ∑ncnI(x−sn) converges, so

α(x):=∑n=0∞cnI(x−sn)

defines a nondecreasing α:[a,b]→R, which therefore has bounded variation.

For every continuous f:[a,b]→R the integral ∫abf dα exists, the series ∑ncnf(sn) converges absolutely, and

∫abf dα=∑n=0∞cnf(sn).

The points sn are not required to be distinct, and any cn may be zero.

Facts & Assumptions

Given: Reals a<b, points sn∈(a,b), reals cn≥0 with ∑cn convergent, and a continuous f:[a,b]→R.

[L1]

A nondecreasing sequence of reals whose range is bounded above converges, with limit the supremum of its range (A nondecreasing sequence bounded above converges to the supremum of its range, and a nonincreasing sequence bounded below to the infimum); a series converges when its sequence of partial sums converges (Series, partial sums, convergence and the sum, divergence, and the tail series).

[L2]

A real function on [a,b] has bounded variation if and only if it is a difference of two nondecreasing functions (Jordan decomposition for functions of bounded variation); the total variation is the supremum of the partition sums ∑i<n∣g(ti+1)−g(ti)∣ (Bounded variation and total variation on an interval).

[L3]

If f:[a,b]→R is continuous and α:[a,b]→R has bounded variation, then ∫abf dα exists (A continuous integrand is Riemann–Stieltjes integrable against every bounded-variation integrator).

[L4]

Whenever the integrals on the right exist, ∫abf d(uα+vβ)=u∫abf dα+v∫abf dβ (Linearity and interval additivity of the Riemann–Stieltjes integral).

[L5]

If ∫abf dα exists, α has bounded variation, and ∣f(x)∣≤M on [a,b], then ∣∫abf dα∣≤MVar⁡[a,b](α) (The total-variation bound for a Riemann–Stieltjes integral).

[L7]

The Riemann–Stieltjes sum of a tagged partition (P,ξ) is S(f,α;P,ξ)=∑i<nf(ξi)(α(ti+1)−α(ti)), and ∫abf dα=I means that for every ε>0 some δ>0 makes ∣S(f,α;P,ξ)−I∣<ε for every tagged partition of mesh below δ (Riemann–Stieltjes sums, upper and lower sums, and the Riemann–Stieltjes integral, Partition of [a,b] as a finite strictly increasing list a=t0<t1<⋯<tn=b, its subintervals and their lengths, its mesh, refinement, and the common refinement of two partitions, Tagged partitions of [a,b], with a tag ξi in each subinterval, and the Riemann sum S(f,P,ξ)=∑if(ξi) Δi).

[L9]

Continuity of f at s means that for every ε>0 there is δ>0 with ∣f(x)−f(s)∣<ε whenever x lies in the domain and ∣x−s∣<δ (Continuity of f:A→R at a point of A and on A: the ε-δ condition, its agreement with lim⁡x→cf(x)=f(c) at a limit point, and continuity at an isolated point); convergence of a real sequence is the usual ε–threshold condition (Limits and Cauchy sequences of reals).

Proof

technique · direct
1.1

Fix x∈[a,b]. Each term cnI(x−sn) lies in [0,cn], so the partial sums of ∑ncnI(x−sn) are nondecreasing and bounded above by ∑ncn. By [L1] the series converges and α(x) is defined, with 0≤α(x)≤∑ncn.

givenL1
1.2

Fix s∈(a,b) and put σ(x):=I(x−s) on [a,b]. Then σ is nondecreasing, hence of bounded variation by [L2]. Let ε>0 and take δ>0 from [L9] for f at s, so that ∣f(x)−f(s)∣<ε whenever ∣x−s∣<δ. Let (P,ξ) be a tagged partition of mesh below δ. The increment σ(ti+1)−σ(ti) is 1 when ti≤s<ti+1 and 0 otherwise, and because a≤s<b exactly one index i satisfies ti≤s<ti+1. Hence S(f,σ;P,ξ)=f(ξi) for that index, and ti≤ξi≤ti+1 with ti≤s<ti+1 give ∣ξi−s∣≤ti+1−ti<δ, so ∣S(f,σ;P,ξ)−f(s)∣<ε. By [L7], ∫abf dσ=f(s).

givenL2L7L9
2.1

If x≤y then I(x−sn)≤I(y−sn) for every n, because I is nondecreasing and x−sn≤y−sn. Multiplying by cn≥0 and summing, every partial sum for x is at most the corresponding partial sum for y, so the limits satisfy α(x)≤α(y) by [L1]. Thus α is nondecreasing, and α=α−0 exhibits it as a difference of two nondecreasing functions, so [L2] gives α bounded variation.

step 1.1givenL1L2
2.2

For N∈N set αN(x):=∑n<NcnI(x−sn), a finite sum. Each summand is a nonnegative multiple of a function of the form treated in step 1.2, so applying [L4] finitely many times, with the integral of each summand supplied by step 1.2, gives ∫abf dαN=∑n<Ncnf(sn).

step 1.2L4
3.1

By [L6] there is M≥0 with ∣f(x)∣≤M on [a,b]. Since 0≤∣cnf(sn)∣≤Mcn and ∑cn converges, [L8] makes ∑ncnf(sn) absolutely convergent, hence convergent. By step 2.1 and [L3] the integral ∫abf dα exists.

givenstep 2.1L3L6L8
3.2

Set βN:=α−αN. For each x, βN(x)=∑n≥NcnI(x−sn), the tail of the series in step 1.1; the argument of steps 1.1 and 2.1 applies verbatim to it, so βN is nondecreasing with bounded variation. Since sn∈(a,b) we have I(a−sn)=0 and I(b−sn)=1, so βN(a)=0 and βN(b)=∑n≥Ncn. A nondecreasing function has every partition sum equal to βN(b)−βN(a), because each increment is nonnegative and the sum telescopes, so [L2] gives Var⁡[a,b](βN)=∑n≥Ncn.

step 1.1step 2.1givenL1L2
4.1

Both αN and βN are of bounded variation, so [L3] makes ∫abf dαN and ∫abf dβN exist, and α=αN+βN with [L4] gives ∫abf dα=∫abf dαN+∫abf dβN. Using step 2.2 and then [L5] with the bound M of step 3.1, ∣∫abf dα−∑n<Ncnf(sn)∣=∣∫abf dβN∣≤M∑n≥Ncn.

step 2.2step 3.1step 3.2L3L4L5
5.1

Convergence of ∑cn makes its tails ∑n≥Ncn tend to 0 as N increases, so given ε>0 the right side of step 4.1 is below ε for all large N. Hence the partial sums ∑n<Ncnf(sn) converge to ∫abf dα, and by step 3.1 that series converges absolutely. By [L1] and [L9] its sum is ∫abf dα, which is the claimed identity.

step 3.1step 4.1givenL1L9∎

Remark

The two endpoints behave differently, which is why the jumps are confined to the open interval. A jump at a would be harmless: I(x−a) vanishes only at x=a, the increment α(b)−α(a) still records the whole weight, and step 2.1 goes through unchanged because its counting argument needs only a≤s<b. A jump at b genuinely breaks the identity: I(x−b)=0 for every x∈[a,b], so such a term contributes nothing at all to α, yet it would contribute cnf(b) to the right-hand sum. The hypothesis sn∈(a,b) excludes that case, and it is the hypothesis Rudin states.

Rudin's Theorem 6.16 additionally requires the sn to be distinct. Nothing in the proof above uses distinctness, so it is not assumed here.

Continuity of f is not decorative. cex-common-jump-prevents-riemann-stieltjes-integrability exhibits an f and an α sharing a single jump for which no mesh limit exists, and a single step integrator is exactly the α of that counterexample.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-11Open item page →

Change of variable for the Riemann–Stieltjes integral

Statement

Let c<d and a<b, and let ϕ:[c,d]→[a,b] be a strictly increasing continuous bijection. For functions f,α:[a,b]→R, one of the two Riemann–Stieltjes integrals below exists if and only if the other does, and in that case

∫abf dα=∫cd(f∘ϕ) d(α∘ϕ).

The nondegeneracy hypotheses are not cosmetic. If c=d and a=b both integrals are 0 by the singleton convention and the identity holds trivially, but no partition exists and the argument below does not apply. If the written endpoints are reversed the intervals are empty, the empty map is vacuously such a bijection, and f,α typed on an empty interval give the displayed integrals no values; that case is excluded rather than asserted.

Facts & Assumptions

Given: A strictly increasing continuous bijection ϕ:[c,d]→[a,b] and functions f,α on [a,b].

[L3]

The Stieltjes integral is the common mesh limit of its tagged sums (Riemann–Stieltjes sums, upper and lower sums, and the Riemann–Stieltjes integral).

[L4]

A Stieltjes integral, when it exists, is unique (The Riemann–Stieltjes integral is unique).

Proof

technique · direct
1.1

If Q=(sj) is a partition of [c,d] with tags ηj, then P=(ϕ(sj)) is a partition of [a,b] with tags ϕ(ηj). Direct substitution gives [given] Sα∘ϕ(f∘ϕ;Q,η)=Sα(f;P,ϕ∘η).

2.1

By uniform continuity of ϕ in [L2], arbitrarily fine Q give arbitrarily fine image partitions P. Thus existence of the left-hand integral in the displayed formula forces the right-hand sums to converge to the same value. Applying the identical argument to ϕ−1, using [L1] and [L2], proves the converse. Uniqueness [L4] identifies the two limits.

step 1.1L1L2L3L4∎
LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-11Open item page →

Young's partition estimate for rational Hölder exponents

Statement

Let p,q∈Q∩(0,1] satisfy p+q>1. Suppose ∣f(y)−f(x)∣≤Kf∣y−x∣p and ∣g(y)−g(x)∣≤Kg∣y−x∣q on [a,b]. If Dm is the partition into 2m equal intervals and Lm is its left-endpoint Stieltjes sum, then

∣Lm+1−Lm∣≤KfKg(b−a)p+q2−m(p+q−1).

Put r=p+q and Cr:=2r1−21−r. If R refines an arbitrary partition P, then their left-endpoint sums satisfy ∣L(R)−L(P)∣≤CrKfKg(b−a)∥P∥r−1.

Facts & Assumptions

Given: Rational Hölder exponents p,q with p+q>1, Hölder constants Kf,Kg, and the stated partitions.

[L2]

A geometric series with ratio in (0,1) converges and its tails tend to zero (For ∣r∣<1, ∑k≥0rk=1/(1−r), and for ∣r∣≥1 the series diverges).

[L3]

Finite sums obey the triangle inequality and may be regrouped (Laws of finite sums and finite products, The triangle inequality).

Proof

technique · direct
1.1

Insert a point v between adjacent points u<w. The change from the old left-endpoint term to the two new terms is [given] (f(v)−f(u))(g(w)−g(v)) up to sign. Its absolute value is at most KfKg(v−u)p(w−v)q, hence at most KfKg(w−u)p+q by [L1].

2.1

Passing from Dm to Dm+1 inserts one midpoint in each of 2m intervals of length (b−a)2−m. Summing step 1.1 gives the first displayed bound. More generally, if a partition of an interval I has k≥2 subintervals, some interior point has two adjacent lengths whose sum is at most 2∣I∣/(k−1): the sum of all such two-interval lengths is at most 2∣I∣. Removing that point therefore changes the left sum by at most KfKg(2∣I∣/(k−1))r.

step 1.1L1L3
3.1

Remove the extra points of R inside a fixed interval I of P, one at a time, always using step 2.1. The total error is at most 2rKfKg∣I∣r∑j≥1j−r. Grouping the positive integers into [2m,2m+1) bounds this series by ∑m≥02−m(r−1)=(1−21−r)−1 via [L2]. Thus the error on I is at most CrKfKg∣I∣r. Summing over I∈P and using ∣I∣r≤∥P∥r−1∣I∣ proves the refinement estimate. If KfKg=0 or a=b, every error is zero.

step 2.1L1L2L3∎
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-11Open item page →

Young's Riemann–Stieltjes existence theorem for rational Hölder exponents

Statement

Let p,q∈Q∩(0,1] with p+q>1. If f:[a,b]→R is p-Hölder and g:[a,b]→R is q-Hölder, then both ∫abf dg and ∫abg df exist. They satisfy

∫abf dg+∫abg df=f(b)g(b)−f(a)g(a).

Facts & Assumptions

Given: Hölder functions f,g with rational exponents whose sum exceeds one.

[L1]

The Young partition estimate controls refinement errors by a constant times ∥P∥p+q−1 (Young's partition estimate for rational Hölder exponents).

[L3]

A Stieltjes integral is the common limit of all sufficiently fine tagged sums (Riemann–Stieltjes sums, upper and lower sums, and the Riemann–Stieltjes integral).

[L4]

Proof

technique · direct
1.1

For the dyadic left sums Lm, the first estimate in [L1] and the geometric-tail fact [L5] make (Lm) a Cauchy sequence. It therefore converges to some I by [L2].

L1L2L5
2.1

Given a partition P, compare it and a sufficiently fine dyadic partition Dm with their common refinement. The second estimate in [L1] bounds the two refinement errors by a constant times ∥P∥r−1+∥Dm∥r−1. Together with Lm→I, this shows that every sufficiently fine left-endpoint sum is close to I. Replacing a left endpoint ti by an arbitrary tag ξi changes the ith term by at most KfKg∣ti+1−ti∣r; the total is at most KfKg(b−a)∥P∥r−1. Thus every fine tagged sum tends to I, and [L3] gives ∫f dg. Interchanging f and g gives ∫g df.

step 1.1L1L2L3L4
3.1

On every partition, the right-endpoint sum for f dg plus the left-endpoint sum for g df telescopes exactly to f(b)g(b)−f(a)g(a). Passing to the two limits established in step 2.1 proves the formula.

step 2.1L3∎
RemarkRemark: AI-adaptedProof: Not applicableprecheck passaudited 2026-08-11Open item page →

Conventions and proved scope for bounded variation and Stieltjes integration

Statement

Total variation is zero on a singleton, and both ordinary and Riemann–Stieltjes integrals use the oriented convention when endpoints are reversed. Absolute continuity here is formulated with finite disjoint families of intervals.

On a nondegenerate interval [a,b] with a<b, and for a nondecreasing integrator, the weighted Darboux condition matches the all-fine-mesh definition only together with continuity of the integrand at the integrator's discontinuities; this extra compatibility is vacuous for a continuous integrator. The hypothesis a<b is part of the statement and not cosmetic: on [a,a] the integral is 0 by convention, so every bounded integrand is integrable there, while a singleton interval admits no partition at all and so the Darboux condition fails; a consumer needing a=b reads the value off the definition instead. A general BV integrator is handled through Jordan decomposition or tagged sums. Finite-step integrators turn the integral of a continuous integrand into a weighted evaluation sum over the jumps, while continuously differentiable integrators reduce the integral of a Riemann-integrable integrand to an ordinary integral against the derivative. The no-common-discontinuity theorem is sharp in view of the companion common-jump counterexample. Young's theorem is proved here only for rational Hölder exponents because arbitrary real exponents are not available at this point in the reading order; the later Real powers for positive bases, with the zero-base positive-exponent convention ↗ is what supplies them. No Lebesgue–Stieltjes measure, almost-everywhere differentiability theorem, or arbitrary-real-exponent Stieltjes theorem is asserted on this page.

5 · Examples, counterexamples and false statements

None yet.

Sources