Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passverified 2026-08-27 (gpt-5)
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 [a,b] that is continuous except at finitely many points is Riemann integrable

Statement

Let a<b be reals and let f:[a,b]→R be bounded (Lower bound, bounded below, bounded set). Suppose there are r∈N and points d0,…,dr−1∈[a,b] such that f is continuous (Continuity of f:A→R at a point of A and on A: the ε-δ condition, its agreement with lim⁡x→cf(x)=f(c) at a limit point, and continuity at an isolated point) at every point of [a,b] other than d0,…,dr−1; that is, every discontinuity of f (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) occurs among those r listed points. Then f is Riemann integrable on [a,b] (The lower and upper Darboux integrals of a bounded f on [a,b] as sup⁡PL(f,P) and inf⁡PU(f,P), Darboux integrability as their equality, and the notation ∫abf).

For r=0 the hypothesis says f is continuous on [a,b], so this reduces to the usual continuous-case integrability statement; 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 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); only their number matters. Boundedness is a genuine hypothesis, since an unbounded function has no Darboux sums at all (For bounded f on [a,b] and a partition P: the infimum mi and supremum Mi of f on the i-th subinterval, and the lower and upper Darboux sums L(f,P)=∑imiΔi and U(f,P)=∑iMiΔi).

Facts & Assumptions

Given: Reals a<b; a bounded f:[a,b]→R; a real M+>0 with ∣f(x)∣≤M+ for every x∈[a,b]; and r∈N with points d0,…,dr−1∈[a,b] such that f is continuous at every x∈[a,b] with x≠dk for all k<r.

[L1]

For a partition P=(n,t) of [a,b]: n≥1, Δi=ti+1−ti>0, ∑i<nΔi=b−a, Δi≤∥P∥, no tj with j≤n lies strictly between ti and ti+1, inserting a point does not increase the mesh and adds that point to pts⁡(P), and the uniform partition UN has mesh (b−a)/ι(N) (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).

[L2]

U(f,P)−L(f,P)=∑i<n(Mi−mi)Δi, Mi−mi=sup⁡{∣f(x)−f(y)∣:x,y∈Ii}, and 0≤Mi−mi≤2M+ (For bounded f on [a,b] and a partition P: the infimum mi and supremum Mi of f on the i-th subinterval, and the lower and upper Darboux sums L(f,P)=∑imiΔi and U(f,P)=∑iMiΔi).

[L3]

Riemann's criterion: a bounded f is integrable if and only if for every real ε>0 there is a partition P with U(f,P)−L(f,P)<ε (Riemann's criterion: a bounded f on [a,b] is Darboux integrable if and only if for every real ε>0 there is a partition P with U(f,P)−L(f,P)<ε).

[L4]

A closed bounded subset of R is compact, and a continuous real function on a compact subset K of R is uniformly continuous on K: for every real η>0 there is a real δ>0 with ∣g(x)−g(y)∣<η for all x,y∈K with ∣x−y∣<δ. This holds for K=∅ as well, the condition being vacuous there (A subset of R is compact if and only if it is closed and bounded, Open cover, subcover, compact subset of R (every open cover has a finite subcover), and sequentially compact subset, Heine-Cantor in R: a continuous real function on a compact subset of R is uniformly continuous, proved R-natively from sequential compactness, Uniform continuity of f:A→R: one δ serving every pair of points of A).

[L7]

If g:A→R is continuous at c∈A and c∈B⊆A, then the restriction g∣B is continuous at c as a function on B: the same δ works, the condition quantifying over fewer points (Continuity of f:A→R at a point of A and on A: the ε-δ condition, its agreement with lim⁡x→cf(x)=f(c) at a limit point, and continuity at an isolated point).

[L8]

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, ∑i<n∑k<rci,k=∑k<r∑i<nci,k 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 r (The principle of mathematical induction). At r=0 each inner sum ∑k<0ci,k is 0 by the recursion clause of Finite sums and finite products, by recursion, so the left side is ∑i<n0=0 by clause 2 of Laws of finite sums and finite products taken with λ=0, while the right side is an empty sum and so is 0 as well. Passing from r to r+1, the recursion clause and clause 1 of Laws of finite sums and finite products give ∑i<n∑k<r+1ci,k=∑i<n(∑k<rci,k+ci,r)=∑i<n∑k<rci,k+∑i<nci,r, which by the induction hypothesis is ∑k<r∑i<nci,k+∑i<nci,r=∑k<r+1∑i<nci,k, again by the recursion clause. Note that n is fixed throughout the induction and only r varies.

[L9]

Every nonempty subset of N has a least element (The well-ordering principle).

[L11]

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; x,y∈[c,d] gives ∣x−y∣≤d−c (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 R: 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

technique · direct
1.1

Let a real ε>0 be given. Put θ:=ε⋅(4(b−a))−1 and η:=ε⋅(16 M+(ι(r)+1))−1, both positive reals by [L10] and [L11].

givenL10L11
2.1

Put V:=⋃k<r (dk−η, dk+η), an open set by [L5], and K:=[a,b]∖V=[a,b]∩(R∖V), an intersection of two closed sets, hence closed by [L5], and bounded since K⊆[a,b]; so K is compact by [L4].

step 1.1L4L5construct
3.1

f is continuous at every point of K: a point x∈K is not any dk, since dk∈(dk−η,dk+η)⊆V and K misses V. Hence the restriction f∣K is continuous on K by [L7].

step 2.1givenL7L11
4.1

By [L4] applied to f∣K on the compact set K with the value θ, fix a real δ>0 such that ∣f(x)−f(y)∣<θ for all x,y∈K with ∣x−y∣<δ.

step 2.1step 3.1L4choose
5.1

By [L10] fix a natural N≥1 with 1/ι(N)<δ⋅(b−a)−1, so that the uniform partition UN has mesh (b−a)/ι(N)<δ by [L1] and [L11]. Let P=(n,t) be the partition obtained from UN by inserting, one after another, those of the 2r points dk−η and dk+η with k<r that lie in [a,b]. By [L1] each insertion leaves the mesh no larger, so ∥P∥<δ, and pts⁡(P) contains every one of those points that lies in [a,b].

step 4.1L1L10L11chooseconstruct
6.1

A dichotomy for each subinterval and each k. Fix i<n and k<r, and write c−:=dk−η and c+:=dk+η. Neither c− nor c+ lies in the open interval (ti,ti+1): if such a point lies in [a,b] it is a member of pts⁡(P) by step 5.1, hence is some tj with j≤n, and no tj lies strictly between ti and ti+1 by [L1]; and if it lies outside [a,b] it is outside [ti,ti+1] altogether.

step 5.1L1L11
7.1

Consequently either (ti,ti+1)∩(c−,c+)=∅, or Ii⊆[c−,c+]. Suppose the intersection contains a point z and let w∈(ti,ti+1). If w≤c− then c− lies between w and z, both in the order-convex set (ti,ti+1), so c−∈(ti,ti+1), contradicting step 6.1; likewise w≥c+ is impossible. So (ti,ti+1)⊆(c−,c+). Then c−<z<ti+1 with c−∉(ti,ti+1) forces c−≤ti, and symmetrically c+≥ti+1, that is Ii⊆[c−,c+].

step 6.1L11given
8.1

Call i<n bad when Ii⊆[dk−η,dk+η] for some k<r, and good otherwise. If i is good then by step 7.1 the open interval (ti,ti+1) meets no (dk−η,dk+η), hence (ti,ti+1)⊆K; since K is closed, [L6] gives Ii=[ti,ti+1]⊆K.

step 2.1step 7.1L6
9.1

For a good i: all x,y∈Ii lie in K and satisfy ∣x−y∣≤Δi≤∥P∥<δ by [L1] and [L11], so ∣f(x)−f(y)∣<θ by step 4.1; therefore θ bounds the set whose supremum is Mi−mi, and Mi−mi≤θ by [L2].

step 4.1step 5.1step 8.1L1L2L11
9.2

Bounding the bad lengths. For k<r put Jk:={ i<n:dk−η≤ti and ti+1≤dk+η }, so that i is bad exactly when i∈Jk for some k<r, and put hik:=Δi for i∈Jk and hik:=0 otherwise. Each Jk is a set of consecutive indices: if i<i′<i′′ with i,i′′∈Jk then dk−η≤ti≤ti′ and ti′+1≤ti′′+1≤dk+η, so i′∈Jk.

step 8.1L1L11construct
10.1

∑i<nhik≤2η for each k<r. If Jk=∅ the sum is 0. Otherwise let p:=min⁡Jk and let q be the least natural with q>p and q∉Jk, which exists by [L9] because n∉Jk; by step 9.2 then Jk={ i:p≤i<q }, since an i∈Jk with i≥q together with p∈Jk and p<q≤i would put q∈Jk. Splitting the sum at p and at q and discarding the vanishing outer parts ([L8]) gives ∑i<nhik=∑i=pq−1Δi=tq−tp by telescoping, and p∈Jk, q−1∈Jk give tp≥dk−η and tq≤dk+η, whence tq−tp≤2η.

step 9.2L8L9L11
11.1

Put βi:=Δi for i bad and βi:=0 for i good. Then βi≤∑k<rhik for every i<n, all terms being nonnegative and a bad i lying in some Jk; so by [L8], ∑i<nβi≤∑i<n∑k<rhik=∑k<r∑i<nhik≤∑k<r2η=2η ι(r), using step 10.1.

step 9.2step 10.1L8L11
12.1

For every i<n one has (Mi−mi)Δi≤θ Δi+2M+ βi: for good i this is step 9.1 together with βi≥0, and for bad i it follows from Mi−mi≤2M+ in [L2] and βi=Δi, together with θΔi≥0.

step 9.1step 11.1L2L11
13.1

Summing step 12.1 over i<n and using [L8], [L1] and step 11.1: U(f,P)−L(f,P)≤θ∑i<nΔi+2M+∑i<nβi≤θ(b−a)+4M+η ι(r)≤ε⋅4−1+ε⋅4−1<ε, the last estimate because 4M+η ι(r)≤4M+η(ι(r)+1)=ε⋅4−1 by step 1.1.

step 1.1step 11.1step 12.1L1L2L8L10L11
14.1

The real ε>0 of step 1.1 was arbitrary and step 13.1 produced a partition P with U(f,P)−L(f,P)<ε, so [L3] applies and f is Riemann integrable on [a,b].

step 1.1step 13.1L3∎

Remarks

Depends on

Used by

Dependency tree · two levels

76 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources