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.
Lebesgue's criterion for Riemann integrability: a bounded on is Riemann integrable if and only if its set of discontinuities has measure zero
Statement
Throughout, denotes the canonical copies. Natural numbers, integers and rationals are written directly when used in real arithmetic.
Let be reals, let be bounded (Lower bound, bounded below, bounded set) and let
(Continuity of at a point of and on : the - condition, its agreement with at a limit point, and continuity at an isolated point, Discontinuity at a domain point: removable, jump and essential cases, and the first- and second-kind grouping). Then
(The lower and upper Darboux integrals of a bounded on as and , Darboux integrability as their equality, and the notation , Measure zero (a countable cover by intervals of total length below every ) and content zero (a finite such cover)).
Choice cost. Both implications hold in ZF. For the forward implication, the compact oscillation superlevel sets have content zero; their countable union is null by the canonical rational-cover construction in A countable union of compact content-zero subsets of the line is null in ZF. The converse uses a finite covering argument.
"Measure zero" here is the cover condition of Measure zero (a countable cover by intervals of total length below every ) and content zero (a finite such cover), namely that for every there is a sequence of intervals covering of total length at most . No outer measure, no measurable set and no Lebesgue integral is used or needed; the criterion is a statement about interval covers throughout.
Facts & Assumptions
Given: Reals , a bounded , a real with for every , and as in the Statement.
For a partition of : , , , , and appending a point to a partition of gives a partition of whose subintervals are the old ones together with (Partition of as a finite strictly increasing list , its subintervals and their lengths, its mesh, refinement, and the common refinement of two partitions).
Riemann's criterion: a bounded is integrable if and only if for every real there is a partition with (Riemann's criterion: a bounded on is Darboux integrable if and only if for every real there is a partition with ).
Oscillation: for ; for every real and every ; is the infimum of those values over ; and since is bounded every one of these values is a real number in (The oscillation of on a set and the oscillation at a point, both taken in the extended reals, The extended real line , its order, and the arithmetic that is left undefined, The -neighbourhood and the punctured -neighbourhood of a point of ).
is continuous at if and only if ; hence ( is continuous at if and only if , Continuity of at a point of and on : the - condition, its agreement with at a limit point, and continuity at an isolated point).
For every real there is a closed with (For every real the set is the intersection with of a closed subset of ; in particular it is closed in when ).
A subset of is compact exactly when it is closed and bounded; is closed and bounded; an intersection of closed sets is closed; every open interval is an open set (A subset of is compact if and only if it is closed and bounded, Open cover, subcover, compact subset of (every open cover has a finite subcover), and sequentially compact subset, Open subset of (every point has a neighbourhood inside it), closed subset (complement open), and clopen, Arbitrary unions and finite intersections of open subsets of are open, and dually for closed sets, Intervals of : the nine order-convex forms, nondegeneracy, and length, Lower bound, bounded below, bounded set).
has content zero when for every real there are and reals with and ; has measure zero when the same holds with a sequence of intervals and every partial total length at most ; a subset of a null set is null (Measure zero (a countable cover by intervals of total length below every ) and content zero (a finite such cover)).
A set of content zero has measure zero (A set of content zero has measure zero), and for a compact set the two notions coincide (For a compact subset of , measure zero and content zero coincide).
For every real there is a natural with ; for , the natural numbers are nonnegative and their order is preserved in (For every in a complete ordered field there is a natural with , Every complete ordered field is Archimedean, The canonical natural of a field, Canonical naturals are positive and strictly increasing).
In ZF, the union of a sequence of compact content-zero subsets of is null (A countable union of compact content-zero subsets of the line is null in ZF, Sequences of reals: bounded, eventually, frequently, tails, subsequences).
Finite sums: splitting, additivity, scaling, monotonicity in the terms, and telescoping (Finite sums and finite products, by recursion, Laws of finite sums and finite products). Also the interchange of two finite sums, for any doubly indexed family of reals; below it is applied with , since abbreviates . That identity is not one of the six clauses of Laws of finite sums and finite products and is therefore proved here, by induction on with held fixed (The principle of mathematical induction). At each inner sum is by the recursion clause of Finite sums and finite products, by recursion, so the left side is by clause 2 of Laws of finite sums and finite products taken with , while the right side is an empty sum and so is as well. Passing from to , the recursion clause and clause 1 of Laws of finite sums and finite products give , which by the induction hypothesis is , again by the recursion clause.
Every nonempty subset of has a least element (The well-ordering principle); every nonempty subset of bounded above has a supremum (Complete ordered field (least-upper-bound property)).
Ordered-field arithmetic and the absolute value: adding a constant and multiplying by a positive quantity preserve an inequality; the order is total and transitive; an open interval is order-convex (Basic properties of the absolute value, Order is preserved by adding a constant and by adding inequalities, Sign rules for products and monotonicity of multiplication, Ordered field, Complete ordered field (least-upper-bound property), Intervals of : the nine order-convex forms, nondegeneracy, and length). These order-arithmetic facts are stated by their sources for the strict order only; the nonstrict forms used below follow by adjoining the equality case, in which the two sides coincide.
Proof
For a real put . By [L5], for every .
Each has content zero, assuming integrable. Let and be real. By [L3] fix a partition with . Let and put for and otherwise.
The exhaustion of . Put for , a positive real by [L10]. Then . For the inclusion from left to right, let , so by [L5] and is a real by [L4]; if then , and otherwise [L10] gives a natural with , so . For the reverse inclusion, gives , hence by [L5].
The converse; this half of the proof is steps 2.3, 3.2, 4.2, 5.2, 6.2, 7.2, 8.1, 9.1, 10.1, 11.1, 12.1 and 13.1, and its symbols are its own. Assume null and let a real be given. Put and , both positive by [L14]. By step 1.1 and [L8], is null.
For one has : fix ; since is open there is a real with , so and [L4] gives by [L2].
is compact: by [L6] there is a closed with , an intersection of two closed sets, hence closed; and is bounded. So [L7] applies.
Hence for every , the case because both and . Summing and using [L12] and [L2]: , so .
By [L9] applied to the compact null set , it has content zero, so by [L8] there are and reals with and . Put and , an open interval containing , of length . Then , by [L12] and [L10].
is covered by the finite list of closed intervals , , defined by for with , for with , and for : indeed a point of lies in , hence is one of or lies in some , and in the latter case . Its total length is , by splitting the sum at ([L12]).
The family of good intervals. Let be the set of all open intervals with such that either for some , or . Every lies in a member: if then for some by step 4.2, and is itself a member; and if then , so by [L4] some real has , and is a member containing .
As was arbitrary, has content zero by [L8], hence measure zero by [L9]; this used only that is integrable.
Cousin's construction: a partition each of whose subintervals lies in a member of . Let be the set of such that some partition of has every subinterval contained in a member of . is nonempty: by step 5.2 fix with and put , so , and ; the one-subinterval partition of has , so . Also is bounded above by , so exists by [L13] and .
Integrability implies null. Assume integrable. By step 6.1 each is null, and each is compact by [L6] and [L7], so [L11] applies to this sequence of compact content-zero sets. Thus is null by step 2.2.
. By step 5.2 fix with . Since there is with , and . Suppose and choose a real with , possible because and . Then , so , and appending to a partition of witnessing gives one for by [L1]; hence with , which is impossible.
. By step 5.2 fix with . Since there is with and . If there is nothing to prove; otherwise gives , and appending as in step 7.2 puts in . So there is a partition of , with subintervals and lengths for , every subinterval of which lies in a member of .
Good and bad subintervals. Write and . Call good when for some with , and bad otherwise. For a good , , so by [L2] and [L4]. For a bad , step 8.1 supplies a member containing , and it is not of the second kind, so for some .
Bounding the bad lengths. For put and for , otherwise; a bad lies in some by step 9.1. Each consists of consecutive indices, since with gives and .
for each : the sum is when ; otherwise let and let be the least natural with and , which exists by [L13] since , so that by step 10.1. Splitting the sum at and at and discarding the vanishing outer parts, then telescoping ([L12]), gives , using and .
Put for bad and for good . Then pointwise by step 10.1, all terms being nonnegative, so by [L12] and step 11.1, , the last step by step 4.2.
For every , : for good by step 9.1 and , for bad by from [L2] and . Summing over and using [L12], [L1] and step 12.1: .
The real of step 2.3 was arbitrary and step 13.1 produced a partition with , so is integrable by [L3]. With step 7.1 this proves both implications, and the criterion is established; the forward half is steps 1.1, 2.1, 2.2, 3.1, 4.1, 5.1, 6.1 and 7.1, working with , and the converse half is the steps named in step 2.3, working with .
Remarks
-
What the two halves cost. The forward half is a single application of Riemann's criterion for each threshold , plus the countable union; the backward half is where all the work is, and it is entirely a covering argument: the bad set is compact and null, hence of content zero, hence coverable by finitely many open intervals of small total length, and the rest of is chopped up by Cousin's construction into pieces of oscillation below .
-
Why Cousin's construction and not a Lebesgue number. Step 6.2 to step 8.1 build the partition directly from the completeness of : the set of right endpoints reachable by a good partition is nonempty and bounded, and its supremum is shown to be and to be attained. This uses no sequence, no subsequence and no choice, whereas the usual Lebesgue-number argument selects a bad interval for each and then extracts a convergent subsequence, which costs countable choice. This preserves the choice-free proof of the converse; the forward implication also has a choice-free route through canonical rational covers.
-
The superlevel sets, not the discontinuity set, are what is covered. itself is in general not closed, so For a compact subset of , measure zero and content zero coincide does not apply to it; each is closed in (For every real the set is the intersection with of a closed subset of ; in particular it is closed in when ) and bounded, and that is exactly the hypothesis needed. The passage back from the to is step 2.2, and it is where the countable union appears.
-
The exhaustion is derived here, and it is also claim 1 of For the set of points of at which is discontinuous is the intersection with of an subset of , and the set of points at which is continuous is the intersection with of a subset; for the two sets are and outright. When this proof was written that theorem stated only the descriptive form — as the trace on the domain of an subset of — which is not the pointwise identity step 2.2 needs, so the identity was derived inline from is continuous at if and only if and the Archimedean property. The exhaustion has since been stated there as claim 1, precisely because several items were quoting it from a theorem that did not assert it. The inline derivation is retained because it is three lines and keeps this item's choice ledger readable in one place; citing claim 1 instead would be equally correct.
-
Both directions are sharp in the obvious sense. The indicator of the Cantor set is discontinuous on an uncountable null set and is integrable; the indicator of the Smith-Volterra-Cantor set is discontinuous on a nowhere dense set that is not null and is not integrable (FALSE: a bounded function on is Riemann integrable exactly when its set of discontinuities is nowhere dense). So neither cardinality nor category decides integrability; only measure does.
Depends on
Riemann's criterion: a bounded on is Darboux integrable if and only if for every real there is a partition with
The oscillation of on a set and the oscillation at a point, both taken in the extended reals
is continuous at if and only if
For every real the set is the intersection with of a closed subset of ; in particular it is closed in when
Measure zero (a countable cover by intervals of total length below every ) and content zero (a finite such cover)
A countable union of compact content-zero subsets of the line is null in ZF
For a compact subset of , measure zero and content zero coincide
A set of content zero has measure zero
A subset of is compact if and only if it is closed and bounded
Open cover, subcover, compact subset of (every open cover has a finite subcover), and sequentially compact subset
For bounded on and a partition : the infimum and supremum of on the -th subinterval, and the lower and upper Darboux sums and
The lower and upper Darboux integrals of a bounded on as and , Darboux integrability as their equality, and the notation
Partition of as a finite strictly increasing list , its subintervals and their lengths, its mesh, refinement, and the common refinement of two partitions
Laws of finite sums and finite products
Finite sums and finite products, by recursion
For every in a complete ordered field there is a natural with
Every complete ordered field is Archimedean
The canonical natural of a field
Canonical naturals are positive and strictly increasing
Open subset of (every point has a neighbourhood inside it), closed subset (complement open), and clopen
Arbitrary unions and finite intersections of open subsets of are open, and dually for closed sets
The -neighbourhood and the punctured -neighbourhood of a point of
Lower bound, bounded below, bounded set
Intervals of : the nine order-convex forms, nondegeneracy, and length
Continuity of at a point of and on : the - condition, its agreement with at a limit point, and continuity at an isolated point
Discontinuity at a domain point: removable, jump and essential cases, and the first- and second-kind grouping
The extended real line , its order, and the arithmetic that is left undefined
Sequences of reals: bounded, eventually, frequently, tails, subsequences
The well-ordering principle
The principle of mathematical induction
Complete ordered field (least-upper-bound property)
Ordered field
Order is preserved by adding a constant and by adding inequalities
Sign rules for products and monotonicity of multiplication
Basic properties of the absolute value