Alphabeta Math
TheoremStatement: AI-adaptedProof: 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.

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

Depends on

Used by

Dependency tree · next 3 levels

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