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.
A bounded function on that is continuous except at finitely many points is Riemann integrable
Statement
Let be reals and let be bounded (Lower bound, bounded below, bounded set). Suppose there are and points such that is continuous (Continuity of at a point of and on : the - condition, its agreement with at a limit point, and continuity at an isolated point) at every point of other than ; that is, every discontinuity of (Discontinuity of at a point of its domain, and its classification: removable discontinuity, jump discontinuity and essential discontinuity, equivalently Rudin's discontinuities of the first and of the second kind) occurs among those listed points. Then is Riemann integrable on (The lower and upper Darboux integrals of a bounded on as and , Darboux integrability as their equality, and the notation ).
For the hypothesis says is continuous on and the conclusion is A continuous function on is Riemann integrable, by Heine-Cantor and Riemann's criterion; the argument below covers that case without a separate treatment. Repetitions in the list are allowed and harmless, and no claim is made that the listed points are discontinuities: the hypothesis is one-sided, so a finite superset of the discontinuity set is enough.
Nothing is said about the kind of the discontinuities. They may be removable, jumps, or essential (Discontinuity of at a point of its domain, and its classification: removable discontinuity, jump discontinuity and essential discontinuity, equivalently Rudin's discontinuities of the first and of the second kind); only their number matters. Boundedness is a genuine hypothesis, since an unbounded function has no Darboux sums at all (For bounded on and a partition : the infimum and supremum of on the -th subinterval, and the lower and upper Darboux sums and ).
Facts & Assumptions
Given: Reals ; a bounded ; a real with for every ; and with points such that is continuous at every with for all .
For a partition of : , , , , no with lies strictly between and , inserting a point does not increase the mesh and adds that point to , and the uniform partition has mesh (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 ).
A closed bounded subset of is compact, and a continuous real function on a compact subset of is uniformly continuous on : for every real there is a real with for all with . This holds for as well, the condition being vacuous there (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, Heine-Cantor in : a continuous real function on a compact subset of is uniformly continuous, proved -natively from sequential compactness, Uniform continuity of : one serving every pair of points of ).
Every open interval is an open set, an arbitrary union of open sets is open, a complement of an open set is closed, an intersection of closed sets is closed, and is closed and bounded (Intervals of : the nine order-convex forms, nondegeneracy, and length, 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).
For the endpoints and are adherent to , so every closed set containing contains (The closure equals the set together with its limit points, equals the set of points every neighbourhood of which meets it, and is the smallest closed superset; a set is closed iff it contains its limit points, Interior, closure, boundary and exterior of a subset of , The -neighbourhood and the punctured -neighbourhood of a point of , Intervals of : the nine order-convex forms, nondegeneracy, and length).
If is continuous at and , then the restriction is continuous at as a function on : the same works, the condition quantifying over fewer points (Continuity of at a point of and on : the - condition, its agreement with at a limit point, and continuity at an isolated point).
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. 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 (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. Note that is fixed throughout the induction and only varies.
Every nonempty subset of has a least element (The well-ordering principle).
For every real there is a natural with ; for and (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).
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; gives (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
Let a real be given. Put and , both positive reals by [L10] and [L11].
Put , an open set by [L5], and , an intersection of two closed sets, hence closed by [L5], and bounded since ; so is compact by [L4].
is continuous at every point of : a point is not any , since and misses . Hence the restriction is continuous on by [L7].
By [L4] applied to on the compact set with the value , fix a real such that for all with .
By [L10] fix a natural with , so that the uniform partition has mesh by [L1] and [L11]. Let be the partition obtained from by inserting, one after another, those of the points and with that lie in . By [L1] each insertion leaves the mesh no larger, so , and contains every one of those points that lies in .
A dichotomy for each subinterval and each . Fix and , and write and . Neither nor lies in the open interval : if such a point lies in it is a member of by step 5.1, hence is some with , and no lies strictly between and by [L1]; and if it lies outside it is outside altogether.
Consequently either , or . Suppose the intersection contains a point and let . If then lies between and , both in the order-convex set , so , contradicting step 6.1; likewise is impossible. So . Then with forces , and symmetrically , that is .
Call bad when for some , and good otherwise. If is good then by step 7.1 the open interval meets no , hence ; since is closed, [L6] gives .
For a good : all lie in and satisfy by [L1] and [L11], so by step 4.1; therefore bounds the set whose supremum is , and by [L2].
Bounding the bad lengths. For put , so that is bad exactly when for some , and put for and otherwise. Each is a set of consecutive indices: if with then and , so .
for each . If the sum is . Otherwise let and let be the least natural with and , which exists by [L9] because ; by step 9.2 then , since an with together with and would put . Splitting the sum at and at and discarding the vanishing outer parts ([L8]) gives by telescoping, and , give and , whence .
Put for bad and for good. Then for every , all terms being nonnegative and a bad lying in some ; so by [L8], , using step 10.1.
For every one has : for good this is step 9.1 together with , and for bad it follows from in [L2] and , together with .
Summing step 12.1 over and using [L8], [L1] and step 11.1: , the last estimate because by step 1.1.
The real of step 1.1 was arbitrary and step 13.1 produced a partition with , so [L3] applies and is Riemann integrable on .
Remarks
-
Where the two budgets go. The of step 13.1 that is spent on the good subintervals buys uniform continuity away from the bad points; the spent on the bad ones buys nothing but their total length, and it is affordable only because there are finitely many of them and may be chosen after is known. Both halves survive verbatim when "finitely many points" is replaced by "a set of measure zero", and that replacement is Lebesgue's criterion for Riemann integrability: a bounded on is Riemann integrable if and only if its set of discontinuities has measure zero.
-
The listing form of the hypothesis is deliberate. Saying "the set of discontinuities is finite" would require a notion of finiteness and a listing theorem to use it; saying "every discontinuity is among " is what the proof consumes and is what every application supplies. The same device is used by Every nonempty finite set of reals has a maximum and a minimum.
-
The result is genuinely weaker than what is true. Thomae's function has infinitely many discontinuities and is integrable, and so is the indicator of the Cantor set, whose discontinuity set is uncountable. What survives is that a finite discontinuity set never obstructs integrability, whatever the function does at those points.
-
Choice. The proof selects nothing from an infinite family; the only countable choice behind it is the single use inside Heine-Cantor in : a continuous real function on a compact subset of is uniformly continuous, proved -natively from sequential compactness, invoked at step 4.1. See What this page costs in choice: Riemann's criterion, the Darboux-Riemann equivalence and integrability of a monotone function are theorems of ZF; integrability of a continuous function inherits the single use of countable choice inside Heine-Cantor; and only the forward half of the Lebesgue criterion spends countable choice, once, at the countable union of null sets.
Depends on
- Riemann's criterion: a bounded $f$ on $[a,b]$ is Darboux integrable if and only if for every real $\varepsilon > 0$ there is a partition $P$ with $U(f,P) - L(f,P) < \varepsilon$
- Continuity of $f : A \to \mathbb{R}$ at a point of $A$ and on $A$: the $\varepsilon$-$\delta$ condition, its agreement with $\lim_{x \to c} f(x) = f(c)$ at a limit point, and continuity at an isolated point
- Discontinuity of $f$ at a point of its domain, and its classification: removable discontinuity, jump discontinuity and essential discontinuity, equivalently Rudin's discontinuities of the first and of the second kind
- Partition of $[a,b]$ as a finite strictly increasing list $a = t_0 < t_1 < \dots < t_n = b$, its subintervals and their lengths, its mesh, refinement, and the common refinement of two partitions
- For bounded $f$ on $[a,b]$ and a partition $P$: the infimum $m_i$ and supremum $M_i$ of $f$ on the $i$-th subinterval, and the lower and upper Darboux sums $L(f,P) = \sum_i m_i \Delta_i$ and $U(f,P) = \sum_i M_i \Delta_i$
- The lower and upper Darboux integrals of a bounded $f$ on $[a,b]$ as $\sup_P L(f,P)$ and $\inf_P U(f,P)$, Darboux integrability as their equality, and the notation $\int_a^b f$
- Laws of finite sums and finite products
- Finite sums and finite products, by recursion
- Lower bound, bounded below, bounded set
- Heine-Cantor in $\mathbb{R}$: a continuous real function on a compact subset of $\mathbb{R}$ is uniformly continuous, proved $\mathbb{R}$-natively from sequential compactness
- Uniform continuity of $f : A \to \mathbb{R}$: one $\delta$ serving every pair of points of $A$
- A subset of $\mathbb{R}$ is compact if and only if it is closed and bounded
- Open cover, subcover, compact subset of $\mathbb{R}$ (every open cover has a finite subcover), and sequentially compact subset
- Open subset of $\mathbb{R}$ (every point has a neighbourhood inside it), closed subset (complement open), and clopen
- Arbitrary unions and finite intersections of open subsets of $\mathbb{R}$ are open, and dually for closed sets
- The closure equals the set together with its limit points, equals the set of points every neighbourhood of which meets it, and is the smallest closed superset; a set is closed iff it contains its limit points
- Interior, closure, boundary and exterior of a subset of $\mathbb{R}$
- The $\varepsilon$-neighbourhood and the punctured $\varepsilon$-neighbourhood of a point of $\mathbb{R}$
- The well-ordering principle
- The principle of mathematical induction
- For every $\varepsilon > 0$ in a complete ordered field there is a natural $n \ge 1$ with $1/n < \varepsilon$
- Every complete ordered field is Archimedean
- The canonical natural $\iota(n) = n \cdot 1_F$ of a field
- Canonical naturals are positive and strictly increasing
- Intervals of $\mathbb{R}$: the nine order-convex forms, nondegeneracy, and length
- Basic properties of the absolute value
- 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
Used by
- Shrinking rectangles converge pointwise to zero while every integral equals one Counterexample
- The sign function is Riemann integrable on [-1,1] and has no primitive there Counterexample
- FALSE: a pointwise limit of a sequence of Riemann integrable functions on [a,b] is Riemann integrable False statement
- FALSE: for every integrable f on [a,b], the integral function F(x)=∫ₐˣ f satisfies F' = f on [a,b] False statement
- What this page costs in choice: Riemann's criterion, the Darboux-Riemann equivalence and integrability of a monotone function are theorems of ZF; integrability of a continuous function inherits the single use of countable choice inside Heine-Cantor; and only the forward half of the Lebesgue criterion spends countable choice, once, at the countable union of null sets Remark
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 139 results over 23 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
- Riemann integral (Wikipedia) (standard reference, not scraped)
- W. Rudin, Principles of Mathematical Analysis, 3rd ed., Ch. 6 (standard reference, not scraped)
- Functions with finitely many discontinuities (University of Pennsylvania) (standard reference, not scraped)