Skip to main content

Part of the book series: Studies in Computational Intelligence ((SCI,volume 835))

Abstract

Let f be an increasing real-valued function defined on a dense subset D of an interval I. The continuity of f is investigated constructively. In particular, it is shown that for each compact interval \(\left[ a,b\right] \) which has end points in D and is contained in the interior of I,  and for each \(\varepsilon >0,\) there exist points \(x_{1},\ldots ,x_{M}\) of \(\left[ a,b\right] \) such that \(f(x^{+})-f(x^{-})<\varepsilon \) whenever \(x\in \left( a,b\right) \) and \(x\ne x_{n}\) for each n. As a consequence, there exists a sequence \((x_{n})_{n\ge 1}\) in I such that f is continuous at each point of D that is distinct from each \(x_{n}\).

For Vladik Kreinovich, on the occasion of his 65th birthday.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    Theorem 1 appears as Problem 14 on page 180 of [5], in the context of positive measures. Presumably the intended approach to its proof was to apply the preceding problem on page 180 to the Lebesgue-Stieltjes measure associated with the increasing function f. Our approach to the continuity of f does not require the full development of the measure theory underlying Bishop’s one.

  2. 2.

    Mandelkern [16] calls this notion antidecreasing.

  3. 3.

    A set S is finitely enumerable if there exist a natural number n and a mapping s of \(\left\{ 1,\ldots ,n\right\} \) onto S. Constructively, this is a weaker notion than finite, which requires the mapping s to be one-one.

References

  1. P. Aczel and M. Rathjen, Constructive Set Theory, monograph, forthcoming; preprint available at http://www1.maths.leeds.ac.uk/~rathjen/book.pdf

  2. R. Alps, D.S. Bridges, Morse Set Theory as a Foundation for Constructive Mathematics, monograph in progress (University of Canterbury, Christchurch, New Zealand, 2017)

    Google Scholar 

  3. A. Bauer, Realizability as the connection between computable and constructive mathematics, online at http://math.andrej.com/2005/08/23/realizability-as-the-connection-between-computable-and-constructive-mathematics/

  4. A. Bauer, C.A. Stone, RZ: a tool for bringing constructive and computable mathematics closer to programming practice. J. Log. Comput. 19(1), 17–43 (2009)

    Article  MathSciNet  Google Scholar 

  5. E. Bishop, Foundations of Constructive Analysis (McGraw-Hill, New York, 1967)

    MATH  Google Scholar 

  6. E. Bishop, D.S. Bridges, Constructive Analysis, Grundlehren der math. Wissenschaften 279, (Springer, Heidelberg, 1985)

    Google Scholar 

  7. D.S. Bridges, A constructive look at functions of bounded variation. Bull. London Math. Soc. 32(3), 316–324 (2000)

    Article  MathSciNet  Google Scholar 

  8. D.S. Bridges, A. Mahalanobis, Increasing, nondecreasing, and virtually continuous functions. J Autom., Lang. Comb. 6(2), 139–143 (2001)

    MathSciNet  MATH  Google Scholar 

  9. D.S. Bridges, F. Richman, Varieties of Constructive Mathematics, London Math. Soc. Lecture Notes 97, (Cambridge University Press, 1987)

    Google Scholar 

  10. D.S. Bridges, L.S. Vîţă, Techniques of Constructive Analysis (Universitext, Springer, Heidelberg, 2006)

    MATH  Google Scholar 

  11. G.S. Čeitin, Algorithmic operators in constructive complete separable metric spaces, (Russian). Doklady Aka. Nauk 128, 49–53 (1959)

    Google Scholar 

  12. R.L. Constable et al., Implementing Mathematics with the Nuprl Proof Development System (Prentice-Hall, Englewood Cliffs, New Jersey, 1986)

    Google Scholar 

  13. H. Diener, M. Hendtlass, (Seemingly) Impossible Theorems in Constructive Mathematics, submitted for publication (2017)

    Google Scholar 

  14. S. Hayashi, H. Nakano, PX: A Computational Logic (MIT Press, Cambridge MA, 1988)

    Google Scholar 

  15. G. Kreisel, D. Lacombe, J. Shoenfield, Partial recursive functions and effective operations, in Constructivity in Mathematics, Proceedings of the Colloquium at Amsterdam, 1957 ed. by A. Heyting (North-Holland, Amsterdam, 1959)

    Google Scholar 

  16. M. Mandelkern, Continuity of monotone functions. Pacific J. Math. 99(2), 413–418 (1982)

    Article  MathSciNet  Google Scholar 

  17. P. Martin-Löf, An Intuitionistic Theory of Types: Predicative Part, in Logic Colloquium 1973 ed. by H.E. Rose, J.C. Shepherdson (North-Holland, Amsterdam, 1975), pp. 73–118

    Google Scholar 

  18. J. Myhill, Constructive set theory. J. Symb. Log. 40(3), 347–382 (1975)

    Article  MathSciNet  Google Scholar 

  19. F. Richman, Constructive mathematics without choice, in Reuniting the antipodes—constructive and nonstandard views of the continuum ed. by U. Berger, H. Osswald, P.M. Schuster, Synthese Library 306, (Kluwer, 2001), pp. 199–205

    Google Scholar 

  20. H. Schwichtenberg, Program extraction in constructive analysis, in Logicism, Intuitionism, and Formalism—What has become of them? ed. by S. Lindström, E. Palmgren, K. Segerberg, V. Stoltenberg-Hansen, Synthese Library 341, (Springer, Berlin, 2009), pp. 199–205

    Google Scholar 

  21. A.S. Troelstra, D. van Dalen, Constructivism in Mathematics: An Introduction (two volumes) (North Holland, Amsterdam, 1988)

    MATH  Google Scholar 

  22. K. Weihrauch, A foundation for computable analysis, in Combinatorics, Complexity, & Logic, Proceedings of Conference in Auckland, 9–13 December 1996, ed. by D.S. Bridges, C.S. Calude, J. Gibbons, S. Reeves, I.H. Witten, (Springer, Singapore, 1996)

    Google Scholar 

  23. K. Weihrauch, Computable Analysis, EATCS Texts in Theoretical Computer Science, (Springer, Heidelberg, 2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Douglas S. Bridges .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Bridges, D.S. (2020). Constructive Continuity of Increasing Functions. In: Kosheleva, O., Shary, S., Xiang, G., Zapatrin, R. (eds) Beyond Traditional Probabilistic Data Processing Techniques: Interval, Fuzzy etc. Methods and Their Applications. Studies in Computational Intelligence, vol 835. Springer, Cham. https://doi.org/10.1007/978-3-030-31041-7_2

Download citation

Publish with us

Policies and ethics