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 , let , and let be a partition (Partition of as a finite strictly increasing list , its subintervals and their lengths, its mesh, refinement, and the common refinement of two partitions). A choice of tags for makes a tagged partition as in Tagged partitions of , with a tag in each subinterval, and the Riemann sum . Its Riemann-Stieltjes sum is
The function is Riemann-Stieltjes integrable with respect to on if there is such that for every there is for which every tagged partition with satisfies . Then .
If 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 , with the dictionary to monotone sequences), put
where . These are the lower and upper Stieltjes sums. Each subinterval is nonempty and its image under bounded 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 the integral is ; for set , matching The integral with oriented limits: and .
Depends on
Partition of as a finite strictly increasing list , its subintervals and their lengths, its mesh, refinement, and the common refinement of two partitions
Tagged partitions of , with a tag in each subinterval, and the Riemann sum
Finite sums and finite products, by recursion
Laws of finite sums and finite products
Lower bound, bounded below, bounded set
Complete ordered field (least-upper-bound property)
Greatest lower bound (infimum)
Every nonempty set bounded below has an infimum
Nondecreasing, increasing (strictly increasing), nonincreasing, decreasing, monotone and strictly monotone real functions on a subset of , with the dictionary to monotone sequences
Intervals of : the nine order-convex forms, nondegeneracy, and length
The integral with oriented limits: and