Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 5.11 — sign of the derivative and monotonicity

Proved
Rudin.ch05_monotonicity

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

analysiscalculus

Let fff be differentiable on (a,b)(a,b)(a,b). If f′≥0f' \ge 0f′≥0 throughout, fff is monotonically increasing; if f′=0f' = 0f′=0 throughout, fff is constant; if f′≤0f' \le 0f′≤0 throughout, fff is monotonically decreasing.

Preamble
import Mathlib

open Filter Topology
Formal statement
namespace Rudin

/-- Rudin, Theorem 5.11: on an interval where `f` is differentiable, a nonnegative derivative
makes `f` monotonically increasing, a vanishing derivative makes it constant, and a nonpositive
derivative makes it monotonically decreasing. -/
theorem ch05_monotonicity (a b : ℝ) (f : ℝ → ℝ)
    (hfd : ∀ x ∈ Set.Ioo a b, DifferentiableAt ℝ f x) :
    ((∀ x ∈ Set.Ioo a b, 0 ≤ deriv f x) → MonotoneOn f (Set.Ioo a b)) ∧
    ((∀ x ∈ Set.Ioo a b, deriv f x = 0) → ∀ x ∈ Set.Ioo a b, ∀ y ∈ Set.Ioo a b, f x = f y) ∧
    ((∀ x ∈ Set.Ioo a b, deriv f x ≤ 0) → AntitoneOn f (Set.Ioo a b)) := by sorry

end Rudin
Source
Walter Rudin, Principles of Mathematical Analysis, 3rd edition, McGraw-Hill, 1976, Chapter 5, p. 108, Theorem 5.11
Read-back

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

Let a,b∈Ra, b \in \mathbb{R}a,b∈R and let f:R→Rf : \mathbb{R} \to \mathbb{R}f:R→R be differentiable at every point of the open interval (a,b)(a,b)(a,b). Three implications are asserted together:

  1. If f′(x)≥0f'(x) \ge 0f′(x)≥0 for all x∈(a,b)x \in (a,b)x∈(a,b), then fff is monotone non-decreasing on (a,b)(a,b)(a,b): f(x)≤f(y)f(x) \le f(y)f(x)≤f(y) whenever x,y∈(a,b)x,y \in (a,b)x,y∈(a,b) and x≤yx \le yx≤y.
  2. If f′(x)=0f'(x) = 0f′(x)=0 for all x∈(a,b)x \in (a,b)x∈(a,b), then fff is constant on (a,b)(a,b)(a,b): f(x)=f(y)f(x) = f(y)f(x)=f(y) for all x,y∈(a,b)x,y \in (a,b)x,y∈(a,b).
  3. If f′(x)≤0f'(x) \le 0f′(x)≤0 for all x∈(a,b)x \in (a,b)x∈(a,b), then fff is monotone non-increasing on (a,b)(a,b)(a,b): f(y)≤f(x)f(y) \le f(x)f(y)≤f(x) whenever x,y∈(a,b)x,y \in (a,b)x,y∈(a,b) and x≤yx \le yx≤y.

No hypothesis a<ba < ba<b appears, so when (a,b)(a,b)(a,b) is empty all three conclusions hold vacuously. All statements are relative to (a,b)(a,b)(a,b) only; no continuity at the endpoints and no information about fff outside the interval is involved. The inequalities on f′f'f′ are non-strict, and the conclusions are correspondingly non-strict monotonicity.

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

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