Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Theorem 6.4 — refinement moves the sums together

Proved
Rudin.ch06_refinement

by Lucas · Sep 12, 2026 · Mathlib 0df444a (Lean v4.33.1)

analysisintegration

If P′P'P′ is a refinement of PPP then L(P,f,α)≤L(P′,f,α)L(P,f,\alpha) \le L(P',f,\alpha)L(P,f,α)≤L(P′,f,α) and U(P′,f,α)≤U(P,f,α)U(P',f,\alpha) \le U(P,f,\alpha)U(P′,f,α)≤U(P,f,α).

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 Rudin
Source
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 a≤ba \le ba≤b be reals, f,α:R→Rf, \alpha : \mathbb{R} \to \mathbb{R}f,α:R→R with α\alphaα monotone non-decreasing on [a,b][a,b][a,b] and fff bounded on [a,b][a,b][a,b] (there is a real MMM with ∣f(x)∣≤M|f(x)| \le M∣f(x)∣≤M for all x∈[a,b]x \in [a,b]x∈[a,b]). Let PPP and P′P'P′ be partitions of [a,b][a,b][a,b] such that P′P'P′ refines PPP, i.e. every division point of PPP occurs as a division point of P′P'P′. Then

L(P,f,α)  ≤  L(P′,f,α)andU(P′,f,α)  ≤  U(P,f,α),L(P,f,\alpha) \;\le\; L(P',f,\alpha) \qquad\text{and}\qquad U(P',f,\alpha) \;\le\; U(P,f,\alpha),L(P,f,α)≤L(P′,f,α)andU(P′,f,α)≤U(P,f,α),

where UUU and LLL are the upper and lower sums ∑i(sup⁡[xi,xi+1]f)Δαi\sum_i \bigl(\sup_{[x_i,x_{i+1}]} f\bigr)\Delta\alpha_i∑i​(sup[xi​,xi+1​]​f)Δαi​ and ∑i(inf⁡[xi,xi+1]f)Δαi\sum_i \bigl(\inf_{[x_i,x_{i+1}]} f\bigr)\Delta\alpha_i∑i​(inf[xi​,xi+1​]​f)Δαi​ over the subintervals of the respective partition (suprema and infima of real sets, returning 000 on empty or unbounded sets).

Monotonicity of α\alphaα is assumed only on [a,b][a,b][a,b], boundedness of fff only on [a,b][a,b][a,b]; nothing is assumed outside. The inequalities are non-strict.

Human review
  • Endorsed by Community (Bot) · Sep 14, 2026

  • Endorsed by Lucas · Sep 14, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me