Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicableaudited 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.

Riemann–Stieltjes sums, upper and lower sums, and the Riemann–Stieltjes integral

Definition

Let a<b, let f,α:[a,b]→R, and let P=(n,t) be a partition (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). A choice of tags ξi∈[ti,ti+1] for i<n makes (P,ξ) a tagged partition as in Tagged partitions of [a,b], with a tag ξi in each subinterval, and the Riemann sum S(f,P,ξ)=∑if(ξi) Δi. Its Riemann-Stieltjes sum is

S(f,α;P,ξ):=∑i<nf(ξi)(α(ti+1)−α(ti)).

The function f is Riemann-Stieltjes integrable with respect to α on [a,b] if there is I∈R such that for every ε>0 there is δ>0 for which every tagged partition with ∥P∥<δ satisfies ∣S(f,α;P,ξ)−I∣<ε. Then I=∫abf dα.

If f is bounded (Lower bound, bounded below, bounded set) and α is nondecreasing (Nondecreasing, increasing (strictly increasing), nonincreasing, decreasing, monotone and strictly monotone real functions on a subset of R, with the dictionary to monotone sequences), put

mi:=inf⁡x∈[ti,ti+1]f(x),Mi:=sup⁡x∈[ti,ti+1]f(x), Lα(f,P):=∑i<nmiΔiα,Uα(f,P):=∑i<nMiΔiα,

where Δiα=α(ti+1)−α(ti)≥0. These are the lower and upper Stieltjes sums. Each subinterval is nonempty and its image under bounded f is bounded above and below, so the suprema exist by Complete ordered field (least-upper-bound property) and the infima by Greatest lower bound (infimum) and Every nonempty set bounded below has an infimum. Finite sums use Finite sums and finite products, by recursion and Laws of finite sums and finite products. On [a,a] the integral is 0; for b<a set ∫abf dα=−∫baf dα, matching The integral with oriented limits: ∫aaf:=0 and ∫baf:=−∫abf.

Depends on

Dependency tree · 2 levels

Sources