Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-29
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 function integrable on [a,b] is integrable on every closed subinterval

Statement

Let a<b be reals, let f:[a,b]→R be integrable (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), and let c,d satisfy

a  ≤  c  <  d  ≤  b.

Then the restriction of f to [c,d] is bounded (Lower bound, bounded below, bounded set) and integrable on [c,d].

The degenerate case c=d is not an omission: there ∫ccf=0 by The integral with oriented limits: ∫aaf:=0 and ∫baf:=−∫abf, and no partition of [c,d] exists to speak of (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).

Facts & Assumptions

Given: Reals a<b, an integrable f:[a,b]→R, and reals c,d with a≤c<d≤b. Write g for the restriction of f to [c,d].

[L2]

For a partition P of [a,b] and a point p∈[a,b], the partition P+p satisfies pts⁡(P+p)=pts⁡(P)∪{p} and refines P; a refinement of a refinement refines the original, since the point-set inclusions compose (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).

[L4]

For a partition R=(n,t) of an interval and bounded h on it: L(h,R)=∑i<nmiΔi, U(h,R)=∑i<nMiΔi with mi=inf⁡h[Ii], Mi=sup⁡h[Ii], Ii=[ti,ti+1], Δi=ti+1−ti>0, and Mi−mi≥0 (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, 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, Intervals of R: the nine order-convex forms, nondegeneracy, and length).

[L5]

Finite sums: additivity, scaling, splitting at an intermediate index with ∑k=mn−1ak=∑j<n−mam+j, and monotonicity in the terms, so that a sum of nonnegative terms is at most a sum containing those terms among others (Finite sums and finite products, by recursion, Laws of finite sums and finite products, clauses 1 to 4).

[L6]

A partition P′=(n′,t′) of [a,b] has t′ strictly increasing on indices ≤n′, hence injective there, so a point of pts⁡(P′) is tj′ for exactly one j≤n′; and j<k gives tj′<tk′ (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).

[L7]

A restriction of a bounded function is bounded: the same M serves fewer points (Lower bound, bounded below, bounded set).

Proof

technique · direct
1.1

g is bounded on [c,d], since [c,d]⊆[a,b] and f is bounded on [a,b], integrability presupposing boundedness.

givenL7
1.2

Let a real ε>0 be given, and fix a partition P of [a,b] with U(f,P)−L(f,P)<ε.

givenL1choose
2.1

Put P′:=(P+c)+d, a partition of [a,b] refining P whose point set contains c and d.

step 1.2L2construct
3.1

By [L3] applied to the pair (P,P′), U(f,P′)−L(f,P′)≤U(f,P)−L(f,P)<ε.

step 1.2step 2.1L3
3.2

Write P′=(n′,t′) and fix the unique indices p,q≤n′ with tp′=c and tq′=d; then p<q, because c<d and t′ is increasing on those indices.

step 2.1L6choose
4.1

Define Q:=(q−p, s) by si:=tp+i′ for i≤q−p and sk:=d for k≥q−p. Then s0=tp′=c, sq−p=tq′=d, and si<si+1 for i<q−p by [L6], with q−p≥1; so Q is a partition of [c,d], its i-th subinterval is [tp+i′,tp+i+1′]=Ip+i′ and its i-th length is Δp+i′.

step 3.2L6construct
5.1

For i<q−p the i-th subinterval of Q is Ip+i′⊆[c,d], and g agrees with f there, so the extreme values of g on it are Mp+i′ and mp+i′; hence U(g,Q)−L(g,Q)=∑i<q−p(Mp+i′−mp+i′)Δp+i′ by [L4] and [L5].

step 4.1L4L5
6.1

Every term (Mj′−mj′)Δj′ is nonnegative by [L4], and splitting ∑j<n′ first at p and then at q exhibits ∑i<q−p(Mp+i′−mp+i′)Δp+i′ as one of the three pieces of ∑j<n′(Mj′−mj′)Δj′, the other two being nonnegative; so the displayed sum is at most U(f,P′)−L(f,P′).

step 5.1L4L5
7.1

Combining, U(g,Q)−L(g,Q)≤U(f,P′)−L(f,P′)<ε.

step 3.1step 5.1step 6.1
8.1

Since ε>0 was arbitrary and g is bounded, [L1] applies on [c,d] and g is integrable there.

step 1.1step 1.2step 7.1L1∎

Remarks

Depends on

Used by

Dependency tree · two levels

39 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