Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedprecheck passverified 2026-08-10 (gpt-5.6-terra-codex-subscription)
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 uniform limit of Riemann-integrable functions is Riemann integrable, and its integral is the limit of their integrals

Statement

Let a<b be reals. Suppose every fk:[a,b]→R is Riemann integrable and fk→f uniformly on [a,b]. Then f is Riemann integrable and

∫abfk⟶∫abf.

Facts & Assumptions

Given: Reals a<b, integrable functions fk:[a,b]→R, and uniform convergence fk→f.

[A1]

Uniform convergence means that for every real η>0 one index makes ∣fk(x)−f(x)∣<η for every later k and every x∈[a,b] (Pointwise convergence, uniform convergence, and the uniformly Cauchy condition for sequences of real-valued functions).

[L2]

Darboux upper and lower sums are finite sums of the subinterval suprema and infima times the subinterval lengths; finite sums preserve inequalities and split and telescope in the usual way (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, Laws of finite sums and finite products).

[L3]

If two integrable functions differ by at most η uniformly, then their integrals differ by at most η(b−a) (Uniformly close integrable functions have integrals differing by at most the interval length times their uniform error).

Proof

technique · direct
1.1A1choose

Let ε>0 be real, put η:=ε/(4(b−a))>0, and choose an index j such that ∣fj(x)−f(x)∣<η for every x∈[a,b].

1.2L1choose

By integrability of fj and [L1], choose a partition P with U(fj,P)−L(fj,P)<ε/2.

2.1step 1.1L1algebra

The integrable function fj is bounded, say ∣fj(x)∣≤M on [a,b]; then ∣f(x)∣≤M+η, so f is bounded.

3.1step 1.1step 1.2step 2.1L2algebra

On each subinterval of P, step 1.1 gives sup⁡f≤sup⁡fj+η and inf⁡f≥inf⁡fj−η; these suprema and infima exist by step 2.1. Multiplying by the nonnegative subinterval lengths and summing gives U(f,P)≤U(fj,P)+η(b−a) and L(f,P)≥L(fj,P)−η(b−a).

4.1step 3.1L1algebra

Therefore U(f,P)−L(f,P)≤U(fj,P)−L(fj,P)+2η(b−a)<ε, so [L1] makes f integrable.

5.1step 4.1A1choose

Now let ε>0 be real and choose N such that ∣fk(x)−f(x)∣<ε/(b−a+1) for every k≥N and every x∈[a,b].

6.1step 4.1step 5.1L3algebra

For k≥N, both functions are integrable, so [L3] gives ∣∫abfk−∫abf∣≤ε(b−a)/(b−a+1)<ε.

7.1step 4.1step 6.1∎

Step 6.1 proves ∫abfk→∫abf, while step 4.1 proves integrability of f.

Depends on

Dependency tree · 2 levels

Sources