Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablejudge 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.

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

Definition

Let a<b be reals, let f:[a,b]→R be bounded (Lower bound, bounded below, bounded set), so that there is a real M≥0 with ∣f(x)∣≤M for every x∈[a,b], and let P=(n,t) be a partition of [a,b] with subintervals Ii=[ti,ti+1] and lengths Δi=ti+1−ti for i<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).

The two extreme values on a subinterval

For i<n put

mi  :=  inf⁡f[Ii],Mi  :=  sup⁡f[Ii],f[Ii]  =  { f(x):x∈Ii }.

Both exist. The set f[Ii] is nonempty, because ti<ti+1 makes Ii nonempty (Intervals of R: the nine order-convex forms, nondegeneracy, and length), and it is bounded, because ∣f(x)∣≤M for every x (Lower bound, bounded below, bounded set). A nonempty set bounded above has a supremum (Complete ordered field (least-upper-bound property)) and a nonempty set bounded below has an infimum (Every nonempty set bounded below has an infimum, Greatest lower bound (infimum)); each is unique, so the notations inf⁡f[Ii] and sup⁡f[Ii] name single real numbers (Suprema and infima are unique).

They bracket the values, and each other. For x∈Ii,

−M  ≤  mi  ≤  f(x)  ≤  Mi  ≤  M,

the outer inequalities because −M is a lower bound and M an upper bound of f[Ii], and the middle ones by the definitions of infimum and supremum. In particular mi≤Mi and Mi−mi≤2M.

The dependence of mi and Mi on f and on P is suppressed in the notation, as is customary; where two partitions are in play the sums below carry the partition and the extreme values are written out.

The two Darboux sums

L(f,P)  :=  ∑i<nmi Δi,U(f,P)  :=  ∑i<nMi Δi,

the finite sums of Finite sums and finite products, by recursion, indexed by i∈N with i<n. Both are real numbers, being finite sums of reals, and

L(f,P)  ≤  U(f,P),

by monotonicity of finite sums, clause 4 of Laws of finite sums and finite products, since miΔi≤MiΔi for every i<n: multiplying mi≤Mi by Δi>0 preserves the inequality (Ordered field).

The gap on a subinterval is the oscillation there

For every i<n,

Mi−mi  =  ωf(Ii)  =  sup⁡{ ∣f(x)−f(y)∣ : x,y∈Ii },

the oscillation of f on the set Ii (The oscillation ωf(S)=sup⁡{ ∣f(x)−f(y)∣:x,y∈S } of f on a set and the oscillation ωf(c)=inf⁡δ>0ωf(A∩Nδ(c)) at a point, both taken in the extended reals). The supremum is a real number here rather than an extended one, because f is bounded (The oscillation ωf(S)=sup⁡{ ∣f(x)−f(y)∣:x,y∈S } of f on a set and the oscillation ωf(c)=inf⁡δ>0ωf(A∩Nδ(c)) at a point, both taken in the extended reals, The extended real line R‾=R∪{−∞,+∞}, its order, and the arithmetic that is left undefined). The identity is proved in two inequalities.

The oscillation is at most the gap. For x,y∈Ii both f(x) and f(y) lie in [mi,Mi], so f(x)−f(y)≤Mi−mi and f(y)−f(x)≤Mi−mi, whence ∣f(x)−f(y)∣≤Mi−mi (Basic properties of the absolute value). So Mi−mi is an upper bound of the set whose supremum is ωf(Ii).

The gap is at most the oscillation. Let ε>0 be real. By the ε-characterisations of the supremum and the infimum (Epsilon characterisation of the supremum, Epsilon characterisation of the infimum) there are x,y∈Ii with f(x)>Mi−ε/2 and f(y)<mi+ε/2; then

∣f(x)−f(y)∣  ≥  f(x)−f(y)  >  (Mi−mi)−ε,

so ωf(Ii)>(Mi−mi)−ε. As ε>0 was arbitrary, ωf(Ii)≥Mi−mi: otherwise ε:=(Mi−mi)−ωf(Ii) would be positive and give ωf(Ii)>ωf(Ii).

This identity is what connects the Darboux machinery to the pointwise oscillation of The oscillation ωf(S)=sup⁡{ ∣f(x)−f(y)∣:x,y∈S } of f on a set and the oscillation ωf(c)=inf⁡δ>0ωf(A∩Nδ(c)) at a point, both taken in the extended reals, and it is the hinge of Lebesgue's criterion for Riemann integrability: a bounded f on [a,b] is Riemann integrable if and only if its set of discontinuities has measure zero.

Remarks

Depends on

Used by

…and 2 more results.

Dependency tree · two levels

43 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