Math 2.0

Real functions Proof

Proof that a continuous injective function on an interval is strictly monotone

Builds on Intermediate value theoremStrictly monotone functionIntervalContinuous functionInjective function

Proof

We first show that ff is monotone on any three points, using the intermediate value theorem.

  1. Let x<y<zx < y < z be points of II. Since II is an interval, [x,z]⊆I[x, z] \subseteq I. The restriction of ff to any closed subinterval of [x,z][x, z] is continuous.
  2. The values f(x)f(x), f(y)f(y), f(z)f(z) are distinct, since ff is injective.
  3. Claim: f(y)f(y) lies strictly between f(x)f(x) and f(z)f(z). Suppose not. Then f(y)f(y) is larger than both f(x)f(x) and f(z)f(z), or smaller than both.
  4. Case f(y)>f(x)f(y) > f(x) and f(y)>f(z)f(y) > f(z), with f(x)<f(z)f(x) < f(z). Then f(x)<f(z)<f(y)f(x) < f(z) < f(y). The intermediate value theorem on [x,y][x, y] gives t∈[x,y]t \in [x, y] with f(t)=f(z)f(t) = f(z). But t≤y<zt \le y < z, which contradicts injectivity.
  5. Case f(y)>f(x)f(y) > f(x) and f(y)>f(z)f(y) > f(z), with f(z)<f(x)f(z) < f(x). Then f(z)<f(x)<f(y)f(z) < f(x) < f(y). The intermediate value theorem on [y,z][y, z] gives t∈[y,z]t \in [y, z] with f(t)=f(x)f(t) = f(x). But t≥y>xt \ge y > x, which contradicts injectivity.
  6. Case f(y)f(y) smaller than both. Then −f(y)-f(y) is larger than −f(x)-f(x) and −f(z)-f(z), and −f-f is continuous and injective. Steps 4 and 5 for −f-f give a contradiction.
  7. So the claim holds. Hence f(y)−f(x)f(y) - f(x) and f(z)−f(y)f(z) - f(y) are both positive or both negative.
  8. Now let w1<w2<⋯<wmw_1 < w_2 < \cdots < w_m be finitely many points of II, with m≥2m \ge 2. Put di=f(wi+1)−f(wi)d_i = f(w_{i+1}) - f(w_i) for 1≤i<m1 \le i < m.
  9. Each did_i is nonzero by step 2. By step 7 for the triple wi<wi+1<wi+2w_i < w_{i+1} < w_{i+2}, did_i and di+1d_{i+1} have the same sign. By induction on ii, all did_i have the sign of d1d_1.
  10. If d1>0d_1 > 0, then f(w1)<f(w2)<⋯<f(wm)f(w_1) < f(w_2) < \cdots < f(w_m). If d1<0d_1 < 0, then f(w1)>⋯>f(wm)f(w_1) > \cdots > f(w_m).
  11. If II has fewer than two points, ff is strictly increasing because there is nothing to check. Otherwise fix p<qp < q in II. By step 2, f(p)<f(q)f(p) < f(q) or f(p)>f(q)f(p) > f(q).
  12. Suppose f(p)<f(q)f(p) < f(q). Let u<vu < v be points of II. List the set {p,q,u,v}\set{p, q, u, v} in increasing order as in step 8.
  13. By step 10, ff is strictly increasing on this list or strictly decreasing on it. Since p<qp < q and f(p)<f(q)f(p) < f(q), it is strictly increasing. So f(u)<f(v)f(u) < f(v).
  14. Thus ff is strictly increasing on II. If instead f(p)>f(q)f(p) > f(q), the same argument shows that ff is strictly decreasing.
  15. In both cases ff is strictly monotone.

Idea

If the middle one of three points had the largest or smallest value, the intermediate value theorem would make ff take some value twice. So ff goes the same way along any three points, and hence along any finite list of points. Comparing an arbitrary pair with one fixed pair then fixes the direction everywhere.

Reading path

To understand this page from the ground up, read these 48 pages in order. The foundations come first. The path takes the proofs Proof of the approximation property of the supremum, Proof of the epsilon-delta form of continuity, Proof that the reals form an ordered field, with the Cauchy sequence construction, Proof of the intermediate value theorem by the supremum.

  1. Construction of the reals from Cauchy sequences concept
  2. Element definition
  3. Integers object
  4. Limit point of a set definition
  5. Ordered field definition
  6. Proposition concept
  7. Rational numbers object
  8. Real numbers object
  9. Set bounded above definition
  10. Strictly monotone function definition
  11. Set definition
  12. Ring of integers statement
  13. Limit of a function definition
  14. Implication definition
  15. Predicate definition
  16. The reals form a field statement
  17. Supremum definition
  18. Ordered pair definition
  19. Continuity at a point definition
  20. The rationals form a field statement
  21. Existential quantifier definition
  22. Universal quantifier definition
  23. Completeness axiom statement
  24. Cartesian product definition
  25. Continuous function definition
  26. Subset definition
  27. The rationals form an ordered field statement
  28. Uniqueness quantifier definition
  29. Binary relation definition
  30. Order on the reals definition
  31. Antisymmetric relation definition
  32. Reflexive relation definition
  33. Transitive relation definition
  34. Interval definition
  35. Function definition
  36. Preorder definition
  37. Proof of the epsilon-delta form of continuity proof
  38. Injective function definition
  39. Partial order definition
  40. Epsilon-delta definition of continuity statement
  41. Total order definition
  42. Proof that the reals form an ordered field, with the Cauchy sequence construction proof
  43. The reals form an ordered field statement
  44. Proof of the approximation property of the supremum proof
  45. Approximation property of the supremum statement
  46. Proof of the intermediate value theorem by the supremum proof
  47. Intermediate value theorem statement
  48. Proof that a continuous injective function on an interval is strictly monotone proof

Where this leads

1 page builds on this one.

Further reading

  1. Web https://proofwiki.org/wiki/Continuous_Injection_of_Interval_is_Strictly_Monotone
About this page
TagRCGZ1YSHPJ
URIm2://RCGZ1YSHPJ
Kindproof
WritingW0 stub
MSC26A48
ProvesA continuous injective function on an interval is strictly monotone
UsesIntermediate value theorem, Strictly monotone function, Interval, Continuous function, Injective function
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)
  • a source with a locator (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.