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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 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.
Mandelkern [16] calls this notion antidecreasing.
- 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
P. Aczel and M. Rathjen, Constructive Set Theory, monograph, forthcoming; preprint available at http://www1.maths.leeds.ac.uk/~rathjen/book.pdf
R. Alps, D.S. Bridges, Morse Set Theory as a Foundation for Constructive Mathematics, monograph in progress (University of Canterbury, Christchurch, New Zealand, 2017)
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/
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)
E. Bishop, Foundations of Constructive Analysis (McGraw-Hill, New York, 1967)
E. Bishop, D.S. Bridges, Constructive Analysis, Grundlehren der math. Wissenschaften 279, (Springer, Heidelberg, 1985)
D.S. Bridges, A constructive look at functions of bounded variation. Bull. London Math. Soc. 32(3), 316–324 (2000)
D.S. Bridges, A. Mahalanobis, Increasing, nondecreasing, and virtually continuous functions. J Autom., Lang. Comb. 6(2), 139–143 (2001)
D.S. Bridges, F. Richman, Varieties of Constructive Mathematics, London Math. Soc. Lecture Notes 97, (Cambridge University Press, 1987)
D.S. Bridges, L.S. Vîţă, Techniques of Constructive Analysis (Universitext, Springer, Heidelberg, 2006)
G.S. Čeitin, Algorithmic operators in constructive complete separable metric spaces, (Russian). Doklady Aka. Nauk 128, 49–53 (1959)
R.L. Constable et al., Implementing Mathematics with the Nuprl Proof Development System (Prentice-Hall, Englewood Cliffs, New Jersey, 1986)
H. Diener, M. Hendtlass, (Seemingly) Impossible Theorems in Constructive Mathematics, submitted for publication (2017)
S. Hayashi, H. Nakano, PX: A Computational Logic (MIT Press, Cambridge MA, 1988)
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)
M. Mandelkern, Continuity of monotone functions. Pacific J. Math. 99(2), 413–418 (1982)
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
J. Myhill, Constructive set theory. J. Symb. Log. 40(3), 347–382 (1975)
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
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
A.S. Troelstra, D. van Dalen, Constructivism in Mathematics: An Introduction (two volumes) (North Holland, Amsterdam, 1988)
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)
K. Weihrauch, Computable Analysis, EATCS Texts in Theoretical Computer Science, (Springer, Heidelberg, 2000)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this chapter
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
DOI: https://doi.org/10.1007/978-3-030-31041-7_2
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-31040-0
Online ISBN: 978-3-030-31041-7
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)