Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passverified 2026-08-09 (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.

If m≤f≤M on [a,b] then m(b−a)≤L(f,P)≤∫ab‾f≤∫ab‾f≤U(f,P)≤M(b−a) for every partition P; in particular every constant function is integrable, with ∫abc=c(b−a)

Statement

Let a<b be reals and let f:[a,b]→R satisfy

m  ≤  f(x)  ≤  Mfor every x∈[a,b],

with m,M real. Then f is bounded (Lower bound, bounded below, bounded set), so its Darboux sums and integrals are defined (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, 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 for every partition P of [a,b] (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)

m(b−a)  ≤  L(f,P)  ≤  ∫ab‾f  ≤  ∫ab‾f  ≤  U(f,P)  ≤  M(b−a).

In particular, taking f to be the constant function with value c:

∫abc  =  c (b−a),

the constant function being integrable, with L(f,P)=U(f,P)=c(b−a) for every partition P.

Facts & Assumptions

Given: Reals a<b, reals m≤M, and f:[a,b]→R with m≤f(x)≤M for every x∈[a,b]. Let P=(n,t) be a partition of [a,b], with subintervals Ii and lengths Δi for i<n.

[L2]

mi=inf⁡f[Ii] and Mi=sup⁡f[Ii] exist, L(f,P)=∑i<nmiΔi and U(f,P)=∑i<nMiΔi, and mi≤f(x)≤Mi for x∈Ii (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]

L(f,P)≤∫ab‾f≤∫ab‾f≤U(f,P) for every partition P; f is integrable exactly when the two integrals are equal, and then ∫abf is their common value (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).

[L4]

An infimum is the greatest lower bound and a supremum the least upper bound; a set with a single element has that element as both (Greatest lower bound (infimum), Complete ordered field (least-upper-bound property), Maximum and minimum of a set).

[L5]

Finite sums: scaling, monotonicity in the terms, and ∑i<nλ Δi=λ∑i<nΔi (Finite sums and finite products, by recursion, Laws of finite sums and finite products).

[L6]

Ordered-field arithmetic: multiplying an inequality by a positive quantity preserves it, adding a constant preserves it, and the order is transitive; ∣x∣≤max⁡{∣m∣,∣M∣} whenever m≤x≤M (Order is preserved by adding a constant and by adding inequalities, Sign rules for products and monotonicity of multiplication, Basic properties of the absolute value, Ordered field, Complete ordered field (least-upper-bound property)). 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

f is bounded: ∣f(x)∣≤max⁡{∣m∣,∣M∣} for every x∈[a,b] by [L6], so the Darboux sums and integrals of [L2] and [L3] are defined.

givenL6
1.2

For every i<n: m is a lower bound of f[Ii] and M an upper bound, since Ii⊆[a,b]; the set f[Ii] is nonempty by [L1]. Hence m≤mi and Mi≤M by [L4].

givenL1L2L4
1.3

The constant case, treated on its own. Suppose in addition that f is the constant function with value c, that is f(x)=c for every x∈[a,b]; the general argument below does not use this supposition. Then f[Ii]={c} for every i<n by [L1], so mi=Mi=c by [L4], and L(f,P)=U(f,P)=∑i<nc Δi=c(b−a) by [L5] and [L1].

L1L2L4L5
2.1

L(f,P)≥m(b−a): by step 1.2 and Δi>0 one has miΔi≥mΔi for every i<n, so monotonicity and scaling in [L5] give L(f,P)≥∑i<nm Δi=m∑i<nΔi=m(b−a) by [L1].

step 1.2L1L5L6
2.2

U(f,P)≤M(b−a): the same argument with Mi≤M gives U(f,P)≤∑i<nM Δi=M(b−a).

step 1.2L1L5L6
3.1

Combining steps 2.1 and 2.2 with the chain of [L3] gives the displayed five-term inequality for every partition P.

step 2.1step 2.2L3
4.1

Hence, still under the supposition of step 1.3 that f is constant with value c, the set of lower sums and the set of upper sums are both {c(b−a)}, so ∫ab‾f=∫ab‾f=c(b−a) by [L4], f is integrable, and ∫abc=c(b−a) by [L3].

step 1.3L3L4∎

Remarks

Depends on

Used by

Dependency tree · two levels

38 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