Alphabeta Math
Session-authored (Fable 5 assisted)
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 C1C^1–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 aba\le b and let f:[a,b]Rf:[a,b]\to\mathbb R (Intervals of R\mathbb{R}: the nine order-convex forms, nondegeneracy, and length). If a<ba<b and P=(n,t)P=(n,t) is a partition of [a,b][a,b] (Partition of [a,b][a,b] as a finite strictly increasing list a=t0<t1<<tn=ba = t_0 < t_1 < \dots < t_n = b, its subintervals and their lengths, its mesh, refinement, and the common refinement of two partitions), the variation of ff over PP is

V(f,P):=i<nf(ti+1)f(ti).V(f,P):=\sum_{i<n}|f(t_{i+1})-f(t_i)|.

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][a,b] has the partition with point set {a,b}\{a,b\}. The function ff has bounded variation on [a,b][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):=supPV(f,P).\operatorname{Var}_{[a,b]}(f):=\sup_P V(f,P).

Completeness of R\mathbb 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\operatorname{Var}_{[a,a]}(f):=0; no partition from Partition of [a,b][a,b] as a finite strictly increasing list a=t0<t1<<tn=ba = t_0 < t_1 < \dots < t_n = b, its subintervals and their lengths, its mesh, refinement, and the common refinement of two partitions, whose standing hypothesis is a<ba<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]Rf:[a,b]\to\mathbb R have bounded variation. Then

  1. f(y)f(x)Var[a,b](f)|f(y)-f(x)|\le\operatorname{Var}_{[a,b]}(f) for all x,y[a,b]x,y\in[a,b];
  2. ff is bounded on [a,b][a,b];
  3. Var[a,b](f)=0\operatorname{Var}_{[a,b]}(f)=0 if and only if ff is constant.

These claims include the singleton interval a=ba=b.

Facts & Assumptions

Given: Reals aba\le b and a bounded-variation function f:[a,b]Rf:[a,b]\to\mathbb R.

[L1]

Total variation is the supremum of the partition sums V(f,P)V(f,P), with value 00 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+vu+v|u+v|\le |u|+|v| in an ordered field (The triangle inequality).

[L5]

A subset of R\mathbb 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<ba<b and x<yx<y lie in [a,b][a,b], insert xx and yy into the endpoint partition. The resulting partition sum contains f(y)f(x)|f(y)-f(x)| as a nonnegative term, so f(y)f(x)V(f,P)Var[a,b](f)|f(y)-f(x)|\le V(f,P)\le\operatorname{Var}_{[a,b]}(f). The same inequality is 0Var[a,b](f)0\le\operatorname{Var}_{[a,b]}(f) when x=yx=y, and when a=ba=b only that case occurs.

L1L2L3
2.1

Put M:=f(a)+Var[a,b](f)M:=|f(a)|+\operatorname{Var}_{[a,b]}(f). For x[a,b]x\in[a,b], f(x)f(x)f(a)+f(a)M|f(x)|\le |f(x)-f(a)|+|f(a)|\le M, so f([a,b])f([a,b]) is bounded.

step 1.1L4L5
3.1

If the total variation is 00, step 1.1 gives f(y)f(x)=0|f(y)-f(x)|=0 for every x,yx,y, hence ff is constant. Conversely, if ff is constant then every increment in every partition sum is 00, so every sum and its supremum are 00; the singleton convention gives the same conclusion when a=ba=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 acba\le c\le b and f:[a,b]Rf:[a,b]\to\mathbb R, then ff has bounded variation on [a,b][a,b] if and only if its restrictions have bounded variation on [a,c][a,c] and [c,b][c,b]. In that case

Var[a,b](f)=Var[a,c](f)+Var[c,b](f).\operatorname{Var}_{[a,b]}(f)=\operatorname{Var}_{[a,c]}(f)+\operatorname{Var}_{[c,b]}(f).

Consequently restriction to any subinterval cannot increase total variation.

Facts & Assumptions

Given: Reals acba\le c\le b and a function f:[a,b]Rf:[a,b]\to\mathbb R.

[L1]

Total variation is the supremum of finite variation sums, and singleton variation is 00 (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:uxv}[u,v]=\{x:u\le x\le v\} (Intervals of R\mathbb{R}: the nine order-convex forms, nondegeneracy, and length).

Proof

technique · direct
1.1

Given partitions P1P_1 of [a,c][a,c] and P2P_2 of [c,b][c,b], splice their point lists at cc. The resulting partition PP of [a,b][a,b] satisfies V(f,P)=V(f,P1)+V(f,P2)V(f,P)=V(f,P_1)+V(f,P_2). Thus, whenever ff is BV on [a,b][a,b], each restriction is BV and Var[a,c](f)+Var[c,b](f)Var[a,b](f)\operatorname{Var}_{[a,c]}(f)+\operatorname{Var}_{[c,b]}(f)\le\operatorname{Var}_{[a,b]}(f). The assertion is unchanged when c=ac=a or c=bc=b, because the singleton term is 00.

L1L2L3L5
1.2

Conversely, insert cc into an arbitrary partition PP of [a,b][a,b]. The refined sum splits into a sum on [a,c][a,c] and one on [c,b][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)V(f,P)\le\operatorname{Var}_{[a,c]}(f)+\operatorname{Var}_{[c,b]}(f).

L1L2L3
2.1

Taking the supremum over PP 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][u,v]\subseteq[a,b] shows Var[u,v](f)Var[a,b](f)\operatorname{Var}_{[u,v]}(f)\le\operatorname{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]Rf:[a,b]\to\mathbb 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]),V_f(x):=\operatorname{Var}_{[a,x]}(f)\qquad(x\in[a,b]),

so Vf(a)=0V_f(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 ff are

Pf(x):=Vf(x)+f(x)f(a)2,Nf(x):=Vf(x)f(x)+f(a)2.P_f(x):=\frac{V_f(x)+f(x)-f(a)}2,\qquad N_f(x):=\frac{V_f(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]Rf:[a,b]\to\mathbb R, the functions PfP_f and NfN_f are nondecreasing and

f(x)=f(a)+Pf(x)Nf(x),Vf(x)=Pf(x)+Nf(x).f(x)=f(a)+P_f(x)-N_f(x),\qquad V_f(x)=P_f(x)+N_f(x).

Both Pf(a)P_f(a) and Nf(a)N_f(a) are 00.

Facts & Assumptions

Given: A bounded-variation function f:[a,b]Rf:[a,b]\to\mathbb R and its functions Vf,Pf,NfV_f,P_f,N_f.

[L1]

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

[L2]

For xyx\le y, Vf(y)Vf(x)=Var[x,y](f)V_f(y)-V_f(x)=\operatorname{Var}_{[x,y]}(f) (Total variation is additive over adjacent subintervals and decreases under restriction).

[L3]

f(y)f(x)Var[x,y](f)|f(y)-f(x)|\le\operatorname{Var}_{[x,y]}(f) (Total variation bounds increments; bounded-variation functions are bounded; zero variation means constant).

[L5]

uu|u|\ge u and uu|u|\ge -u (Absolute value in an ordered field).

Proof

technique · direct
1.1

For xyx\le y, [L2] and [L3] give Vf(y)Vf(x)f(y)f(x)V_f(y)-V_f(x)\ge|f(y)-f(x)|, hence this difference is at least both f(y)f(x)f(y)-f(x) and f(x)f(y)f(x)-f(y). Therefore Pf(y)Pf(x)0P_f(y)-P_f(x)\ge0 and Nf(y)Nf(x)0N_f(y)-N_f(x)\ge0, so both functions are nondecreasing.

L1L2L3L4L5
1.2

Adding and subtracting the defining formulas gives Pf(x)+Nf(x)=Vf(x)P_f(x)+N_f(x)=V_f(x) and Pf(x)Nf(x)=f(x)f(a)P_f(x)-N_f(x)=f(x)-f(a). At x=ax=a, Vf(a)=0V_f(a)=0, so Pf(a)=Nf(a)=0P_f(a)=N_f(a)=0.

L1algebra
2.1

Rearranging the second identity in step 1.2 gives f=f(a)+PfNff=f(a)+P_f-N_f, 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 ff on [a,b][a,b] has bounded variation if and only if it is a difference of two nondecreasing functions. If f(a)=0f(a)=0, the canonical normalized decomposition is f=PfNff=P_f-N_f. More generally f=f(a)+PfNff=f(a)+P_f-N_f.

It is minimal: if f=f(a)+ghf=f(a)+g-h with nondecreasing g,hg,h and g(a)=h(a)=0g(a)=h(a)=0, then Pf(x)g(x)P_f(x)\le g(x) and Nf(x)h(x)N_f(x)\le h(x) for every xx.

Facts & Assumptions

Given: A function f:[a,b]Rf:[a,b]\to\mathbb R.

[L1]

For BV ff, Pf,NfP_f,N_f are nondecreasing, normalized at aa, and f=f(a)+PfNff=f(a)+P_f-N_f (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]

uvu+v|u-v|\le |u|+|v| (The triangle inequality).

Proof

technique · direct
1.1

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

L1
1.2

Conversely suppose f=f(a)+ghf=f(a)+g-h with g,hg,h nondecreasing. For a partition P=(n,t)P=(n,t), every forward increment of gg and hh is nonnegative, so f(ti+1)f(ti)(g(ti+1)g(ti))+(h(ti+1)h(ti))|f(t_{i+1})-f(t_i)|\le(g(t_{i+1})-g(t_i))+(h(t_{i+1})-h(t_i)). Summing and telescoping gives V(f,P)g(b)g(a)+h(b)h(a)V(f,P)\le g(b)-g(a)+h(b)-h(a), independent of PP; hence ff is BV.

L2L3L4L5L6
2.1

Now assume the decomposition is normalized. On [a,x][a,x], step 1.2 gives Vf(x)g(x)+h(x)V_f(x)\le g(x)+h(x), while f(x)f(a)=g(x)h(x)f(x)-f(a)=g(x)-h(x). Adding these inequalities and dividing by 22 yields Pf(x)g(x)P_f(x)\le g(x); subtracting the increment identity from the variation inequality yields Nf(x)h(x)N_f(x)\le 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]Rf:[a,b]\to\mathbb R has bounded variation, every well-posed one-sided limit of ff 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 PfP_f and NfN_f. 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)+PfNff=f(a)+P_f-N_f. Thus ff has no discontinuity of the second kind.

L1L2L4
1.2

If both PfP_f and NfN_f are continuous at a point, [L4] makes ff continuous there. Hence the discontinuity set of ff 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\mathbb 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\mathbb N. Step 1.2 therefore makes the discontinuity set of ff 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]Rf:[a,b]\to\mathbb R have bounded variation and let Vf(x)=Var[a,x](f)V_f(x)=\operatorname{Var}_{[a,x]}(f). At an interior point cc,

Vf(c+)Vf(c)=f(c+)f(c),Vf(c)Vf(c)=f(c)f(c).V_f(c+)-V_f(c)=|f(c+)-f(c)|,\qquad V_f(c)-V_f(c-)=|f(c)-f(c-)|.

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

Facts & Assumptions

Given: A bounded-variation function f:[a,b]Rf:[a,b]\to\mathbb R, its variation function VfV_f, and a point c[a,b]c\in[a,b].

[L1]

Vf(y)Vf(x)=Var[x,y](f)V_f(y)-V_f(x)=\operatorname{Var}_{[x,y]}(f) whenever xyx\le y (Total variation is additive over adjacent subintervals and decreases under restriction).

[L2]

f(y)f(x)Var[x,y](f)|f(y)-f(x)|\le\operatorname{Var}_{[x,y]}(f) (Total variation bounds increments; bounded-variation functions are bounded; zero variation means constant).

Proof

technique · direct
1.1

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

L1L2L3L4
1.2

For the reverse inequality, fix x0>cx_0>c and put xn=c+(x0c)2nx_n=c+(x_0-c)2^{-n}. Let an=Var[xn+1,xn](f)a_n=\operatorname{Var}_{[x_{n+1},x_n]}(f). By repeated additivity, every partial sum of the nonnegative series nan\sum_na_n is Var[xN,x0](f)\operatorname{Var}_{[x_N,x_0]}(f) for a suitable NN, hence is bounded by Var[c,x0](f)\operatorname{Var}_{[c,x_0]}(f). Its tails therefore tend to zero by [L6], while xncx_n\downarrow c by [L7].

L1L6L7
2.1

Given ε>0\varepsilon>0, take NN so large that the series tail from NN is below ε\varepsilon and f(y)f(c+)<ε|f(y)-f(c+)|<\varepsilon whenever c<yxNc<y\le x_N. For any partition c=t0<t1<<tk=xNc=t_0<t_1<\cdots<t_k=x_N, choose mNm\ge N with xm+1<t1xmx_{m+1}<t_1\le x_m. 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<ε,\operatorname{Var}_{[t_1,x_N]}(f)\le\operatorname{Var}_{[x_{m+1},x_N]}(f)=\sum_{n=N}^{m}a_n<\varepsilon, while f(t1)f(c)f(c+)f(c)+ε|f(t_1)-f(c)|\le|f(c+)-f(c)|+\varepsilon. Taking the supremum over partitions gives Var[c,xN](f)f(c+)f(c)+2ε\operatorname{Var}_{[c,x_N]}(f)\le|f(c+)-f(c)|+2\varepsilon. Restriction gives the same bound for c<xxNc<x\le x_N, and [L2] gives the reverse bound in the limit.

3.1

Thus limxcVar[c,x](f)=f(c+)f(c)\lim_{x\downarrow c}\operatorname{Var}_{[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 ff is continuous at cc, both absolute jumps vanish by [L5], so VfV_f 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]Rf,g:[a,b]\to\mathbb R and cRc\in\mathbb R,

Var(cf)=cVar(f),Var(f+g)Var(f)+Var(g).\operatorname{Var}(cf)=|c|\operatorname{Var}(f),\qquad \operatorname{Var}(f+g)\le\operatorname{Var}(f)+\operatorname{Var}(g).

Thus f-f, f+gf+g, and every finite linear combination of BV functions are BV; in particular Var(f)=Var(f)\operatorname{Var}(-f)=\operatorname{Var}(f).

Facts & Assumptions

Given: BV functions f,g:[a,b]Rf,g:[a,b]\to\mathbb R and a scalar cc.

[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=cu|cu|=|c||u| (Basic properties of the absolute value).

[L5]

u+vu+v|u+v|\le|u|+|v| (The triangle inequality).

Proof

technique · direct
1.1

For every partition PP, [L4] and [L3] give V(cf,P)=cV(f,P)V(cf,P)=|c|V(f,P). Taking suprema gives Var(cf)=cVar(f)\operatorname{Var}(cf)=|c|\operatorname{Var}(f), including c=0c=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)V(f+g,P)\le V(f,P)+V(g,P)\le\operatorname{Var}(f)+\operatorname{Var}(g). Taking the supremum proves subadditivity.

L1L2L3L5
2.1

Step 1.1 with c=1c=-1 gives Var(f)=Var(f)\operatorname{Var}(-f)=\operatorname{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 ff and gg have bounded variation on [a,b][a,b], so do f+gf+g, cfcf, and fgfg. If fMf|f|\le M_f and gMg|g|\le M_g, then

Var(fg)MfVar(g)+MgVar(f).\operatorname{Var}(fg)\le M_f\operatorname{Var}(g)+M_g\operatorname{Var}(f).

Facts & Assumptions

Proof

technique · direct
1.1

By [L2] choose Mf,Mg0M_f,M_g\ge0 with f(x)Mf|f(x)|\le M_f and g(x)Mg|g(x)|\le M_g on [a,b][a,b]. For a partition point pair x<yx<y, the identity f(y)g(y)f(x)g(x)=f(y)(g(y)g(x))+g(x)(f(y)f(x))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)Mfg(y)g(x)+Mgf(y)f(x)|(fg)(y)-(fg)(x)|\le M_f|g(y)-g(x)|+M_g|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)V(fg,P)\le M_fV(g,P)+M_gV(f,P)\le M_f\operatorname{Var}(g)+M_g\operatorname{Var}(f). Taking the supremum proves the displayed bound and that fgfg 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][a,b] is Darboux, equivalently Riemann, integrable.

Facts & Assumptions

Proof

technique · direct
1.1

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

L1L2L4
2.1

Linearity applied to f=f(a)+PfNff=f(a)+P_f-N_f makes ff 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 aba\le b and f:[a,b]Rf:[a,b]\to\mathbb R (Intervals of R\mathbb{R}: the nine order-convex forms, nondegeneracy, and length). The function ff is absolutely continuous on [a,b][a,b] if for every ε>0\varepsilon>0 there is δ>0\delta>0 such that every finite family of subintervals [uj,vj][a,b][u_j,v_j]\subseteq[a,b], indexed by j<mj<m, whose open interiors are pairwise disjoint and which satisfies

j<m(vjuj)<δ\sum_{j<m}(v_j-u_j)<\delta

also satisfies

j<mf(vj)f(uj)<ε.\sum_{j<m}|f(v_j)-f(u_j)|<\varepsilon.

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=0m=0 both sums are 00, so the condition is automatic. On [a,a][a,a] every permitted interval is a singleton and every endpoint increment is 00 (Absolute value in an ordered field), so every function on that singleton is absolutely continuous. Absolute continuity implies ordinary continuity (Continuity of f:ARf : A \to \mathbb{R} at a point of AA and on AA: the ε\varepsilon-δ\delta condition, its agreement with limxcf(x)=f(c)\lim_{x \to c} f(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 →

C1C^1 implies Lipschitz, Lipschitz implies absolutely continuous, and absolutely continuous implies continuous and bounded variation

Statement

Let f:[a,b]Rf:[a,b]\to\mathbb R.

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

Thus, with C1C^1 understood in the endpoint-extension sense of claim 1, C1LipschitzACCBVC^1\subseteq\mathrm{Lipschitz}\subseteq AC\subseteq C\cap BV on a compact interval.

Facts & Assumptions

Given: A compact interval [a,b][a,b] and a function f:[a,b]Rf:[a,b]\to\mathbb 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][a,b] is bounded (A continuous real function on a compact subset of R\mathbb{R} is bounded).

[L7]

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

[L8]

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

Proof

technique · direct
1.1

Under claim 1, the continuous extension of ff' is bounded by some M0M\ge0 on [a,b][a,b] by [L3]. The bounded-derivative theorem [L4] then makes ff Lipschitz with constant MM.

L2L3L4
1.2

If ff is Lipschitz with constant LL, then for every finite disjoint family, j<mf(vj)f(uj)Lj<m(vjuj)\sum_{j<m}|f(v_j)-f(u_j)|\le L\sum_{j<m}(v_j-u_j). For L=0L=0 any positive δ\delta works; for L>0L>0 choose δ=ε/L\delta=\varepsilon/L. This proves absolute continuity, including the empty family.

L1L5L7
1.3

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

L1L2
1.4

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

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<ba<b, let f,α:[a,b]Rf,\alpha:[a,b]\to\mathbb R, and let P=(n,t)P=(n,t) be a partition (Partition of [a,b][a,b] as a finite strictly increasing list a=t0<t1<<tn=ba = t_0 < t_1 < \dots < t_n = b, its subintervals and their lengths, its mesh, refinement, and the common refinement of two partitions). A choice of tags ξi[ti,ti+1]\xi_i\in[t_i,t_{i+1}] for i<ni<n makes (P,ξ)(P,\xi) a tagged partition as in Tagged partitions of [a,b][a,b], with a tag ξi\xi_i in each subinterval, and the Riemann sum S(f,P,ξ)=if(ξi)ΔiS(f,P,\xi) = \sum_i f(\xi_i)\,\Delta_i. Its Riemann-Stieltjes sum is

S(f,α;P,ξ):=i<nf(ξi)(α(ti+1)α(ti)).S(f,\alpha;P,\xi):=\sum_{i<n}f(\xi_i)\bigl(\alpha(t_{i+1})-\alpha(t_i)\bigr).

The function ff is Riemann-Stieltjes integrable with respect to α\alpha on [a,b][a,b] if there is IRI\in\mathbb R such that for every ε>0\varepsilon>0 there is δ>0\delta>0 for which every tagged partition with P<δ\|P\|<\delta satisfies S(f,α;P,ξ)I<ε|S(f,\alpha;P,\xi)-I|<\varepsilon. Then I=abfdαI=\int_a^b f\,d\alpha.

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

mi:=infx[ti,ti+1]f(x),Mi:=supx[ti,ti+1]f(x),m_i:=\inf_{x\in[t_i,t_{i+1}]}f(x),\qquad M_i:=\sup_{x\in[t_i,t_{i+1}]}f(x), Lα(f,P):=i<nmiΔiα,Uα(f,P):=i<nMiΔiα,L_\alpha(f,P):=\sum_{i<n}m_i\Delta_i\alpha,\qquad U_\alpha(f,P):=\sum_{i<n}M_i\Delta_i\alpha,

where Δiα=α(ti+1)α(ti)0\Delta_i\alpha=\alpha(t_{i+1})-\alpha(t_i)\ge0. These are the lower and upper Stieltjes sums. Each subinterval is nonempty and its image under bounded ff 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][a,a] the integral is 00; for b<ab<a set abfdα=bafdα\int_a^b f\,d\alpha=-\int_b^a f\,d\alpha, matching The integral with oriented limits: aaf:=0\int_a^a f := 0 and baf:=abf\int_b^a f := -\int_a^b f.

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

Darboux criterion for Riemann–Stieltjes integrability with a nondecreasing integrator

Statement

Let a<ba<b, let f:[a,b]Rf:[a,b]\to\mathbb R be bounded and let α:[a,b]R\alpha:[a,b]\to\mathbb R be nondecreasing. Then ff 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. ff is continuous at every discontinuity of α\alpha; and
  2. for every ε>0\varepsilon>0 there is a partition PP with

Uα(f,P)Lα(f,P)<ε.U_\alpha(f,P)-L_\alpha(f,P)<\varepsilon.

In condition 2, writing ωi(f)\omega_i(f) for the oscillation of ff on [ti,ti+1][t_i,t_{i+1}], the condition is i<nωi(f)Δiα<ε\sum_{i<n}\omega_i(f)\Delta_i\alpha<\varepsilon.

The hypothesis a<ba<b is required and not cosmetic. On [a,a][a,a] the integral is 00 by Riemann–Stieltjes sums, upper and lower sums, and the Riemann–Stieltjes integral, so every bounded ff is integrable, while Partition of [a,b][a,b] as a finite strictly increasing list a=t0<t1<<tn=ba = t_0 < t_1 < \dots < t_n = 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=ba=b reads the value straight off the definition.

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

Facts & Assumptions

Given: A bounded f:[a,b]Rf:[a,b]\to\mathbb R and a nondecreasing α:[a,b]R\alpha:[a,b]\to\mathbb 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 PP, Uα(f,P)Lα(f,P)=i<n(Mimi)Δiα=i<nωi(f)ΔiαU_\alpha(f,P)-L_\alpha(f,P)=\sum_{i<n}(M_i-m_i)\Delta_i\alpha=\sum_{i<n}\omega_i(f)\Delta_i\alpha. 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 II. Given ε>0\varepsilon>0, choose a partition PP fine enough that every tagged sum over PP is within ε/4\varepsilon/4 of II. 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)ε/2U_\alpha(f,P)-L_\alpha(f,P)-\varepsilon/2, but by less than ε/2\varepsilon/2 through II; hence Uα(f,P)Lα(f,P)<εU_\alpha(f,P)-L_\alpha(f,P)<\varepsilon.

L1L3L4L5
1.3

Mesh integrability also forces continuity of ff at every discontinuity cc of α\alpha. By [L6], the total increment of α\alpha across every sufficiently small interval straddling cc 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 cc and then at an arbitrary point xx in that interval changes the sum by (f(x)f(c))Δα(f(x)-f(c))\Delta\alpha. Both sums must approach the same mesh limit, so f(x)f(c)f(x)\to f(c) as xcx\to c. The same one-sided argument applies at an endpoint.

L1L2L6L7
2.1

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

step 1.1L4L6L7
3.1

Let QQ now have mesh smaller than all those neighborhood radii and let R=P0QR=P_0\vee Q. A tagged sum on RR lies between Lα(f,P0)L_\alpha(f,P_0) and Uα(f,P0)U_\alpha(f,P_0). Comparing a sum on QQ with one on RR, the intervals of QQ that do not cross a point of P0P_0 contribute at most the Darboux gap. Each crossing interval lies in one chosen neighborhood: its refinement error is bounded either by 2supf2\sup|f| times the local variation of α\alpha, or by the local oscillation of ff times the total variation α(b)α(a)\alpha(b)-\alpha(a). The choices in step 2.1 make the sum of all crossing errors below 2ε/32\varepsilon/3. Hence every sufficiently fine tagged sum lies within ε\varepsilon of II.

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 α\alpha 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]Rf,\alpha:[a,b]\to\mathbb R, at most one real number satisfies the mesh-limit condition defining abfdα\int_a^b f\,d\alpha.

Facts & Assumptions

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

[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+vu+v|u+v|\le|u|+|v| and u=0|u|=0 exactly when u=0u=0 (The triangle inequality, Basic properties of the absolute value).

Proof

technique · direct
1.1

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

L1L2L3choose
2.1

For its sum SS, IJIS+SJ<ε|I-J|\le|I-S|+|S-J|<\varepsilon. Since this holds for every ε>0\varepsilon>0, IJ=0|I-J|=0 and I=JI=J. The singleton interval has only the prescribed value 00.

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

Refinement and tag-change estimates for Stieltjes sums

Statement

Let α\alpha have bounded variation on [a,b][a,b], let P=(n,t)P=(n,t) be a partition, and let QQ refine PP. If the oscillation of ff on [ti,ti+1][t_i,t_{i+1}] is at most ωi\omega_i, then any tagged sum on PP and any tagged sum on QQ satisfy

SQSPi<nωiVar[ti,ti+1](α).|S_Q-S_P|\le\sum_{i<n}\omega_i\operatorname{Var}_{[t_i,t_{i+1}]}(\alpha).

In particular, if every ωiω\omega_i\le\omega, the bound is ωVar[a,b](α)\omega\operatorname{Var}_{[a,b]}(\alpha). Two tagged sums on arbitrary partitions whose intervals all have oscillation at most ω\omega differ by at most 2ωVar[a,b](α)2\omega\operatorname{Var}_{[a,b]}(\alpha).

Facts & Assumptions

Given: Functions f,α:[a,b]Rf,\alpha:[a,b]\to\mathbb R, a partition PP, a refinement QQ, 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][t_i,t_{i+1}], the refined integrator increments telescope to α(ti+1)α(ti)\alpha(t_{i+1})-\alpha(t_i). Subtract the coarse term by assigning its tag value to every refined increment. Each coefficient difference has absolute value at most ωi\omega_i, so the absolute difference contributed by that block is at most ωi\omega_i times the sum of the absolute refined increments, hence at most ωiVar[ti,ti+1](α)\omega_i\operatorname{Var}_{[t_i,t_{i+1}]}(\alpha).

L1L2L3L4L5
2.1

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

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 22.

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]Rf:[a,b]\to\mathbb R is continuous and α:[a,b]R\alpha:[a,b]\to\mathbb R has bounded variation, then abfdα\int_a^b f\,d\alpha exists.

Facts & Assumptions

Given: A continuous f:[a,b]Rf:[a,b]\to\mathbb R and a BV function α:[a,b]R\alpha:[a,b]\to\mathbb 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](α)V=\operatorname{Var}_{[a,b]}(\alpha). If V=0V=0, every integrator increment is 00, so every Stieltjes sum is 00 and the integral exists. Assume V>0V>0. Given ε>0\varepsilon>0, uniform continuity gives δ>0\delta>0 such that xy<δ|x-y|<\delta implies f(x)f(y)<ε/(4V)|f(x)-f(y)|<\varepsilon/(4V). Any two tagged partitions of mesh below δ\delta have all local oscillations below ε/(4V)\varepsilon/(4V); comparing both with their common refinement through [L1] makes their sums differ by less than ε\varepsilon.

L1L3L4L6
2.1

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

step 1.1L5L6choose
3.1

Given ε>0\varepsilon>0, choose the threshold in step 1.1 for error ε/2\varepsilon/2 and then a uniform sum sns_n beyond that threshold with snI<ε/2|s_n-I|<\varepsilon/2. Every arbitrary tagged sum with sufficiently small mesh differs from sns_n by less than ε/2\varepsilon/2, hence is within ε\varepsilon of II. 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 abfdα\int_a^b f\,d\alpha exists, α\alpha has bounded variation, and f(x)M|f(x)|\le M on [a,b][a,b]. Then

abfdαMVar[a,b](α).\left|\int_a^b f\,d\alpha\right|\le M\operatorname{Var}_{[a,b]}(\alpha).

Facts & Assumptions

Given: An existing Stieltjes integral, a BV integrator α\alpha, and a bound fM|f|\le 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 uiui|\sum u_i|\le\sum|u_i| (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<nf(ξi)ΔiαMi<nΔiαMVar[a,b](α)|S(f,\alpha;P,\xi)|\le\sum_{i<n}|f(\xi_i)||\Delta_i\alpha|\le M\sum_{i<n}|\Delta_i\alpha|\le M\operatorname{Var}_{[a,b]}(\alpha).

L2L3
2.1

Take a sequence of tagged partitions with mesh tending to 00. 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α=uabfdα+vabgdα,\int_a^b(uf+vg)\,d\alpha=u\int_a^b f\,d\alpha+v\int_a^b g\,d\alpha, abfd(uα+vβ)=uabfdα+vabfdβ.\int_a^b f\,d(u\alpha+v\beta)=u\int_a^b f\,d\alpha+v\int_a^b f\,d\beta.

Let acba\le c\le b, suppose α\alpha has bounded variation, and suppose ff is continuous at cc. Then integrability on [a,b][a,b] is equivalent to integrability on both [a,c][a,c] and [c,b][c,b], and

abfdα=acfdα+cbfdα.\int_a^b f\,d\alpha=\int_a^c f\,d\alpha+\int_c^b f\,d\alpha.

Facts & Assumptions

Given: Functions for which the displayed integrals are defined, scalars u,vu,v, and for additivity a BV integrator α\alpha and a cut cc where ff 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]
[L7]

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

Proof

technique · direct
1.1

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

L1L2L4
1.2

For a partition containing cc, its Stieltjes sum splits exactly into the sums on the two subintervals. Inserting cc into a fine partition changes only the interval containing cc. Direct subtraction bounds the difference, for any choices of the old and new tags, by the oscillation of ff near cc times the sum of the relevant absolute increments of α\alpha, hence by that oscillation times Var[a,b](α)\operatorname{Var}_{[a,b]}(\alpha). Continuity of ff at cc 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][a,c] and splice each with the same sufficiently fine sum on [c,b][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 abfdα\int_a^b f\,d\alpha exists if and only if abαdf\int_a^b\alpha\,df exists. When either exists,

abfdα+abαdf=f(b)α(b)f(a)α(a).\int_a^b f\,d\alpha+\int_a^b\alpha\,df=f(b)\alpha(b)-f(a)\alpha(a).

Facts & Assumptions

Proof

technique · direct
1.1

For a partition P=(n,t)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)\sum_{i<n}f(t_i)(\alpha(t_{i+1})-\alpha(t_i))+\sum_{i<n}\alpha(t_{i+1})(f(t_{i+1})-f(t_i))=f(b)\alpha(b)-f(a)\alpha(a).

L3L4
2.1

Suppose fdα\int f\,d\alpha exists and consider an arbitrary tagged sum Sf(α;P,η)S_f(\alpha;P,\eta). Refine each [ti,ti+1][t_i,t_{i+1}] by inserting its tag ηi\eta_i. On [ti,ηi][t_i,\eta_i] tag the complementary fdαf\,d\alpha sum at tit_i, and on [ηi,ti+1][\eta_i,t_{i+1}] tag it at ti+1t_{i+1}. Direct expansion on the iith 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).\alpha(\eta_i)(f(t_{i+1})-f(t_i))+f(t_i)(\alpha(\eta_i)-\alpha(t_i))+f(t_{i+1})(\alpha(t_{i+1})-\alpha(\eta_i))=f(t_{i+1})\alpha(t_{i+1})-f(t_i)\alpha(t_i). The refined mesh does not exceed P\lVert P\rVert, so the complementary sums converge to fdα\int f\,d\alpha. Telescoping the displayed identities forces every fine tagged sum for αdf\int\alpha\,df to converge to the endpoint product minus that integral.

3.1

Exchanging ff and α\alpha 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]Rf:[a,b]\to\mathbb R has bounded variation and α:[a,b]R\alpha:[a,b]\to\mathbb R is continuous, then abfdα\int_a^b f\,d\alpha exists.

Facts & Assumptions

Given: A BV function ff and a continuous function α\alpha on [a,b][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\int\alpha\,df is equivalent to existence of fdα\int f\,d\alpha (Riemann–Stieltjes integration by parts).

Proof

technique · direct
1.1

Since α\alpha is continuous and ff is BV, [L1] gives the integral abαdf\int_a^b\alpha\,df.

L1L3
2.1

Integration by parts [L2] then gives existence of abfdα\int_a^b f\,d\alpha and its value f(b)α(b)f(a)α(a)abαdff(b)\alpha(b)-f(a)\alpha(a)-\int_a^b\alpha\,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]Rf:[a,b]\to\mathbb R be bounded and have only finitely many discontinuities. If α:[a,b]R\alpha:[a,b]\to\mathbb R is continuous and has bounded variation, then abfdα\int_a^b f\,d\alpha exists.

Facts & Assumptions

Given: A bounded ff with finite discontinuity set DD, and a continuous BV integrator α\alpha on [a,b][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<ba<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=ba=b the integral is 00 by the definition of the Riemann-Stieltjes integral on a singleton interval and there is nothing to prove, so assume a<ba<b, which is the standing hypothesis of [L3].

givenL3
1.2

First suppose that α\alpha is continuous and nondecreasing. Write fM|f|\le M. Given ε>0\varepsilon>0, [L6] and finiteness of DD allow pairwise disjoint closed intervals IxI_x about the points xDx\in D whose total α\alpha-increment is less than ε/(4M+1)\varepsilon/(4M+1).

L6
2.1

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

step 1.2L3L4
3.1

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

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\alpha:[a,b]\to\mathbb R is nondecreasing, ff is bounded and Riemann–Stieltjes integrable with respect to α\alpha, and ϕ\phi is continuous on a compact interval containing f([a,b])f([a,b]). Then ϕf\phi\circ f is Riemann–Stieltjes integrable with respect to α\alpha.

Facts & Assumptions

Given: A nondecreasing α\alpha, a bounded fR(α)f\in R(\alpha), and a continuous ϕ\phi on a compact interval containing the range of ff.

[L1]

For a<ba<b, bounded ff and nondecreasing α\alpha, integrability in the mesh sense is equivalent to the conjunction of two conditions: ff is continuous at every discontinuity of α\alpha, and for every ε>0\varepsilon>0 some partition has i<nωi(f)Δiα<ε\sum_{i<n}\omega_i(f)\Delta_i\alpha<\varepsilon (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 KK with ϕK|\phi|\le K. Given ε>0\varepsilon>0, uniform continuity supplies η>0\eta>0 such that uv<η|u-v|<\eta implies ϕ(u)ϕ(v)<ε/(2(1+α(b)α(a)))|\phi(u)-\phi(v)|<\varepsilon/(2(1+\alpha(b)-\alpha(a))).

L2
2.1

By [L1], choose a partition PP for which IoscI(f)ΔIα<ηε/(4K+1)\sum_I\operatorname{osc}_I(f)\,\Delta_I\alpha<\eta\varepsilon/(4K+1). Split its intervals into those with oscI(f)<η\operatorname{osc}_I(f)<\eta and the rest. The first class contributes less than ε/2\varepsilon/2 to the weighted oscillation sum of ϕf\phi\circ f. In the second class, oscI(ϕf)2K\operatorname{osc}_I(\phi\circ f)\le2K, while ηΔIαIoscI(f)ΔIα\eta\sum\Delta_I\alpha\le\sum_I\operatorname{osc}_I(f)\Delta_I\alpha; hence it too contributes less than ε/2\varepsilon/2.

step 1.1L1L2L3
3.1

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

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]Rf:[a,b]\to\mathbb R has bounded variation, then for every ε>0\varepsilon>0 there is a finite step function ss with fs<ε\lVert f-s\rVert_\infty<\varepsilon. Endpoint values of ss may be prescribed to equal those of ff.

More precisely, if E[a,b]E\subseteq[a,b] is at most countable and ff is continuous at every point of EE, the interior breakpoints of ss may all be chosen outside EE.

Facts & Assumptions

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

[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\mathbb{R} is uncountable).

Proof

technique · direct
1.1

Fix η>0\eta>0. Let AA be the set of x[a,b]x\in[a,b] for which there is a finite chain a=x0<<xm=xa=x_0<\cdots<x_m=x such that the oscillation of ff on every open interval (xj1,xj)(x_{j-1},x_j) is below η\eta. The set contains aa and is bounded above by bb, so c:=supAc:=\sup A exists by [L2].

L2construct
2.1

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

step 1.1L1L2
3.1

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

step 2.1choose
4.1

Only finitely many interior breakpoints lie in EE. Around each such breakpoint cc, continuity of ff gives a small two-sided interval, disjoint from the corresponding intervals for the other breakpoints, on which the oscillation is below ε/4\varepsilon/4. By [L3] choose a replacement point outside EE 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\varepsilon/4, and a component can be enlarged at both ends, so its new oscillation is at most ε/4+ε/4+ε/4<ε\varepsilon/4+\varepsilon/4+\varepsilon/4<\varepsilon, 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 EE.

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]Rf,\alpha:[a,b]\to\mathbb R have bounded variation. If no point is a discontinuity of both functions, then abfdα\int_a^b f\,d\alpha exists.

Facts & Assumptions

Given: BV functions ff and α\alpha with disjoint discontinuity sets.

[L1]

The discontinuity set DαD_\alpha is at most countable (A bounded-variation function has at most countably many discontinuities, all of the first kind).

[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)fgVar(α)|S_\alpha(f)-S_\alpha(g)|\le\lVert f-g\rVert_\infty\operatorname{Var}(\alpha) (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 α\alpha 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, ff is continuous at every point of DαD_\alpha. For each n1n\ge1, [L1] and [L2] provide a finite step function sns_n with fsn<1/n\lVert f-s_n\rVert_\infty<1/n and all interior breakpoints outside DαD_\alpha. If an endpoint belongs to DαD_\alpha, continuity of ff there permits the value on the adjacent open component to be changed to ff at that endpoint while retaining the same bound after beginning with tolerance 1/(2n)1/(2n). Thus sns_n is continuous at every point of DαD_\alpha.

L1L2
2.1

Each sns_n is integrable with respect to α\alpha. Its finitely many discontinuities are points where α\alpha is continuous by step 1.1. By [L5], choose disjoint neighborhoods of those points whose total local variation is small. Outside them sns_n is locally constant, while inside them [L5] bounds differences between fine sums by the small local variation times the finite oscillation of sns_n. 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\varepsilon>0, choose nn so that 2Var[a,b](α)/n<ε/22\operatorname{Var}_{[a,b]}(\alpha)/n<\varepsilon/2 (the zero-variation case is immediate), and then choose a mesh bound making any two sums of sns_n differ by less than ε/2\varepsilon/2. By [L3], replacing sns_n by ff in either sum changes it by at most Var(α)/n\operatorname{Var}(\alpha)/n. Hence all sufficiently fine sums of ff 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 aba\le b. For the identity function id(x)=x\operatorname{id}(x)=x, a bounded f:[a,b]Rf:[a,b]\to\mathbb R is Riemann–Stieltjes integrable with respect to id\operatorname{id} exactly when it is Riemann integrable, and then

abfdid=abf(x)dx.\int_a^b f\,d\operatorname{id}=\int_a^b f(x)\,dx.

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

Facts & Assumptions

Proof

technique · direct
1.1

When a<ba<b and α=id\alpha=\operatorname{id}, every increment α(ti+1)α(ti)\alpha(t_{i+1})-\alpha(t_i) equals ti+1tit_{i+1}-t_i. 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=ba=b both conventions give zero, and [L4] handles a>ba>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]Rf:[a,b]\to\mathbb R be Riemann integrable. Suppose α\alpha is continuous on [a,b][a,b], differentiable on (a,b)(a,b), and α\alpha' extends continuously to [a,b][a,b]. Then ff is Riemann–Stieltjes integrable with respect to α\alpha and

abfdα=abf(x)α(x)dx.\int_a^b f\,d\alpha=\int_a^b f(x)\alpha'(x)\,dx.

Facts & Assumptions

Given: A Riemann-integrable ff and an integrator α\alpha with continuous derivative on the compact interval.

Proof

technique · direct
1.1

A Riemann-integrable function is bounded; choose MM with fM|f|\le M. For each partition interval, [L1] gives ηi(ti,ti+1)\eta_i\in(t_i,t_{i+1}) such that Δiα=α(ηi)Δit\Delta_i\alpha=\alpha'(\eta_i)\Delta_i t. Hence [L1] Sα(f;P,ξ)if(ξi)α(ξi)Δit=if(ξi)(α(ηi)α(ξi))Δit.S_\alpha(f;P,\xi)-\sum_i f(\xi_i)\alpha'(\xi_i)\Delta_i t=\sum_i f(\xi_i)(\alpha'(\eta_i)-\alpha'(\xi_i))\Delta_i t.

2.1

By [L2], the absolute value of the right side is at most M(ba)ωα(P)M(b-a)\omega_{\alpha'}(\lVert P\rVert), which tends to zero with the mesh. By [L3] and [L4], the second sum in step 1.1 tends to abfα\int_a^b f\alpha'. 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<ba<b. Write I:RRI:\mathbb R\to\mathbb R for the unit step I(t)=0I(t)=0 for t0t\le0 and I(t)=1I(t)=1 for t>0t>0. Let (sn)nN(s_n)_{n\in\mathbb N} be points of the open interval (a,b)(a,b), and let (cn)nN(c_n)_{n\in\mathbb N} be reals with cn0c_n\ge0 and cn\sum c_n convergent.

Then for every x[a,b]x\in[a,b] the series ncnI(xsn)\sum_n c_nI(x-s_n) converges, so

α(x):=n=0cnI(xsn)\alpha(x):=\sum_{n=0}^{\infty}c_nI(x-s_n)

defines a nondecreasing α:[a,b]R\alpha:[a,b]\to\mathbb R, which therefore has bounded variation.

For every continuous f:[a,b]Rf:[a,b]\to\mathbb R the integral abfdα\int_a^b f\,d\alpha exists, the series ncnf(sn)\sum_n c_nf(s_n) converges absolutely, and

abfdα=n=0cnf(sn).\int_a^b f\,d\alpha=\sum_{n=0}^{\infty}c_nf(s_n).

The points sns_n are not required to be distinct, and any cnc_n may be zero.

Facts & Assumptions

Given: Reals a<ba<b, points sn(a,b)s_n\in(a,b), reals cn0c_n\ge0 with cn\sum c_n convergent, and a continuous f:[a,b]Rf:[a,b]\to\mathbb 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][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<ng(ti+1)g(ti)\sum_{i<n}|g(t_{i+1})-g(t_i)| (Bounded variation and total variation on an interval).

[L3]

If f:[a,b]Rf:[a,b]\to\mathbb R is continuous and α:[a,b]R\alpha:[a,b]\to\mathbb R has bounded variation, then abfdα\int_a^b f\,d\alpha exists (A continuous integrand is Riemann–Stieltjes integrable against every bounded-variation integrator).

[L4]

Whenever the integrals on the right exist, abfd(uα+vβ)=uabfdα+vabfdβ\int_a^b f\,d(u\alpha+v\beta)=u\int_a^b f\,d\alpha+v\int_a^b f\,d\beta (Linearity and interval additivity of the Riemann–Stieltjes integral).

[L5]

If abfdα\int_a^b f\,d\alpha exists, α\alpha has bounded variation, and f(x)M|f(x)|\le M on [a,b][a,b], then abfdαMVar[a,b](α)\bigl|\int_a^b f\,d\alpha\bigr|\le M\operatorname{Var}_{[a,b]}(\alpha) (The total-variation bound for a Riemann–Stieltjes integral).

[L7]

The Riemann–Stieltjes sum of a tagged partition (P,ξ)(P,\xi) is S(f,α;P,ξ)=i<nf(ξi)(α(ti+1)α(ti))S(f,\alpha;P,\xi)=\sum_{i<n}f(\xi_i)(\alpha(t_{i+1})-\alpha(t_i)), and abfdα=I\int_a^b f\,d\alpha=I means that for every ε>0\varepsilon>0 some δ>0\delta>0 makes S(f,α;P,ξ)I<ε|S(f,\alpha;P,\xi)-I|<\varepsilon for every tagged partition of mesh below δ\delta (Riemann–Stieltjes sums, upper and lower sums, and the Riemann–Stieltjes integral, Partition of [a,b][a,b] as a finite strictly increasing list a=t0<t1<<tn=ba = t_0 < t_1 < \dots < t_n = b, its subintervals and their lengths, its mesh, refinement, and the common refinement of two partitions, Tagged partitions of [a,b][a,b], with a tag ξi\xi_i in each subinterval, and the Riemann sum S(f,P,ξ)=if(ξi)ΔiS(f,P,\xi) = \sum_i f(\xi_i)\,\Delta_i).

[L9]

Continuity of ff at ss means that for every ε>0\varepsilon>0 there is δ>0\delta>0 with f(x)f(s)<ε|f(x)-f(s)|<\varepsilon whenever xx lies in the domain and xs<δ|x-s|<\delta (Continuity of f:ARf : A \to \mathbb{R} at a point of AA and on AA: the ε\varepsilon-δ\delta condition, its agreement with limxcf(x)=f(c)\lim_{x \to c} f(x) = f(c) at a limit point, and continuity at an isolated point); convergence of a real sequence is the usual ε\varepsilon–threshold condition (Limits and Cauchy sequences of reals).

Proof

technique · direct
1.1

Fix x[a,b]x\in[a,b]. Each term cnI(xsn)c_nI(x-s_n) lies in [0,cn][0,c_n], so the partial sums of ncnI(xsn)\sum_n c_nI(x-s_n) are nondecreasing and bounded above by ncn\sum_n c_n. By [L1] the series converges and α(x)\alpha(x) is defined, with 0α(x)ncn0\le\alpha(x)\le\sum_n c_n.

givenL1
1.2

Fix s(a,b)s\in(a,b) and put σ(x):=I(xs)\sigma(x):=I(x-s) on [a,b][a,b]. Then σ\sigma is nondecreasing, hence of bounded variation by [L2]. Let ε>0\varepsilon>0 and take δ>0\delta>0 from [L9] for ff at ss, so that f(x)f(s)<ε|f(x)-f(s)|<\varepsilon whenever xs<δ|x-s|<\delta. Let (P,ξ)(P,\xi) be a tagged partition of mesh below δ\delta. The increment σ(ti+1)σ(ti)\sigma(t_{i+1})-\sigma(t_i) is 11 when tis<ti+1t_i\le s<t_{i+1} and 00 otherwise, and because as<ba\le s<b exactly one index ii satisfies tis<ti+1t_i\le s<t_{i+1}. Hence S(f,σ;P,ξ)=f(ξi)S(f,\sigma;P,\xi)=f(\xi_i) for that index, and tiξiti+1t_i\le\xi_i\le t_{i+1} with tis<ti+1t_i\le s<t_{i+1} give ξisti+1ti<δ|\xi_i-s|\le t_{i+1}-t_i<\delta, so S(f,σ;P,ξ)f(s)<ε|S(f,\sigma;P,\xi)-f(s)|<\varepsilon. By [L7], abfdσ=f(s)\int_a^b f\,d\sigma=f(s).

givenL2L7L9
2.1

If xyx\le y then I(xsn)I(ysn)I(x-s_n)\le I(y-s_n) for every nn, because II is nondecreasing and xsnysnx-s_n\le y-s_n. Multiplying by cn0c_n\ge0 and summing, every partial sum for xx is at most the corresponding partial sum for yy, so the limits satisfy α(x)α(y)\alpha(x)\le\alpha(y) by [L1]. Thus α\alpha is nondecreasing, and α=α0\alpha=\alpha-0 exhibits it as a difference of two nondecreasing functions, so [L2] gives α\alpha bounded variation.

step 1.1givenL1L2
2.2

For NNN\in\mathbb N set αN(x):=n<NcnI(xsn)\alpha_N(x):=\sum_{n<N}c_nI(x-s_n), 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 abfdαN=n<Ncnf(sn)\int_a^b f\,d\alpha_N=\sum_{n<N}c_nf(s_n).

step 1.2L4
3.1

By [L6] there is M0M\ge0 with f(x)M|f(x)|\le M on [a,b][a,b]. Since 0cnf(sn)Mcn0\le|c_nf(s_n)|\le Mc_n and cn\sum c_n converges, [L8] makes ncnf(sn)\sum_n c_nf(s_n) absolutely convergent, hence convergent. By step 2.1 and [L3] the integral abfdα\int_a^b f\,d\alpha exists.

givenstep 2.1L3L6L8
3.2

Set βN:=ααN\beta_N:=\alpha-\alpha_N. For each xx, βN(x)=nNcnI(xsn)\beta_N(x)=\sum_{n\ge N}c_nI(x-s_n), the tail of the series in step 1.1; the argument of steps 1.1 and 2.1 applies verbatim to it, so βN\beta_N is nondecreasing with bounded variation. Since sn(a,b)s_n\in(a,b) we have I(asn)=0I(a-s_n)=0 and I(bsn)=1I(b-s_n)=1, so βN(a)=0\beta_N(a)=0 and βN(b)=nNcn\beta_N(b)=\sum_{n\ge N}c_n. A nondecreasing function has every partition sum equal to βN(b)βN(a)\beta_N(b)-\beta_N(a), because each increment is nonnegative and the sum telescopes, so [L2] gives Var[a,b](βN)=nNcn\operatorname{Var}_{[a,b]}(\beta_N)=\sum_{n\ge N}c_n.

step 1.1step 2.1givenL1L2
4.1

Both αN\alpha_N and βN\beta_N are of bounded variation, so [L3] makes abfdαN\int_a^b f\,d\alpha_N and abfdβN\int_a^b f\,d\beta_N exist, and α=αN+βN\alpha=\alpha_N+\beta_N with [L4] gives abfdα=abfdαN+abfdβN\int_a^b f\,d\alpha=\int_a^b f\,d\alpha_N+\int_a^b f\,d\beta_N. Using step 2.2 and then [L5] with the bound MM of step 3.1, abfdαn<Ncnf(sn)=abfdβNMnNcn.\Bigl|\int_a^b f\,d\alpha-\sum_{n<N}c_nf(s_n)\Bigr|=\Bigl|\int_a^b f\,d\beta_N\Bigr|\le M\sum_{n\ge N}c_n.

step 2.2step 3.1step 3.2L3L4L5
5.1

Convergence of cn\sum c_n makes its tails nNcn\sum_{n\ge N}c_n tend to 00 as NN increases, so given ε>0\varepsilon>0 the right side of step 4.1 is below ε\varepsilon for all large NN. Hence the partial sums n<Ncnf(sn)\sum_{n<N}c_nf(s_n) converge to abfdα\int_a^b f\,d\alpha, and by step 3.1 that series converges absolutely. By [L1] and [L9] its sum is abfdα\int_a^b f\,d\alpha, 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 aa would be harmless: I(xa)I(x-a) vanishes only at x=ax=a, the increment α(b)α(a)\alpha(b)-\alpha(a) still records the whole weight, and step 2.1 goes through unchanged because its counting argument needs only as<ba\le s<b. A jump at bb genuinely breaks the identity: I(xb)=0I(x-b)=0 for every x[a,b]x\in[a,b], so such a term contributes nothing at all to α\alpha, yet it would contribute cnf(b)c_nf(b) to the right-hand sum. The hypothesis sn(a,b)s_n\in(a,b) excludes that case, and it is the hypothesis Rudin states.

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

Continuity of ff is not decorative. cex-common-jump-prevents-riemann-stieltjes-integrability exhibits an ff and an α\alpha sharing a single jump for which no mesh limit exists, and a single step integrator is exactly the α\alpha 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<dc<d and a<ba<b, and let ϕ:[c,d][a,b]\phi:[c,d]\to[a,b] be a strictly increasing continuous bijection. For functions f,α:[a,b]Rf,\alpha:[a,b]\to\mathbb R, one of the two Riemann–Stieltjes integrals below exists if and only if the other does, and in that case

abfdα=cd(fϕ)d(αϕ).\int_a^b f\,d\alpha=\int_c^d(f\circ\phi)\,d(\alpha\circ\phi).

The nondegeneracy hypotheses are not cosmetic. If c=dc=d and a=ba=b both integrals are 00 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,αf,\alpha 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]\phi:[c,d]\to[a,b] and functions f,αf,\alpha on [a,b][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)Q=(s_j) is a partition of [c,d][c,d] with tags ηj\eta_j, then P=(ϕ(sj))P=(\phi(s_j)) is a partition of [a,b][a,b] with tags ϕ(ηj)\phi(\eta_j). Direct substitution gives [given] Sαϕ(fϕ;Q,η)=Sα(f;P,ϕη).S_{\alpha\circ\phi}(f\circ\phi;Q,\eta)=S_\alpha(f;P,\phi\circ\eta).

2.1

By uniform continuity of ϕ\phi in [L2], arbitrarily fine QQ give arbitrarily fine image partitions PP. 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\phi^{-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,qQ(0,1]p,q\in\mathbb Q\cap(0,1] satisfy p+q>1p+q>1. Suppose f(y)f(x)Kfyxp|f(y)-f(x)|\le K_f|y-x|^p and g(y)g(x)Kgyxq|g(y)-g(x)|\le K_g|y-x|^q on [a,b][a,b]. If DmD_m is the partition into 2m2^m equal intervals and LmL_m is its left-endpoint Stieltjes sum, then

Lm+1LmKfKg(ba)p+q2m(p+q1).|L_{m+1}-L_m|\le K_fK_g(b-a)^{p+q}2^{-m(p+q-1)}.

Put r=p+qr=p+q and Cr:=2r121r.C_r:=\frac{2^r}{1-2^{1-r}}. If RR refines an arbitrary partition PP, then their left-endpoint sums satisfy L(R)L(P)CrKfKg(ba)Pr1.|L(R)-L(P)|\le C_rK_fK_g(b-a)\lVert P\rVert^{r-1}.

Facts & Assumptions

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

[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 vv between adjacent points u<wu<w. The change from the old left-endpoint term to the two new terms is [given] (f(v)f(u))(g(w)g(v))(f(v)-f(u))(g(w)-g(v)) up to sign. Its absolute value is at most KfKg(vu)p(wv)qK_fK_g(v-u)^p(w-v)^q, hence at most KfKg(wu)p+qK_fK_g(w-u)^{p+q} by [L1].

2.1

Passing from DmD_m to Dm+1D_{m+1} inserts one midpoint in each of 2m2^m intervals of length (ba)2m(b-a)2^{-m}. Summing step 1.1 gives the first displayed bound. More generally, if a partition of an interval II has k2k\ge2 subintervals, some interior point has two adjacent lengths whose sum is at most 2I/(k1)2|I|/(k-1): the sum of all such two-interval lengths is at most 2I2|I|. Removing that point therefore changes the left sum by at most KfKg(2I/(k1))rK_fK_g(2|I|/(k-1))^r.

step 1.1L1L3
3.1

Remove the extra points of RR inside a fixed interval II of PP, one at a time, always using step 2.1. The total error is at most 2rKfKgIrj1jr2^rK_fK_g|I|^r\sum_{j\ge1}j^{-r}. Grouping the positive integers into [2m,2m+1)[2^m,2^{m+1}) bounds this series by m02m(r1)=(121r)1\sum_{m\ge0}2^{-m(r-1)}=(1-2^{1-r})^{-1} via [L2]. Thus the error on II is at most CrKfKgIrC_rK_fK_g|I|^r. Summing over IPI\in P and using IrPr1I|I|^r\le\lVert P\rVert^{r-1}|I| proves the refinement estimate. If KfKg=0K_fK_g=0 or a=ba=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,qQ(0,1]p,q\in\mathbb Q\cap(0,1] with p+q>1p+q>1. If f:[a,b]Rf:[a,b]\to\mathbb R is pp-Hölder and g:[a,b]Rg:[a,b]\to\mathbb R is qq-Hölder, then both abfdg\int_a^b f\,dg and abgdf\int_a^b g\,df exist. They satisfy

abfdg+abgdf=f(b)g(b)f(a)g(a).\int_a^b f\,dg+\int_a^b g\,df=f(b)g(b)-f(a)g(a).

Facts & Assumptions

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

[L1]

The Young partition estimate controls refinement errors by a constant times Pp+q1\lVert P\rVert^{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 LmL_m, the first estimate in [L1] and the geometric-tail fact [L5] make (Lm)(L_m) a Cauchy sequence. It therefore converges to some II by [L2].

L1L2L5
2.1

Given a partition PP, compare it and a sufficiently fine dyadic partition DmD_m with their common refinement. The second estimate in [L1] bounds the two refinement errors by a constant times Pr1+Dmr1\lVert P\rVert^{r-1}+\lVert D_m\rVert^{r-1}. Together with LmIL_m\to I, this shows that every sufficiently fine left-endpoint sum is close to II. Replacing a left endpoint tit_i by an arbitrary tag ξi\xi_i changes the iith term by at most KfKgti+1tirK_fK_g|t_{i+1}-t_i|^r; the total is at most KfKg(ba)Pr1K_fK_g(b-a)\lVert P\rVert^{r-1}. Thus every fine tagged sum tends to II, and [L3] gives fdg\int f\,dg. Interchanging ff and gg gives gdf\int g\,df.

step 1.1L1L2L3L4
3.1

On every partition, the right-endpoint sum for fdgf\,dg plus the left-endpoint sum for gdfg\,df telescopes exactly to f(b)g(b)f(a)g(a)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][a,b] with a<ba<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<ba<b is part of the statement and not cosmetic: on [a,a][a,a] the integral is 00 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=ba=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