Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicableSession-authored (Fable 5 assisted)judge 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 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

Definition

Let a<ba < b be reals, let f:[a,b]Rf : [a,b] \to \mathbb{R} be bounded (Lower bound, bounded below, bounded set), so that there is a real M0M \ge 0 with f(x)M|f(x)| \le M for every x[a,b]x \in [a,b], and let P=(n,t)P = (n,t) be a partition of [a,b][a,b] with subintervals Ii=[ti,ti+1]I_i = [t_i, t_{i+1}] and lengths Δi=ti+1ti\Delta_i = t_{i+1} - t_i for i<ni < 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).

The two extreme values on a subinterval

For i<ni < n put

mi  :=  inff[Ii],Mi  :=  supf[Ii],f[Ii]  =  {f(x):xIi}.m_i \;:=\; \inf f[I_i], \qquad M_i \;:=\; \sup f[I_i], \qquad f[I_i] \;=\; \{\, f(x) : x \in I_i \,\} .

Both exist. The set f[Ii]f[I_i] is nonempty, because ti<ti+1t_i < t_{i+1} makes IiI_i nonempty (Intervals of R\mathbb{R}: the nine order-convex forms, nondegeneracy, and length), and it is bounded, because f(x)M|f(x)| \le M for every xx (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 inff[Ii]\inf f[I_i] and supf[Ii]\sup f[I_i] name single real numbers (Suprema and infima are unique).

They bracket the values, and each other. For xIix \in I_i,

M    mi    f(x)    Mi    M,-M \;\le\; m_i \;\le\; f(x) \;\le\; M_i \;\le\; M ,

the outer inequalities because M-M is a lower bound and MM an upper bound of f[Ii]f[I_i], and the middle ones by the definitions of infimum and supremum. In particular miMim_i \le M_i and Mimi2MM_i - m_i \le 2M.

The dependence of mim_i and MiM_i on ff and on PP 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,L(f,P) \;:=\; \sum_{i<n} m_i \,\Delta_i, \qquad U(f,P) \;:=\; \sum_{i<n} M_i \,\Delta_i ,

the finite sums of Finite sums and finite products, by recursion, indexed by iNi \in \mathbb{N} with i<ni < n. Both are real numbers, being finite sums of reals, and

L(f,P)    U(f,P),L(f,P) \;\le\; U(f,P) ,

by monotonicity of finite sums, clause 4 of Laws of finite sums and finite products, since miΔiMiΔim_i \Delta_i \le M_i \Delta_i for every i<ni < n: multiplying miMim_i \le M_i by Δi>0\Delta_i > 0 preserves the inequality (Ordered field).

The gap on a subinterval is the oscillation there

For every i<ni < n,

Mimi  =  ωf(Ii)  =  sup{f(x)f(y) : x,yIi},M_i - m_i \;=\; \omega_f(I_i) \;=\; \sup\{\, |f(x) - f(y)| \ : \ x, y \in I_i \,\} ,

the oscillation of ff on the set IiI_i (The oscillation ωf(S)=sup{f(x)f(y):x,yS}\omega_f(S) = \sup\{\,|f(x) - f(y)| : x, y \in S\,\} of ff on a set and the oscillation ωf(c)=infδ>0ωf(ANδ(c))\omega_f(c) = \inf_{\delta > 0} \omega_f(A \cap N_\delta(c)) at a point, both taken in the extended reals). The supremum is a real number here rather than an extended one, because ff is bounded (The oscillation ωf(S)=sup{f(x)f(y):x,yS}\omega_f(S) = \sup\{\,|f(x) - f(y)| : x, y \in S\,\} of ff on a set and the oscillation ωf(c)=infδ>0ωf(ANδ(c))\omega_f(c) = \inf_{\delta > 0} \omega_f(A \cap N_\delta(c)) at a point, both taken in the extended reals, The extended real line R=R{,+}\overline{\mathbb{R}} = \mathbb{R} \cup \{-\infty, +\infty\}, 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,yIix, y \in I_i both f(x)f(x) and f(y)f(y) lie in [mi,Mi][m_i, M_i], so f(x)f(y)Mimif(x) - f(y) \le M_i - m_i and f(y)f(x)Mimif(y) - f(x) \le M_i - m_i, whence f(x)f(y)Mimi|f(x) - f(y)| \le M_i - m_i (Basic properties of the absolute value). So MimiM_i - m_i is an upper bound of the set whose supremum is ωf(Ii)\omega_f(I_i).

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

f(x)f(y)    f(x)f(y)  >  (Mimi)ε,|f(x) - f(y)| \;\ge\; f(x) - f(y) \;>\; (M_i - m_i) - \varepsilon ,

so ωf(Ii)>(Mimi)ε\omega_f(I_i) > (M_i - m_i) - \varepsilon. As ε>0\varepsilon > 0 was arbitrary, ωf(Ii)Mimi\omega_f(I_i) \ge M_i - m_i: otherwise ε:=(Mimi)ωf(Ii)\varepsilon := (M_i - m_i) - \omega_f(I_i) would be positive and give ωf(Ii)>ωf(Ii)\omega_f(I_i) > \omega_f(I_i).

This identity is what connects the Darboux machinery to the pointwise oscillation of The oscillation ωf(S)=sup{f(x)f(y):x,yS}\omega_f(S) = \sup\{\,|f(x) - f(y)| : x, y \in S\,\} of ff on a set and the oscillation ωf(c)=infδ>0ωf(ANδ(c))\omega_f(c) = \inf_{\delta > 0} \omega_f(A \cap N_\delta(c)) at a point, both taken in the extended reals, and it is the hinge of Lebesgue's criterion for Riemann integrability: a bounded ff on [a,b][a,b] is Riemann integrable if and only if its set of discontinuities has measure zero.

Remarks

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 63 results over 14 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