Abstract
The classical Jordan decomposition Theorem says that any real function of bounded variation can be expressed as a difference of two increasing functions. This paper explores the effective version of Jordan decomposition. We give a sufficient and necessary condition for those computable real functions of bounded variation which can be expressed as a difference of two computable increasing functions. Using this condition, we prove further that there is a computable real function which has even a computable modulus of absolute continuity (hence is of bounded variation) but it is not a difference of any two computable increasing functions. The polynomial time version of this result holds too and this gives a negative answer to an open question of Ko in [6].
Corresponding author, email:zheng@informatik.tu-cottbus.de
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
S. K. Berberian. Fundamentals of Real Analysis. Universitext. Springer, New York, Berlin, Heidelberg, 1998.
D. Bridges. A constructive look at functions of bounded variation. Bull. London Math. Soc., 32(3):316–324, 2000.
E. Casas, K. Kunisch, and C. Pola. Some applications of bv functions in optimal control and calculus of variations. ESAIM: Proceedings, 4:83–96, 1998.
A. Grzegorczyk. On the definitions of computable real continuous functions. Fundamenta Mathematicae, 44:61–71, 1957.
C. Jordan. Cours d’analyse de l’Ecole Polytechnique. 1882–1887.
K.-I. Ko. Complexity Theory of Real Functions. Progress in Theoretical Computer Science. Birkhäuser, Boston, 1991.
M. B. Pour-El and J. I. Richards. Computability in Analysis and Physics. Perspectives in Mathematical Logic. Springer, Berlin, 1989.
R. Rettinger, X. Zheng, R. Gengler, and B. von Braunmühl. Weakly computable real numbers and total computable real functions. In Proceedings of COCOON 2001, Guilin, China, August 20–23, 2001, volume 2108 of LNCS, pages 586–595. Springer, 2001.
K. Weihrauch. Computable Analysis, An Introduction. Springer, Berlin Heidelberg, 2000.
X. Zheng, R. Rettinger, and B. von Braunmühl. On the Jordan decomposability for computable functions of bounded variation. Computer Science Reports, BTU Cottbus Report, 03/02, 2002.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zheng, X., Rettinger, R., von Braunmühl, B. (2003). On the Effective Jordan Decomposability. In: Alt, H., Habib, M. (eds) STACS 2003. STACS 2003. Lecture Notes in Computer Science, vol 2607. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36494-3_16
Download citation
DOI: https://doi.org/10.1007/3-540-36494-3_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00623-7
Online ISBN: 978-3-540-36494-8
eBook Packages: Springer Book Archive