Math 2.0

Real functions Proof

Proof that a monotone function has countably many discontinuities

Builds on One-sided limits of a monotone function existIntervalEpsilon-delta definition of continuityOne-sided limitDensity of the rationalsThe rationals are countableCountable setInjective functionComposition of injections is injective

Proof

We assign a different rational number to each discontinuity that is not an endpoint of II.

  1. First let ff be increasing: x≤yx \le y implies f(x)≤f(y)f(x) \le f(y). Let DD be the set of points of II where ff is not continuous.
  2. Call c∈Ic \in I an inner point if II has a point p<cp < c and a point q>cq > c. Then (p,q)⊆I(p, q) \subseteq I, since II is an interval.
  3. Let cc be an inner point. Apply the existence of one-sided limits to ff restricted to (p,q)(p, q). Write c−c^- and c+c^+ for its left and right limits at cc.
  4. That result gives c−=sup⁡p<x<cf(x)≤f(c)≤inf⁡c<x<qf(x)=c+c^- = \sup_{p < x < c} f(x) \le f(c) \le \inf_{c < x < q} f(x) = c^+.
  5. Claim: c+≤f(t)c^+ \le f(t) for each t∈It \in I with t>ct > c. Choose ss with c<s<min⁡(t,q)c < s < \min(t, q). Then c+≤f(s)≤f(t)c^+ \le f(s) \le f(t) by step 4 and monotonicity.
  6. In the same way, f(t)≤c−f(t) \le c^- for each t∈It \in I with t<ct < c.
  7. Claim: if cc is an inner point in DD, then c−<c+c^- < c^+. Suppose instead c−=c+c^- = c^+. Then step 4 gives c−=f(c)=c+c^- = f(c) = c^+.
  8. Let ε>0\varepsilon > 0. By the definition of one-sided limits, there are δ1,δ2>0\delta_1, \delta_2 > 0 with these properties. We have ∣f(x)−f(c)∣<ε\abs{f(x) - f(c)} < \varepsilon for x∈(p,q)x \in (p, q) with c−δ1<x<cc - \delta_1 < x < c, and also for x∈(p,q)x \in (p, q) with c<x<c+δ2c < x < c + \delta_2.
  9. Let δ=min⁡(δ1,δ2,c−p,q−c)\delta = \min(\delta_1, \delta_2, c - p, q - c). Each x∈Ix \in I with ∣x−c∣<δ\abs{x - c} < \delta lies in (p,q)(p, q), so ∣f(x)−f(c)∣<ε\abs{f(x) - f(c)} < \varepsilon by step 8.
  10. By the epsilon-delta form of continuity, ff is continuous at cc. This contradicts c∈Dc \in D, which proves the claim of step 7.
  11. Let D0D_0 be the set of inner points in DD. For c∈D0c \in D_0, the density of the rationals gives a rational r(c)r(c) with c−<r(c)<c+c^- < r(c) < c^+.
  12. Let c<ec < e be two points of D0D_0. Put t=c+e2t = \frac{c + e}{2}, so t∈It \in I and c<t<ec < t < e. Steps 5 and 6 give c+≤f(t)≤e−c^+ \le f(t) \le e^-.
  13. So r(c)<c+≤e−<r(e)r(c) < c^+ \le e^- < r(e). Hence r ⁣:D0→ℚr \colon D_0 \to \Q is injective.
  14. By the rationals are countable, there is a bijection ℕ→ℚ\N \to \Q. Its inverse j ⁣:ℚ→ℕj \colon \Q \to \N is injective. By composition of injections, φ=j∘r ⁣:D0→ℕ\varphi = j \circ r \colon D_0 \to \N is injective.
  15. A point of DD that is not inner is the least element or the greatest element of II. So D∖D0D \setminus D_0 has at most two points.
  16. Define ψ ⁣:D→ℕ\psi \colon D \to \N by ψ(c)=φ(c)+2\psi(c) = \varphi(c) + 2 for c∈D0c \in D_0. Send the least element of II to 00, if it lies in DD. Send the greatest element to 11, if it lies in DD and differs from the least.
  17. The map ψ\psi is injective, since φ\varphi is injective and its shifted values are at least 22. So DD is countable.
  18. Now let ff be decreasing, and put g=−fg = -f. Then gg is increasing. Also ∣g(x)−g(c)∣=∣f(x)−f(c)∣\abs{g(x) - g(c)} = \abs{f(x) - f(c)}, so ff and gg have the same points of continuity.
  19. By steps 1 to 17 applied to gg, the set of discontinuities of ff is countable.

Idea

At each discontinuity inside II, an increasing function jumps over an open gap between its left and right limits. Gaps at different points do not overlap, because ff increases between them. Picking a rational in each gap gives an injection into ℚ\Q, and the two endpoints of II add at most two more points.

Reading path

To understand this page from the ground up, read these 116 pages in order. The foundations come first. The path takes the proofs Proof of the approximation property of the supremum, Proof of the commutativity of addition by induction, Proof of the epsilon-delta form of continuity, Proof that there is a natural number n with 1/n below any positive epsilon, Proof that a composition of injections is injective, Proof that a function is bijective iff it has a two-sided inverse, Proof that the reals form an ordered field, with the Cauchy sequence construction, Proof that the product of countable sets is countable, Proof of the Schröder–Bernstein theorem, Proof that the integers are countable, Proof of strong induction from ordinary induction, Proof of the density of the rationals, Proof of the epsilon-N definition of the limit of a sequence, Proof of the existence of the infimum by negation, Proof that the rationals are countable, Proof that one-sided limits of a monotone function exist, Proof of the well-ordering principle from strong induction, Proof of the division algorithm, Proof that the reals are Archimedean from the completeness axiom, Proof of the monotone convergence theorem for sequences, Proof of the characterization of the floor.

  1. Construction of the reals from Cauchy sequences concept
  2. Definition by recursion concept
  3. Divisibility definition
  4. Element definition
  5. Integers object
  6. Limit point of a set definition
  7. Mathematical induction concept
  8. Natural numbers object
  9. Ordered field definition
  10. Peano axioms concept
  11. Proposition concept
  12. Rational numbers object
  13. Real numbers object
  14. Sequence definition
  15. Set bounded above definition
  16. Set definition
  17. Ring of integers statement
  18. Limit of a function definition
  19. Archimedean ordered field definition
  20. Successor function definition
  21. Disjunction definition
  22. Implication definition
  23. Predicate definition
  24. The reals form a field statement
  25. Real sequence definition
  26. Infimum definition
  27. Supremum definition
  28. Family of sets definition
  29. Ordered pair definition
  30. Continuity at a point definition
  31. One-sided limit definition
  32. Union definition
  33. Addition of natural numbers definition
  34. The rationals form a field statement
  35. The successor function is injective statement
  36. Zero is not a successor statement
  37. Existential quantifier definition
  38. Universal quantifier definition
  39. Bounded sequence definition
  40. Limit of a sequence definition
  41. Monotone sequence definition
  42. Completeness axiom statement
  43. Cartesian product definition
  44. Union of a family of sets definition
  45. Subset definition
  46. Proof of the commutativity of addition by induction proof
  47. Order on the natural numbers definition
  48. The rationals form an ordered field statement
  49. Uniqueness quantifier definition
  50. Binary relation definition
  51. Order on the reals definition
  52. Commutativity of addition statement
  53. Proof of strong induction from ordinary induction proof
  54. Antisymmetric relation definition
  55. Reflexive relation definition
  56. Transitive relation definition
  57. Interval definition
  58. Function definition
  59. Strong induction statement
  60. Preorder definition
  61. Proof of the epsilon-delta form of continuity proof
  62. Image of a set definition
  63. Codomain definition
  64. Function composition definition
  65. Identity function definition
  66. Injective function definition
  67. Proof of the well-ordering principle from strong induction proof
  68. Partial order definition
  69. Epsilon-delta definition of continuity statement
  70. Monotone function definition
  71. Surjective function definition
  72. Left inverse definition
  73. Right inverse definition
  74. Proof that a composition of injections is injective proof
  75. Well-ordering principle statement
  76. Countable set definition
  77. Total order definition
  78. Bijective function definition
  79. Composition of injections is injective statement
  80. Proof of the division algorithm proof
  81. Cantor pairing function example
  82. Countably infinite set definition
  83. Proof of the Schröder–Bernstein theorem proof
  84. Division algorithm statement
  85. Proof that the reals form an ordered field, with the Cauchy sequence construction proof
  86. Proof that a function is bijective iff it has a two-sided inverse proof
  87. Proof that the integers are countable proof
  88. Schröder–Bernstein theorem statement
  89. Proof that the product of countable sets is countable proof
  90. Bijective iff it has a two-sided inverse statement
  91. The reals form an ordered field statement
  92. The integers are countable statement
  93. Product of countable sets is countable statement
  94. Absolute value definition
  95. Proof of the approximation property of the supremum proof
  96. Proof of the existence of the infimum by negation proof
  97. Proof that the rationals are countable proof
  98. Proof of the epsilon-N definition of the limit of a sequence proof
  99. Approximation property of the supremum statement
  100. Existence of the infimum statement
  101. The rationals are countable statement
  102. Epsilon-N definition of the limit of a sequence statement
  103. Proof that one-sided limits of a monotone function exist proof
  104. Proof that the reals are Archimedean from the completeness axiom proof
  105. The reals are Archimedean statement
  106. Proof of the monotone convergence theorem for sequences proof
  107. Floor function definition
  108. Proof that there is a natural number n with 1/n below any positive epsilon proof
  109. Monotone convergence theorem for sequences statement
  110. There is a natural number n with 1/n below any positive epsilon statement
  111. One-sided limits of a monotone function exist statement
  112. Proof of the characterization of the floor proof
  113. Characterization of the floor statement
  114. Proof of the density of the rationals proof
  115. Density of the rationals statement
  116. Proof that a monotone function has countably many discontinuities proof

Where this leads

1 page builds on this one.

Further reading

  1. Web https://www.jirka.org/ra/html/sec_monotonefunc.html, Corollary 3.6.4
About this page
Tag855HEQHXC5
URIm2://855HEQHXC5
Kindproof
WritingW0 stub
MSC26A48
ProvesA monotone function has countably many discontinuities
UsesOne-sided limits of a monotone function exist, Interval, Epsilon-delta definition of continuity, One-sided limit, Density of the rationals, The rationals are countable, Countable set, Injective function, Composition of injections is injective
Changed4 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.