Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedSession-authored (Fable 5 assisted)precheck 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 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

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 121 results over 16 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