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 .
- First let be increasing: implies . Let be the set of points of where is not continuous.
- Call an inner point if has a point and a point . Then , since is an interval.
- Let be an inner point. Apply the existence of one-sided limits to restricted to . Write and for its left and right limits at .
- That result gives .
- Claim: for each with . Choose with . Then by step 4 and monotonicity.
- In the same way, for each with .
- Claim: if is an inner point in , then . Suppose instead . Then step 4 gives .
- Let . By the definition of one-sided limits, there are with these properties. We have for with , and also for with .
- Let . Each with lies in , so by step 8.
- By the epsilon-delta form of continuity, is continuous at . This contradicts , which proves the claim of step 7.
- Let be the set of inner points in . For , the density of the rationals gives a rational with .
- Let be two points of . Put , so and . Steps 5 and 6 give .
- So . Hence is injective.
- By the rationals are countable, there is a bijection . Its inverse is injective. By composition of injections, is injective.
- A point of that is not inner is the least element or the greatest element of . So has at most two points.
- Define by for . Send the least element of to , if it lies in . Send the greatest element to , if it lies in and differs from the least.
- The map is injective, since is injective and its shifted values are at least . So is countable.
- Now let be decreasing, and put . Then is increasing. Also , so and have the same points of continuity.
- By steps 1 to 17 applied to , the set of discontinuities of is countable.
Idea
At each discontinuity inside , an increasing function jumps over an open gap between its left and right limits. Gaps at different points do not overlap, because increases between them. Picking a rational in each gap gives an injection into , and the two endpoints of 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.
- Construction of the reals from Cauchy sequences concept
- Definition by recursion concept
- Divisibility definition
- Element definition
- Integers object
- Limit point of a set definition
- Mathematical induction concept
- Natural numbers object
- Ordered field definition
- Peano axioms concept
- Proposition concept
- Rational numbers object
- Real numbers object
- Sequence definition
- Set bounded above definition
- Set definition
- Ring of integers statement
- Limit of a function definition
- Archimedean ordered field definition
- Successor function definition
- Disjunction definition
- Implication definition
- Predicate definition
- The reals form a field statement
- Real sequence definition
- Infimum definition
- Supremum definition
- Family of sets definition
- Ordered pair definition
- Continuity at a point definition
- One-sided limit definition
- Union definition
- Addition of natural numbers definition
- The rationals form a field statement
- The successor function is injective statement
- Zero is not a successor statement
- Existential quantifier definition
- Universal quantifier definition
- Bounded sequence definition
- Limit of a sequence definition
- Monotone sequence definition
- Completeness axiom statement
- Cartesian product definition
- Union of a family of sets definition
- Subset definition
- Proof of the commutativity of addition by induction proof
- Order on the natural numbers definition
- The rationals form an ordered field statement
- Uniqueness quantifier definition
- Binary relation definition
- Order on the reals definition
- Commutativity of addition statement
- Proof of strong induction from ordinary induction proof
- Antisymmetric relation definition
- Reflexive relation definition
- Transitive relation definition
- Interval definition
- Function definition
- Strong induction statement
- Preorder definition
- Proof of the epsilon-delta form of continuity proof
- Image of a set definition
- Codomain definition
- Function composition definition
- Identity function definition
- Injective function definition
- Proof of the well-ordering principle from strong induction proof
- Partial order definition
- Epsilon-delta definition of continuity statement
- Monotone function definition
- Surjective function definition
- Left inverse definition
- Right inverse definition
- Proof that a composition of injections is injective proof
- Well-ordering principle statement
- Countable set definition
- Total order definition
- Bijective function definition
- Composition of injections is injective statement
- Proof of the division algorithm proof
- Cantor pairing function example
- Countably infinite set definition
- Proof of the Schröder–Bernstein theorem proof
- Division algorithm statement
- Proof that the reals form an ordered field, with the Cauchy sequence construction proof
- Proof that a function is bijective iff it has a two-sided inverse proof
- Proof that the integers are countable proof
- Schröder–Bernstein theorem statement
- Proof that the product of countable sets is countable proof
- Bijective iff it has a two-sided inverse statement
- The reals form an ordered field statement
- The integers are countable statement
- Product of countable sets is countable statement
- Absolute value definition
- Proof of the approximation property of the supremum proof
- Proof of the existence of the infimum by negation proof
- Proof that the rationals are countable proof
- Proof of the epsilon-N definition of the limit of a sequence proof
- Approximation property of the supremum statement
- Existence of the infimum statement
- The rationals are countable statement
- Epsilon-N definition of the limit of a sequence statement
- Proof that one-sided limits of a monotone function exist proof
- Proof that the reals are Archimedean from the completeness axiom proof
- The reals are Archimedean statement
- Proof of the monotone convergence theorem for sequences proof
- Floor function definition
- Proof that there is a natural number n with 1/n below any positive epsilon proof
- Monotone convergence theorem for sequences statement
- There is a natural number n with 1/n below any positive epsilon statement
- One-sided limits of a monotone function exist statement
- Proof of the characterization of the floor proof
- Characterization of the floor statement
- Proof of the density of the rationals proof
- Density of the rationals statement
- Proof that a monotone function has countably many discontinuities proof
Where this leads
1 page builds on this one.
Further reading
- Web https://www.jirka.org/ra/html/sec_monotonefunc.html, Corollary 3.6.4
About this page
| Tag | 855HEQHXC5 |
|---|---|
| URI | m2://855HEQHXC5 |
| Kind | proof |
| Writing | W0 stub |
| MSC | 26A48 |
| Proves | A monotone function has countably many discontinuities |
| Uses | One-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 |
| Changed | 4 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.