Theorem 6.12(b,c,d) — monotonicity, additivity in the interval, and the basic bound
DisprovedRudin.ch06_monotonicity_and_boundsFor on : if on then ; for , is integrable on and on and the two integrals add up to the integral over ; and if then .
import Mathlib import Definitions.Def_Rudin_ch06_stieltjes open Filter Topology
namespace Rudin
/-- Rudin, Theorem 6.12(b), (c), (d): the integral is monotone in the integrand, additive over
adjacent intervals, and bounded by `M (α b - α a)` when `|f| ≤ M`. -/
theorem ch06_monotonicity_and_bounds (a b : ℝ) (hab : a ≤ b) (f g α : ℝ → ℝ)
(hα : MonotoneOn α (Set.Icc a b))
(hf : RSIntegrable a b f α) (hg : RSIntegrable a b g α) :
((∀ x ∈ Set.Icc a b, f x ≤ g x) → RSIntegral a b f α ≤ RSIntegral a b g α) ∧
(∀ c ∈ Set.Icc a b, RSIntegrable a c f α ∧ RSIntegrable c b f α ∧
RSIntegral a c f α + RSIntegral c b f α = RSIntegral a b f α) ∧
(∀ M : ℝ, (∀ x ∈ Set.Icc a b, |f x| ≤ M) →
|RSIntegral a b f α| ≤ M * (α b - α a)) := by sorry
end RudinRead-back
What the Lean code literally says, in plain math · Aristotle (Harmonic)
Let , let be monotone non-decreasing on , and let and both be Riemann–Stieltjes integrable with respect to on . Then three assertions hold together, where denotes the upper integral (the definition of the integral in this bundle):
-
Monotonicity. If for every , then .
-
Additivity over subintervals. For every : is integrable with respect to on , is integrable with respect to on , and
- Bound. For every real : if for all , then
In item 3 the bound is universally quantified and the hypothesis is on only. No separate boundedness hypothesis on or is imposed in the premises of the theorem itself.
Confirmed by the mission captain (proposal self-audit).