Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Theorem 6.12(b) with boundedness assumed only for the larger integrand

Disproved
Rudin.ch06_integral_mono_of_bounded_larger

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

analysisintegration

Rudin's Theorem 6.12(b) states that if f,g∈R(α)f, g \in \mathcal R(\alpha)f,g∈R(α) on [a,b][a,b][a,b] and f≤gf \le gf≤g there, then ∫abf dα≤∫abg dα\int_a^b f\,d\alpha \le \int_a^b g\,d\alpha∫ab​fdα≤∫ab​gdα. In this development, where upper and lower integrals are ordinary suprema and infima of sets of reals and therefore take a default value on unbounded sets, Rudin's standing hypothesis of Definition 6.2 — that the integrands be bounded — has to be stated explicitly; the proved form Rudin.ch06_integral_mono_of_bounded assumes it for both fff and ggg.

This statement asks whether one of the two hypotheses can be dropped: it assumes

α monotonically increasing,f,g∈R(α) on [a,b],f≤g on [a,b],\alpha \text{ monotonically increasing},\qquad f, g \in \mathcal R(\alpha) \text{ on } [a,b], \qquad f \le g \text{ on } [a,b],α monotonically increasing,f,g∈R(α) on [a,b],f≤g on [a,b],

together with boundedness of the larger integrand ggg only, and asserts

∫abf dα≤∫abg dα.\int_a^b f\,d\alpha \le \int_a^b g\,d\alpha .∫ab​fdα≤∫ab​gdα.

It is the natural first attempt at a minimal hypothesis, since a function below a bounded function is bounded above, and it is recorded here so that the sharpness of the hypotheses in 6.12(b) is settled on the record rather than assumed.

Preamble
import Mathlib
import Definitions.Def_Rudin_ch06_stieltjes

open Filter Topology
Formal statement
namespace Rudin

/-- Rudin, Theorem 6.12(b), with the boundedness hypothesis imposed only on the larger integrand
`g`: if `f ≤ g` on `[a, b]`, both are integrable and `g` is bounded, is the integral monotone? -/
theorem ch06_integral_mono_of_bounded_larger (a b : ℝ) (hab : a ≤ b) (f g α : ℝ → ℝ)
    (hα : MonotoneOn α (Set.Icc a b))
    (hgb : ∃ M, ∀ x ∈ Set.Icc a b, |g x| ≤ M)
    (hf : RSIntegrable a b f α) (hg : RSIntegrable a b g α)
    (hfg : ∀ x ∈ Set.Icc a b, f x ≤ g x) :
    RSIntegral a b f α ≤ RSIntegral a b g α := by sorry

end Rudin
Source
Walter Rudin, Principles of Mathematical Analysis, 3rd edition, McGraw-Hill, 1976, Chapter 6, p. 128, Theorem 6.12(b) (hypothesis-sharpness variant: boundedness assumed only for the larger integrand)

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, licensed under Apache 2.0.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTermsJoin SlackJoin Zulip© 2026 Prove2Me