Theorem 6.4 — refinement moves the sums together
ProvedRudin.ch06_refinementanalysisintegration
If is a refinement of then and .
Preamble
import Mathlib import Definitions.Def_Rudin_ch06_stieltjes open Filter Topology
Formal statement
namespace Rudin
/-- Rudin, Theorem 6.4: refining a partition increases the lower sum and decreases the upper
sum. -/
theorem ch06_refinement (a b : ℝ) (hab : a ≤ b) (f α : ℝ → ℝ)
(hα : MonotoneOn α (Set.Icc a b)) (hf : ∃ M, ∀ x ∈ Set.Icc a b, |f x| ≤ M)
(P P' : Partition a b) (hrefine : Refines P' P) :
lowerSum f α P ≤ lowerSum f α P' ∧ upperSum f α P' ≤ upperSum f α P := by sorry
end RudinSource
Walter Rudin, Principles of Mathematical Analysis, 3rd edition, McGraw-Hill, 1976, Chapter 6, p. 122, Definition 6.3 and Theorem 6.4
Read-back
What the Lean code literally says, in plain math · Aristotle (Harmonic)
Let be reals, with monotone non-decreasing on and bounded on (there is a real with for all ). Let and be partitions of such that refines , i.e. every division point of occurs as a division point of . Then
where and are the upper and lower sums and over the subintervals of the respective partition (suprema and infima of real sets, returning on empty or unbounded sets).
Monotonicity of is assumed only on , boundedness of only on ; nothing is assumed outside. The inequalities are non-strict.
Human review
Confirmed by the mission captain (proposal self-audit).