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.
Tagged partitions of , with a tag in each subinterval, and the Riemann sum
Definition
Let be reals and let be a partition of , with subintervals and lengths for (Partition of as a finite strictly increasing list , its subintervals and their lengths, its mesh, refinement, and the common refinement of two partitions).
A tagging of is a sequence (Sequences of reals: bounded, eventually, frequently, tails, subsequences) with
the second clause being the same bookkeeping tail convention that Partition of as a finite strictly increasing list , its subintervals and their lengths, its mesh, refinement, and the common refinement of two partitions uses, so that is a genuine sequence and no index above is ever read. The pair is a tagged partition of , and is the tag of the -th subinterval. The mesh of a tagged partition is the mesh of its underlying partition.
Taggings exist, and no choice is involved in producing one. Setting for and for defines a tagging, since (Intervals of : the nine order-convex forms, nondegeneracy, and length). So every partition carries at least one tagging, exhibited by a formula. What is a selection is choosing a tag in each subinterval subject to a condition, as The Darboux and Riemann definitions agree: a bounded on is Darboux integrable with integral if and only if for every real there is a real such that for every tagged partition of mesh below does; there the family of choices is finite and the selection is a theorem of ZF.
For and a tagged partition the Riemann sum of is
the finite sum of Finite sums and finite products, by recursion, indexed by with . It is a real number, being a finite sum of reals, and it is defined for every , bounded or not: no supremum or infimum of occurs in it.
A Riemann sum lies between the Darboux sums of the same partition
Suppose in addition that is bounded (Lower bound, bounded below, bounded set), so that the Darboux sums of For bounded on and a partition : the infimum and supremum of on the -th subinterval, and the lower and upper Darboux sums and are defined. Then for every tagging of ,
Indeed gives (For bounded on and a partition : the infimum and supremum of on the -th subinterval, and the lower and upper Darboux sums and ), and multiplying by and summing over preserves the two inequalities, by monotonicity of finite sums, clause 4 of Laws of finite sums and finite products, and the order axioms (Ordered field, Complete ordered field (least-upper-bound property)).
This one line is the whole of the easy half of The Darboux and Riemann definitions agree: a bounded on is Darboux integrable with integral if and only if for every real there is a real such that for every tagged partition of mesh below : whatever the tags, a Riemann sum is trapped between the two Darboux sums, so control of is control of every Riemann sum over at once.
Remarks
-
The tags are unconstrained beyond membership. In particular a tag may be an endpoint, two adjacent subintervals may share their tag at the common endpoint, and the tags need not be increasing. The three standard specialisations — left endpoints , right endpoints , midpoints — are all taggings, and each is given by a formula in .
-
Convergence of Riemann sums is a mesh condition, not a sequence condition. The Darboux and Riemann definitions agree: a bounded on is Darboux integrable with integral if and only if for every real there is a real such that for every tagged partition of mesh below quantifies over all tagged partitions of mesh below . Weakening that to a single sequence of tagged partitions whose meshes tend to gives a strictly weaker condition, and the weakening is not harmless: the companion page of this pair exhibits a non-integrable function whose Riemann sums are constant along such a sequence.
-
Why Riemann sums and Darboux sums are both kept. The Darboux sums are canonical functions of and and make suprema and infima available (The lower and upper Darboux integrals of a bounded on as and , Darboux integrability as their equality, and the notation ); the Riemann sums are defined without any completeness of and are what a numerical approximation actually computes. The theorem that the two routes give the same integral is The Darboux and Riemann definitions agree: a bounded on is Darboux integrable with integral if and only if for every real there is a real such that for every tagged partition of mesh below .
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
Finite sums and finite products, by recursion
Laws of finite sums and finite products
Intervals of : the nine order-convex forms, nondegeneracy, and length
Complete ordered field (least-upper-bound property)
Ordered field
Sequences of reals: bounded, eventually, frequently, tails, subsequences
For bounded on and a partition : the infimum and supremum of on the -th subinterval, and the lower and upper Darboux sums and
Lower bound, bounded below, bounded set