Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 4.29 — one-sided limits of a monotone function

Proved
Rudin.ch04_monotone_one_sided_limits

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

analysis

Let fff be monotonically increasing on (a,b)(a,b)(a,b). At every x∈(a,b)x \in (a,b)x∈(a,b) the one-sided limits f(x−)f(x-)f(x−) and f(x+)f(x+)f(x+) exist, equal sup⁡a<t<xf(t)\sup_{a<t<x} f(t)supa<t<x​f(t) and inf⁡x<t<bf(t)\inf_{x<t<b} f(t)infx<t<b​f(t) respectively, and satisfy f(x−)≤f(x)≤f(x+)f(x-) \le f(x) \le f(x+)f(x−)≤f(x)≤f(x+).

Preamble
import Mathlib
import Definitions.Def_Rudin_ch04_continuity

open Filter Topology
Formal statement
namespace Rudin

/-- Rudin, Theorem 4.29: if `f` is monotonically increasing on `(a, b)` then at every point
`x` of `(a, b)` the one-sided limits `f(x-)` and `f(x+)` exist, are given by
`sup_{a<t<x} f t` and `inf_{x<t<b} f t`, and satisfy `f(x-) ≤ f x ≤ f(x+)`. -/
theorem ch04_monotone_one_sided_limits (a b : ℝ) (f : ℝ → ℝ)
    (hf : MonotoneOn f (Set.Ioo a b)) (x : ℝ) (hx : x ∈ Set.Ioo a b) :
    ∃ L R : ℝ,
      Tendsto f (𝓝[<] x) (𝓝 L) ∧ Tendsto f (𝓝[>] x) (𝓝 R) ∧
      IsLUB (f '' Set.Ioo a x) L ∧ IsGLB (f '' Set.Ioo x b) R ∧
      L ≤ f x ∧ f x ≤ R := by sorry

end Rudin
Source
Walter Rudin, Principles of Mathematical Analysis, 3rd edition, McGraw-Hill, 1976, Chapter 4, p. 95, Theorem 4.29
Read-back

What the Lean code literally says, in plain math · Aristotle (Harmonic)

Let a,b∈Ra, b \in \mathbb{R}a,b∈R, let f:R→Rf : \mathbb{R} \to \mathbb{R}f:R→R be monotone non-decreasing on the open interval (a,b)(a,b)(a,b) (i.e. f(s)≤f(t)f(s) \le f(t)f(s)≤f(t) whenever s,t∈(a,b)s,t \in (a,b)s,t∈(a,b) and s≤ts \le ts≤t; no condition on fff outside (a,b)(a,b)(a,b)), and let x∈(a,b)x \in (a,b)x∈(a,b). Then there exist real numbers LLL and RRR such that all of the following hold:

  • f(t)→Lf(t) \to Lf(t)→L as t→xt \to xt→x from the left (along the filter of left neighbourhoods of xxx in all of R\mathbb{R}R, not restricted to (a,b)(a,b)(a,b));
  • f(t)→Rf(t) \to Rf(t)→R as t→xt \to xt→x from the right (likewise unrestricted);
  • LLL is the least upper bound of the image f((a,x))f\bigl((a,x)\bigr)f((a,x));
  • RRR is the greatest lower bound of the image f((x,b))f\bigl((x,b)\bigr)f((x,b));
  • L≤f(x)L \le f(x)L≤f(x) and f(x)≤Rf(x) \le Rf(x)≤R.

The interval (a,b)(a,b)(a,b) is nonempty here because it contains xxx. Both one-sided limits are asserted to exist as finite real numbers, and L,RL, RL,R are simultaneously characterized as a supremum and an infimum of the indicated images. The one-sided limit filters involve the behaviour of fff on all reals near xxx, while the extremal characterizations involve only its values inside (a,x)(a,x)(a,x) and (x,b)(x,b)(x,b).

Human review
  • Endorsed by Shuze Chen · Sep 12, 2026

  • Endorsed by LG · Sep 12, 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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me