Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 4.30 — monotone functions have countably many discontinuities

Proved
Rudin.ch04_monotone_discontinuities_countable

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

analysisset-theory

If fff is monotone on (a,b)(a,b)(a,b), then the set of points of (a,b)(a,b)(a,b) at which fff is discontinuous is at most countable.

Preamble
import Mathlib
import Definitions.Def_Rudin_ch04_continuity

open Filter Topology
Formal statement
namespace Rudin

/-- Rudin, Theorem 4.30: the set of points of `(a, b)` at which a monotone function is
discontinuous is at most countable. -/
theorem ch04_monotone_discontinuities_countable (a b : ℝ) (f : ℝ → ℝ)
    (hf : MonotoneOn f (Set.Ioo a b)) :
    {x ∈ Set.Ioo a b | ¬ ContinuousWithinAt f (Set.Ioo a b) x}.Countable := by sorry

end Rudin
Source
Walter Rudin, Principles of Mathematical Analysis, 3rd edition, McGraw-Hill, 1976, Chapter 4, p. 96, Theorem 4.30
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 monotone non-decreasing on the open interval (a,b)(a,b)(a,b): f(s)≤f(t)f(s) \le f(t)f(s)≤f(t) for all s,t∈(a,b)s,t \in (a,b)s,t∈(a,b) with s≤ts \le ts≤t. Then the set

{ x∈(a,b)  :  f is not continuous at x relative to (a,b) }\{\, x \in (a,b) \;:\; f \text{ is \textbf{not} continuous at } x \text{ relative to } (a,b) \,\}{x∈(a,b):f is not continuous at x relative to (a,b)}

is countable (finite or countably infinite).

Continuity is taken relative to (a,b)(a,b)(a,b), so only the behaviour of fff inside the interval matters. No hypothesis a<ba < ba<b is imposed: when (a,b)(a,b)(a,b) is empty the statement holds vacuously with the empty set. Only non-decreasing monotonicity is assumed; the non-increasing case is not covered by this statement.

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