Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passjudge pass (z-ai/glm-5.2)audited 2026-07-28
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][a,b] that is continuous except at finitely many points is Riemann integrable

Statement

Let a<ba < b be reals and let f:[a,b]Rf : [a,b] \to \mathbb{R} be bounded (Lower bound, bounded below, bounded set). Suppose there are rNr \in \mathbb{N} and points d0,,dr1[a,b]d_0, \dots, d_{r-1} \in [a,b] such that ff is continuous (Continuity of f:ARf : A \to \mathbb{R} at a point of AA and on AA: the ε\varepsilon-δ\delta condition, its agreement with limxcf(x)=f(c)\lim_{x \to c} f(x) = f(c) at a limit point, and continuity at an isolated point) at every point of [a,b][a,b] other than d0,,dr1d_0, \dots, d_{r-1}; that is, every discontinuity of ff (Discontinuity of ff 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 rr listed points. Then ff is Riemann integrable on [a,b][a,b] (The lower and upper Darboux integrals of a bounded ff on [a,b][a,b] as supPL(f,P)\sup_P L(f,P) and infPU(f,P)\inf_P U(f,P), Darboux integrability as their equality, and the notation abf\int_a^b f).

For r=0r = 0 the hypothesis says ff is continuous on [a,b][a,b] and the conclusion is A continuous function on [a,b][a,b] 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 ff 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 ff on [a,b][a,b] and a partition PP: the infimum mim_i and supremum MiM_i of ff on the ii-th subinterval, and the lower and upper Darboux sums L(f,P)=imiΔiL(f,P) = \sum_i m_i \Delta_i and U(f,P)=iMiΔiU(f,P) = \sum_i M_i \Delta_i).

Facts & Assumptions

Given: Reals a<ba < b; a bounded f:[a,b]Rf : [a,b] \to \mathbb{R}; a real M+>0M_{+} > 0 with f(x)M+|f(x)| \le M_{+} for every x[a,b]x \in [a,b]; and rNr \in \mathbb{N} with points d0,,dr1[a,b]d_0, \dots, d_{r-1} \in [a,b] such that ff is continuous at every x[a,b]x \in [a,b] with xdkx \ne d_k for all k<rk < r.

[L1]

For a partition P=(n,t)P = (n,t) of [a,b][a,b]: n1n \ge 1, Δi=ti+1ti>0\Delta_i = t_{i+1}-t_i > 0, i<nΔi=ba\sum_{i<n}\Delta_i = b-a, ΔiP\Delta_i \le \|P\|, no tjt_j with jnj \le n lies strictly between tit_i and ti+1t_{i+1}, inserting a point does not increase the mesh and adds that point to pts(P)\operatorname{pts}(P), and the uniform partition UNU_N has mesh (ba)/ι(N)(b-a)/\iota(N) (Partition of [a,b][a,b] as a finite strictly increasing list a=t0<t1<<tn=ba = t_0 < t_1 < \dots < t_n = 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(Mimi)ΔiU(f,P) - L(f,P) = \sum_{i<n}(M_i-m_i)\Delta_i, Mimi=sup{f(x)f(y):x,yIi}M_i - m_i = \sup\{|f(x)-f(y)| : x,y \in I_i\}, and 0Mimi2M+0 \le M_i - m_i \le 2M_{+} (For bounded ff on [a,b][a,b] and a partition PP: the infimum mim_i and supremum MiM_i of ff on the ii-th subinterval, and the lower and upper Darboux sums L(f,P)=imiΔiL(f,P) = \sum_i m_i \Delta_i and U(f,P)=iMiΔiU(f,P) = \sum_i M_i \Delta_i).

[L3]

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

[L4]

A closed bounded subset of R\mathbb{R} is compact, and a continuous real function on a compact subset KK of R\mathbb{R} is uniformly continuous on KK: for every real η>0\eta > 0 there is a real δ>0\delta > 0 with g(x)g(y)<η|g(x)-g(y)| < \eta for all x,yKx,y \in K with xy<δ|x-y| < \delta. This holds for K=K = \varnothing as well, the condition being vacuous there (A subset of R\mathbb{R} is compact if and only if it is closed and bounded, Open cover, subcover, compact subset of R\mathbb{R} (every open cover has a finite subcover), and sequentially compact subset, Heine-Cantor in R\mathbb{R}: a continuous real function on a compact subset of R\mathbb{R} is uniformly continuous, proved R\mathbb{R}-natively from sequential compactness, Uniform continuity of f:ARf : A \to \mathbb{R}: one δ\delta serving every pair of points of AA).

[L7]

If g:ARg : A \to \mathbb{R} is continuous at cAc \in A and cBAc \in B \subseteq A, then the restriction gBg|_B is continuous at cc as a function on BB: the same δ\delta works, the condition quantifying over fewer points (Continuity of f:ARf : A \to \mathbb{R} at a point of AA and on AA: the ε\varepsilon-δ\delta condition, its agreement with limxcf(x)=f(c)\lim_{x \to c} f(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<nk<rci,k=k<ri<nci,k\sum_{i<n}\sum_{k<r}c_{i,k} = \sum_{k<r}\sum_{i<n}c_{i,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 rr (The principle of mathematical induction). At r=0r = 0 each inner sum k<0ci,k\sum_{k<0}c_{i,k} is 00 by the recursion clause of Finite sums and finite products, by recursion, so the left side is i<n0=0\sum_{i<n}0 = 0 by clause 2 of Laws of finite sums and finite products taken with λ=0\lambda = 0, while the right side is an empty sum and so is 00 as well. Passing from rr to r+1r+1, the recursion clause and clause 1 of Laws of finite sums and finite products give i<nk<r+1ci,k=i<n(k<rci,k+ci,r)=i<nk<rci,k+i<nci,r\sum_{i<n}\sum_{k<r+1}c_{i,k} = \sum_{i<n}\bigl(\sum_{k<r}c_{i,k} + c_{i,r}\bigr) = \sum_{i<n}\sum_{k<r}c_{i,k} + \sum_{i<n}c_{i,r}, which by the induction hypothesis is k<ri<nci,k+i<nci,r=k<r+1i<nci,k\sum_{k<r}\sum_{i<n}c_{i,k} + \sum_{i<n}c_{i,r} = \sum_{k<r+1}\sum_{i<n}c_{i,k}, again by the recursion clause. Note that nn is fixed throughout the induction and only rr varies.

[L9]

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

[L10]
[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]x,y \in [c,d] gives xydc|x-y| \le 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\mathbb{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\varepsilon > 0 be given. Put θ:=ε(4(ba))1\theta := \varepsilon \cdot \bigl(4(b-a)\bigr)^{-1} and η:=ε(16M+(ι(r)+1))1\eta := \varepsilon \cdot \bigl(16\,M_{+}(\iota(r)+1)\bigr)^{-1}, both positive reals by [L10] and [L11].

givenL10L11
2.1

Put V:=k<r(dkη, dk+η)V := \bigcup_{k<r}\,(d_k - \eta,\ d_k + \eta), an open set by [L5], and K:=[a,b]V=[a,b](RV)K := [a,b] \setminus V = [a,b] \cap (\mathbb{R}\setminus V), an intersection of two closed sets, hence closed by [L5], and bounded since K[a,b]K \subseteq [a,b]; so KK is compact by [L4].

step 1.1L4L5construct
3.1

ff is continuous at every point of KK: a point xKx \in K is not any dkd_k, since dk(dkη,dk+η)Vd_k \in (d_k-\eta, d_k+\eta) \subseteq V and KK misses VV. Hence the restriction fKf|_K is continuous on KK by [L7].

step 2.1givenL7L11
4.1

By [L4] applied to fKf|_K on the compact set KK with the value θ\theta, fix a real δ>0\delta > 0 such that f(x)f(y)<θ|f(x)-f(y)| < \theta for all x,yKx,y \in K with xy<δ|x-y| < \delta.

step 2.1step 3.1L4choose
5.1

By [L10] fix a natural N1N \ge 1 with 1/ι(N)<δ(ba)11/\iota(N) < \delta \cdot (b-a)^{-1}, so that the uniform partition UNU_N has mesh (ba)/ι(N)<δ(b-a)/\iota(N) < \delta by [L1] and [L11]. Let P=(n,t)P = (n,t) be the partition obtained from UNU_N by inserting, one after another, those of the 2r2r points dkηd_k - \eta and dk+ηd_k + \eta with k<rk < r that lie in [a,b][a,b]. By [L1] each insertion leaves the mesh no larger, so P<δ\|P\| < \delta, and pts(P)\operatorname{pts}(P) contains every one of those points that lies in [a,b][a,b].

step 4.1L1L10L11chooseconstruct
6.1

A dichotomy for each subinterval and each kk. Fix i<ni < n and k<rk < r, and write c:=dkηc^{-} := d_k - \eta and c+:=dk+ηc^{+} := d_k + \eta. Neither cc^{-} nor c+c^{+} lies in the open interval (ti,ti+1)(t_i,t_{i+1}): if such a point lies in [a,b][a,b] it is a member of pts(P)\operatorname{pts}(P) by step 5.1, hence is some tjt_j with jnj \le n, and no tjt_j lies strictly between tit_i and ti+1t_{i+1} by [L1]; and if it lies outside [a,b][a,b] it is outside [ti,ti+1][t_i,t_{i+1}] altogether.

step 5.1L1L11
7.1

Consequently either (ti,ti+1)(c,c+)=(t_i,t_{i+1}) \cap (c^{-},c^{+}) = \varnothing, or Ii[c,c+]I_i \subseteq [c^{-},c^{+}]. Suppose the intersection contains a point zz and let w(ti,ti+1)w \in (t_i,t_{i+1}). If wcw \le c^{-} then cc^{-} lies between ww and zz, both in the order-convex set (ti,ti+1)(t_i,t_{i+1}), so c(ti,ti+1)c^{-} \in (t_i,t_{i+1}), contradicting step 6.1; likewise wc+w \ge c^{+} is impossible. So (ti,ti+1)(c,c+)(t_i,t_{i+1}) \subseteq (c^{-},c^{+}). Then c<z<ti+1c^{-} < z < t_{i+1} with c(ti,ti+1)c^{-} \notin (t_i,t_{i+1}) forces ctic^{-} \le t_i, and symmetrically c+ti+1c^{+} \ge t_{i+1}, that is Ii[c,c+]I_i \subseteq [c^{-},c^{+}].

step 6.1L11given
8.1

Call i<ni < n bad when Ii[dkη,dk+η]I_i \subseteq [d_k-\eta, d_k+\eta] for some k<rk < r, and good otherwise. If ii is good then by step 7.1 the open interval (ti,ti+1)(t_i,t_{i+1}) meets no (dkη,dk+η)(d_k-\eta,d_k+\eta), hence (ti,ti+1)K(t_i,t_{i+1}) \subseteq K; since KK is closed, [L6] gives Ii=[ti,ti+1]KI_i = [t_i,t_{i+1}] \subseteq K.

step 2.1step 7.1L6
9.1

For a good ii: all x,yIix,y \in I_i lie in KK and satisfy xyΔiP<δ|x-y| \le \Delta_i \le \|P\| < \delta by [L1] and [L11], so f(x)f(y)<θ|f(x)-f(y)| < \theta by step 4.1; therefore θ\theta bounds the set whose supremum is MimiM_i - m_i, and MimiθM_i - m_i \le \theta by [L2].

step 4.1step 5.1step 8.1L1L2L11
9.2

Bounding the bad lengths. For k<rk < r put Jk:={i<n:dkηti and ti+1dk+η}J_k := \{\, i < n : d_k - \eta \le t_i \text{ and } t_{i+1} \le d_k + \eta \,\}, so that ii is bad exactly when iJki \in J_k for some k<rk < r, and put hik:=Δih^{k}_i := \Delta_i for iJki \in J_k and hik:=0h^{k}_i := 0 otherwise. Each JkJ_k is a set of consecutive indices: if i<i<ii < i' < i'' with i,iJki, i'' \in J_k then dkηtitid_k - \eta \le t_i \le t_{i'} and ti+1ti+1dk+ηt_{i'+1} \le t_{i''+1} \le d_k + \eta, so iJki' \in J_k.

step 8.1L1L11construct
10.1

i<nhik2η\sum_{i<n} h^{k}_i \le 2\eta for each k<rk < r. If Jk=J_k = \varnothing the sum is 00. Otherwise let p:=minJkp := \min J_k and let qq be the least natural with q>pq > p and qJkq \notin J_k, which exists by [L9] because nJkn \notin J_k; by step 9.2 then Jk={i:pi<q}J_k = \{\, i : p \le i < q \,\}, since an iJki \in J_k with iqi \ge q together with pJkp \in J_k and p<qip < q \le i would put qJkq \in J_k. Splitting the sum at pp and at qq and discarding the vanishing outer parts ([L8]) gives i<nhik=i=pq1Δi=tqtp\sum_{i<n}h^{k}_i = \sum_{i=p}^{q-1}\Delta_i = t_q - t_p by telescoping, and pJkp \in J_k, q1Jkq-1 \in J_k give tpdkηt_p \ge d_k-\eta and tqdk+ηt_q \le d_k+\eta, whence tqtp2ηt_q - t_p \le 2\eta.

step 9.2L8L9L11
11.1

Put βi:=Δi\beta_i := \Delta_i for ii bad and βi:=0\beta_i := 0 for ii good. Then βik<rhik\beta_i \le \sum_{k<r}h^{k}_i for every i<ni < n, all terms being nonnegative and a bad ii lying in some JkJ_k; so by [L8], i<nβii<nk<rhik=k<ri<nhikk<r2η=2ηι(r)\sum_{i<n}\beta_i \le \sum_{i<n}\sum_{k<r}h^{k}_i = \sum_{k<r}\sum_{i<n}h^{k}_i \le \sum_{k<r}2\eta = 2\eta\,\iota(r), using step 10.1.

step 9.2step 10.1L8L11
12.1

For every i<ni < n one has (Mimi)ΔiθΔi+2M+βi(M_i - m_i)\Delta_i \le \theta\,\Delta_i + 2M_{+}\,\beta_i: for good ii this is step 9.1 together with βi0\beta_i \ge 0, and for bad ii it follows from Mimi2M+M_i - m_i \le 2M_{+} in [L2] and βi=Δi\beta_i = \Delta_i, together with θΔi0\theta\Delta_i \ge 0.

step 9.1step 11.1L2L11
13.1

Summing step 12.1 over i<ni < n and using [L8], [L1] and step 11.1: U(f,P)L(f,P)θi<nΔi+2M+i<nβiθ(ba)+4M+ηι(r)ε41+ε41<εU(f,P) - L(f,P) \le \theta\sum_{i<n}\Delta_i + 2M_{+}\sum_{i<n}\beta_i \le \theta(b-a) + 4M_{+}\eta\,\iota(r) \le \varepsilon\cdot 4^{-1} + \varepsilon\cdot 4^{-1} < \varepsilon, the last estimate because 4M+ηι(r)4M+η(ι(r)+1)=ε414M_{+}\eta\,\iota(r) \le 4M_{+}\eta(\iota(r)+1) = \varepsilon\cdot 4^{-1} by step 1.1.

step 1.1step 11.1step 12.1L1L2L8L10L11
14.1

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

step 1.1step 13.1L3

Remarks

Depends on

Used by

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