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 bounded-variation integrand is Riemann–Stieltjes integrable against every continuous integrator
Statement
If has bounded variation and is continuous, then exists.
Facts & Assumptions
Given: A BV function and a continuous function on .
A continuous integrand is Stieltjes integrable against a BV integrator (A continuous integrand is Riemann–Stieltjes integrable against every bounded-variation integrator).
Existence of is equivalent to existence of (Riemann–Stieltjes integration by parts).
Bounded variation and continuity are those of Bounded variation and total variation on an interval and Continuity of at a point of and on : the - condition, its agreement with at a limit point, and continuity at an isolated point.
Proof
Since is continuous and is BV, [L1] gives the integral .
Integration by parts [L2] then gives existence of and its value .
Depends on
- A continuous integrand is Riemann–Stieltjes integrable against every bounded-variation integrator
- Riemann–Stieltjes integration by parts
- Bounded variation and total variation on an interval
- Continuity of $f : A \to \mathbb{R}$ at a point of $A$ and on $A$: the $\varepsilon$-$\delta$ condition, its agreement with $\lim_{x \to c} f(x) = f(c)$ at a limit point, and continuity at an isolated point
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
25 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
- W. Rudin, Principles of Mathematical Analysis, Ch. 6, Theorem 6.9 (standard reference, not scraped)
- William F. Trench, Introduction to Real Analysis, Exercise 3.2.10 (standard reference, not scraped)