Theorem 6.21, sandwich form — between the lower and upper integrals of
ProvedRudin.ch06_fundamental_theorem_sandwichLet , let , and suppose is differentiable at every point of with there. No integrability of is assumed, and boundedness is assumed only on one side at a time. Then, with and the lower and upper Riemann integrals of Rudin's Definition 6.2 (the case ):
- if is bounded below on , then
- if is bounded above on , then
- consequently, if is bounded below and on , then
The mechanism is the mean value theorem applied on each subinterval of a partition : there is with . If is bounded below, the infimum of on the subinterval is a genuine infimum and , so summing and telescoping gives for every partition ; taking the supremum over gives (1). Symmetrically, boundedness above gives and hence (2).
Taken together, (1) and (2) contain Rudin's Theorem 6.21 for bounded : if is bounded and integrable, the upper and lower integrals agree and are therefore both equal to . Each one-sided hypothesis is needed for its own half: in this formalization suprema and infima of unbounded sets take a default value, and an increasing everywhere differentiable with unbounded derivative shows that (2) fails without boundedness above, its reflection that (1) fails without boundedness below.
import Mathlib import Definitions.Def_Rudin_ch06_stieltjes open Filter Topology
namespace Rudin
/-- Rudin, Theorem 6.21 in sandwich form, with one-sided boundedness and no integrability
hypothesis. If `F` is differentiable on `[a, b]` with `F' = f`, then the mean value theorem
squeezes `F b - F a` between the lower and upper Darboux sums of `f`: as soon as `f` is bounded
below on `[a, b]`, the lower integral of `f` is at most `F b - F a`, and as soon as `f` is
bounded above, `F b - F a` is at most the upper integral of `f`. In particular, for `f` bounded
below and `f ∈ ℛ` on `[a, b]`, `∫ₐᵇ f dx ≤ F b - F a`. -/
theorem ch06_fundamental_theorem_sandwich (a b : ℝ) (hab : a ≤ b) (f F : ℝ → ℝ)
(hF : ∀ x ∈ Set.Icc a b, HasDerivAt F (f x) x) :
((∃ m, ∀ x ∈ Set.Icc a b, m ≤ f x) → lowerIntegral a b f id ≤ F b - F a) ∧
((∃ M, ∀ x ∈ Set.Icc a b, f x ≤ M) → F b - F a ≤ upperIntegral a b f id) ∧
((∃ m, ∀ x ∈ Set.Icc a b, m ≤ f x) → RiemannIntegrable a b f →
RiemannIntegral a b f ≤ F b - F a) := by sorry
end Rudin