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.
Two bounded-variation functions with no common discontinuity are Riemann–Stieltjes integrable
Statement
Let have bounded variation. If no point is a discontinuity of both functions, then exists.
Facts & Assumptions
Given: BV functions and with disjoint discontinuity sets.
The discontinuity set is at most countable (A bounded-variation function has at most countably many discontinuities, all of the first kind).
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).
Direct subtraction of two Stieltjes sums and the finite-sum triangle inequality give (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).
Every Cauchy sequence of reals converges (The Cauchy criterion from the least-upper-bound property: in a complete ordered field every Cauchy sequence converges).
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
By the no-common-discontinuity hypothesis, is continuous at every point of . For each , [L1] and [L2] provide a finite step function with and all interior breakpoints outside . If an endpoint belongs to , continuity of there permits the value on the adjacent open component to be changed to at that endpoint while retaining the same bound after beginning with tolerance . Thus is continuous at every point of .
Each 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 is locally constant, while inside them [L5] bounds differences between fine sums by the small local variation times the finite oscillation of . 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.
Given , choose so that (the zero-variation case is immediate), and then choose a mesh bound making any two sums of differ by less than . By [L3], replacing by in either sum changes it by at most . Hence all sufficiently fine sums of 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.
Depends on
- Every bounded-variation function is uniformly approximable by step functions
- A bounded-variation function has at most countably many discontinuities, all of the first kind
- The jumps of a variation function equal the absolute jumps of the original function
- Refinement and tag-change estimates for Stieltjes sums
- 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
- The Cauchy criterion from the least-upper-bound property: in a complete ordered field every Cauchy sequence converges
- Partition of $[a,b]$ as a finite strictly increasing list $a = t_0 < t_1 < \dots < t_n = b$, its subintervals and their lengths, its mesh, refinement, and the common refinement of two partitions
Used by
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 121 results over 20 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.
Sources
- W. Rudin, Principles of Mathematical Analysis, Ch. 6, Theorem 6.10 (standard reference, not scraped)