Theorem 4.30 — monotone functions have countably many discontinuities
ProvedRudin.ch04_monotone_discontinuities_countableanalysisset-theory
If is monotone on , then the set of points of at which 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 RudinSource
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 and let be monotone non-decreasing on the open interval : for all with . Then the set
is countable (finite or countably infinite).
Continuity is taken relative to , so only the behaviour of inside the interval matters. No hypothesis is imposed: when 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
Confirmed by the mission captain (proposal self-audit).