Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedprecheck passaudited 2026-08-11
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.

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.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

71 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources